fast_method_source 0.1.0

Sign up to get free protection for your applications and to get access to all the features.
@@ -0,0 +1,519 @@
1
+ /**********************************************************************
2
+
3
+ node.h -
4
+
5
+ $Author$
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_OP_CDECL,
92
+ #define NODE_OP_CDECL NODE_OP_CDECL
93
+ NODE_CALL,
94
+ #define NODE_CALL NODE_CALL
95
+ NODE_FCALL,
96
+ #define NODE_FCALL NODE_FCALL
97
+ NODE_VCALL,
98
+ #define NODE_VCALL NODE_VCALL
99
+ NODE_SUPER,
100
+ #define NODE_SUPER NODE_SUPER
101
+ NODE_ZSUPER,
102
+ #define NODE_ZSUPER NODE_ZSUPER
103
+ NODE_ARRAY,
104
+ #define NODE_ARRAY NODE_ARRAY
105
+ NODE_ZARRAY,
106
+ #define NODE_ZARRAY NODE_ZARRAY
107
+ NODE_VALUES,
108
+ #define NODE_VALUES NODE_VALUES
109
+ NODE_HASH,
110
+ #define NODE_HASH NODE_HASH
111
+ NODE_RETURN,
112
+ #define NODE_RETURN NODE_RETURN
113
+ NODE_YIELD,
114
+ #define NODE_YIELD NODE_YIELD
115
+ NODE_LVAR,
116
+ #define NODE_LVAR NODE_LVAR
117
+ NODE_DVAR,
118
+ #define NODE_DVAR NODE_DVAR
119
+ NODE_GVAR,
120
+ #define NODE_GVAR NODE_GVAR
121
+ NODE_IVAR,
122
+ #define NODE_IVAR NODE_IVAR
123
+ NODE_CONST,
124
+ #define NODE_CONST NODE_CONST
125
+ NODE_CVAR,
126
+ #define NODE_CVAR NODE_CVAR
127
+ NODE_NTH_REF,
128
+ #define NODE_NTH_REF NODE_NTH_REF
129
+ NODE_BACK_REF,
130
+ #define NODE_BACK_REF NODE_BACK_REF
131
+ NODE_MATCH,
132
+ #define NODE_MATCH NODE_MATCH
133
+ NODE_MATCH2,
134
+ #define NODE_MATCH2 NODE_MATCH2
135
+ NODE_MATCH3,
136
+ #define NODE_MATCH3 NODE_MATCH3
137
+ NODE_LIT,
138
+ #define NODE_LIT NODE_LIT
139
+ NODE_STR,
140
+ #define NODE_STR NODE_STR
141
+ NODE_DSTR,
142
+ #define NODE_DSTR NODE_DSTR
143
+ NODE_XSTR,
144
+ #define NODE_XSTR NODE_XSTR
145
+ NODE_DXSTR,
146
+ #define NODE_DXSTR NODE_DXSTR
147
+ NODE_EVSTR,
148
+ #define NODE_EVSTR NODE_EVSTR
149
+ NODE_DREGX,
150
+ #define NODE_DREGX NODE_DREGX
151
+ NODE_DREGX_ONCE,
152
+ #define NODE_DREGX_ONCE NODE_DREGX_ONCE
153
+ NODE_ARGS,
154
+ #define NODE_ARGS NODE_ARGS
155
+ NODE_ARGS_AUX,
156
+ #define NODE_ARGS_AUX NODE_ARGS_AUX
157
+ NODE_OPT_ARG,
158
+ #define NODE_OPT_ARG NODE_OPT_ARG
159
+ NODE_KW_ARG,
160
+ #define NODE_KW_ARG NODE_KW_ARG
161
+ NODE_POSTARG,
162
+ #define NODE_POSTARG NODE_POSTARG
163
+ NODE_ARGSCAT,
164
+ #define NODE_ARGSCAT NODE_ARGSCAT
165
+ NODE_ARGSPUSH,
166
+ #define NODE_ARGSPUSH NODE_ARGSPUSH
167
+ NODE_SPLAT,
168
+ #define NODE_SPLAT NODE_SPLAT
169
+ NODE_TO_ARY,
170
+ #define NODE_TO_ARY NODE_TO_ARY
171
+ NODE_BLOCK_ARG,
172
+ #define NODE_BLOCK_ARG NODE_BLOCK_ARG
173
+ NODE_BLOCK_PASS,
174
+ #define NODE_BLOCK_PASS NODE_BLOCK_PASS
175
+ NODE_DEFN,
176
+ #define NODE_DEFN NODE_DEFN
177
+ NODE_DEFS,
178
+ #define NODE_DEFS NODE_DEFS
179
+ NODE_ALIAS,
180
+ #define NODE_ALIAS NODE_ALIAS
181
+ NODE_VALIAS,
182
+ #define NODE_VALIAS NODE_VALIAS
183
+ NODE_UNDEF,
184
+ #define NODE_UNDEF NODE_UNDEF
185
+ NODE_CLASS,
186
+ #define NODE_CLASS NODE_CLASS
187
+ NODE_MODULE,
188
+ #define NODE_MODULE NODE_MODULE
189
+ NODE_SCLASS,
190
+ #define NODE_SCLASS NODE_SCLASS
191
+ NODE_COLON2,
192
+ #define NODE_COLON2 NODE_COLON2
193
+ NODE_COLON3,
194
+ #define NODE_COLON3 NODE_COLON3
195
+ NODE_DOT2,
196
+ #define NODE_DOT2 NODE_DOT2
197
+ NODE_DOT3,
198
+ #define NODE_DOT3 NODE_DOT3
199
+ NODE_FLIP2,
200
+ #define NODE_FLIP2 NODE_FLIP2
201
+ NODE_FLIP3,
202
+ #define NODE_FLIP3 NODE_FLIP3
203
+ NODE_SELF,
204
+ #define NODE_SELF NODE_SELF
205
+ NODE_NIL,
206
+ #define NODE_NIL NODE_NIL
207
+ NODE_TRUE,
208
+ #define NODE_TRUE NODE_TRUE
209
+ NODE_FALSE,
210
+ #define NODE_FALSE NODE_FALSE
211
+ NODE_ERRINFO,
212
+ #define NODE_ERRINFO NODE_ERRINFO
213
+ NODE_DEFINED,
214
+ #define NODE_DEFINED NODE_DEFINED
215
+ NODE_POSTEXE,
216
+ #define NODE_POSTEXE NODE_POSTEXE
217
+ NODE_ALLOCA,
218
+ #define NODE_ALLOCA NODE_ALLOCA
219
+ NODE_BMETHOD,
220
+ #define NODE_BMETHOD NODE_BMETHOD
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_LAST
230
+ #define NODE_LAST NODE_LAST
231
+ };
232
+
233
+ typedef struct RNode {
234
+ VALUE flags;
235
+ VALUE nd_reserved; /* ex nd_file */
236
+ union {
237
+ struct RNode *node;
238
+ ID id;
239
+ VALUE value;
240
+ VALUE (*cfunc)(ANYARGS);
241
+ ID *tbl;
242
+ } u1;
243
+ union {
244
+ struct RNode *node;
245
+ ID id;
246
+ long argc;
247
+ VALUE value;
248
+ } u2;
249
+ union {
250
+ struct RNode *node;
251
+ ID id;
252
+ long state;
253
+ struct rb_global_entry *entry;
254
+ struct rb_args_info *args;
255
+ long cnt;
256
+ VALUE value;
257
+ } u3;
258
+ } NODE;
259
+
260
+ #define RNODE(obj) (R_CAST(RNode)(obj))
261
+
262
+ /* FL : 0..4: T_TYPES, 5: KEEP_WB, 6: PROMOTED, 7: FINALIZE, 8: TAINT, 9: UNTRUSTERD, 10: EXIVAR, 11: FREEZE */
263
+ /* NODE_FL: 0..4: T_TYPES, 5: KEEP_WB, 6: PROMOTED, 7: NODE_FL_NEWLINE|NODE_FL_CREF_PUSHED_BY_EVAL,
264
+ * 8..14: nd_type,
265
+ * 15..: nd_line or
266
+ * 15: NODE_FL_CREF_PUSHED_BY_EVAL
267
+ * 16: NODE_FL_CREF_OMOD_SHARED
268
+ */
269
+ #define NODE_FL_NEWLINE (((VALUE)1)<<7)
270
+
271
+ #define NODE_TYPESHIFT 8
272
+ #define NODE_TYPEMASK (((VALUE)0x7f)<<NODE_TYPESHIFT)
273
+
274
+ #define nd_type(n) ((int) (((RNODE(n))->flags & NODE_TYPEMASK)>>NODE_TYPESHIFT))
275
+ #define nd_set_type(n,t) \
276
+ RNODE(n)->flags=((RNODE(n)->flags&~NODE_TYPEMASK)|((((unsigned long)(t))<<NODE_TYPESHIFT)&NODE_TYPEMASK))
277
+
278
+ #define NODE_LSHIFT (NODE_TYPESHIFT+7)
279
+ #define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
280
+ #define nd_line(n) (int)(RNODE(n)->flags>>NODE_LSHIFT)
281
+ #define nd_set_line(n,l) \
282
+ RNODE(n)->flags=((RNODE(n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
283
+
284
+ #define nd_refinements_ nd_reserved
285
+
286
+ #define nd_head u1.node
287
+ #define nd_alen u2.argc
288
+ #define nd_next u3.node
289
+
290
+ #define nd_cond u1.node
291
+ #define nd_body u2.node
292
+ #define nd_else u3.node
293
+
294
+ #define nd_orig u3.value
295
+
296
+ #define nd_resq u2.node
297
+ #define nd_ensr u3.node
298
+
299
+ #define nd_1st u1.node
300
+ #define nd_2nd u2.node
301
+
302
+ #define nd_stts u1.node
303
+
304
+ #define nd_entry u3.entry
305
+ #define nd_vid u1.id
306
+ #define nd_cflag u2.id
307
+ #define nd_cval u3.value
308
+
309
+ #define nd_oid u1.id
310
+ #define nd_cnt u3.cnt
311
+ #define nd_tbl u1.tbl
312
+
313
+ #define nd_var u1.node
314
+ #define nd_iter u3.node
315
+
316
+ #define nd_value u2.node
317
+ #define nd_aid u3.id
318
+
319
+ #define nd_lit u1.value
320
+
321
+ #define nd_frml u2.argc
322
+ #define nd_rest u1.id
323
+ #define nd_opt u1.node
324
+ #define nd_pid u1.id
325
+ #define nd_plen u2.argc
326
+
327
+ #define nd_recv u1.node
328
+ #define nd_mid u2.id
329
+ #define nd_args u3.node
330
+ #define nd_ainfo u3.args
331
+
332
+ #define nd_noex u3.id
333
+ #define nd_defn u3.node
334
+
335
+ #define nd_cfnc u1.cfunc
336
+ #define nd_argc u2.argc
337
+
338
+ #define nd_cpath u1.node
339
+ #define nd_super u3.node
340
+
341
+ #define nd_modl u1.id
342
+ #define nd_clss_ u1.value
343
+
344
+ #define nd_beg u1.node
345
+ #define nd_end u2.node
346
+ #define nd_state u3.state
347
+ #define nd_rval u2.value
348
+
349
+ #define nd_nth u2.argc
350
+
351
+ #define nd_tag u1.id
352
+ #define nd_tval u2.value
353
+
354
+ #define nd_visi_ u2.argc
355
+
356
+ #define NEW_NODE(t,a0,a1,a2) rb_node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2))
357
+
358
+ #define NEW_DEFN(i,a,d,p) NEW_NODE(NODE_DEFN,0,i,NEW_SCOPE(a,d))
359
+ #define NEW_DEFS(r,i,a,d) NEW_NODE(NODE_DEFS,r,i,NEW_SCOPE(a,d))
360
+ #define NEW_SCOPE(a,b) NEW_NODE(NODE_SCOPE,local_tbl(),b,a)
361
+ #define NEW_BLOCK(a) NEW_NODE(NODE_BLOCK,a,0,0)
362
+ #define NEW_IF(c,t,e) NEW_NODE(NODE_IF,c,t,e)
363
+ #define NEW_UNLESS(c,t,e) NEW_IF(c,e,t)
364
+ #define NEW_CASE(h,b) NEW_NODE(NODE_CASE,h,b,0)
365
+ #define NEW_WHEN(c,t,e) NEW_NODE(NODE_WHEN,c,t,e)
366
+ #define NEW_OPT_N(b) NEW_NODE(NODE_OPT_N,0,b,0)
367
+ #define NEW_WHILE(c,b,n) NEW_NODE(NODE_WHILE,c,b,n)
368
+ #define NEW_UNTIL(c,b,n) NEW_NODE(NODE_UNTIL,c,b,n)
369
+ #define NEW_FOR(v,i,b) NEW_NODE(NODE_FOR,v,b,i)
370
+ #define NEW_ITER(a,b) NEW_NODE(NODE_ITER,0,NEW_SCOPE(a,b),0)
371
+ #define NEW_LAMBDA(a,b) NEW_NODE(NODE_LAMBDA,0,NEW_SCOPE(a,b),0)
372
+ #define NEW_BREAK(s) NEW_NODE(NODE_BREAK,s,0,0)
373
+ #define NEW_NEXT(s) NEW_NODE(NODE_NEXT,s,0,0)
374
+ #define NEW_REDO() NEW_NODE(NODE_REDO,0,0,0)
375
+ #define NEW_RETRY() NEW_NODE(NODE_RETRY,0,0,0)
376
+ #define NEW_BEGIN(b) NEW_NODE(NODE_BEGIN,0,b,0)
377
+ #define NEW_RESCUE(b,res,e) NEW_NODE(NODE_RESCUE,b,res,e)
378
+ #define NEW_RESBODY(a,ex,n) NEW_NODE(NODE_RESBODY,n,ex,a)
379
+ #define NEW_ENSURE(b,en) NEW_NODE(NODE_ENSURE,b,0,en)
380
+ #define NEW_RETURN(s) NEW_NODE(NODE_RETURN,s,0,0)
381
+ #define NEW_YIELD(a) NEW_NODE(NODE_YIELD,a,0,0)
382
+ #define NEW_LIST(a) NEW_ARRAY(a)
383
+ #define NEW_ARRAY(a) NEW_NODE(NODE_ARRAY,a,1,0)
384
+ #define NEW_ZARRAY() NEW_NODE(NODE_ZARRAY,0,0,0)
385
+ #define NEW_HASH(a) NEW_NODE(NODE_HASH,a,0,0)
386
+ #define NEW_MASGN(l,r) NEW_NODE(NODE_MASGN,l,0,r)
387
+ #define NEW_GASGN(v,val) NEW_NODE(NODE_GASGN,v,val,rb_global_entry(v))
388
+ #define NEW_LASGN(v,val) NEW_NODE(NODE_LASGN,v,val,0)
389
+ #define NEW_DASGN(v,val) NEW_NODE(NODE_DASGN,v,val,0)
390
+ #define NEW_DASGN_CURR(v,val) NEW_NODE(NODE_DASGN_CURR,v,val,0)
391
+ #define NEW_IASGN(v,val) NEW_NODE(NODE_IASGN,v,val,0)
392
+ #define NEW_IASGN2(v,val) NEW_NODE(NODE_IASGN2,v,val,0)
393
+ #define NEW_CDECL(v,val,path) NEW_NODE(NODE_CDECL,v,val,path)
394
+ #define NEW_CVASGN(v,val) NEW_NODE(NODE_CVASGN,v,val,0)
395
+ #define NEW_CVDECL(v,val) NEW_NODE(NODE_CVDECL,v,val,0)
396
+ #define NEW_OP_ASGN1(p,id,a) NEW_NODE(NODE_OP_ASGN1,p,id,a)
397
+ #define NEW_OP_ASGN2(r,i,o,val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o))
398
+ #define NEW_OP_ASGN22(i,o) NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset(i))
399
+ #define NEW_OP_ASGN_OR(i,val) NEW_NODE(NODE_OP_ASGN_OR,i,val,0)
400
+ #define NEW_OP_ASGN_AND(i,val) NEW_NODE(NODE_OP_ASGN_AND,i,val,0)
401
+ #define NEW_OP_CDECL(v,op,val) NEW_NODE(NODE_OP_CDECL,v,val,op)
402
+ #define NEW_GVAR(v) NEW_NODE(NODE_GVAR,v,0,rb_global_entry(v))
403
+ #define NEW_LVAR(v) NEW_NODE(NODE_LVAR,v,0,0)
404
+ #define NEW_DVAR(v) NEW_NODE(NODE_DVAR,v,0,0)
405
+ #define NEW_IVAR(v) NEW_NODE(NODE_IVAR,v,0,0)
406
+ #define NEW_CONST(v) NEW_NODE(NODE_CONST,v,0,0)
407
+ #define NEW_CVAR(v) NEW_NODE(NODE_CVAR,v,0,0)
408
+ #define NEW_NTH_REF(n) NEW_NODE(NODE_NTH_REF,0,n,0)
409
+ #define NEW_BACK_REF(n) NEW_NODE(NODE_BACK_REF,0,n,0)
410
+ #define NEW_MATCH(c) NEW_NODE(NODE_MATCH,c,0,0)
411
+ #define NEW_MATCH2(n1,n2) NEW_NODE(NODE_MATCH2,n1,n2,0)
412
+ #define NEW_MATCH3(r,n2) NEW_NODE(NODE_MATCH3,r,n2,0)
413
+ #define NEW_LIT(l) NEW_NODE(NODE_LIT,l,0,0)
414
+ #define NEW_STR(s) NEW_NODE(NODE_STR,s,0,0)
415
+ #define NEW_DSTR(s) NEW_NODE(NODE_DSTR,s,1,0)
416
+ #define NEW_XSTR(s) NEW_NODE(NODE_XSTR,s,0,0)
417
+ #define NEW_DXSTR(s) NEW_NODE(NODE_DXSTR,s,0,0)
418
+ #define NEW_DSYM(s) NEW_NODE(NODE_DSYM,s,0,0)
419
+ #define NEW_EVSTR(n) NEW_NODE(NODE_EVSTR,0,(n),0)
420
+ #define NEW_CALL(r,m,a) NEW_NODE(NODE_CALL,r,m,a)
421
+ #define NEW_FCALL(m,a) NEW_NODE(NODE_FCALL,0,m,a)
422
+ #define NEW_VCALL(m) NEW_NODE(NODE_VCALL,0,m,0)
423
+ #define NEW_SUPER(a) NEW_NODE(NODE_SUPER,0,0,a)
424
+ #define NEW_ZSUPER() NEW_NODE(NODE_ZSUPER,0,0,0)
425
+ #define NEW_ARGS_AUX(r,b) NEW_NODE(NODE_ARGS_AUX,r,b,0)
426
+ #define NEW_OPT_ARG(i,v) NEW_NODE(NODE_OPT_ARG,i,v,0)
427
+ #define NEW_KW_ARG(i,v) NEW_NODE(NODE_KW_ARG,i,v,0)
428
+ #define NEW_POSTARG(i,v) NEW_NODE(NODE_POSTARG,i,v,0)
429
+ #define NEW_ARGSCAT(a,b) NEW_NODE(NODE_ARGSCAT,a,b,0)
430
+ #define NEW_ARGSPUSH(a,b) NEW_NODE(NODE_ARGSPUSH,a,b,0)
431
+ #define NEW_SPLAT(a) NEW_NODE(NODE_SPLAT,a,0,0)
432
+ #define NEW_TO_ARY(a) NEW_NODE(NODE_TO_ARY,a,0,0)
433
+ #define NEW_BLOCK_ARG(v) NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v))
434
+ #define NEW_BLOCK_PASS(b) NEW_NODE(NODE_BLOCK_PASS,0,b,0)
435
+ #define NEW_ALIAS(n,o) NEW_NODE(NODE_ALIAS,n,o,0)
436
+ #define NEW_VALIAS(n,o) NEW_NODE(NODE_VALIAS,n,o,0)
437
+ #define NEW_UNDEF(i) NEW_NODE(NODE_UNDEF,0,i,0)
438
+ #define NEW_CLASS(n,b,s) NEW_NODE(NODE_CLASS,n,NEW_SCOPE(0,b),(s))
439
+ #define NEW_SCLASS(r,b) NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(0,b),0)
440
+ #define NEW_MODULE(n,b) NEW_NODE(NODE_MODULE,n,NEW_SCOPE(0,b),0)
441
+ #define NEW_COLON2(c,i) NEW_NODE(NODE_COLON2,c,i,0)
442
+ #define NEW_COLON3(i) NEW_NODE(NODE_COLON3,0,i,0)
443
+ #define NEW_DOT2(b,e) NEW_NODE(NODE_DOT2,b,e,0)
444
+ #define NEW_DOT3(b,e) NEW_NODE(NODE_DOT3,b,e,0)
445
+ #define NEW_SELF() NEW_NODE(NODE_SELF,0,0,0)
446
+ #define NEW_NIL() NEW_NODE(NODE_NIL,0,0,0)
447
+ #define NEW_TRUE() NEW_NODE(NODE_TRUE,0,0,0)
448
+ #define NEW_FALSE() NEW_NODE(NODE_FALSE,0,0,0)
449
+ #define NEW_ERRINFO() NEW_NODE(NODE_ERRINFO,0,0,0)
450
+ #define NEW_DEFINED(e) NEW_NODE(NODE_DEFINED,e,0,0)
451
+ #define NEW_PREEXE(b) NEW_SCOPE(b)
452
+ #define NEW_POSTEXE(b) NEW_NODE(NODE_POSTEXE,0,b,0)
453
+ #define NEW_BMETHOD(b) NEW_NODE(NODE_BMETHOD,0,0,b)
454
+ #define NEW_ATTRASGN(r,m,a) NEW_NODE(NODE_ATTRASGN,r,m,a)
455
+ #define NEW_PRELUDE(p,b) NEW_NODE(NODE_PRELUDE,p,b,0)
456
+
457
+ RUBY_SYMBOL_EXPORT_BEGIN
458
+
459
+ VALUE rb_parser_new(void);
460
+ VALUE rb_parser_end_seen_p(VALUE);
461
+ VALUE rb_parser_encoding(VALUE);
462
+ VALUE rb_parser_get_yydebug(VALUE);
463
+ VALUE rb_parser_set_yydebug(VALUE, VALUE);
464
+ VALUE rb_parser_dump_tree(NODE *node, int comment);
465
+ NODE *rb_parser_append_print(VALUE, NODE *);
466
+ NODE *rb_parser_while_loop(VALUE, NODE *, int, int);
467
+
468
+ NODE *rb_parser_compile_cstr(volatile VALUE, const char*, const char*, int, int);
469
+ NODE *rb_parser_compile_string(volatile VALUE, const char*, VALUE, int);
470
+ NODE *rb_parser_compile_file(volatile VALUE, const char*, VALUE, int);
471
+ NODE *rb_parser_compile_string_path(volatile VALUE vparser, VALUE fname, VALUE src, int line);
472
+ NODE *rb_parser_compile_file_path(volatile VALUE vparser, VALUE fname, VALUE input, int line);
473
+
474
+ NODE *rb_compile_cstr(const char*, const char*, int, int);
475
+ NODE *rb_compile_string(const char*, VALUE, int);
476
+ NODE *rb_compile_file(const char*, VALUE, int);
477
+
478
+ NODE *rb_node_newnode(enum node_type,VALUE,VALUE,VALUE);
479
+ NODE *rb_node_newnode_longlife(enum node_type,VALUE,VALUE,VALUE);
480
+ void rb_gc_free_node(VALUE obj);
481
+ size_t rb_node_memsize(VALUE obj);
482
+ VALUE rb_gc_mark_node(NODE *obj);
483
+
484
+ const struct kwtable *rb_reserved_word(const char *, unsigned int);
485
+
486
+ struct rb_args_info {
487
+ NODE *pre_init;
488
+ NODE *post_init;
489
+
490
+ int pre_args_num; /* count of mandatory pre-arguments */
491
+ int post_args_num; /* count of mandatory post-arguments */
492
+
493
+ ID first_post_arg;
494
+
495
+ ID rest_arg;
496
+ ID block_arg;
497
+
498
+ NODE *kw_args;
499
+ NODE *kw_rest_arg;
500
+
501
+ NODE *opt_args;
502
+ };
503
+
504
+ struct parser_params;
505
+ void *rb_parser_malloc(struct parser_params *, size_t);
506
+ void *rb_parser_realloc(struct parser_params *, void *, size_t);
507
+ void *rb_parser_calloc(struct parser_params *, size_t, size_t);
508
+ void rb_parser_free(struct parser_params *, void *);
509
+
510
+ RUBY_SYMBOL_EXPORT_END
511
+
512
+ #if defined(__cplusplus)
513
+ #if 0
514
+ { /* satisfy cc-mode */
515
+ #endif
516
+ } /* extern "C" { */
517
+ #endif
518
+
519
+ #endif /* RUBY_NODE_H */
@@ -0,0 +1,19 @@
1
+ class Proc
2
+ unless self.method_defined?(:name)
3
+ protected
4
+
5
+ def name
6
+ self.inspect
7
+ end
8
+ end
9
+ end
10
+
11
+ [Method, UnboundMethod, Proc].each do |klass|
12
+ klass.include FastMethodSource::MethodExtensions
13
+
14
+ klass.class_eval do
15
+ def comment_and_source
16
+ self.comment + self.source
17
+ end
18
+ end
19
+ end
@@ -0,0 +1,44 @@
1
+ require_relative 'fast_method_source/fast_method_source'
2
+
3
+ module FastMethodSource
4
+ # The VERSION file must be in the root directory of the library.
5
+ VERSION_FILE = File.expand_path('../../VERSION', __FILE__)
6
+
7
+ VERSION = File.exist?(VERSION_FILE) ?
8
+ File.read(VERSION_FILE).chomp : '(could not find VERSION file)'
9
+
10
+ # The root path of Pry Theme source code.
11
+ ROOT = File.expand_path(File.dirname(__FILE__))
12
+
13
+ class Method
14
+ include MethodExtensions
15
+
16
+ def initialize(method)
17
+ @method = method
18
+ end
19
+
20
+ def source_location
21
+ @method.source_location
22
+ end
23
+
24
+ def name
25
+ if @method.respond_to?(:name)
26
+ @method.name
27
+ else
28
+ @method.inspect
29
+ end
30
+ end
31
+ end
32
+
33
+ def self.source_for(method)
34
+ FastMethodSource::Method.new(method).source
35
+ end
36
+
37
+ def self.comment_for(method)
38
+ FastMethodSource::Method.new(method).comment
39
+ end
40
+
41
+ def self.comment_and_source_for(method)
42
+ self.comment_for(method) + self.source_for(method)
43
+ end
44
+ end
metadata ADDED
@@ -0,0 +1,112 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: fast_method_source
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.1.0
5
+ platform: ruby
6
+ authors:
7
+ - Kyrylo Silin
8
+ autorequire:
9
+ bindir: bin
10
+ cert_chain: []
11
+ date: 2015-06-09 00:00:00.000000000 Z
12
+ dependencies:
13
+ - !ruby/object:Gem::Dependency
14
+ name: bundler
15
+ requirement: !ruby/object:Gem::Requirement
16
+ requirements:
17
+ - - "~>"
18
+ - !ruby/object:Gem::Version
19
+ version: '1.9'
20
+ type: :development
21
+ prerelease: false
22
+ version_requirements: !ruby/object:Gem::Requirement
23
+ requirements:
24
+ - - "~>"
25
+ - !ruby/object:Gem::Version
26
+ version: '1.9'
27
+ - !ruby/object:Gem::Dependency
28
+ name: rake
29
+ requirement: !ruby/object:Gem::Requirement
30
+ requirements:
31
+ - - "~>"
32
+ - !ruby/object:Gem::Version
33
+ version: '10.4'
34
+ type: :development
35
+ prerelease: false
36
+ version_requirements: !ruby/object:Gem::Requirement
37
+ requirements:
38
+ - - "~>"
39
+ - !ruby/object:Gem::Version
40
+ version: '10.4'
41
+ - !ruby/object:Gem::Dependency
42
+ name: rake-compiler
43
+ requirement: !ruby/object:Gem::Requirement
44
+ requirements:
45
+ - - "~>"
46
+ - !ruby/object:Gem::Version
47
+ version: '0.9'
48
+ type: :development
49
+ prerelease: false
50
+ version_requirements: !ruby/object:Gem::Requirement
51
+ requirements:
52
+ - - "~>"
53
+ - !ruby/object:Gem::Version
54
+ version: '0.9'
55
+ - !ruby/object:Gem::Dependency
56
+ name: minitest
57
+ requirement: !ruby/object:Gem::Requirement
58
+ requirements:
59
+ - - "~>"
60
+ - !ruby/object:Gem::Version
61
+ version: '5.7'
62
+ type: :development
63
+ prerelease: false
64
+ version_requirements: !ruby/object:Gem::Requirement
65
+ requirements:
66
+ - - "~>"
67
+ - !ruby/object:Gem::Version
68
+ version: '5.7'
69
+ description: Retrieves the source code for a method (and its comment) and does it
70
+ faster than any other existing solution
71
+ email: silin@kyrylo.org
72
+ executables: []
73
+ extensions:
74
+ - ext/fast_method_source/extconf.rb
75
+ extra_rdoc_files: []
76
+ files:
77
+ - CHANGELOG.md
78
+ - LICENCE.txt
79
+ - README.md
80
+ - VERSION
81
+ - ext/fast_method_source/extconf.rb
82
+ - ext/fast_method_source/fast_method_source.c
83
+ - ext/fast_method_source/fast_method_source.h
84
+ - ext/fast_method_source/node.h
85
+ - lib/fast_method_source.rb
86
+ - lib/fast_method_source/core_ext.rb
87
+ homepage: https://github.com/kyrylo/fast_method_source
88
+ licenses:
89
+ - Zlib
90
+ metadata: {}
91
+ post_install_message:
92
+ rdoc_options: []
93
+ require_paths:
94
+ - lib
95
+ required_ruby_version: !ruby/object:Gem::Requirement
96
+ requirements:
97
+ - - ">="
98
+ - !ruby/object:Gem::Version
99
+ version: '0'
100
+ required_rubygems_version: !ruby/object:Gem::Requirement
101
+ requirements:
102
+ - - ">="
103
+ - !ruby/object:Gem::Version
104
+ version: '0'
105
+ requirements: []
106
+ rubyforge_project:
107
+ rubygems_version: 2.4.5
108
+ signing_key:
109
+ specification_version: 4
110
+ summary: Retrieves the source code for a method (and its comment)
111
+ test_files: []
112
+ has_rdoc: