debase-ruby_core_source 3.2.0 → 3.2.2

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/method.h

@@ -0,0 +1,254 @@
+#ifndef RUBY_METHOD_H
+#define RUBY_METHOD_H 1
+/**********************************************************************
+
+  method.h -
+
+  $Author$
+  created at: Wed Jul 15 20:02:33 2009
+
+  Copyright (C) 2009 Koichi Sasada
+
+**********************************************************************/
+
+#include "internal.h"
+#include "internal/imemo.h"
+#include "internal/compilers.h"
+#include "internal/static_assert.h"
+
+#ifndef END_OF_ENUMERATION
+# if defined(__GNUC__) &&! defined(__STRICT_ANSI__)
+#   define END_OF_ENUMERATION(key)
+# else
+#   define END_OF_ENUMERATION(key) END_OF_##key##_PLACEHOLDER = 0
+# endif
+#endif
+
+/* cref */
+
+typedef enum {
+    METHOD_VISI_UNDEF     = 0x00,
+    METHOD_VISI_PUBLIC    = 0x01,
+    METHOD_VISI_PRIVATE   = 0x02,
+    METHOD_VISI_PROTECTED = 0x03,
+
+    METHOD_VISI_MASK = 0x03
+} rb_method_visibility_t;
+
+typedef struct rb_scope_visi_struct {
+    BITFIELD(rb_method_visibility_t, method_visi, 3);
+    unsigned int module_func : 1;
+} rb_scope_visibility_t;
+
+/*! CREF (Class REFerence) */
+typedef struct rb_cref_struct {
+    VALUE flags;
+    VALUE refinements;
+    VALUE klass_or_self;
+    struct rb_cref_struct * next;
+    const rb_scope_visibility_t scope_visi;
+} rb_cref_t;
+
+/* method data type */
+
+typedef struct rb_method_entry_struct {
+    VALUE flags;
+    VALUE defined_class;
+    struct rb_method_definition_struct * const def;
+    ID called_id;
+    VALUE owner;
+} rb_method_entry_t;
+
+typedef struct rb_callable_method_entry_struct { /* same fields with rb_method_entry_t */
+    VALUE flags;
+    const VALUE defined_class;
+    struct rb_method_definition_struct * const def;
+    ID called_id;
+    const VALUE owner;
+} rb_callable_method_entry_t;
+
+#define METHOD_ENTRY_VISI(me)  (rb_method_visibility_t)(((me)->flags & (IMEMO_FL_USER0 | IMEMO_FL_USER1)) >> (IMEMO_FL_USHIFT+0))
+#define METHOD_ENTRY_BASIC(me) (int)                   (((me)->flags & (IMEMO_FL_USER2                 )) >> (IMEMO_FL_USHIFT+2))
+#define METHOD_ENTRY_COMPLEMENTED(me)        ((me)->flags & IMEMO_FL_USER3)
+#define METHOD_ENTRY_COMPLEMENTED_SET(me)    ((me)->flags |= IMEMO_FL_USER3)
+#define METHOD_ENTRY_CACHED(me)              ((me)->flags & IMEMO_FL_USER4)
+#define METHOD_ENTRY_CACHED_SET(me)          ((me)->flags |= IMEMO_FL_USER4)
+#define METHOD_ENTRY_INVALIDATED(me)         ((me)->flags & IMEMO_FL_USER5)
+#define METHOD_ENTRY_INVALIDATED_SET(me)     ((me)->flags |= IMEMO_FL_USER5)
+
+static inline void
+METHOD_ENTRY_VISI_SET(rb_method_entry_t *me, rb_method_visibility_t visi)
+{
+    VM_ASSERT((int)visi >= 0 && visi <= 3);
+    me->flags = (me->flags & ~(IMEMO_FL_USER0 | IMEMO_FL_USER1)) | (visi << (IMEMO_FL_USHIFT+0));
+}
+static inline void
+METHOD_ENTRY_BASIC_SET(rb_method_entry_t *me, unsigned int basic)
+{
+    VM_ASSERT(basic <= 1);
+    me->flags = (me->flags & ~(IMEMO_FL_USER2                 )) | (basic << (IMEMO_FL_USHIFT+2));
+}
+static inline void
+METHOD_ENTRY_FLAGS_SET(rb_method_entry_t *me, rb_method_visibility_t visi, unsigned int basic)
+{
+    VM_ASSERT((int)visi >= 0 && visi <= 3);
+    VM_ASSERT(basic <= 1);
+    me->flags =
+      (me->flags & ~(IMEMO_FL_USER0|IMEMO_FL_USER1|IMEMO_FL_USER2)) |
+        ((visi << (IMEMO_FL_USHIFT+0)) | (basic << (IMEMO_FL_USHIFT+2)));
+}
+static inline void
+METHOD_ENTRY_FLAGS_COPY(rb_method_entry_t *dst, const rb_method_entry_t *src)
+{
+    dst->flags =
+      (dst->flags & ~(IMEMO_FL_USER0|IMEMO_FL_USER1|IMEMO_FL_USER2)) |
+        (src->flags & (IMEMO_FL_USER0|IMEMO_FL_USER1|IMEMO_FL_USER2));
+}
+
+typedef enum {
+    VM_METHOD_TYPE_ISEQ,      /*!< Ruby method */
+    VM_METHOD_TYPE_CFUNC,     /*!< C method */
+    VM_METHOD_TYPE_ATTRSET,   /*!< attr_writer or attr_accessor */
+    VM_METHOD_TYPE_IVAR,      /*!< attr_reader or attr_accessor */
+    VM_METHOD_TYPE_BMETHOD,
+    VM_METHOD_TYPE_ZSUPER,
+    VM_METHOD_TYPE_ALIAS,
+    VM_METHOD_TYPE_UNDEF,
+    VM_METHOD_TYPE_NOTIMPLEMENTED,
+    VM_METHOD_TYPE_OPTIMIZED, /*!< Kernel#send, Proc#call, etc */
+    VM_METHOD_TYPE_MISSING,   /*!< wrapper for method_missing(id) */
+    VM_METHOD_TYPE_REFINED,   /*!< refinement */
+
+    END_OF_ENUMERATION(VM_METHOD_TYPE)
+} rb_method_type_t;
+#define VM_METHOD_TYPE_MINIMUM_BITS 4
+STATIC_ASSERT(VM_METHOD_TYPE_MINIMUM_BITS,
+              VM_METHOD_TYPE_REFINED <= (1<<VM_METHOD_TYPE_MINIMUM_BITS));
+
+#ifndef rb_iseq_t
+typedef struct rb_iseq_struct rb_iseq_t;
+#define rb_iseq_t rb_iseq_t
+#endif
+
+typedef struct rb_method_iseq_struct {
+    const rb_iseq_t * iseqptr; /*!< iseq pointer, should be separated from iseqval */
+    rb_cref_t * cref;          /*!< class reference, should be marked */
+} rb_method_iseq_t; /* check rb_add_method_iseq() when modify the fields */
+
+typedef struct rb_method_cfunc_struct {
+    VALUE (*func)(ANYARGS);
+    VALUE (*invoker)(VALUE recv, int argc, const VALUE *argv, VALUE (*func)(ANYARGS));
+    int argc;
+} rb_method_cfunc_t;
+
+typedef struct rb_method_attr_struct {
+    ID id;
+    VALUE location; /* should be marked */
+} rb_method_attr_t;
+
+typedef struct rb_method_alias_struct {
+    struct rb_method_entry_struct * original_me; /* original_me->klass is original owner */
+} rb_method_alias_t;
+
+typedef struct rb_method_refined_struct {
+    struct rb_method_entry_struct * orig_me;
+    VALUE owner;
+} rb_method_refined_t;
+
+typedef struct rb_method_bmethod_struct {
+    VALUE proc; /* should be marked */
+    struct rb_hook_list_struct *hooks;
+    VALUE defined_ractor;
+} rb_method_bmethod_t;
+
+enum method_optimized_type {
+    OPTIMIZED_METHOD_TYPE_SEND,
+    OPTIMIZED_METHOD_TYPE_CALL,
+    OPTIMIZED_METHOD_TYPE_BLOCK_CALL,
+    OPTIMIZED_METHOD_TYPE_STRUCT_AREF,
+    OPTIMIZED_METHOD_TYPE_STRUCT_ASET,
+    OPTIMIZED_METHOD_TYPE__MAX
+};
+
+typedef struct rb_method_optimized {
+    enum method_optimized_type type;
+    unsigned int index;
+} rb_method_optimized_t;
+
+struct rb_method_definition_struct {
+    BITFIELD(rb_method_type_t, type, VM_METHOD_TYPE_MINIMUM_BITS);
+    unsigned int iseq_overload: 1;
+    int alias_count : 27;
+    int complemented_count : 28;
+    unsigned int no_redef_warning: 1;
+
+    union {
+        rb_method_iseq_t iseq;
+        rb_method_cfunc_t cfunc;
+        rb_method_attr_t attr;
+        rb_method_alias_t alias;
+        rb_method_refined_t refined;
+        rb_method_bmethod_t bmethod;
+        rb_method_optimized_t optimized;
+    } body;
+
+    ID original_id;
+    uintptr_t method_serial;
+};
+
+struct rb_id_table;
+
+typedef struct rb_method_definition_struct rb_method_definition_t;
+STATIC_ASSERT(sizeof_method_def, offsetof(rb_method_definition_t, body)==8);
+
+#define UNDEFINED_METHOD_ENTRY_P(me) (!(me) || !(me)->def || (me)->def->type == VM_METHOD_TYPE_UNDEF)
+#define UNDEFINED_REFINED_METHOD_P(def) \
+    ((def)->type == VM_METHOD_TYPE_REFINED && \
+     UNDEFINED_METHOD_ENTRY_P((def)->body.refined.orig_me))
+
+void rb_add_method(VALUE klass, ID mid, rb_method_type_t type, void *option, rb_method_visibility_t visi);
+void rb_add_method_cfunc(VALUE klass, ID mid, VALUE (*func)(ANYARGS), int argc, rb_method_visibility_t visi);
+void rb_add_method_iseq(VALUE klass, ID mid, const rb_iseq_t *iseq, rb_cref_t *cref, rb_method_visibility_t visi);
+void rb_add_method_optimized(VALUE klass, ID mid, enum method_optimized_type, unsigned int index, rb_method_visibility_t visi);
+void rb_add_refined_method_entry(VALUE refined_class, ID mid);
+
+rb_method_entry_t *rb_method_entry_set(VALUE klass, ID mid, const rb_method_entry_t *, rb_method_visibility_t noex);
+rb_method_entry_t *rb_method_entry_create(ID called_id, VALUE klass, rb_method_visibility_t visi, const rb_method_definition_t *def);
+
+const rb_method_entry_t *rb_method_entry_at(VALUE obj, ID id);
+
+const rb_method_entry_t *rb_method_entry(VALUE klass, ID id);
+const rb_method_entry_t *rb_method_entry_with_refinements(VALUE klass, ID id, VALUE *defined_class);
+const rb_method_entry_t *rb_method_entry_without_refinements(VALUE klass, ID id, VALUE *defined_class);
+const rb_method_entry_t *rb_resolve_refined_method(VALUE refinements, const rb_method_entry_t *me);
+RUBY_SYMBOL_EXPORT_BEGIN
+const rb_method_entry_t *rb_resolve_me_location(const rb_method_entry_t *, VALUE[5]);
+RUBY_SYMBOL_EXPORT_END
+
+const rb_callable_method_entry_t *rb_callable_method_entry(VALUE klass, ID id);
+const rb_callable_method_entry_t *rb_callable_method_entry_or_negative(VALUE klass, ID id);
+const rb_callable_method_entry_t *rb_callable_method_entry_with_refinements(VALUE klass, ID id, VALUE *defined_class);
+const rb_callable_method_entry_t *rb_callable_method_entry_without_refinements(VALUE klass, ID id, VALUE *defined_class);
+
+int rb_method_entry_arity(const rb_method_entry_t *me);
+int rb_method_entry_eq(const rb_method_entry_t *m1, const rb_method_entry_t *m2);
+st_index_t rb_hash_method_entry(st_index_t hash, const rb_method_entry_t *me);
+
+VALUE rb_method_entry_location(const rb_method_entry_t *me);
+
+void rb_free_method_entry(const rb_method_entry_t *me);
+
+const rb_method_entry_t *rb_method_entry_clone(const rb_method_entry_t *me);
+const rb_callable_method_entry_t *rb_method_entry_complement_defined_class(const rb_method_entry_t *src_me, ID called_id, VALUE defined_class);
+void rb_method_entry_copy(rb_method_entry_t *dst, const rb_method_entry_t *src);
+
+void rb_method_table_insert(VALUE klass, struct rb_id_table *table, ID method_id, const rb_method_entry_t *me);
+
+void rb_scope_visibility_set(rb_method_visibility_t);
+
+VALUE rb_unnamed_parameters(int arity);
+
+void rb_clear_method_cache(VALUE klass_or_module, ID mid);
+void rb_clear_all_refinement_method_cache(void);
+
+#endif /* RUBY_METHOD_H */

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/node.h

