Go to the source code of this file.
Data Structures | |
| struct | RNode |
| struct | rb_global_entry |
| struct | rb_args_info |
Defines | |
| #define | RUBY_NODE_H 1 |
| #define | NODE_SCOPE NODE_SCOPE |
| #define | NODE_BLOCK NODE_BLOCK |
| #define | NODE_IF NODE_IF |
| #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_IASGN2 NODE_IASGN2 |
| #define | NODE_CDECL NODE_CDECL |
| #define | NODE_CVASGN NODE_CVASGN |
| #define | NODE_CVDECL NODE_CVDECL |
| #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_FCALL NODE_FCALL |
| #define | NODE_VCALL NODE_VCALL |
| #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_CREF NODE_CREF |
| #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_ALLOCA NODE_ALLOCA |
| #define | NODE_BMETHOD NODE_BMETHOD |
| #define | NODE_MEMO NODE_MEMO |
| #define | NODE_IFUNC NODE_IFUNC |
| #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_FL_CREF_PUSHED_BY_EVAL (((VALUE)1)<<15) |
| #define | NODE_FL_CREF_OMOD_SHARED (((VALUE)1)<<16) |
| #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)(RNODE(n)->flags>>NODE_LSHIFT) |
| #define | nd_set_line(n, l) RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
| #define | nd_refinements nd_reserved |
| #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_IFUNC(f, c) NEW_NODE(NODE_IFUNC,f,c,0) |
| #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_IF(c,e,t) |
| #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_IASGN2(v, val) NEW_NODE(NODE_IASGN2,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_CVDECL(v, val) NEW_NODE(NODE_CVDECL,v,val,0) |
| #define | NEW_OP_ASGN1(p, id, a) NEW_NODE(NODE_OP_ASGN1,p,id,a) |
| #define | NEW_OP_ASGN2(r, i, o, val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define | NEW_OP_ASGN22(i, o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #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_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_CREF(a) NEW_NODE(NODE_CREF,a,0,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) NEW_NODE(NODE_PRELUDE,p,b,0) |
| #define | NEW_MEMO(a, b, c) NEW_NODE(NODE_MEMO,a,b,c) |
| #define | roomof(x, y) ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| #define | MEMO_FOR(type, value) ((type *)RARRAY_PTR(value)) |
| #define | NEW_MEMO_FOR(type, value) |
| #define | RUBY_NODE_H 1 |
| #define | NODE_SCOPE NODE_SCOPE |
| #define | NODE_BLOCK NODE_BLOCK |
| #define | NODE_IF NODE_IF |
| #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_IASGN2 NODE_IASGN2 |
| #define | NODE_CDECL NODE_CDECL |
| #define | NODE_CVASGN NODE_CVASGN |
| #define | NODE_CVDECL NODE_CVDECL |
| #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_FCALL NODE_FCALL |
| #define | NODE_VCALL NODE_VCALL |
| #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_CREF NODE_CREF |
| #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_ALLOCA NODE_ALLOCA |
| #define | NODE_BMETHOD NODE_BMETHOD |
| #define | NODE_MEMO NODE_MEMO |
| #define | NODE_IFUNC NODE_IFUNC |
| #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_FL_CREF_PUSHED_BY_EVAL (((VALUE)1)<<15) |
| #define | NODE_FL_CREF_OMOD_SHARED (((VALUE)1)<<16) |
| #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)(RNODE(n)->flags>>NODE_LSHIFT) |
| #define | nd_set_line(n, l) RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
| #define | nd_refinements nd_reserved |
| #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_IFUNC(f, c) NEW_NODE(NODE_IFUNC,f,c,0) |
| #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_IF(c,e,t) |
| #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_IASGN2(v, val) NEW_NODE(NODE_IASGN2,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_CVDECL(v, val) NEW_NODE(NODE_CVDECL,v,val,0) |
| #define | NEW_OP_ASGN1(p, id, a) NEW_NODE(NODE_OP_ASGN1,p,id,a) |
| #define | NEW_OP_ASGN2(r, i, o, val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define | NEW_OP_ASGN22(i, o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #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_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_CREF(a) NEW_NODE(NODE_CREF,a,0,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) NEW_NODE(NODE_PRELUDE,p,b,0) |
| #define | NEW_MEMO(a, b, c) NEW_NODE(NODE_MEMO,a,b,c) |
| #define | roomof(x, y) ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| #define | MEMO_FOR(type, value) ((type *)RARRAY_PTR(value)) |
| #define | NEW_MEMO_FOR(type, value) |
| #define | RUBY_NODE_H 1 |
| #define | NODE_SCOPE NODE_SCOPE |
| #define | NODE_BLOCK NODE_BLOCK |
| #define | NODE_IF NODE_IF |
| #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_IASGN2 NODE_IASGN2 |
| #define | NODE_CDECL NODE_CDECL |
| #define | NODE_CVASGN NODE_CVASGN |
| #define | NODE_CVDECL NODE_CVDECL |
| #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_FCALL NODE_FCALL |
| #define | NODE_VCALL NODE_VCALL |
| #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_CREF NODE_CREF |
| #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_ALLOCA NODE_ALLOCA |
| #define | NODE_BMETHOD NODE_BMETHOD |
| #define | NODE_MEMO NODE_MEMO |
| #define | NODE_IFUNC NODE_IFUNC |
| #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_FL_CREF_PUSHED_BY_EVAL (((VALUE)1)<<15) |
| #define | NODE_FL_CREF_OMOD_SHARED (((VALUE)1)<<16) |
| #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)(RNODE(n)->flags>>NODE_LSHIFT) |
| #define | nd_set_line(n, l) RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
| #define | nd_refinements nd_reserved |
| #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_IFUNC(f, c) NEW_NODE(NODE_IFUNC,f,c,0) |
| #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_IF(c,e,t) |
| #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_IASGN2(v, val) NEW_NODE(NODE_IASGN2,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_CVDECL(v, val) NEW_NODE(NODE_CVDECL,v,val,0) |
| #define | NEW_OP_ASGN1(p, id, a) NEW_NODE(NODE_OP_ASGN1,p,id,a) |
| #define | NEW_OP_ASGN2(r, i, o, val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define | NEW_OP_ASGN22(i, o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #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_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_CREF(a) NEW_NODE(NODE_CREF,a,0,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) NEW_NODE(NODE_PRELUDE,p,b,0) |
| #define | NEW_MEMO(a, b, c) NEW_NODE(NODE_MEMO,a,b,c) |
| #define | roomof(x, y) ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| #define | MEMO_FOR(type, value) ((type *)RARRAY_PTR(value)) |
| #define | NEW_MEMO_FOR(type, value) |
Typedefs | |
| typedef RNode | NODE |
Enumerations | |
| enum | node_type { NODE_SCOPE, NODE_BLOCK, NODE_IF, NODE_CASE, NODE_WHEN, NODE_OPT_N, NODE_WHILE, NODE_UNTIL, NODE_ITER, NODE_FOR, NODE_BREAK, NODE_NEXT, NODE_REDO, NODE_RETRY, NODE_BEGIN, NODE_RESCUE, NODE_RESBODY, NODE_ENSURE, NODE_AND, NODE_OR, NODE_MASGN, NODE_LASGN, NODE_DASGN, NODE_DASGN_CURR, NODE_GASGN, NODE_IASGN, NODE_IASGN2, NODE_CDECL, NODE_CVASGN, NODE_CVDECL, NODE_OP_ASGN1, NODE_OP_ASGN2, NODE_OP_ASGN_AND, NODE_OP_ASGN_OR, NODE_OP_CDECL, NODE_CALL, NODE_FCALL, NODE_VCALL, NODE_SUPER, NODE_ZSUPER, NODE_ARRAY, NODE_ZARRAY, NODE_VALUES, NODE_HASH, NODE_RETURN, NODE_YIELD, NODE_LVAR, NODE_DVAR, NODE_GVAR, NODE_IVAR, NODE_CONST, NODE_CVAR, NODE_NTH_REF, NODE_BACK_REF, NODE_MATCH, NODE_MATCH2, NODE_MATCH3, NODE_LIT, NODE_STR, NODE_DSTR, NODE_XSTR, NODE_DXSTR, NODE_EVSTR, NODE_DREGX, NODE_DREGX_ONCE, NODE_ARGS, NODE_ARGS_AUX, NODE_OPT_ARG, NODE_KW_ARG, NODE_POSTARG, NODE_ARGSCAT, NODE_ARGSPUSH, NODE_SPLAT, NODE_TO_ARY, NODE_BLOCK_ARG, NODE_BLOCK_PASS, NODE_DEFN, NODE_DEFS, NODE_ALIAS, NODE_VALIAS, NODE_UNDEF, NODE_CLASS, NODE_MODULE, NODE_SCLASS, NODE_COLON2, NODE_COLON3, NODE_CREF, NODE_DOT2, NODE_DOT3, NODE_FLIP2, NODE_FLIP3, NODE_SELF, NODE_NIL, NODE_TRUE, NODE_FALSE, NODE_ERRINFO, NODE_DEFINED, NODE_POSTEXE, NODE_ALLOCA, NODE_BMETHOD, NODE_MEMO, NODE_IFUNC, NODE_DSYM, NODE_ATTRASGN, NODE_PRELUDE, NODE_LAMBDA, NODE_LAST } |
Functions | |
| RUBY_SYMBOL_EXPORT_BEGIN VALUE | rb_parser_new (void) |
| VALUE | rb_parser_end_seen_p (VALUE) |
| VALUE | rb_parser_encoding (VALUE) |
| VALUE | rb_parser_get_yydebug (VALUE) |
| VALUE | rb_parser_set_yydebug (VALUE, VALUE) |
| VALUE | rb_parser_dump_tree (NODE *node, int comment) |
| NODE * | rb_parser_append_print (VALUE, NODE *) |
| NODE * | rb_parser_while_loop (VALUE, NODE *, int, int) |
| NODE * | rb_parser_compile_cstr (volatile VALUE, const char *, const char *, int, int) |
| NODE * | rb_parser_compile_string (volatile VALUE, const char *, VALUE, int) |
| NODE * | rb_parser_compile_file (volatile VALUE, const char *, VALUE, int) |
| NODE * | rb_parser_compile_string_path (volatile VALUE vparser, VALUE fname, VALUE src, int line) |
| NODE * | rb_parser_compile_file_path (volatile VALUE vparser, VALUE fname, VALUE input, int line) |
| NODE * | rb_compile_cstr (const char *, const char *, int, int) |
| NODE * | rb_compile_string (const char *, VALUE, int) |
| NODE * | rb_compile_file (const char *, VALUE, int) |
| NODE * | rb_node_newnode (enum node_type, VALUE, VALUE, VALUE) |
| NODE * | rb_node_newnode_longlife (enum node_type, VALUE, VALUE, VALUE) |
| rb_global_entry * | rb_global_entry (ID) |
| VALUE | rb_gvar_get (struct rb_global_entry *) |
| VALUE | rb_gvar_set (struct rb_global_entry *, VALUE) |
| VALUE | rb_gvar_defined (struct rb_global_entry *) |
| kwtable * | rb_reserved_word (const char *, unsigned int) |
| 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 *) |
Definition at line 469 of file node.h.
Referenced by chunk_i(), chunk_ii(), enum_minmax_by(), minmax_by_i(), slicebefore_i(), and slicebefore_ii().
| #define nd_1st u1.node |
| #define nd_2nd u2.node |
| #define nd_body u2.node |
Definition at line 299 of file node.h.
Referenced by dump_node(), reduce_nodes_gen(), and yyparse().
| #define nd_cond u1.node |
| #define nd_else u3.node |
| #define nd_ensr u3.node |
| #define nd_entry u3.entry |
| #define nd_head u1.node |
| #define nd_iter u3.node |
| #define nd_line | ( | n | ) | (int)(RNODE(n)->flags>>NODE_LSHIFT) |
Definition at line 288 of file node.h.
Referenced by build_postexe_iseq(), compile_array_(), compile_branch_condition(), compile_colon2(), compile_cpath(), compile_dregx(), compile_dstr(), compile_dstr_fragments(), compile_massign(), compile_massign_lhs(), compile_massign_opt(), defined_expr(), fixpos(), iseq_compile_each(), iseq_set_arguments(), nodeline(), parser_heredoc_restore(), parser_parse_string(), parser_warn(), parser_warning(), rb_iseq_compile_node(), ruby_debug_print_node(), setup_args(), void_expr_gen(), and when_vals().
| #define nd_next u3.node |
Definition at line 296 of file node.h.
Referenced by dump_node(), reduce_nodes_gen(), and yyparse().
| #define nd_recv u1.node |
| #define nd_resq u2.node |
| #define nd_set_line | ( | n, | |||
| l | ) | RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
| #define nd_set_line | ( | n, | |||
| l | ) | RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
| #define nd_set_line | ( | n, | |||
| l | ) | RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT)) |
Definition at line 289 of file node.h.
Referenced by fixpos(), node_newnode(), parser_heredoc_identifier(), and yyparse().
| #define nd_set_type | ( | n, | |||
| t | ) | RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
| #define nd_set_type | ( | n, | |||
| t | ) | RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
| #define nd_set_type | ( | n, | |||
| t | ) | RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
Definition at line 283 of file node.h.
Referenced by arg_append_gen(), arg_concat_gen(), cond0(), dsym_node_gen(), fixup_nodes(), literal_concat_gen(), rb_node_newnode(), ret_args_gen(), and yyparse().
| #define nd_state u3.state |
| #define nd_stts u1.node |
| #define nd_type | ( | n | ) | ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
| #define nd_type | ( | n | ) | ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
| #define nd_type | ( | n | ) | ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
Definition at line 282 of file node.h.
Referenced by arg_append_gen(), arg_concat_gen(), aryset_gen(), assign_in_cond(), attrset_gen(), block_append_gen(), block_dup_check_gen(), case_when_optimizable_literal(), cn_i(), compile_array_(), compile_branch_condition(), compile_colon2(), compile_cpath(), compile_dstr_fragments(), compile_massign(), compile_massign_lhs(), compile_massign_opt(), cond0(), defined_expr(), dsym_node_gen(), dump_node(), dump_object(), evstr2dstr_gen(), fixup_nodes(), gc_mark_children(), is_static_content(), iseq_compile_each(), iseq_set_arguments(), literal_concat_gen(), literal_node(), load_lock(), logop_gen(), match_op_gen(), new_evstr_gen(), no_blockarg(), node_assign_gen(), nodetype(), obj_free(), obj_memsize_of(), parser_yylex(), range_op(), rb_backref_error_gen(), rb_iseq_compile_node(), rb_parser_append_print(), rb_parser_while_loop(), reduce_nodes_gen(), remove_begin(), remove_begin_all(), ret_args_gen(), ruby_debug_print_node(), setup_args(), splat_array(), value_expr_gen(), void_expr_gen(), void_stmts_gen(), when_vals(), and yyparse().
| #define nd_value u2.node |
| #define nd_vid u1.id |
| #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) |
| #define NEW_ATTRASGN | ( | r, | |||
| m, | |||||
| a | ) | NEW_NODE(NODE_ATTRASGN,r,m,a) |
| #define NEW_ATTRASGN | ( | r, | |||
| m, | |||||
| a | ) | NEW_NODE(NODE_ATTRASGN,r,m,a) |
| #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) |
Definition at line 385 of file node.h.
Referenced by new_const_op_assign_gen(), new_op_assign_gen(), reg_named_capture_assign_iter(), and yyparse().
| #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_ARG | ( | v | ) | NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v)) |
| #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_BREAK | ( | s | ) | NEW_NODE(NODE_BREAK,s,0,0) |
| #define NEW_CALL | ( | r, | |||
| m, | |||||
| a | ) | NEW_NODE(NODE_CALL,r,m,a) |
Definition at line 429 of file node.h.
Referenced by call_bin_op_gen(), call_uni_op_gen(), match_op_gen(), new_op_assign_gen(), range_op(), rb_parser_while_loop(), reg_named_capture_assign_gen(), reg_named_capture_assign_iter(), and yyparse().
| #define NEW_CASE | ( | h, | |||
| b | ) | NEW_NODE(NODE_CASE,h,b,0) |
| #define NEW_CDECL | ( | v, | |||
| val, | |||||
| path | ) | NEW_NODE(NODE_CDECL,v,val,path) |
| #define NEW_CDECL | ( | v, | |||
| val, | |||||
| path | ) | NEW_NODE(NODE_CDECL,v,val,path) |
| #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_CLASS | ( | n, | |||
| b, | |||||
| s | ) | NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s)) |
| #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_CREF | ( | a | ) | NEW_NODE(NODE_CREF,a,0,0) |
Definition at line 452 of file node.h.
Referenced by eval_string_with_cref(), rb_iseq_clone(), rewrite_cref_stack(), set_relation(), and vm_cref_push().
| #define NEW_CVAR | ( | v | ) | NEW_NODE(NODE_CVAR,v,0,0) |
| #define NEW_CVASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_CVASGN,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_DASGN_CURR | ( | v, | |||
| val | ) | NEW_NODE(NODE_DASGN_CURR,v,val,0) |
| #define NEW_DASGN_CURR | ( | v, | |||
| val | ) | NEW_NODE(NODE_DASGN_CURR,v,val,0) |
| #define NEW_DEFN | ( | i, | |||
| a, | |||||
| d, | |||||
| p | ) | NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d)) |
| #define NEW_DEFN | ( | i, | |||
| a, | |||||
| d, | |||||
| p | ) | NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d)) |
| #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_DEFS | ( | r, | |||
| i, | |||||
| a, | |||||
| d | ) | NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d)) |
| #define NEW_DEFS | ( | r, | |||
| i, | |||||
| a, | |||||
| d | ) | NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d)) |
| #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_DSTR | ( | s | ) | NEW_NODE(NODE_DSTR,s,1,0) |
| #define NEW_DVAR | ( | v | ) | NEW_NODE(NODE_DVAR,v,0,0) |
Definition at line 413 of file node.h.
Referenced by gettable_gen(), new_args_tail_gen(), and yyparse().
| #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_FOR | ( | v, | |||
| i, | |||||
| b | ) | NEW_NODE(NODE_FOR,v,b,i) |
| #define NEW_GASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v)) |
| #define NEW_GASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v)) |
| #define NEW_GASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v)) |
| #define NEW_GVAR | ( | v | ) | NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v)) |
| #define NEW_GVAR | ( | v | ) | NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v)) |
| #define NEW_GVAR | ( | v | ) | NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v)) |
Definition at line 411 of file node.h.
Referenced by cond0(), gettable_gen(), range_op(), rb_parser_append_print(), and rb_parser_while_loop().
| #define NEW_HASH | ( | a | ) | NEW_NODE(NODE_HASH,a,0,0) |
| #define NEW_IASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_IASGN,v,val,0) |
| #define NEW_IF | ( | c, | |||
| t, | |||||
| e | ) | NEW_NODE(NODE_IF,c,t,e) |
Definition at line 371 of file node.h.
Referenced by lep_svar_place(), reg_named_capture_assign_gen(), and yyparse().
| #define NEW_IFUNC | ( | f, | |||
| c | ) | NEW_NODE(NODE_IFUNC,f,c,0) |
| #define NEW_ITER | ( | a, | |||
| b | ) | NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0) |
| #define NEW_ITER | ( | a, | |||
| b | ) | NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0) |
| #define NEW_ITER | ( | a, | |||
| b | ) | NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0) |
| #define NEW_IVAR | ( | v | ) | NEW_NODE(NODE_IVAR,v,0,0) |
| #define NEW_LAMBDA | ( | a, | |||
| b | ) | NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0) |
| #define NEW_LAMBDA | ( | a, | |||
| b | ) | NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0) |
| #define NEW_LAMBDA | ( | a, | |||
| b | ) | NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0) |
| #define NEW_LASGN | ( | v, | |||
| val | ) | NEW_NODE(NODE_LASGN,v,val,0) |
| #define NEW_LIST | ( | a | ) | NEW_ARRAY(a) |
Definition at line 391 of file node.h.
Referenced by arg_append_gen(), arg_concat_gen(), call_bin_op_gen(), dsym_node_gen(), list_append_gen(), match_op_gen(), new_op_assign_gen(), range_op(), reg_named_capture_assign_gen(), reg_named_capture_assign_iter(), and yyparse().
| #define NEW_LIT | ( | l | ) | NEW_NODE(NODE_LIT,l,0,0) |
Definition at line 422 of file node.h.
Referenced by dsym_node_gen(), gettable_gen(), reg_named_capture_assign_gen(), reg_named_capture_assign_iter(), and yyparse().
| #define NEW_LVAR | ( | v | ) | NEW_NODE(NODE_LVAR,v,0,0) |
| #define NEW_MASGN | ( | l, | |||
| r | ) | NEW_NODE(NODE_MASGN,l,0,r) |
| #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_MEMO | ( | a, | |||
| b, | |||||
| c | ) | NEW_NODE(NODE_MEMO,a,b,c) |
Definition at line 466 of file node.h.
Referenced by enum_all(), enum_any(), enum_count(), enum_drop(), enum_drop_while(), enum_each_cons(), enum_each_slice(), enum_each_with_index(), enum_find(), enum_find_index(), enum_first(), enum_grep(), enum_inject(), enum_max(), enum_max_by(), enum_member(), enum_min(), enum_min_by(), enum_minmax(), enum_none(), enum_one(), enum_partition(), enum_sort_by(), enum_take(), enumerator_with_index(), and register_init_ext().
| #define NEW_MEMO_FOR | ( | type, | |||
| value | ) |
| #define NEW_MEMO_FOR | ( | type, | |||
| value | ) |
| #define NEW_MEMO_FOR | ( | type, | |||
| value | ) |
Value:
(rb_ary_set_len(((value) = rb_ary_tmp_new(roomof(type, VALUE))), \ roomof(type, VALUE)), \ MEMO_FOR(type, value))
Definition at line 470 of file node.h.
Referenced by chunk_i(), enum_minmax_by(), and slicebefore_i().
| #define NEW_MODULE | ( | n, | |||
| b | ) | NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0) |
| #define NEW_MODULE | ( | n, | |||
| b | ) | NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0) |
| #define NEW_MODULE | ( | n, | |||
| b | ) | NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0) |
| #define NEW_NEXT | ( | s | ) | NEW_NODE(NODE_NEXT,s,0,0) |
| #define NEW_NIL | ( | ) | NEW_NODE(NODE_NIL,0,0,0) |
Definition at line 456 of file node.h.
Referenced by gettable_gen(), reduce_nodes_gen(), yycompile0(), and yyparse().
| #define NEW_NODE | ( | t, | |||
| a0, | |||||
| a1, | |||||
| a2 | ) | rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2)) |
| #define NEW_NODE | ( | t, | |||
| a0, | |||||
| a1, | |||||
| a2 | ) | rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2)) |
| #define NEW_NODE | ( | t, | |||
| a0, | |||||
| a1, | |||||
| a2 | ) | rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2)) |
Definition at line 364 of file node.h.
Referenced by dsym_node_gen(), logop_gen(), new_args_tail_gen(), rb_binding_add_dynavars(), and yyparse().
| #define NEW_NTH_REF | ( | n | ) | NEW_NODE(NODE_NTH_REF,0,n,0) |
| #define NEW_OP_ASGN2 | ( | r, | |||
| i, | |||||
| o, | |||||
| val | ) | NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define NEW_OP_ASGN2 | ( | r, | |||
| i, | |||||
| o, | |||||
| val | ) | NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define NEW_OP_ASGN2 | ( | r, | |||
| i, | |||||
| o, | |||||
| val | ) | NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) |
| #define NEW_OP_ASGN22 | ( | i, | |||
| o | ) | NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #define NEW_OP_ASGN22 | ( | i, | |||
| o | ) | NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #define NEW_OP_ASGN22 | ( | i, | |||
| o | ) | NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i)) |
| #define NEW_OP_ASGN_AND | ( | i, | |||
| val | ) | NEW_NODE(NODE_OP_ASGN_AND,i,val,0) |
| #define NEW_OP_ASGN_AND | ( | i, | |||
| val | ) | NEW_NODE(NODE_OP_ASGN_AND,i,val,0) |
| #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_ASGN_OR | ( | i, | |||
| val | ) | NEW_NODE(NODE_OP_ASGN_OR,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_OP_CDECL | ( | v, | |||
| op, | |||||
| val | ) | NEW_NODE(NODE_OP_CDECL,v,val,op) |
| #define NEW_OP_CDECL | ( | v, | |||
| op, | |||||
| val | ) | NEW_NODE(NODE_OP_CDECL,v,val,op) |
| #define NEW_OPT_N | ( | b | ) | NEW_NODE(NODE_OPT_N,0,b,0) |
| #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 | ) | NEW_NODE(NODE_PRELUDE,p,b,0) |
| #define NEW_REDO | ( | ) | NEW_NODE(NODE_REDO,0,0,0) |
| #define NEW_RESBODY | ( | a, | |||
| ex, | |||||
| n | ) | NEW_NODE(NODE_RESBODY,n,ex,a) |
| #define NEW_RESBODY | ( | a, | |||
| ex, | |||||
| n | ) | NEW_NODE(NODE_RESBODY,n,ex,a) |
| #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_RESCUE | ( | b, | |||
| res, | |||||
| e | ) | NEW_NODE(NODE_RESCUE,b,res,e) |
| #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_SCLASS | ( | r, | |||
| b | ) | NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),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_SCOPE | ( | a, | |||
| b | ) | NEW_NODE(NODE_SCOPE,local_tbl(),b,a) |
| #define NEW_SCOPE | ( | a, | |||
| b | ) | NEW_NODE(NODE_SCOPE,local_tbl(),b,a) |
| #define NEW_SELF | ( | ) | NEW_NODE(NODE_SELF,0,0,0) |
| #define NEW_SPLAT | ( | a | ) | NEW_NODE(NODE_SPLAT,a,0,0) |
| #define NEW_STR | ( | s | ) | NEW_NODE(NODE_STR,s,0,0) |
Definition at line 423 of file node.h.
Referenced by gettable_gen(), literal_concat_gen(), and yyparse().
| #define NEW_SUPER | ( | a | ) | NEW_NODE(NODE_SUPER,0,0,a) |
| #define NEW_TRUE | ( | ) | NEW_NODE(NODE_TRUE,0,0,0) |
| #define NEW_UNDEF | ( | i | ) | NEW_NODE(NODE_UNDEF,0,i,0) |
| #define NEW_UNLESS | ( | c, | |||
| t, | |||||
| e | ) | NEW_IF(c,e,t) |
| #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_WHEN | ( | c, | |||
| t, | |||||
| e | ) | NEW_NODE(NODE_WHEN,c,t,e) |
| #define NEW_WHILE | ( | c, | |||
| b, | |||||
| n | ) | NEW_NODE(NODE_WHILE,c,b,n) |
| #define NEW_XSTR | ( | s | ) | NEW_NODE(NODE_XSTR,s,0,0) |
| #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_ALIAS NODE_ALIAS |
| #define NODE_ALIAS NODE_ALIAS |
| #define NODE_ALIAS NODE_ALIAS |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_ALLOCA NODE_ALLOCA |
| #define NODE_ALLOCA NODE_ALLOCA |
| #define NODE_ALLOCA NODE_ALLOCA |
Referenced by count_nodes(), gc_mark_children(), obj_free(), and obj_memsize_of().
| #define NODE_AND NODE_AND |
| #define NODE_AND NODE_AND |
| #define NODE_AND NODE_AND |
Referenced by compile_branch_condition(), cond0(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), value_expr_gen(), and yyparse().
| #define NODE_ARGS NODE_ARGS |
| #define NODE_ARGS NODE_ARGS |
| #define NODE_ARGS NODE_ARGS |
Referenced by count_nodes(), gc_mark_children(), iseq_set_arguments(), new_args_tail_gen(), and obj_free().
| #define NODE_ARGS_AUX NODE_ARGS_AUX |
| #define NODE_ARGS_AUX NODE_ARGS_AUX |
| #define NODE_ARGS_AUX NODE_ARGS_AUX |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_ARGSCAT NODE_ARGSCAT |
| #define NODE_ARGSCAT NODE_ARGSCAT |
| #define NODE_ARGSCAT NODE_ARGSCAT |
Referenced by arg_append_gen(), arg_concat_gen(), count_nodes(), gc_mark_children(), iseq_compile_each(), and setup_args().
| #define NODE_ARGSPUSH NODE_ARGSPUSH |
| #define NODE_ARGSPUSH NODE_ARGSPUSH |
| #define NODE_ARGSPUSH NODE_ARGSPUSH |
Referenced by arg_append_gen(), arg_concat_gen(), count_nodes(), iseq_compile_each(), and setup_args().
| #define NODE_ARRAY NODE_ARRAY |
| #define NODE_ARRAY NODE_ARRAY |
| #define NODE_ARRAY NODE_ARRAY |
| #define NODE_ATTRASGN NODE_ATTRASGN |
| #define NODE_ATTRASGN NODE_ATTRASGN |
| #define NODE_ATTRASGN NODE_ATTRASGN |
Referenced by compile_massign_lhs(), count_nodes(), defined_expr(), and node_assign_gen().
| #define NODE_BACK_REF NODE_BACK_REF |
| #define NODE_BACK_REF NODE_BACK_REF |
| #define NODE_BACK_REF NODE_BACK_REF |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), rb_backref_error_gen(), and void_expr_gen().
| #define NODE_BEGIN NODE_BEGIN |
| #define NODE_BEGIN NODE_BEGIN |
| #define NODE_BEGIN NODE_BEGIN |
Referenced by count_nodes(), dump_node(), iseq_compile_each(), reduce_nodes_gen(), remove_begin(), remove_begin_all(), value_expr_gen(), and yyparse().
| #define NODE_BLOCK NODE_BLOCK |
| #define NODE_BLOCK NODE_BLOCK |
| #define NODE_BLOCK NODE_BLOCK |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), reduce_nodes_gen(), value_expr_gen(), void_stmts_gen(), and yyparse().
| #define NODE_BLOCK_ARG NODE_BLOCK_ARG |
| #define NODE_BLOCK_ARG NODE_BLOCK_ARG |
| #define NODE_BLOCK_ARG NODE_BLOCK_ARG |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_BLOCK_PASS NODE_BLOCK_PASS |
| #define NODE_BLOCK_PASS NODE_BLOCK_PASS |
| #define NODE_BLOCK_PASS NODE_BLOCK_PASS |
Referenced by arg_append_gen(), arg_concat_gen(), block_dup_check_gen(), count_nodes(), gc_mark_children(), iseq_compile_each(), no_blockarg(), setup_args(), and yyparse().
| #define NODE_BMETHOD NODE_BMETHOD |
| #define NODE_BMETHOD NODE_BMETHOD |
| #define NODE_BMETHOD NODE_BMETHOD |
Referenced by count_nodes().
| #define NODE_BREAK NODE_BREAK |
| #define NODE_BREAK NODE_BREAK |
| #define NODE_BREAK NODE_BREAK |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and value_expr_gen().
| #define NODE_CALL NODE_CALL |
| #define NODE_CALL NODE_CALL |
| #define NODE_CALL NODE_CALL |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), iseq_compile_each(), node_assign_gen(), and void_expr_gen().
| #define NODE_CASE NODE_CASE |
| #define NODE_CASE NODE_CASE |
| #define NODE_CASE NODE_CASE |
Referenced by count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and reduce_nodes_gen().
| #define NODE_CDECL NODE_CDECL |
| #define NODE_CDECL NODE_CDECL |
| #define NODE_CDECL NODE_CDECL |
Referenced by count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), and node_assign_gen().
| #define NODE_CLASS NODE_CLASS |
| #define NODE_CLASS NODE_CLASS |
| #define NODE_CLASS NODE_CLASS |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_COLON2 NODE_COLON2 |
| #define NODE_COLON2 NODE_COLON2 |
| #define NODE_COLON2 NODE_COLON2 |
Referenced by compile_colon2(), count_nodes(), defined_expr(), gc_mark_children(), iseq_compile_each(), and void_expr_gen().
| #define NODE_COLON3 NODE_COLON3 |
| #define NODE_COLON3 NODE_COLON3 |
| #define NODE_COLON3 NODE_COLON3 |
Referenced by compile_colon2(), compile_cpath(), count_nodes(), defined_expr(), gc_mark_children(), iseq_compile_each(), and void_expr_gen().
| #define NODE_CONST NODE_CONST |
| #define NODE_CONST NODE_CONST |
| #define NODE_CONST NODE_CONST |
Referenced by compile_colon2(), count_nodes(), defined_expr(), and void_expr_gen().
| #define NODE_CREF NODE_CREF |
| #define NODE_CREF NODE_CREF |
| #define NODE_CREF NODE_CREF |
Referenced by count_nodes(), gc_mark_children(), and rb_node_newnode().
| #define NODE_CVAR NODE_CVAR |
| #define NODE_CVAR NODE_CVAR |
| #define NODE_CVAR NODE_CVAR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and void_expr_gen().
| #define NODE_CVASGN NODE_CVASGN |
| #define NODE_CVASGN NODE_CVASGN |
| #define NODE_CVASGN NODE_CVASGN |
Referenced by compile_massign_opt(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), and node_assign_gen().
| #define NODE_CVDECL NODE_CVDECL |
| #define NODE_CVDECL NODE_CVDECL |
| #define NODE_CVDECL NODE_CVDECL |
Referenced by count_nodes(), and defined_expr().
| #define NODE_DASGN NODE_DASGN |
| #define NODE_DASGN NODE_DASGN |
| #define NODE_DASGN NODE_DASGN |
Referenced by assign_in_cond(), compile_massign_opt(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), node_assign_gen(), and yyparse().
| #define NODE_DASGN_CURR NODE_DASGN_CURR |
| #define NODE_DASGN_CURR NODE_DASGN_CURR |
| #define NODE_DASGN_CURR NODE_DASGN_CURR |
Referenced by assign_in_cond(), compile_massign_opt(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), node_assign_gen(), and yyparse().
| #define NODE_DEFINED NODE_DEFINED |
| #define NODE_DEFINED NODE_DEFINED |
| #define NODE_DEFINED NODE_DEFINED |
Referenced by count_nodes(), gc_mark_children(), and void_expr_gen().
| #define NODE_DEFN NODE_DEFN |
| #define NODE_DEFN NODE_DEFN |
| #define NODE_DEFN NODE_DEFN |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_DEFS NODE_DEFS |
| #define NODE_DEFS NODE_DEFS |
| #define NODE_DEFS NODE_DEFS |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_DOT2 NODE_DOT2 |
| #define NODE_DOT2 NODE_DOT2 |
| #define NODE_DOT2 NODE_DOT2 |
Referenced by cond0(), count_nodes(), enum_zip(), fixup_nodes(), gc_mark_children(), and void_expr_gen().
| #define NODE_DOT3 NODE_DOT3 |
| #define NODE_DOT3 NODE_DOT3 |
| #define NODE_DOT3 NODE_DOT3 |
Referenced by cond0(), count_nodes(), fixup_nodes(), gc_mark_children(), and void_expr_gen().
| #define NODE_DREGX NODE_DREGX |
| #define NODE_DREGX NODE_DREGX |
| #define NODE_DREGX NODE_DREGX |
Referenced by cond0(), count_nodes(), gc_mark_children(), literal_node(), match_op_gen(), void_expr_gen(), and yyparse().
| #define NODE_DREGX_ONCE NODE_DREGX_ONCE |
| #define NODE_DREGX_ONCE NODE_DREGX_ONCE |
| #define NODE_DREGX_ONCE NODE_DREGX_ONCE |
Referenced by cond0(), count_nodes(), gc_mark_children(), literal_node(), match_op_gen(), void_expr_gen(), and yyparse().
| #define NODE_DSTR NODE_DSTR |
| #define NODE_DSTR NODE_DSTR |
| #define NODE_DSTR NODE_DSTR |
Referenced by cond0(), count_nodes(), dsym_node_gen(), gc_mark_children(), literal_concat_gen(), literal_node(), new_evstr_gen(), void_expr_gen(), and yyparse().
| #define NODE_DSYM NODE_DSYM |
| #define NODE_DSYM NODE_DSYM |
| #define NODE_DSYM NODE_DSYM |
Referenced by cond0(), count_nodes(), dsym_node_gen(), and literal_node().
| #define NODE_DVAR NODE_DVAR |
| #define NODE_DVAR NODE_DVAR |
| #define NODE_DVAR NODE_DVAR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and void_expr_gen().
| #define NODE_DXSTR NODE_DXSTR |
| #define NODE_DXSTR NODE_DXSTR |
| #define NODE_DXSTR NODE_DXSTR |
Referenced by count_nodes(), gc_mark_children(), and yyparse().
| #define NODE_ENSURE NODE_ENSURE |
| #define NODE_ENSURE NODE_ENSURE |
| #define NODE_ENSURE NODE_ENSURE |
Referenced by count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), reduce_nodes_gen(), and yyparse().
| #define NODE_ERRINFO NODE_ERRINFO |
| #define NODE_ERRINFO NODE_ERRINFO |
| #define NODE_ERRINFO NODE_ERRINFO |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_EVSTR NODE_EVSTR |
| #define NODE_EVSTR NODE_EVSTR |
| #define NODE_EVSTR NODE_EVSTR |
Referenced by cond0(), count_nodes(), evstr2dstr_gen(), gc_mark_children(), literal_concat_gen(), literal_node(), and new_evstr_gen().
| #define NODE_FALSE NODE_FALSE |
| #define NODE_FALSE NODE_FALSE |
| #define NODE_FALSE NODE_FALSE |
| #define NODE_FCALL NODE_FCALL |
| #define NODE_FCALL NODE_FCALL |
| #define NODE_FCALL NODE_FCALL |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define NODE_FL_CREF_OMOD_SHARED (((VALUE)1)<<16) |
| #define NODE_FL_CREF_PUSHED_BY_EVAL (((VALUE)1)<<15) |
Definition at line 276 of file node.h.
Referenced by eval_under(), rb_mod_nesting(), rb_mod_s_constants(), rb_yield_refine_block(), vm_get_const_base(), vm_get_cvar_base(), vm_get_ev_const(), and yield_under().
| #define NODE_FL_NEWLINE (((VALUE)1)<<7) |
Definition at line 275 of file node.h.
Referenced by iseq_compile_each(), newline_node(), and reduce_nodes_gen().
| #define NODE_FLIP2 NODE_FLIP2 |
| #define NODE_FLIP2 NODE_FLIP2 |
| #define NODE_FLIP2 NODE_FLIP2 |
Referenced by cond0(), count_nodes(), and gc_mark_children().
| #define NODE_FLIP3 NODE_FLIP3 |
| #define NODE_FLIP3 NODE_FLIP3 |
| #define NODE_FLIP3 NODE_FLIP3 |
Referenced by cond0(), count_nodes(), and gc_mark_children().
| #define NODE_FOR NODE_FOR |
| #define NODE_FOR NODE_FOR |
| #define NODE_FOR NODE_FOR |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_GASGN NODE_GASGN |
| #define NODE_GASGN NODE_GASGN |
| #define NODE_GASGN NODE_GASGN |
Referenced by assign_in_cond(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), and node_assign_gen().
| #define NODE_GVAR NODE_GVAR |
| #define NODE_GVAR NODE_GVAR |
| #define NODE_GVAR NODE_GVAR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and void_expr_gen().
| #define NODE_HASH NODE_HASH |
| #define NODE_HASH NODE_HASH |
| #define NODE_HASH NODE_HASH |
Referenced by count_nodes(), gc_mark_children(), and is_static_content().
| #define NODE_IASGN NODE_IASGN |
| #define NODE_IASGN NODE_IASGN |
| #define NODE_IASGN NODE_IASGN |
Referenced by assign_in_cond(), compile_massign_opt(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), and node_assign_gen().
| #define NODE_IASGN2 NODE_IASGN2 |
| #define NODE_IASGN2 NODE_IASGN2 |
| #define NODE_IASGN2 NODE_IASGN2 |
Referenced by compile_massign_opt(), count_nodes(), gc_mark_children(), iseq_compile_each(), and node_assign_gen().
| #define NODE_IF NODE_IF |
| #define NODE_IF NODE_IF |
| #define NODE_IF NODE_IF |
Referenced by count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), reduce_nodes_gen(), and value_expr_gen().
| #define NODE_IFUNC NODE_IFUNC |
| #define NODE_IFUNC NODE_IFUNC |
| #define NODE_IFUNC NODE_IFUNC |
Referenced by count_nodes(), and rb_iseq_compile_node().
| #define NODE_ITER NODE_ITER |
| #define NODE_ITER NODE_ITER |
| #define NODE_ITER NODE_ITER |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_IVAR NODE_IVAR |
| #define NODE_IVAR NODE_IVAR |
| #define NODE_IVAR NODE_IVAR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and void_expr_gen().
| #define NODE_KW_ARG NODE_KW_ARG |
| #define NODE_KW_ARG NODE_KW_ARG |
| #define NODE_KW_ARG NODE_KW_ARG |
Referenced by count_nodes().
| #define NODE_LAMBDA NODE_LAMBDA |
| #define NODE_LAMBDA NODE_LAMBDA |
| #define NODE_LAMBDA NODE_LAMBDA |
Referenced by count_nodes().
| #define NODE_LASGN NODE_LASGN |
| #define NODE_LASGN NODE_LASGN |
| #define NODE_LASGN NODE_LASGN |
Referenced by assign_in_cond(), compile_massign_opt(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), node_assign_gen(), and yyparse().
| #define NODE_LAST NODE_LAST |
| #define NODE_LAST NODE_LAST |
| #define NODE_LAST NODE_LAST |
Referenced by count_nodes().
Referenced by block_append_gen(), case_when_optimizable_literal(), compile_array_(), compile_branch_condition(), cond0(), count_nodes(), defined_expr(), dsym_node_gen(), fixup_nodes(), gc_mark_children(), is_static_content(), iseq_compile_each(), literal_node(), match_op_gen(), range_op(), void_expr_gen(), and yyparse().
| #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) |
| #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) |
| #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) |
| #define NODE_LVAR NODE_LVAR |
| #define NODE_LVAR NODE_LVAR |
| #define NODE_LVAR NODE_LVAR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and void_expr_gen().
| #define NODE_MASGN NODE_MASGN |
| #define NODE_MASGN NODE_MASGN |
| #define NODE_MASGN NODE_MASGN |
Referenced by assign_in_cond(), compile_massign_lhs(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), node_assign_gen(), and yyparse().
| #define NODE_MATCH NODE_MATCH |
| #define NODE_MATCH NODE_MATCH |
| #define NODE_MATCH NODE_MATCH |
Referenced by cond0(), count_nodes(), and gc_mark_children().
| #define NODE_MATCH2 NODE_MATCH2 |
| #define NODE_MATCH2 NODE_MATCH2 |
| #define NODE_MATCH2 NODE_MATCH2 |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_MATCH3 NODE_MATCH3 |
| #define NODE_MATCH3 NODE_MATCH3 |
| #define NODE_MATCH3 NODE_MATCH3 |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_MEMO NODE_MEMO |
| #define NODE_MEMO NODE_MEMO |
| #define NODE_MEMO NODE_MEMO |
Referenced by count_nodes(), and load_lock().
| #define NODE_MODULE NODE_MODULE |
| #define NODE_MODULE NODE_MODULE |
| #define NODE_MODULE NODE_MODULE |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_NEXT NODE_NEXT |
| #define NODE_NEXT NODE_NEXT |
| #define NODE_NEXT NODE_NEXT |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and value_expr_gen().
| #define NODE_NIL NODE_NIL |
| #define NODE_NIL NODE_NIL |
| #define NODE_NIL NODE_NIL |
| #define NODE_NTH_REF NODE_NTH_REF |
| #define NODE_NTH_REF NODE_NTH_REF |
| #define NODE_NTH_REF NODE_NTH_REF |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), rb_backref_error_gen(), and void_expr_gen().
| #define NODE_OP_ASGN1 NODE_OP_ASGN1 |
| #define NODE_OP_ASGN1 NODE_OP_ASGN1 |
| #define NODE_OP_ASGN1 NODE_OP_ASGN1 |
Referenced by count_nodes(), defined_expr(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_OP_ASGN2 NODE_OP_ASGN2 |
| #define NODE_OP_ASGN2 NODE_OP_ASGN2 |
| #define NODE_OP_ASGN2 NODE_OP_ASGN2 |
Referenced by count_nodes(), defined_expr(), dump_node(), and iseq_compile_each().
| #define NODE_OP_ASGN_AND NODE_OP_ASGN_AND |
| #define NODE_OP_ASGN_AND NODE_OP_ASGN_AND |
| #define NODE_OP_ASGN_AND NODE_OP_ASGN_AND |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define NODE_OP_ASGN_OR NODE_OP_ASGN_OR |
| #define NODE_OP_ASGN_OR NODE_OP_ASGN_OR |
| #define NODE_OP_ASGN_OR NODE_OP_ASGN_OR |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define NODE_OP_CDECL NODE_OP_CDECL |
| #define NODE_OP_CDECL NODE_OP_CDECL |
| #define NODE_OP_CDECL NODE_OP_CDECL |
Referenced by count_nodes(), and iseq_compile_each().
| #define NODE_OPT_ARG NODE_OPT_ARG |
| #define NODE_OPT_ARG NODE_OPT_ARG |
| #define NODE_OPT_ARG NODE_OPT_ARG |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_OPT_N NODE_OPT_N |
| #define NODE_OPT_N NODE_OPT_N |
| #define NODE_OPT_N NODE_OPT_N |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_OR NODE_OR |
| #define NODE_OR NODE_OR |
| #define NODE_OR NODE_OR |
Referenced by compile_branch_condition(), cond0(), count_nodes(), defined_expr(), dump_node(), gc_mark_children(), iseq_compile_each(), value_expr_gen(), and yyparse().
| #define NODE_POSTARG NODE_POSTARG |
| #define NODE_POSTARG NODE_POSTARG |
| #define NODE_POSTARG NODE_POSTARG |
Referenced by compile_massign(), and count_nodes().
| #define NODE_POSTEXE NODE_POSTEXE |
| #define NODE_POSTEXE NODE_POSTEXE |
| #define NODE_POSTEXE NODE_POSTEXE |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_PRELUDE NODE_PRELUDE |
| #define NODE_PRELUDE NODE_PRELUDE |
| #define NODE_PRELUDE NODE_PRELUDE |
Referenced by count_nodes(), rb_parser_append_print(), and rb_parser_while_loop().
| #define NODE_REDO NODE_REDO |
| #define NODE_REDO NODE_REDO |
| #define NODE_REDO NODE_REDO |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and value_expr_gen().
| #define NODE_RESBODY NODE_RESBODY |
| #define NODE_RESBODY NODE_RESBODY |
| #define NODE_RESBODY NODE_RESBODY |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_RESCUE NODE_RESCUE |
| #define NODE_RESCUE NODE_RESCUE |
| #define NODE_RESCUE NODE_RESCUE |
Referenced by count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), reduce_nodes_gen(), and yyparse().
| #define NODE_RETRY NODE_RETRY |
| #define NODE_RETRY NODE_RETRY |
| #define NODE_RETRY NODE_RETRY |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and value_expr_gen().
| #define NODE_RETURN NODE_RETURN |
| #define NODE_RETURN NODE_RETURN |
| #define NODE_RETURN NODE_RETURN |
Referenced by block_append_gen(), count_nodes(), dump_node(), gc_mark_children(), reduce_nodes_gen(), and value_expr_gen().
| #define NODE_SCLASS NODE_SCLASS |
| #define NODE_SCLASS NODE_SCLASS |
| #define NODE_SCLASS NODE_SCLASS |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_SCOPE NODE_SCOPE |
| #define NODE_SCOPE NODE_SCOPE |
| #define NODE_SCOPE NODE_SCOPE |
Referenced by count_nodes(), gc_mark_children(), obj_free(), obj_memsize_of(), rb_binding_add_dynavars(), rb_iseq_compile_node(), and yyparse().
| #define NODE_SELF NODE_SELF |
| #define NODE_SELF NODE_SELF |
| #define NODE_SELF NODE_SELF |
Referenced by aryset_gen(), attrset_gen(), block_append_gen(), count_nodes(), defined_expr(), gc_mark_children(), void_expr_gen(), and yyparse().
| #define NODE_SPLAT NODE_SPLAT |
| #define NODE_SPLAT NODE_SPLAT |
| #define NODE_SPLAT NODE_SPLAT |
Referenced by count_nodes(), gc_mark_children(), iseq_compile_each(), setup_args(), and splat_array().
| #define NODE_STR NODE_STR |
| #define NODE_STR NODE_STR |
| #define NODE_STR NODE_STR |
Referenced by block_append_gen(), case_when_optimizable_literal(), compile_branch_condition(), compile_dstr_fragments(), cond0(), count_nodes(), defined_expr(), dsym_node_gen(), gc_mark_children(), is_static_content(), iseq_compile_each(), literal_concat_gen(), literal_node(), new_evstr_gen(), void_expr_gen(), when_vals(), and yyparse().
| #define NODE_SUPER NODE_SUPER |
| #define NODE_SUPER NODE_SUPER |
| #define NODE_SUPER NODE_SUPER |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define NODE_TO_ARY NODE_TO_ARY |
| #define NODE_TO_ARY NODE_TO_ARY |
| #define NODE_TO_ARY NODE_TO_ARY |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_TRUE NODE_TRUE |
| #define NODE_TRUE NODE_TRUE |
| #define NODE_TRUE NODE_TRUE |
| #define NODE_UNDEF NODE_UNDEF |
| #define NODE_UNDEF NODE_UNDEF |
| #define NODE_UNDEF NODE_UNDEF |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_UNTIL NODE_UNTIL |
| #define NODE_UNTIL NODE_UNTIL |
| #define NODE_UNTIL NODE_UNTIL |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_VALIAS NODE_VALIAS |
| #define NODE_VALIAS NODE_VALIAS |
| #define NODE_VALIAS NODE_VALIAS |
Referenced by count_nodes(), and gc_mark_children().
| #define NODE_VALUES NODE_VALUES |
| #define NODE_VALUES NODE_VALUES |
| #define NODE_VALUES NODE_VALUES |
Referenced by count_nodes(), and ret_args_gen().
| #define NODE_VCALL NODE_VCALL |
| #define NODE_VCALL NODE_VCALL |
| #define NODE_VCALL NODE_VCALL |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define NODE_WHEN NODE_WHEN |
| #define NODE_WHEN NODE_WHEN |
| #define NODE_WHEN NODE_WHEN |
Referenced by count_nodes(), dump_node(), gc_mark_children(), iseq_compile_each(), and reduce_nodes_gen().
| #define NODE_WHILE NODE_WHILE |
| #define NODE_WHILE NODE_WHILE |
| #define NODE_WHILE NODE_WHILE |
Referenced by count_nodes(), dump_node(), gc_mark_children(), and iseq_compile_each().
| #define NODE_XSTR NODE_XSTR |
| #define NODE_XSTR NODE_XSTR |
| #define NODE_XSTR NODE_XSTR |
Referenced by count_nodes(), gc_mark_children(), and yyparse().
| #define NODE_YIELD NODE_YIELD |
| #define NODE_YIELD NODE_YIELD |
| #define NODE_YIELD NODE_YIELD |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and yyparse().
| #define NODE_ZARRAY NODE_ZARRAY |
| #define NODE_ZARRAY NODE_ZARRAY |
| #define NODE_ZARRAY NODE_ZARRAY |
Referenced by compile_array_(), count_nodes(), defined_expr(), gc_mark_children(), is_static_content(), and iseq_compile_each().
| #define NODE_ZSUPER NODE_ZSUPER |
| #define NODE_ZSUPER NODE_ZSUPER |
| #define NODE_ZSUPER NODE_ZSUPER |
Referenced by count_nodes(), defined_expr(), gc_mark_children(), and iseq_compile_each().
| #define RNODE | ( | obj | ) | (R_CAST(RNode)(obj)) |
Definition at line 266 of file node.h.
Referenced by count_all_i(), count_i(), count_iter_i(), drop_i(), drop_while_i(), each_cons_i(), each_slice_i(), each_with_index_i(), find_i(), find_index_i(), find_index_iter_i(), first_i(), grep_i(), grep_iter_i(), inject_i(), inject_op_i(), load_lock(), max_by_i(), max_i(), max_ii(), member_i(), min_by_i(), min_i(), min_ii(), minmax_i(), minmax_ii(), obj_memsize_of(), partition_i(), rb_catch_protect(), sort_by_i(), and take_i().
| #define roomof | ( | x, | |||
| y | ) | ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| #define roomof | ( | x, | |||
| y | ) | ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| #define roomof | ( | x, | |||
| y | ) | ((sizeof(x) + sizeof(y) - 1) / sizeof(y)) |
| enum node_type |
| NODE* rb_compile_cstr | ( | const char * | , | |
| const char * | , | |||
| int | , | |||
| int | ||||
| ) |
Definition at line 12087 of file ripper.c.
References parser_compile_string(), rb_filesystem_str_new_cstr(), rb_parser_new(), rb_str_new(), and VALUE.
| NODE* rb_compile_file | ( | const char * | , | |
| VALUE | , | |||
| int | ||||
| ) |
Definition at line 12107 of file ripper.c.
References rb_parser_compile_file(), rb_parser_new(), and VALUE.
| NODE* rb_compile_string | ( | const char * | , | |
| VALUE | , | |||
| int | ||||
| ) |
Definition at line 12067 of file ripper.c.
References must_be_ascii_compatible(), parser_compile_string(), rb_filesystem_str_new_cstr(), and rb_parser_new().
| struct rb_global_entry* rb_global_entry | ( | ID | ) |
Definition at line 450 of file variable.c.
References ALLOC, global_variable::block_trace, global_variable::counter, global_variable::data, global_variable::getter, global_entry, global_variable::marker, rb_global_tbl, global_variable::setter, st_add_direct(), st_data_t, st_lookup(), global_variable::trace, undef_getter, undef_marker, and undef_setter.
Referenced by iseq_build_from_ary_body(), rb_alias_variable(), rb_define_hooked_variable(), rb_f_trace_var(), rb_gv_get(), and rb_gv_set().
| VALUE rb_gvar_defined | ( | struct rb_global_entry * | ) |
| VALUE rb_gvar_get | ( | struct rb_global_entry * | ) |
Referenced by rb_gv_get().
| VALUE rb_gvar_set | ( | struct rb_global_entry * | , | |
| VALUE | ||||
| ) |
Referenced by rb_gv_set().
| NODE* rb_node_newnode | ( | enum | node_type, | |
| VALUE | , | |||
| VALUE | , | |||
| VALUE | ||||
| ) |
Definition at line 1360 of file gc.c.
References FL_WB_PROTECTED, nd_set_type, newobj_of(), NODE_CREF, RGENGC_WB_PROTECTED_NODE_CREF, T_NODE, and VALUE.
| NODE* rb_node_newnode_longlife | ( | enum | node_type, | |
| VALUE | , | |||
| VALUE | , | |||
| VALUE | ||||
| ) |
Definition at line 16612 of file ripper.c.
References block_append, nd_type, NEW_ARRAY, NEW_FCALL, NEW_GVAR, node, NODE_PRELUDE, parser_data_type, rb_intern, and TypedData_Get_Struct.
| void* rb_parser_calloc | ( | struct parser_params * | , | |
| size_t | , | |||
| size_t | ||||
| ) |
| NODE* rb_parser_compile_cstr | ( | volatile | VALUE, | |
| const char * | , | |||
| const char * | , | |||
| int | , | |||
| int | ||||
| ) |
Definition at line 12094 of file ripper.c.
References parser_compile_string(), rb_filesystem_str_new_cstr(), rb_str_new(), and VALUE.
| NODE* rb_parser_compile_file | ( | volatile | VALUE, | |
| const char * | , | |||
| VALUE | , | |||
| int | ||||
| ) |
Definition at line 12115 of file ripper.c.
References rb_filesystem_str_new_cstr(), and rb_parser_compile_file_path().
| NODE* rb_parser_compile_file_path | ( | volatile VALUE | vparser, | |
| VALUE | fname, | |||
| VALUE | input, | |||
| int | line | |||
| ) |
Definition at line 12121 of file ripper.c.
References compile_for_eval, lex_gets, lex_input, lex_io_gets(), lex_p, lex_pbeg, lex_pend, node, parser_data_type, RB_GC_GUARD, rb_parse_in_eval(), TypedData_Get_Struct, and yycompile().
| NODE* rb_parser_compile_string | ( | volatile | VALUE, | |
| const char * | , | |||
| VALUE | , | |||
| int | ||||
| ) |
Definition at line 12074 of file ripper.c.
References rb_filesystem_str_new_cstr(), and rb_parser_compile_string_path().
| NODE* rb_parser_compile_string_path | ( | volatile VALUE | vparser, | |
| VALUE | fname, | |||
| VALUE | src, | |||
| int | line | |||
| ) |
Definition at line 12080 of file ripper.c.
References must_be_ascii_compatible(), and parser_compile_string().
| VALUE rb_parser_dump_tree | ( | NODE * | node, | |
| int | comment | |||
| ) |
Definition at line 894 of file node.c.
References buf, dump_node(), node, rb_str_new_cstr(), and VALUE.
| VALUE rb_parser_encoding | ( | VALUE | ) |
Definition at line 17619 of file ripper.c.
References current_enc, parser_data_type, rb_enc_from_encoding(), and TypedData_Get_Struct.
| VALUE rb_parser_end_seen_p | ( | VALUE | ) |
Definition at line 17604 of file ripper.c.
References parser_data_type, Qfalse, Qtrue, ruby__end__seen, and TypedData_Get_Struct.
| void rb_parser_free | ( | struct parser_params * | , | |
| void * | ||||
| ) |
Definition at line 17705 of file ripper.c.
References parser_params::heap, RNode::node, NULL, prev, rb_gc_force_recycle(), RNode::u1, RNode::u2, VALUE, and xfree.
| VALUE rb_parser_get_yydebug | ( | VALUE | ) |
Definition at line 17634 of file ripper.c.
References parser_data_type, 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 17590 of file ripper.c.
References parser_data_type, parser_new(), and TypedData_Wrap_Struct.
| void* rb_parser_realloc | ( | struct parser_params * | , | |
| void * | , | |||
| size_t | ||||
| ) |
Definition at line 17685 of file ripper.c.
References ADD2HEAP, RNode::cnt, cnt, parser_params::heap, HEAPCNT, NEWHEAP, RNode::node, NULL, RNode::u1, RNode::u2, RNode::u3, and xrealloc.
| VALUE rb_parser_set_yydebug | ( | VALUE | , | |
| VALUE | ||||
| ) |
Definition at line 17649 of file ripper.c.
References parser_data_type, RTEST, TypedData_Get_Struct, and yydebug.
Definition at line 16644 of file ripper.c.
References block_append, nd_type, NEW_CALL, NEW_GASGN, NEW_GVAR, NEW_OPT_N, node, NODE_PRELUDE, parser_data_type, rb_intern, and TypedData_Get_Struct.
| struct kwtable* rb_reserved_word | ( | const char * | , | |
| unsigned | int | |||
| ) |
1.4.7