mutant-melbourne 2.0.1

data/ext/melbourne/lex.c.blt

@@ -0,0 +1,152 @@
+/* C code produced by gperf version 3.0.4 */
+/* Command-line: gperf -C -p -j1 -i 1 -g -o -t -N rb_reserved_word -k'1,3,$' defs/keywords  */
+
+#if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \
+      && ('%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \
+      && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \
+      && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \
+      && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \
+      && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \
+      && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \
+      && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \
+      && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \
+      && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \
+      && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \
+      && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \
+      && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \
+      && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \
+      && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \
+      && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \
+      && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \
+      && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \
+      && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \
+      && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \
+      && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \
+      && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \
+      && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126))
+/* The character set is not based on ISO-646.  */
+error "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gnu-gperf@gnu.org>."
+#endif
+
+struct kwtable {const char *name; int id[2]; enum lex_state_e state;};
+const struct kwtable *rb_reserved_word(const char *, unsigned int);
+static const struct kwtable *reserved_word(const char *, unsigned int);
+#define rb_reserved_word(str, len) reserved_word(str, len)
+struct kwtable;
+
+#define TOTAL_KEYWORDS 41
+#define MIN_WORD_LENGTH 2
+#define MAX_WORD_LENGTH 12
+#define MIN_HASH_VALUE 8
+#define MAX_HASH_VALUE 50
+/* maximum key range = 43, duplicates = 0 */
+
+static inline unsigned int hash(register const char* str, register unsigned int len)
+{
+  static const unsigned char asso_values[] =
+    {
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 26, 51, 51, 14, 51, 16,  8,
+      11, 13, 51, 51, 51, 51, 10, 51, 13, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 11, 51, 13,  1, 26,
+       4,  1,  8, 28, 51, 23, 51,  1,  1, 27,
+       5, 19, 21, 51,  8,  3,  3, 11, 51, 21,
+      24, 16, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51, 51, 51, 51, 51,
+      51, 51, 51, 51, 51, 51
+    };
+  register int hval = len;
+
+  switch (hval)
+    {
+      default:
+        hval += asso_values[(unsigned char)str[2]];
+      /*FALLTHROUGH*/
+      case 2:
+      case 1:
+        hval += asso_values[(unsigned char)str[0]];
+        break;
+    }
+  return hval + asso_values[(unsigned char)str[len - 1]];
+}
+
+const struct kwtable* rb_reserved_word(register const char* str, register unsigned int len)
+{
+  static const struct kwtable wordlist[] =
+    {
+      {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""},
+      {"break", {keyword_break, keyword_break}, EXPR_MID},
+      {"else", {keyword_else, keyword_else}, EXPR_BEG},
+      {"nil", {keyword_nil, keyword_nil}, EXPR_END},
+      {"ensure", {keyword_ensure, keyword_ensure}, EXPR_BEG},
+      {"end", {keyword_end, keyword_end}, EXPR_END},
+      {"then", {keyword_then, keyword_then}, EXPR_BEG},
+      {"not", {keyword_not, keyword_not}, EXPR_ARG},
+      {"false", {keyword_false, keyword_false}, EXPR_END},
+      {"self", {keyword_self, keyword_self}, EXPR_END},
+      {"elsif", {keyword_elsif, keyword_elsif}, EXPR_VALUE},
+      {"rescue", {keyword_rescue, modifier_rescue}, EXPR_MID},
+      {"true", {keyword_true, keyword_true}, EXPR_END},
+      {"until", {keyword_until, modifier_until}, EXPR_VALUE},
+      {"unless", {keyword_unless, modifier_unless}, EXPR_VALUE},
+      {"return", {keyword_return, keyword_return}, EXPR_MID},
+      {"def", {keyword_def, keyword_def}, EXPR_FNAME},
+      {"and", {keyword_and, keyword_and}, EXPR_VALUE},
+      {"do", {keyword_do, keyword_do}, EXPR_BEG},
+      {"yield", {keyword_yield, keyword_yield}, EXPR_ARG},
+      {"for", {keyword_for, keyword_for}, EXPR_VALUE},
+      {"undef", {keyword_undef, keyword_undef}, EXPR_FNAME},
+      {"or", {keyword_or, keyword_or}, EXPR_VALUE},
+      {"in", {keyword_in, keyword_in}, EXPR_VALUE},
+      {"when", {keyword_when, keyword_when}, EXPR_VALUE},
+      {"retry", {keyword_retry, keyword_retry}, EXPR_END},
+      {"if", {keyword_if, modifier_if}, EXPR_VALUE},
+      {"case", {keyword_case, keyword_case}, EXPR_VALUE},
+      {"redo", {keyword_redo, keyword_redo}, EXPR_END},
+      {"next", {keyword_next, keyword_next}, EXPR_MID},
+      {"super", {keyword_super, keyword_super}, EXPR_ARG},
+      {"module", {keyword_module, keyword_module}, EXPR_VALUE},
+      {"begin", {keyword_begin, keyword_begin}, EXPR_BEG},
+      {"__LINE__", {keyword__LINE__, keyword__LINE__}, EXPR_END},
+      {"__FILE__", {keyword__FILE__, keyword__FILE__}, EXPR_END},
+      {"__ENCODING__", {keyword__ENCODING__, keyword__ENCODING__}, EXPR_END},
+      {"END", {keyword_END, keyword_END}, EXPR_END},
+      {"alias", {keyword_alias, keyword_alias}, EXPR_FNAME},
+      {"BEGIN", {keyword_BEGIN, keyword_BEGIN}, EXPR_END},
+      {"defined?", {keyword_defined, keyword_defined}, EXPR_ARG},
+      {"class", {keyword_class, keyword_class}, EXPR_CLASS},
+      {""}, {""},
+      {"while", {keyword_while, modifier_while}, EXPR_VALUE}
+    };
+
+  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+    {
+      register int key = hash(str, len);
+
+      if(key <= MAX_HASH_VALUE && key >= 0)
+        {
+          register const char *s = wordlist[key].name;
+
+          if(*str == *s && !strcmp(str + 1, s + 1))
+            return &wordlist[key];
+        }
+    }
+  return 0;
+}

data/ext/melbourne/lex.c.tab

@@ -0,0 +1,136 @@
+/* C code produced by gperf version 2.7.2 */
+/* Command-line: gperf -p -j1 -i 1 -g -o -t -N rb_reserved_word -k'1,3,$' ./keywords  */
+struct kwtable {
+  int id[2];
+  enum lex_state_e state;
+  char name[16];
+};
+
+#define TOTAL_KEYWORDS 40
+#define MIN_WORD_LENGTH 2
+#define MAX_WORD_LENGTH 8
+#define MIN_HASH_VALUE 6
+#define MAX_HASH_VALUE 55
+/* maximum key range = 50, duplicates = 0 */
+
+#ifdef __GNUC__
+__inline
+#else
+#ifdef __cplusplus
+inline
+#endif
+#endif
+static unsigned int
+hash (register const char *str, register unsigned int len)
+{
+  static const unsigned char asso_values[] =
+    {
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 11, 56, 56, 36, 56,  1, 37,
+      31,  1, 56, 56, 56, 56, 29, 56,  1, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56,  1, 56, 32,  1,  2,
+       1,  1,  4, 23, 56, 17, 56, 20,  9,  2,
+       9, 26, 14, 56,  5,  1,  1, 16, 56, 21,
+      20,  9, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56
+    };
+  register int hval = len;
+
+  switch (hval)
+    {
+      default:
+      case 3:
+        hval += asso_values[(unsigned char)str[2]];
+      case 2:
+      case 1:
+        hval += asso_values[(unsigned char)str[0]];
+        break;
+    }
+  return hval + asso_values[(unsigned char)str[len - 1]];
+}
+
+#ifdef __GNUC__
+__inline
+#endif
+const struct kwtable *
+mel_reserved_word (register const char *str, register unsigned int len)
+{
+  static const struct kwtable wordlist[] =
+    {
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{kEND, kEND}, EXPR_END, "end"},
+      {{kELSE, kELSE}, EXPR_BEG, "else"},
+      {{kCASE, kCASE}, EXPR_BEG, "case"},
+      {{kENSURE, kENSURE}, EXPR_BEG, "ensure"},
+      {{kMODULE, kMODULE}, EXPR_BEG, "module"},
+      {{kELSIF, kELSIF}, EXPR_BEG, "elsif"},
+      {{kDEF, kDEF}, EXPR_FNAME, "def"},
+      {{kRESCUE, kRESCUE_MOD}, EXPR_MID, "rescue"},
+      {{kNOT, kNOT}, EXPR_BEG, "not"},
+      {{kTHEN, kTHEN}, EXPR_BEG, "then"},
+      {{kYIELD, kYIELD}, EXPR_ARG, "yield"},
+      {{kFOR, kFOR}, EXPR_BEG, "for"},
+      {{kSELF, kSELF}, EXPR_END, "self"},
+      {{kFALSE, kFALSE}, EXPR_END, "false"},
+      {{kRETRY, kRETRY}, EXPR_END, "retry"},
+      {{kRETURN, kRETURN}, EXPR_MID, "return"},
+      {{kTRUE, kTRUE}, EXPR_END, "true"},
+      {{kIF, kIF_MOD}, EXPR_BEG, "if"},
+      {{kDEFINED, kDEFINED}, EXPR_ARG, "defined?"},
+      {{kSUPER, kSUPER}, EXPR_ARG, "super"},
+      {{kUNDEF, kUNDEF}, EXPR_FNAME, "undef"},
+      {{kBREAK, kBREAK}, EXPR_MID, "break"},
+      {{kIN, kIN}, EXPR_BEG, "in"},
+      {{kDO, kDO}, EXPR_BEG, "do"},
+      {{kNIL, kNIL}, EXPR_END, "nil"},
+      {{kUNTIL, kUNTIL_MOD}, EXPR_BEG, "until"},
+      {{kUNLESS, kUNLESS_MOD}, EXPR_BEG, "unless"},
+      {{kOR, kOR}, EXPR_BEG, "or"},
+      {{kNEXT, kNEXT}, EXPR_MID, "next"},
+      {{kWHEN, kWHEN}, EXPR_BEG, "when"},
+      {{kREDO, kREDO}, EXPR_END, "redo"},
+      {{kAND, kAND}, EXPR_BEG, "and"},
+      {{kBEGIN, kBEGIN}, EXPR_BEG, "begin"},
+      {{k__LINE__, k__LINE__}, EXPR_END, "__LINE__"},
+      {{kCLASS, kCLASS}, EXPR_CLASS, "class"},
+      {{k__FILE__, k__FILE__}, EXPR_END, "__FILE__"},
+      {{klEND, klEND}, EXPR_END, "END"},
+      {{klBEGIN, klBEGIN}, EXPR_END, "BEGIN"},
+      {{kWHILE, kWHILE_MOD}, EXPR_BEG, "while"},
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{kALIAS, kALIAS}, EXPR_FNAME, "alias"}
+    };
+
+  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+    {
+      register int key = hash (str, len);
+
+      if (key <= MAX_HASH_VALUE && key >= 0)
+        {
+          register const char *s = wordlist[key].name;
+
+          if (*str == *s && !strcmp (str + 1, s + 1))
+            return &wordlist[key];
+        }
+    }
+  return 0;
+}

