bindex 0.2.0 → 0.4.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (147) hide show
  1. checksums.yaml +4 -4
  2. data/.travis.yml +13 -33
  3. data/bindex.gemspec +1 -1
  4. data/ext/bindex/com/gsamokovarov/bindex/JRubyIntegration.java +2 -2
  5. data/ext/bindex/com/gsamokovarov/bindex/SetExceptionBindingsEventHook.java +4 -1
  6. data/ext/bindex/cruby.c +49 -15
  7. data/ext/bindex/extconf.rb +0 -15
  8. data/lib/bindex/jruby.rb +0 -1
  9. data/lib/bindex/jruby_internals.jar +0 -0
  10. data/lib/bindex/jruby_internals_9k.jar +0 -0
  11. data/lib/bindex/version.rb +1 -1
  12. metadata +4 -139
  13. data/ext/bindex/bindex.h +0 -11
  14. data/ext/bindex/bindings.c +0 -106
  15. data/ext/bindex/ruby_193.h +0 -101
  16. data/ext/bindex/ruby_193/addr2line.h +0 -21
  17. data/ext/bindex/ruby_193/constant.h +0 -34
  18. data/ext/bindex/ruby_193/debug.h +0 -41
  19. data/ext/bindex/ruby_193/dln.h +0 -50
  20. data/ext/bindex/ruby_193/encdb.h +0 -167
  21. data/ext/bindex/ruby_193/eval_intern.h +0 -234
  22. data/ext/bindex/ruby_193/gc.h +0 -99
  23. data/ext/bindex/ruby_193/id.h +0 -177
  24. data/ext/bindex/ruby_193/internal.h +0 -242
  25. data/ext/bindex/ruby_193/iseq.h +0 -126
  26. data/ext/bindex/ruby_193/method.h +0 -105
  27. data/ext/bindex/ruby_193/node.h +0 -504
  28. data/ext/bindex/ruby_193/parse.h +0 -302
  29. data/ext/bindex/ruby_193/probes.h +0 -369
  30. data/ext/bindex/ruby_193/regenc.h +0 -219
  31. data/ext/bindex/ruby_193/regint.h +0 -850
  32. data/ext/bindex/ruby_193/regparse.h +0 -362
  33. data/ext/bindex/ruby_193/revision.h +0 -1
  34. data/ext/bindex/ruby_193/ruby_atomic.h +0 -175
  35. data/ext/bindex/ruby_193/siphash.h +0 -48
  36. data/ext/bindex/ruby_193/thread_pthread.h +0 -51
  37. data/ext/bindex/ruby_193/thread_win32.h +0 -40
  38. data/ext/bindex/ruby_193/timev.h +0 -21
  39. data/ext/bindex/ruby_193/transcode_data.h +0 -117
  40. data/ext/bindex/ruby_193/transdb.h +0 -186
  41. data/ext/bindex/ruby_193/verconf.h +0 -12
  42. data/ext/bindex/ruby_193/version.h +0 -52
  43. data/ext/bindex/ruby_193/vm_core.h +0 -763
  44. data/ext/bindex/ruby_193/vm_exec.h +0 -184
  45. data/ext/bindex/ruby_193/vm_insnhelper.h +0 -220
  46. data/ext/bindex/ruby_193/vm_opts.h +0 -51
  47. data/ext/bindex/ruby_20.h +0 -142
  48. data/ext/bindex/ruby_20/addr2line.h +0 -21
  49. data/ext/bindex/ruby_20/constant.h +0 -36
  50. data/ext/bindex/ruby_20/dln.h +0 -50
  51. data/ext/bindex/ruby_20/encdb.h +0 -169
  52. data/ext/bindex/ruby_20/eval_intern.h +0 -241
  53. data/ext/bindex/ruby_20/gc.h +0 -104
  54. data/ext/bindex/ruby_20/id.h +0 -135
  55. data/ext/bindex/ruby_20/internal.h +0 -395
  56. data/ext/bindex/ruby_20/iseq.h +0 -140
  57. data/ext/bindex/ruby_20/method.h +0 -138
  58. data/ext/bindex/ruby_20/node.h +0 -541
  59. data/ext/bindex/ruby_20/parse.h +0 -292
  60. data/ext/bindex/ruby_20/probes.h +0 -369
  61. data/ext/bindex/ruby_20/probes_helper.h +0 -67
  62. data/ext/bindex/ruby_20/regenc.h +0 -227
  63. data/ext/bindex/ruby_20/regint.h +0 -915
  64. data/ext/bindex/ruby_20/regparse.h +0 -367
  65. data/ext/bindex/ruby_20/revision.h +0 -1
  66. data/ext/bindex/ruby_20/ruby_atomic.h +0 -170
  67. data/ext/bindex/ruby_20/siphash.h +0 -48
  68. data/ext/bindex/ruby_20/thread_pthread.h +0 -56
  69. data/ext/bindex/ruby_20/thread_win32.h +0 -45
  70. data/ext/bindex/ruby_20/timev.h +0 -21
  71. data/ext/bindex/ruby_20/transcode_data.h +0 -127
  72. data/ext/bindex/ruby_20/transdb.h +0 -190
  73. data/ext/bindex/ruby_20/verconf.h +0 -12
  74. data/ext/bindex/ruby_20/version.h +0 -52
  75. data/ext/bindex/ruby_20/vm_core.h +0 -1018
  76. data/ext/bindex/ruby_20/vm_debug.h +0 -41
  77. data/ext/bindex/ruby_20/vm_exec.h +0 -173
  78. data/ext/bindex/ruby_20/vm_insnhelper.h +0 -274
  79. data/ext/bindex/ruby_20/vm_opts.h +0 -56
  80. data/ext/bindex/ruby_21.h +0 -142
  81. data/ext/bindex/ruby_21/addr2line.h +0 -21
  82. data/ext/bindex/ruby_21/constant.h +0 -36
  83. data/ext/bindex/ruby_21/dln.h +0 -51
  84. data/ext/bindex/ruby_21/encdb.h +0 -170
  85. data/ext/bindex/ruby_21/eval_intern.h +0 -260
  86. data/ext/bindex/ruby_21/gc.h +0 -101
  87. data/ext/bindex/ruby_21/id.h +0 -210
  88. data/ext/bindex/ruby_21/internal.h +0 -889
  89. data/ext/bindex/ruby_21/iseq.h +0 -136
  90. data/ext/bindex/ruby_21/method.h +0 -142
  91. data/ext/bindex/ruby_21/node.h +0 -543
  92. data/ext/bindex/ruby_21/parse.h +0 -298
  93. data/ext/bindex/ruby_21/probes.h +0 -401
  94. data/ext/bindex/ruby_21/probes_helper.h +0 -67
  95. data/ext/bindex/ruby_21/regenc.h +0 -223
  96. data/ext/bindex/ruby_21/regint.h +0 -911
  97. data/ext/bindex/ruby_21/regparse.h +0 -363
  98. data/ext/bindex/ruby_21/revision.h +0 -1
  99. data/ext/bindex/ruby_21/ruby_atomic.h +0 -170
  100. data/ext/bindex/ruby_21/siphash.h +0 -48
  101. data/ext/bindex/ruby_21/thread_native.h +0 -23
  102. data/ext/bindex/ruby_21/thread_pthread.h +0 -56
  103. data/ext/bindex/ruby_21/thread_win32.h +0 -45
  104. data/ext/bindex/ruby_21/timev.h +0 -42
  105. data/ext/bindex/ruby_21/transcode_data.h +0 -123
  106. data/ext/bindex/ruby_21/transdb.h +0 -190
  107. data/ext/bindex/ruby_21/verconf.h +0 -13
  108. data/ext/bindex/ruby_21/version.h +0 -52
  109. data/ext/bindex/ruby_21/vm_core.h +0 -1043
  110. data/ext/bindex/ruby_21/vm_debug.h +0 -37
  111. data/ext/bindex/ruby_21/vm_exec.h +0 -182
  112. data/ext/bindex/ruby_21/vm_insnhelper.h +0 -273
  113. data/ext/bindex/ruby_21/vm_opts.h +0 -56
  114. data/ext/bindex/ruby_21preview.h +0 -146
  115. data/ext/bindex/ruby_21preview/addr2line.h +0 -21
  116. data/ext/bindex/ruby_21preview/constant.h +0 -36
  117. data/ext/bindex/ruby_21preview/dln.h +0 -51
  118. data/ext/bindex/ruby_21preview/encdb.h +0 -270
  119. data/ext/bindex/ruby_21preview/eval_intern.h +0 -217
  120. data/ext/bindex/ruby_21preview/gc.h +0 -100
  121. data/ext/bindex/ruby_21preview/id.h +0 -169
  122. data/ext/bindex/ruby_21preview/internal.h +0 -765
  123. data/ext/bindex/ruby_21preview/iseq.h +0 -136
  124. data/ext/bindex/ruby_21preview/method.h +0 -141
  125. data/ext/bindex/ruby_21preview/node.h +0 -543
  126. data/ext/bindex/ruby_21preview/parse.h +0 -298
  127. data/ext/bindex/ruby_21preview/probes.h +0 -385
  128. data/ext/bindex/ruby_21preview/probes_helper.h +0 -67
  129. data/ext/bindex/ruby_21preview/regenc.h +0 -223
  130. data/ext/bindex/ruby_21preview/regint.h +0 -911
  131. data/ext/bindex/ruby_21preview/regparse.h +0 -363
  132. data/ext/bindex/ruby_21preview/revision.h +0 -1
  133. data/ext/bindex/ruby_21preview/ruby_atomic.h +0 -130
  134. data/ext/bindex/ruby_21preview/siphash.h +0 -48
  135. data/ext/bindex/ruby_21preview/thread_native.h +0 -23
  136. data/ext/bindex/ruby_21preview/thread_pthread.h +0 -56
  137. data/ext/bindex/ruby_21preview/thread_win32.h +0 -45
  138. data/ext/bindex/ruby_21preview/timev.h +0 -42
  139. data/ext/bindex/ruby_21preview/transcode_data.h +0 -123
  140. data/ext/bindex/ruby_21preview/transdb.h +0 -190
  141. data/ext/bindex/ruby_21preview/verconf.h +0 -13
  142. data/ext/bindex/ruby_21preview/version.h +0 -53
  143. data/ext/bindex/ruby_21preview/vm_core.h +0 -1017
  144. data/ext/bindex/ruby_21preview/vm_debug.h +0 -37
  145. data/ext/bindex/ruby_21preview/vm_exec.h +0 -180
  146. data/ext/bindex/ruby_21preview/vm_insnhelper.h +0 -272
  147. data/ext/bindex/ruby_21preview/vm_opts.h +0 -56
