Ruby 3.0.5p211 (2022-11-24 revision ba5cf0f7c52d4d35cc6a173c89eda98ceffa2dcf)
|
Go to the source code of this file.
Data Structures | |
struct | rb_code_position_struct |
struct | rb_code_location_struct |
struct | RNode |
struct | rb_ast_body_struct |
struct | rb_ast_struct |
struct | rb_args_info |
struct | rb_ary_pattern_info |
struct | rb_fnd_pattern_info |
Macros | |
#define | RNODE(obj) ((struct 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) (((n)->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
#define | nd_set_type(n, t) rb_node_set_type(n, t) |
#define | nd_init_type(n, t) (n)->flags=(((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)(n)->flags)>>NODE_LSHIFT) |
#define | nd_set_line(n, l) (n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT)) |
#define | nd_first_column(n) ((int)((n)->nd_loc.beg_pos.column)) |
#define | nd_set_first_column(n, v) ((n)->nd_loc.beg_pos.column = (v)) |
#define | nd_first_lineno(n) ((int)((n)->nd_loc.beg_pos.lineno)) |
#define | nd_set_first_lineno(n, v) ((n)->nd_loc.beg_pos.lineno = (v)) |
#define | nd_first_loc(n) ((n)->nd_loc.beg_pos) |
#define | nd_set_first_loc(n, v) (nd_first_loc(n) = (v)) |
#define | nd_last_column(n) ((int)((n)->nd_loc.end_pos.column)) |
#define | nd_set_last_column(n, v) ((n)->nd_loc.end_pos.column = (v)) |
#define | nd_last_lineno(n) ((int)((n)->nd_loc.end_pos.lineno)) |
#define | nd_set_last_lineno(n, v) ((n)->nd_loc.end_pos.lineno = (v)) |
#define | nd_last_loc(n) ((n)->nd_loc.end_pos) |
#define | nd_set_last_loc(n, v) (nd_last_loc(n) = (v)) |
#define | nd_node_id(n) ((n)->node_id) |
#define | nd_set_node_id(n, id) ((n)->node_id = (id)) |
#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_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.id |
#define | nd_vid u1.id |
#define | nd_cflag u2.id |
#define | nd_cval u3.value |
#define | nd_oid u1.id |
#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_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_defn u3.node |
#define | nd_cpath u1.node |
#define | nd_super u3.node |
#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_alias u1.id |
#define | nd_orig u2.id |
#define | nd_undef u2.node |
#define | nd_brace u2.argc |
#define | nd_pconst u1.node |
#define | nd_pkwargs u2.node |
#define | nd_pkwrestarg u3.node |
#define | nd_apinfo u3.apinfo |
#define | nd_fpinfo u3.fpinfo |
#define | NEW_NODE(t, a0, a1, a2, loc) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2),loc) |
#define | NEW_NODE_WITH_LOCALS(t, a1, a2, loc) node_newnode_with_locals(p, (t),(VALUE)(a1),(VALUE)(a2),loc) |
#define | NEW_DEFN(i, a, d, loc) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d,loc),loc) |
#define | NEW_DEFS(r, i, a, d, loc) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d,loc),loc) |
#define | NEW_SCOPE(a, b, loc) NEW_NODE_WITH_LOCALS(NODE_SCOPE,b,a,loc) |
#define | NEW_BLOCK(a, loc) NEW_NODE(NODE_BLOCK,a,0,0,loc) |
#define | NEW_IF(c, t, e, loc) NEW_NODE(NODE_IF,c,t,e,loc) |
#define | NEW_UNLESS(c, t, e, loc) NEW_NODE(NODE_UNLESS,c,t,e,loc) |
#define | NEW_CASE(h, b, loc) NEW_NODE(NODE_CASE,h,b,0,loc) |
#define | NEW_CASE2(b, loc) NEW_NODE(NODE_CASE2,0,b,0,loc) |
#define | NEW_CASE3(h, b, loc) NEW_NODE(NODE_CASE3,h,b,0,loc) |
#define | NEW_WHEN(c, t, e, loc) NEW_NODE(NODE_WHEN,c,t,e,loc) |
#define | NEW_IN(c, t, e, loc) NEW_NODE(NODE_IN,c,t,e,loc) |
#define | NEW_WHILE(c, b, n, loc) NEW_NODE(NODE_WHILE,c,b,n,loc) |
#define | NEW_UNTIL(c, b, n, loc) NEW_NODE(NODE_UNTIL,c,b,n,loc) |
#define | NEW_FOR(i, b, loc) NEW_NODE(NODE_FOR,0,b,i,loc) |
#define | NEW_FOR_MASGN(v, loc) NEW_NODE(NODE_FOR_MASGN,v,0,0,loc) |
#define | NEW_ITER(a, b, loc) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b,loc),0,loc) |
#define | NEW_LAMBDA(a, b, loc) NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b,loc),0,loc) |
#define | NEW_BREAK(s, loc) NEW_NODE(NODE_BREAK,s,0,0,loc) |
#define | NEW_NEXT(s, loc) NEW_NODE(NODE_NEXT,s,0,0,loc) |
#define | NEW_REDO(loc) NEW_NODE(NODE_REDO,0,0,0,loc) |
#define | NEW_RETRY(loc) NEW_NODE(NODE_RETRY,0,0,0,loc) |
#define | NEW_BEGIN(b, loc) NEW_NODE(NODE_BEGIN,0,b,0,loc) |
#define | NEW_RESCUE(b, res, e, loc) NEW_NODE(NODE_RESCUE,b,res,e,loc) |
#define | NEW_RESBODY(a, ex, n, loc) NEW_NODE(NODE_RESBODY,n,ex,a,loc) |
#define | NEW_ENSURE(b, en, loc) NEW_NODE(NODE_ENSURE,b,0,en,loc) |
#define | NEW_RETURN(s, loc) NEW_NODE(NODE_RETURN,s,0,0,loc) |
#define | NEW_YIELD(a, loc) NEW_NODE(NODE_YIELD,a,0,0,loc) |
#define | NEW_LIST(a, loc) NEW_NODE(NODE_LIST,a,1,0,loc) |
#define | NEW_ZLIST(loc) NEW_NODE(NODE_ZLIST,0,0,0,loc) |
#define | NEW_HASH(a, loc) NEW_NODE(NODE_HASH,a,0,0,loc) |
#define | NEW_MASGN(l, r, loc) NEW_NODE(NODE_MASGN,l,0,r,loc) |
#define | NEW_GASGN(v, val, loc) NEW_NODE(NODE_GASGN,v,val,v,loc) |
#define | NEW_LASGN(v, val, loc) NEW_NODE(NODE_LASGN,v,val,0,loc) |
#define | NEW_DASGN(v, val, loc) NEW_NODE(NODE_DASGN,v,val,0,loc) |
#define | NEW_DASGN_CURR(v, val, loc) NEW_NODE(NODE_DASGN_CURR,v,val,0,loc) |
#define | NEW_IASGN(v, val, loc) NEW_NODE(NODE_IASGN,v,val,0,loc) |
#define | NEW_CDECL(v, val, path, loc) NEW_NODE(NODE_CDECL,v,val,path,loc) |
#define | NEW_CVASGN(v, val, loc) NEW_NODE(NODE_CVASGN,v,val,0,loc) |
#define | NEW_OP_ASGN1(p, id, a, loc) NEW_NODE(NODE_OP_ASGN1,p,id,a,loc) |
#define | NEW_OP_ASGN2(r, t, i, o, val, loc) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t,loc),loc) |
#define | NEW_OP_ASGN22(i, o, t, loc) NEW_NODE(NODE_OP_ASGN2,i,o,t,loc) |
#define | NEW_OP_ASGN_OR(i, val, loc) NEW_NODE(NODE_OP_ASGN_OR,i,val,0,loc) |
#define | NEW_OP_ASGN_AND(i, val, loc) NEW_NODE(NODE_OP_ASGN_AND,i,val,0,loc) |
#define | NEW_OP_CDECL(v, op, val, loc) NEW_NODE(NODE_OP_CDECL,v,val,op,loc) |
#define | NEW_GVAR(v, loc) NEW_NODE(NODE_GVAR,v,0,v,loc) |
#define | NEW_LVAR(v, loc) NEW_NODE(NODE_LVAR,v,0,0,loc) |
#define | NEW_DVAR(v, loc) NEW_NODE(NODE_DVAR,v,0,0,loc) |
#define | NEW_IVAR(v, loc) NEW_NODE(NODE_IVAR,v,0,0,loc) |
#define | NEW_CONST(v, loc) NEW_NODE(NODE_CONST,v,0,0,loc) |
#define | NEW_CVAR(v, loc) NEW_NODE(NODE_CVAR,v,0,0,loc) |
#define | NEW_NTH_REF(n, loc) NEW_NODE(NODE_NTH_REF,0,n,0,loc) |
#define | NEW_BACK_REF(n, loc) NEW_NODE(NODE_BACK_REF,0,n,0,loc) |
#define | NEW_MATCH(c, loc) NEW_NODE(NODE_MATCH,c,0,0,loc) |
#define | NEW_MATCH2(n1, n2, loc) NEW_NODE(NODE_MATCH2,n1,n2,0,loc) |
#define | NEW_MATCH3(r, n2, loc) NEW_NODE(NODE_MATCH3,r,n2,0,loc) |
#define | NEW_LIT(l, loc) NEW_NODE(NODE_LIT,l,0,0,loc) |
#define | NEW_STR(s, loc) NEW_NODE(NODE_STR,s,0,0,loc) |
#define | NEW_DSTR(s, loc) NEW_NODE(NODE_DSTR,s,1,0,loc) |
#define | NEW_XSTR(s, loc) NEW_NODE(NODE_XSTR,s,0,0,loc) |
#define | NEW_DXSTR(s, loc) NEW_NODE(NODE_DXSTR,s,0,0,loc) |
#define | NEW_DSYM(s, loc) NEW_NODE(NODE_DSYM,s,0,0,loc) |
#define | NEW_EVSTR(n, loc) NEW_NODE(NODE_EVSTR,0,(n),0,loc) |
#define | NEW_CALL(r, m, a, loc) NEW_NODE(NODE_CALL,r,m,a,loc) |
#define | NEW_OPCALL(r, m, a, loc) NEW_NODE(NODE_OPCALL,r,m,a,loc) |
#define | NEW_FCALL(m, a, loc) NEW_NODE(NODE_FCALL,0,m,a,loc) |
#define | NEW_VCALL(m, loc) NEW_NODE(NODE_VCALL,0,m,0,loc) |
#define | NEW_SUPER(a, loc) NEW_NODE(NODE_SUPER,0,0,a,loc) |
#define | NEW_ZSUPER(loc) NEW_NODE(NODE_ZSUPER,0,0,0,loc) |
#define | NEW_ARGS_AUX(r, b, loc) NEW_NODE(NODE_ARGS_AUX,r,b,0,loc) |
#define | NEW_OPT_ARG(i, v, loc) NEW_NODE(NODE_OPT_ARG,i,v,0,loc) |
#define | NEW_KW_ARG(i, v, loc) NEW_NODE(NODE_KW_ARG,i,v,0,loc) |
#define | NEW_POSTARG(i, v, loc) NEW_NODE(NODE_POSTARG,i,v,0,loc) |
#define | NEW_ARGSCAT(a, b, loc) NEW_NODE(NODE_ARGSCAT,a,b,0,loc) |
#define | NEW_ARGSPUSH(a, b, loc) NEW_NODE(NODE_ARGSPUSH,a,b,0,loc) |
#define | NEW_SPLAT(a, loc) NEW_NODE(NODE_SPLAT,a,0,0,loc) |
#define | NEW_BLOCK_PASS(b, loc) NEW_NODE(NODE_BLOCK_PASS,0,b,0,loc) |
#define | NEW_ALIAS(n, o, loc) NEW_NODE(NODE_ALIAS,n,o,0,loc) |
#define | NEW_VALIAS(n, o, loc) NEW_NODE(NODE_VALIAS,n,o,0,loc) |
#define | NEW_UNDEF(i, loc) NEW_NODE(NODE_UNDEF,0,i,0,loc) |
#define | NEW_CLASS(n, b, s, loc) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b,loc),(s),loc) |
#define | NEW_SCLASS(r, b, loc) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b,loc),0,loc) |
#define | NEW_MODULE(n, b, loc) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b,loc),0,loc) |
#define | NEW_COLON2(c, i, loc) NEW_NODE(NODE_COLON2,c,i,0,loc) |
#define | NEW_COLON3(i, loc) NEW_NODE(NODE_COLON3,0,i,0,loc) |
#define | NEW_DOT2(b, e, loc) NEW_NODE(NODE_DOT2,b,e,0,loc) |
#define | NEW_DOT3(b, e, loc) NEW_NODE(NODE_DOT3,b,e,0,loc) |
#define | NEW_SELF(loc) NEW_NODE(NODE_SELF,0,0,1,loc) |
#define | NEW_NIL(loc) NEW_NODE(NODE_NIL,0,0,0,loc) |
#define | NEW_TRUE(loc) NEW_NODE(NODE_TRUE,0,0,0,loc) |
#define | NEW_FALSE(loc) NEW_NODE(NODE_FALSE,0,0,0,loc) |
#define | NEW_ERRINFO(loc) NEW_NODE(NODE_ERRINFO,0,0,0,loc) |
#define | NEW_DEFINED(e, loc) NEW_NODE(NODE_DEFINED,e,0,0,loc) |
#define | NEW_PREEXE(b, loc) NEW_SCOPE(b,loc) |
#define | NEW_POSTEXE(b, loc) NEW_NODE(NODE_POSTEXE,0,b,0,loc) |
#define | NEW_ATTRASGN(r, m, a, loc) NEW_NODE(NODE_ATTRASGN,r,m,a,loc) |
#define | NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1) |
#define | NODE_REQUIRED_KEYWORD_P(node) ((node)->nd_value == NODE_SPECIAL_REQUIRED_KEYWORD) |
#define | NODE_SPECIAL_NO_NAME_REST ((NODE *)-1) |
#define | NODE_NAMED_REST_P(node) ((node) != NODE_SPECIAL_NO_NAME_REST) |
#define | NODE_SPECIAL_EXCESSIVE_COMMA ((ID)1) |
#define | NODE_SPECIAL_NO_REST_KEYWORD ((NODE *)-1) |
Typedefs | |
typedef struct rb_code_position_struct | rb_code_position_t |
typedef struct rb_code_location_struct | rb_code_location_t |
typedef struct RNode | NODE |
typedef struct node_buffer_struct | node_buffer_t |
typedef struct rb_ast_body_struct | rb_ast_body_t |
typedef struct rb_ast_struct | rb_ast_t |
#define nd_first_column | ( | n | ) | ((int)((n)->nd_loc.beg_pos.column)) |
#define nd_first_lineno | ( | n | ) | ((int)((n)->nd_loc.beg_pos.lineno)) |
#define nd_init_type | ( | n, | |
t | |||
) | (n)->flags=(((n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK)) |
#define nd_last_column | ( | n | ) | ((int)((n)->nd_loc.end_pos.column)) |
#define nd_last_lineno | ( | n | ) | ((int)((n)->nd_loc.end_pos.lineno)) |
#define nd_line | ( | n | ) | (int)(((SIGNED_VALUE)(n)->flags)>>NODE_LSHIFT) |
#define nd_set_first_column | ( | n, | |
v | |||
) | ((n)->nd_loc.beg_pos.column = (v)) |
#define nd_set_first_lineno | ( | n, | |
v | |||
) | ((n)->nd_loc.beg_pos.lineno = (v)) |
#define nd_set_first_loc | ( | n, | |
v | |||
) | (nd_first_loc(n) = (v)) |
#define nd_set_last_column | ( | n, | |
v | |||
) | ((n)->nd_loc.end_pos.column = (v)) |
#define nd_set_last_lineno | ( | n, | |
v | |||
) | ((n)->nd_loc.end_pos.lineno = (v)) |
#define nd_set_last_loc | ( | n, | |
v | |||
) | (nd_last_loc(n) = (v)) |
#define nd_set_line | ( | n, | |
l | |||
) | (n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT)) |
#define nd_type | ( | n | ) | ((int) (((n)->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT)) |
#define NEW_ALIAS | ( | n, | |
o, | |||
loc | |||
) | NEW_NODE(NODE_ALIAS,n,o,0,loc) |
#define NEW_ARGS_AUX | ( | r, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_ARGS_AUX,r,b,0,loc) |
#define NEW_ARGSCAT | ( | a, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_ARGSCAT,a,b,0,loc) |
#define NEW_ARGSPUSH | ( | a, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_ARGSPUSH,a,b,0,loc) |
#define NEW_ATTRASGN | ( | r, | |
m, | |||
a, | |||
loc | |||
) | NEW_NODE(NODE_ATTRASGN,r,m,a,loc) |
#define NEW_BACK_REF | ( | n, | |
loc | |||
) | NEW_NODE(NODE_BACK_REF,0,n,0,loc) |
#define NEW_BEGIN | ( | b, | |
loc | |||
) | NEW_NODE(NODE_BEGIN,0,b,0,loc) |
#define NEW_BLOCK | ( | a, | |
loc | |||
) | NEW_NODE(NODE_BLOCK,a,0,0,loc) |
#define NEW_BLOCK_PASS | ( | b, | |
loc | |||
) | NEW_NODE(NODE_BLOCK_PASS,0,b,0,loc) |
#define NEW_BREAK | ( | s, | |
loc | |||
) | NEW_NODE(NODE_BREAK,s,0,0,loc) |
#define NEW_CASE2 | ( | b, | |
loc | |||
) | NEW_NODE(NODE_CASE2,0,b,0,loc) |
#define NEW_CASE3 | ( | h, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_CASE3,h,b,0,loc) |
#define NEW_CDECL | ( | v, | |
val, | |||
path, | |||
loc | |||
) | NEW_NODE(NODE_CDECL,v,val,path,loc) |
#define NEW_CLASS | ( | n, | |
b, | |||
s, | |||
loc | |||
) | NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b,loc),(s),loc) |
#define NEW_COLON2 | ( | c, | |
i, | |||
loc | |||
) | NEW_NODE(NODE_COLON2,c,i,0,loc) |
#define NEW_COLON3 | ( | i, | |
loc | |||
) | NEW_NODE(NODE_COLON3,0,i,0,loc) |
#define NEW_CONST | ( | v, | |
loc | |||
) | NEW_NODE(NODE_CONST,v,0,0,loc) |
#define NEW_CVASGN | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_CVASGN,v,val,0,loc) |
#define NEW_DASGN | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_DASGN,v,val,0,loc) |
#define NEW_DASGN_CURR | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_DASGN_CURR,v,val,0,loc) |
#define NEW_DEFINED | ( | e, | |
loc | |||
) | NEW_NODE(NODE_DEFINED,e,0,0,loc) |
#define NEW_DXSTR | ( | s, | |
loc | |||
) | NEW_NODE(NODE_DXSTR,s,0,0,loc) |
#define NEW_ENSURE | ( | b, | |
en, | |||
loc | |||
) | NEW_NODE(NODE_ENSURE,b,0,en,loc) |
#define NEW_ERRINFO | ( | loc | ) | NEW_NODE(NODE_ERRINFO,0,0,0,loc) |
#define NEW_EVSTR | ( | n, | |
loc | |||
) | NEW_NODE(NODE_EVSTR,0,(n),0,loc) |
#define NEW_FALSE | ( | loc | ) | NEW_NODE(NODE_FALSE,0,0,0,loc) |
#define NEW_FCALL | ( | m, | |
a, | |||
loc | |||
) | NEW_NODE(NODE_FCALL,0,m,a,loc) |
#define NEW_FOR_MASGN | ( | v, | |
loc | |||
) | NEW_NODE(NODE_FOR_MASGN,v,0,0,loc) |
#define NEW_GASGN | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_GASGN,v,val,v,loc) |
#define NEW_IASGN | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_IASGN,v,val,0,loc) |
#define NEW_KW_ARG | ( | i, | |
v, | |||
loc | |||
) | NEW_NODE(NODE_KW_ARG,i,v,0,loc) |
#define NEW_LAMBDA | ( | a, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b,loc),0,loc) |
#define NEW_LASGN | ( | v, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_LASGN,v,val,0,loc) |
#define NEW_MASGN | ( | l, | |
r, | |||
loc | |||
) | NEW_NODE(NODE_MASGN,l,0,r,loc) |
#define NEW_MATCH | ( | c, | |
loc | |||
) | NEW_NODE(NODE_MATCH,c,0,0,loc) |
#define NEW_MATCH2 | ( | n1, | |
n2, | |||
loc | |||
) | NEW_NODE(NODE_MATCH2,n1,n2,0,loc) |
#define NEW_MATCH3 | ( | r, | |
n2, | |||
loc | |||
) | NEW_NODE(NODE_MATCH3,r,n2,0,loc) |
#define NEW_MODULE | ( | n, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b,loc),0,loc) |
#define NEW_NTH_REF | ( | n, | |
loc | |||
) | NEW_NODE(NODE_NTH_REF,0,n,0,loc) |
#define NEW_OP_ASGN1 | ( | p, | |
id, | |||
a, | |||
loc | |||
) | NEW_NODE(NODE_OP_ASGN1,p,id,a,loc) |
#define NEW_OP_ASGN2 | ( | r, | |
t, | |||
i, | |||
o, | |||
val, | |||
loc | |||
) | NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t,loc),loc) |
#define NEW_OP_ASGN22 | ( | i, | |
o, | |||
t, | |||
loc | |||
) | NEW_NODE(NODE_OP_ASGN2,i,o,t,loc) |
#define NEW_OP_ASGN_AND | ( | i, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_OP_ASGN_AND,i,val,0,loc) |
#define NEW_OP_ASGN_OR | ( | i, | |
val, | |||
loc | |||
) | NEW_NODE(NODE_OP_ASGN_OR,i,val,0,loc) |
#define NEW_OP_CDECL | ( | v, | |
op, | |||
val, | |||
loc | |||
) | NEW_NODE(NODE_OP_CDECL,v,val,op,loc) |
#define NEW_OPCALL | ( | r, | |
m, | |||
a, | |||
loc | |||
) | NEW_NODE(NODE_OPCALL,r,m,a,loc) |
#define NEW_OPT_ARG | ( | i, | |
v, | |||
loc | |||
) | NEW_NODE(NODE_OPT_ARG,i,v,0,loc) |
#define NEW_POSTARG | ( | i, | |
v, | |||
loc | |||
) | NEW_NODE(NODE_POSTARG,i,v,0,loc) |
#define NEW_POSTEXE | ( | b, | |
loc | |||
) | NEW_NODE(NODE_POSTEXE,0,b,0,loc) |
#define NEW_RESBODY | ( | a, | |
ex, | |||
n, | |||
loc | |||
) | NEW_NODE(NODE_RESBODY,n,ex,a,loc) |
#define NEW_RESCUE | ( | b, | |
res, | |||
e, | |||
loc | |||
) | NEW_NODE(NODE_RESCUE,b,res,e,loc) |
#define NEW_RETRY | ( | loc | ) | NEW_NODE(NODE_RETRY,0,0,0,loc) |
#define NEW_RETURN | ( | s, | |
loc | |||
) | NEW_NODE(NODE_RETURN,s,0,0,loc) |
#define NEW_SCLASS | ( | r, | |
b, | |||
loc | |||
) | NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b,loc),0,loc) |
#define NEW_SCOPE | ( | a, | |
b, | |||
loc | |||
) | NEW_NODE_WITH_LOCALS(NODE_SCOPE,b,a,loc) |
#define NEW_SPLAT | ( | a, | |
loc | |||
) | NEW_NODE(NODE_SPLAT,a,0,0,loc) |
#define NEW_SUPER | ( | a, | |
loc | |||
) | NEW_NODE(NODE_SUPER,0,0,a,loc) |
#define NEW_UNDEF | ( | i, | |
loc | |||
) | NEW_NODE(NODE_UNDEF,0,i,0,loc) |
#define NEW_UNLESS | ( | c, | |
t, | |||
e, | |||
loc | |||
) | NEW_NODE(NODE_UNLESS,c,t,e,loc) |
#define NEW_UNTIL | ( | c, | |
b, | |||
n, | |||
loc | |||
) | NEW_NODE(NODE_UNTIL,c,b,n,loc) |
#define NEW_VALIAS | ( | n, | |
o, | |||
loc | |||
) | NEW_NODE(NODE_VALIAS,n,o,0,loc) |
#define NEW_VCALL | ( | m, | |
loc | |||
) | NEW_NODE(NODE_VCALL,0,m,0,loc) |
#define NEW_WHILE | ( | c, | |
b, | |||
n, | |||
loc | |||
) | NEW_NODE(NODE_WHILE,c,b,n,loc) |
#define NEW_YIELD | ( | a, | |
loc | |||
) | NEW_NODE(NODE_YIELD,a,0,0,loc) |
#define NEW_ZLIST | ( | loc | ) | NEW_NODE(NODE_ZLIST,0,0,0,loc) |
#define NEW_ZSUPER | ( | loc | ) | NEW_NODE(NODE_ZSUPER,0,0,0,loc) |
#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1) |
#define NODE_LSHIFT (NODE_TYPESHIFT+7) |
#define NODE_NAMED_REST_P | ( | node | ) | ((node) != NODE_SPECIAL_NO_NAME_REST) |
#define NODE_REQUIRED_KEYWORD_P | ( | node | ) | ((node)->nd_value == NODE_SPECIAL_REQUIRED_KEYWORD) |
#define NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT) |
typedef struct node_buffer_struct node_buffer_t |
typedef struct rb_ast_body_struct rb_ast_body_t |
typedef struct rb_ast_struct rb_ast_t |
typedef struct rb_code_location_struct rb_code_location_t |
typedef struct rb_code_position_struct rb_code_position_t |
enum node_type |
Definition at line 1283 of file node.c.
References int(), node_buffer_struct::local_tables, and rb_ast_struct::node_buffer.
Referenced by yyparse().
Definition at line 1454 of file node.c.
References node_buffer_struct::mark_hash, NIL_P, rb_ast_struct::node_buffer, Qtrue, rb_hash_aset(), rb_ident_hash_new(), and RB_OBJ_WRITE.
void rb_ast_dispose | ( | rb_ast_t * | ast | ) |
Definition at line 1448 of file node.c.
References rb_ast_free().
void rb_ast_free | ( | rb_ast_t * | ast | ) |
Definition at line 1413 of file node.c.
References rb_ast_struct::node_buffer.
Referenced by rb_ast_dispose().
void rb_ast_mark | ( | rb_ast_t * | ast | ) |
Definition at line 1401 of file node.c.
References rb_ast_struct::body, rb_ast_body_struct::compile_option, node_buffer_struct::mark_hash, node_buffer_struct::markable, rb_ast_struct::node_buffer, NULL, and rb_gc_mark().
Definition at line 1434 of file node.c.
References node_buffer_struct::markable, NODE_BUF_DEFAULT_LEN, rb_ast_struct::node_buffer, offsetof, and node_buffer_struct::unmarkable.
rb_ast_t * rb_ast_new | ( | void | ) |
Definition at line 1299 of file node.c.
References imemo_ast, and rb_imemo_new().
Definition at line 1264 of file node.c.
References node_buffer_struct::markable, rb_ast_struct::node_buffer, and node_buffer_struct::unmarkable.
Definition at line 1273 of file node.c.
References nd_type, rb_bug(), and ruby_node_name().
void rb_ast_update_references | ( | rb_ast_t * | ast | ) |
Definition at line 1391 of file node.c.
References node_buffer_struct::markable, rb_ast_struct::node_buffer, and NULL.
Definition at line 4480 of file compile.c.
References FIXABLE, LONG2FIX, nd_type, NODE_FALSE, NODE_LIT, NODE_NIL, NODE_STR, NODE_TRUE, Qfalse, Qnil, Qtrue, Qundef, rb_cNumeric, rb_dbl2big(), rb_fstring(), rb_obj_is_kind_of(), RFLOAT_VALUE, SYMBOL_P, and T_FLOAT.
Definition at line 1139 of file node.c.
References rb_code_location_struct::beg_pos, rb_code_position_struct::column, rb_code_location_struct::end_pos, RNode::flags, rb_code_position_struct::lineno, nd_init_type, RNode::nd_loc, T_NODE, RNode::u1, RNode::u2, RNode::u3, and RNode::value.
Referenced by rb_binding_add_dynavars().
void * rb_parser_calloc | ( | struct parser_params * | p, |
size_t | nelem, | ||
size_t | size | ||
) |
Definition at line 14029 of file ripper.c.
References parser_params::gets, parser_params::input, parser_params::lex, parser_params::pbeg, parser_params::pcur, parser_params::pend, and TypedData_Get_Struct.
rb_ast_t * rb_parser_compile_generic | ( | VALUE | vparser, |
VALUE(*)(VALUE, int) | lex_gets, | ||
VALUE | fname, | ||
VALUE | input, | ||
int | line | ||
) |
Definition at line 14049 of file ripper.c.
References parser_params::call, parser_params::gets, parser_params::gets_, input, parser_params::input, parser_params::lex, parser_params::pbeg, parser_params::pcur, parser_params::pend, and TypedData_Get_Struct.
Definition at line 14008 of file ripper.c.
References f, rb_filesystem_str_new_cstr(), and rb_parser_compile_string_path().
Definition at line 1120 of file node.c.
References rb_str_new_cstr.
Definition at line 20854 of file ripper.c.
References parser_params::enc, rb_enc_from_encoding(), and TypedData_Get_Struct.
Definition at line 20839 of file ripper.c.
References Qfalse, Qtrue, parser_params::ruby__end__seen, and TypedData_Get_Struct.
void rb_parser_free | ( | struct parser_params * | p, |
void * | ptr | ||
) |
Definition at line 20975 of file ripper.c.
References parser_params::heap, NULL, ptr, rb_gc_force_recycle(), and xfree.
void * rb_parser_malloc | ( | struct parser_params * | p, |
size_t | size | ||
) |
VALUE rb_parser_new | ( | void | ) |
Definition at line 20781 of file ripper.c.
References TypedData_Make_Struct.
Referenced by rb_load_file_str().
void rb_parser_printf | ( | struct parser_params * | parser, |
const char * | fmt, | ||
... | |||
) |
Definition at line 20992 of file ripper.c.
References parser_params::debug_buffer, parser_params::debug_output, NIL_P, Qnil, rb_io_write(), rb_str_new, and rb_str_vcatf().
void * rb_parser_realloc | ( | struct parser_params * | p, |
void * | ptr, | ||
size_t | size | ||
) |
Definition at line 20955 of file ripper.c.
References ADD2HEAP, rb_imemo_tmpbuf_struct::cnt, cnt, parser_params::heap, HEAPCNT, NEWHEAP, rb_imemo_tmpbuf_struct::next, NULL, ptr, rb_imemo_tmpbuf_struct::ptr, and xrealloc.
Definition at line 20599 of file ripper.c.
References parser_params::do_chomp, parser_params::do_loop, parser_params::do_print, parser_params::do_split, and TypedData_Get_Struct.
Definition at line 20886 of file ripper.c.
References parser_params::debug, RTEST, and TypedData_Get_Struct.
Definition at line 2593 of file iseq.c.
References rb_bug().
Referenced by rb_ast_node_type_change(), and ruby_debug_print_node().