diff options
Diffstat (limited to 'node.h')
| -rw-r--r-- | node.h | 337 |
1 files changed, 113 insertions, 224 deletions
@@ -1,233 +1,122 @@ -/************************************************ +#ifndef RUBY_NODE_H +#define RUBY_NODE_H 1 +/********************************************************************** node.h - - $Author: matz $ - $Date: 1994/10/14 06:19:30 $ + $Author$ created at: Fri May 28 15:14:02 JST 1993 - Copyright (C) 1994 Yukihiro Matsumoto - -************************************************/ - -#ifndef NODE_H -#define NODE_H - -enum node_type { - NODE_METHOD, - NODE_FBODY, - NODE_CFUNC, - NODE_SCOPE, - NODE_BLOCK, - NODE_IF, - NODE_CASE, - NODE_WHEN, - NODE_WHILE, - NODE_WHILE2, - NODE_EXNOT, - NODE_ITER, - NODE_FOR, - NODE_PROT, - NODE_AND, - NODE_OR, - NODE_MASGN, - NODE_LASGN, - NODE_GASGN, - NODE_IASGN, - NODE_CASGN, - NODE_CALL, - NODE_CALL2, - NODE_SUPER, - NODE_ZSUPER, - NODE_ARRAY, - NODE_ZARRAY, - NODE_QLIST, - NODE_HASH, - NODE_REDO, - NODE_BREAK, - NODE_CONTINUE, - NODE_RETURN, - NODE_RETRY, - NODE_FAIL, - NODE_YIELD, - NODE_LVAR, - NODE_GVAR, - NODE_IVAR, - NODE_MVAR, - NODE_CVAR, - NODE_CONST, - NODE_LIT, - NODE_STR, - NODE_STR2, - NODE_XSTR, - NODE_XSTR2, - NODE_DREGX, - NODE_DGLOB, - NODE_ARGS, - NODE_DEFN, - NODE_DEFS, - NODE_ALIAS, - NODE_UNDEF, - NODE_CLASS, - NODE_MODULE, - NODE_INC, - NODE_DOT3, - NODE_ATTRSET, - NODE_SELF, - NODE_NIL, + 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, ...) RUBYPARSER_ATTRIBUTE_FORMAT(1, 2); +typedef struct node_buffer_elem_struct { + struct node_buffer_elem_struct *next; + long len; /* Length of nodes */ + size_t allocated; /* Total memory size of allocated buf */ + size_t used; /* Current usage of buf */ + NODE **nodes; /* Array of node pointers */ + NODE *buf[FLEX_ARY_LEN]; +} node_buffer_elem_t; + +typedef struct { + node_buffer_elem_t *head; + node_buffer_elem_t *last; +} node_buffer_list_t; + +struct node_buffer_struct { + node_buffer_list_t buffer_list; + struct rb_ast_local_table_link *local_tables; + // - id (sequence number) + // - token_type + // - text of token + // - location info + // Array, whose entry is array + rb_parser_ary_t *tokens; }; -typedef struct node { - enum node_type type; - char *src; - unsigned int line; - union { - struct node *node; - ID id; - VALUE value; - VALUE (*cfunc)(); - ID *tbl; - } u1; - union { - struct node *node; - ID id; - int argc; - } u2; - union { - struct node *node; - ID id; - int state; - struct global_entry *entry; - int cnt; - VALUE value; - } u3; -} NODE; - -#define nd_head u1.node -#define nd_last u2.node -#define nd_next u3.node - -#define nd_cond u1.node -#define nd_body u2.node -#define nd_else u3.node -#define nd_break u3.state - -#define nd_resq u2.node -#define nd_ensr u3.node - -#define nd_1st u1.node -#define nd_2nd u2.node - -#define nd_stts u1.node - -#define nd_entry u3.entry -#define nd_vid u1.id -#define nd_cflag u2.id -#define nd_cval u3.value - -#define nd_cnt u3.cnt -#define nd_tbl u1.tbl - -#define nd_var u1.node -#define nd_ibdy u2.node -#define nd_iter u3.node - -#define nd_value u2.node - -#define nd_lit u1.value - -#define nd_frml u1.node -#define nd_rest u2.argc - -#define nd_recv u1.node -#define nd_mid u2.id -#define nd_args u3.node - -#define nd_noex u1.id -#define nd_defn u3.node - -#define nd_new u2.id -#define nd_old u3.id - -#define nd_cfnc u1.cfunc -#define nd_argc u2.argc - -#define nd_cname u1.id -#define nd_super u3.id - -#define nd_modl u1.id - -#define nd_beg u1.node -#define nd_end u2.node -#define nd_state u3.state -#define nd_rval u3.node - -#define NEW_METHOD(n,x) newnode(NODE_METHOD,x,n,Qnil) -#define NEW_FBODY(n,i) newnode(NODE_FBODY,n,i,1) -#define NEW_DEFN(i,d,p) newnode(NODE_DEFN,p,i,NEW_FBODY(d,i)) -#define NEW_DEFS(r,i,d) newnode(NODE_DEFS,r,i,NEW_FBODY(d,i)) -#define NEW_CFUNC(f,c) newnode(NODE_CFUNC,f,c,Qnil) -#define NEW_RFUNC(b1,b2) NEW_SCOPE(block_append(b1,b2)) -#define NEW_SCOPE(b) newnode(NODE_SCOPE,local_tbl(),(b),local_cnt(0)) -#define NEW_BLOCK(a) newnode(NODE_BLOCK,a,Qnil,Qnil) -#define NEW_IF(c,t,e) newnode(NODE_IF,c,t,e) -#define NEW_EXNOT(c) newnode(NODE_EXNOT,c,Qnil,Qnil) -#define NEW_UNLESS(c,t,e) newnode(NODE_IF,NEW_EXNOT(c),t,e) -#define NEW_CASE(h,b) newnode(NODE_CASE,h,b,Qnil) -#define NEW_WHEN(c,t,e) newnode(NODE_WHEN,c,t,e) -#define NEW_WHILE(c,b) newnode(NODE_WHILE,c,b,Qnil) -#define NEW_UNTIL(c,b) newnode(NODE_WHILE,NEW_EXNOT(c),b,Qnil) -#define NEW_WHILE2(c,b) newnode(NODE_WHILE2,c,b,Qnil) -#define NEW_UNTIL2(c,b) newnode(NODE_WHILE2,NEW_EXNOT(c),b,Qnil) -#define NEW_FOR(v,i,b) newnode(NODE_FOR,v,b,i) -#define NEW_ITER(v,i,b) newnode(NODE_ITER,v,b,i) -#define NEW_PROT(b,ex,en) newnode(NODE_PROT,b,ex,en) -#define NEW_REDO() newnode(NODE_REDO,Qnil,Qnil,Qnil) -#define NEW_BREAK() newnode(NODE_BREAK,Qnil,Qnil,Qnil) -#define NEW_CONT() newnode(NODE_CONTINUE,Qnil,Qnil,Qnil) -#define NEW_RETRY() newnode(NODE_RETRY,Qnil,Qnil,Qnil) -#define NEW_RET(s) newnode(NODE_RETURN,s,Qnil,Qnil) -#define NEW_FAIL(s) newnode(NODE_FAIL,s,Qnil,Qnil) -#define NEW_YIELD(a) newnode(NODE_YIELD,a,Qnil,Qnil) -#define NEW_LIST(a) NEW_ARRAY(a) -#define NEW_QLIST(a) newnode(NODE_QLIST,a,Qnil,Qnil) -#define NEW_ARRAY(a) newnode(NODE_ARRAY,a,Qnil,Qnil) -#define NEW_ZARRAY() newnode(NODE_ZARRAY,Qnil,Qnil,Qnil) -#define NEW_HASH(a) newnode(NODE_HASH,a,Qnil,Qnil) -#define NEW_AND(a,b) newnode(NODE_AND,a,b,Qnil) -#define NEW_OR(a,b) newnode(NODE_OR,a,b,Qnil) -#define NEW_MASGN(l,r) newnode(NODE_MASGN,l,r,Qnil) -#define NEW_GASGN(v,val) newnode(NODE_GASGN,v,val,rb_global_entry(v)) -#define NEW_LASGN(v,val) newnode(NODE_LASGN,v,val,local_cnt(v)) -#define NEW_IASGN(v,val) newnode(NODE_IASGN,v,val,Qnil) -#define NEW_CASGN(v,val) newnode(NODE_CASGN,v,val,Qnil) -#define NEW_GVAR(v) newnode(NODE_GVAR,v,Qnil,rb_global_entry(v)) -#define NEW_LVAR(v) newnode(NODE_LVAR,v,Qnil,local_cnt(v)) -#define NEW_IVAR(v) newnode(NODE_IVAR,v,Qnil,Qnil) -#define NEW_MVAR(v) newnode(NODE_MVAR,v,Qnil,Qnil) -#define NEW_CVAR(v) newnode(NODE_CVAR,v,Qnil,Qnil) -#define NEW_LIT(l) newnode(NODE_LIT,l,Qnil,Qnil) -#define NEW_STR(s) newnode(NODE_STR,s,Qnil,Qnil) -#define NEW_STR2(s) newnode(NODE_STR2,s,Qnil,Qnil) -#define NEW_XSTR(s) newnode(NODE_XSTR,s,Qnil,Qnil) -#define NEW_XSTR2(s) newnode(NODE_XSTR2,s,Qnil,Qnil) -#define NEW_CALL(r,m,a) newnode(NODE_CALL,r,m,a) -#define NEW_CALL2(r,m,a) newnode(NODE_CALL2,r,m,a) -#define NEW_SUPER(a) newnode(NODE_SUPER,Qnil,Qnil,a) -#define NEW_ZSUPER() newnode(NODE_ZSUPER,Qnil,Qnil,Qnil) -#define NEW_ARGS(f,r) newnode(NODE_ARGS,f,r,Qnil) -#define NEW_ALIAS(n,o) newnode(NODE_ALIAS,Qnil,n,o) -#define NEW_UNDEF(i) newnode(NODE_UNDEF,Qnil,i,Qnil) -#define NEW_CLASS(n,b,s) newnode(NODE_CLASS,n,NEW_SCOPE(b),s) -#define NEW_MODULE(n,b) newnode(NODE_MODULE,n,NEW_SCOPE(b),Qnil) -#define NEW_INC(m) newnode(NODE_INC,m,Qnil,Qnil) -#define NEW_DOT3(b,e) newnode(NODE_DOT3,b,e,0) -#define NEW_ATTRSET(a) newnode(NODE_ATTRSET,a,Qnil,Qnil) -#define NEW_SELF() newnode(NODE_SELF,Qnil,Qnil,Qnil) -#define NEW_NIL() newnode(NODE_NIL,Qnil,Qnil,Qnil) - -NODE *newnode(); -VALUE rb_method_booundp(); -void freenode(); +RUBY_SYMBOL_EXPORT_BEGIN +#ifdef UNIVERSAL_PARSER +rb_ast_t *rb_ast_new(const rb_parser_config_t *config); +#else +rb_ast_t *rb_ast_new(void); #endif +size_t rb_ast_memsize(const rb_ast_t*); +void rb_ast_dispose(rb_ast_t*); +const char *ruby_node_name(int node); +void rb_node_init(NODE *n, enum node_type type); + +void rb_ast_update_references(rb_ast_t*); +void rb_ast_free(rb_ast_t*); +NODE *rb_ast_newnode(rb_ast_t*, enum node_type type, size_t size, size_t alignment); +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; +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); +enum node_type rb_node_get_type(const NODE *n); + +RUBY_SYMBOL_EXPORT_END + +#define NODE_LSHIFT (NODE_TYPESHIFT+7) +#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) + +static inline int +nd_line(const NODE *n) +{ + if (!n) return -1; + SIGNED_VALUE flags = (SIGNED_VALUE)n->flags; + return (int)(flags >> NODE_LSHIFT); +} + +static inline void +nd_set_line(NODE *n, SIGNED_VALUE l) +{ + n->flags &= ~(~(VALUE)0 << NODE_LSHIFT); + n->flags |= ((VALUE)(l & NODE_LMASK) << NODE_LSHIFT); +} + +#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1) +#define NODE_REQUIRED_KEYWORD_P(node) ((node) == 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_code_loc(n) (&RNODE(n)->nd_loc) +#define nd_first_column(n) ((int)(RNODE(n)->nd_loc.beg_pos.column)) +#define nd_set_first_column(n, v) (RNODE(n)->nd_loc.beg_pos.column = (v)) +#define nd_first_lineno(n) ((int)(RNODE(n)->nd_loc.beg_pos.lineno)) +#define nd_set_first_lineno(n, v) (RNODE(n)->nd_loc.beg_pos.lineno = (v)) +#define nd_first_loc(n) (RNODE(n)->nd_loc.beg_pos) +#define nd_set_first_loc(n, v) (nd_first_loc(n) = (v)) + +#define nd_last_column(n) ((int)(RNODE(n)->nd_loc.end_pos.column)) +#define nd_set_last_column(n, v) (RNODE(n)->nd_loc.end_pos.column = (v)) +#define nd_last_lineno(n) ((int)(RNODE(n)->nd_loc.end_pos.lineno)) +#define nd_set_last_lineno(n, v) (RNODE(n)->nd_loc.end_pos.lineno = (v)) +#define nd_last_loc(n) (RNODE(n)->nd_loc.end_pos) +#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v)) +#define nd_node_id(n) (RNODE(n)->node_id) +#define nd_set_node_id(n,id) (RNODE(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 */ |