@@ -1,363 +0,0 @@
1
- #ifndef ONIGURUMA_REGPARSE_H
2
- #define ONIGURUMA_REGPARSE_H
3
- /**********************************************************************
4
- regparse.h - Onigmo (Oniguruma-mod) (regular expression library)
5
- **********************************************************************/
6
- /*-
7
- * Copyright (c) 2002-2007 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
8
- * Copyright (c) 2011 K.Takata <kentkt AT csc DOT jp>
9
- * All rights reserved.
10
- *
11
- * Redistribution and use in source and binary forms, with or without
12
- * modification, are permitted provided that the following conditions
13
- * are met:
14
- * 1. Redistributions of source code must retain the above copyright
15
- * notice, this list of conditions and the following disclaimer.
16
- * 2. Redistributions in binary form must reproduce the above copyright
17
- * notice, this list of conditions and the following disclaimer in the
18
- * documentation and/or other materials provided with the distribution.
19
- *
20
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
21
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23
- * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30
- * SUCH DAMAGE.
31
- */
32
-
33
- #include "regint.h"
34
-
35
- RUBY_SYMBOL_EXPORT_BEGIN
36
-
37
- /* node type */
38
- #define NT_STR 0
39
- #define NT_CCLASS 1
40
- #define NT_CTYPE 2
41
- #define NT_CANY 3
42
- #define NT_BREF 4
43
- #define NT_QTFR 5
44
- #define NT_ENCLOSE 6
45
- #define NT_ANCHOR 7
46
- #define NT_LIST 8
47
- #define NT_ALT 9
48
- #define NT_CALL 10
49
-
50
- /* node type bit */
51
- #define NTYPE2BIT(type) (1<<(type))
52
-
53
- #define BIT_NT_STR NTYPE2BIT(NT_STR)
54
- #define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS)
55
- #define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE)
56
- #define BIT_NT_CANY NTYPE2BIT(NT_CANY)
57
- #define BIT_NT_BREF NTYPE2BIT(NT_BREF)
58
- #define BIT_NT_QTFR NTYPE2BIT(NT_QTFR)
59
- #define BIT_NT_ENCLOSE NTYPE2BIT(NT_ENCLOSE)
60
- #define BIT_NT_ANCHOR NTYPE2BIT(NT_ANCHOR)
61
- #define BIT_NT_LIST NTYPE2BIT(NT_LIST)
62
- #define BIT_NT_ALT NTYPE2BIT(NT_ALT)
63
- #define BIT_NT_CALL NTYPE2BIT(NT_CALL)
64
-
65
- #define IS_NODE_TYPE_SIMPLE(type) \
66
- ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\
67
- BIT_NT_CANY | BIT_NT_BREF)) != 0)
68
-
69
- #define NTYPE(node) ((node)->u.base.type)
70
- #define SET_NTYPE(node, ntype) (node)->u.base.type = (ntype)
71
-
72
- #define NSTR(node) (&((node)->u.str))
73
- #define NCCLASS(node) (&((node)->u.cclass))
74
- #define NCTYPE(node) (&((node)->u.ctype))
75
- #define NBREF(node) (&((node)->u.bref))
76
- #define NQTFR(node) (&((node)->u.qtfr))
77
- #define NENCLOSE(node) (&((node)->u.enclose))
78
- #define NANCHOR(node) (&((node)->u.anchor))
79
- #define NCONS(node) (&((node)->u.cons))
80
- #define NCALL(node) (&((node)->u.call))
81
-
82
- #define NCAR(node) (NCONS(node)->car)
83
- #define NCDR(node) (NCONS(node)->cdr)
84
-
85
-
86
-
87
- #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML)
88
- #define ANCHOR_END_BUF_MASK (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)
89
-
90
- #define ENCLOSE_MEMORY (1<<0)
91
- #define ENCLOSE_OPTION (1<<1)
92
- #define ENCLOSE_STOP_BACKTRACK (1<<2)
93
- #define ENCLOSE_CONDITION (1<<3)
94
-
95
- #define NODE_STR_MARGIN 16
96
- #define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */
97
- #define NODE_BACKREFS_SIZE 6
98
-
99
- #define NSTR_RAW (1<<0) /* by backslashed number */
100
- #define NSTR_AMBIG (1<<1)
101
- #define NSTR_DONT_GET_OPT_INFO (1<<2)
102
-
103
- #define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s)
104
- #define NSTRING_SET_RAW(node) (node)->u.str.flag |= NSTR_RAW
105
- #define NSTRING_CLEAR_RAW(node) (node)->u.str.flag &= ~NSTR_RAW
106
- #define NSTRING_SET_AMBIG(node) (node)->u.str.flag |= NSTR_AMBIG
107
- #define NSTRING_SET_DONT_GET_OPT_INFO(node) \
108
- (node)->u.str.flag |= NSTR_DONT_GET_OPT_INFO
109
- #define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0)
110
- #define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0)
111
- #define NSTRING_IS_DONT_GET_OPT_INFO(node) \
112
- (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0)
113
-
114
- #define BACKREFS_P(br) \
115
- (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
116
-
117
- #define NQ_TARGET_ISNOT_EMPTY 0
118
- #define NQ_TARGET_IS_EMPTY 1
119
- #define NQ_TARGET_IS_EMPTY_MEM 2
120
- #define NQ_TARGET_IS_EMPTY_REC 3
121
-
122
- /* status bits */
123
- #define NST_MIN_FIXED (1<<0)
124
- #define NST_MAX_FIXED (1<<1)
125
- #define NST_CLEN_FIXED (1<<2)
126
- #define NST_MARK1 (1<<3)
127
- #define NST_MARK2 (1<<4)
128
- #define NST_MEM_BACKREFED (1<<5)
129
- #define NST_STOP_BT_SIMPLE_REPEAT (1<<6)
130
- #define NST_RECURSION (1<<7)
131
- #define NST_CALLED (1<<8)
132
- #define NST_ADDR_FIXED (1<<9)
133
- #define NST_NAMED_GROUP (1<<10)
134
- #define NST_NAME_REF (1<<11)
135
- #define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */
136
- #define NST_NEST_LEVEL (1<<13)
137
- #define NST_BY_NUMBER (1<<14) /* {n,m} */
138
-
139
- #define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f)
140
- #define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f)
141
-
142
- #define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0)
143
- #define IS_ENCLOSE_ADDR_FIXED(en) (((en)->state & NST_ADDR_FIXED) != 0)
144
- #define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0)
145
- #define IS_ENCLOSE_MARK1(en) (((en)->state & NST_MARK1) != 0)
146
- #define IS_ENCLOSE_MARK2(en) (((en)->state & NST_MARK2) != 0)
147
- #define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0)
148
- #define IS_ENCLOSE_MAX_FIXED(en) (((en)->state & NST_MAX_FIXED) != 0)
149
- #define IS_ENCLOSE_CLEN_FIXED(en) (((en)->state & NST_CLEN_FIXED) != 0)
150
- #define IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(en) \
151
- (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0)
152
- #define IS_ENCLOSE_NAMED_GROUP(en) (((en)->state & NST_NAMED_GROUP) != 0)
153
- #define IS_ENCLOSE_NAME_REF(en) (((en)->state & NST_NAME_REF) != 0)
154
-
155
- #define SET_CALL_RECURSION(node) (node)->u.call.state |= NST_RECURSION
156
- #define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0)
157
- #define IS_CALL_NAME_REF(cn) (((cn)->state & NST_NAME_REF) != 0)
158
- #define IS_BACKREF_NAME_REF(bn) (((bn)->state & NST_NAME_REF) != 0)
159
- #define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0)
160
- #define IS_QUANTIFIER_IN_REPEAT(qn) (((qn)->state & NST_IN_REPEAT) != 0)
161
- #define IS_QUANTIFIER_BY_NUMBER(qn) (((qn)->state & NST_BY_NUMBER) != 0)
162
-
163
- #define CALLNODE_REFNUM_UNDEF -1
164
-
165
- typedef struct {
166
- NodeBase base;
167
- UChar* s;
168
- UChar* end;
169
- unsigned int flag;
170
- int capa; /* (allocated size - 1) or 0: use buf[] */
171
- UChar buf[NODE_STR_BUF_SIZE];
172
- } StrNode;
173
-
174
- typedef struct {
175
- NodeBase base;
176
- int state;
177
- struct _Node* target;
178
- int lower;
179
- int upper;
180
- int greedy;
181
- int target_empty_info;
182
- struct _Node* head_exact;
183
- struct _Node* next_head_exact;
184
- int is_refered; /* include called node. don't eliminate even if {0} */
185
- #ifdef USE_COMBINATION_EXPLOSION_CHECK
186
- int comb_exp_check_num; /* 1,2,3...: check, 0: no check */
187
- #endif
188
- } QtfrNode;
189
-
190
- typedef struct {
191
- NodeBase base;
192
- int state;
193
- int type;
194
- int regnum;
195
- OnigOptionType option;
196
- struct _Node* target;
197
- AbsAddrType call_addr;
198
- /* for multiple call reference */
199
- OnigDistance min_len; /* min length (byte) */
200
- OnigDistance max_len; /* max length (byte) */
201
- int char_len; /* character length */
202
- int opt_count; /* referenced count in optimize_node_left() */
203
- } EncloseNode;
204
-
205
- #ifdef USE_SUBEXP_CALL
206
-
207
- typedef struct {
208
- int offset;
209
- struct _Node* target;
210
- } UnsetAddr;
211
-
212
- typedef struct {
213
- int num;
214
- int alloc;
215
- UnsetAddr* us;
216
- } UnsetAddrList;
217
-
218
- typedef struct {
219
- NodeBase base;
220
- int state;
221
- int group_num;
222
- UChar* name;
223
- UChar* name_end;
224
- struct _Node* target; /* EncloseNode : ENCLOSE_MEMORY */
225
- UnsetAddrList* unset_addr_list;
226
- } CallNode;
227
-
228
- #endif
229
-
230
- typedef struct {
231
- NodeBase base;
232
- int state;
233
- int back_num;
234
- int back_static[NODE_BACKREFS_SIZE];
235
- int* back_dynamic;
236
- int nest_level;
237
- } BRefNode;
238
-
239
- typedef struct {
240
- NodeBase base;
241
- int type;
242
- struct _Node* target;
243
- int char_len;
244
- int ascii_range;
245
- } AnchorNode;
246
-
247
- typedef struct {
248
- NodeBase base;
249
- struct _Node* car;
250
- struct _Node* cdr;
251
- } ConsAltNode;
252
-
253
- typedef struct {
254
- NodeBase base;
255
- int ctype;
256
- int not;
257
- int ascii_range;
258
- } CtypeNode;
259
-
260
- typedef struct _Node {
261
- union {
262
- NodeBase base;
263
- StrNode str;
264
- CClassNode cclass;
265
- QtfrNode qtfr;
266
- EncloseNode enclose;
267
- BRefNode bref;
268
- AnchorNode anchor;
269
- ConsAltNode cons;
270
- CtypeNode ctype;
271
- #ifdef USE_SUBEXP_CALL
272
- CallNode call;
273
- #endif
274
- } u;
275
- } Node;
276
-
277
-
278
- #define NULL_NODE ((Node* )0)
279
-
280
- #define SCANENV_MEMNODES_SIZE 8
281
- #define SCANENV_MEM_NODES(senv) \
282
- (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \
283
- (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static)
284
-
285
- typedef struct {
286
- OnigOptionType option;
287
- OnigCaseFoldType case_fold_flag;
288
- OnigEncoding enc;
289
- const OnigSyntaxType* syntax;
290
- BitStatusType capture_history;
291
- BitStatusType bt_mem_start;
292
- BitStatusType bt_mem_end;
293
- BitStatusType backrefed_mem;
294
- UChar* pattern;
295
- UChar* pattern_end;
296
- UChar* error;
297
- UChar* error_end;
298
- regex_t* reg; /* for reg->names only */
299
- int num_call;
300
- #ifdef USE_SUBEXP_CALL
301
- UnsetAddrList* unset_addr_list;
302
- #endif
303
- int num_mem;
304
- #ifdef USE_NAMED_GROUP
305
- int num_named;
306
- #endif
307
- int mem_alloc;
308
- Node* mem_nodes_static[SCANENV_MEMNODES_SIZE];
309
- Node** mem_nodes_dynamic;
310
- #ifdef USE_COMBINATION_EXPLOSION_CHECK
311
- int num_comb_exp_check;
312
- int comb_exp_max_regnum;
313
- int curr_max_regnum;
314
- int has_recursion;
315
- #endif
316
- int warnings_flag;
317
- const char* sourcefile;
318
- int sourceline;
319
- } ScanEnv;
320
-
321
-
322
- #define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0)
323
- #define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0)
324
- #define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0)
325
-
326
- #ifdef USE_NAMED_GROUP
327
- typedef struct {
328
- int new_val;
329
- } GroupNumRemap;
330
-
331
- extern int onig_renumber_name_table P_((regex_t* reg, GroupNumRemap* map));
332
- #endif
333
-
334
- extern int onig_strncmp P_((const UChar* s1, const UChar* s2, int n));
335
- extern void onig_strcpy P_((UChar* dest, const UChar* src, const UChar* end));
336
- extern void onig_scan_env_set_error_string P_((ScanEnv* env, int ecode, UChar* arg, UChar* arg_end));
337
- extern int onig_scan_unsigned_number P_((UChar** src, const UChar* end, OnigEncoding enc));
338
- extern void onig_reduce_nested_quantifier P_((Node* pnode, Node* cnode));
339
- extern void onig_node_conv_to_str_node P_((Node* node, int raw));
340
- extern int onig_node_str_cat P_((Node* node, const UChar* s, const UChar* end));
341
- extern int onig_node_str_set P_((Node* node, const UChar* s, const UChar* end));
342
- extern void onig_node_free P_((Node* node));
343
- extern Node* onig_node_new_enclose P_((int type));
344
- extern Node* onig_node_new_anchor P_((int type));
345
- extern Node* onig_node_new_str P_((const UChar* s, const UChar* end));
346
- extern Node* onig_node_new_list P_((Node* left, Node* right));
347
- extern Node* onig_node_list_add P_((Node* list, Node* x));
348
- extern Node* onig_node_new_alt P_((Node* left, Node* right));
349
- extern void onig_node_str_clear P_((Node* node));
350
- extern int onig_free_node_list P_((void));
351
- extern int onig_names_free P_((regex_t* reg));
352
- extern int onig_parse_make_tree P_((Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env));
353
- extern int onig_free_shared_cclass_table P_((void));
354
-
355
- #ifdef ONIG_DEBUG
356
- #ifdef USE_NAMED_GROUP
357
- extern int onig_print_names(FILE*, regex_t*);
358
- #endif
359
- #endif
360
-
361
- RUBY_SYMBOL_EXPORT_END
362
-
363
- #endif /* ONIGURUMA_REGPARSE_H */
@@ -1 +0,0 @@
1
- #define RUBY_REVISION 43010
@@ -1,130 +0,0 @@
1
- #ifndef RUBY_ATOMIC_H
2
- #define RUBY_ATOMIC_H
3
-
4
- #if 0
5
- #elif defined HAVE_GCC_ATOMIC_BUILTINS
6
- /* @shyouhei hack to support atomic operations in case of gcc. Gcc
7
- * has its own pseudo-insns to support them. See info, or
8
- * http://gcc.gnu.org/onlinedocs/gcc/Atomic-Builtins.html */
9
-
10
- typedef unsigned int rb_atomic_t; /* Anything OK */
11
- # define ATOMIC_SET(var, val) (void)__sync_lock_test_and_set(&(var), (val))
12
- # define ATOMIC_INC(var) __sync_fetch_and_add(&(var), 1)
13
- # define ATOMIC_DEC(var) __sync_fetch_and_sub(&(var), 1)
14
- # define ATOMIC_OR(var, val) __sync_or_and_fetch(&(var), (val))
15
- # define ATOMIC_EXCHANGE(var, val) __sync_lock_test_and_set(&(var), (val))
16
- # define ATOMIC_CAS(var, oldval, newval) __sync_val_compare_and_swap(&(var), (oldval), (newval))
17
-
18
- # define ATOMIC_SIZE_ADD(var, val) __sync_fetch_and_add(&(var), (val))
19
- # define ATOMIC_SIZE_SUB(var, val) __sync_fetch_and_sub(&(var), (val))
20
- # define ATOMIC_SIZE_INC(var) __sync_fetch_and_add(&(var), 1)
21
- # define ATOMIC_SIZE_DEC(var) __sync_fetch_and_sub(&(var), 1)
22
- # define ATOMIC_SIZE_EXCHANGE(var, val) __sync_lock_test_and_set(&(var), (val))
23
-
24
- #elif defined _WIN32
25
- #if defined _MSC_VER && _MSC_VER > 1200
26
- #pragma intrinsic(_InterlockedOr)
27
- #endif
28
- typedef LONG rb_atomic_t;
29
-
30
- # define ATOMIC_SET(var, val) InterlockedExchange(&(var), (val))
31
- # define ATOMIC_INC(var) InterlockedIncrement(&(var))
32
- # define ATOMIC_DEC(var) InterlockedDecrement(&(var))
33
- #if defined __GNUC__
34
- # define ATOMIC_OR(var, val) __asm__("lock\n\t" "orl\t%1, %0" : "=m"(var) : "Ir"(val))
35
- #elif defined _MSC_VER && _MSC_VER <= 1200
36
- # define ATOMIC_OR(var, val) rb_w32_atomic_or(&(var), (val))
37
- static inline void
38
- rb_w32_atomic_or(volatile rb_atomic_t *var, rb_atomic_t val)
39
- {
40
- #ifdef _M_IX86
41
- __asm mov eax, var;
42
- __asm mov ecx, val;
43
- __asm lock or [eax], ecx;
44
- #else
45
- #error unsupported architecture
46
- #endif
47
- }
48
- #else
49
- # define ATOMIC_OR(var, val) _InterlockedOr(&(var), (val))
50
- #endif
51
- # define ATOMIC_EXCHANGE(var, val) InterlockedExchange(&(var), (val))
52
- # define ATOMIC_CAS(var, oldval, newval) InterlockedCompareExchange(&(var), (newval), (oldval))
53
- # if defined _MSC_VER && _MSC_VER <= 1200
54
- static inline rb_atomic_t
55
- rb_w32_atomic_cas(volatile rb_atomic_t *var, rb_atomic_t oldval, rb_atomic_t newval)
56
- {
57
- return (rb_atomic_t)InterlockedCompareExchange((PVOID *)var, (PVOID)newval, (PVOID)oldval);
58
- }
59
- # undef ATOMIC_CAS
60
- # define ATOMIC_CAS(var, oldval, newval) rb_w32_atomic_cas(&(var), (oldval), (newval))
61
- # endif
62
- # ifdef _M_AMD64
63
- # define ATOMIC_SIZE_ADD(var, val) InterlockedExchangeAdd64(&(var), (val))
64
- # define ATOMIC_SIZE_SUB(var, val) InterlockedExchangeAdd64(&(var), -(val))
65
- # define ATOMIC_SIZE_INC(var) InterlockedIncrement64(&(var))
66
- # define ATOMIC_SIZE_DEC(var) InterlockedDecrement64(&(var))
67
- # define ATOMIC_SIZE_EXCHANGE(var, val) InterlockedExchange64(&(var), (val))
68
- # else
69
- # define ATOMIC_SIZE_ADD(var, val) InterlockedExchangeAdd((LONG *)&(var), (val))
70
- # define ATOMIC_SIZE_SUB(var, val) InterlockedExchangeAdd((LONG *)&(var), -(val))
71
- # define ATOMIC_SIZE_INC(var) InterlockedIncrement((LONG *)&(var))
72
- # define ATOMIC_SIZE_DEC(var) InterlockedDecrement((LONG *)&(var))
73
- # define ATOMIC_SIZE_EXCHANGE(var, val) InterlockedExchange((LONG *)&(var), (val))
74
- # endif
75
-
76
- #elif defined(__sun) && defined(HAVE_ATOMIC_H)
77
- #include <atomic.h>
78
- typedef unsigned int rb_atomic_t;
79
-
80
- # define ATOMIC_SET(var, val) (void)atomic_swap_uint(&(var), (val))
81
- # define ATOMIC_INC(var) atomic_inc_uint(&(var))
82
- # define ATOMIC_DEC(var) atomic_dec_uint(&(var))
83
- # define ATOMIC_OR(var, val) atomic_or_uint(&(var), (val))
84
- # define ATOMIC_EXCHANGE(var, val) atomic_swap_uint(&(var), (val))
85
- # define ATOMIC_CAS(var, oldval, newval) atomic_cas_uint(&(var), (oldval), (newval))
86
-
87
- # if SIZEOF_SIZE_T == SIZEOF_LONG
88
- # define ATOMIC_SIZE_ADD(var, val) atomic_add_long(&(var), (val))
89
- # define ATOMIC_SIZE_SUB(var, val) atomic_add_long(&(var), -(val))
90
- # define ATOMIC_SIZE_INC(var) atomic_inc_ulong(&(var))
91
- # define ATOMIC_SIZE_DEC(var) atomic_dec_ulong(&(var))
92
- # define ATOMIC_SIZE_EXCHANGE(var, val) atomic_swap_ulong(&(var), (val))
93
- # else
94
- # define ATOMIC_SIZE_ADD(var, val) atomic_add_int(&(var), (val))
95
- # define ATOMIC_SIZE_SUB(var, val) atomic_add_int(&(var), -(val))
96
- # define ATOMIC_SIZE_INC(var) atomic_inc_uint(&(var))
97
- # define ATOMIC_SIZE_DEC(var) atomic_dec_uint(&(var))
98
- # define ATOMIC_SIZE_EXCHANGE(var, val) atomic_swap_uint(&(var), (val))
99
- # endif
100
-
101
- #else
102
- typedef int rb_atomic_t;
103
- #define NEED_RUBY_ATOMIC_OPS
104
- extern rb_atomic_t ruby_atomic_exchange(rb_atomic_t *ptr, rb_atomic_t val);
105
- extern rb_atomic_t ruby_atomic_compare_and_swap(rb_atomic_t *ptr,
106
- rb_atomic_t cmp,
107
- rb_atomic_t newval);
108
-
109
- # define ATOMIC_SET(var, val) (void)((var) = (val))
110
- # define ATOMIC_INC(var) ((var)++)
111
- # define ATOMIC_DEC(var) ((var)--)
112
- # define ATOMIC_OR(var, val) ((var) |= (val))
113
- # define ATOMIC_EXCHANGE(var, val) ruby_atomic_exchange(&(var), (val))
114
- # define ATOMIC_CAS(var, oldval, newval) ruby_atomic_compare_and_swap(&(var), (oldval), (newval))
115
-
116
- # define ATOMIC_SIZE_ADD(var, val) (void)((var) += (val))
117
- # define ATOMIC_SIZE_SUB(var, val) (void)((var) -= (val))
118
- # define ATOMIC_SIZE_INC(var) ((var)++)
119
- # define ATOMIC_SIZE_DEC(var) ((var)--)
120
- # define ATOMIC_SIZE_EXCHANGE(var, val) atomic_size_exchange(&(var), (val))
121
- static inline size_t
122
- atomic_size_exchange(size_t *ptr, size_t val)
123
- {
124
- size_t old = *ptr;
125
- *ptr = val;
126
- return old;
127
- }
128
- #endif
129
-
130
- #endif /* RUBY_ATOMIC_H */