free 0.1.0-i386-mingw32 → 0.1.2-i386-mingw32
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/HISTORY +2 -0
- data/README.md +2 -2
- data/ext/free/extconf.rb +1 -0
- data/ext/free/free.c +1 -1
- data/ext/free/ruby_headers/debug.h +36 -0
- data/ext/free/ruby_headers/dln.h +41 -0
- data/ext/free/ruby_headers/eval_intern.h +232 -0
- data/ext/free/ruby_headers/gc.h +77 -0
- data/ext/free/ruby_headers/id.h +173 -0
- data/ext/free/ruby_headers/iseq.h +104 -0
- data/ext/free/ruby_headers/method.h +103 -0
- data/ext/free/ruby_headers/node.h +483 -0
- data/ext/free/ruby_headers/regenc.h +211 -0
- data/ext/free/ruby_headers/regint.h +841 -0
- data/ext/free/ruby_headers/regparse.h +354 -0
- data/ext/free/ruby_headers/thread_pthread.h +27 -0
- data/ext/free/ruby_headers/thread_win32.h +33 -0
- data/ext/free/ruby_headers/timev.h +21 -0
- data/ext/free/ruby_headers/transcode_data.h +109 -0
- data/ext/free/ruby_headers/version.h +63 -0
- data/ext/free/ruby_headers/vm_core.h +703 -0
- data/ext/free/ruby_headers/vm_exec.h +184 -0
- data/ext/free/ruby_headers/vm_insnhelper.h +208 -0
- data/ext/free/ruby_headers/vm_opts.h +51 -0
- data/lib/1.8/free.so +0 -0
- data/lib/1.9/free.so +0 -0
- data/lib/free/version.rb +1 -1
- metadata +26 -3
data/HISTORY
CHANGED
data/README.md
CHANGED
@@ -1,4 +1,4 @@
|
|
1
|
-
|
1
|
+
free
|
2
2
|
=====
|
3
3
|
|
4
4
|
(C) John Mair (banisterfiend) 2010
|
@@ -9,7 +9,7 @@ free provides the `Object#free` method enabling a user to garbage
|
|
9
9
|
collect an object on demand and free all its internal structures.
|
10
10
|
|
11
11
|
* Install the [gem](https://rubygems.org/gems/free)
|
12
|
-
* Read the [documentation](http://rdoc.info/github/
|
12
|
+
* Read the [documentation](http://rdoc.info/github/banister/free/master/file/README.markdown)
|
13
13
|
* See the [source code](http://github.com/banister/free)
|
14
14
|
|
15
15
|
Example:
|
data/ext/free/extconf.rb
CHANGED
data/ext/free/free.c
CHANGED
@@ -0,0 +1,36 @@
|
|
1
|
+
/**********************************************************************
|
2
|
+
|
3
|
+
debug.h - YARV Debug function interface
|
4
|
+
|
5
|
+
$Author$
|
6
|
+
created at: 04/08/25 02:33:49 JST
|
7
|
+
|
8
|
+
Copyright (C) 2004-2007 Koichi Sasada
|
9
|
+
|
10
|
+
**********************************************************************/
|
11
|
+
|
12
|
+
#ifndef RUBY_DEBUG_H
|
13
|
+
#define RUBY_DEBUG_H
|
14
|
+
|
15
|
+
#include "ruby/ruby.h"
|
16
|
+
#include "node.h"
|
17
|
+
|
18
|
+
#define dpv(h,v) ruby_debug_print_value(-1, 0, h, v)
|
19
|
+
#define dp(v) ruby_debug_print_value(-1, 0, "", v)
|
20
|
+
#define dpi(i) ruby_debug_print_id(-1, 0, "", i)
|
21
|
+
#define dpn(n) ruby_debug_print_node(-1, 0, "", n)
|
22
|
+
|
23
|
+
#define bp() ruby_debug_breakpoint()
|
24
|
+
|
25
|
+
VALUE ruby_debug_print_value(int level, int debug_level, const char *header, VALUE v);
|
26
|
+
ID ruby_debug_print_id(int level, int debug_level, const char *header, ID id);
|
27
|
+
NODE *ruby_debug_print_node(int level, int debug_level, const char *header, const NODE *node);
|
28
|
+
int ruby_debug_print_indent(int level, int debug_level, int indent_level);
|
29
|
+
void ruby_debug_breakpoint(void);
|
30
|
+
void ruby_debug_gc_check_func(void);
|
31
|
+
|
32
|
+
#ifdef RUBY_DEBUG_ENV
|
33
|
+
void ruby_set_debug_option(const char *str);
|
34
|
+
#endif
|
35
|
+
|
36
|
+
#endif /* RUBY_DEBUG_H */
|
@@ -0,0 +1,41 @@
|
|
1
|
+
/**********************************************************************
|
2
|
+
|
3
|
+
dln.h -
|
4
|
+
|
5
|
+
$Author$
|
6
|
+
created at: Wed Jan 19 16:53:09 JST 1994
|
7
|
+
|
8
|
+
Copyright (C) 1993-2007 Yukihiro Matsumoto
|
9
|
+
|
10
|
+
**********************************************************************/
|
11
|
+
|
12
|
+
#ifndef DLN_H
|
13
|
+
#define DLN_H
|
14
|
+
|
15
|
+
#ifdef __cplusplus
|
16
|
+
# ifndef HAVE_PROTOTYPES
|
17
|
+
# define HAVE_PROTOTYPES 1
|
18
|
+
# endif
|
19
|
+
# ifndef HAVE_STDARG_PROTOTYPES
|
20
|
+
# define HAVE_STDARG_PROTOTYPES 1
|
21
|
+
# endif
|
22
|
+
#endif
|
23
|
+
|
24
|
+
#undef _
|
25
|
+
#ifdef HAVE_PROTOTYPES
|
26
|
+
# define _(args) args
|
27
|
+
#else
|
28
|
+
# define _(args) ()
|
29
|
+
#endif
|
30
|
+
|
31
|
+
DEPRECATED(char *dln_find_exe(const char*,const char*));
|
32
|
+
DEPRECATED(char *dln_find_file(const char*,const char*));
|
33
|
+
char *dln_find_exe_r(const char*,const char*,char*,size_t);
|
34
|
+
char *dln_find_file_r(const char*,const char*,char*,size_t);
|
35
|
+
|
36
|
+
#ifdef USE_DLN_A_OUT
|
37
|
+
extern char *dln_argv0;
|
38
|
+
#endif
|
39
|
+
|
40
|
+
void *dln_load(const char*);
|
41
|
+
#endif
|
@@ -0,0 +1,232 @@
|
|
1
|
+
#ifndef RUBY_EVAL_INTERN_H
|
2
|
+
#define RUBY_EVAL_INTERN_H
|
3
|
+
|
4
|
+
#include "ruby/ruby.h"
|
5
|
+
#include "vm_core.h"
|
6
|
+
|
7
|
+
#define PASS_PASSED_BLOCK_TH(th) do { \
|
8
|
+
(th)->passed_block = GC_GUARDED_PTR_REF((rb_block_t *)(th)->cfp->lfp[0]); \
|
9
|
+
(th)->cfp->flag |= VM_FRAME_FLAG_PASSED; \
|
10
|
+
} while (0)
|
11
|
+
|
12
|
+
#define PASS_PASSED_BLOCK() do { \
|
13
|
+
rb_thread_t * const __th__ = GET_THREAD(); \
|
14
|
+
PASS_PASSED_BLOCK_TH(__th__); \
|
15
|
+
} while (0)
|
16
|
+
|
17
|
+
#ifdef HAVE_STDLIB_H
|
18
|
+
#include <stdlib.h>
|
19
|
+
#endif
|
20
|
+
#ifndef EXIT_SUCCESS
|
21
|
+
#define EXIT_SUCCESS 0
|
22
|
+
#endif
|
23
|
+
#ifndef EXIT_FAILURE
|
24
|
+
#define EXIT_FAILURE 1
|
25
|
+
#endif
|
26
|
+
|
27
|
+
#include <stdio.h>
|
28
|
+
#include <setjmp.h>
|
29
|
+
|
30
|
+
#ifdef __APPLE__
|
31
|
+
#include <crt_externs.h>
|
32
|
+
#endif
|
33
|
+
|
34
|
+
/* Make alloca work the best possible way. */
|
35
|
+
#ifdef __GNUC__
|
36
|
+
# ifndef atarist
|
37
|
+
# ifndef alloca
|
38
|
+
# define alloca __builtin_alloca
|
39
|
+
# endif
|
40
|
+
# endif /* atarist */
|
41
|
+
#else
|
42
|
+
# ifdef HAVE_ALLOCA_H
|
43
|
+
# include <alloca.h>
|
44
|
+
# else
|
45
|
+
# ifdef _AIX
|
46
|
+
#pragma alloca
|
47
|
+
# else
|
48
|
+
# ifndef alloca /* predefined by HP cc +Olibcalls */
|
49
|
+
void *alloca();
|
50
|
+
# endif
|
51
|
+
# endif /* AIX */
|
52
|
+
# endif /* HAVE_ALLOCA_H */
|
53
|
+
#endif /* __GNUC__ */
|
54
|
+
|
55
|
+
#ifndef HAVE_STRING_H
|
56
|
+
char *strrchr(const char *, const char);
|
57
|
+
#endif
|
58
|
+
|
59
|
+
#ifdef HAVE_UNISTD_H
|
60
|
+
#include <unistd.h>
|
61
|
+
#endif
|
62
|
+
|
63
|
+
#ifdef HAVE_NET_SOCKET_H
|
64
|
+
#include <net/socket.h>
|
65
|
+
#endif
|
66
|
+
|
67
|
+
#define ruby_setjmp(env) RUBY_SETJMP(env)
|
68
|
+
#define ruby_longjmp(env,val) RUBY_LONGJMP(env,val)
|
69
|
+
#ifdef __CYGWIN__
|
70
|
+
# ifndef _setjmp
|
71
|
+
int _setjmp(jmp_buf);
|
72
|
+
# endif
|
73
|
+
# ifndef _longjmp
|
74
|
+
NORETURN(void _longjmp(jmp_buf, int));
|
75
|
+
# endif
|
76
|
+
#endif
|
77
|
+
|
78
|
+
#include <sys/types.h>
|
79
|
+
#include <signal.h>
|
80
|
+
#include <errno.h>
|
81
|
+
|
82
|
+
#ifdef HAVE_SYS_SELECT_H
|
83
|
+
#include <sys/select.h>
|
84
|
+
#endif
|
85
|
+
|
86
|
+
/*
|
87
|
+
Solaris sys/select.h switches select to select_large_fdset to support larger
|
88
|
+
file descriptors if FD_SETSIZE is larger than 1024 on 32bit environment.
|
89
|
+
But Ruby doesn't change FD_SETSIZE because fd_set is allocated dynamically.
|
90
|
+
So following definition is required to use select_large_fdset.
|
91
|
+
*/
|
92
|
+
#ifdef HAVE_SELECT_LARGE_FDSET
|
93
|
+
#define select(n, r, w, e, t) select_large_fdset(n, r, w, e, t)
|
94
|
+
#endif
|
95
|
+
|
96
|
+
#ifdef HAVE_SYS_PARAM_H
|
97
|
+
#include <sys/param.h>
|
98
|
+
#endif
|
99
|
+
|
100
|
+
#include <sys/stat.h>
|
101
|
+
|
102
|
+
#define SAVE_ROOT_JMPBUF(th, stmt) do \
|
103
|
+
if (ruby_setjmp((th)->root_jmpbuf) == 0) { \
|
104
|
+
stmt; \
|
105
|
+
} \
|
106
|
+
else { \
|
107
|
+
rb_fiber_start(); \
|
108
|
+
} while (0)
|
109
|
+
|
110
|
+
#define TH_PUSH_TAG(th) do { \
|
111
|
+
rb_thread_t * const _th = th; \
|
112
|
+
struct rb_vm_tag _tag; \
|
113
|
+
_tag.tag = 0; \
|
114
|
+
_tag.prev = _th->tag; \
|
115
|
+
_th->tag = &_tag;
|
116
|
+
|
117
|
+
#define TH_POP_TAG() \
|
118
|
+
_th->tag = _tag.prev; \
|
119
|
+
} while (0)
|
120
|
+
|
121
|
+
#define TH_POP_TAG2() \
|
122
|
+
_th->tag = _tag.prev
|
123
|
+
|
124
|
+
#define PUSH_TAG() TH_PUSH_TAG(GET_THREAD())
|
125
|
+
#define POP_TAG() TH_POP_TAG()
|
126
|
+
|
127
|
+
#define TH_EXEC_TAG() ruby_setjmp(_th->tag->buf)
|
128
|
+
|
129
|
+
#define EXEC_TAG() \
|
130
|
+
TH_EXEC_TAG()
|
131
|
+
|
132
|
+
#define TH_JUMP_TAG(th, st) do { \
|
133
|
+
ruby_longjmp(th->tag->buf,(st)); \
|
134
|
+
} while (0)
|
135
|
+
|
136
|
+
#define JUMP_TAG(st) TH_JUMP_TAG(GET_THREAD(), st)
|
137
|
+
|
138
|
+
enum ruby_tag_type {
|
139
|
+
RUBY_TAG_RETURN = 0x1,
|
140
|
+
RUBY_TAG_BREAK = 0x2,
|
141
|
+
RUBY_TAG_NEXT = 0x3,
|
142
|
+
RUBY_TAG_RETRY = 0x4,
|
143
|
+
RUBY_TAG_REDO = 0x5,
|
144
|
+
RUBY_TAG_RAISE = 0x6,
|
145
|
+
RUBY_TAG_THROW = 0x7,
|
146
|
+
RUBY_TAG_FATAL = 0x8,
|
147
|
+
RUBY_TAG_MASK = 0xf
|
148
|
+
};
|
149
|
+
#define TAG_RETURN RUBY_TAG_RETURN
|
150
|
+
#define TAG_BREAK RUBY_TAG_BREAK
|
151
|
+
#define TAG_NEXT RUBY_TAG_NEXT
|
152
|
+
#define TAG_RETRY RUBY_TAG_RETRY
|
153
|
+
#define TAG_REDO RUBY_TAG_REDO
|
154
|
+
#define TAG_RAISE RUBY_TAG_RAISE
|
155
|
+
#define TAG_THROW RUBY_TAG_THROW
|
156
|
+
#define TAG_FATAL RUBY_TAG_FATAL
|
157
|
+
#define TAG_MASK RUBY_TAG_MASK
|
158
|
+
|
159
|
+
#define NEW_THROW_OBJECT(val, pt, st) \
|
160
|
+
((VALUE)rb_node_newnode(NODE_LIT, (VALUE)(val), (VALUE)(pt), (VALUE)(st)))
|
161
|
+
#define SET_THROWOBJ_CATCH_POINT(obj, val) \
|
162
|
+
(RNODE((obj))->u2.value = (val))
|
163
|
+
#define SET_THROWOBJ_STATE(obj, val) \
|
164
|
+
(RNODE((obj))->u3.value = (val))
|
165
|
+
|
166
|
+
#define GET_THROWOBJ_VAL(obj) ((VALUE)RNODE((obj))->u1.value)
|
167
|
+
#define GET_THROWOBJ_CATCH_POINT(obj) ((VALUE*)RNODE((obj))->u2.value)
|
168
|
+
#define GET_THROWOBJ_STATE(obj) ((int)RNODE((obj))->u3.value)
|
169
|
+
|
170
|
+
#define SCOPE_TEST(f) (rb_vm_cref()->nd_visi & (f))
|
171
|
+
#define SCOPE_CHECK(f) (rb_vm_cref()->nd_visi == (f))
|
172
|
+
#define SCOPE_SET(f) (rb_vm_cref()->nd_visi = (f))
|
173
|
+
|
174
|
+
#define CHECK_STACK_OVERFLOW(cfp, margin) do \
|
175
|
+
if (((VALUE *)(cfp)->sp) + (margin) + sizeof(rb_control_frame_t) >= ((VALUE *)cfp)) { \
|
176
|
+
rb_exc_raise(sysstack_error); \
|
177
|
+
} \
|
178
|
+
while (0)
|
179
|
+
|
180
|
+
void rb_thread_cleanup(void);
|
181
|
+
void rb_thread_wait_other_threads(void);
|
182
|
+
|
183
|
+
enum {
|
184
|
+
RAISED_EXCEPTION = 1,
|
185
|
+
RAISED_STACKOVERFLOW = 2,
|
186
|
+
RAISED_NOMEMORY = 4
|
187
|
+
};
|
188
|
+
int rb_threadptr_set_raised(rb_thread_t *th);
|
189
|
+
int rb_threadptr_reset_raised(rb_thread_t *th);
|
190
|
+
#define rb_thread_raised_set(th, f) ((th)->raised_flag |= (f))
|
191
|
+
#define rb_thread_raised_reset(th, f) ((th)->raised_flag &= ~(f))
|
192
|
+
#define rb_thread_raised_p(th, f) (((th)->raised_flag & (f)) != 0)
|
193
|
+
#define rb_thread_raised_clear(th) ((th)->raised_flag = 0)
|
194
|
+
|
195
|
+
VALUE rb_f_eval(int argc, VALUE *argv, VALUE self);
|
196
|
+
VALUE rb_make_exception(int argc, VALUE *argv);
|
197
|
+
|
198
|
+
NORETURN(void rb_fiber_start(void));
|
199
|
+
|
200
|
+
NORETURN(void rb_print_undef(VALUE, ID, int));
|
201
|
+
NORETURN(void rb_vm_localjump_error(const char *,VALUE, int));
|
202
|
+
NORETURN(void rb_vm_jump_tag_but_local_jump(int, VALUE));
|
203
|
+
NORETURN(void rb_raise_method_missing(rb_thread_t *th, int argc, VALUE *argv,
|
204
|
+
VALUE obj, int call_status));
|
205
|
+
|
206
|
+
VALUE rb_vm_make_jump_tag_but_local_jump(int state, VALUE val);
|
207
|
+
NODE *rb_vm_cref(void);
|
208
|
+
VALUE rb_vm_call_cfunc(VALUE recv, VALUE (*func)(VALUE), VALUE arg, const rb_block_t *blockptr, VALUE filename, VALUE filepath);
|
209
|
+
void rb_vm_set_progname(VALUE filename);
|
210
|
+
void rb_thread_terminate_all(void);
|
211
|
+
VALUE rb_vm_top_self();
|
212
|
+
VALUE rb_vm_cbase(void);
|
213
|
+
int rb_vm_get_sourceline(const rb_control_frame_t *);
|
214
|
+
void rb_trap_restore_mask(void);
|
215
|
+
|
216
|
+
#ifndef CharNext /* defined as CharNext[AW] on Windows. */
|
217
|
+
#define CharNext(p) ((p) + mblen(p, RUBY_MBCHAR_MAXSIZE))
|
218
|
+
#endif
|
219
|
+
|
220
|
+
#if defined DOSISH || defined __CYGWIN__
|
221
|
+
static inline void
|
222
|
+
translit_char(char *p, int from, int to)
|
223
|
+
{
|
224
|
+
while (*p) {
|
225
|
+
if ((unsigned char)*p == from)
|
226
|
+
*p = to;
|
227
|
+
p = CharNext(p);
|
228
|
+
}
|
229
|
+
}
|
230
|
+
#endif
|
231
|
+
|
232
|
+
#endif /* RUBY_EVAL_INTERN_H */
|
@@ -0,0 +1,77 @@
|
|
1
|
+
|
2
|
+
#ifndef RUBY_GC_H
|
3
|
+
#define RUBY_GC_H 1
|
4
|
+
|
5
|
+
#if defined(__x86_64__) && defined(__GNUC__)
|
6
|
+
#define SET_MACHINE_STACK_END(p) __asm__("movq\t%%rsp, %0" : "=r" (*p))
|
7
|
+
#elif defined(__i386) && defined(__GNUC__)
|
8
|
+
#define SET_MACHINE_STACK_END(p) __asm__("movl\t%%esp, %0" : "=r" (*p))
|
9
|
+
#else
|
10
|
+
NOINLINE(void rb_gc_set_stack_end(VALUE **stack_end_p));
|
11
|
+
#define SET_MACHINE_STACK_END(p) rb_gc_set_stack_end(p)
|
12
|
+
#define USE_CONSERVATIVE_STACK_END
|
13
|
+
#endif
|
14
|
+
|
15
|
+
/* for GC debug */
|
16
|
+
|
17
|
+
#ifndef RUBY_MARK_FREE_DEBUG
|
18
|
+
#define RUBY_MARK_FREE_DEBUG 0
|
19
|
+
#endif
|
20
|
+
|
21
|
+
#if RUBY_MARK_FREE_DEBUG
|
22
|
+
extern int ruby_gc_debug_indent;
|
23
|
+
|
24
|
+
static void
|
25
|
+
rb_gc_debug_indent(void)
|
26
|
+
{
|
27
|
+
printf("%*s", ruby_gc_debug_indent, "");
|
28
|
+
}
|
29
|
+
|
30
|
+
static void
|
31
|
+
rb_gc_debug_body(const char *mode, const char *msg, int st, void *ptr)
|
32
|
+
{
|
33
|
+
if (st == 0) {
|
34
|
+
ruby_gc_debug_indent--;
|
35
|
+
}
|
36
|
+
rb_gc_debug_indent();
|
37
|
+
printf("%s: %s %s (%p)\n", mode, st ? "->" : "<-", msg, ptr);
|
38
|
+
|
39
|
+
if (st) {
|
40
|
+
ruby_gc_debug_indent++;
|
41
|
+
}
|
42
|
+
|
43
|
+
fflush(stdout);
|
44
|
+
}
|
45
|
+
|
46
|
+
#define RUBY_MARK_ENTER(msg) rb_gc_debug_body("mark", msg, 1, ptr)
|
47
|
+
#define RUBY_MARK_LEAVE(msg) rb_gc_debug_body("mark", msg, 0, ptr)
|
48
|
+
#define RUBY_FREE_ENTER(msg) rb_gc_debug_body("free", msg, 1, ptr)
|
49
|
+
#define RUBY_FREE_LEAVE(msg) rb_gc_debug_body("free", msg, 0, ptr)
|
50
|
+
#define RUBY_GC_INFO rb_gc_debug_indent(); printf
|
51
|
+
|
52
|
+
#else
|
53
|
+
#define RUBY_MARK_ENTER(msg)
|
54
|
+
#define RUBY_MARK_LEAVE(msg)
|
55
|
+
#define RUBY_FREE_ENTER(msg)
|
56
|
+
#define RUBY_FREE_LEAVE(msg)
|
57
|
+
#define RUBY_GC_INFO if(0)printf
|
58
|
+
#endif
|
59
|
+
|
60
|
+
#define RUBY_MARK_UNLESS_NULL(ptr) if(RTEST(ptr)){rb_gc_mark(ptr);}
|
61
|
+
#define RUBY_FREE_UNLESS_NULL(ptr) if(ptr){ruby_xfree(ptr);}
|
62
|
+
|
63
|
+
#if STACK_GROW_DIRECTION > 0
|
64
|
+
# define STACK_UPPER(x, a, b) a
|
65
|
+
#elif STACK_GROW_DIRECTION < 0
|
66
|
+
# define STACK_UPPER(x, a, b) b
|
67
|
+
#else
|
68
|
+
RUBY_EXTERN int ruby_stack_grow_direction;
|
69
|
+
int ruby_get_stack_grow_direction(volatile VALUE *addr);
|
70
|
+
# define stack_growup_p(x) ( \
|
71
|
+
(ruby_stack_grow_direction ? \
|
72
|
+
ruby_stack_grow_direction : \
|
73
|
+
ruby_get_stack_grow_direction(x)) > 0)
|
74
|
+
# define STACK_UPPER(x, a, b) (stack_growup_p(x) ? a : b)
|
75
|
+
#endif
|
76
|
+
|
77
|
+
#endif /* RUBY_GC_H */
|
@@ -0,0 +1,173 @@
|
|
1
|
+
/* DO NOT EDIT THIS FILE DIRECTLY */
|
2
|
+
/**********************************************************************
|
3
|
+
|
4
|
+
id.h -
|
5
|
+
|
6
|
+
$Author$
|
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
|
+
tUScore,
|
110
|
+
#if SUPPORT_JOKE
|
111
|
+
tBitblt,
|
112
|
+
tAnswer,
|
113
|
+
#endif
|
114
|
+
tLAST_ID,
|
115
|
+
#define TOKEN2ID(n) id##n = ((t##n<<ID_SCOPE_SHIFT)|ID_LOCAL)
|
116
|
+
#if SUPPORT_JOKE
|
117
|
+
TOKEN2ID(Bitblt),
|
118
|
+
TOKEN2ID(Answer),
|
119
|
+
#endif
|
120
|
+
TOKEN2ID(Intern),
|
121
|
+
TOKEN2ID(MethodMissing),
|
122
|
+
TOKEN2ID(Length),
|
123
|
+
TOKEN2ID(Size),
|
124
|
+
TOKEN2ID(Gets),
|
125
|
+
TOKEN2ID(Succ),
|
126
|
+
TOKEN2ID(Each),
|
127
|
+
TOKEN2ID(Lambda),
|
128
|
+
TOKEN2ID(Send),
|
129
|
+
TOKEN2ID(__send__),
|
130
|
+
TOKEN2ID(Initialize),
|
131
|
+
TOKEN2ID(UScore),
|
132
|
+
TOKEN2ID(LAST_ID)
|
133
|
+
};
|
134
|
+
|
135
|
+
#ifdef tLAST_TOKEN
|
136
|
+
struct ruby_method_ids_check {
|
137
|
+
#define ruby_method_id_check_for(name, value) \
|
138
|
+
int checking_for_##name[name == value ? 1 : -1]
|
139
|
+
ruby_method_id_check_for(tUPLUS, 321);
|
140
|
+
ruby_method_id_check_for(tUMINUS, 322);
|
141
|
+
ruby_method_id_check_for(tPOW, 323);
|
142
|
+
ruby_method_id_check_for(tCMP, 324);
|
143
|
+
ruby_method_id_check_for(tEQ, 325);
|
144
|
+
ruby_method_id_check_for(tEQQ, 326);
|
145
|
+
ruby_method_id_check_for(tNEQ, 327);
|
146
|
+
ruby_method_id_check_for(tGEQ, 328);
|
147
|
+
ruby_method_id_check_for(tLEQ, 329);
|
148
|
+
ruby_method_id_check_for(tANDOP, 330);
|
149
|
+
ruby_method_id_check_for(tOROP, 331);
|
150
|
+
ruby_method_id_check_for(tMATCH, 332);
|
151
|
+
ruby_method_id_check_for(tNMATCH, 333);
|
152
|
+
ruby_method_id_check_for(tDOT2, 334);
|
153
|
+
ruby_method_id_check_for(tDOT3, 335);
|
154
|
+
ruby_method_id_check_for(tAREF, 336);
|
155
|
+
ruby_method_id_check_for(tASET, 337);
|
156
|
+
ruby_method_id_check_for(tLSHFT, 338);
|
157
|
+
ruby_method_id_check_for(tRSHFT, 339);
|
158
|
+
ruby_method_id_check_for(tLAMBDA, 352);
|
159
|
+
ruby_method_id_check_for(idNULL, 365);
|
160
|
+
ruby_method_id_check_for(idRespond_to, 366);
|
161
|
+
ruby_method_id_check_for(idIFUNC, 367);
|
162
|
+
ruby_method_id_check_for(idCFUNC, 368);
|
163
|
+
ruby_method_id_check_for(id_core_set_method_alias, 369);
|
164
|
+
ruby_method_id_check_for(id_core_set_variable_alias, 370);
|
165
|
+
ruby_method_id_check_for(id_core_undef_method, 371);
|
166
|
+
ruby_method_id_check_for(id_core_define_method, 372);
|
167
|
+
ruby_method_id_check_for(id_core_define_singleton_method, 373);
|
168
|
+
ruby_method_id_check_for(id_core_set_postexe, 374);
|
169
|
+
ruby_method_id_check_for(tLAST_TOKEN, 375);
|
170
|
+
};
|
171
|
+
#endif
|
172
|
+
|
173
|
+
#endif /* RUBY_ID_H */
|