looksee 3.1.1 → 4.0.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (47) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG +9 -0
  3. data/README.markdown +61 -81
  4. data/ext/extconf.rb +3 -7
  5. data/ext/mri/2.3.0/internal.h +1404 -0
  6. data/ext/mri/2.3.0/method.h +213 -0
  7. data/ext/mri/mri.c +21 -264
  8. data/ext/rbx/rbx.c +0 -9
  9. data/lib/looksee/JRuby.jar +0 -0
  10. data/lib/looksee/adapter/base.rb +19 -54
  11. data/lib/looksee/adapter/rubinius.rb +3 -62
  12. data/lib/looksee/clean.rb +5 -1
  13. data/lib/looksee/editor.rb +1 -1
  14. data/lib/looksee/help.rb +3 -2
  15. data/lib/looksee/lookup_path.rb +7 -3
  16. data/lib/looksee/version.rb +1 -1
  17. data/spec/looksee/adapter_spec.rb +72 -365
  18. data/spec/looksee/editor_spec.rb +1 -1
  19. data/spec/looksee/inspector_spec.rb +21 -21
  20. data/spec/looksee/lookup_path_spec.rb +34 -21
  21. data/spec/spec_helper.rb +2 -0
  22. data/spec/support/temporary_classes.rb +10 -14
  23. data/spec/support/test_adapter.rb +2 -53
  24. metadata +6 -29
  25. data/ext/mri/1.9.2/debug.h +0 -36
  26. data/ext/mri/1.9.2/id.h +0 -170
  27. data/ext/mri/1.9.2/method.h +0 -103
  28. data/ext/mri/1.9.2/node.h +0 -483
  29. data/ext/mri/1.9.2/thread_pthread.h +0 -27
  30. data/ext/mri/1.9.2/vm_core.h +0 -707
  31. data/ext/mri/1.9.2/vm_opts.h +0 -51
  32. data/ext/mri/1.9.3/atomic.h +0 -56
  33. data/ext/mri/1.9.3/debug.h +0 -41
  34. data/ext/mri/1.9.3/id.h +0 -175
  35. data/ext/mri/1.9.3/internal.h +0 -227
  36. data/ext/mri/1.9.3/internal_falcon.h +0 -248
  37. data/ext/mri/1.9.3/method.h +0 -105
  38. data/ext/mri/1.9.3/node.h +0 -503
  39. data/ext/mri/1.9.3/thread_pthread.h +0 -51
  40. data/ext/mri/1.9.3/vm_core.h +0 -755
  41. data/ext/mri/1.9.3/vm_opts.h +0 -51
  42. data/ext/mri/2.0.0/internal.h +0 -378
  43. data/ext/mri/2.0.0/method.h +0 -138
  44. data/ext/mri/env-1.8.h +0 -27
  45. data/ext/mri/eval_c-1.8.h +0 -27
  46. data/ext/mri/node-1.9.h +0 -35
  47. data/lib/looksee/mri.bundle +0 -0
