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,83 @@
1
+ /* -*-c-*- *********************************************************/
2
+ /*******************************************************************/
3
+ /*******************************************************************/
4
+ /**
5
+ This file is for threaded code.
6
+
7
+ ----
8
+ This file is auto generated by insns2vm.rb
9
+ DO NOT TOUCH!
10
+
11
+ If you want to fix something, you must edit 'template/optinsn.inc.tmpl'
12
+ or tool/insns2vm.rb
13
+ */
14
+
15
+ static INSN *
16
+ insn_operands_unification(INSN *insnobj){
17
+ #ifdef OPT_OPERANDS_UNIFICATION
18
+ /* optimize rule */
19
+ switch(insnobj->insn_id){
20
+
21
+ case BIN(getlocal):
22
+ if(
23
+ insnobj->operands[1] == INT2FIX(0)
24
+ ){
25
+ insnobj->insn_id = BIN(getlocal_OP__WC__0);
26
+ insnobj->operand_size = 1;
27
+ break;
28
+ }
29
+
30
+ if(
31
+ insnobj->operands[1] == INT2FIX(1)
32
+ ){
33
+ insnobj->insn_id = BIN(getlocal_OP__WC__1);
34
+ insnobj->operand_size = 1;
35
+ break;
36
+ }
37
+
38
+ break;
39
+ case BIN(setlocal):
40
+ if(
41
+ insnobj->operands[1] == INT2FIX(0)
42
+ ){
43
+ insnobj->insn_id = BIN(setlocal_OP__WC__0);
44
+ insnobj->operand_size = 1;
45
+ break;
46
+ }
47
+
48
+ if(
49
+ insnobj->operands[1] == INT2FIX(1)
50
+ ){
51
+ insnobj->insn_id = BIN(setlocal_OP__WC__1);
52
+ insnobj->operand_size = 1;
53
+ break;
54
+ }
55
+
56
+ break;
57
+ case BIN(putobject):
58
+ if(
59
+ insnobj->operands[0] == INT2FIX(0)
60
+ ){
61
+ insnobj->insn_id = BIN(putobject_OP_INT2FIX_O_0_C_);
62
+ insnobj->operand_size = 0;
63
+ break;
64
+ }
65
+
66
+ if(
67
+ insnobj->operands[0] == INT2FIX(1)
68
+ ){
69
+ insnobj->insn_id = BIN(putobject_OP_INT2FIX_O_1_C_);
70
+ insnobj->operand_size = 0;
71
+ break;
72
+ }
73
+
74
+ break;
75
+
76
+ default:
77
+ /* do nothing */;
78
+ break;
79
+ }
80
+ #endif
81
+ return insnobj;
82
+ }
83
+
@@ -0,0 +1,124 @@
1
+ /* -*-c-*- *********************************************************/
2
+ /*******************************************************************/
3
+ /*******************************************************************/
4
+ /**
5
+ This file is for threaded code.
6
+
7
+ ----
8
+ This file is auto generated by insns2vm.rb
9
+ DO NOT TOUCH!
10
+
11
+ If you want to fix something, you must edit 'template/optunifs.inc.tmpl'
12
+ or tool/insns2vm.rb
13
+ */
14
+
15
+ /*
16
+ static const int UNIFIED_insn_name_1[] = {id, size, ...};
17
+ static const int UNIFIED_insn_name_2[] = {id, size, ...};
18
+ ...
19
+
20
+ static const int *const UNIFIED_insn_name[] = {size,
21
+ UNIFIED_insn_name_1,
22
+ UNIFIED_insn_name_2, ...};
23
+ ...
24
+
25
+ static const int *const *const unified_insns_data[] = {
26
+ UNIFIED_insn_nameA,
27
+ UNIFIED_insn_nameB, ...};
28
+ */
29
+
30
+
31
+
32
+ static const int *const *const unified_insns_data[] = {
33
+ 0,
34
+ 0,
35
+ 0,
36
+ 0,
37
+ 0,
38
+ 0,
39
+ 0,
40
+ 0,
41
+ 0,
42
+ 0,
43
+ 0,
44
+ 0,
45
+ 0,
46
+ 0,
47
+ 0,
48
+ 0,
49
+ 0,
50
+ 0,
51
+ 0,
52
+ 0,
53
+ 0,
54
+ 0,
55
+ 0,
56
+ 0,
57
+ 0,
58
+ 0,
59
+ 0,
60
+ 0,
61
+ 0,
62
+ 0,
63
+ 0,
64
+ 0,
65
+ 0,
66
+ 0,
67
+ 0,
68
+ 0,
69
+ 0,
70
+ 0,
71
+ 0,
72
+ 0,
73
+ 0,
74
+ 0,
75
+ 0,
76
+ 0,
77
+ 0,
78
+ 0,
79
+ 0,
80
+ 0,
81
+ 0,
82
+ 0,
83
+ 0,
84
+ 0,
85
+ 0,
86
+ 0,
87
+ 0,
88
+ 0,
89
+ 0,
90
+ 0,
91
+ 0,
92
+ 0,
93
+ 0,
94
+ 0,
95
+ 0,
96
+ 0,
97
+ 0,
98
+ 0,
99
+ 0,
100
+ 0,
101
+ 0,
102
+ 0,
103
+ 0,
104
+ 0,
105
+ 0,
106
+ 0,
107
+ 0,
108
+ 0,
109
+ 0,
110
+ 0,
111
+ 0,
112
+ 0,
113
+ 0,
114
+ 0,
115
+ 0,
116
+ 0,
117
+ 0,
118
+ 0,
119
+ 0,
120
+ 0};
121
+
122
+
123
+ #undef GET_INSN_NAME
124
+
@@ -0,0 +1,203 @@
1
+ /* A Bison parser, made by GNU Bison 2.7.12-4996. */
2
+
3
+ /* Bison interface for Yacc-like parsers in C
4
+
5
+ Copyright (C) 1984, 1989-1990, 2000-2013 Free Software Foundation, Inc.
6
+
7
+ This program is free software: you can redistribute it and/or modify
8
+ it under the terms of the GNU General Public License as published by
9
+ the Free Software Foundation, either version 3 of the License, or
10
+ (at your option) any later version.
11
+
12
+ This program is distributed in the hope that it will be useful,
13
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
14
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
+ GNU General Public License for more details.
16
+
17
+ You should have received a copy of the GNU General Public License
18
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
19
+
20
+ /* As a special exception, you may create a larger work that contains
21
+ part or all of the Bison parser skeleton and distribute that work
22
+ under terms of your choice, so long as that work isn't itself a
23
+ parser generator using the skeleton or a modified version thereof
24
+ as a parser skeleton. Alternatively, if you modify or redistribute
25
+ the parser skeleton itself, you may (at your option) remove this
26
+ special exception, which will cause the skeleton and the resulting
27
+ Bison output files to be licensed under the GNU General Public
28
+ License without this special exception.
29
+
30
+ This special exception was added by the Free Software Foundation in
31
+ version 2.2 of Bison. */
32
+
33
+ #ifndef YY_YY_Y_TAB_H_INCLUDED
34
+ # define YY_YY_Y_TAB_H_INCLUDED
35
+ /* Enabling traces. */
36
+ #ifndef YYDEBUG
37
+ # define YYDEBUG 0
38
+ #endif
39
+ #if YYDEBUG
40
+ extern int yydebug;
41
+ #endif
42
+
43
+ /* Tokens. */
44
+ #ifndef YYTOKENTYPE
45
+ # define YYTOKENTYPE
46
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
47
+ know about them. */
48
+ enum yytokentype {
49
+ END_OF_INPUT = 0,
50
+ keyword_class = 258,
51
+ keyword_module = 259,
52
+ keyword_def = 260,
53
+ keyword_undef = 261,
54
+ keyword_begin = 262,
55
+ keyword_rescue = 263,
56
+ keyword_ensure = 264,
57
+ keyword_end = 265,
58
+ keyword_if = 266,
59
+ keyword_unless = 267,
60
+ keyword_then = 268,
61
+ keyword_elsif = 269,
62
+ keyword_else = 270,
63
+ keyword_case = 271,
64
+ keyword_when = 272,
65
+ keyword_while = 273,
66
+ keyword_until = 274,
67
+ keyword_for = 275,
68
+ keyword_break = 276,
69
+ keyword_next = 277,
70
+ keyword_redo = 278,
71
+ keyword_retry = 279,
72
+ keyword_in = 280,
73
+ keyword_do = 281,
74
+ keyword_do_cond = 282,
75
+ keyword_do_block = 283,
76
+ keyword_do_LAMBDA = 284,
77
+ keyword_return = 285,
78
+ keyword_yield = 286,
79
+ keyword_super = 287,
80
+ keyword_self = 288,
81
+ keyword_nil = 289,
82
+ keyword_true = 290,
83
+ keyword_false = 291,
84
+ keyword_and = 292,
85
+ keyword_or = 293,
86
+ keyword_not = 294,
87
+ modifier_if = 295,
88
+ modifier_unless = 296,
89
+ modifier_while = 297,
90
+ modifier_until = 298,
91
+ modifier_rescue = 299,
92
+ keyword_alias = 300,
93
+ keyword_defined = 301,
94
+ keyword_BEGIN = 302,
95
+ keyword_END = 303,
96
+ keyword__LINE__ = 304,
97
+ keyword__FILE__ = 305,
98
+ keyword__ENCODING__ = 306,
99
+ tIDENTIFIER = 307,
100
+ tFID = 308,
101
+ tGVAR = 309,
102
+ tIVAR = 310,
103
+ tCONSTANT = 311,
104
+ tCVAR = 312,
105
+ tLABEL = 313,
106
+ tINTEGER = 314,
107
+ tFLOAT = 315,
108
+ tRATIONAL = 316,
109
+ tIMAGINARY = 317,
110
+ tSTRING_CONTENT = 318,
111
+ tCHAR = 319,
112
+ tNTH_REF = 320,
113
+ tBACK_REF = 321,
114
+ tREGEXP_END = 322,
115
+ tUPLUS = 130,
116
+ tUMINUS = 131,
117
+ tPOW = 132,
118
+ tCMP = 134,
119
+ tEQ = 139,
120
+ tEQQ = 140,
121
+ tNEQ = 141,
122
+ tGEQ = 138,
123
+ tLEQ = 137,
124
+ tANDOP = 148,
125
+ tOROP = 149,
126
+ tMATCH = 142,
127
+ tNMATCH = 143,
128
+ tDOT2 = 128,
129
+ tDOT3 = 129,
130
+ tAREF = 144,
131
+ tASET = 145,
132
+ tLSHFT = 135,
133
+ tRSHFT = 136,
134
+ tCOLON2 = 323,
135
+ tCOLON3 = 324,
136
+ tOP_ASGN = 325,
137
+ tASSOC = 326,
138
+ tLPAREN = 327,
139
+ tLPAREN_ARG = 328,
140
+ tRPAREN = 329,
141
+ tLBRACK = 330,
142
+ tLBRACE = 331,
143
+ tLBRACE_ARG = 332,
144
+ tSTAR = 333,
145
+ tDSTAR = 334,
146
+ tAMPER = 335,
147
+ tLAMBDA = 336,
148
+ tSYMBEG = 337,
149
+ tSTRING_BEG = 338,
150
+ tXSTRING_BEG = 339,
151
+ tREGEXP_BEG = 340,
152
+ tWORDS_BEG = 341,
153
+ tQWORDS_BEG = 342,
154
+ tSYMBOLS_BEG = 343,
155
+ tQSYMBOLS_BEG = 344,
156
+ tSTRING_DBEG = 345,
157
+ tSTRING_DEND = 346,
158
+ tSTRING_DVAR = 347,
159
+ tSTRING_END = 348,
160
+ tLAMBEG = 349,
161
+ tLABEL_END = 350,
162
+ tLOWEST = 351,
163
+ tUMINUS_NUM = 352,
164
+ tLAST_TOKEN = 353
165
+ };
166
+ #endif
167
+
168
+
169
+ #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
170
+ typedef union YYSTYPE
171
+ {
172
+ /* Line 2053 of yacc.c */
173
+
174
+ VALUE val;
175
+ NODE *node;
176
+ ID id;
177
+ int num;
178
+ const struct vtable *vars;
179
+
180
+
181
+ /* Line 2053 of yacc.c */
182
+ } YYSTYPE;
183
+ # define YYSTYPE_IS_TRIVIAL 1
184
+ # define yystype YYSTYPE /* obsolescent; will be withdrawn */
185
+ # define YYSTYPE_IS_DECLARED 1
186
+ #endif
187
+
188
+
189
+ #ifdef YYPARSE_PARAM
190
+ #if defined __STDC__ || defined __cplusplus
191
+ int yyparse (void *YYPARSE_PARAM);
192
+ #else
193
+ int yyparse ();
194
+ #endif
195
+ #else /* ! YYPARSE_PARAM */
196
+ #if defined __STDC__ || defined __cplusplus
197
+ int yyparse (struct parser_params *parser);
198
+ #else
199
+ int yyparse ();
200
+ #endif
201
+ #endif /* ! YYPARSE_PARAM */
202
+
203
+ #endif /* !YY_YY_Y_TAB_H_INCLUDED */
@@ -0,0 +1,67 @@
1
+ #ifndef RUBY_PROBES_HELPER_H
2
+ #define RUBY_PROBES_HELPER_H
3
+
4
+ #include "ruby/ruby.h"
5
+ #include "probes.h"
6
+
7
+ VALUE rb_class_path_no_cache(VALUE _klass);
8
+
9
+ #define RUBY_DTRACE_HOOK(name, th, klazz, id) \
10
+ do { \
11
+ if (RUBY_DTRACE_##name##_ENABLED()) { \
12
+ VALUE _klass = (klazz); \
13
+ ID _id = (id); \
14
+ const char * classname; \
15
+ const char * methodname; \
16
+ const char * filename; \
17
+ if (!_klass) { \
18
+ rb_thread_method_id_and_class((th), &_id, &_klass); \
19
+ } \
20
+ if (_klass) { \
21
+ if (RB_TYPE_P(_klass, T_ICLASS)) { \
22
+ _klass = RBASIC(_klass)->klass; \
23
+ } \
24
+ else if (FL_TEST(_klass, FL_SINGLETON)) { \
25
+ _klass = rb_iv_get(_klass, "__attached__"); \
26
+ } \
27
+ switch (TYPE(_klass)) { \
28
+ case T_CLASS: \
29
+ case T_ICLASS: \
30
+ case T_MODULE: \
31
+ { \
32
+ VALUE _name = rb_class_path_no_cache(_klass); \
33
+ if (!NIL_P(_name)) { \
34
+ classname = StringValuePtr(_name); \
35
+ } \
36
+ else { \
37
+ classname = "<unknown>"; \
38
+ } \
39
+ methodname = rb_id2name(_id); \
40
+ filename = rb_sourcefile(); \
41
+ if (classname && methodname && filename) { \
42
+ RUBY_DTRACE_##name( \
43
+ classname, \
44
+ methodname, \
45
+ filename, \
46
+ rb_sourceline()); \
47
+ } \
48
+ break; \
49
+ } \
50
+ } \
51
+ } \
52
+ } \
53
+ } while (0)
54
+
55
+ #define RUBY_DTRACE_METHOD_ENTRY_HOOK(th, klass, id) \
56
+ RUBY_DTRACE_HOOK(METHOD_ENTRY, th, klass, id)
57
+
58
+ #define RUBY_DTRACE_METHOD_RETURN_HOOK(th, klass, id) \
59
+ RUBY_DTRACE_HOOK(METHOD_RETURN, th, klass, id)
60
+
61
+ #define RUBY_DTRACE_CMETHOD_ENTRY_HOOK(th, klass, id) \
62
+ RUBY_DTRACE_HOOK(CMETHOD_ENTRY, th, klass, id)
63
+
64
+ #define RUBY_DTRACE_CMETHOD_RETURN_HOOK(th, klass, id) \
65
+ RUBY_DTRACE_HOOK(CMETHOD_RETURN, th, klass, id)
66
+
67
+ #endif /* RUBY_PROBES_HELPER_H */
@@ -0,0 +1,234 @@
1
+ #ifndef ONIGURUMA_REGENC_H
2
+ #define ONIGURUMA_REGENC_H
3
+ /**********************************************************************
4
+ regenc.h - Onigmo (Oniguruma-mod) (regular expression library)
5
+ **********************************************************************/
6
+ /*-
7
+ * Copyright (c) 2002-2008 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
+ #ifndef REGINT_H
34
+ #ifndef RUBY_EXTERN
35
+ #include "ruby/config.h"
36
+ #include "ruby/defines.h"
37
+ #endif
38
+ #endif
39
+
40
+ #ifdef ONIG_ESCAPE_UCHAR_COLLISION
41
+ #undef ONIG_ESCAPE_UCHAR_COLLISION
42
+ #endif
43
+
44
+ #include "ruby/oniguruma.h"
45
+
46
+ RUBY_SYMBOL_EXPORT_BEGIN
47
+
48
+ typedef struct {
49
+ OnigCodePoint from;
50
+ OnigCodePoint to;
51
+ } OnigPairCaseFoldCodes;
52
+
53
+
54
+ #ifndef NULL
55
+ #define NULL ((void* )0)
56
+ #endif
57
+
58
+ #ifndef TRUE
59
+ #define TRUE 1
60
+ #endif
61
+
62
+ #ifndef FALSE
63
+ #define FALSE 0
64
+ #endif
65
+
66
+ #ifndef ARG_UNUSED
67
+ #if defined(__GNUC__)
68
+ # define ARG_UNUSED __attribute__ ((unused))
69
+ #else
70
+ # define ARG_UNUSED
71
+ #endif
72
+ #endif
73
+
74
+ #define ONIG_IS_NULL(p) (((void*)(p)) == (void*)0)
75
+ #define ONIG_IS_NOT_NULL(p) (((void*)(p)) != (void*)0)
76
+ #define ONIG_CHECK_NULL_RETURN(p) if (ONIG_IS_NULL(p)) return NULL
77
+ #define ONIG_CHECK_NULL_RETURN_VAL(p,val) if (ONIG_IS_NULL(p)) return (val)
78
+
79
+ #define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e))
80
+
81
+ /* character types bit flag */
82
+ #define BIT_CTYPE_NEWLINE (1<< ONIGENC_CTYPE_NEWLINE)
83
+ #define BIT_CTYPE_ALPHA (1<< ONIGENC_CTYPE_ALPHA)
84
+ #define BIT_CTYPE_BLANK (1<< ONIGENC_CTYPE_BLANK)
85
+ #define BIT_CTYPE_CNTRL (1<< ONIGENC_CTYPE_CNTRL)
86
+ #define BIT_CTYPE_DIGIT (1<< ONIGENC_CTYPE_DIGIT)
87
+ #define BIT_CTYPE_GRAPH (1<< ONIGENC_CTYPE_GRAPH)
88
+ #define BIT_CTYPE_LOWER (1<< ONIGENC_CTYPE_LOWER)
89
+ #define BIT_CTYPE_PRINT (1<< ONIGENC_CTYPE_PRINT)
90
+ #define BIT_CTYPE_PUNCT (1<< ONIGENC_CTYPE_PUNCT)
91
+ #define BIT_CTYPE_SPACE (1<< ONIGENC_CTYPE_SPACE)
92
+ #define BIT_CTYPE_UPPER (1<< ONIGENC_CTYPE_UPPER)
93
+ #define BIT_CTYPE_XDIGIT (1<< ONIGENC_CTYPE_XDIGIT)
94
+ #define BIT_CTYPE_WORD (1<< ONIGENC_CTYPE_WORD)
95
+ #define BIT_CTYPE_ALNUM (1<< ONIGENC_CTYPE_ALNUM)
96
+ #define BIT_CTYPE_ASCII (1<< ONIGENC_CTYPE_ASCII)
97
+
98
+ #define CTYPE_TO_BIT(ctype) (1<<(ctype))
99
+ #define CTYPE_IS_WORD_GRAPH_PRINT(ctype) \
100
+ ((ctype) == ONIGENC_CTYPE_WORD || (ctype) == ONIGENC_CTYPE_GRAPH ||\
101
+ (ctype) == ONIGENC_CTYPE_PRINT)
102
+
103
+
104
+ typedef struct {
105
+ short int len;
106
+ const UChar name[6];
107
+ int ctype;
108
+ } PosixBracketEntryType;
109
+
110
+ #define POSIX_BRACKET_ENTRY_INIT(name, ctype) \
111
+ {(short int )(sizeof(name) - 1), (name), (ctype)}
112
+
113
+ #ifndef numberof
114
+ #define numberof(array) (int )(sizeof(array) / sizeof((array)[0]))
115
+ #endif
116
+
117
+
118
+ #define USE_CRNL_AS_LINE_TERMINATOR
119
+ #define USE_UNICODE_PROPERTIES
120
+ #define USE_UNICODE_AGE_PROPERTIES
121
+ /* #define USE_UNICODE_CASE_FOLD_TURKISH_AZERI */
122
+ /* #define USE_UNICODE_ALL_LINE_TERMINATORS */ /* see Unicode.org UTS #18 */
123
+
124
+
125
+ #define ONIG_ENCODING_INIT_DEFAULT ONIG_ENCODING_ASCII
126
+
127
+ /* for encoding system implementation (internal) */
128
+ ONIG_EXTERN int onigenc_ascii_apply_all_case_fold P_((OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc));
129
+ ONIG_EXTERN int onigenc_ascii_get_case_fold_codes_by_str P_((OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[], OnigEncoding enc));
130
+ ONIG_EXTERN int onigenc_apply_all_case_fold_with_map P_((int map_size, const OnigPairCaseFoldCodes map[], int ess_tsett_flag, OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg));
131
+ ONIG_EXTERN int onigenc_get_case_fold_codes_by_str_with_map P_((int map_size, const OnigPairCaseFoldCodes map[], int ess_tsett_flag, OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[]));
132
+ ONIG_EXTERN int onigenc_not_support_get_ctype_code_range P_((OnigCtype ctype, OnigCodePoint* sb_out, const OnigCodePoint* ranges[], OnigEncoding enc));
133
+ ONIG_EXTERN int onigenc_is_mbc_newline_0x0a P_((const UChar* p, const UChar* end, OnigEncoding enc));
134
+
135
+
136
+ /* methods for single byte encoding */
137
+ ONIG_EXTERN int onigenc_ascii_mbc_case_fold P_((OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower, OnigEncoding enc));
138
+ ONIG_EXTERN int onigenc_single_byte_mbc_enc_len P_((const UChar* p, const UChar* e, OnigEncoding enc));
139
+ ONIG_EXTERN OnigCodePoint onigenc_single_byte_mbc_to_code P_((const UChar* p, const UChar* end, OnigEncoding enc));
140
+ ONIG_EXTERN int onigenc_single_byte_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
141
+ ONIG_EXTERN int onigenc_single_byte_code_to_mbc P_((OnigCodePoint code, UChar *buf, OnigEncoding enc));
142
+ ONIG_EXTERN UChar* onigenc_single_byte_left_adjust_char_head P_((const UChar* start, const UChar* s, const OnigUChar* end, OnigEncoding enc));
143
+ ONIG_EXTERN int onigenc_always_true_is_allowed_reverse_match P_((const UChar* s, const UChar* end, OnigEncoding enc));
144
+ ONIG_EXTERN int onigenc_always_false_is_allowed_reverse_match P_((const UChar* s, const UChar* end, OnigEncoding enc));
145
+ ONIG_EXTERN int onigenc_ascii_is_code_ctype P_((OnigCodePoint code, unsigned int ctype, OnigEncoding enc));
146
+
147
+ /* methods for multi byte encoding */
148
+ ONIG_EXTERN OnigCodePoint onigenc_mbn_mbc_to_code P_((OnigEncoding enc, const UChar* p, const UChar* end));
149
+ ONIG_EXTERN int onigenc_mbn_mbc_case_fold P_((OnigEncoding enc, OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower));
150
+ ONIG_EXTERN int onigenc_mb2_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
151
+ ONIG_EXTERN int onigenc_mb2_code_to_mbc P_((OnigEncoding enc, OnigCodePoint code, UChar *buf));
152
+ ONIG_EXTERN int onigenc_minimum_property_name_to_ctype P_((OnigEncoding enc, UChar* p, UChar* end));
153
+ ONIG_EXTERN int onigenc_unicode_property_name_to_ctype P_((OnigEncoding enc, UChar* p, UChar* end));
154
+ ONIG_EXTERN int onigenc_mb2_is_code_ctype P_((OnigEncoding enc, OnigCodePoint code, unsigned int ctype));
155
+ ONIG_EXTERN int onigenc_mb4_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
156
+ ONIG_EXTERN int onigenc_mb4_code_to_mbc P_((OnigEncoding enc, OnigCodePoint code, UChar *buf));
157
+ ONIG_EXTERN int onigenc_mb4_is_code_ctype P_((OnigEncoding enc, OnigCodePoint code, unsigned int ctype));
158
+
159
+
160
+ /* in enc/unicode.c */
161
+ ONIG_EXTERN int onigenc_unicode_is_code_ctype P_((OnigCodePoint code, unsigned int ctype, OnigEncoding enc));
162
+ ONIG_EXTERN int onigenc_utf16_32_get_ctype_code_range P_((OnigCtype ctype, OnigCodePoint *sb_out, const OnigCodePoint* ranges[], OnigEncoding enc));
163
+ ONIG_EXTERN int onigenc_unicode_ctype_code_range P_((int ctype, const OnigCodePoint* ranges[]));
164
+ ONIG_EXTERN int onigenc_unicode_get_case_fold_codes_by_str P_((OnigEncoding enc, OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[]));
165
+ ONIG_EXTERN int onigenc_unicode_mbc_case_fold P_((OnigEncoding enc, OnigCaseFoldType flag, const UChar** pp, const UChar* end, UChar* fold));
166
+ ONIG_EXTERN int onigenc_unicode_apply_all_case_fold P_((OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc));
167
+
168
+
169
+ #define UTF16_IS_SURROGATE_FIRST(c) (((c) & 0xfc) == 0xd8)
170
+ #define UTF16_IS_SURROGATE_SECOND(c) (((c) & 0xfc) == 0xdc)
171
+ #define UTF16_IS_SURROGATE(c) (((c) & 0xf8) == 0xd8)
172
+
173
+ #define ONIGENC_ISO_8859_1_TO_LOWER_CASE(c) \
174
+ OnigEncISO_8859_1_ToLowerCaseTable[c]
175
+ #define ONIGENC_ISO_8859_1_TO_UPPER_CASE(c) \
176
+ OnigEncISO_8859_1_ToUpperCaseTable[c]
177
+
178
+ ONIG_EXTERN const UChar OnigEncISO_8859_1_ToLowerCaseTable[];
179
+ ONIG_EXTERN const UChar OnigEncISO_8859_1_ToUpperCaseTable[];
180
+
181
+ ONIG_EXTERN int
182
+ onigenc_with_ascii_strncmp P_((OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n));
183
+ ONIG_EXTERN int
184
+ onigenc_with_ascii_strnicmp P_((OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n));
185
+ ONIG_EXTERN UChar*
186
+ onigenc_step P_((OnigEncoding enc, const UChar* p, const UChar* end, int n));
187
+
188
+ /* defined in regexec.c, but used in enc/xxx.c */
189
+ extern int onig_is_in_code_range P_((const UChar* p, OnigCodePoint code));
190
+
191
+ ONIG_EXTERN OnigEncoding OnigEncDefaultCharEncoding;
192
+ ONIG_EXTERN const UChar OnigEncAsciiToLowerCaseTable[];
193
+ ONIG_EXTERN const UChar OnigEncAsciiToUpperCaseTable[];
194
+ ONIG_EXTERN const unsigned short OnigEncAsciiCtypeTable[];
195
+
196
+ #define ONIGENC_IS_ASCII_CODE(code) ((code) < 0x80)
197
+ #define ONIGENC_ASCII_CODE_TO_LOWER_CASE(c) OnigEncAsciiToLowerCaseTable[c]
198
+ #define ONIGENC_ASCII_CODE_TO_UPPER_CASE(c) OnigEncAsciiToUpperCaseTable[c]
199
+ #define ONIGENC_IS_ASCII_CODE_CTYPE(code,ctype) \
200
+ ((OnigEncAsciiCtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0)
201
+ #define ONIGENC_IS_ASCII_CODE_CASE_AMBIG(code) \
202
+ (ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_UPPER) ||\
203
+ ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_LOWER))
204
+
205
+ /* Check if the code is in the range. (from <= code && code <= to) */
206
+ #define ONIGENC_IS_IN_RANGE(code, from, to) \
207
+ ((OnigCodePoint )((code) - (from)) <= (OnigCodePoint )((to) - (from)))
208
+
209
+
210
+ #ifdef ONIG_ENC_REGISTER
211
+ extern int ONIG_ENC_REGISTER(const char *, OnigEncoding);
212
+ #define OnigEncodingName(n) encoding_##n
213
+ #define OnigEncodingDeclare(n) static const OnigEncodingType OnigEncodingName(n)
214
+ #define OnigEncodingDefine(f,n) \
215
+ OnigEncodingDeclare(n); \
216
+ void Init_##f(void) { \
217
+ ONIG_ENC_REGISTER(OnigEncodingName(n).name, \
218
+ &OnigEncodingName(n)); \
219
+ } \
220
+ OnigEncodingDeclare(n)
221
+ #else
222
+ #define OnigEncodingName(n) OnigEncoding##n
223
+ #define OnigEncodingDeclare(n) const OnigEncodingType OnigEncodingName(n)
224
+ #define OnigEncodingDefine(f,n) OnigEncodingDeclare(n)
225
+ #endif
226
+
227
+ /* macros for define replica encoding and encoding alias */
228
+ #define ENC_REPLICATE(name, orig)
229
+ #define ENC_ALIAS(name, orig)
230
+ #define ENC_DUMMY(name)
231
+
232
+ RUBY_SYMBOL_EXPORT_END
233
+
234
+ #endif /* ONIGURUMA_REGENC_H */