rb-threadframe 0.39 → 0.40

Sign up to get free protection for your applications and to get access to all the features.
data/ext/iseq_extra.h DELETED
@@ -1,8 +0,0 @@
1
- /* in iseq_extra.c */
2
- extern VALUE iseq_argc(VALUE);
3
- extern VALUE iseq_arity(VALUE);
4
- extern void Init_iseq_extra(void);
5
- extern VALUE iseq_source_container_internal(rb_iseq_t *iseq);
6
- const char *source_container_type(VALUE fileval);
7
-
8
-
data/ext/iseq_mini.h DELETED
@@ -1,41 +0,0 @@
1
- #define ISEQ_TYPE_TOP INT2FIX(1)
2
- #define ISEQ_TYPE_METHOD INT2FIX(2)
3
- #define ISEQ_TYPE_BLOCK INT2FIX(3)
4
- #define ISEQ_TYPE_CLASS INT2FIX(4)
5
- #define ISEQ_TYPE_RESCUE INT2FIX(5)
6
- #define ISEQ_TYPE_ENSURE INT2FIX(6)
7
- #define ISEQ_TYPE_EVAL INT2FIX(7)
8
- #define ISEQ_TYPE_MAIN INT2FIX(8)
9
- #define ISEQ_TYPE_DEFINED_GUARD INT2FIX(9)
10
-
11
- struct iseq_compile_data {
12
- /* GC is needed */
13
- VALUE err_info;
14
- VALUE mark_ary;
15
- VALUE catch_table_ary; /* Array */
16
-
17
- /* GC is not needed */
18
- struct iseq_label_data *start_label;
19
- struct iseq_label_data *end_label;
20
- struct iseq_label_data *redo_label;
21
- VALUE current_block;
22
- VALUE ensure_node;
23
- VALUE for_iseq;
24
- struct iseq_compile_data_ensure_node_stack *ensure_node_stack;
25
- int loopval_popped; /* used by NODE_BREAK */
26
- int cached_const;
27
- struct iseq_compile_data_storage *storage_head;
28
- struct iseq_compile_data_storage *storage_current;
29
- int last_line;
30
- int last_coverable_line;
31
- int flip_cnt;
32
- int label_no;
33
- int node_level;
34
- /*const*/ rb_compile_option_t *option; // "const" removed
35
- };
36
-
37
- /* some utilities */
38
- extern int insn_len(VALUE insn);
39
- extern const char *insn_name(VALUE insn);
40
- extern const char *insn_op_types(VALUE insn);
41
- extern int insn_op_type(VALUE insn, long pos);
data/ext/node.h DELETED
@@ -1,483 +0,0 @@
1
- /**********************************************************************
2
-
3
- node.h -
4
-
5
- $Author: muraken $
6
- created at: Fri May 28 15:14:02 JST 1993
7
-
8
- Copyright (C) 1993-2007 Yukihiro Matsumoto
9
-
10
- **********************************************************************/
11
-
12
- #ifndef RUBY_NODE_H
13
- #define RUBY_NODE_H 1
14
-
15
- #if defined(__cplusplus)
16
- extern "C" {
17
- #if 0
18
- } /* satisfy cc-mode */
19
- #endif
20
- #endif
21
-
22
- enum node_type {
23
- NODE_SCOPE,
24
- #define NODE_SCOPE NODE_SCOPE
25
- NODE_BLOCK,
26
- #define NODE_BLOCK NODE_BLOCK
27
- NODE_IF,
28
- #define NODE_IF NODE_IF
29
- NODE_CASE,
30
- #define NODE_CASE NODE_CASE
31
- NODE_WHEN,
32
- #define NODE_WHEN NODE_WHEN
33
- NODE_OPT_N,
34
- #define NODE_OPT_N NODE_OPT_N
35
- NODE_WHILE,
36
- #define NODE_WHILE NODE_WHILE
37
- NODE_UNTIL,
38
- #define NODE_UNTIL NODE_UNTIL
39
- NODE_ITER,
40
- #define NODE_ITER NODE_ITER
41
- NODE_FOR,
42
- #define NODE_FOR NODE_FOR
43
- NODE_BREAK,
44
- #define NODE_BREAK NODE_BREAK
45
- NODE_NEXT,
46
- #define NODE_NEXT NODE_NEXT
47
- NODE_REDO,
48
- #define NODE_REDO NODE_REDO
49
- NODE_RETRY,
50
- #define NODE_RETRY NODE_RETRY
51
- NODE_BEGIN,
52
- #define NODE_BEGIN NODE_BEGIN
53
- NODE_RESCUE,
54
- #define NODE_RESCUE NODE_RESCUE
55
- NODE_RESBODY,
56
- #define NODE_RESBODY NODE_RESBODY
57
- NODE_ENSURE,
58
- #define NODE_ENSURE NODE_ENSURE
59
- NODE_AND,
60
- #define NODE_AND NODE_AND
61
- NODE_OR,
62
- #define NODE_OR NODE_OR
63
- NODE_MASGN,
64
- #define NODE_MASGN NODE_MASGN
65
- NODE_LASGN,
66
- #define NODE_LASGN NODE_LASGN
67
- NODE_DASGN,
68
- #define NODE_DASGN NODE_DASGN
69
- NODE_DASGN_CURR,
70
- #define NODE_DASGN_CURR NODE_DASGN_CURR
71
- NODE_GASGN,
72
- #define NODE_GASGN NODE_GASGN
73
- NODE_IASGN,
74
- #define NODE_IASGN NODE_IASGN
75
- NODE_IASGN2,
76
- #define NODE_IASGN2 NODE_IASGN2
77
- NODE_CDECL,
78
- #define NODE_CDECL NODE_CDECL
79
- NODE_CVASGN,
80
- #define NODE_CVASGN NODE_CVASGN
81
- NODE_CVDECL,
82
- #define NODE_CVDECL NODE_CVDECL
83
- NODE_OP_ASGN1,
84
- #define NODE_OP_ASGN1 NODE_OP_ASGN1
85
- NODE_OP_ASGN2,
86
- #define NODE_OP_ASGN2 NODE_OP_ASGN2
87
- NODE_OP_ASGN_AND,
88
- #define NODE_OP_ASGN_AND NODE_OP_ASGN_AND
89
- NODE_OP_ASGN_OR,
90
- #define NODE_OP_ASGN_OR NODE_OP_ASGN_OR
91
- NODE_CALL,
92
- #define NODE_CALL NODE_CALL
93
- NODE_FCALL,
94
- #define NODE_FCALL NODE_FCALL
95
- NODE_VCALL,
96
- #define NODE_VCALL NODE_VCALL
97
- NODE_SUPER,
98
- #define NODE_SUPER NODE_SUPER
99
- NODE_ZSUPER,
100
- #define NODE_ZSUPER NODE_ZSUPER
101
- NODE_ARRAY,
102
- #define NODE_ARRAY NODE_ARRAY
103
- NODE_ZARRAY,
104
- #define NODE_ZARRAY NODE_ZARRAY
105
- NODE_VALUES,
106
- #define NODE_VALUES NODE_VALUES
107
- NODE_HASH,
108
- #define NODE_HASH NODE_HASH
109
- NODE_RETURN,
110
- #define NODE_RETURN NODE_RETURN
111
- NODE_YIELD,
112
- #define NODE_YIELD NODE_YIELD
113
- NODE_LVAR,
114
- #define NODE_LVAR NODE_LVAR
115
- NODE_DVAR,
116
- #define NODE_DVAR NODE_DVAR
117
- NODE_GVAR,
118
- #define NODE_GVAR NODE_GVAR
119
- NODE_IVAR,
120
- #define NODE_IVAR NODE_IVAR
121
- NODE_CONST,
122
- #define NODE_CONST NODE_CONST
123
- NODE_CVAR,
124
- #define NODE_CVAR NODE_CVAR
125
- NODE_NTH_REF,
126
- #define NODE_NTH_REF NODE_NTH_REF
127
- NODE_BACK_REF,
128
- #define NODE_BACK_REF NODE_BACK_REF
129
- NODE_MATCH,
130
- #define NODE_MATCH NODE_MATCH
131
- NODE_MATCH2,
132
- #define NODE_MATCH2 NODE_MATCH2
133
- NODE_MATCH3,
134
- #define NODE_MATCH3 NODE_MATCH3
135
- NODE_LIT,
136
- #define NODE_LIT NODE_LIT
137
- NODE_STR,
138
- #define NODE_STR NODE_STR
139
- NODE_DSTR,
140
- #define NODE_DSTR NODE_DSTR
141
- NODE_XSTR,
142
- #define NODE_XSTR NODE_XSTR
143
- NODE_DXSTR,
144
- #define NODE_DXSTR NODE_DXSTR
145
- NODE_EVSTR,
146
- #define NODE_EVSTR NODE_EVSTR
147
- NODE_DREGX,
148
- #define NODE_DREGX NODE_DREGX
149
- NODE_DREGX_ONCE,
150
- #define NODE_DREGX_ONCE NODE_DREGX_ONCE
151
- NODE_ARGS,
152
- #define NODE_ARGS NODE_ARGS
153
- NODE_ARGS_AUX,
154
- #define NODE_ARGS_AUX NODE_ARGS_AUX
155
- NODE_OPT_ARG,
156
- #define NODE_OPT_ARG NODE_OPT_ARG
157
- NODE_POSTARG,
158
- #define NODE_POSTARG NODE_POSTARG
159
- NODE_ARGSCAT,
160
- #define NODE_ARGSCAT NODE_ARGSCAT
161
- NODE_ARGSPUSH,
162
- #define NODE_ARGSPUSH NODE_ARGSPUSH
163
- NODE_SPLAT,
164
- #define NODE_SPLAT NODE_SPLAT
165
- NODE_TO_ARY,
166
- #define NODE_TO_ARY NODE_TO_ARY
167
- NODE_BLOCK_ARG,
168
- #define NODE_BLOCK_ARG NODE_BLOCK_ARG
169
- NODE_BLOCK_PASS,
170
- #define NODE_BLOCK_PASS NODE_BLOCK_PASS
171
- NODE_DEFN,
172
- #define NODE_DEFN NODE_DEFN
173
- NODE_DEFS,
174
- #define NODE_DEFS NODE_DEFS
175
- NODE_ALIAS,
176
- #define NODE_ALIAS NODE_ALIAS
177
- NODE_VALIAS,
178
- #define NODE_VALIAS NODE_VALIAS
179
- NODE_UNDEF,
180
- #define NODE_UNDEF NODE_UNDEF
181
- NODE_CLASS,
182
- #define NODE_CLASS NODE_CLASS
183
- NODE_MODULE,
184
- #define NODE_MODULE NODE_MODULE
185
- NODE_SCLASS,
186
- #define NODE_SCLASS NODE_SCLASS
187
- NODE_COLON2,
188
- #define NODE_COLON2 NODE_COLON2
189
- NODE_COLON3,
190
- #define NODE_COLON3 NODE_COLON3
191
- NODE_DOT2,
192
- #define NODE_DOT2 NODE_DOT2
193
- NODE_DOT3,
194
- #define NODE_DOT3 NODE_DOT3
195
- NODE_FLIP2,
196
- #define NODE_FLIP2 NODE_FLIP2
197
- NODE_FLIP3,
198
- #define NODE_FLIP3 NODE_FLIP3
199
- NODE_SELF,
200
- #define NODE_SELF NODE_SELF
201
- NODE_NIL,
202
- #define NODE_NIL NODE_NIL
203
- NODE_TRUE,
204
- #define NODE_TRUE NODE_TRUE
205
- NODE_FALSE,
206
- #define NODE_FALSE NODE_FALSE
207
- NODE_ERRINFO,
208
- #define NODE_ERRINFO NODE_ERRINFO
209
- NODE_DEFINED,
210
- #define NODE_DEFINED NODE_DEFINED
211
- NODE_POSTEXE,
212
- #define NODE_POSTEXE NODE_POSTEXE
213
- NODE_ALLOCA,
214
- #define NODE_ALLOCA NODE_ALLOCA
215
- NODE_BMETHOD,
216
- #define NODE_BMETHOD NODE_BMETHOD
217
- NODE_MEMO,
218
- #define NODE_MEMO NODE_MEMO
219
- NODE_IFUNC,
220
- #define NODE_IFUNC NODE_IFUNC
221
- NODE_DSYM,
222
- #define NODE_DSYM NODE_DSYM
223
- NODE_ATTRASGN,
224
- #define NODE_ATTRASGN NODE_ATTRASGN
225
- NODE_PRELUDE,
226
- #define NODE_PRELUDE NODE_PRELUDE
227
- NODE_LAMBDA,
228
- #define NODE_LAMBDA NODE_LAMBDA
229
- NODE_OPTBLOCK,
230
- #define NODE_OPTBLOCK NODE_OPTBLOCK
231
- NODE_LAST
232
- #define NODE_LAST NODE_LAST
233
- };
234
-
235
- typedef struct RNode {
236
- unsigned long flags;
237
- char *nd_file;
238
- union {
239
- struct RNode *node;
240
- ID id;
241
- VALUE value;
242
- VALUE (*cfunc)(ANYARGS);
243
- ID *tbl;
244
- } u1;
245
- union {
246
- struct RNode *node;
247
- ID id;
248
- long argc;
249
- VALUE value;
250
- } u2;
251
- union {
252
- struct RNode *node;
253
- ID id;
254
- long state;
255
- struct rb_global_entry *entry;
256
- long cnt;
257
- VALUE value;
258
- } u3;
259
- } NODE;
260
-
261
- #define RNODE(obj) (R_CAST(RNode)(obj))
262
-
263
- /* 0..4:T_TYPES, 5:FL_MARK, 6:reserved, 7:NODE_FL_NEWLINE */
264
- #define NODE_FL_NEWLINE (((VALUE)1)<<7)
265
- #define NODE_FL_CREF_PUSHED_BY_EVAL NODE_FL_NEWLINE
266
-
267
- #define NODE_TYPESHIFT 8
268
- #define NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT)
269
-
270
- #define nd_type(n) ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT))
271
- #define nd_set_type(n,t) \
272
- RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)t)<<NODE_TYPESHIFT)&NODE_TYPEMASK))
273
-
274
- #define NODE_LSHIFT (NODE_TYPESHIFT+7)
275
- #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
276
- #define nd_line(n) (int)(RNODE(n)->flags>>NODE_LSHIFT)
277
- #define nd_set_line(n,l) \
278
- RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT))
279
-
280
- #define nd_head u1.node
281
- #define nd_alen u2.argc
282
- #define nd_next u3.node
283
-
284
- #define nd_cond u1.node
285
- #define nd_body u2.node
286
- #define nd_else u3.node
287
-
288
- #define nd_orig u3.value
289
-
290
- #define nd_resq u2.node
291
- #define nd_ensr u3.node
292
-
293
- #define nd_1st u1.node
294
- #define nd_2nd u2.node
295
-
296
- #define nd_stts u1.node
297
-
298
- #define nd_entry u3.entry
299
- #define nd_vid u1.id
300
- #define nd_cflag u2.id
301
- #define nd_cval u3.value
302
-
303
- #define nd_oid u1.id
304
- #define nd_cnt u3.cnt
305
- #define nd_tbl u1.tbl
306
-
307
- #define nd_var u1.node
308
- #define nd_iter u3.node
309
-
310
- #define nd_value u2.node
311
- #define nd_aid u3.id
312
-
313
- #define nd_lit u1.value
314
-
315
- #define nd_frml u2.argc
316
- #define nd_rest u1.id
317
- #define nd_opt u1.node
318
- #define nd_pid u1.id
319
- #define nd_plen u2.argc
320
-
321
- #define nd_recv u1.node
322
- #define nd_mid u2.id
323
- #define nd_args u3.node
324
-
325
- #define nd_noex u3.id
326
- #define nd_defn u3.node
327
-
328
- #define nd_cfnc u1.cfunc
329
- #define nd_argc u2.argc
330
-
331
- #define nd_cpath u1.node
332
- #define nd_super u3.node
333
-
334
- #define nd_modl u1.id
335
- #define nd_clss u1.value
336
-
337
- #define nd_beg u1.node
338
- #define nd_end u2.node
339
- #define nd_state u3.state
340
- #define nd_rval u2.value
341
-
342
- #define nd_nth u2.argc
343
-
344
- #define nd_tag u1.id
345
- #define nd_tval u2.value
346
-
347
- #define nd_visi u2.argc
348
-
349
- #define NEW_NODE(t,a0,a1,a2) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2))
350
-
351
- #define NEW_DEFN(i,a,d,p) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d))
352
- #define NEW_DEFS(r,i,a,d) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d))
353
- #define NEW_IFUNC(f,c) NEW_NODE(NODE_IFUNC,f,c,0)
354
- #define NEW_SCOPE(a,b) NEW_NODE(NODE_SCOPE,local_tbl(),b,a)
355
- #define NEW_BLOCK(a) NEW_NODE(NODE_BLOCK,a,0,0)
356
- #define NEW_IF(c,t,e) NEW_NODE(NODE_IF,c,t,e)
357
- #define NEW_UNLESS(c,t,e) NEW_IF(c,e,t)
358
- #define NEW_CASE(h,b) NEW_NODE(NODE_CASE,h,b,0)
359
- #define NEW_WHEN(c,t,e) NEW_NODE(NODE_WHEN,c,t,e)
360
- #define NEW_OPT_N(b) NEW_NODE(NODE_OPT_N,0,b,0)
361
- #define NEW_WHILE(c,b,n) NEW_NODE(NODE_WHILE,c,b,n)
362
- #define NEW_UNTIL(c,b,n) NEW_NODE(NODE_UNTIL,c,b,n)
363
- #define NEW_FOR(v,i,b) NEW_NODE(NODE_FOR,v,b,i)
364
- #define NEW_ITER(a,b) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0)
365
- #define NEW_LAMBDA(a) NEW_NODE(NODE_LAMBDA,a,0,0)
366
- #define NEW_BREAK(s) NEW_NODE(NODE_BREAK,s,0,0)
367
- #define NEW_NEXT(s) NEW_NODE(NODE_NEXT,s,0,0)
368
- #define NEW_REDO() NEW_NODE(NODE_REDO,0,0,0)
369
- #define NEW_RETRY() NEW_NODE(NODE_RETRY,0,0,0)
370
- #define NEW_BEGIN(b) NEW_NODE(NODE_BEGIN,0,b,0)
371
- #define NEW_RESCUE(b,res,e) NEW_NODE(NODE_RESCUE,b,res,e)
372
- #define NEW_RESBODY(a,ex,n) NEW_NODE(NODE_RESBODY,n,ex,a)
373
- #define NEW_ENSURE(b,en) NEW_NODE(NODE_ENSURE,b,0,en)
374
- #define NEW_RETURN(s) NEW_NODE(NODE_RETURN,s,0,0)
375
- #define NEW_YIELD(a,s) NEW_NODE(NODE_YIELD,a,0,s)
376
- #define NEW_LIST(a) NEW_ARRAY(a)
377
- #define NEW_ARRAY(a) NEW_NODE(NODE_ARRAY,a,1,0)
378
- #define NEW_ZARRAY() NEW_NODE(NODE_ZARRAY,0,0,0)
379
- #define NEW_HASH(a) NEW_NODE(NODE_HASH,a,0,0)
380
- #define NEW_MASGN(l,r) NEW_NODE(NODE_MASGN,l,0,r)
381
- #define NEW_GASGN(v,val) NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v))
382
- #define NEW_LASGN(v,val) NEW_NODE(NODE_LASGN,v,val,0)
383
- #define NEW_DASGN(v,val) NEW_NODE(NODE_DASGN,v,val,0)
384
- #define NEW_DASGN_CURR(v,val) NEW_NODE(NODE_DASGN_CURR,v,val,0)
385
- #define NEW_IASGN(v,val) NEW_NODE(NODE_IASGN,v,val,0)
386
- #define NEW_IASGN2(v,val) NEW_NODE(NODE_IASGN2,v,val,0)
387
- #define NEW_CDECL(v,val,path) NEW_NODE(NODE_CDECL,v,val,path)
388
- #define NEW_CVASGN(v,val) NEW_NODE(NODE_CVASGN,v,val,0)
389
- #define NEW_CVDECL(v,val) NEW_NODE(NODE_CVDECL,v,val,0)
390
- #define NEW_OP_ASGN1(p,id,a) NEW_NODE(NODE_OP_ASGN1,p,id,a)
391
- #define NEW_OP_ASGN2(r,i,o,val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o))
392
- #define NEW_OP_ASGN22(i,o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i))
393
- #define NEW_OP_ASGN_OR(i,val) NEW_NODE(NODE_OP_ASGN_OR,i,val,0)
394
- #define NEW_OP_ASGN_AND(i,val) NEW_NODE(NODE_OP_ASGN_AND,i,val,0)
395
- #define NEW_GVAR(v) NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v))
396
- #define NEW_LVAR(v) NEW_NODE(NODE_LVAR,v,0,0)
397
- #define NEW_DVAR(v) NEW_NODE(NODE_DVAR,v,0,0)
398
- #define NEW_IVAR(v) NEW_NODE(NODE_IVAR,v,0,0)
399
- #define NEW_CONST(v) NEW_NODE(NODE_CONST,v,0,0)
400
- #define NEW_CVAR(v) NEW_NODE(NODE_CVAR,v,0,0)
401
- #define NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,0)
402
- #define NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,0)
403
- #define NEW_MATCH(c) NEW_NODE(NODE_MATCH,c,0,0)
404
- #define NEW_MATCH2(n1,n2) NEW_NODE(NODE_MATCH2,n1,n2,0)
405
- #define NEW_MATCH3(r,n2) NEW_NODE(NODE_MATCH3,r,n2,0)
406
- #define NEW_LIT(l) NEW_NODE(NODE_LIT,l,0,0)
407
- #define NEW_STR(s) NEW_NODE(NODE_STR,s,0,0)
408
- #define NEW_DSTR(s) NEW_NODE(NODE_DSTR,s,1,0)
409
- #define NEW_XSTR(s) NEW_NODE(NODE_XSTR,s,0,0)
410
- #define NEW_DXSTR(s) NEW_NODE(NODE_DXSTR,s,0,0)
411
- #define NEW_DSYM(s) NEW_NODE(NODE_DSYM,s,0,0)
412
- #define NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0)
413
- #define NEW_CALL(r,m,a) NEW_NODE(NODE_CALL,r,m,a)
414
- #define NEW_FCALL(m,a) NEW_NODE(NODE_FCALL,0,m,a)
415
- #define NEW_VCALL(m) NEW_NODE(NODE_VCALL,0,m,0)
416
- #define NEW_SUPER(a) NEW_NODE(NODE_SUPER,0,0,a)
417
- #define NEW_ZSUPER() NEW_NODE(NODE_ZSUPER,0,0,0)
418
- #define NEW_ARGS(m,o) NEW_NODE(NODE_ARGS,o,m,0)
419
- #define NEW_ARGS_AUX(r,b) NEW_NODE(NODE_ARGS_AUX,r,b,0)
420
- #define NEW_OPT_ARG(i,v) NEW_NODE(NODE_OPT_ARG,i,v,0)
421
- #define NEW_POSTARG(i,v) NEW_NODE(NODE_POSTARG,i,v,0)
422
- #define NEW_ARGSCAT(a,b) NEW_NODE(NODE_ARGSCAT,a,b,0)
423
- #define NEW_ARGSPUSH(a,b) NEW_NODE(NODE_ARGSPUSH,a,b,0)
424
- #define NEW_SPLAT(a) NEW_NODE(NODE_SPLAT,a,0,0)
425
- #define NEW_TO_ARY(a) NEW_NODE(NODE_TO_ARY,a,0,0)
426
- #define NEW_BLOCK_ARG(v) NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v))
427
- #define NEW_BLOCK_PASS(b) NEW_NODE(NODE_BLOCK_PASS,0,b,0)
428
- #define NEW_ALIAS(n,o) NEW_NODE(NODE_ALIAS,n,o,0)
429
- #define NEW_VALIAS(n,o) NEW_NODE(NODE_VALIAS,n,o,0)
430
- #define NEW_UNDEF(i) NEW_NODE(NODE_UNDEF,0,i,0)
431
- #define NEW_CLASS(n,b,s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s))
432
- #define NEW_SCLASS(r,b) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),0)
433
- #define NEW_MODULE(n,b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0)
434
- #define NEW_COLON2(c,i) NEW_NODE(NODE_COLON2,c,i,0)
435
- #define NEW_COLON3(i) NEW_NODE(NODE_COLON3,0,i,0)
436
- #define NEW_DOT2(b,e) NEW_NODE(NODE_DOT2,b,e,0)
437
- #define NEW_DOT3(b,e) NEW_NODE(NODE_DOT3,b,e,0)
438
- #define NEW_SELF() NEW_NODE(NODE_SELF,0,0,0)
439
- #define NEW_NIL() NEW_NODE(NODE_NIL,0,0,0)
440
- #define NEW_TRUE() NEW_NODE(NODE_TRUE,0,0,0)
441
- #define NEW_FALSE() NEW_NODE(NODE_FALSE,0,0,0)
442
- #define NEW_ERRINFO() NEW_NODE(NODE_ERRINFO,0,0,0)
443
- #define NEW_DEFINED(e) NEW_NODE(NODE_DEFINED,e,0,0)
444
- #define NEW_PREEXE(b) NEW_SCOPE(b)
445
- #define NEW_POSTEXE(b) NEW_NODE(NODE_POSTEXE,0,b,0)
446
- #define NEW_BMETHOD(b) NEW_NODE(NODE_BMETHOD,0,0,b)
447
- #define NEW_ATTRASGN(r,m,a) NEW_NODE(NODE_ATTRASGN,r,m,a)
448
- #define NEW_PRELUDE(p,b) NEW_NODE(NODE_PRELUDE,p,b,0)
449
- #define NEW_OPTBLOCK(a) NEW_NODE(NODE_OPTBLOCK,a,0,0)
450
-
451
- VALUE rb_parser_new(void);
452
- VALUE rb_parser_end_seen_p(VALUE);
453
- VALUE rb_parser_encoding(VALUE);
454
-
455
- NODE *rb_parser_compile_cstr(volatile VALUE, const char*, const char*, int, int);
456
- NODE *rb_parser_compile_string(volatile VALUE, const char*, VALUE, int);
457
- NODE *rb_parser_compile_file(volatile VALUE, const char*, VALUE, int);
458
-
459
- NODE *rb_compile_cstr(const char*, const char*, int, int);
460
- NODE *rb_compile_string(const char*, VALUE, int);
461
- NODE *rb_compile_file(const char*, VALUE, int);
462
-
463
- NODE *rb_node_newnode(enum node_type,VALUE,VALUE,VALUE);
464
- NODE *rb_node_newnode_longlife(enum node_type,VALUE,VALUE,VALUE);
465
-
466
- struct rb_global_entry {
467
- struct rb_global_variable *var;
468
- ID id;
469
- };
470
-
471
- struct rb_global_entry *rb_global_entry(ID);
472
- VALUE rb_gvar_get(struct rb_global_entry *);
473
- VALUE rb_gvar_set(struct rb_global_entry *, VALUE);
474
- VALUE rb_gvar_defined(struct rb_global_entry *);
475
-
476
- #if defined(__cplusplus)
477
- #if 0
478
- { /* satisfy cc-mode */
479
- #endif
480
- } /* extern "C" { */
481
- #endif
482
-
483
- #endif /* RUBY_NODE_H */