debase-ruby_core_source 0.10.2 → 0.10.3

Sign up to get free protection for your applications and to get access to all the features.
Files changed (52) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +5 -0
  3. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/addr2line.h +21 -0
  4. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/build_assert/build_assert.h +40 -0
  5. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/check_type/check_type.h +63 -0
  6. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/container_of/container_of.h +142 -0
  7. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/list/list.h +773 -0
  8. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/str/str.h +16 -0
  9. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/constant.h +51 -0
  10. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/debug_counter.h +109 -0
  11. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/dln.h +51 -0
  12. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/encindex.h +69 -0
  13. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/eval_intern.h +334 -0
  14. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/gc.h +116 -0
  15. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/id.h +250 -0
  16. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/id_table.h +31 -0
  17. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/insns.inc +217 -0
  18. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/insns_info.inc +1570 -0
  19. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/internal.h +2036 -0
  20. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/iseq.h +307 -0
  21. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/known_errors.inc +746 -0
  22. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/method.h +218 -0
  23. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/node.h +540 -0
  24. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/node_name.inc +198 -0
  25. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/opt_sc.inc +1601 -0
  26. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/optinsn.inc +103 -0
  27. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/optunifs.inc +61 -0
  28. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/parse.h +206 -0
  29. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/probes_helper.h +43 -0
  30. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regenc.h +254 -0
  31. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regint.h +938 -0
  32. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regparse.h +370 -0
  33. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/revision.h +1 -0
  34. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ruby_assert.h +54 -0
  35. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ruby_atomic.h +233 -0
  36. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/siphash.h +48 -0
  37. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/symbol.h +108 -0
  38. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/thread_pthread.h +54 -0
  39. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/thread_win32.h +36 -0
  40. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/timev.h +42 -0
  41. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/transcode_data.h +139 -0
  42. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/version.h +73 -0
  43. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm.inc +3667 -0
  44. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_call_iseq_optimized.inc +213 -0
  45. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_core.h +1767 -0
  46. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_debug.h +37 -0
  47. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_exec.h +192 -0
  48. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_insnhelper.h +255 -0
  49. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_opts.h +56 -0
  50. data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vmtc.inc +214 -0
  51. data/lib/debase/ruby_core_source/version.rb +1 -1
  52. metadata +51 -3