@@ -1,170 +0,0 @@
1
- /* DO NOT EDIT THIS FILE DIRECTLY */
2
- /**********************************************************************
3
-
4
- id.h -
5
-
6
- $Author: akr $
7
- created at: Sun Oct 19 21:12:51 2008
8
-
9
- Copyright (C) 2007 Koichi Sasada
10
-
11
- **********************************************************************/
12
-
13
- #ifndef RUBY_ID_H
14
- #define RUBY_ID_H
15
-
16
- #define ID_SCOPE_SHIFT 3
17
- #define ID_SCOPE_MASK 0x07
18
- #define ID_LOCAL 0x00
19
- #define ID_INSTANCE 0x01
20
- #define ID_GLOBAL 0x03
21
- #define ID_ATTRSET 0x04
22
- #define ID_CONST 0x05
23
- #define ID_CLASS 0x06
24
- #define ID_JUNK 0x07
25
- #define ID_INTERNAL ID_JUNK
26
-
27
- #ifdef USE_PARSE_H
28
- #include "parse.h"
29
- #endif
30
-
31
- #define symIFUNC ID2SYM(idIFUNC)
32
- #define symCFUNC ID2SYM(idCFUNC)
33
-
34
- #if !defined tLAST_TOKEN && defined YYTOKENTYPE
35
- #define tLAST_TOKEN tLAST_TOKEN
36
- #endif
37
-
38
- enum ruby_method_ids {
39
- #ifndef tLAST_TOKEN
40
- tUPLUS = 321,
41
- tUMINUS = 322,
42
- tPOW = 323,
43
- tCMP = 324,
44
- tEQ = 325,
45
- tEQQ = 326,
46
- tNEQ = 327,
47
- tGEQ = 328,
48
- tLEQ = 329,
49
- tANDOP = 330,
50
- tOROP = 331,
51
- tMATCH = 332,
52
- tNMATCH = 333,
53
- tDOT2 = 334,
54
- tDOT3 = 335,
55
- tAREF = 336,
56
- tASET = 337,
57
- tLSHFT = 338,
58
- tRSHFT = 339,
59
- tLAMBDA = 352,
60
- idNULL = 365,
61
- idRespond_to = 366,
62
- idIFUNC = 367,
63
- idCFUNC = 368,
64
- id_core_set_method_alias = 369,
65
- id_core_set_variable_alias = 370,
66
- id_core_undef_method = 371,
67
- id_core_define_method = 372,
68
- id_core_define_singleton_method = 373,
69
- id_core_set_postexe = 374,
70
- tLAST_TOKEN = 375,
71
- #endif
72
- idDot2 = tDOT2,
73
- idDot3 = tDOT3,
74
- idUPlus = tUPLUS,
75
- idUMinus = tUMINUS,
76
- idPow = tPOW,
77
- idCmp = tCMP,
78
- idPLUS = '+',
79
- idMINUS = '-',
80
- idMULT = '*',
81
- idDIV = '/',
82
- idMOD = '%',
83
- idLT = '<',
84
- idLTLT = tLSHFT,
85
- idLE = tLEQ,
86
- idGT = '>',
87
- idGE = tGEQ,
88
- idEq = tEQ,
89
- idEqq = tEQQ,
90
- idNeq = tNEQ,
91
- idNot = '!',
92
- idBackquote = '`',
93
- idEqTilde = tMATCH,
94
- idNeqTilde = tNMATCH,
95
- idAREF = tAREF,
96
- idASET = tASET,
97
- idLAST_TOKEN = tLAST_TOKEN >> ID_SCOPE_SHIFT,
98
- tIntern,
99
- tMethodMissing,
100
- tLength,
101
- tSize,
102
- tGets,
103
- tSucc,
104
- tEach,
105
- tLambda,
106
- tSend,
107
- t__send__,
108
- tInitialize,
109
- #if SUPPORT_JOKE
110
- tBitblt,
111
- tAnswer,
112
- #endif
113
- tLAST_ID,
114
- #define TOKEN2ID(n) id##n = ((t##n<<ID_SCOPE_SHIFT)|ID_LOCAL)
115
- #if SUPPORT_JOKE
116
- TOKEN2ID(Bitblt),
117
- TOKEN2ID(Answer),
118
- #endif
119
- TOKEN2ID(Intern),
120
- TOKEN2ID(MethodMissing),
121
- TOKEN2ID(Length),
122
- TOKEN2ID(Size),
123
- TOKEN2ID(Gets),
124
- TOKEN2ID(Succ),
125
- TOKEN2ID(Each),
126
- TOKEN2ID(Lambda),
127
- TOKEN2ID(Send),
128
- TOKEN2ID(__send__),
129
- TOKEN2ID(Initialize)
130
- };
131
-
132
- #ifdef tLAST_TOKEN
133
- struct ruby_method_ids_check {
134
- #define ruby_method_id_check_for(name, value) \
135
- int checking_for_##name[name == value ? 1 : -1]
136
- ruby_method_id_check_for(tUPLUS, 321);
137
- ruby_method_id_check_for(tUMINUS, 322);
138
- ruby_method_id_check_for(tPOW, 323);
139
- ruby_method_id_check_for(tCMP, 324);
140
- ruby_method_id_check_for(tEQ, 325);
141
- ruby_method_id_check_for(tEQQ, 326);
142
- ruby_method_id_check_for(tNEQ, 327);
143
- ruby_method_id_check_for(tGEQ, 328);
144
- ruby_method_id_check_for(tLEQ, 329);
145
- ruby_method_id_check_for(tANDOP, 330);
146
- ruby_method_id_check_for(tOROP, 331);
147
- ruby_method_id_check_for(tMATCH, 332);
148
- ruby_method_id_check_for(tNMATCH, 333);
149
- ruby_method_id_check_for(tDOT2, 334);
150
- ruby_method_id_check_for(tDOT3, 335);
151
- ruby_method_id_check_for(tAREF, 336);
152
- ruby_method_id_check_for(tASET, 337);
153
- ruby_method_id_check_for(tLSHFT, 338);
154
- ruby_method_id_check_for(tRSHFT, 339);
155
- ruby_method_id_check_for(tLAMBDA, 352);
156
- ruby_method_id_check_for(idNULL, 365);
157
- ruby_method_id_check_for(idRespond_to, 366);
158
- ruby_method_id_check_for(idIFUNC, 367);
159
- ruby_method_id_check_for(idCFUNC, 368);
160
- ruby_method_id_check_for(id_core_set_method_alias, 369);
161
- ruby_method_id_check_for(id_core_set_variable_alias, 370);
162
- ruby_method_id_check_for(id_core_undef_method, 371);
163
- ruby_method_id_check_for(id_core_define_method, 372);
164
- ruby_method_id_check_for(id_core_define_singleton_method, 373);
165
- ruby_method_id_check_for(id_core_set_postexe, 374);
166
- ruby_method_id_check_for(tLAST_TOKEN, 375);
167
- };
168
- #endif
169
-
170
- #endif /* RUBY_ID_H */
@@ -1,103 +0,0 @@
1
- /**********************************************************************
2
-
3
- method.h -
4
-
5
- $Author: ko1 $
6
- created at: Wed Jul 15 20:02:33 2009
7
-
8
- Copyright (C) 2009 Koichi Sasada
9
-
10
- **********************************************************************/
11
- #ifndef METHOD_H
12
- #define METHOD_H
13
-
14
- typedef enum {
15
- NOEX_PUBLIC = 0x00,
16
- NOEX_NOSUPER = 0x01,
17
- NOEX_PRIVATE = 0x02,
18
- NOEX_PROTECTED = 0x04,
19
- NOEX_MASK = 0x06,
20
- NOEX_BASIC = 0x08,
21
- NOEX_UNDEF = NOEX_NOSUPER,
22
- NOEX_MODFUNC = 0x12,
23
- NOEX_SUPER = 0x20,
24
- NOEX_VCALL = 0x40,
25
- NOEX_RESPONDS = 0x80
26
- } rb_method_flag_t;
27
-
28
- #define NOEX_SAFE(n) ((int)((n) >> 8) & 0x0F)
29
- #define NOEX_WITH(n, s) ((s << 8) | (n) | (ruby_running ? 0 : NOEX_BASIC))
30
- #define NOEX_WITH_SAFE(n) NOEX_WITH(n, rb_safe_level())
31
-
32
- /* method data type */
33
-
34
- typedef enum {
35
- VM_METHOD_TYPE_ISEQ,
36
- VM_METHOD_TYPE_CFUNC,
37
- VM_METHOD_TYPE_ATTRSET,
38
- VM_METHOD_TYPE_IVAR,
39
- VM_METHOD_TYPE_BMETHOD,
40
- VM_METHOD_TYPE_ZSUPER,
41
- VM_METHOD_TYPE_UNDEF,
42
- VM_METHOD_TYPE_NOTIMPLEMENTED,
43
- VM_METHOD_TYPE_OPTIMIZED, /* Kernel#send, Proc#call, etc */
44
- VM_METHOD_TYPE_MISSING /* wrapper for method_missing(id) */
45
- } rb_method_type_t;
46
-
47
- typedef struct rb_method_cfunc_struct {
48
- VALUE (*func)(ANYARGS);
49
- int argc;
50
- } rb_method_cfunc_t;
51
-
52
- typedef struct rb_method_attr_struct {
53
- ID id;
54
- VALUE location;
55
- } rb_method_attr_t;
56
-
57
- typedef struct rb_iseq_struct rb_iseq_t;
58
-
59
- typedef struct rb_method_definition_struct {
60
- rb_method_type_t type; /* method type */
61
- ID original_id;
62
- union {
63
- rb_iseq_t *iseq; /* should be mark */
64
- rb_method_cfunc_t cfunc;
65
- rb_method_attr_t attr;
66
- VALUE proc; /* should be mark */
67
- enum method_optimized_type {
68
- OPTIMIZED_METHOD_TYPE_SEND,
69
- OPTIMIZED_METHOD_TYPE_CALL
70
- } optimize_type;
71
- } body;
72
- int alias_count;
73
- } rb_method_definition_t;
74
-
75
- typedef struct rb_method_entry_struct {
76
- rb_method_flag_t flag;
77
- char mark;
78
- rb_method_definition_t *def;
79
- ID called_id;
80
- VALUE klass; /* should be mark */
81
- } rb_method_entry_t;
82
-
83
- struct unlinked_method_entry_list_entry {
84
- struct unlinked_method_entry_list_entry *next;
85
- rb_method_entry_t *me;
86
- };
87
-
88
- #define UNDEFINED_METHOD_ENTRY_P(me) (!(me) || !(me)->def || (me)->def->type == VM_METHOD_TYPE_UNDEF)
89
-
90
- void rb_add_method_cfunc(VALUE klass, ID mid, VALUE (*func)(ANYARGS), int argc, rb_method_flag_t noex);
91
- rb_method_entry_t *rb_add_method(VALUE klass, ID mid, rb_method_type_t type, void *option, rb_method_flag_t noex);
92
- rb_method_entry_t *rb_method_entry(VALUE klass, ID id);
93
-
94
- rb_method_entry_t *rb_method_entry_get_without_cache(VALUE klass, ID id);
95
- rb_method_entry_t *rb_method_entry_set(VALUE klass, ID mid, const rb_method_entry_t *, rb_method_flag_t noex);
96
-
97
- int rb_method_entry_arity(const rb_method_entry_t *me);
98
-
99
- void rb_mark_method_entry(const rb_method_entry_t *me);
100
- void rb_free_method_entry(rb_method_entry_t *me);
101
- void rb_sweep_method_entry(void *vm);
102
-
103
- #endif /* METHOD_H */
@@ -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 */