data/ext/melbourne/local_state.hpp

@@ -0,0 +1,43 @@
+#ifndef MEL_LOCALSTATE_HPP
+#define MEL_LOCALSTATE_HPP
+
+#include "var_table18.hpp"
+
+namespace melbourne {
+  namespace grammar18 {
+    struct LocalState {
+      LocalState* prev;
+      var_table local_vars;
+      var_table block_vars;
+
+      LocalState(LocalState* prev)
+        : prev(prev)
+        , local_vars(var_table_create())
+        , block_vars(0)
+      {}
+
+      ~LocalState() {
+        var_table_destroy(local_vars);
+        if(block_vars) {
+          var_table_destroy(block_vars);
+        }
+      }
+
+      bool blocks_p() {
+        return block_vars != NULL;
+      }
+
+      static LocalState* push(LocalState* cur) {
+        return new LocalState(cur);
+      }
+
+      static LocalState* pop(LocalState* cur) {
+        LocalState* tmp = cur->prev;
+        delete cur;
+        return tmp;
+      }
+    };
+  };
+};
+
+#endif

data/ext/melbourne/melbourne.cpp

@@ -0,0 +1,88 @@
+/* We are well-behaved citizens of the C-extension State
+ * so we let the C-API know this so it will not penalize
+ * us with unnecessary caching.
+ */
+
+#include "melbourne.hpp"
+#include "grammar18.hpp"
+#include "grammar19.hpp"
+#include "symbols.hpp"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+VALUE melbourne18_string_to_ast(VALUE self, VALUE source, VALUE name, VALUE line) {
+  StringValue(source);
+  StringValue(name);
+  bstring b_str = blk2bstr(RSTRING_PTR(source), (int)RSTRING_LEN(source));
+  VALUE result = melbourne::grammar18::string_to_ast(self,
+      RSTRING_PTR(name), b_str, FIX2INT(line));
+  bdestroy(b_str);
+
+  return result;
+}
+
+VALUE melbourne18_file_to_ast(VALUE self, VALUE fname, VALUE start) {
+  StringValue(fname);
+
+  char* c_name = RSTRING_PTR(fname);
+
+  FILE *file = fopen(c_name, "r");
+  if(file) {
+    VALUE result = melbourne::grammar18::file_to_ast(self,
+        RSTRING_PTR(fname), file, FIX2INT(start));
+    fclose(file);
+
+    return result;
+  } else {
+    rb_raise(rb_eLoadError, "%s -- %s", strerror(errno), c_name);
+  }
+}
+
+VALUE melbourne19_string_to_ast(VALUE self, VALUE source, VALUE name, VALUE line) {
+  StringValue(source);
+  StringValue(name);
+  VALUE result = melbourne::grammar19::string_to_ast(self, name, source, line);
+
+  return result;
+}
+
+VALUE melbourne19_file_to_ast(VALUE self, VALUE fname, VALUE start) {
+  StringValue(fname);
+
+  int fd = open(RSTRING_PTR(fname), O_RDONLY);
+  if(fd != -1) {
+    VALUE result = melbourne::grammar19::file_to_ast(self,
+        RSTRING_PTR(fname), fd, FIX2INT(start));
+    close(fd);
+
+    return result;
+  } else {
+    rb_raise(rb_eLoadError, "no such file to load -- %s", RSTRING_PTR(fname));
+  }
+}
+
+void Init_melbourne(void) {
+  VALUE rb_cMelbourne;
+
+  melbourne::init_symbols20();
+
+#ifndef RUBINIUS
+  VALUE rb_mRubinius = rb_const_get(rb_cObject, rb_intern("Rubinius"));
+#endif
+
+  rb_cMelbourne = rb_define_class_under(rb_mRubinius, "Melbourne", rb_cObject);
+  rb_define_method(rb_cMelbourne, "string_to_ast_18",
+      RUBY_METHOD_FUNC(melbourne18_string_to_ast), 3);
+  rb_define_method(rb_cMelbourne, "file_to_ast_18",
+      RUBY_METHOD_FUNC(melbourne18_file_to_ast), 2);
+  rb_define_method(rb_cMelbourne, "string_to_ast_19",
+      RUBY_METHOD_FUNC(melbourne19_string_to_ast), 3);
+  rb_define_method(rb_cMelbourne, "file_to_ast_19",
+      RUBY_METHOD_FUNC(melbourne19_file_to_ast), 2);
+}
+
+#ifdef __cplusplus
+}  /* extern "C" { */
+#endif

data/ext/melbourne/melbourne.hpp

@@ -0,0 +1,19 @@
+#include <stdio.h>
+#include <errno.h>
+#include <ctype.h>
+#include <string.h>
+#include <strings.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <sys/types.h>
+#ifdef HAVE_ALLOCA_H
+#include <alloca.h>
+#endif
+
+#define RSTRING_NOT_MODIFIED 1
+
+#include "ruby.h"