Ruby
2.5.0dev(2017-10-22revision60238)
|
Go to the source code of this file.
Data Structures | |
struct | RNode |
struct | rb_args_info |
Macros | |
#define | NODE_SCOPE NODE_SCOPE |
#define | NODE_BLOCK NODE_BLOCK |
#define | NODE_IF NODE_IF |
#define | NODE_UNLESS NODE_UNLESS |
#define | NODE_CASE NODE_CASE |
#define | NODE_WHEN NODE_WHEN |
#define | NODE_OPT_N NODE_OPT_N |
#define | NODE_WHILE NODE_WHILE |
#define | NODE_UNTIL NODE_UNTIL |
#define | NODE_ITER NODE_ITER |
#define | NODE_FOR NODE_FOR |
#define | NODE_BREAK NODE_BREAK |
#define | NODE_NEXT NODE_NEXT |
#define | NODE_REDO NODE_REDO |
#define | NODE_RETRY NODE_RETRY |
#define | NODE_BEGIN NODE_BEGIN |
#define | NODE_RESCUE NODE_RESCUE |
#define | NODE_RESBODY NODE_RESBODY |
#define | NODE_ENSURE NODE_ENSURE |
#define | NODE_AND NODE_AND |
#define | NODE_OR NODE_OR |
#define | NODE_MASGN NODE_MASGN |
#define | NODE_LASGN NODE_LASGN |
#define | NODE_DASGN NODE_DASGN |
#define | NODE_DASGN_CURR NODE_DASGN_CURR |
#define | NODE_GASGN NODE_GASGN |
#define | NODE_IASGN NODE_IASGN |
#define | NODE_CDECL NODE_CDECL |
#define | NODE_CVASGN NODE_CVASGN |
#define | NODE_OP_ASGN1 NODE_OP_ASGN1 |
#define | NODE_OP_ASGN2 NODE_OP_ASGN2 |
#define | NODE_OP_ASGN_AND NODE_OP_ASGN_AND |
#define | NODE_OP_ASGN_OR NODE_OP_ASGN_OR |
#define | NODE_OP_CDECL NODE_OP_CDECL |
#define | NODE_CALL NODE_CALL |
#define | NODE_OPCALL NODE_OPCALL |
#define | NODE_FCALL NODE_FCALL |
#define | NODE_VCALL NODE_VCALL |
#define | NODE_QCALL NODE_QCALL |
#define | NODE_SUPER NODE_SUPER |
#define | NODE_ZSUPER NODE_ZSUPER |
#define | NODE_ARRAY NODE_ARRAY |
#define | NODE_ZARRAY NODE_ZARRAY |
#define | NODE_VALUES NODE_VALUES |
#define | NODE_HASH NODE_HASH |
#define | NODE_RETURN NODE_RETURN |
#define | NODE_YIELD NODE_YIELD |
#define | NODE_LVAR NODE_LVAR |
#define | NODE_DVAR NODE_DVAR |
#define | NODE_GVAR NODE_GVAR |
#define | NODE_IVAR NODE_IVAR |
#define | NODE_CONST NODE_CONST |
#define | NODE_CVAR NODE_CVAR |
#define | NODE_NTH_REF NODE_NTH_REF |
#define | NODE_BACK_REF NODE_BACK_REF |
#define | NODE_MATCH NODE_MATCH |
#define | NODE_MATCH2 NODE_MATCH2 |
#define | NODE_MATCH3 NODE_MATCH3 |
#define | NODE_LIT NODE_LIT |
#define | NODE_STR NODE_STR |
#define | NODE_DSTR NODE_DSTR |
#define | NODE_XSTR NODE_XSTR |
#define | NODE_DXSTR NODE_DXSTR |
#define | NODE_EVSTR NODE_EVSTR |
#define | NODE_DREGX NODE_DREGX |
#define | NODE_DREGX_ONCE NODE_DREGX_ONCE |
#define | NODE_ARGS NODE_ARGS |
#define | NODE_ARGS_AUX NODE_ARGS_AUX |
#define | NODE_OPT_ARG NODE_OPT_ARG |
#define | NODE_KW_ARG NODE_KW_ARG |
#define | NODE_POSTARG NODE_POSTARG |
#define | NODE_ARGSCAT NODE_ARGSCAT |
#define | NODE_ARGSPUSH NODE_ARGSPUSH |
#define | NODE_SPLAT NODE_SPLAT |
#define | NODE_TO_ARY NODE_TO_ARY |
#define | NODE_BLOCK_ARG NODE_BLOCK_ARG |
#define | NODE_BLOCK_PASS NODE_BLOCK_PASS |
#define | NODE_DEFN NODE_DEFN |
#define | NODE_DEFS NODE_DEFS |
#define | NODE_ALIAS NODE_ALIAS |
#define | NODE_VALIAS NODE_VALIAS |
#define | NODE_UNDEF NODE_UNDEF |
#define | NODE_CLASS NODE_CLASS |
#define | NODE_MODULE NODE_MODULE |
#define | NODE_SCLASS NODE_SCLASS |
#define | NODE_COLON2 NODE_COLON2 |
#define | NODE_COLON3 NODE_COLON3 |
#define | NODE_DOT2 NODE_DOT2 |
#define | NODE_DOT3 NODE_DOT3 |
#define | NODE_FLIP2 NODE_FLIP2 |
#define | NODE_FLIP3 NODE_FLIP3 |
#define | NODE_SELF NODE_SELF |
#define | NODE_NIL NODE_NIL |
#define | NODE_TRUE NODE_TRUE |
#define | NODE_FALSE NODE_FALSE |
#define | NODE_ERRINFO NODE_ERRINFO |
#define | NODE_DEFINED NODE_DEFINED |
#define | NODE_POSTEXE NODE_POSTEXE |
#define | NODE_BMETHOD NODE_BMETHOD |
#define | NODE_DSYM NODE_DSYM |
#define | NODE_ATTRASGN NODE_ATTRASGN |
#define | NODE_PRELUDE NODE_PRELUDE |
#define | NODE_LAMBDA NODE_LAMBDA |
#define | NODE_LAST NODE_LAST |
#define | RNODE(obj) (R_CAST(RNode)(obj)) |
#define | NODE_FL_NEWLINE (((VALUE)1)<<7) |
#define | NODE_TYPESHIFT 8 |
#define | NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT) |
#define | nd_type(n) ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
#define | nd_set_type(n, t) RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
#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)RNODE(n)->flags)>>NODE_LSHIFT) |
#define | nd_set_line(n, l) RNODE(n)->flags=((RNODE(n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT)) |
#define | nd_column(n) (int)(RNODE(n)->nd_reserved) |
#define | nd_set_column(n, v) (RNODE(n)->nd_reserved=v) |
#define | nd_head u1.node |
#define | nd_alen u2.argc |
#define | nd_next u3.node |
#define | nd_cond u1.node |
#define | nd_body u2.node |
#define | nd_else u3.node |
#define | nd_orig u3.value |
#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_oid u1.id |
#define | nd_cnt u3.cnt |
#define | nd_tbl u1.tbl |
#define | nd_var u1.node |
#define | nd_iter u3.node |
#define | nd_value u2.node |
#define | nd_aid u3.id |
#define | nd_lit u1.value |
#define | nd_frml u2.argc |
#define | nd_rest u1.id |
#define | nd_opt u1.node |
#define | nd_pid u1.id |
#define | nd_plen u2.argc |
#define | nd_recv u1.node |
#define | nd_mid u2.id |
#define | nd_args u3.node |
#define | nd_ainfo u3.args |
#define | nd_noex u3.id |
#define | nd_defn u3.node |
#define | nd_cfnc u1.cfunc |
#define | nd_argc u2.argc |
#define | nd_cpath u1.node |
#define | nd_super u3.node |
#define | nd_modl u1.id |
#define | nd_clss_ u1.value |
#define | nd_beg u1.node |
#define | nd_end u2.node |
#define | nd_state u3.state |
#define | nd_rval u2.value |
#define | nd_nth u2.argc |
#define | nd_tag u1.id |
#define | nd_tval u2.value |
#define | nd_visi_ u2.argc |
#define | NEW_NODE(t, a0, a1, a2) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2)) |
#define | NEW_DEFN(i, a, d, p) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d)) |
#define | NEW_DEFS(r, i, a, d) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d)) |
#define | NEW_SCOPE(a, b) NEW_NODE(NODE_SCOPE,local_tbl(),b,a) |
#define | NEW_BLOCK(a) NEW_NODE(NODE_BLOCK,a,0,0) |
#define | NEW_IF(c, t, e) NEW_NODE(NODE_IF,c,t,e) |
#define | NEW_UNLESS(c, t, e) NEW_NODE(NODE_UNLESS,c,t,e) |
#define | NEW_CASE(h, b) NEW_NODE(NODE_CASE,h,b,0) |
#define | NEW_WHEN(c, t, e) NEW_NODE(NODE_WHEN,c,t,e) |
#define | NEW_OPT_N(b) NEW_NODE(NODE_OPT_N,0,b,0) |
#define | NEW_WHILE(c, b, n) NEW_NODE(NODE_WHILE,c,b,n) |
#define | NEW_UNTIL(c, b, n) NEW_NODE(NODE_UNTIL,c,b,n) |
#define | NEW_FOR(v, i, b) NEW_NODE(NODE_FOR,v,b,i) |
#define | NEW_ITER(a, b) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0) |
#define | NEW_LAMBDA(a, b) NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0) |
#define | NEW_BREAK(s) NEW_NODE(NODE_BREAK,s,0,0) |
#define | NEW_NEXT(s) NEW_NODE(NODE_NEXT,s,0,0) |
#define | NEW_REDO() NEW_NODE(NODE_REDO,0,0,0) |
#define | NEW_RETRY() NEW_NODE(NODE_RETRY,0,0,0) |
#define | NEW_BEGIN(b) NEW_NODE(NODE_BEGIN,0,b,0) |
#define | NEW_RESCUE(b, res, e) NEW_NODE(NODE_RESCUE,b,res,e) |
#define | NEW_RESBODY(a, ex, n) NEW_NODE(NODE_RESBODY,n,ex,a) |
#define | NEW_ENSURE(b, en) NEW_NODE(NODE_ENSURE,b,0,en) |
#define | NEW_RETURN(s) NEW_NODE(NODE_RETURN,s,0,0) |
#define | NEW_YIELD(a) NEW_NODE(NODE_YIELD,a,0,0) |
#define | NEW_LIST(a) NEW_ARRAY(a) |
#define | NEW_ARRAY(a) NEW_NODE(NODE_ARRAY,a,1,0) |
#define | NEW_ZARRAY() NEW_NODE(NODE_ZARRAY,0,0,0) |
#define | NEW_HASH(a) NEW_NODE(NODE_HASH,a,0,0) |
#define | NEW_MASGN(l, r) NEW_NODE(NODE_MASGN,l,0,r) |
#define | NEW_GASGN(v, val) NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v)) |
#define | NEW_LASGN(v, val) NEW_NODE(NODE_LASGN,v,val,0) |
#define | NEW_DASGN(v, val) NEW_NODE(NODE_DASGN,v,val,0) |
#define | NEW_DASGN_CURR(v, val) NEW_NODE(NODE_DASGN_CURR,v,val,0) |
#define | NEW_IASGN(v, val) NEW_NODE(NODE_IASGN,v,val,0) |
#define | NEW_CDECL(v, val, path) NEW_NODE(NODE_CDECL,v,val,path) |
#define | NEW_CVASGN(v, val) NEW_NODE(NODE_CVASGN,v,val,0) |
#define | NEW_OP_ASGN1(p, id, a) NEW_NODE(NODE_OP_ASGN1,p,id,a) |
#define | NEW_OP_ASGN2(r, t, i, o, val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t)) |
#define | NEW_OP_ASGN22(i, o, t) NEW_NODE(NODE_OP_ASGN2,i,o,t) |
#define | NEW_OP_ASGN_OR(i, val) NEW_NODE(NODE_OP_ASGN_OR,i,val,0) |
#define | NEW_OP_ASGN_AND(i, val) NEW_NODE(NODE_OP_ASGN_AND,i,val,0) |
#define | NEW_OP_CDECL(v, op, val) NEW_NODE(NODE_OP_CDECL,v,val,op) |
#define | NEW_GVAR(v) NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v)) |
#define | NEW_LVAR(v) NEW_NODE(NODE_LVAR,v,0,0) |
#define | NEW_DVAR(v) NEW_NODE(NODE_DVAR,v,0,0) |
#define | NEW_IVAR(v) NEW_NODE(NODE_IVAR,v,0,0) |
#define | NEW_CONST(v) NEW_NODE(NODE_CONST,v,0,0) |
#define | NEW_CVAR(v) NEW_NODE(NODE_CVAR,v,0,0) |
#define | NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,0) |
#define | NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,0) |
#define | NEW_MATCH(c) NEW_NODE(NODE_MATCH,c,0,0) |
#define | NEW_MATCH2(n1, n2) NEW_NODE(NODE_MATCH2,n1,n2,0) |
#define | NEW_MATCH3(r, n2) NEW_NODE(NODE_MATCH3,r,n2,0) |
#define | NEW_LIT(l) NEW_NODE(NODE_LIT,l,0,0) |
#define | NEW_STR(s) NEW_NODE(NODE_STR,s,0,0) |
#define | NEW_DSTR(s) NEW_NODE(NODE_DSTR,s,1,0) |
#define | NEW_XSTR(s) NEW_NODE(NODE_XSTR,s,0,0) |
#define | NEW_DXSTR(s) NEW_NODE(NODE_DXSTR,s,0,0) |
#define | NEW_DSYM(s) NEW_NODE(NODE_DSYM,s,0,0) |
#define | NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0) |
#define | NEW_CALL(r, m, a) NEW_NODE(NODE_CALL,r,m,a) |
#define | NEW_OPCALL(r, m, a) NEW_NODE(NODE_OPCALL,r,m,a) |
#define | NEW_FCALL(m, a) NEW_NODE(NODE_FCALL,0,m,a) |
#define | NEW_VCALL(m) NEW_NODE(NODE_VCALL,0,m,0) |
#define | NEW_SUPER(a) NEW_NODE(NODE_SUPER,0,0,a) |
#define | NEW_ZSUPER() NEW_NODE(NODE_ZSUPER,0,0,0) |
#define | NEW_ARGS_AUX(r, b) NEW_NODE(NODE_ARGS_AUX,r,b,0) |
#define | NEW_OPT_ARG(i, v) NEW_NODE(NODE_OPT_ARG,i,v,0) |
#define | NEW_KW_ARG(i, v) NEW_NODE(NODE_KW_ARG,i,v,0) |
#define | NEW_POSTARG(i, v) NEW_NODE(NODE_POSTARG,i,v,0) |
#define | NEW_ARGSCAT(a, b) NEW_NODE(NODE_ARGSCAT,a,b,0) |
#define | NEW_ARGSPUSH(a, b) NEW_NODE(NODE_ARGSPUSH,a,b,0) |
#define | NEW_SPLAT(a) NEW_NODE(NODE_SPLAT,a,0,0) |
#define | NEW_TO_ARY(a) NEW_NODE(NODE_TO_ARY,a,0,0) |
#define | NEW_BLOCK_ARG(v) NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v)) |
#define | NEW_BLOCK_PASS(b) NEW_NODE(NODE_BLOCK_PASS,0,b,0) |
#define | NEW_ALIAS(n, o) NEW_NODE(NODE_ALIAS,n,o,0) |
#define | NEW_VALIAS(n, o) NEW_NODE(NODE_VALIAS,n,o,0) |
#define | NEW_UNDEF(i) NEW_NODE(NODE_UNDEF,0,i,0) |
#define | NEW_CLASS(n, b, s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s)) |
#define | NEW_SCLASS(r, b) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),0) |
#define | NEW_MODULE(n, b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0) |
#define | NEW_COLON2(c, i) NEW_NODE(NODE_COLON2,c,i,0) |
#define | NEW_COLON3(i) NEW_NODE(NODE_COLON3,0,i,0) |
#define | NEW_DOT2(b, e) NEW_NODE(NODE_DOT2,b,e,0) |
#define | NEW_DOT3(b, e) NEW_NODE(NODE_DOT3,b,e,0) |
#define | NEW_SELF() NEW_NODE(NODE_SELF,0,0,0) |
#define | NEW_NIL() NEW_NODE(NODE_NIL,0,0,0) |
#define | NEW_TRUE() NEW_NODE(NODE_TRUE,0,0,0) |
#define | NEW_FALSE() NEW_NODE(NODE_FALSE,0,0,0) |
#define | NEW_ERRINFO() NEW_NODE(NODE_ERRINFO,0,0,0) |
#define | NEW_DEFINED(e) NEW_NODE(NODE_DEFINED,e,0,0) |
#define | NEW_PREEXE(b) NEW_SCOPE(b) |
#define | NEW_POSTEXE(b) NEW_NODE(NODE_POSTEXE,0,b,0) |
#define | NEW_BMETHOD(b) NEW_NODE(NODE_BMETHOD,0,0,b) |
#define | NEW_ATTRASGN(r, m, a) NEW_NODE(NODE_ATTRASGN,r,m,a) |
#define | NEW_PRELUDE(p, b, o) NEW_NODE(NODE_PRELUDE,p,b,o) |
Typedefs | |
typedef struct RNode | NODE |
#define nd_ainfo u3.args |
Definition at line 328 of file node.h.
Referenced by rb_gc_free_node().
#define nd_line | ( | n | ) | (int)(((SIGNED_VALUE)RNODE(n)->flags)>>NODE_LSHIFT) |
Definition at line 278 of file node.h.
Referenced by ruby_debug_print_node().
#define nd_set_line | ( | n, | |
l | |||
) | RNODE(n)->flags=((RNODE(n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT)) |
#define nd_set_type | ( | n, | |
t | |||
) | RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
#define nd_tbl u1.tbl |
Definition at line 309 of file node.h.
Referenced by rb_gc_free_node(), and rb_node_memsize().
#define nd_type | ( | n | ) | ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
Definition at line 272 of file node.h.
Referenced by rb_gc_free_node(), rb_gc_mark_node(), rb_node_memsize(), rb_parser_append_print(), rb_parser_while_loop(), ruby_debug_print_node(), and yyparse().
#define NEW_ALIAS | ( | n, | |
o | |||
) | NEW_NODE(NODE_ALIAS,n,o,0) |
#define NEW_ARGS_AUX | ( | r, | |
b | |||
) | NEW_NODE(NODE_ARGS_AUX,r,b,0) |
#define NEW_ARGSCAT | ( | a, | |
b | |||
) | NEW_NODE(NODE_ARGSCAT,a,b,0) |
#define NEW_ARGSPUSH | ( | a, | |
b | |||
) | NEW_NODE(NODE_ARGSPUSH,a,b,0) |
#define NEW_ARRAY | ( | a | ) | NEW_NODE(NODE_ARRAY,a,1,0) |
Definition at line 381 of file node.h.
Referenced by rb_parser_append_print().
#define NEW_ATTRASGN | ( | r, | |
m, | |||
a | |||
) | NEW_NODE(NODE_ATTRASGN,r,m,a) |
#define NEW_BACK_REF | ( | n | ) | NEW_NODE(NODE_BACK_REF,0,n,0) |
#define NEW_BEGIN | ( | b | ) | NEW_NODE(NODE_BEGIN,0,b,0) |
#define NEW_BLOCK | ( | a | ) | NEW_NODE(NODE_BLOCK,a,0,0) |
#define NEW_BLOCK_ARG | ( | v | ) | NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v)) |
#define NEW_BLOCK_PASS | ( | b | ) | NEW_NODE(NODE_BLOCK_PASS,0,b,0) |
#define NEW_BMETHOD | ( | b | ) | NEW_NODE(NODE_BMETHOD,0,0,b) |
#define NEW_BREAK | ( | s | ) | NEW_NODE(NODE_BREAK,s,0,0) |
#define NEW_CDECL | ( | v, | |
val, | |||
path | |||
) | NEW_NODE(NODE_CDECL,v,val,path) |
#define NEW_CLASS | ( | n, | |
b, | |||
s | |||
) | NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s)) |
#define NEW_COLON2 | ( | c, | |
i | |||
) | NEW_NODE(NODE_COLON2,c,i,0) |
#define NEW_COLON3 | ( | i | ) | NEW_NODE(NODE_COLON3,0,i,0) |
#define NEW_CONST | ( | v | ) | NEW_NODE(NODE_CONST,v,0,0) |
#define NEW_DASGN_CURR | ( | v, | |
val | |||
) | NEW_NODE(NODE_DASGN_CURR,v,val,0) |
#define NEW_DEFINED | ( | e | ) | NEW_NODE(NODE_DEFINED,e,0,0) |
#define NEW_DXSTR | ( | s | ) | NEW_NODE(NODE_DXSTR,s,0,0) |
#define NEW_ENSURE | ( | b, | |
en | |||
) | NEW_NODE(NODE_ENSURE,b,0,en) |
#define NEW_ERRINFO | ( | ) | NEW_NODE(NODE_ERRINFO,0,0,0) |
#define NEW_EVSTR | ( | n | ) | NEW_NODE(NODE_EVSTR,0,(n),0) |
#define NEW_FALSE | ( | ) | NEW_NODE(NODE_FALSE,0,0,0) |
#define NEW_FCALL | ( | m, | |
a | |||
) | NEW_NODE(NODE_FCALL,0,m,a) |
#define NEW_GASGN | ( | v, | |
val | |||
) | NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v)) |
Definition at line 385 of file node.h.
Referenced by rb_parser_while_loop().
#define NEW_GVAR | ( | v | ) | NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v)) |
#define NEW_KW_ARG | ( | i, | |
v | |||
) | NEW_NODE(NODE_KW_ARG,i,v,0) |
#define NEW_LAMBDA | ( | a, | |
b | |||
) | NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0) |
#define NEW_MASGN | ( | l, | |
r | |||
) | NEW_NODE(NODE_MASGN,l,0,r) |
#define NEW_MATCH | ( | c | ) | NEW_NODE(NODE_MATCH,c,0,0) |
#define NEW_MATCH2 | ( | n1, | |
n2 | |||
) | NEW_NODE(NODE_MATCH2,n1,n2,0) |
#define NEW_MATCH3 | ( | r, | |
n2 | |||
) | NEW_NODE(NODE_MATCH3,r,n2,0) |
#define NEW_MODULE | ( | n, | |
b | |||
) | NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0) |
#define NEW_NODE | ( | t, | |
a0, | |||
a1, | |||
a2 | |||
) | rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2)) |
#define NEW_NTH_REF | ( | n | ) | NEW_NODE(NODE_NTH_REF,0,n,0) |
#define NEW_OP_ASGN1 | ( | p, | |
id, | |||
a | |||
) | NEW_NODE(NODE_OP_ASGN1,p,id,a) |
#define NEW_OP_ASGN2 | ( | r, | |
t, | |||
i, | |||
o, | |||
val | |||
) | NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t)) |
#define NEW_OP_ASGN22 | ( | i, | |
o, | |||
t | |||
) | NEW_NODE(NODE_OP_ASGN2,i,o,t) |
#define NEW_OP_ASGN_AND | ( | i, | |
val | |||
) | NEW_NODE(NODE_OP_ASGN_AND,i,val,0) |
#define NEW_OP_ASGN_OR | ( | i, | |
val | |||
) | NEW_NODE(NODE_OP_ASGN_OR,i,val,0) |
#define NEW_OP_CDECL | ( | v, | |
op, | |||
val | |||
) | NEW_NODE(NODE_OP_CDECL,v,val,op) |
#define NEW_OPCALL | ( | r, | |
m, | |||
a | |||
) | NEW_NODE(NODE_OPCALL,r,m,a) |
#define NEW_OPT_ARG | ( | i, | |
v | |||
) | NEW_NODE(NODE_OPT_ARG,i,v,0) |
#define NEW_OPT_N | ( | b | ) | NEW_NODE(NODE_OPT_N,0,b,0) |
Definition at line 364 of file node.h.
Referenced by rb_parser_while_loop().
#define NEW_POSTARG | ( | i, | |
v | |||
) | NEW_NODE(NODE_POSTARG,i,v,0) |
#define NEW_POSTEXE | ( | b | ) | NEW_NODE(NODE_POSTEXE,0,b,0) |
#define NEW_PRELUDE | ( | p, | |
b, | |||
o | |||
) | NEW_NODE(NODE_PRELUDE,p,b,o) |
#define NEW_RESBODY | ( | a, | |
ex, | |||
n | |||
) | NEW_NODE(NODE_RESBODY,n,ex,a) |
#define NEW_RESCUE | ( | b, | |
res, | |||
e | |||
) | NEW_NODE(NODE_RESCUE,b,res,e) |
#define NEW_RETRY | ( | ) | NEW_NODE(NODE_RETRY,0,0,0) |
#define NEW_RETURN | ( | s | ) | NEW_NODE(NODE_RETURN,s,0,0) |
#define NEW_SCLASS | ( | r, | |
b | |||
) | NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),0) |
#define NEW_SCOPE | ( | a, | |
b | |||
) | NEW_NODE(NODE_SCOPE,local_tbl(),b,a) |
#define NEW_SPLAT | ( | a | ) | NEW_NODE(NODE_SPLAT,a,0,0) |
#define NEW_SUPER | ( | a | ) | NEW_NODE(NODE_SUPER,0,0,a) |
#define NEW_TO_ARY | ( | a | ) | NEW_NODE(NODE_TO_ARY,a,0,0) |
#define NEW_UNDEF | ( | i | ) | NEW_NODE(NODE_UNDEF,0,i,0) |
#define NEW_UNLESS | ( | c, | |
t, | |||
e | |||
) | NEW_NODE(NODE_UNLESS,c,t,e) |
#define NEW_UNTIL | ( | c, | |
b, | |||
n | |||
) | NEW_NODE(NODE_UNTIL,c,b,n) |
#define NEW_VALIAS | ( | n, | |
o | |||
) | NEW_NODE(NODE_VALIAS,n,o,0) |
#define NEW_VCALL | ( | m | ) | NEW_NODE(NODE_VCALL,0,m,0) |
#define NEW_WHILE | ( | c, | |
b, | |||
n | |||
) | NEW_NODE(NODE_WHILE,c,b,n) |
#define NEW_YIELD | ( | a | ) | NEW_NODE(NODE_YIELD,a,0,0) |
#define NEW_ZARRAY | ( | ) | NEW_NODE(NODE_ZARRAY,0,0,0) |
#define NEW_ZSUPER | ( | ) | NEW_NODE(NODE_ZSUPER,0,0,0) |
#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) |
#define NODE_LSHIFT (NODE_TYPESHIFT+7) |
Definition at line 260 of file node.h.
Referenced by rb_free_tmp_buffer(), rb_gc_free_node(), rb_gc_mark_node(), and rb_node_memsize().
enum node_type |
Definition at line 11547 of file ripper.c.
References rb_str_new().
Definition at line 11569 of file ripper.c.
References rb_parser_compile_file(), and rb_parser_new().
void rb_gc_free_node | ( | VALUE | obj | ) |
Definition at line 1098 of file node.c.
References RNode::args, rb_args_info::kw_args, rb_args_info::kw_rest_arg, nd_type, NODE_ALIAS, NODE_AND, NODE_ARGS, NODE_ARGS_AUX, NODE_ARGSCAT, NODE_ARRAY, NODE_BACK_REF, NODE_BLOCK, NODE_BLOCK_ARG, NODE_BLOCK_PASS, NODE_BREAK, NODE_CALL, NODE_CASE, NODE_CDECL, NODE_CLASS, NODE_COLON2, NODE_COLON3, NODE_CVAR, NODE_CVASGN, NODE_DASGN, NODE_DASGN_CURR, NODE_DEFINED, NODE_DEFN, NODE_DEFS, NODE_DOT2, NODE_DOT3, NODE_DREGX, NODE_DREGX_ONCE, NODE_DSTR, NODE_DVAR, NODE_DXSTR, NODE_ENSURE, NODE_ERRINFO, NODE_EVSTR, NODE_FALSE, NODE_FCALL, NODE_FLIP2, NODE_FLIP3, NODE_FOR, NODE_GASGN, NODE_GVAR, NODE_HASH, NODE_IASGN, NODE_IF, NODE_ITER, NODE_IVAR, NODE_LASGN, NODE_LIT, NODE_LVAR, NODE_MASGN, NODE_MATCH, NODE_MATCH2, NODE_MATCH3, NODE_MODULE, NODE_NEXT, NODE_NIL, NODE_NTH_REF, NODE_OP_ASGN1, NODE_OP_ASGN_AND, NODE_OP_ASGN_OR, NODE_OPT_ARG, NODE_OPT_N, NODE_OR, NODE_POSTEXE, NODE_REDO, NODE_RESBODY, NODE_RESCUE, NODE_RETRY, NODE_RETURN, NODE_SCLASS, NODE_SCOPE, NODE_SELF, NODE_SPLAT, NODE_STR, NODE_SUPER, NODE_TO_ARY, NODE_TRUE, NODE_UNDEF, NODE_UNTIL, NODE_VALIAS, NODE_VCALL, NODE_WHEN, NODE_WHILE, NODE_XSTR, NODE_YIELD, NODE_ZARRAY, NODE_ZSUPER, rb_args_info::opt_args, rb_args_info::post_init, rb_args_info::pre_init, rb_gc_mark(), rb_gc_mark_maybe(), RNODE, and RNode::u3.
size_t rb_node_memsize | ( | VALUE | obj | ) |
Definition at line 17152 of file ripper.c.
References block_append, nd_type, NEW_ARRAY, new_fcall, new_gvar, NODE_PRELUDE, rb_intern, and TypedData_Get_Struct.
void* rb_parser_calloc | ( | struct parser_params * | , |
size_t | , | ||
size_t | |||
) |
Definition at line 11554 of file ripper.c.
References rb_str_new().
Definition at line 11577 of file ripper.c.
References rb_filesystem_str_new_cstr(), and rb_parser_compile_file_path().
Referenced by rb_compile_file().
Definition at line 11583 of file ripper.c.
References lex_gets, and TypedData_Get_Struct.
Referenced by rb_parser_compile_file().
Definition at line 11534 of file ripper.c.
References rb_filesystem_str_new_cstr(), and rb_parser_compile_string_path().
Definition at line 11540 of file ripper.c.
Referenced by rb_parser_compile_string().
Definition at line 1049 of file node.c.
References add_option_arg::buf, and rb_str_new_cstr().
Definition at line 17427 of file ripper.c.
References current_enc, rb_enc_from_encoding(), and TypedData_Get_Struct.
Definition at line 17412 of file ripper.c.
References Qfalse, Qtrue, ruby__end__seen, and TypedData_Get_Struct.
void rb_parser_free | ( | struct parser_params * | , |
void * | |||
) |
Definition at line 17514 of file ripper.c.
References parser_params::heap, rb_imemo_alloc_struct::next, NULL, rb_gc_force_recycle(), and xfree().
Definition at line 17442 of file ripper.c.
References Qfalse, Qtrue, and TypedData_Get_Struct.
void* rb_parser_malloc | ( | struct parser_params * | , |
size_t | |||
) |
RUBY_SYMBOL_EXPORT_BEGIN VALUE rb_parser_new | ( | void | ) |
Definition at line 17357 of file ripper.c.
References TypedData_Make_Struct.
Referenced by rb_compile_file(), and rb_load_file_str().
void rb_parser_printf | ( | struct parser_params * | parser, |
const char * | fmt, | ||
... | |||
) |
Definition at line 17531 of file ripper.c.
References parser_params::debug_buffer, parser_params::debug_output, NIL_P, Qnil, rb_io_write(), rb_str_new(), rb_str_vcatf(), and RSTRING_END.
void* rb_parser_realloc | ( | struct parser_params * | , |
void * | , | ||
size_t | |||
) |
Definition at line 17494 of file ripper.c.
References ADD2HEAP, cnt, rb_imemo_alloc_struct::cnt, parser_params::heap, HEAPCNT, NEWHEAP, rb_imemo_alloc_struct::next, NULL, rb_imemo_alloc_struct::ptr, and xrealloc.
Definition at line 17457 of file ripper.c.
References RTEST, and TypedData_Get_Struct.
Definition at line 17185 of file ripper.c.
References block_append, nd_type, new_call, NEW_GASGN, new_gvar, NEW_OPT_N, NODE_PRELUDE, rb_intern, and TypedData_Get_Struct.
Definition at line 17351 of file ripper.c.
References EXPR_VALUE, key, keyword__ENCODING__, keyword__FILE__, keyword__LINE__, keyword_alias, keyword_and, keyword_begin, keyword_BEGIN, keyword_break, keyword_case, keyword_class, keyword_def, keyword_defined, keyword_do, keyword_else, keyword_elsif, keyword_end, keyword_END, keyword_ensure, keyword_false, keyword_for, keyword_if, keyword_in, keyword_module, keyword_next, keyword_nil, keyword_not, keyword_or, keyword_redo, keyword_rescue, keyword_retry, keyword_return, keyword_self, keyword_super, keyword_then, keyword_true, keyword_undef, keyword_unless, keyword_until, keyword_when, keyword_while, keyword_yield, MIN_WORD_LENGTH, modifier_if, modifier_rescue, modifier_unless, modifier_until, modifier_while, and offsetof.