@@ -0,0 +1,370 @@
1
+ #ifndef ONIGMO_REGPARSE_H
2
+ #define ONIGMO_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-2016 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) \
71
+ do { \
72
+ int value = ntype; \
73
+ memcpy(&((node)->u.base.type), &value, sizeof(int)); \
74
+ } while (0)
75
+
76
+ #define NSTR(node) (&((node)->u.str))
77
+ #define NCCLASS(node) (&((node)->u.cclass))
78
+ #define NCTYPE(node) (&((node)->u.ctype))
79
+ #define NBREF(node) (&((node)->u.bref))
80
+ #define NQTFR(node) (&((node)->u.qtfr))
81
+ #define NENCLOSE(node) (&((node)->u.enclose))
82
+ #define NANCHOR(node) (&((node)->u.anchor))
83
+ #define NCONS(node) (&((node)->u.cons))
84
+ #define NCALL(node) (&((node)->u.call))
85
+
86
+ #define NCAR(node) (NCONS(node)->car)
87
+ #define NCDR(node) (NCONS(node)->cdr)
88
+
89
+
90
+
91
+ #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML)
92
+ #define ANCHOR_END_BUF_MASK (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)
93
+
94
+ #define ENCLOSE_MEMORY (1<<0)
95
+ #define ENCLOSE_OPTION (1<<1)
96
+ #define ENCLOSE_STOP_BACKTRACK (1<<2)
97
+ #define ENCLOSE_CONDITION (1<<3)
98
+ #define ENCLOSE_ABSENT (1<<4)
99
+
100
+ #define NODE_STR_MARGIN 16
101
+ #define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */
102
+ #define NODE_BACKREFS_SIZE 6
103
+
104
+ #define NSTR_RAW (1<<0) /* by backslashed number */
105
+ #define NSTR_AMBIG (1<<1)
106
+ #define NSTR_DONT_GET_OPT_INFO (1<<2)
107
+
108
+ #define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s)
109
+ #define NSTRING_SET_RAW(node) (node)->u.str.flag |= NSTR_RAW
110
+ #define NSTRING_CLEAR_RAW(node) (node)->u.str.flag &= ~NSTR_RAW
111
+ #define NSTRING_SET_AMBIG(node) (node)->u.str.flag |= NSTR_AMBIG
112
+ #define NSTRING_SET_DONT_GET_OPT_INFO(node) \
113
+ (node)->u.str.flag |= NSTR_DONT_GET_OPT_INFO
114
+ #define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0)
115
+ #define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0)
116
+ #define NSTRING_IS_DONT_GET_OPT_INFO(node) \
117
+ (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0)
118
+
119
+ #define BACKREFS_P(br) \
120
+ (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
121
+
122
+ #define NQ_TARGET_ISNOT_EMPTY 0
123
+ #define NQ_TARGET_IS_EMPTY 1
124
+ #define NQ_TARGET_IS_EMPTY_MEM 2
125
+ #define NQ_TARGET_IS_EMPTY_REC 3
126
+
127
+ /* status bits */
128
+ #define NST_MIN_FIXED (1<<0)
129
+ #define NST_MAX_FIXED (1<<1)
130
+ #define NST_CLEN_FIXED (1<<2)
131
+ #define NST_MARK1 (1<<3)
132
+ #define NST_MARK2 (1<<4)
133
+ #define NST_MEM_BACKREFED (1<<5)
134
+ #define NST_STOP_BT_SIMPLE_REPEAT (1<<6)
135
+ #define NST_RECURSION (1<<7)
136
+ #define NST_CALLED (1<<8)
137
+ #define NST_ADDR_FIXED (1<<9)
138
+ #define NST_NAMED_GROUP (1<<10)
139
+ #define NST_NAME_REF (1<<11)
140
+ #define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */
141
+ #define NST_NEST_LEVEL (1<<13)
142
+ #define NST_BY_NUMBER (1<<14) /* {n,m} */
143
+
144
+ #define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f)
145
+ #define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f)
146
+
147
+ #define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0)
148
+ #define IS_ENCLOSE_ADDR_FIXED(en) (((en)->state & NST_ADDR_FIXED) != 0)
149
+ #define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0)
150
+ #define IS_ENCLOSE_MARK1(en) (((en)->state & NST_MARK1) != 0)
151
+ #define IS_ENCLOSE_MARK2(en) (((en)->state & NST_MARK2) != 0)
152
+ #define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0)
153
+ #define IS_ENCLOSE_MAX_FIXED(en) (((en)->state & NST_MAX_FIXED) != 0)
154
+ #define IS_ENCLOSE_CLEN_FIXED(en) (((en)->state & NST_CLEN_FIXED) != 0)
155
+ #define IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(en) \
156
+ (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0)
157
+ #define IS_ENCLOSE_NAMED_GROUP(en) (((en)->state & NST_NAMED_GROUP) != 0)
158
+ #define IS_ENCLOSE_NAME_REF(en) (((en)->state & NST_NAME_REF) != 0)
159
+
160
+ #define SET_CALL_RECURSION(node) (node)->u.call.state |= NST_RECURSION
161
+ #define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0)
162
+ #define IS_CALL_NAME_REF(cn) (((cn)->state & NST_NAME_REF) != 0)
163
+ #define IS_BACKREF_NAME_REF(bn) (((bn)->state & NST_NAME_REF) != 0)
164
+ #define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0)
165
+ #define IS_QUANTIFIER_IN_REPEAT(qn) (((qn)->state & NST_IN_REPEAT) != 0)
166
+ #define IS_QUANTIFIER_BY_NUMBER(qn) (((qn)->state & NST_BY_NUMBER) != 0)
167
+
168
+ #define CALLNODE_REFNUM_UNDEF -1
169
+
170
+ typedef struct {
171
+ NodeBase base;
172
+ UChar* s;
173
+ UChar* end;
174
+ unsigned int flag;
175
+ int capa; /* (allocated size - 1) or 0: use buf[] */
176
+ UChar buf[NODE_STR_BUF_SIZE];
177
+ } StrNode;
178
+
179
+ typedef struct {
180
+ NodeBase base;
181
+ int state;
182
+ struct _Node* target;
183
+ int lower;
184
+ int upper;
185
+ int greedy;
186
+ int target_empty_info;
187
+ struct _Node* head_exact;
188
+ struct _Node* next_head_exact;
189
+ int is_refered; /* include called node. don't eliminate even if {0} */
190
+ #ifdef USE_COMBINATION_EXPLOSION_CHECK
191
+ int comb_exp_check_num; /* 1,2,3...: check, 0: no check */
192
+ #endif
193
+ } QtfrNode;
194
+
195
+ typedef struct {
196
+ NodeBase base;
197
+ int state;
198
+ int type;
199
+ int regnum;
200
+ OnigOptionType option;
201
+ AbsAddrType call_addr;
202
+ struct _Node* target;
203
+ /* for multiple call reference */
204
+ OnigDistance min_len; /* min length (byte) */
205
+ OnigDistance max_len; /* max length (byte) */
206
+ int char_len; /* character length */
207
+ int opt_count; /* referenced count in optimize_node_left() */
208
+ } EncloseNode;
209
+
210
+ #ifdef USE_SUBEXP_CALL
211
+
212
+ typedef struct {
213
+ int offset;
214
+ struct _Node* target;
215
+ } UnsetAddr;
216
+
217
+ typedef struct {
218
+ int num;
219
+ int alloc;
220
+ UnsetAddr* us;
221
+ } UnsetAddrList;
222
+
223
+ typedef struct {
224
+ NodeBase base;
225
+ int state;
226
+ int group_num;
227
+ UChar* name;
228
+ UChar* name_end;
229
+ struct _Node* target; /* EncloseNode : ENCLOSE_MEMORY */
230
+ UnsetAddrList* unset_addr_list;
231
+ } CallNode;
232
+
233
+ #endif
234
+
235
+ typedef struct {
236
+ NodeBase base;
237
+ int state;
238
+ int back_num;
239
+ int back_static[NODE_BACKREFS_SIZE];
240
+ int* back_dynamic;
241
+ int nest_level;
242
+ } BRefNode;
243
+
244
+ typedef struct {
245
+ NodeBase base;
246
+ int type;
247
+ struct _Node* target;
248
+ int char_len;
249
+ int ascii_range;
250
+ } AnchorNode;
251
+
252
+ typedef struct {
253
+ NodeBase base;
254
+ struct _Node* car;
255
+ struct _Node* cdr;
256
+ } ConsAltNode;
257
+
258
+ typedef struct {
259
+ NodeBase base;
260
+ int ctype;
261
+ int not;
262
+ int ascii_range;
263
+ } CtypeNode;
264
+
265
+ typedef struct _Node {
266
+ union {
267
+ NodeBase base;
268
+ StrNode str;
269
+ CClassNode cclass;
270
+ QtfrNode qtfr;
271
+ EncloseNode enclose;
272
+ BRefNode bref;
273
+ AnchorNode anchor;
274
+ ConsAltNode cons;
275
+ CtypeNode ctype;
276
+ #ifdef USE_SUBEXP_CALL
277
+ CallNode call;
278
+ #endif
279
+ } u;
280
+ } Node;
281
+
282
+
283
+ #define NULL_NODE ((Node* )0)
284
+
285
+ #define SCANENV_MEMNODES_SIZE 8
286
+ #define SCANENV_MEM_NODES(senv) \
287
+ (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \
288
+ (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static)
289
+
290
+ typedef struct {
291
+ OnigOptionType option;
292
+ OnigCaseFoldType case_fold_flag;
293
+ OnigEncoding enc;
294
+ const OnigSyntaxType* syntax;
295
+ BitStatusType capture_history;
296
+ BitStatusType bt_mem_start;
297
+ BitStatusType bt_mem_end;
298
+ BitStatusType backrefed_mem;
299
+ UChar* pattern;
300
+ UChar* pattern_end;
301
+ UChar* error;
302
+ UChar* error_end;
303
+ regex_t* reg; /* for reg->names only */
304
+ #ifdef USE_SUBEXP_CALL
305
+ UnsetAddrList* unset_addr_list;
306
+ #endif
307
+ int num_call;
308
+ int num_mem;
309
+ #ifdef USE_NAMED_GROUP
310
+ int num_named;
311
+ #endif
312
+ int mem_alloc;
313
+ Node* mem_nodes_static[SCANENV_MEMNODES_SIZE];
314
+ Node** mem_nodes_dynamic;
315
+ #ifdef USE_COMBINATION_EXPLOSION_CHECK
316
+ int num_comb_exp_check;
317
+ int comb_exp_max_regnum;
318
+ int curr_max_regnum;
319
+ int has_recursion;
320
+ #endif
321
+ unsigned int parse_depth;
322
+ int warnings_flag;
323
+ #ifdef RUBY
324
+ const char* sourcefile;
325
+ int sourceline;
326
+ #endif
327
+ } ScanEnv;
328
+
329
+
330
+ #define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0)
331
+ #define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0)
332
+ #define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0)
333
+
334
+ #ifdef USE_NAMED_GROUP
335
+ typedef struct {
336
+ int new_val;
337
+ } GroupNumRemap;
338
+
339
+ extern int onig_renumber_name_table(regex_t* reg, GroupNumRemap* map);
340
+ #endif
341
+
342
+ extern int onig_strncmp(const UChar* s1, const UChar* s2, int n);
343
+ extern void onig_strcpy(UChar* dest, const UChar* src, const UChar* end);
344
+ extern void onig_scan_env_set_error_string(ScanEnv* env, int ecode, UChar* arg, UChar* arg_end);
345
+ extern int onig_scan_unsigned_number(UChar** src, const UChar* end, OnigEncoding enc);
346
+ extern void onig_reduce_nested_quantifier(Node* pnode, Node* cnode);
347
+ extern void onig_node_conv_to_str_node(Node* node, int raw);
348
+ extern int onig_node_str_cat(Node* node, const UChar* s, const UChar* end);
349
+ extern int onig_node_str_set(Node* node, const UChar* s, const UChar* end);
350
+ extern void onig_node_free(Node* node);
351
+ extern Node* onig_node_new_enclose(int type);
352
+ extern Node* onig_node_new_anchor(int type);
353
+ extern Node* onig_node_new_str(const UChar* s, const UChar* end);
354
+ extern Node* onig_node_new_list(Node* left, Node* right);
355
+ extern Node* onig_node_list_add(Node* list, Node* x);
356
+ extern Node* onig_node_new_alt(Node* left, Node* right);
357
+ extern void onig_node_str_clear(Node* node);
358
+ extern int onig_names_free(regex_t* reg);
359
+ extern int onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env);
360
+ extern int onig_free_shared_cclass_table(void);
361
+
362
+ #ifdef ONIG_DEBUG
363
+ # ifdef USE_NAMED_GROUP
364
+ extern int onig_print_names(FILE*, regex_t*);
365
+ # endif
366
+ #endif
367
+
368
+ RUBY_SYMBOL_EXPORT_END
369
+
370
+ #endif /* ONIGMO_REGPARSE_H */
@@ -0,0 +1 @@
1
+ #define RUBY_REVISION 63029
@@ -0,0 +1,54 @@
1
+ #ifndef RUBY_ASSERT_H
2
+ #define RUBY_ASSERT_H
3
+
4
+ #include "ruby/ruby.h"
5
+
6
+ #if defined(__cplusplus)
7
+ extern "C" {
8
+ #if 0
9
+ } /* satisfy cc-mode */
10
+ #endif
11
+ #endif
12
+
13
+ NORETURN(void rb_assert_failure(const char *, int, const char *, const char *));
14
+ #ifdef RUBY_FUNCTION_NAME_STRING
15
+ # define RUBY_ASSERT_FAIL(expr) \
16
+ rb_assert_failure(__FILE__, __LINE__, RUBY_FUNCTION_NAME_STRING, expr)
17
+ #else
18
+ # define RUBY_ASSERT_FAIL(expr) \
19
+ rb_assert_failure(__FILE__, __LINE__, NULL, expr)
20
+ #endif
21
+ #define RUBY_ASSERT_MESG(expr, mesg) \
22
+ ((expr) ? (void)0 : RUBY_ASSERT_FAIL(mesg))
23
+ #ifdef HAVE_BUILTIN___BUILTIN_CHOOSE_EXPR_CONSTANT_P
24
+ # define RUBY_ASSERT_MESG_WHEN(cond, expr, mesg) \
25
+ __builtin_choose_expr( \
26
+ __builtin_constant_p(cond), \
27
+ __builtin_choose_expr(cond, RUBY_ASSERT_MESG(expr, mesg), (void)0), \
28
+ RUBY_ASSERT_MESG(!(cond) || (expr), mesg))
29
+ #else
30
+ # define RUBY_ASSERT_MESG_WHEN(cond, expr, mesg) \
31
+ RUBY_ASSERT_MESG(!(cond) || (expr), mesg)
32
+ #endif
33
+ #define RUBY_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(!RUBY_NDEBUG+0, expr, #expr)
34
+ #define RUBY_ASSERT_WHEN(cond, expr) RUBY_ASSERT_MESG_WHEN(cond, expr, #expr)
35
+
36
+ #undef assert
37
+ #define assert RUBY_ASSERT
38
+
39
+ #ifndef RUBY_NDEBUG
40
+ # ifdef NDEBUG
41
+ # define RUBY_NDEBUG 1
42
+ # else
43
+ # define RUBY_NDEBUG 0
44
+ # endif
45
+ #endif
46
+
47
+ #if defined(__cplusplus)
48
+ #if 0
49
+ { /* satisfy cc-mode */
50
+ #endif
51
+ } /* extern "C" { */
52
+ #endif
53
+
54
+ #endif
@@ -0,0 +1,233 @@
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_fetch_or(&(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__(var) 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
+
20
+ # define RUBY_ATOMIC_GENERIC_MACRO 1
21
+
22
+ #elif defined HAVE_GCC_SYNC_BUILTINS
23
+ /* @shyouhei hack to support atomic operations in case of gcc. Gcc
24
+ * has its own pseudo-insns to support them. See info, or
25
+ * http://gcc.gnu.org/onlinedocs/gcc/Atomic-Builtins.html */
26
+
27
+ typedef unsigned int rb_atomic_t; /* Anything OK */
28
+ # define ATOMIC_SET(var, val) (void)__sync_lock_test_and_set(&(var), (val))
29
+ # define ATOMIC_INC(var) __sync_fetch_and_add(&(var), 1)
30
+ # define ATOMIC_DEC(var) __sync_fetch_and_sub(&(var), 1)
31
+ # define ATOMIC_OR(var, val) __sync_fetch_and_or(&(var), (val))
32
+ # define ATOMIC_EXCHANGE(var, val) __sync_lock_test_and_set(&(var), (val))
33
+ # define ATOMIC_CAS(var, oldval, newval) __sync_val_compare_and_swap(&(var), (oldval), (newval))
34
+
35
+ # define ATOMIC_SIZE_ADD(var, val) __sync_fetch_and_add(&(var), (val))
36
+ # define ATOMIC_SIZE_SUB(var, val) __sync_fetch_and_sub(&(var), (val))
37
+
38
+ # define RUBY_ATOMIC_GENERIC_MACRO 1
39
+
40
+ #elif defined _WIN32
41
+ #if defined _MSC_VER && _MSC_VER > 1200
42
+ #pragma intrinsic(_InterlockedOr)
43
+ #endif
44
+ typedef LONG rb_atomic_t;
45
+
46
+ # define ATOMIC_SET(var, val) InterlockedExchange(&(var), (val))
47
+ # define ATOMIC_INC(var) InterlockedIncrement(&(var))
48
+ # define ATOMIC_DEC(var) InterlockedDecrement(&(var))
49
+ #if defined __GNUC__
50
+ # define ATOMIC_OR(var, val) __asm__("lock\n\t" "orl\t%1, %0" : "=m"(var) : "Ir"(val))
51
+ #elif defined _MSC_VER && _MSC_VER <= 1200
52
+ # define ATOMIC_OR(var, val) rb_w32_atomic_or(&(var), (val))
53
+ static inline void
54
+ rb_w32_atomic_or(volatile rb_atomic_t *var, rb_atomic_t val)
55
+ {
56
+ #ifdef _M_IX86
57
+ __asm mov eax, var;
58
+ __asm mov ecx, val;
59
+ __asm lock or [eax], ecx;
60
+ #else
61
+ #error unsupported architecture
62
+ #endif
63
+ }
64
+ #else
65
+ # define ATOMIC_OR(var, val) _InterlockedOr(&(var), (val))
66
+ #endif
67
+ # define ATOMIC_EXCHANGE(var, val) InterlockedExchange(&(var), (val))
68
+ # define ATOMIC_CAS(var, oldval, newval) InterlockedCompareExchange(&(var), (newval), (oldval))
69
+ # if defined _MSC_VER && _MSC_VER <= 1200
70
+ static inline rb_atomic_t
71
+ rb_w32_atomic_cas(volatile rb_atomic_t *var, rb_atomic_t oldval, rb_atomic_t newval)
72
+ {
73
+ return (rb_atomic_t)InterlockedCompareExchange((PVOID *)var, (PVOID)newval, (PVOID)oldval);
74
+ }
75
+ # undef ATOMIC_CAS
76
+ # define ATOMIC_CAS(var, oldval, newval) rb_w32_atomic_cas(&(var), (oldval), (newval))
77
+ # endif
78
+ # ifdef _M_AMD64
79
+ # define ATOMIC_SIZE_ADD(var, val) InterlockedExchangeAdd64((LONG_LONG *)&(var), (val))
80
+ # define ATOMIC_SIZE_SUB(var, val) InterlockedExchangeAdd64((LONG_LONG *)&(var), -(LONG)(val))
81
+ # define ATOMIC_SIZE_INC(var) InterlockedIncrement64(&(var))
82
+ # define ATOMIC_SIZE_DEC(var) InterlockedDecrement64(&(var))
83
+ # define ATOMIC_SIZE_EXCHANGE(var, val) InterlockedExchange64(&(var), (val))
84
+ # define ATOMIC_SIZE_CAS(var, oldval, newval) InterlockedCompareExchange64(&(var), (newval), (oldval))
85
+ # else
86
+ # define ATOMIC_SIZE_ADD(var, val) InterlockedExchangeAdd((LONG *)&(var), (val))
87
+ # define ATOMIC_SIZE_SUB(var, val) InterlockedExchangeAdd((LONG *)&(var), -(LONG)(val))
88
+ # define ATOMIC_SIZE_INC(var) InterlockedIncrement((LONG *)&(var))
89
+ # define ATOMIC_SIZE_DEC(var) InterlockedDecrement((LONG *)&(var))
90
+ # define ATOMIC_SIZE_EXCHANGE(var, val) InterlockedExchange((LONG *)&(var), (val))
91
+ # endif
92
+
93
+ #elif defined(__sun) && defined(HAVE_ATOMIC_H)
94
+ #include <atomic.h>
95
+ typedef unsigned int rb_atomic_t;
96
+
97
+ # define ATOMIC_SET(var, val) (void)atomic_swap_uint(&(var), (val))
98
+ # define ATOMIC_INC(var) atomic_inc_uint(&(var))
99
+ # define ATOMIC_DEC(var) atomic_dec_uint(&(var))
100
+ # define ATOMIC_OR(var, val) atomic_or_uint(&(var), (val))
101
+ # define ATOMIC_EXCHANGE(var, val) atomic_swap_uint(&(var), (val))
102
+ # define ATOMIC_CAS(var, oldval, newval) atomic_cas_uint(&(var), (oldval), (newval))
103
+
104
+ # if SIZEOF_SIZE_T == SIZEOF_LONG
105
+ # define ATOMIC_SIZE_ADD(var, val) atomic_add_long(&(var), (val))
106
+ # define ATOMIC_SIZE_SUB(var, val) atomic_add_long(&(var), -(val))
107
+ # define ATOMIC_SIZE_INC(var) atomic_inc_ulong(&(var))
108
+ # define ATOMIC_SIZE_DEC(var) atomic_dec_ulong(&(var))
109
+ # define ATOMIC_SIZE_EXCHANGE(var, val) atomic_swap_ulong(&(var), (val))
110
+ # define ATOMIC_SIZE_CAS(var, oldval, val) atomic_cas_ulong(&(var), (oldval), (val))
111
+ # else
112
+ # define ATOMIC_SIZE_ADD(var, val) atomic_add_int(&(var), (val))
113
+ # define ATOMIC_SIZE_SUB(var, val) atomic_add_int(&(var), -(val))
114
+ # define ATOMIC_SIZE_INC(var) atomic_inc_uint(&(var))
115
+ # define ATOMIC_SIZE_DEC(var) atomic_dec_uint(&(var))
116
+ # define ATOMIC_SIZE_EXCHANGE(var, val) atomic_swap_uint(&(var), (val))
117
+ # endif
118
+
119
+ #else
120
+ typedef int rb_atomic_t;
121
+ #define NEED_RUBY_ATOMIC_OPS
122
+ extern rb_atomic_t ruby_atomic_exchange(rb_atomic_t *ptr, rb_atomic_t val);
123
+ extern rb_atomic_t ruby_atomic_compare_and_swap(rb_atomic_t *ptr,
124
+ rb_atomic_t cmp,
125
+ rb_atomic_t newval);
126
+
127
+ # define ATOMIC_SET(var, val) (void)((var) = (val))
128
+ # define ATOMIC_INC(var) ((var)++)
129
+ # define ATOMIC_DEC(var) ((var)--)
130
+ # define ATOMIC_OR(var, val) ((var) |= (val))
131
+ # define ATOMIC_EXCHANGE(var, val) ruby_atomic_exchange(&(var), (val))
132
+ # define ATOMIC_CAS(var, oldval, newval) ruby_atomic_compare_and_swap(&(var), (oldval), (newval))
133
+
134
+ # define ATOMIC_SIZE_ADD(var, val) (void)((var) += (val))
135
+ # define ATOMIC_SIZE_SUB(var, val) (void)((var) -= (val))
136
+ # define ATOMIC_SIZE_EXCHANGE(var, val) ruby_atomic_size_exchange(&(var), (val))
137
+ static inline size_t
138
+ ruby_atomic_size_exchange(size_t *ptr, size_t val)
139
+ {
140
+ size_t old = *ptr;
141
+ *ptr = val;
142
+ return old;
143
+ }
144
+ #endif
145
+
146
+ #ifndef ATOMIC_SIZE_INC
147
+ # define ATOMIC_SIZE_INC(var) ATOMIC_INC(var)
148
+ #endif
149
+ #ifndef ATOMIC_SIZE_DEC
150
+ # define ATOMIC_SIZE_DEC(var) ATOMIC_DEC(var)
151
+ #endif
152
+ #ifndef ATOMIC_SIZE_EXCHANGE
153
+ # define ATOMIC_SIZE_EXCHANGE(var, val) ATOMIC_EXCHANGE(var, val)
154
+ #endif
155
+ #ifndef ATOMIC_SIZE_CAS
156
+ # define ATOMIC_SIZE_CAS(var, oldval, val) ATOMIC_CAS(var, oldval, val)
157
+ #endif
158
+
159
+ #if RUBY_ATOMIC_GENERIC_MACRO
160
+ # ifndef ATOMIC_PTR_EXCHANGE
161
+ # define ATOMIC_PTR_EXCHANGE(var, val) ATOMIC_EXCHANGE(var, val)
162
+ # endif
163
+ # ifndef ATOMIC_PTR_CAS
164
+ # define ATOMIC_PTR_CAS(var, oldval, newval) ATOMIC_CAS(var, oldval, newval)
165
+ # endif
166
+
167
+ # ifndef ATOMIC_VALUE_EXCHANGE
168
+ # define ATOMIC_VALUE_EXCHANGE(var, val) ATOMIC_EXCHANGE(var, val)
169
+ # endif
170
+ # ifndef ATOMIC_VALUE_CAS
171
+ # define ATOMIC_VALUE_CAS(var, oldval, val) ATOMIC_CAS(var, oldval, val)
172
+ # endif
173
+ #endif
174
+
175
+ #ifndef ATOMIC_PTR_EXCHANGE
176
+ # if SIZEOF_VOIDP == SIZEOF_SIZE_T
177
+ # define ATOMIC_PTR_EXCHANGE(var, val) (void *)ATOMIC_SIZE_EXCHANGE(*(size_t *)&(var), (size_t)(val))
178
+ # else
179
+ # define ATOMIC_PTR_EXCHANGE(var, val) ruby_atomic_ptr_exchange((const void **)&(var), (val))
180
+ static inline void *
181
+ ruby_atomic_ptr_exchange(const void **ptr, const void *val)
182
+ {
183
+ const void *const old = *ptr;
184
+ *ptr = val;
185
+ return (void *)old;
186
+ }
187
+ # endif
188
+ #endif
189
+ #ifndef ATOMIC_PTR_CAS
190
+ # if SIZEOF_VOIDP == SIZEOF_SIZE_T
191
+ # define ATOMIC_PTR_CAS(var, oldval, val) (void *)ATOMIC_SIZE_CAS(*(size_t *)&(var), (size_t)(oldval), (size_t)(val))
192
+ # else
193
+ # define ATOMIC_PTR_CAS(var, oldval, val) ruby_atomic_ptr_cas(&(var), (oldval), (val))
194
+ static inline void *
195
+ ruby_atomic_ptr_cas(const void **ptr, const void *oldval, const void *val)
196
+ {
197
+ const void *const old = *ptr;
198
+ if (old == oldval) *ptr = val;
199
+ return (void *)old;
200
+ }
201
+ # endif
202
+ #endif
203
+
204
+ #ifndef ATOMIC_VALUE_EXCHANGE
205
+ # if SIZEOF_VALUE == SIZEOF_SIZE_T
206
+ # define ATOMIC_VALUE_EXCHANGE(var, val) ATOMIC_SIZE_EXCHANGE(*(size_t *)&(var), (size_t)(val))
207
+ # else
208
+ # define ATOMIC_VALUE_EXCHANGE(var, val) ruby_atomic_value_exchange(&(var), (val))
209
+ static inline VALUE
210
+ ruby_atomic_value_exchange(VALUE *ptr, VALUE val)
211
+ {
212
+ const VALUE old = *ptr;
213
+ *ptr = val;
214
+ return old;
215
+ }
216
+ # endif
217
+ #endif
218
+ #ifndef ATOMIC_VALUE_CAS
219
+ # if SIZEOF_VALUE == SIZEOF_SIZE_T
220
+ # define ATOMIC_VALUE_CAS(var, oldval, val) ATOMIC_SIZE_CAS(*(size_t *)&(var), (size_t)(oldval), (size_t)(val))
221
+ # else
222
+ # define ATOMIC_VALUE_CAS(var, oldval, val) ruby_atomic_value_cas(&(var), (oldval), (val))
223
+ static inline VALUE
224
+ ruby_atomic_value_cas(VALUE *ptr, VALUE oldval, VALUE val)
225
+ {
226
+ const VALUE old = *ptr;
227
+ if (old == oldval) *ptr = val;
228
+ return old;
229
+ }
230
+ # endif
231
+ #endif
232
+
233
+ #endif /* RUBY_ATOMIC_H */