mutant-melbourne 2.0.1

data/ext/melbourne/var_table18.cpp

@@ -0,0 +1,83 @@
+#include <vector>
+#include <stdlib.h>
+#include <assert.h>
+
+#include "melbourne.hpp"
+#include "var_table18.hpp"
+
+namespace melbourne {
+
+  namespace grammar18 {
+
+    struct var_table_t {
+      struct var_table_t *next;
+      std::vector<quark> *quarks;
+    };
+
+    var_table var_table_create() {
+      var_table vt = ALLOC(struct var_table_t);
+      vt->quarks = new std::vector<quark>();
+      vt->next = NULL;
+      return vt;
+    }
+
+    void var_table_destroy(var_table vt) {
+      while (vt) {
+        var_table cur = vt;
+        delete cur->quarks;
+        vt = vt->next;
+        free(cur);
+      }
+    }
+
+    var_table var_table_push(var_table cur) {
+      var_table vt = var_table_create();
+      vt->next = cur;
+      return vt;
+    }
+
+    var_table var_table_pop(var_table cur) {
+      var_table nw = NULL;
+
+      if(cur) {
+        delete cur->quarks;
+        nw = cur->next;
+        free(cur);
+      }
+      return nw;
+    }
+
+    int var_table_find(const var_table tbl, const quark needle) {
+      for(size_t i = 0; i < tbl->quarks->size(); i++) {
+        if(tbl->quarks->at(i) == needle) return (int)i;
+      }
+      return -1;
+    }
+
+    int var_table_find_chained(const var_table tbl, const quark needle) {
+      for(size_t i = 0; i < tbl->quarks->size(); i++) {
+        if(tbl->quarks->at(i) == needle) return (int)i;
+      }
+
+      if(tbl->next) {
+        return var_table_find_chained(tbl->next, needle);
+      }
+      return -1;
+    }
+
+    int var_table_add(var_table tbl, const quark item) {
+      tbl->quarks->push_back(item);
+      return (int)tbl->quarks->size();
+    }
+
+    int var_table_size(const var_table tbl)
+    {
+      return (int)tbl->quarks->size();
+    }
+
+    quark var_table_get(const var_table tbl, const int index)
+    {
+      return tbl->quarks->at(index);
+    }
+  };
+};

data/ext/melbourne/var_table18.hpp

@@ -0,0 +1,33 @@
+#ifndef MEL_VAR_TABLE18_HPP
+#define MEL_VAR_TABLE18_HPP
+
+#include "quark.hpp"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+namespace melbourne {
+  namespace grammar18 {
+    struct var_table_t;
+    typedef struct var_table_t *var_table;
+
+    var_table var_table_create();
+    void var_table_destroy(var_table vt);
+    var_table var_table_push(var_table cur);
+    var_table var_table_pop(var_table cur);
+    int var_table_find(const var_table tbl, const quark needle);
+    int var_table_find_chained(const var_table tbl, const quark needle);
+
+    int var_table_add(var_table tbl, const quark item);
+    int var_table_size(const var_table tbl);
+    quark var_table_get(const var_table tbl, const int index);
+  };
+};
+
+#ifdef __cplusplus
+}  /* extern "C" { */
+#endif
+
+#endif

data/ext/melbourne/var_table19.cpp

@@ -0,0 +1,65 @@
+#include "melbourne.hpp"
+#include "var_table19.hpp"
+
+namespace melbourne {
+  namespace grammar19 {
+    int vtable_size(const struct vtable* tbl) {
+      if(tbl) {
+        return tbl->pos;
+      } else {
+        return 0;
+      }
+    }
+
+    struct vtable* vtable_alloc(struct vtable *prev) {
+      struct vtable *tbl = ALLOC(struct vtable);
+      tbl->pos = 0;
+      tbl->capa = 8;
+      tbl->tbl = ALLOC_N(ID, tbl->capa);
+      tbl->prev = prev;
+      return tbl;
+    }
+
+    void vtable_free(struct vtable* tbl) {
+      if(tbl) {
+        if(tbl->tbl) {
+          xfree(tbl->tbl);
+        }
+        xfree(tbl);
+      }
+    }
+
+    void vtable_add(struct vtable* tbl, ID id) {
+      if(!tbl) {
+        rb_bug("vtable_add: vtable is not allocated (%p)", (void *)tbl);
+      }
+
+      if(tbl->pos == tbl->capa) {
+        tbl->capa = tbl->capa * 2;
+        REALLOC_N(tbl->tbl, ID, tbl->capa);
+      }
+      tbl->tbl[tbl->pos++] = id;
+    }
+
+    bool vtable_included(const struct vtable* tbl, ID id) {
+      if(tbl) {
+        for(int i = 0; i < tbl->pos; i++) {
+          if(tbl->tbl[i] == id) {
+            return true;
+          }
+        }
+      }
+      return false;
+    }
+
+    void local_vars_free(struct local_vars* vars) {
+      struct local_vars* prev;
+      for(struct local_vars* local = vars; local; local = prev) {
+        if(local->args) xfree(local->args);
+        if(local->vars) xfree(local->vars);
+        prev = local->prev;
+        xfree(local);
+      }
+    }
+  };
+};

data/ext/melbourne/var_table19.hpp

@@ -0,0 +1,35 @@
+#ifndef MEL_VAR_TABLE19_HPP
+#define MEL_VAR_TABLE19_HPP
+
+// We must use MRI's xfree for ALLOC'd memory.
+#ifdef RUBINIUS
+#undef xfree
+#define xfree free
+#endif
+
+namespace melbourne {
+  namespace grammar19 {
+    struct vtable {
+      ID *tbl;
+      int pos;
+      int capa;
+      struct vtable *prev;
+    };
+
+    struct local_vars {
+      struct vtable *args;
+      struct vtable *vars;
+      struct local_vars *prev;
+    };
+
+    int vtable_size(const struct vtable* tbl);
+    struct vtable* vtable_alloc(struct vtable *prev);
+    void vtable_free(struct vtable* tbl);
+    void vtable_add(struct vtable* tbl, ID id);
+    bool vtable_included(const struct vtable* tbl, ID id);
+
+    void local_vars_free(struct local_vars* vars);
+  };
+};
+
+#endif