mutant-melbourne 2.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/LICENSE +25 -0
- data/README.md +69 -0
- data/Rakefile +14 -0
- data/ext/melbourne/.gitignore +3 -0
- data/ext/melbourne/bstring-license.txt +29 -0
- data/ext/melbourne/bstrlib.c +2687 -0
- data/ext/melbourne/bstrlib.h +267 -0
- data/ext/melbourne/encoding_compat.cpp +188 -0
- data/ext/melbourne/encoding_compat.hpp +57 -0
- data/ext/melbourne/extconf.rb +87 -0
- data/ext/melbourne/grammar18.cpp +11280 -0
- data/ext/melbourne/grammar18.hpp +13 -0
- data/ext/melbourne/grammar18.y +6088 -0
- data/ext/melbourne/grammar19.cpp +12420 -0
- data/ext/melbourne/grammar19.hpp +11 -0
- data/ext/melbourne/grammar19.y +7113 -0
- data/ext/melbourne/lex.c.blt +152 -0
- data/ext/melbourne/lex.c.tab +136 -0
- data/ext/melbourne/local_state.hpp +43 -0
- data/ext/melbourne/melbourne.cpp +88 -0
- data/ext/melbourne/melbourne.hpp +19 -0
- data/ext/melbourne/node18.hpp +262 -0
- data/ext/melbourne/node19.hpp +271 -0
- data/ext/melbourne/node_types.rb +304 -0
- data/ext/melbourne/node_types18.cpp +255 -0
- data/ext/melbourne/node_types18.hpp +129 -0
- data/ext/melbourne/node_types19.cpp +249 -0
- data/ext/melbourne/node_types19.hpp +126 -0
- data/ext/melbourne/parser_state18.hpp +181 -0
- data/ext/melbourne/parser_state19.hpp +251 -0
- data/ext/melbourne/quark.cpp +42 -0
- data/ext/melbourne/quark.hpp +45 -0
- data/ext/melbourne/symbols.cpp +224 -0
- data/ext/melbourne/symbols.hpp +119 -0
- data/ext/melbourne/var_table18.cpp +83 -0
- data/ext/melbourne/var_table18.hpp +33 -0
- data/ext/melbourne/var_table19.cpp +65 -0
- data/ext/melbourne/var_table19.hpp +35 -0
- data/ext/melbourne/visitor18.cpp +963 -0
- data/ext/melbourne/visitor18.hpp +12 -0
- data/ext/melbourne/visitor19.cpp +960 -0
- data/ext/melbourne/visitor19.hpp +15 -0
- data/lib/compiler/ast/constants.rb +81 -0
- data/lib/compiler/ast/control_flow.rb +290 -0
- data/lib/compiler/ast/data.rb +14 -0
- data/lib/compiler/ast/definitions.rb +749 -0
- data/lib/compiler/ast/encoding.rb +18 -0
- data/lib/compiler/ast/exceptions.rb +138 -0
- data/lib/compiler/ast/file.rb +11 -0
- data/lib/compiler/ast/grapher.rb +89 -0
- data/lib/compiler/ast/literals.rb +207 -0
- data/lib/compiler/ast/node.rb +362 -0
- data/lib/compiler/ast/operators.rb +106 -0
- data/lib/compiler/ast/self.rb +15 -0
- data/lib/compiler/ast/sends.rb +615 -0
- data/lib/compiler/ast/transforms.rb +298 -0
- data/lib/compiler/ast/values.rb +88 -0
- data/lib/compiler/ast/variables.rb +351 -0
- data/lib/compiler/ast.rb +20 -0
- data/lib/compiler/locals.rb +109 -0
- data/lib/melbourne/processor.rb +651 -0
- data/lib/melbourne/version.rb +3 -0
- data/lib/melbourne.rb +143 -0
- metadata +112 -0
@@ -0,0 +1,262 @@
|
|
1
|
+
/**********************************************************************
|
2
|
+
|
3
|
+
node.h -
|
4
|
+
|
5
|
+
$Author: nobu $
|
6
|
+
$Date: 2004/10/02 11:34:29 $
|
7
|
+
created at: Fri May 28 15:14:02 JST 1993
|
8
|
+
|
9
|
+
Copyright (C) 1993-2003 Yukihiro Matsumoto
|
10
|
+
|
11
|
+
**********************************************************************/
|
12
|
+
|
13
|
+
#ifndef MEL_NODE18_HPP
|
14
|
+
#define MEL_NODE18_HPP
|
15
|
+
|
16
|
+
#include "bstrlib.h"
|
17
|
+
#include "melbourne.hpp"
|
18
|
+
#include "quark.hpp"
|
19
|
+
|
20
|
+
namespace melbourne {
|
21
|
+
namespace grammar18 {
|
22
|
+
|
23
|
+
#define QUID quark
|
24
|
+
|
25
|
+
typedef struct RNode {
|
26
|
+
unsigned long flags;
|
27
|
+
char *nd_file;
|
28
|
+
union {
|
29
|
+
RNode *node;
|
30
|
+
QUID id;
|
31
|
+
VALUE value;
|
32
|
+
QUID *tbl;
|
33
|
+
bstring string;
|
34
|
+
} u1;
|
35
|
+
union {
|
36
|
+
struct RNode *node;
|
37
|
+
QUID id;
|
38
|
+
long argc;
|
39
|
+
VALUE value;
|
40
|
+
} u2;
|
41
|
+
union {
|
42
|
+
struct RNode *node;
|
43
|
+
QUID id;
|
44
|
+
long state;
|
45
|
+
long cnt;
|
46
|
+
VALUE value;
|
47
|
+
bstring string;
|
48
|
+
} u3;
|
49
|
+
} NODE;
|
50
|
+
|
51
|
+
#define RNODE(obj) ((NODE*)(obj))
|
52
|
+
|
53
|
+
#ifndef FL_USHIFT
|
54
|
+
#define FL_USHIFT 11
|
55
|
+
#endif
|
56
|
+
|
57
|
+
#define FL_UMASK (0xff<<FL_USHIFT)
|
58
|
+
|
59
|
+
#define nd_type(n) ((int)(((RNODE(n))->flags>>FL_USHIFT)&0xff))
|
60
|
+
#define nd_set_type(n,t) \
|
61
|
+
RNODE(n)->flags=((RNODE(n)->flags&~FL_UMASK)|(((t)<<FL_USHIFT)&FL_UMASK))
|
62
|
+
|
63
|
+
#define NODE_LSHIFT (FL_USHIFT+8)
|
64
|
+
#define NODE_LMASK (((long)1<<(sizeof(NODE*)*CHAR_BIT-NODE_LSHIFT))-1)
|
65
|
+
#define nd_line(n) ((unsigned int)(((RNODE(n))->flags>>NODE_LSHIFT)&NODE_LMASK))
|
66
|
+
#define nd_set_line(n,l) \
|
67
|
+
RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT))
|
68
|
+
|
69
|
+
#define nd_head u1.node
|
70
|
+
#define nd_alen u2.argc
|
71
|
+
#define nd_next u3.node
|
72
|
+
|
73
|
+
#define nd_cond u1.node
|
74
|
+
#define nd_body u2.node
|
75
|
+
#define nd_else u3.node
|
76
|
+
|
77
|
+
#define nd_orig u3.string
|
78
|
+
|
79
|
+
#define nd_resq u2.node
|
80
|
+
#define nd_ensr u3.node
|
81
|
+
|
82
|
+
#define nd_1st u1.node
|
83
|
+
#define nd_2nd u2.node
|
84
|
+
|
85
|
+
#define nd_stts u1.node
|
86
|
+
|
87
|
+
#define nd_entry u3.entry
|
88
|
+
#define nd_vid u1.id
|
89
|
+
#define nd_cflag u2.id
|
90
|
+
#define nd_cval u3.value
|
91
|
+
|
92
|
+
#define nd_cnt u3.cnt
|
93
|
+
#define nd_tbl u1.tbl
|
94
|
+
|
95
|
+
#define nd_var u1.node
|
96
|
+
#define nd_ibdy u2.node
|
97
|
+
#define nd_iter u3.node
|
98
|
+
|
99
|
+
#define nd_value u2.node
|
100
|
+
#define nd_aid u3.id
|
101
|
+
|
102
|
+
#define nd_str u1.string
|
103
|
+
#define nd_lit u1.value
|
104
|
+
|
105
|
+
#define nd_frml u1.node
|
106
|
+
#define nd_rest u2.argc
|
107
|
+
#define nd_opt u1.node
|
108
|
+
#define nd_pid u1.id
|
109
|
+
#define nd_plen u2.argc
|
110
|
+
|
111
|
+
#define nd_recv u1.node
|
112
|
+
#define nd_mid u2.id
|
113
|
+
#define nd_args u3.node
|
114
|
+
|
115
|
+
#define nd_noex u1.id
|
116
|
+
#define nd_defn u3.node
|
117
|
+
|
118
|
+
#define nd_old u1.id
|
119
|
+
#define nd_new u2.id
|
120
|
+
|
121
|
+
#define nd_cfnc u1.cfunc
|
122
|
+
#define nd_argc u2.argc
|
123
|
+
|
124
|
+
#define nd_cpath u1.node
|
125
|
+
#define nd_super u3.node
|
126
|
+
|
127
|
+
#define nd_modl u1.id
|
128
|
+
#define nd_clss u1.value
|
129
|
+
|
130
|
+
#define nd_beg u1.node
|
131
|
+
#define nd_end u2.node
|
132
|
+
#define nd_state u3.state
|
133
|
+
#define nd_rval u2.value
|
134
|
+
|
135
|
+
#define nd_nth u2.argc
|
136
|
+
|
137
|
+
#define nd_tag u1.id
|
138
|
+
#define nd_tval u2.value
|
139
|
+
|
140
|
+
#define NEW_NODE(t,a0,a1,a2) node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2))
|
141
|
+
|
142
|
+
#define NEW_METHOD(n,x) NEW_NODE(NODE_METHOD,x,n,0)
|
143
|
+
#define NEW_FBODY(n,i,o) NEW_NODE(NODE_FBODY,n,i,o)
|
144
|
+
#define NEW_DEFN(i,a,d,p) NEW_NODE(NODE_DEFN,p,i,NEW_RFUNC(a,d))
|
145
|
+
#define NEW_DEFS(r,i,a,d) NEW_NODE(NODE_DEFS,r,i,NEW_RFUNC(a,d))
|
146
|
+
#define NEW_RFUNC(b1,b2) NEW_SCOPE(block_append(vps, b1,b2))
|
147
|
+
#define NEW_SCOPE(b) NEW_NODE(NODE_SCOPE,mel_local_tbl(vps),0,(b))
|
148
|
+
#define NEW_BLOCK(a) NEW_NODE(NODE_BLOCK,a,0,0)
|
149
|
+
#define NEW_IF(c,t,e) NEW_NODE(NODE_IF,c,t,e)
|
150
|
+
#define NEW_UNLESS(c,t,e) NEW_IF(c,e,t)
|
151
|
+
#define NEW_CASE(h,b) NEW_NODE(NODE_CASE,h,b,0)
|
152
|
+
#define NEW_WHEN(c,t,e) NEW_NODE(NODE_WHEN,c,t,e)
|
153
|
+
#define NEW_OPT_N(b) NEW_NODE(NODE_OPT_N,0,b,0)
|
154
|
+
#define NEW_WHILE(c,b,n) NEW_NODE(NODE_WHILE,c,b,n)
|
155
|
+
#define NEW_UNTIL(c,b,n) NEW_NODE(NODE_UNTIL,c,b,n)
|
156
|
+
#define NEW_FOR(v,i,b) NEW_NODE(NODE_FOR,v,b,i)
|
157
|
+
#define NEW_ITER(v,i,b) NEW_NODE(NODE_ITER,v,b,i)
|
158
|
+
#define NEW_BREAK(s) NEW_NODE(NODE_BREAK,s,0,0)
|
159
|
+
#define NEW_NEXT(s) NEW_NODE(NODE_NEXT,s,0,0)
|
160
|
+
#define NEW_REDO() NEW_NODE(NODE_REDO,0,0,0)
|
161
|
+
#define NEW_RETRY() NEW_NODE(NODE_RETRY,0,0,0)
|
162
|
+
#define NEW_BEGIN(b) NEW_NODE(NODE_BEGIN,0,b,0)
|
163
|
+
#define NEW_RESCUE(b,res,e) NEW_NODE(NODE_RESCUE,b,res,e)
|
164
|
+
#define NEW_RESBODY(a,ex,n) NEW_NODE(NODE_RESBODY,n,ex,a)
|
165
|
+
#define NEW_ENSURE(b,en) NEW_NODE(NODE_ENSURE,b,0,en)
|
166
|
+
#define NEW_RETURN(s) NEW_NODE(NODE_RETURN,s,0,0)
|
167
|
+
#define NEW_YIELD(a,s) NEW_NODE(NODE_YIELD,a,0,s)
|
168
|
+
#define NEW_LIST(a) NEW_ARRAY(a)
|
169
|
+
#define NEW_ARRAY(a) NEW_NODE(NODE_ARRAY,a,1,0)
|
170
|
+
#define NEW_ZARRAY() NEW_NODE(NODE_ZARRAY,0,0,0)
|
171
|
+
#define NEW_HASH(a) NEW_NODE(NODE_HASH,a,0,0)
|
172
|
+
#define NEW_POSITIONAL(a) NEW_NODE(NODE_HASH,a,1,0)
|
173
|
+
#define NEW_NOT(a) NEW_NODE(NODE_NOT,0,a,0)
|
174
|
+
#define NEW_MASGN(l,r) NEW_NODE(NODE_MASGN,l,0,r)
|
175
|
+
#define NEW_GASGN(v,val) NEW_NODE(NODE_GASGN,v,val,0)
|
176
|
+
#define NEW_LASGN(v,val) NEW_NODE(NODE_LASGN,v,val,local_cnt(v))
|
177
|
+
#define NEW_DASGN(v,val) NEW_NODE(NODE_DASGN,v,val,0)
|
178
|
+
#define NEW_DASGN_CURR(v,val) NEW_NODE(NODE_DASGN_CURR,v,val,0)
|
179
|
+
#define NEW_IASGN(v,val) NEW_NODE(NODE_IASGN,v,val,0)
|
180
|
+
#define NEW_CDECL(v,val,path) NEW_NODE(NODE_CDECL,v,val,path)
|
181
|
+
#define NEW_CVASGN(v,val) NEW_NODE(NODE_CVASGN,v,val,0)
|
182
|
+
#define NEW_CVDECL(v,val) NEW_NODE(NODE_CVDECL,v,val,0)
|
183
|
+
#define NEW_OP_ASGN1(p,id,a) NEW_NODE(NODE_OP_ASGN1,p,id,a)
|
184
|
+
#define NEW_OP_ASGN2(r,i,o,val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o))
|
185
|
+
#define NEW_OP_ASGN22(i,o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset((rb_parser_state*) parser_state, i))
|
186
|
+
#define NEW_OP_ASGN_OR(i,val) NEW_NODE(NODE_OP_ASGN_OR,i,val,0)
|
187
|
+
#define NEW_OP_ASGN_AND(i,val) NEW_NODE(NODE_OP_ASGN_AND,i,val,0)
|
188
|
+
#define NEW_GVAR(v) NEW_NODE(NODE_GVAR,v,0,0)
|
189
|
+
#define NEW_LVAR(v) NEW_NODE(NODE_LVAR,v,0,local_cnt(v))
|
190
|
+
#define NEW_DVAR(v) NEW_NODE(NODE_DVAR,v,0,0)
|
191
|
+
#define NEW_IVAR(v) NEW_NODE(NODE_IVAR,v,0,0)
|
192
|
+
#define NEW_CONST(v) NEW_NODE(NODE_CONST,v,0,0)
|
193
|
+
#define NEW_CVAR(v) NEW_NODE(NODE_CVAR,v,0,0)
|
194
|
+
#define NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,local_cnt('~'))
|
195
|
+
#define NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,local_cnt('~'))
|
196
|
+
#define NEW_MATCH(c) NEW_NODE(NODE_MATCH,c,0,0)
|
197
|
+
#define NEW_MATCH2(n1,n2) NEW_NODE(NODE_MATCH2,n1,n2,0)
|
198
|
+
#define NEW_MATCH3(r,n2) NEW_NODE(NODE_MATCH3,r,n2,0)
|
199
|
+
#define NEW_LIT(l) NEW_NODE(NODE_LIT,l,0,0)
|
200
|
+
#define NEW_STR(s) NEW_NODE(NODE_STR,s,0,0)
|
201
|
+
#define NEW_DSTR(s) NEW_NODE(NODE_DSTR,s,1,0)
|
202
|
+
#define NEW_XSTR(s) NEW_NODE(NODE_XSTR,s,0,0)
|
203
|
+
#define NEW_DXSTR(s) NEW_NODE(NODE_DXSTR,s,0,0)
|
204
|
+
#define NEW_DSYM(s) NEW_NODE(NODE_DSYM,s,0,0)
|
205
|
+
#define NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0)
|
206
|
+
#define NEW_CALL(r,m,a) NEW_NODE(NODE_CALL,r,m,a)
|
207
|
+
#define NEW_FCALL(m,a) NEW_NODE(NODE_FCALL,0,m,a)
|
208
|
+
#define NEW_VCALL(m) NEW_NODE(NODE_VCALL,0,m,0)
|
209
|
+
#define NEW_SUPER(a) NEW_NODE(NODE_SUPER,0,0,a)
|
210
|
+
#define NEW_ZSUPER() NEW_NODE(NODE_ZSUPER,0,0,0)
|
211
|
+
#define NEW_ARGS(f,o,r) NEW_NODE(NODE_ARGS,o,r,f)
|
212
|
+
#define NEW_ARGSCAT(a,b) NEW_NODE(NODE_ARGSCAT,a,b,0)
|
213
|
+
#define NEW_ARGSPUSH(a,b) NEW_NODE(NODE_ARGSPUSH,a,b,0)
|
214
|
+
#define NEW_SPLAT(a) NEW_NODE(NODE_SPLAT,a,0,0)
|
215
|
+
#define NEW_TO_ARY(a) NEW_NODE(NODE_TO_ARY,a,0,0)
|
216
|
+
#define NEW_SVALUE(a) NEW_NODE(NODE_SVALUE,a,0,0)
|
217
|
+
#define NEW_BLOCK_ARG(v) NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v))
|
218
|
+
#define NEW_BLOCK_PASS(b) NEW_NODE(NODE_BLOCK_PASS,0,b,0)
|
219
|
+
#define NEW_ALIAS(n,o) NEW_NODE(NODE_ALIAS,o,n,0)
|
220
|
+
#define NEW_VALIAS(n,o) NEW_NODE(NODE_VALIAS,o,n,0)
|
221
|
+
#define NEW_UNDEF(i) NEW_NODE(NODE_UNDEF,0,i,0)
|
222
|
+
#define NEW_CLASS(n,b,s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(b),(s))
|
223
|
+
#define NEW_SCLASS(r,b) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(b),0)
|
224
|
+
#define NEW_MODULE(n,b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(b),0)
|
225
|
+
#define NEW_COLON2(c,i) NEW_NODE(NODE_COLON2,c,i,0)
|
226
|
+
#define NEW_COLON3(i) NEW_NODE(NODE_COLON3,0,i,0)
|
227
|
+
#define NEW_CREF(c) (NEW_NODE(NODE_CREF,0,0,c))
|
228
|
+
#define NEW_DOT2(b,e) NEW_NODE(NODE_DOT2,b,e,0)
|
229
|
+
#define NEW_DOT3(b,e) NEW_NODE(NODE_DOT3,b,e,0)
|
230
|
+
#define NEW_ATTRSET(a) NEW_NODE(NODE_ATTRSET,a,0,0)
|
231
|
+
#define NEW_SELF() NEW_NODE(NODE_SELF,0,0,0)
|
232
|
+
#define NEW_NIL() NEW_NODE(NODE_NIL,0,0,0)
|
233
|
+
#define NEW_TRUE() NEW_NODE(NODE_TRUE,0,0,0)
|
234
|
+
#define NEW_FALSE() NEW_NODE(NODE_FALSE,0,0,0)
|
235
|
+
#define NEW_DEFINED(e) NEW_NODE(NODE_DEFINED,e,0,0)
|
236
|
+
#define NEW_NEWLINE(n) NEW_NODE(NODE_NEWLINE,0,0,n)
|
237
|
+
#define NEW_PREEXE(b) NEW_NODE(NODE_PREEXE,0,0,0)
|
238
|
+
#define NEW_POSTEXE() NEW_NODE(NODE_POSTEXE,0,0,0)
|
239
|
+
#define NEW_DMETHOD(b) NEW_NODE(NODE_DMETHOD,0,0,b)
|
240
|
+
#define NEW_BMETHOD(b) NEW_NODE(NODE_BMETHOD,0,0,b)
|
241
|
+
#define NEW_ATTRASGN(r,m,a) NEW_NODE(NODE_ATTRASGN,r,m,a)
|
242
|
+
#define NEW_FIXNUM(l) NEW_NODE(NODE_FIXNUM,0,0,l)
|
243
|
+
#define NEW_NUMBER(l) NEW_NODE(NODE_NUMBER,l,0,0)
|
244
|
+
#define NEW_HEXNUM(l) NEW_NODE(NODE_HEXNUM,l,0,0)
|
245
|
+
#define NEW_OCTNUM(l) NEW_NODE(NODE_OCTNUM,l,0,0)
|
246
|
+
#define NEW_BINNUM(l) NEW_NODE(NODE_BINNUM,l,0,0)
|
247
|
+
#define NEW_FLOAT(l) NEW_NODE(NODE_FLOAT,l,0,0)
|
248
|
+
#define NEW_NEGATE(l) NEW_NODE(NODE_NEGATE,l,0,0)
|
249
|
+
#define NEW_REGEX(l,o) NEW_NODE(NODE_REGEX,l,0,o)
|
250
|
+
#define NEW_FILE() NEW_NODE(NODE_FILE,0,0,0)
|
251
|
+
#define NOEX_PUBLIC 0
|
252
|
+
#define NOEX_NOSUPER 1
|
253
|
+
#define NOEX_PRIVATE 2
|
254
|
+
#define NOEX_PROTECTED 4
|
255
|
+
#define NOEX_MASK 6
|
256
|
+
|
257
|
+
#define NOEX_UNDEF NOEX_NOSUPER
|
258
|
+
|
259
|
+
}; // namespace grammar18
|
260
|
+
}; // namespace melbourne
|
261
|
+
|
262
|
+
#endif
|
@@ -0,0 +1,271 @@
|
|
1
|
+
/**********************************************************************
|
2
|
+
|
3
|
+
node.h -
|
4
|
+
|
5
|
+
$Author: nobu $
|
6
|
+
$Date: 2004/10/02 11:34:29 $
|
7
|
+
created at: Fri May 28 15:14:02 JST 1993
|
8
|
+
|
9
|
+
Copyright (C) 1993-2003 Yukihiro Matsumoto
|
10
|
+
|
11
|
+
**********************************************************************/
|
12
|
+
|
13
|
+
#ifndef MEL_NODE19_HPP
|
14
|
+
#define MEL_NODE19_HPP
|
15
|
+
|
16
|
+
#include "melbourne.hpp"
|
17
|
+
|
18
|
+
namespace melbourne {
|
19
|
+
namespace grammar19 {
|
20
|
+
|
21
|
+
typedef struct RNode {
|
22
|
+
unsigned long flags;
|
23
|
+
char *nd_file;
|
24
|
+
union {
|
25
|
+
RNode *node;
|
26
|
+
ID id;
|
27
|
+
VALUE value;
|
28
|
+
ID *tbl;
|
29
|
+
} u1;
|
30
|
+
union {
|
31
|
+
struct RNode *node;
|
32
|
+
ID id;
|
33
|
+
long argc;
|
34
|
+
VALUE value;
|
35
|
+
} u2;
|
36
|
+
union {
|
37
|
+
struct RNode *node;
|
38
|
+
ID id;
|
39
|
+
long state;
|
40
|
+
long cnt;
|
41
|
+
VALUE value;
|
42
|
+
} u3;
|
43
|
+
} NODE;
|
44
|
+
|
45
|
+
#define RNODE(obj) ((NODE*)(obj))
|
46
|
+
|
47
|
+
/* 0..4:T_TYPES, 5:FL_MARK, 6:reserved, 7:NODE_FL_NEWLINE */
|
48
|
+
#define NODE_FL_NEWLINE (((VALUE)1)<<7)
|
49
|
+
#define NODE_FL_CREF_PUSHED_BY_EVAL NODE_FL_NEWLINE
|
50
|
+
|
51
|
+
#define NODE_TYPESHIFT 8
|
52
|
+
#define NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT)
|
53
|
+
|
54
|
+
#define nd_type(n) ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT))
|
55
|
+
#define nd_set_type(n,t) \
|
56
|
+
RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)t)<<NODE_TYPESHIFT)&NODE_TYPEMASK))
|
57
|
+
|
58
|
+
#define NODE_LSHIFT (NODE_TYPESHIFT+7)
|
59
|
+
#define NODE_LMASK (((intptr_t)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
|
60
|
+
#define nd_line(n) (int)(RNODE(n)->flags>>NODE_LSHIFT)
|
61
|
+
#define nd_set_line(n,l) \
|
62
|
+
RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT))
|
63
|
+
|
64
|
+
#define nd_head u1.node
|
65
|
+
#define nd_alen u2.argc
|
66
|
+
#define nd_next u3.node
|
67
|
+
|
68
|
+
#define nd_cond u1.node
|
69
|
+
#define nd_body u2.node
|
70
|
+
#define nd_else u3.node
|
71
|
+
|
72
|
+
#define nd_orig u3.value
|
73
|
+
|
74
|
+
#define nd_resq u2.node
|
75
|
+
#define nd_ensr u3.node
|
76
|
+
|
77
|
+
#define nd_1st u1.node
|
78
|
+
#define nd_2nd u2.node
|
79
|
+
|
80
|
+
#define nd_stts u1.node
|
81
|
+
|
82
|
+
#define nd_entry u3.entry
|
83
|
+
#define nd_vid u1.id
|
84
|
+
#define nd_cflag u2.id
|
85
|
+
#define nd_cval u3.value
|
86
|
+
|
87
|
+
#define nd_oid u1.id
|
88
|
+
#define nd_cnt u3.cnt
|
89
|
+
#define nd_tbl u1.tbl
|
90
|
+
|
91
|
+
#define nd_var u1.node
|
92
|
+
#define nd_iter u3.node
|
93
|
+
|
94
|
+
#define nd_value u2.node
|
95
|
+
#define nd_aid u3.id
|
96
|
+
|
97
|
+
#define nd_lit u1.value
|
98
|
+
|
99
|
+
#define nd_frml u2.argc
|
100
|
+
#define nd_rest u1.id
|
101
|
+
#define nd_opt u1.node
|
102
|
+
#define nd_pid u1.id
|
103
|
+
#define nd_plen u2.argc
|
104
|
+
|
105
|
+
#define nd_recv u1.node
|
106
|
+
#define nd_mid u2.id
|
107
|
+
#define nd_args u3.node
|
108
|
+
|
109
|
+
#define nd_noex u3.id
|
110
|
+
#define nd_defn u3.node
|
111
|
+
|
112
|
+
#define nd_cfnc u1.cfunc
|
113
|
+
#define nd_argc u2.argc
|
114
|
+
|
115
|
+
#define nd_cpath u1.node
|
116
|
+
#define nd_super u3.node
|
117
|
+
|
118
|
+
#define nd_modl u1.id
|
119
|
+
#define nd_clss u1.value
|
120
|
+
|
121
|
+
#define nd_beg u1.node
|
122
|
+
#define nd_end u2.node
|
123
|
+
#define nd_state u3.state
|
124
|
+
#define nd_rval u2.value
|
125
|
+
|
126
|
+
#define nd_nth u2.argc
|
127
|
+
|
128
|
+
#define nd_tag u1.id
|
129
|
+
#define nd_tval u2.value
|
130
|
+
|
131
|
+
#define nd_visi u2.argc
|
132
|
+
|
133
|
+
#undef NEW_NODE
|
134
|
+
#undef REF
|
135
|
+
|
136
|
+
#define NEW_NODE(t,a0,a1,a2) node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2))
|
137
|
+
|
138
|
+
#ifdef RUBINIUS
|
139
|
+
/* In Rubinius, the object references are handles and the handle
|
140
|
+
* in the native method frame keeps the object from being collected.
|
141
|
+
*/
|
142
|
+
#define REF(n) (n)
|
143
|
+
#else
|
144
|
+
/* In MRI, we are holding references to objects in memory that the
|
145
|
+
* MRI GC does not see. To keep these objects from being collected,
|
146
|
+
* we add a reference to them to an Array that MRI GC does see.
|
147
|
+
*/
|
148
|
+
#define REF(n) node_add_reference(n)
|
149
|
+
#endif
|
150
|
+
|
151
|
+
#define NEW_DEFN(i,a,d,p) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d))
|
152
|
+
#define NEW_DEFS(r,i,a,d) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d))
|
153
|
+
#define NEW_IFUNC(f,c) NEW_NODE(NODE_IFUNC,f,c,0)
|
154
|
+
#define NEW_SCOPE(a,b) NEW_NODE(NODE_SCOPE,local_tbl(),b,a)
|
155
|
+
#define NEW_BLOCK(a) NEW_NODE(NODE_BLOCK,a,0,0)
|
156
|
+
#define NEW_IF(c,t,e) NEW_NODE(NODE_IF,c,t,e)
|
157
|
+
#define NEW_UNLESS(c,t,e) NEW_IF(c,e,t)
|
158
|
+
#define NEW_CASE(h,b) NEW_NODE(NODE_CASE,h,b,0)
|
159
|
+
#define NEW_WHEN(c,t,e) NEW_NODE(NODE_WHEN,c,t,e)
|
160
|
+
#define NEW_OPT_N(b) NEW_NODE(NODE_OPT_N,0,b,0)
|
161
|
+
#define NEW_WHILE(c,b,n) NEW_NODE(NODE_WHILE,c,b,n)
|
162
|
+
#define NEW_UNTIL(c,b,n) NEW_NODE(NODE_UNTIL,c,b,n)
|
163
|
+
#define NEW_FOR(v,i,b) NEW_NODE(NODE_FOR,v,b,i)
|
164
|
+
#define NEW_ITER(a,b) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0)
|
165
|
+
#define NEW_LAMBDA(a) NEW_NODE(NODE_LAMBDA,a,0,0)
|
166
|
+
#define NEW_BREAK(s) NEW_NODE(NODE_BREAK,s,0,0)
|
167
|
+
#define NEW_NEXT(s) NEW_NODE(NODE_NEXT,s,0,0)
|
168
|
+
#define NEW_REDO() NEW_NODE(NODE_REDO,0,0,0)
|
169
|
+
#define NEW_RETRY() NEW_NODE(NODE_RETRY,0,0,0)
|
170
|
+
#define NEW_BEGIN(b) NEW_NODE(NODE_BEGIN,0,b,0)
|
171
|
+
#define NEW_RESCUE(b,res,e) NEW_NODE(NODE_RESCUE,b,res,e)
|
172
|
+
#define NEW_RESBODY(a,ex,n) NEW_NODE(NODE_RESBODY,n,ex,a)
|
173
|
+
#define NEW_ENSURE(b,en) NEW_NODE(NODE_ENSURE,b,0,en)
|
174
|
+
#define NEW_RETURN(s) NEW_NODE(NODE_RETURN,s,0,0)
|
175
|
+
#define NEW_YIELD(a,s) NEW_NODE(NODE_YIELD,a,0,s)
|
176
|
+
#define NEW_LIST(a) NEW_ARRAY(a)
|
177
|
+
#define NEW_ARRAY(a) NEW_NODE(NODE_ARRAY,a,1,0)
|
178
|
+
#define NEW_ZARRAY() NEW_NODE(NODE_ZARRAY,0,0,0)
|
179
|
+
#define NEW_HASH(a) NEW_NODE(NODE_HASH,a,0,0)
|
180
|
+
#define NEW_MASGN(l,r) NEW_NODE(NODE_MASGN,l,0,r)
|
181
|
+
#define NEW_GASGN(v,val) NEW_NODE(NODE_GASGN,v,val,0)
|
182
|
+
#define NEW_LASGN(v,val) NEW_NODE(NODE_LASGN,v,val,0)
|
183
|
+
#define NEW_DASGN(v,val) NEW_NODE(NODE_DASGN,v,val,0)
|
184
|
+
#define NEW_DASGN_CURR(v,val) NEW_NODE(NODE_DASGN_CURR,v,val,0)
|
185
|
+
#define NEW_IASGN(v,val) NEW_NODE(NODE_IASGN,v,val,0)
|
186
|
+
#define NEW_IASGN2(v,val) NEW_NODE(NODE_IASGN2,v,val,0)
|
187
|
+
#define NEW_CDECL(v,val,path) NEW_NODE(NODE_CDECL,v,val,path)
|
188
|
+
#define NEW_CVASGN(v,val) NEW_NODE(NODE_CVASGN,v,val,0)
|
189
|
+
#define NEW_CVDECL(v,val) NEW_NODE(NODE_CVDECL,v,val,0)
|
190
|
+
#define NEW_OP_ASGN1(p,id,a) NEW_NODE(NODE_OP_ASGN1,p,id,a)
|
191
|
+
#define NEW_OP_ASGN2(r,i,o,val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o))
|
192
|
+
#define NEW_OP_ASGN22(i,o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i))
|
193
|
+
#define NEW_OP_ASGN_OR(i,val) NEW_NODE(NODE_OP_ASGN_OR,i,val,0)
|
194
|
+
#define NEW_OP_ASGN_AND(i,val) NEW_NODE(NODE_OP_ASGN_AND,i,val,0)
|
195
|
+
#define NEW_GVAR(v) NEW_NODE(NODE_GVAR,v,0,0)
|
196
|
+
#define NEW_LVAR(v) NEW_NODE(NODE_LVAR,v,0,0)
|
197
|
+
#define NEW_DVAR(v) NEW_NODE(NODE_DVAR,v,0,0)
|
198
|
+
#define NEW_IVAR(v) NEW_NODE(NODE_IVAR,v,0,0)
|
199
|
+
#define NEW_CONST(v) NEW_NODE(NODE_CONST,v,0,0)
|
200
|
+
#define NEW_CVAR(v) NEW_NODE(NODE_CVAR,v,0,0)
|
201
|
+
#define NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,0)
|
202
|
+
#define NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,0)
|
203
|
+
#define NEW_MATCH(c) NEW_NODE(NODE_MATCH,c,0,0)
|
204
|
+
#define NEW_MATCH2(n1,n2) NEW_NODE(NODE_MATCH2,n1,n2,0)
|
205
|
+
#define NEW_MATCH3(r,n2) NEW_NODE(NODE_MATCH3,r,n2,0)
|
206
|
+
#define NEW_LIT(l) NEW_NODE(NODE_LIT,l,0,0)
|
207
|
+
#define NEW_STR(s) NEW_NODE(NODE_STR,REF(s),0,0)
|
208
|
+
#define NEW_DSTR(s) NEW_NODE(NODE_DSTR,REF(s),1,0)
|
209
|
+
#define NEW_XSTR(s) NEW_NODE(NODE_XSTR,REF(s),0,0)
|
210
|
+
#define NEW_DXSTR(s) NEW_NODE(NODE_DXSTR,REF(s),0,0)
|
211
|
+
#define NEW_DSYM(s) NEW_NODE(NODE_DSYM,REF(s),0,0)
|
212
|
+
#define NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0)
|
213
|
+
#define NEW_CALL(r,m,a) NEW_NODE(NODE_CALL,r,convert_op(m),a)
|
214
|
+
#define NEW_FCALL(m,a) NEW_NODE(NODE_FCALL,0,convert_op(m),a)
|
215
|
+
#define NEW_VCALL(m) NEW_NODE(NODE_VCALL,0,convert_op(m),0)
|
216
|
+
#define NEW_SUPER(a) NEW_NODE(NODE_SUPER,0,0,a)
|
217
|
+
#define NEW_ZSUPER() NEW_NODE(NODE_ZSUPER,0,0,0)
|
218
|
+
#define NEW_ARGS(m,o) NEW_NODE(NODE_ARGS,o,m,0)
|
219
|
+
#define NEW_ARGS_AUX(r,b) NEW_NODE(NODE_ARGS_AUX,r,b,0)
|
220
|
+
#define NEW_OPT_ARG(i,v) NEW_NODE(NODE_OPT_ARG,i,v,0)
|
221
|
+
#define NEW_POSTARG(i,v) NEW_NODE(NODE_POSTARG,i,v,0)
|
222
|
+
#define NEW_ARGSCAT(a,b) NEW_NODE(NODE_ARGSCAT,a,b,0)
|
223
|
+
#define NEW_ARGSPUSH(a,b) NEW_NODE(NODE_ARGSPUSH,a,b,0)
|
224
|
+
#define NEW_SPLAT(a) NEW_NODE(NODE_SPLAT,a,0,0)
|
225
|
+
#define NEW_TO_ARY(a) NEW_NODE(NODE_TO_ARY,a,0,0)
|
226
|
+
#define NEW_BLOCK_ARG(v) NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v))
|
227
|
+
#define NEW_BLOCK_PASS(b) NEW_NODE(NODE_BLOCK_PASS,0,b,0)
|
228
|
+
#define NEW_ALIAS(n,o) NEW_NODE(NODE_ALIAS,n,o,0)
|
229
|
+
#define NEW_VALIAS(n,o) NEW_NODE(NODE_VALIAS,n,o,0)
|
230
|
+
#define NEW_UNDEF(i) NEW_NODE(NODE_UNDEF,0,i,0)
|
231
|
+
#define NEW_CLASS(n,b,s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s))
|
232
|
+
#define NEW_SCLASS(r,b) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),0)
|
233
|
+
#define NEW_MODULE(n,b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0)
|
234
|
+
#define NEW_COLON2(c,i) NEW_NODE(NODE_COLON2,c,i,0)
|
235
|
+
#define NEW_COLON3(i) NEW_NODE(NODE_COLON3,0,i,0)
|
236
|
+
#define NEW_DOT2(b,e) NEW_NODE(NODE_DOT2,b,e,0)
|
237
|
+
#define NEW_DOT3(b,e) NEW_NODE(NODE_DOT3,b,e,0)
|
238
|
+
#define NEW_SELF() NEW_NODE(NODE_SELF,0,0,0)
|
239
|
+
#define NEW_NIL() NEW_NODE(NODE_NIL,0,0,0)
|
240
|
+
#define NEW_TRUE() NEW_NODE(NODE_TRUE,0,0,0)
|
241
|
+
#define NEW_FALSE() NEW_NODE(NODE_FALSE,0,0,0)
|
242
|
+
#define NEW_ERRINFO() NEW_NODE(NODE_ERRINFO,0,0,0)
|
243
|
+
#define NEW_DEFINED(e) NEW_NODE(NODE_DEFINED,e,0,0)
|
244
|
+
#define NEW_PREEXE(b) NEW_NODE(NODE_PREEXE,0,b,0)
|
245
|
+
#define NEW_POSTEXE(b) NEW_NODE(NODE_POSTEXE,0,b,0)
|
246
|
+
#define NEW_BMETHOD(b) NEW_NODE(NODE_BMETHOD,0,0,b)
|
247
|
+
#define NEW_ATTRASGN(r,m,a) NEW_NODE(NODE_ATTRASGN,r,m,a)
|
248
|
+
#define NEW_PRELUDE(p,b) NEW_NODE(NODE_PRELUDE,p,b,0)
|
249
|
+
#define NEW_OPTBLOCK(a) NEW_NODE(NODE_OPTBLOCK,a,0,0)
|
250
|
+
#define NEW_REGEX(l,o) NEW_NODE(NODE_REGEX,REF(l),0,o)
|
251
|
+
#define NEW_FILE() NEW_NODE(NODE_FILE,0,0,0)
|
252
|
+
#define NEW_NUMBER(l) NEW_NODE(NODE_NUMBER,REF(l),0,0)
|
253
|
+
#define NEW_FLOAT(l) NEW_NODE(NODE_FLOAT,REF(l),0,0)
|
254
|
+
#define NEW_ENCODING(n) NEW_NODE(NODE_ENCODING,REF(n),0,0)
|
255
|
+
|
256
|
+
#define NOEX_PUBLIC 0x00,
|
257
|
+
#define NOEX_NOSUPER 0x01,
|
258
|
+
#define NOEX_PRIVATE 0x02,
|
259
|
+
#define NOEX_PROTECTED 0x04,
|
260
|
+
#define NOEX_MASK 0x06,
|
261
|
+
#define NOEX_BASIC 0x08,
|
262
|
+
#define NOEX_UNDEF NOEX_NOSUPER,
|
263
|
+
#define NOEX_MODFUNC 0x12,
|
264
|
+
#define NOEX_SUPER 0x20,
|
265
|
+
#define NOEX_VCALL 0x40,
|
266
|
+
#define NOEX_RESPONDS 0x80
|
267
|
+
|
268
|
+
}; // namespace grammar19
|
269
|
+
}; // namespace melbourne
|
270
|
+
|
271
|
+
#endif
|