bindex 0.1.0

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