@@ -0,0 +1,125 @@
+#ifndef RUBY_NODE_H
+#define RUBY_NODE_H 1
+/**********************************************************************
+
+  node.h -
+
+  $Author$
+  created at: Fri May 28 15:14:02 JST 1993
+
+  Copyright (C) 1993-2007 Yukihiro Matsumoto
+
+**********************************************************************/
+
+#include <stdbool.h>
+#include "rubyparser.h"
+#include "ruby/backward/2/attributes.h"
+
+typedef void (*bug_report_func)(const char *fmt, ...);
+
+typedef struct node_buffer_elem_struct {
+    struct node_buffer_elem_struct *next;
+    long len;
+    NODE buf[FLEX_ARY_LEN];
+} node_buffer_elem_t;
+
+typedef struct {
+    long idx, len;
+    node_buffer_elem_t *head;
+    node_buffer_elem_t *last;
+} node_buffer_list_t;
+
+struct node_buffer_struct {
+    node_buffer_list_t unmarkable;
+    node_buffer_list_t markable;
+    struct rb_ast_local_table_link *local_tables;
+    VALUE mark_hash;
+    // - id (sequence number)
+    // - token_type
+    // - text of token
+    // - location info
+    // Array, whose entry is array
+    VALUE tokens;
+#ifdef UNIVERSAL_PARSER
+    rb_parser_config_t *config;
+#endif
+};
+
+RUBY_SYMBOL_EXPORT_BEGIN
+
+#ifdef UNIVERSAL_PARSER
+rb_ast_t *rb_ast_new(rb_parser_config_t *config);
+#else
+rb_ast_t *rb_ast_new();
+#endif
+size_t rb_ast_memsize(const rb_ast_t*);
+void rb_ast_dispose(rb_ast_t*);
+VALUE rb_ast_tokens(rb_ast_t *ast);
+#if RUBY_DEBUG
+void rb_ast_node_type_change(NODE *n, enum node_type type);
+#endif
+const char *ruby_node_name(int node);
+void rb_node_init(NODE *n, enum node_type type, VALUE a0, VALUE a1, VALUE a2);
+
+void rb_ast_mark(rb_ast_t*);
+void rb_ast_update_references(rb_ast_t*);
+void rb_ast_free(rb_ast_t*);
+void rb_ast_add_mark_object(rb_ast_t*, VALUE);
+void rb_ast_set_tokens(rb_ast_t*, VALUE);
+NODE *rb_ast_newnode(rb_ast_t*, enum node_type type);
+void rb_ast_delete_node(rb_ast_t*, NODE *n);
+rb_ast_id_table_t *rb_ast_new_local_table(rb_ast_t*, int);
+rb_ast_id_table_t *rb_ast_resize_latest_local_table(rb_ast_t*, int);
+
+VALUE rb_parser_dump_tree(const NODE *node, int comment);
+
+const struct kwtable *rb_reserved_word(const char *, unsigned int);
+
+struct parser_params;
+void *rb_parser_malloc(struct parser_params *, size_t);
+void *rb_parser_realloc(struct parser_params *, void *, size_t);
+void *rb_parser_calloc(struct parser_params *, size_t, size_t);
+void rb_parser_free(struct parser_params *, void *);
+PRINTF_ARGS(void rb_parser_printf(struct parser_params *parser, const char *fmt, ...), 2, 3);
+VALUE rb_node_set_type(NODE *n, enum node_type t);
+
+RUBY_SYMBOL_EXPORT_END
+
+#define NODE_LSHIFT (NODE_TYPESHIFT+7)
+#define NODE_LMASK  (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
+
+#define nd_line(n) (int)(((SIGNED_VALUE)(n)->flags)>>NODE_LSHIFT)
+#define nd_set_line(n,l) \
+    (n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
+
+
+#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1)
+#define NODE_REQUIRED_KEYWORD_P(node) ((node)->nd_value == NODE_SPECIAL_REQUIRED_KEYWORD)
+#define NODE_SPECIAL_NO_NAME_REST     ((NODE *)-1)
+#define NODE_NAMED_REST_P(node) ((node) != NODE_SPECIAL_NO_NAME_REST)
+#define NODE_SPECIAL_EXCESSIVE_COMMA   ((ID)1)
+#define NODE_SPECIAL_NO_REST_KEYWORD   ((NODE *)-1)
+
+#define nd_first_column(n) ((int)((n)->nd_loc.beg_pos.column))
+#define nd_set_first_column(n, v) ((n)->nd_loc.beg_pos.column = (v))
+#define nd_first_lineno(n) ((int)((n)->nd_loc.beg_pos.lineno))
+#define nd_set_first_lineno(n, v) ((n)->nd_loc.beg_pos.lineno = (v))
+#define nd_first_loc(n) ((n)->nd_loc.beg_pos)
+#define nd_set_first_loc(n, v) (nd_first_loc(n) = (v))
+
+#define nd_last_column(n) ((int)((n)->nd_loc.end_pos.column))
+#define nd_set_last_column(n, v) ((n)->nd_loc.end_pos.column = (v))
+#define nd_last_lineno(n) ((int)((n)->nd_loc.end_pos.lineno))
+#define nd_set_last_lineno(n, v) ((n)->nd_loc.end_pos.lineno = (v))
+#define nd_last_loc(n) ((n)->nd_loc.end_pos)
+#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v))
+#define nd_node_id(n) ((n)->node_id)
+#define nd_set_node_id(n,id) ((n)->node_id = (id))
+
+static inline bool
+nd_type_p(const NODE *n, enum node_type t)
+{
+    return (enum node_type)nd_type(n) == t;
+}
+
+#endif /* RUBY_NODE_H */

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/node_name.inc

@@ -0,0 +1,210 @@
+      case NODE_SCOPE:
+	return "NODE_SCOPE";
+      case NODE_BLOCK:
+	return "NODE_BLOCK";
+      case NODE_IF:
+	return "NODE_IF";
+      case NODE_UNLESS:
+	return "NODE_UNLESS";
+      case NODE_CASE:
+	return "NODE_CASE";
+      case NODE_CASE2:
+	return "NODE_CASE2";
+      case NODE_CASE3:
+	return "NODE_CASE3";
+      case NODE_WHEN:
+	return "NODE_WHEN";
+      case NODE_IN:
+	return "NODE_IN";
+      case NODE_WHILE:
+	return "NODE_WHILE";
+      case NODE_UNTIL:
+	return "NODE_UNTIL";
+      case NODE_ITER:
+	return "NODE_ITER";
+      case NODE_FOR:
+	return "NODE_FOR";
+      case NODE_FOR_MASGN:
+	return "NODE_FOR_MASGN";
+      case NODE_BREAK:
+	return "NODE_BREAK";
+      case NODE_NEXT:
+	return "NODE_NEXT";
+      case NODE_REDO:
+	return "NODE_REDO";
+      case NODE_RETRY:
+	return "NODE_RETRY";
+      case NODE_BEGIN:
+	return "NODE_BEGIN";
+      case NODE_RESCUE:
+	return "NODE_RESCUE";
+      case NODE_RESBODY:
+	return "NODE_RESBODY";
+      case NODE_ENSURE:
+	return "NODE_ENSURE";
+      case NODE_AND:
+	return "NODE_AND";
+      case NODE_OR:
+	return "NODE_OR";
+      case NODE_MASGN:
+	return "NODE_MASGN";
+      case NODE_LASGN:
+	return "NODE_LASGN";
+      case NODE_DASGN:
+	return "NODE_DASGN";
+      case NODE_GASGN:
+	return "NODE_GASGN";
+      case NODE_IASGN:
+	return "NODE_IASGN";
+      case NODE_CDECL:
+	return "NODE_CDECL";
+      case NODE_CVASGN:
+	return "NODE_CVASGN";
+      case NODE_OP_ASGN1:
+	return "NODE_OP_ASGN1";
+      case NODE_OP_ASGN2:
+	return "NODE_OP_ASGN2";
+      case NODE_OP_ASGN_AND:
+	return "NODE_OP_ASGN_AND";
+      case NODE_OP_ASGN_OR:
+	return "NODE_OP_ASGN_OR";
+      case NODE_OP_CDECL:
+	return "NODE_OP_CDECL";
+      case NODE_CALL:
+	return "NODE_CALL";
+      case NODE_OPCALL:
+	return "NODE_OPCALL";
+      case NODE_FCALL:
+	return "NODE_FCALL";
+      case NODE_VCALL:
+	return "NODE_VCALL";
+      case NODE_QCALL:
+	return "NODE_QCALL";
+      case NODE_SUPER:
+	return "NODE_SUPER";
+      case NODE_ZSUPER:
+	return "NODE_ZSUPER";
+      case NODE_LIST:
+	return "NODE_LIST";
+      case NODE_ZLIST:
+	return "NODE_ZLIST";
+      case NODE_VALUES:
+	return "NODE_VALUES";
+      case NODE_HASH:
+	return "NODE_HASH";
+      case NODE_RETURN:
+	return "NODE_RETURN";
+      case NODE_YIELD:
+	return "NODE_YIELD";
+      case NODE_LVAR:
+	return "NODE_LVAR";
+      case NODE_DVAR:
+	return "NODE_DVAR";
+      case NODE_GVAR:
+	return "NODE_GVAR";
+      case NODE_IVAR:
+	return "NODE_IVAR";
+      case NODE_CONST:
+	return "NODE_CONST";
+      case NODE_CVAR:
+	return "NODE_CVAR";
+      case NODE_NTH_REF:
+	return "NODE_NTH_REF";
+      case NODE_BACK_REF:
+	return "NODE_BACK_REF";
+      case NODE_MATCH:
+	return "NODE_MATCH";
+      case NODE_MATCH2:
+	return "NODE_MATCH2";
+      case NODE_MATCH3:
+	return "NODE_MATCH3";
+      case NODE_LIT:
+	return "NODE_LIT";
+      case NODE_STR:
+	return "NODE_STR";
+      case NODE_DSTR:
+	return "NODE_DSTR";
+      case NODE_XSTR:
+	return "NODE_XSTR";
+      case NODE_DXSTR:
+	return "NODE_DXSTR";
+      case NODE_EVSTR:
+	return "NODE_EVSTR";
+      case NODE_DREGX:
+	return "NODE_DREGX";
+      case NODE_ONCE:
+	return "NODE_ONCE";
+      case NODE_ARGS:
+	return "NODE_ARGS";
+      case NODE_ARGS_AUX:
+	return "NODE_ARGS_AUX";
+      case NODE_OPT_ARG:
+	return "NODE_OPT_ARG";
+      case NODE_KW_ARG:
+	return "NODE_KW_ARG";
+      case NODE_POSTARG:
+	return "NODE_POSTARG";
+      case NODE_ARGSCAT:
+	return "NODE_ARGSCAT";
+      case NODE_ARGSPUSH:
+	return "NODE_ARGSPUSH";
+      case NODE_SPLAT:
+	return "NODE_SPLAT";
+      case NODE_BLOCK_PASS:
+	return "NODE_BLOCK_PASS";
+      case NODE_DEFN:
+	return "NODE_DEFN";
+      case NODE_DEFS:
+	return "NODE_DEFS";
+      case NODE_ALIAS:
+	return "NODE_ALIAS";
+      case NODE_VALIAS:
+	return "NODE_VALIAS";
+      case NODE_UNDEF:
+	return "NODE_UNDEF";
+      case NODE_CLASS:
+	return "NODE_CLASS";
+      case NODE_MODULE:
+	return "NODE_MODULE";
+      case NODE_SCLASS:
+	return "NODE_SCLASS";
+      case NODE_COLON2:
+	return "NODE_COLON2";
+      case NODE_COLON3:
+	return "NODE_COLON3";
+      case NODE_DOT2:
+	return "NODE_DOT2";
+      case NODE_DOT3:
+	return "NODE_DOT3";
+      case NODE_FLIP2:
+	return "NODE_FLIP2";
+      case NODE_FLIP3:
+	return "NODE_FLIP3";
+      case NODE_SELF:
+	return "NODE_SELF";
+      case NODE_NIL:
+	return "NODE_NIL";
+      case NODE_TRUE:
+	return "NODE_TRUE";
+      case NODE_FALSE:
+	return "NODE_FALSE";
+      case NODE_ERRINFO:
+	return "NODE_ERRINFO";
+      case NODE_DEFINED:
+	return "NODE_DEFINED";
+      case NODE_POSTEXE:
+	return "NODE_POSTEXE";
+      case NODE_DSYM:
+	return "NODE_DSYM";
+      case NODE_ATTRASGN:
+	return "NODE_ATTRASGN";
+      case NODE_LAMBDA:
+	return "NODE_LAMBDA";
+      case NODE_ARYPTN:
+	return "NODE_ARYPTN";
+      case NODE_HSHPTN:
+	return "NODE_HSHPTN";
+      case NODE_FNDPTN:
+	return "NODE_FNDPTN";
+      case NODE_ERROR:
+	return "NODE_ERROR";