зеркало из https://github.com/github/ruby.git
parse.y: Make consistent with the terms about code ranges and locations
"loc" was ambiguous; it might refer both a location and a code range. This change uses "loc" for a location, and "crange" or "cr" for a code range. A location (abbr. loc) is a point in a program and consists of line number and column number. A code range (abbr. crange and cr) is a range within a program and consists of a pair of locations which is the first and the last. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@61690 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
Родитель
991c45c56e
Коммит
52057336b7
2
iseq.c
2
iseq.c
|
@ -525,7 +525,7 @@ rb_iseq_new_with_opt(const rb_ast_body_t *ast, VALUE name, VALUE path, VALUE rea
|
|||
new_opt = option ? *option : COMPILE_OPTION_DEFAULT;
|
||||
if (ast && ast->compile_option) rb_iseq_make_compile_option(&new_opt, ast->compile_option);
|
||||
|
||||
prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, parent, type, &new_opt);
|
||||
prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_crange : NULL, parent, type, &new_opt);
|
||||
|
||||
rb_iseq_compile_node(iseq, node);
|
||||
finish_iseq_build(iseq);
|
||||
|
|
8
node.c
8
node.c
|
@ -1038,10 +1038,10 @@ rb_node_init(NODE *n, enum node_type type, VALUE a0, VALUE a1, VALUE a2)
|
|||
n->u1.value = a0;
|
||||
n->u2.value = a1;
|
||||
n->u3.value = a2;
|
||||
n->nd_loc.first_loc.lineno = 0;
|
||||
n->nd_loc.first_loc.column = 0;
|
||||
n->nd_loc.last_loc.lineno = 0;
|
||||
n->nd_loc.last_loc.column = 0;
|
||||
n->nd_crange.first_loc.lineno = 0;
|
||||
n->nd_crange.first_loc.column = 0;
|
||||
n->nd_crange.last_loc.lineno = 0;
|
||||
n->nd_crange.last_loc.column = 0;
|
||||
}
|
||||
|
||||
typedef struct node_buffer_elem_struct {
|
||||
|
|
208
node.h
208
node.h
|
@ -264,7 +264,7 @@ typedef struct RNode {
|
|||
long cnt;
|
||||
VALUE value;
|
||||
} u3;
|
||||
rb_code_range_t nd_loc;
|
||||
rb_code_range_t nd_crange;
|
||||
} NODE;
|
||||
|
||||
#define RNODE(obj) (R_CAST(RNode)(obj))
|
||||
|
@ -289,16 +289,16 @@ typedef struct RNode {
|
|||
#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.first_loc.column))
|
||||
#define nd_set_first_column(n, v) ((n)->nd_loc.first_loc.column = (v))
|
||||
#define nd_first_lineno(n) ((int)((n)->nd_loc.first_loc.lineno))
|
||||
#define nd_set_first_lineno(n, v) ((n)->nd_loc.first_loc.lineno = (v))
|
||||
#define nd_first_column(n) ((int)((n)->nd_crange.first_loc.column))
|
||||
#define nd_set_first_column(n, v) ((n)->nd_crange.first_loc.column = (v))
|
||||
#define nd_first_lineno(n) ((int)((n)->nd_crange.first_loc.lineno))
|
||||
#define nd_set_first_lineno(n, v) ((n)->nd_crange.first_loc.lineno = (v))
|
||||
|
||||
#define nd_last_column(n) ((int)((n)->nd_loc.last_loc.column))
|
||||
#define nd_set_last_column(n, v) ((n)->nd_loc.last_loc.column = (v))
|
||||
#define nd_last_lineno(n) ((int)((n)->nd_loc.last_loc.lineno))
|
||||
#define nd_set_last_lineno(n, v) ((n)->nd_loc.last_loc.lineno = (v))
|
||||
#define nd_last_loc(n) ((n)->nd_loc.last_loc)
|
||||
#define nd_last_column(n) ((int)((n)->nd_crange.last_loc.column))
|
||||
#define nd_set_last_column(n, v) ((n)->nd_crange.last_loc.column = (v))
|
||||
#define nd_last_lineno(n) ((int)((n)->nd_crange.last_loc.lineno))
|
||||
#define nd_set_last_lineno(n, v) ((n)->nd_crange.last_loc.lineno = (v))
|
||||
#define nd_last_loc(n) ((n)->nd_crange.last_loc)
|
||||
#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v))
|
||||
|
||||
#define nd_head u1.node
|
||||
|
@ -369,101 +369,101 @@ typedef struct RNode {
|
|||
|
||||
#define nd_compile_option u3.value
|
||||
|
||||
#define NEW_NODE(t,a0,a1,a2,loc) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2),loc)
|
||||
#define NEW_NODE(t,a0,a1,a2,cr) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2),cr)
|
||||
|
||||
#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(NODE_SCOPE,local_tbl(),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_WHEN(c,t,e,loc) NEW_NODE(NODE_WHEN,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(v,i,b,loc) NEW_NODE(NODE_FOR,v,b,i,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_ARRAY(a,loc)
|
||||
#define NEW_ARRAY(a,loc) NEW_NODE(NODE_ARRAY,a,1,0,loc)
|
||||
#define NEW_ZARRAY(loc) NEW_NODE(NODE_ZARRAY,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,rb_global_entry(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,rb_global_entry(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,0,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 NEW_DEFN(i,a,d,cr) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d,cr),cr)
|
||||
#define NEW_DEFS(r,i,a,d,cr) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d,cr),cr)
|
||||
#define NEW_SCOPE(a,b,cr) NEW_NODE(NODE_SCOPE,local_tbl(),b,a,cr)
|
||||
#define NEW_BLOCK(a,cr) NEW_NODE(NODE_BLOCK,a,0,0,cr)
|
||||
#define NEW_IF(c,t,e,cr) NEW_NODE(NODE_IF,c,t,e,cr)
|
||||
#define NEW_UNLESS(c,t,e,cr) NEW_NODE(NODE_UNLESS,c,t,e,cr)
|
||||
#define NEW_CASE(h,b,cr) NEW_NODE(NODE_CASE,h,b,0,cr)
|
||||
#define NEW_CASE2(b,cr) NEW_NODE(NODE_CASE2,0,b,0,cr)
|
||||
#define NEW_WHEN(c,t,e,cr) NEW_NODE(NODE_WHEN,c,t,e,cr)
|
||||
#define NEW_WHILE(c,b,n,cr) NEW_NODE(NODE_WHILE,c,b,n,cr)
|
||||
#define NEW_UNTIL(c,b,n,cr) NEW_NODE(NODE_UNTIL,c,b,n,cr)
|
||||
#define NEW_FOR(v,i,b,cr) NEW_NODE(NODE_FOR,v,b,i,cr)
|
||||
#define NEW_ITER(a,b,cr) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b,cr),0,cr)
|
||||
#define NEW_LAMBDA(a,b,cr) NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b,cr),0,cr)
|
||||
#define NEW_BREAK(s,cr) NEW_NODE(NODE_BREAK,s,0,0,cr)
|
||||
#define NEW_NEXT(s,cr) NEW_NODE(NODE_NEXT,s,0,0,cr)
|
||||
#define NEW_REDO(cr) NEW_NODE(NODE_REDO,0,0,0,cr)
|
||||
#define NEW_RETRY(cr) NEW_NODE(NODE_RETRY,0,0,0,cr)
|
||||
#define NEW_BEGIN(b,cr) NEW_NODE(NODE_BEGIN,0,b,0,cr)
|
||||
#define NEW_RESCUE(b,res,e,cr) NEW_NODE(NODE_RESCUE,b,res,e,cr)
|
||||
#define NEW_RESBODY(a,ex,n,cr) NEW_NODE(NODE_RESBODY,n,ex,a,cr)
|
||||
#define NEW_ENSURE(b,en,cr) NEW_NODE(NODE_ENSURE,b,0,en,cr)
|
||||
#define NEW_RETURN(s,cr) NEW_NODE(NODE_RETURN,s,0,0,cr)
|
||||
#define NEW_YIELD(a,cr) NEW_NODE(NODE_YIELD,a,0,0,cr)
|
||||
#define NEW_LIST(a,cr) NEW_ARRAY(a,cr)
|
||||
#define NEW_ARRAY(a,cr) NEW_NODE(NODE_ARRAY,a,1,0,cr)
|
||||
#define NEW_ZARRAY(cr) NEW_NODE(NODE_ZARRAY,0,0,0,cr)
|
||||
#define NEW_HASH(a,cr) NEW_NODE(NODE_HASH,a,0,0,cr)
|
||||
#define NEW_MASGN(l,r,cr) NEW_NODE(NODE_MASGN,l,0,r,cr)
|
||||
#define NEW_GASGN(v,val,cr) NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v),cr)
|
||||
#define NEW_LASGN(v,val,cr) NEW_NODE(NODE_LASGN,v,val,0,cr)
|
||||
#define NEW_DASGN(v,val,cr) NEW_NODE(NODE_DASGN,v,val,0,cr)
|
||||
#define NEW_DASGN_CURR(v,val,cr) NEW_NODE(NODE_DASGN_CURR,v,val,0,cr)
|
||||
#define NEW_IASGN(v,val,cr) NEW_NODE(NODE_IASGN,v,val,0,cr)
|
||||
#define NEW_CDECL(v,val,path,cr) NEW_NODE(NODE_CDECL,v,val,path,cr)
|
||||
#define NEW_CVASGN(v,val,cr) NEW_NODE(NODE_CVASGN,v,val,0,cr)
|
||||
#define NEW_OP_ASGN1(p,id,a,cr) NEW_NODE(NODE_OP_ASGN1,p,id,a,cr)
|
||||
#define NEW_OP_ASGN2(r,t,i,o,val,cr) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o,t,cr),cr)
|
||||
#define NEW_OP_ASGN22(i,o,t,cr) NEW_NODE(NODE_OP_ASGN2,i,o,t,cr)
|
||||
#define NEW_OP_ASGN_OR(i,val,cr) NEW_NODE(NODE_OP_ASGN_OR,i,val,0,cr)
|
||||
#define NEW_OP_ASGN_AND(i,val,cr) NEW_NODE(NODE_OP_ASGN_AND,i,val,0,cr)
|
||||
#define NEW_OP_CDECL(v,op,val,cr) NEW_NODE(NODE_OP_CDECL,v,val,op,cr)
|
||||
#define NEW_GVAR(v,cr) NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v),cr)
|
||||
#define NEW_LVAR(v,cr) NEW_NODE(NODE_LVAR,v,0,0,cr)
|
||||
#define NEW_DVAR(v,cr) NEW_NODE(NODE_DVAR,v,0,0,cr)
|
||||
#define NEW_IVAR(v,cr) NEW_NODE(NODE_IVAR,v,0,0,cr)
|
||||
#define NEW_CONST(v,cr) NEW_NODE(NODE_CONST,v,0,0,cr)
|
||||
#define NEW_CVAR(v,cr) NEW_NODE(NODE_CVAR,v,0,0,cr)
|
||||
#define NEW_NTH_REF(n,cr) NEW_NODE(NODE_NTH_REF,0,n,0,cr)
|
||||
#define NEW_BACK_REF(n,cr) NEW_NODE(NODE_BACK_REF,0,n,0,cr)
|
||||
#define NEW_MATCH(c,cr) NEW_NODE(NODE_MATCH,c,0,0,cr)
|
||||
#define NEW_MATCH2(n1,n2,cr) NEW_NODE(NODE_MATCH2,n1,n2,0,cr)
|
||||
#define NEW_MATCH3(r,n2,cr) NEW_NODE(NODE_MATCH3,r,n2,0,cr)
|
||||
#define NEW_LIT(l,cr) NEW_NODE(NODE_LIT,l,0,0,cr)
|
||||
#define NEW_STR(s,cr) NEW_NODE(NODE_STR,s,0,0,cr)
|
||||
#define NEW_DSTR(s,cr) NEW_NODE(NODE_DSTR,s,1,0,cr)
|
||||
#define NEW_XSTR(s,cr) NEW_NODE(NODE_XSTR,s,0,0,cr)
|
||||
#define NEW_DXSTR(s,cr) NEW_NODE(NODE_DXSTR,s,0,0,cr)
|
||||
#define NEW_DSYM(s,cr) NEW_NODE(NODE_DSYM,s,0,0,cr)
|
||||
#define NEW_EVSTR(n,cr) NEW_NODE(NODE_EVSTR,0,(n),0,cr)
|
||||
#define NEW_CALL(r,m,a,cr) NEW_NODE(NODE_CALL,r,m,a,cr)
|
||||
#define NEW_OPCALL(r,m,a,cr) NEW_NODE(NODE_OPCALL,r,m,a,cr)
|
||||
#define NEW_FCALL(m,a,cr) NEW_NODE(NODE_FCALL,0,m,a,cr)
|
||||
#define NEW_VCALL(m,cr) NEW_NODE(NODE_VCALL,0,m,0,cr)
|
||||
#define NEW_SUPER(a,cr) NEW_NODE(NODE_SUPER,0,0,a,cr)
|
||||
#define NEW_ZSUPER(cr) NEW_NODE(NODE_ZSUPER,0,0,0,cr)
|
||||
#define NEW_ARGS_AUX(r,b,cr) NEW_NODE(NODE_ARGS_AUX,r,b,0,cr)
|
||||
#define NEW_OPT_ARG(i,v,cr) NEW_NODE(NODE_OPT_ARG,i,v,0,cr)
|
||||
#define NEW_KW_ARG(i,v,cr) NEW_NODE(NODE_KW_ARG,i,v,0,cr)
|
||||
#define NEW_POSTARG(i,v,cr) NEW_NODE(NODE_POSTARG,i,v,0,cr)
|
||||
#define NEW_ARGSCAT(a,b,cr) NEW_NODE(NODE_ARGSCAT,a,b,0,cr)
|
||||
#define NEW_ARGSPUSH(a,b,cr) NEW_NODE(NODE_ARGSPUSH,a,b,0,cr)
|
||||
#define NEW_SPLAT(a,cr) NEW_NODE(NODE_SPLAT,a,0,0,cr)
|
||||
#define NEW_BLOCK_PASS(b,cr) NEW_NODE(NODE_BLOCK_PASS,0,b,0,cr)
|
||||
#define NEW_ALIAS(n,o,cr) NEW_NODE(NODE_ALIAS,n,o,0,cr)
|
||||
#define NEW_VALIAS(n,o,cr) NEW_NODE(NODE_VALIAS,n,o,0,cr)
|
||||
#define NEW_UNDEF(i,cr) NEW_NODE(NODE_UNDEF,0,i,0,cr)
|
||||
#define NEW_CLASS(n,b,s,cr) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b,cr),(s),cr)
|
||||
#define NEW_SCLASS(r,b,cr) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b,cr),0,cr)
|
||||
#define NEW_MODULE(n,b,cr) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b,cr),0,cr)
|
||||
#define NEW_COLON2(c,i,cr) NEW_NODE(NODE_COLON2,c,i,0,cr)
|
||||
#define NEW_COLON3(i,cr) NEW_NODE(NODE_COLON3,0,i,0,cr)
|
||||
#define NEW_DOT2(b,e,cr) NEW_NODE(NODE_DOT2,b,e,0,cr)
|
||||
#define NEW_DOT3(b,e,cr) NEW_NODE(NODE_DOT3,b,e,0,cr)
|
||||
#define NEW_SELF(cr) NEW_NODE(NODE_SELF,0,0,0,cr)
|
||||
#define NEW_NIL(cr) NEW_NODE(NODE_NIL,0,0,0,cr)
|
||||
#define NEW_TRUE(cr) NEW_NODE(NODE_TRUE,0,0,0,cr)
|
||||
#define NEW_FALSE(cr) NEW_NODE(NODE_FALSE,0,0,0,cr)
|
||||
#define NEW_ERRINFO(cr) NEW_NODE(NODE_ERRINFO,0,0,0,cr)
|
||||
#define NEW_DEFINED(e,cr) NEW_NODE(NODE_DEFINED,e,0,0,cr)
|
||||
#define NEW_PREEXE(b,cr) NEW_SCOPE(b,cr)
|
||||
#define NEW_POSTEXE(b,cr) NEW_NODE(NODE_POSTEXE,0,b,0,cr)
|
||||
#define NEW_ATTRASGN(r,m,a,cr) NEW_NODE(NODE_ATTRASGN,r,m,a,cr)
|
||||
|
||||
#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1)
|
||||
#define NODE_SPECIAL_NO_NAME_REST ((NODE *)-1)
|
||||
|
|
596
parse.y
596
parse.y
Разница между файлами не показана из-за своего большого размера
Загрузить разницу
Загрузка…
Ссылка в новой задаче