debase-ruby_core_source 0.7.5 → 0.7.6

Sign up to get free protection for your applications and to get access to all the features.
Files changed (49) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +4 -0
  3. data/CONTRIBUTING.md +2 -1
  4. data/Rakefile +3 -2
  5. data/lib/debase/ruby_core_source/ruby-2.2.1/addr2line.h +21 -0
  6. data/lib/debase/ruby_core_source/ruby-2.2.1/ccan/build_assert/build_assert.h +40 -0
  7. data/lib/debase/ruby_core_source/ruby-2.2.1/ccan/check_type/check_type.h +63 -0
  8. data/lib/debase/ruby_core_source/ruby-2.2.1/ccan/container_of/container_of.h +142 -0
  9. data/lib/debase/ruby_core_source/ruby-2.2.1/ccan/list/list.h +635 -0
  10. data/lib/debase/ruby_core_source/ruby-2.2.1/ccan/str/str.h +16 -0
  11. data/lib/debase/ruby_core_source/ruby-2.2.1/constant.h +43 -0
  12. data/lib/debase/ruby_core_source/ruby-2.2.1/dln.h +51 -0
  13. data/lib/debase/ruby_core_source/ruby-2.2.1/eval_intern.h +275 -0
  14. data/lib/debase/ruby_core_source/ruby-2.2.1/gc.h +107 -0
  15. data/lib/debase/ruby_core_source/ruby-2.2.1/id.h +210 -0
  16. data/lib/debase/ruby_core_source/ruby-2.2.1/insns.inc +107 -0
  17. data/lib/debase/ruby_core_source/ruby-2.2.1/insns_info.inc +752 -0
  18. data/lib/debase/ruby_core_source/ruby-2.2.1/internal.h +1185 -0
  19. data/lib/debase/ruby_core_source/ruby-2.2.1/iseq.h +158 -0
  20. data/lib/debase/ruby_core_source/ruby-2.2.1/known_errors.inc +746 -0
  21. data/lib/debase/ruby_core_source/ruby-2.2.1/method.h +144 -0
  22. data/lib/debase/ruby_core_source/ruby-2.2.1/node.h +544 -0
  23. data/lib/debase/ruby_core_source/ruby-2.2.1/node_name.inc +212 -0
  24. data/lib/debase/ruby_core_source/ruby-2.2.1/opt_sc.inc +734 -0
  25. data/lib/debase/ruby_core_source/ruby-2.2.1/optinsn.inc +83 -0
  26. data/lib/debase/ruby_core_source/ruby-2.2.1/optunifs.inc +124 -0
  27. data/lib/debase/ruby_core_source/ruby-2.2.1/parse.h +203 -0
  28. data/lib/debase/ruby_core_source/ruby-2.2.1/probes_helper.h +67 -0
  29. data/lib/debase/ruby_core_source/ruby-2.2.1/regenc.h +234 -0
  30. data/lib/debase/ruby_core_source/ruby-2.2.1/regint.h +972 -0
  31. data/lib/debase/ruby_core_source/ruby-2.2.1/regparse.h +363 -0
  32. data/lib/debase/ruby_core_source/ruby-2.2.1/revision.h +1 -0
  33. data/lib/debase/ruby_core_source/ruby-2.2.1/ruby_atomic.h +170 -0
  34. data/lib/debase/ruby_core_source/ruby-2.2.1/siphash.h +48 -0
  35. data/lib/debase/ruby_core_source/ruby-2.2.1/symbol.h +87 -0
  36. data/lib/debase/ruby_core_source/ruby-2.2.1/thread_pthread.h +54 -0
  37. data/lib/debase/ruby_core_source/ruby-2.2.1/thread_win32.h +36 -0
  38. data/lib/debase/ruby_core_source/ruby-2.2.1/timev.h +42 -0
  39. data/lib/debase/ruby_core_source/ruby-2.2.1/transcode_data.h +123 -0
  40. data/lib/debase/ruby_core_source/ruby-2.2.1/version.h +52 -0
  41. data/lib/debase/ruby_core_source/ruby-2.2.1/vm.inc +3353 -0
  42. data/lib/debase/ruby_core_source/ruby-2.2.1/vm_core.h +1161 -0
  43. data/lib/debase/ruby_core_source/ruby-2.2.1/vm_debug.h +37 -0
  44. data/lib/debase/ruby_core_source/ruby-2.2.1/vm_exec.h +182 -0
  45. data/lib/debase/ruby_core_source/ruby-2.2.1/vm_insnhelper.h +233 -0
  46. data/lib/debase/ruby_core_source/ruby-2.2.1/vm_opts.h +56 -0
  47. data/lib/debase/ruby_core_source/ruby-2.2.1/vmtc.inc +105 -0
  48. data/lib/debase/ruby_core_source/version.rb +1 -1
  49. metadata +45 -2
