15#if defined(__cplusplus)
149typedef struct RNode {
176#define RNODE(obj) (R_CAST(RNode)(obj))
183#define NODE_FL_NEWLINE (((VALUE)1)<<7)
185#define NODE_TYPESHIFT 8
186#define NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT)
188#define nd_type(n) ((int) (((n)->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT))
189#define nd_set_type(n,t) \
190 (n)->flags=(((n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK))
192#define NODE_LSHIFT (NODE_TYPESHIFT+7)
193#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
194#define nd_line(n) (int)(((SIGNED_VALUE)(n)->flags)>>NODE_LSHIFT)
195#define nd_set_line(n,l) \
196 (n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
198#define nd_first_column(n) ((int)((n)->nd_loc.beg_pos.column))
199#define nd_set_first_column(n, v) ((n)->nd_loc.beg_pos.column = (v))
200#define nd_first_lineno(n) ((int)((n)->nd_loc.beg_pos.lineno))
201#define nd_set_first_lineno(n, v) ((n)->nd_loc.beg_pos.lineno = (v))
202#define nd_first_loc(n) ((n)->nd_loc.beg_pos)
203#define nd_set_first_loc(n, v) (nd_first_loc(n) = (v))
205#define nd_last_column(n) ((int)((n)->nd_loc.end_pos.column))
206#define nd_set_last_column(n, v) ((n)->nd_loc.end_pos.column = (v))
207#define nd_last_lineno(n) ((int)((n)->nd_loc.end_pos.lineno))
208#define nd_set_last_lineno(n, v) ((n)->nd_loc.end_pos.lineno = (v))
209#define nd_last_loc(n) ((n)->nd_loc.end_pos)
210#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v))
211#define nd_node_id(n) ((n)->node_id)
212#define nd_set_node_id(n,id) ((n)->node_id = (id))
214#define nd_head u1.node
215#define nd_alen u2.argc
216#define nd_next u3.node
218#define nd_cond u1.node
219#define nd_body u2.node
220#define nd_else u3.node
222#define nd_resq u2.node
223#define nd_ensr u3.node
225#define nd_1st u1.node
226#define nd_2nd u2.node
228#define nd_stts u1.node
230#define nd_entry u3.entry
232#define nd_cflag u2.id
233#define nd_cval u3.value
238#define nd_var u1.node
239#define nd_iter u3.node
241#define nd_value u2.node
244#define nd_lit u1.value
247#define nd_opt u1.node
249#define nd_plen u2.argc
251#define nd_recv u1.node
253#define nd_args u3.node
254#define nd_ainfo u3.args
256#define nd_defn u3.node
258#define nd_cpath u1.node
259#define nd_super u3.node
261#define nd_beg u1.node
262#define nd_end u2.node
263#define nd_state u3.state
264#define nd_rval u2.value
266#define nd_nth u2.argc
270#define nd_alias u1.id
272#define nd_undef u2.node
274#define nd_brace u2.argc
276#define nd_pconst u1.node
277#define nd_pkwargs u2.node
278#define nd_pkwrestarg u3.node
280#define nd_apinfo u3.apinfo
282#define NEW_NODE(t,a0,a1,a2,loc) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2),loc)
283#define NEW_NODE_WITH_LOCALS(t,a1,a2,loc) node_newnode_with_locals(p, (t),(VALUE)(a1),(VALUE)(a2),loc)
285#define NEW_DEFN(i,a,d,loc) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d,loc),loc)
286#define NEW_DEFS(r,i,a,d,loc) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d,loc),loc)
287#define NEW_SCOPE(a,b,loc) NEW_NODE_WITH_LOCALS(NODE_SCOPE,b,a,loc)
288#define NEW_BLOCK(a,loc) NEW_NODE(NODE_BLOCK,a,0,0,loc)
289#define NEW_IF(c,t,e,loc) NEW_NODE(NODE_IF,c,t,e,loc)
290#define NEW_UNLESS(c,t,e,loc) NEW_NODE(NODE_UNLESS,c,t,e,loc)
291#define NEW_CASE(h,b,loc) NEW_NODE(NODE_CASE,h,b,0,loc)
292#define NEW_CASE2(b,loc) NEW_NODE(NODE_CASE2,0,b,0,loc)
293#define NEW_CASE3(h,b,loc) NEW_NODE(NODE_CASE3,h,b,0,loc)
294#define NEW_WHEN(c,t,e,loc) NEW_NODE(NODE_WHEN,c,t,e,loc)
295#define NEW_IN(c,t,e,loc) NEW_NODE(NODE_IN,c,t,e,loc)
296#define NEW_WHILE(c,b,n,loc) NEW_NODE(NODE_WHILE,c,b,n,loc)
297#define NEW_UNTIL(c,b,n,loc) NEW_NODE(NODE_UNTIL,c,b,n,loc)
298#define NEW_FOR(i,b,loc) NEW_NODE(NODE_FOR,0,b,i,loc)
299#define NEW_FOR_MASGN(v,loc) NEW_NODE(NODE_FOR_MASGN,v,0,0,loc)
300#define NEW_ITER(a,b,loc) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b,loc),0,loc)
301#define NEW_LAMBDA(a,b,loc) NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b,loc),0,loc)
302#define NEW_BREAK(s,loc) NEW_NODE(NODE_BREAK,s,0,0,loc)
303#define NEW_NEXT(s,loc) NEW_NODE(NODE_NEXT,s,0,0,loc)
304#define NEW_REDO(loc) NEW_NODE(NODE_REDO,0,0,0,loc)
305#define NEW_RETRY(loc) NEW_NODE(NODE_RETRY,0,0,0,loc)
306#define NEW_BEGIN(b,loc) NEW_NODE(NODE_BEGIN,0,b,0,loc)
307#define NEW_RESCUE(b,res,e,loc) NEW_NODE(NODE_RESCUE,b,res,e,loc)
308#define NEW_RESBODY(a,ex,n,loc) NEW_NODE(NODE_RESBODY,n,ex,a,loc)
309#define NEW_ENSURE(b,en,loc) NEW_NODE(NODE_ENSURE,b,0,en,loc)
310#define NEW_RETURN(s,loc) NEW_NODE(NODE_RETURN,s,0,0,loc)
311#define NEW_YIELD(a,loc) NEW_NODE(NODE_YIELD,a,0,0,loc)
312#define NEW_LIST(a,loc) NEW_NODE(NODE_LIST,a,1,0,loc)
313#define NEW_ZLIST(loc) NEW_NODE(NODE_ZLIST,0,0,0,loc)
314#define NEW_HASH(a,loc) NEW_NODE(NODE_HASH,a,0,0,loc)
315#define NEW_MASGN(l,r,loc) NEW_NODE(NODE_MASGN,l,0,r,loc)
316#define NEW_GASGN(v,val,loc) NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v),loc)
317#define NEW_LASGN(v,val,loc) NEW_NODE(NODE_LASGN,v,val,0,loc)
318#define NEW_DASGN(v,val,loc) NEW_NODE(NODE_DASGN,v,val,0,loc)
319#define NEW_DASGN_CURR(v,val,loc) NEW_NODE(NODE_DASGN_CURR,v,val,0,loc)
320#define NEW_IASGN(v,val,loc) NEW_NODE(NODE_IASGN,v,val,0,loc)
321#define NEW_CDECL(v,val,path,loc) NEW_NODE(NODE_CDECL,v,val,path,loc)
322#define NEW_CVASGN(v,val,loc) NEW_NODE(NODE_CVASGN,v,val,0,loc)
323#define NEW_OP_ASGN1(p,id,a,loc) NEW_NODE(NODE_OP_ASGN1,p,id,a,loc)
324#define NEW_OP_ASGN2(r,t,i,o,val,loc) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t,loc),loc)
325#define NEW_OP_ASGN22(i,o,t,loc) NEW_NODE(NODE_OP_ASGN2,i,o,t,loc)
326#define NEW_OP_ASGN_OR(i,val,loc) NEW_NODE(NODE_OP_ASGN_OR,i,val,0,loc)
327#define NEW_OP_ASGN_AND(i,val,loc) NEW_NODE(NODE_OP_ASGN_AND,i,val,0,loc)
328#define NEW_OP_CDECL(v,op,val,loc) NEW_NODE(NODE_OP_CDECL,v,val,op,loc)
329#define NEW_GVAR(v,loc) NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v),loc)
330#define NEW_LVAR(v,loc) NEW_NODE(NODE_LVAR,v,0,0,loc)
331#define NEW_DVAR(v,loc) NEW_NODE(NODE_DVAR,v,0,0,loc)
332#define NEW_IVAR(v,loc) NEW_NODE(NODE_IVAR,v,0,0,loc)
333#define NEW_CONST(v,loc) NEW_NODE(NODE_CONST,v,0,0,loc)
334#define NEW_CVAR(v,loc) NEW_NODE(NODE_CVAR,v,0,0,loc)
335#define NEW_NTH_REF(n,loc) NEW_NODE(NODE_NTH_REF,0,n,0,loc)
336#define NEW_BACK_REF(n,loc) NEW_NODE(NODE_BACK_REF,0,n,0,loc)
337#define NEW_MATCH(c,loc) NEW_NODE(NODE_MATCH,c,0,0,loc)
338#define NEW_MATCH2(n1,n2,loc) NEW_NODE(NODE_MATCH2,n1,n2,0,loc)
339#define NEW_MATCH3(r,n2,loc) NEW_NODE(NODE_MATCH3,r,n2,0,loc)
340#define NEW_LIT(l,loc) NEW_NODE(NODE_LIT,l,0,0,loc)
341#define NEW_STR(s,loc) NEW_NODE(NODE_STR,s,0,0,loc)
342#define NEW_DSTR(s,loc) NEW_NODE(NODE_DSTR,s,1,0,loc)
343#define NEW_XSTR(s,loc) NEW_NODE(NODE_XSTR,s,0,0,loc)
344#define NEW_DXSTR(s,loc) NEW_NODE(NODE_DXSTR,s,0,0,loc)
345#define NEW_DSYM(s,loc) NEW_NODE(NODE_DSYM,s,0,0,loc)
346#define NEW_EVSTR(n,loc) NEW_NODE(NODE_EVSTR,0,(n),0,loc)
347#define NEW_CALL(r,m,a,loc) NEW_NODE(NODE_CALL,r,m,a,loc)
348#define NEW_OPCALL(r,m,a,loc) NEW_NODE(NODE_OPCALL,r,m,a,loc)
349#define NEW_FCALL(m,a,loc) NEW_NODE(NODE_FCALL,0,m,a,loc)
350#define NEW_VCALL(m,loc) NEW_NODE(NODE_VCALL,0,m,0,loc)
351#define NEW_SUPER(a,loc) NEW_NODE(NODE_SUPER,0,0,a,loc)
352#define NEW_ZSUPER(loc) NEW_NODE(NODE_ZSUPER,0,0,0,loc)
353#define NEW_ARGS_AUX(r,b,loc) NEW_NODE(NODE_ARGS_AUX,r,b,0,loc)
354#define NEW_OPT_ARG(i,v,loc) NEW_NODE(NODE_OPT_ARG,i,v,0,loc)
355#define NEW_KW_ARG(i,v,loc) NEW_NODE(NODE_KW_ARG,i,v,0,loc)
356#define NEW_POSTARG(i,v,loc) NEW_NODE(NODE_POSTARG,i,v,0,loc)
357#define NEW_ARGSCAT(a,b,loc) NEW_NODE(NODE_ARGSCAT,a,b,0,loc)
358#define NEW_ARGSPUSH(a,b,loc) NEW_NODE(NODE_ARGSPUSH,a,b,0,loc)
359#define NEW_SPLAT(a,loc) NEW_NODE(NODE_SPLAT,a,0,0,loc)
360#define NEW_BLOCK_PASS(b,loc) NEW_NODE(NODE_BLOCK_PASS,0,b,0,loc)
361#define NEW_ALIAS(n,o,loc) NEW_NODE(NODE_ALIAS,n,o,0,loc)
362#define NEW_VALIAS(n,o,loc) NEW_NODE(NODE_VALIAS,n,o,0,loc)
363#define NEW_UNDEF(i,loc) NEW_NODE(NODE_UNDEF,0,i,0,loc)
364#define NEW_CLASS(n,b,s,loc) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b,loc),(s),loc)
365#define NEW_SCLASS(r,b,loc) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b,loc),0,loc)
366#define NEW_MODULE(n,b,loc) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b,loc),0,loc)
367#define NEW_COLON2(c,i,loc) NEW_NODE(NODE_COLON2,c,i,0,loc)
368#define NEW_COLON3(i,loc) NEW_NODE(NODE_COLON3,0,i,0,loc)
369#define NEW_DOT2(b,e,loc) NEW_NODE(NODE_DOT2,b,e,0,loc)
370#define NEW_DOT3(b,e,loc) NEW_NODE(NODE_DOT3,b,e,0,loc)
371#define NEW_SELF(loc) NEW_NODE(NODE_SELF,0,0,1,loc)
372#define NEW_NIL(loc) NEW_NODE(NODE_NIL,0,0,0,loc)
373#define NEW_TRUE(loc) NEW_NODE(NODE_TRUE,0,0,0,loc)
374#define NEW_FALSE(loc) NEW_NODE(NODE_FALSE,0,0,0,loc)
375#define NEW_ERRINFO(loc) NEW_NODE(NODE_ERRINFO,0,0,0,loc)
376#define NEW_DEFINED(e,loc) NEW_NODE(NODE_DEFINED,e,0,0,loc)
377#define NEW_PREEXE(b,loc) NEW_SCOPE(b,loc)
378#define NEW_POSTEXE(b,loc) NEW_NODE(NODE_POSTEXE,0,b,0,loc)
379#define NEW_ATTRASGN(r,m,a,loc) NEW_NODE(NODE_ATTRASGN,r,m,a,loc)
381#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1)
382#define NODE_REQUIRED_KEYWORD_P(node) ((node)->nd_value == NODE_SPECIAL_REQUIRED_KEYWORD)
383#define NODE_SPECIAL_NO_NAME_REST ((NODE *)-1)
384#define NODE_NAMED_REST_P(node) ((node) != NODE_SPECIAL_NO_NAME_REST)
385#define NODE_SPECIAL_EXCESSIVE_COMMA ((ID)1)
386#define NODE_SPECIAL_NO_REST_KEYWORD ((NODE *)-1)
470#if defined(__cplusplus)
VALUE type(ANYARGS)
ANYARGS-ed function type.
unsigned char buf[MIME_BUF_SIZE]
struct rb_code_location_struct rb_code_location_t
VALUE rb_parser_encoding(VALUE)
void rb_ast_dispose(rb_ast_t *)
rb_ast_t * rb_parser_compile_file_path(VALUE vparser, VALUE fname, VALUE input, int line)
void rb_node_init(NODE *n, enum node_type type, VALUE a0, VALUE a1, VALUE a2)
VALUE rb_parser_dump_tree(const NODE *node, int comment)
struct rb_ast_struct rb_ast_t
void rb_parser_free(struct parser_params *, void *)
NODE * rb_ast_newnode(rb_ast_t *, enum node_type type)
VALUE rb_parser_new(void)
void * rb_parser_malloc(struct parser_params *, size_t)
void * rb_parser_calloc(struct parser_params *, size_t, size_t)
PRINTF_ARGS(void rb_parser_printf(struct parser_params *parser, const char *fmt,...), 2, 3)
rb_ast_t * rb_ast_new(void)
void rb_ast_free(rb_ast_t *)
struct rb_ast_body_struct rb_ast_body_t
VALUE rb_parser_end_seen_p(VALUE)
struct rb_code_position_struct rb_code_position_t
void rb_ast_add_mark_object(rb_ast_t *, VALUE)
void rb_ast_mark(rb_ast_t *)
void rb_ast_update_references(rb_ast_t *)
void rb_parser_set_options(VALUE, int, int, int, int)
VALUE rb_node_case_when_optimizable_literal(const NODE *const node)
VALUE rb_parser_set_yydebug(VALUE, VALUE)
const char * ruby_node_name(int node)
void rb_ast_add_local_table(rb_ast_t *, ID *buf)
size_t rb_ast_memsize(const rb_ast_t *)
rb_ast_t * rb_parser_compile_generic(VALUE vparser, VALUE(*lex_gets)(VALUE, int), VALUE fname, VALUE input, int line)
rb_ast_t * rb_parser_compile_string(VALUE, const char *, VALUE, int)
const struct kwtable * rb_reserved_word(const char *, unsigned int)
rb_ast_t * rb_parser_compile_string_path(VALUE vparser, VALUE fname, VALUE src, int line)
void rb_ast_delete_node(rb_ast_t *, NODE *n)
void * rb_parser_realloc(struct parser_params *, void *, size_t)
rb_code_location_t nd_loc
struct rb_args_info * args
struct rb_ary_pattern_info * apinfo
struct rb_global_entry * entry
unsigned int ruby2_keywords
node_buffer_t * node_buffer
rb_code_position_t beg_pos
rb_code_position_t end_pos