@@ -0,0 +1,363 @@
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
+ AbsAddrType call_addr;
197
+ struct _Node* target;
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
+ #ifdef USE_SUBEXP_CALL
300
+ UnsetAddrList* unset_addr_list;
301
+ #endif
302
+ int num_call;
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 */
@@ -0,0 +1 @@
1
+ #define RUBY_REVISION 49769
@@ -0,0 +1,170 @@
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__(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
+
20
+ # define ATOMIC_PTR_EXCHANGE(var, val) __atomic_exchange_n(&(var), (val), __ATOMIC_SEQ_CST)
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 ATOMIC_PTR_EXCHANGE(var, val) __sync_lock_test_and_set(&(var), (val))
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, val) InterlockedCompareExchange64(&(var), (oldval), (val))
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) atomic_size_exchange(&(var), (val))
137
+ static inline size_t
138
+ 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
+ #ifndef ATOMIC_PTR_EXCHANGE
160
+ # if SIZEOF_VOIDP == SIZEOF_SIZE_T
161
+ # define ATOMIC_PTR_EXCHANGE(var, val) (void *)ATOMIC_SIZE_EXCHANGE(*(size_t *)&(var), (size_t)(val))
162
+ # endif
163
+ #endif
164
+ #ifndef ATOMIC_PTR_CAS
165
+ # if SIZEOF_VOIDP == SIZEOF_SIZE_T
166
+ # define ATOMIC_PTR_CAS(var, oldval, val) (void *)ATOMIC_SIZE_CAS(*(size_t *)&(var), (size_t)(oldval), (size_t)(val))
167
+ # endif
168
+ #endif
169
+
170
+ #endif /* RUBY_ATOMIC_H */
@@ -0,0 +1,48 @@
1
+ #ifndef SIPHASH_H
2
+ #define SIPHASH_H 1
3
+ #include <stdlib.h>
4
+ #ifdef HAVE_STDINT_H
5
+ #include <stdint.h>
6
+ #endif
7
+ #ifdef HAVE_INTTYPES_H
8
+ #include <inttypes.h>
9
+ #endif
10
+
11
+ #ifndef HAVE_UINT64_T
12
+ typedef struct {
13
+ uint32_t u32[2];
14
+ } sip_uint64_t;
15
+ #define uint64_t sip_uint64_t
16
+ #else
17
+ typedef uint64_t sip_uint64_t;
18
+ #endif
19
+
20
+ typedef struct {
21
+ int c;
22
+ int d;
23
+ uint64_t v[4];
24
+ uint8_t buf[sizeof(uint64_t)];
25
+ uint8_t buflen;
26
+ uint8_t msglen_byte;
27
+ } sip_state;
28
+
29
+ typedef struct sip_interface_st sip_interface;
30
+
31
+ typedef struct {
32
+ sip_state state[1];
33
+ const sip_interface *methods;
34
+ } sip_hash;
35
+
36
+ sip_hash *sip_hash_new(const uint8_t key[16], int c, int d);
37
+ sip_hash *sip_hash_init(sip_hash *h, const uint8_t key[16], int c, int d);
38
+ int sip_hash_update(sip_hash *h, const uint8_t *data, size_t len);
39
+ int sip_hash_final(sip_hash *h, uint8_t **digest, size_t *len);
40
+ int sip_hash_final_integer(sip_hash *h, uint64_t *digest);
41
+ int sip_hash_digest(sip_hash *h, const uint8_t *data, size_t data_len, uint8_t **digest, size_t *digest_len);
42
+ int sip_hash_digest_integer(sip_hash *h, const uint8_t *data, size_t data_len, uint64_t *digest);
43
+ void sip_hash_free(sip_hash *h);
44
+ void sip_hash_dump(sip_hash *h);
45
+
46
+ uint64_t sip_hash24(const uint8_t key[16], const uint8_t *data, size_t len);
47
+
48
+ #endif
@@ -0,0 +1,87 @@
1
+ /**********************************************************************
2
+
3
+ symbol.h -
4
+
5
+ $Author$
6
+ created at: Tue Jul 8 15:49:54 JST 2014
7
+
8
+ Copyright (C) 2014 Yukihiro Matsumoto
9
+
10
+ **********************************************************************/
11
+
12
+ #ifndef RUBY_SYMBOL_H
13
+ #define RUBY_SYMBOL_H 1
14
+
15
+ #include "id.h"
16
+
17
+ #define DYNAMIC_ID_P(id) (!(id&ID_STATIC_SYM)&&id>tLAST_OP_ID)
18
+ #define STATIC_ID2SYM(id) (((VALUE)(id)<<RUBY_SPECIAL_SHIFT)|SYMBOL_FLAG)
19
+
20
+ #ifdef __GNUC__
21
+ #define rb_id2sym(id) \
22
+ __extension__(__builtin_constant_p(id) && !DYNAMIC_ID_P(id) ? \
23
+ STATIC_ID2SYM(id) : rb_id2sym(id))
24
+ #endif
25
+
26
+ struct RSymbol {
27
+ struct RBasic basic;
28
+ VALUE fstr;
29
+ ID id;
30
+ };
31
+
32
+ #define RSYMBOL(obj) (R_CAST(RSymbol)(obj))
33
+
34
+ static inline int
35
+ id_type(ID id)
36
+ {
37
+ if (id<=tLAST_OP_ID) {
38
+ return -1;
39
+ }
40
+ return (int)(id&ID_SCOPE_MASK);
41
+ }
42
+
43
+ #define is_notop_id(id) ((id)>tLAST_OP_ID)
44
+ #define is_local_id(id) (id_type(id)==ID_LOCAL)
45
+ #define is_global_id(id) (id_type(id)==ID_GLOBAL)
46
+ #define is_instance_id(id) (id_type(id)==ID_INSTANCE)
47
+ #define is_attrset_id(id) (id_type(id)==ID_ATTRSET)
48
+ #define is_const_id(id) (id_type(id)==ID_CONST)
49
+ #define is_class_id(id) (id_type(id)==ID_CLASS)
50
+ #define is_junk_id(id) (id_type(id)==ID_JUNK)
51
+
52
+ static inline int
53
+ sym_type(VALUE sym)
54
+ {
55
+ ID id;
56
+ if (STATIC_SYM_P(sym)) {
57
+ id = RSHIFT(sym, RUBY_SPECIAL_SHIFT);
58
+ if (id<=tLAST_OP_ID) {
59
+ return -1;
60
+ }
61
+ }
62
+ else {
63
+ id = RSYMBOL(sym)->id;
64
+ }
65
+ return (int)(id&ID_SCOPE_MASK);
66
+ }
67
+
68
+ #define is_local_sym(sym) (sym_type(sym)==ID_LOCAL)
69
+ #define is_global_sym(sym) (sym_type(sym)==ID_GLOBAL)
70
+ #define is_instance_sym(sym) (sym_type(sym)==ID_INSTANCE)
71
+ #define is_attrset_sym(sym) (sym_type(sym)==ID_ATTRSET)
72
+ #define is_const_sym(sym) (sym_type(sym)==ID_CONST)
73
+ #define is_class_sym(sym) (sym_type(sym)==ID_CLASS)
74
+ #define is_junk_sym(sym) (sym_type(sym)==ID_JUNK)
75
+
76
+ RUBY_FUNC_EXPORTED const unsigned int ruby_global_name_punct_bits[(0x7e - 0x20 + 31) / 32];
77
+
78
+ static inline int
79
+ is_global_name_punct(const int c)
80
+ {
81
+ if (c <= 0x20 || 0x7e < c) return 0;
82
+ return (ruby_global_name_punct_bits[(c - 0x20) / 32] >> (c % 32)) & 1;
83
+ }
84
+
85
+ ID rb_intern_cstr_without_pindown(const char *, long, rb_encoding *);
86
+
87
+ #endif