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.
- checksums.yaml +4 -4
- data/CHANGELOG.md +5 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/addr2line.h +21 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/build_assert/build_assert.h +40 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/check_type/check_type.h +63 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/container_of/container_of.h +142 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/list/list.h +773 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ccan/str/str.h +16 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/constant.h +51 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/debug_counter.h +109 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/dln.h +51 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/encindex.h +69 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/eval_intern.h +334 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/gc.h +116 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/id.h +250 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/id_table.h +31 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/insns.inc +217 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/insns_info.inc +1570 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/internal.h +2036 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/iseq.h +307 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/known_errors.inc +746 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/method.h +218 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/node.h +540 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/node_name.inc +198 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/opt_sc.inc +1601 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/optinsn.inc +103 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/optunifs.inc +61 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/parse.h +206 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/probes_helper.h +43 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regenc.h +254 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regint.h +938 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/regparse.h +370 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/revision.h +1 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ruby_assert.h +54 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/ruby_atomic.h +233 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/siphash.h +48 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/symbol.h +108 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/thread_pthread.h +54 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/thread_win32.h +36 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/timev.h +42 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/transcode_data.h +139 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/version.h +73 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm.inc +3667 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_call_iseq_optimized.inc +213 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_core.h +1767 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_debug.h +37 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_exec.h +192 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_insnhelper.h +255 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vm_opts.h +56 -0
- data/lib/debase/ruby_core_source/ruby-2.5.1-p57/vmtc.inc +214 -0
- data/lib/debase/ruby_core_source/version.rb +1 -1
- metadata +51 -3
@@ -0,0 +1,103 @@
|
|
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
|
+
{
|
18
|
+
#ifdef OPT_OPERANDS_UNIFICATION
|
19
|
+
/* optimize rule */
|
20
|
+
switch(insnobj->insn_id){
|
21
|
+
case BIN(getlocal):
|
22
|
+
if (
|
23
|
+
insnobj->operands[1] == INT2FIX(0) &&
|
24
|
+
1) {
|
25
|
+
insnobj->insn_id = BIN(getlocal_OP__WC__0);
|
26
|
+
insnobj->operand_size = 1;
|
27
|
+
break;
|
28
|
+
}
|
29
|
+
if (
|
30
|
+
insnobj->operands[1] == INT2FIX(1) &&
|
31
|
+
1) {
|
32
|
+
insnobj->insn_id = BIN(getlocal_OP__WC__1);
|
33
|
+
insnobj->operand_size = 1;
|
34
|
+
break;
|
35
|
+
}
|
36
|
+
break;
|
37
|
+
case BIN(setlocal):
|
38
|
+
if (
|
39
|
+
insnobj->operands[1] == INT2FIX(0) &&
|
40
|
+
1) {
|
41
|
+
insnobj->insn_id = BIN(setlocal_OP__WC__0);
|
42
|
+
insnobj->operand_size = 1;
|
43
|
+
break;
|
44
|
+
}
|
45
|
+
if (
|
46
|
+
insnobj->operands[1] == INT2FIX(1) &&
|
47
|
+
1) {
|
48
|
+
insnobj->insn_id = BIN(setlocal_OP__WC__1);
|
49
|
+
insnobj->operand_size = 1;
|
50
|
+
break;
|
51
|
+
}
|
52
|
+
break;
|
53
|
+
case BIN(putobject):
|
54
|
+
if (
|
55
|
+
insnobj->operands[0] == INT2FIX(0) &&
|
56
|
+
1) {
|
57
|
+
insnobj->insn_id = BIN(putobject_OP_INT2FIX_O_0_C_);
|
58
|
+
insnobj->operand_size = 0;
|
59
|
+
break;
|
60
|
+
}
|
61
|
+
if (
|
62
|
+
insnobj->operands[0] == INT2FIX(1) &&
|
63
|
+
1) {
|
64
|
+
insnobj->insn_id = BIN(putobject_OP_INT2FIX_O_1_C_);
|
65
|
+
insnobj->operand_size = 0;
|
66
|
+
break;
|
67
|
+
}
|
68
|
+
break;
|
69
|
+
|
70
|
+
default:
|
71
|
+
/* do nothing */;
|
72
|
+
break;
|
73
|
+
}
|
74
|
+
#endif
|
75
|
+
return insnobj;
|
76
|
+
}
|
77
|
+
|
78
|
+
int
|
79
|
+
rb_insn_unified_local_var_level(VALUE insn)
|
80
|
+
{
|
81
|
+
#ifdef OPT_OPERANDS_UNIFICATION
|
82
|
+
/* optimize rule */
|
83
|
+
switch (insn) {
|
84
|
+
case BIN(getlocal_OP__WC__0):
|
85
|
+
return 0;
|
86
|
+
case BIN(getlocal_OP__WC__1):
|
87
|
+
return 1;
|
88
|
+
case BIN(setlocal_OP__WC__0):
|
89
|
+
return 0;
|
90
|
+
case BIN(setlocal_OP__WC__1):
|
91
|
+
return 1;
|
92
|
+
case BIN(putobject_OP_INT2FIX_O_0_C_):
|
93
|
+
return INT2FIX(0);
|
94
|
+
case BIN(putobject_OP_INT2FIX_O_1_C_):
|
95
|
+
return INT2FIX(1);
|
96
|
+
|
97
|
+
default:
|
98
|
+
/* do nothing */;
|
99
|
+
break;
|
100
|
+
}
|
101
|
+
#endif
|
102
|
+
return -1;
|
103
|
+
}
|
@@ -0,0 +1,61 @@
|
|
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
|
+
static const int *const *const unified_insns_data[] = {
|
32
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
33
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
34
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
35
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
36
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
37
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
38
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
39
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
40
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
41
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
42
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
43
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
44
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
45
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
46
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
47
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
48
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
49
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
50
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
51
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
52
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
53
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
54
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
55
|
+
0, 0, 0, 0, 0, 0, 0, 0,
|
56
|
+
0, 0, 0, 0,
|
57
|
+
};
|
58
|
+
|
59
|
+
#undef GET_INSN_NAME
|
60
|
+
|
61
|
+
ASSERT_VM_INSTRUCTION_SIZE(unified_insns_data);
|
@@ -0,0 +1,206 @@
|
|
1
|
+
/* A Bison parser, made by GNU Bison 3.0.4. */
|
2
|
+
|
3
|
+
/* Bison interface for Yacc-like parsers in C
|
4
|
+
|
5
|
+
Copyright (C) 1984, 1989-1990, 2000-2015 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
|
+
/* Debug traces. */
|
36
|
+
#ifndef YYDEBUG
|
37
|
+
# define YYDEBUG 0
|
38
|
+
#endif
|
39
|
+
#if YYDEBUG
|
40
|
+
extern int yydebug;
|
41
|
+
#endif
|
42
|
+
|
43
|
+
/* Token type. */
|
44
|
+
#ifndef YYTOKENTYPE
|
45
|
+
# define YYTOKENTYPE
|
46
|
+
enum yytokentype
|
47
|
+
{
|
48
|
+
END_OF_INPUT = 0,
|
49
|
+
keyword_class = 258,
|
50
|
+
keyword_module = 259,
|
51
|
+
keyword_def = 260,
|
52
|
+
keyword_undef = 261,
|
53
|
+
keyword_begin = 262,
|
54
|
+
keyword_rescue = 263,
|
55
|
+
keyword_ensure = 264,
|
56
|
+
keyword_end = 265,
|
57
|
+
keyword_if = 266,
|
58
|
+
keyword_unless = 267,
|
59
|
+
keyword_then = 268,
|
60
|
+
keyword_elsif = 269,
|
61
|
+
keyword_else = 270,
|
62
|
+
keyword_case = 271,
|
63
|
+
keyword_when = 272,
|
64
|
+
keyword_while = 273,
|
65
|
+
keyword_until = 274,
|
66
|
+
keyword_for = 275,
|
67
|
+
keyword_break = 276,
|
68
|
+
keyword_next = 277,
|
69
|
+
keyword_redo = 278,
|
70
|
+
keyword_retry = 279,
|
71
|
+
keyword_in = 280,
|
72
|
+
keyword_do = 281,
|
73
|
+
keyword_do_cond = 282,
|
74
|
+
keyword_do_block = 283,
|
75
|
+
keyword_do_LAMBDA = 284,
|
76
|
+
keyword_return = 285,
|
77
|
+
keyword_yield = 286,
|
78
|
+
keyword_super = 287,
|
79
|
+
keyword_self = 288,
|
80
|
+
keyword_nil = 289,
|
81
|
+
keyword_true = 290,
|
82
|
+
keyword_false = 291,
|
83
|
+
keyword_and = 292,
|
84
|
+
keyword_or = 293,
|
85
|
+
keyword_not = 294,
|
86
|
+
modifier_if = 295,
|
87
|
+
modifier_unless = 296,
|
88
|
+
modifier_while = 297,
|
89
|
+
modifier_until = 298,
|
90
|
+
modifier_rescue = 299,
|
91
|
+
keyword_alias = 300,
|
92
|
+
keyword_defined = 301,
|
93
|
+
keyword_BEGIN = 302,
|
94
|
+
keyword_END = 303,
|
95
|
+
keyword__LINE__ = 304,
|
96
|
+
keyword__FILE__ = 305,
|
97
|
+
keyword__ENCODING__ = 306,
|
98
|
+
tIDENTIFIER = 307,
|
99
|
+
tFID = 308,
|
100
|
+
tGVAR = 309,
|
101
|
+
tIVAR = 310,
|
102
|
+
tCONSTANT = 311,
|
103
|
+
tCVAR = 312,
|
104
|
+
tLABEL = 313,
|
105
|
+
tINTEGER = 314,
|
106
|
+
tFLOAT = 315,
|
107
|
+
tRATIONAL = 316,
|
108
|
+
tIMAGINARY = 317,
|
109
|
+
tSTRING_CONTENT = 318,
|
110
|
+
tCHAR = 319,
|
111
|
+
tNTH_REF = 320,
|
112
|
+
tBACK_REF = 321,
|
113
|
+
tREGEXP_END = 322,
|
114
|
+
tUPLUS = 130,
|
115
|
+
tUMINUS = 131,
|
116
|
+
tPOW = 132,
|
117
|
+
tCMP = 133,
|
118
|
+
tEQ = 138,
|
119
|
+
tEQQ = 139,
|
120
|
+
tNEQ = 140,
|
121
|
+
tGEQ = 137,
|
122
|
+
tLEQ = 136,
|
123
|
+
tANDOP = 146,
|
124
|
+
tOROP = 147,
|
125
|
+
tMATCH = 141,
|
126
|
+
tNMATCH = 142,
|
127
|
+
tDOT2 = 128,
|
128
|
+
tDOT3 = 129,
|
129
|
+
tAREF = 143,
|
130
|
+
tASET = 144,
|
131
|
+
tLSHFT = 134,
|
132
|
+
tRSHFT = 135,
|
133
|
+
tANDDOT = 148,
|
134
|
+
tCOLON2 = 145,
|
135
|
+
tCOLON3 = 323,
|
136
|
+
tOP_ASGN = 324,
|
137
|
+
tASSOC = 325,
|
138
|
+
tLPAREN = 326,
|
139
|
+
tLPAREN_ARG = 327,
|
140
|
+
tRPAREN = 328,
|
141
|
+
tLBRACK = 329,
|
142
|
+
tLBRACE = 330,
|
143
|
+
tLBRACE_ARG = 331,
|
144
|
+
tSTAR = 332,
|
145
|
+
tDSTAR = 333,
|
146
|
+
tAMPER = 334,
|
147
|
+
tLAMBDA = 335,
|
148
|
+
tSYMBEG = 336,
|
149
|
+
tSTRING_BEG = 337,
|
150
|
+
tXSTRING_BEG = 338,
|
151
|
+
tREGEXP_BEG = 339,
|
152
|
+
tWORDS_BEG = 340,
|
153
|
+
tQWORDS_BEG = 341,
|
154
|
+
tSYMBOLS_BEG = 342,
|
155
|
+
tQSYMBOLS_BEG = 343,
|
156
|
+
tSTRING_DBEG = 344,
|
157
|
+
tSTRING_DEND = 345,
|
158
|
+
tSTRING_DVAR = 346,
|
159
|
+
tSTRING_END = 347,
|
160
|
+
tLAMBEG = 348,
|
161
|
+
tLABEL_END = 349,
|
162
|
+
tLOWEST = 350,
|
163
|
+
tUMINUS_NUM = 351,
|
164
|
+
tLAST_TOKEN = 352
|
165
|
+
};
|
166
|
+
#endif
|
167
|
+
|
168
|
+
/* Value type. */
|
169
|
+
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
170
|
+
|
171
|
+
union YYSTYPE
|
172
|
+
{
|
173
|
+
|
174
|
+
VALUE val;
|
175
|
+
NODE *node;
|
176
|
+
ID id;
|
177
|
+
int num;
|
178
|
+
const struct vtable *vars;
|
179
|
+
struct rb_strterm_struct *strterm;
|
180
|
+
|
181
|
+
};
|
182
|
+
|
183
|
+
typedef union YYSTYPE YYSTYPE;
|
184
|
+
# define YYSTYPE_IS_TRIVIAL 1
|
185
|
+
# define YYSTYPE_IS_DECLARED 1
|
186
|
+
#endif
|
187
|
+
|
188
|
+
/* Location type. */
|
189
|
+
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
|
190
|
+
typedef struct YYLTYPE YYLTYPE;
|
191
|
+
struct YYLTYPE
|
192
|
+
{
|
193
|
+
int first_line;
|
194
|
+
int first_column;
|
195
|
+
int last_line;
|
196
|
+
int last_column;
|
197
|
+
};
|
198
|
+
# define YYLTYPE_IS_DECLARED 1
|
199
|
+
# define YYLTYPE_IS_TRIVIAL 1
|
200
|
+
#endif
|
201
|
+
|
202
|
+
|
203
|
+
|
204
|
+
int yyparse (struct parser_params *parser);
|
205
|
+
|
206
|
+
#endif /* !YY_YY_Y_TAB_H_INCLUDED */
|
@@ -0,0 +1,43 @@
|
|
1
|
+
#ifndef RUBY_PROBES_HELPER_H
|
2
|
+
#define RUBY_PROBES_HELPER_H
|
3
|
+
|
4
|
+
#include "ruby/ruby.h"
|
5
|
+
#include "probes.h"
|
6
|
+
|
7
|
+
struct ruby_dtrace_method_hook_args {
|
8
|
+
const char *classname;
|
9
|
+
const char *methodname;
|
10
|
+
const char *filename;
|
11
|
+
int line_no;
|
12
|
+
volatile VALUE klass;
|
13
|
+
volatile VALUE name;
|
14
|
+
};
|
15
|
+
|
16
|
+
NOINLINE(int rb_dtrace_setup(rb_execution_context_t *, VALUE, ID, struct ruby_dtrace_method_hook_args *));
|
17
|
+
|
18
|
+
#define RUBY_DTRACE_METHOD_HOOK(name, ec, klazz, id) \
|
19
|
+
do { \
|
20
|
+
if (UNLIKELY(RUBY_DTRACE_##name##_ENABLED())) { \
|
21
|
+
struct ruby_dtrace_method_hook_args args; \
|
22
|
+
if (rb_dtrace_setup(ec, klazz, id, &args)) { \
|
23
|
+
RUBY_DTRACE_##name(args.classname, \
|
24
|
+
args.methodname, \
|
25
|
+
args.filename, \
|
26
|
+
args.line_no); \
|
27
|
+
} \
|
28
|
+
} \
|
29
|
+
} while (0)
|
30
|
+
|
31
|
+
#define RUBY_DTRACE_METHOD_ENTRY_HOOK(ec, klass, id) \
|
32
|
+
RUBY_DTRACE_METHOD_HOOK(METHOD_ENTRY, ec, klass, id)
|
33
|
+
|
34
|
+
#define RUBY_DTRACE_METHOD_RETURN_HOOK(ec, klass, id) \
|
35
|
+
RUBY_DTRACE_METHOD_HOOK(METHOD_RETURN, ec, klass, id)
|
36
|
+
|
37
|
+
#define RUBY_DTRACE_CMETHOD_ENTRY_HOOK(ec, klass, id) \
|
38
|
+
RUBY_DTRACE_METHOD_HOOK(CMETHOD_ENTRY, ec, klass, id)
|
39
|
+
|
40
|
+
#define RUBY_DTRACE_CMETHOD_RETURN_HOOK(ec, klass, id) \
|
41
|
+
RUBY_DTRACE_METHOD_HOOK(CMETHOD_RETURN, ec, klass, id)
|
42
|
+
|
43
|
+
#endif /* RUBY_PROBES_HELPER_H */
|
@@ -0,0 +1,254 @@
|
|
1
|
+
#ifndef ONIGMO_REGENC_H
|
2
|
+
#define ONIGMO_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-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
|
+
#if !defined(RUBY) && (defined(RUBY_EXPORT) || defined(ONIG_ENC_REGISTER))
|
34
|
+
# define RUBY
|
35
|
+
#endif
|
36
|
+
#ifdef RUBY
|
37
|
+
# ifndef ONIGMO_REGINT_H
|
38
|
+
# ifndef RUBY_EXTERN
|
39
|
+
# include "ruby/config.h"
|
40
|
+
# include "ruby/defines.h"
|
41
|
+
# endif
|
42
|
+
# endif
|
43
|
+
#else /* RUBY */
|
44
|
+
# ifndef PACKAGE
|
45
|
+
/* PACKAGE is defined in config.h */
|
46
|
+
# include "config.h"
|
47
|
+
# endif
|
48
|
+
#endif /* RUBY */
|
49
|
+
|
50
|
+
#ifdef ONIG_ESCAPE_UCHAR_COLLISION
|
51
|
+
# undef ONIG_ESCAPE_UCHAR_COLLISION
|
52
|
+
#endif
|
53
|
+
|
54
|
+
#ifdef RUBY
|
55
|
+
# include "ruby/onigmo.h"
|
56
|
+
#else
|
57
|
+
# include "onigmo.h"
|
58
|
+
#endif
|
59
|
+
|
60
|
+
RUBY_SYMBOL_EXPORT_BEGIN
|
61
|
+
|
62
|
+
typedef struct {
|
63
|
+
OnigCodePoint from;
|
64
|
+
OnigCodePoint to;
|
65
|
+
} OnigPairCaseFoldCodes;
|
66
|
+
|
67
|
+
|
68
|
+
#ifndef NULL
|
69
|
+
# define NULL ((void* )0)
|
70
|
+
#endif
|
71
|
+
|
72
|
+
#ifndef TRUE
|
73
|
+
# define TRUE 1
|
74
|
+
#endif
|
75
|
+
|
76
|
+
#ifndef FALSE
|
77
|
+
# define FALSE 0
|
78
|
+
#endif
|
79
|
+
|
80
|
+
#ifndef ARG_UNUSED
|
81
|
+
# if defined(__GNUC__)
|
82
|
+
# define ARG_UNUSED __attribute__ ((unused))
|
83
|
+
# else
|
84
|
+
# define ARG_UNUSED
|
85
|
+
# endif
|
86
|
+
#endif
|
87
|
+
|
88
|
+
#define ONIG_IS_NULL(p) (((void*)(p)) == (void*)0)
|
89
|
+
#define ONIG_IS_NOT_NULL(p) (((void*)(p)) != (void*)0)
|
90
|
+
#define ONIG_CHECK_NULL_RETURN(p) if (ONIG_IS_NULL(p)) return NULL
|
91
|
+
#define ONIG_CHECK_NULL_RETURN_VAL(p,val) if (ONIG_IS_NULL(p)) return (val)
|
92
|
+
|
93
|
+
#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e))
|
94
|
+
|
95
|
+
/* character types bit flag */
|
96
|
+
#define BIT_CTYPE_NEWLINE (1<< ONIGENC_CTYPE_NEWLINE)
|
97
|
+
#define BIT_CTYPE_ALPHA (1<< ONIGENC_CTYPE_ALPHA)
|
98
|
+
#define BIT_CTYPE_BLANK (1<< ONIGENC_CTYPE_BLANK)
|
99
|
+
#define BIT_CTYPE_CNTRL (1<< ONIGENC_CTYPE_CNTRL)
|
100
|
+
#define BIT_CTYPE_DIGIT (1<< ONIGENC_CTYPE_DIGIT)
|
101
|
+
#define BIT_CTYPE_GRAPH (1<< ONIGENC_CTYPE_GRAPH)
|
102
|
+
#define BIT_CTYPE_LOWER (1<< ONIGENC_CTYPE_LOWER)
|
103
|
+
#define BIT_CTYPE_PRINT (1<< ONIGENC_CTYPE_PRINT)
|
104
|
+
#define BIT_CTYPE_PUNCT (1<< ONIGENC_CTYPE_PUNCT)
|
105
|
+
#define BIT_CTYPE_SPACE (1<< ONIGENC_CTYPE_SPACE)
|
106
|
+
#define BIT_CTYPE_UPPER (1<< ONIGENC_CTYPE_UPPER)
|
107
|
+
#define BIT_CTYPE_XDIGIT (1<< ONIGENC_CTYPE_XDIGIT)
|
108
|
+
#define BIT_CTYPE_WORD (1<< ONIGENC_CTYPE_WORD)
|
109
|
+
#define BIT_CTYPE_ALNUM (1<< ONIGENC_CTYPE_ALNUM)
|
110
|
+
#define BIT_CTYPE_ASCII (1<< ONIGENC_CTYPE_ASCII)
|
111
|
+
|
112
|
+
#define CTYPE_TO_BIT(ctype) (1<<(ctype))
|
113
|
+
#define CTYPE_IS_WORD_GRAPH_PRINT(ctype) \
|
114
|
+
((ctype) == ONIGENC_CTYPE_WORD || (ctype) == ONIGENC_CTYPE_GRAPH ||\
|
115
|
+
(ctype) == ONIGENC_CTYPE_PRINT)
|
116
|
+
|
117
|
+
|
118
|
+
typedef struct {
|
119
|
+
short int len;
|
120
|
+
const UChar name[6];
|
121
|
+
int ctype;
|
122
|
+
} PosixBracketEntryType;
|
123
|
+
|
124
|
+
#define POSIX_BRACKET_ENTRY_INIT(name, ctype) \
|
125
|
+
{(short int )(sizeof(name) - 1), (name), (ctype)}
|
126
|
+
|
127
|
+
#ifndef numberof
|
128
|
+
# define numberof(array) (int )(sizeof(array) / sizeof((array)[0]))
|
129
|
+
#endif
|
130
|
+
|
131
|
+
|
132
|
+
#define USE_CRNL_AS_LINE_TERMINATOR
|
133
|
+
#define USE_UNICODE_PROPERTIES
|
134
|
+
#define USE_UNICODE_AGE_PROPERTIES
|
135
|
+
/* #define USE_UNICODE_CASE_FOLD_TURKISH_AZERI */
|
136
|
+
/* #define USE_UNICODE_ALL_LINE_TERMINATORS */ /* see Unicode.org UTS #18 */
|
137
|
+
|
138
|
+
|
139
|
+
#define ONIG_ENCODING_INIT_DEFAULT ONIG_ENCODING_ASCII
|
140
|
+
|
141
|
+
/* for encoding system implementation (internal) */
|
142
|
+
ONIG_EXTERN int onigenc_ascii_apply_all_case_fold(OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc);
|
143
|
+
ONIG_EXTERN int onigenc_ascii_get_case_fold_codes_by_str(OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[], OnigEncoding enc);
|
144
|
+
ONIG_EXTERN int onigenc_apply_all_case_fold_with_map(int map_size, const OnigPairCaseFoldCodes map[], int ess_tsett_flag, OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg);
|
145
|
+
ONIG_EXTERN int onigenc_get_case_fold_codes_by_str_with_map(int map_size, const OnigPairCaseFoldCodes map[], int ess_tsett_flag, OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[]);
|
146
|
+
ONIG_EXTERN int onigenc_not_support_get_ctype_code_range(OnigCtype ctype, OnigCodePoint* sb_out, const OnigCodePoint* ranges[], OnigEncoding enc);
|
147
|
+
ONIG_EXTERN int onigenc_is_mbc_newline_0x0a(const UChar* p, const UChar* end, OnigEncoding enc);
|
148
|
+
ONIG_EXTERN int onigenc_single_byte_ascii_only_case_map(OnigCaseFoldType* flagP, const OnigUChar** pp, const OnigUChar* end, OnigUChar* to, OnigUChar* to_end, const struct OnigEncodingTypeST* enc);
|
149
|
+
|
150
|
+
|
151
|
+
/* methods for single byte encoding */
|
152
|
+
ONIG_EXTERN int onigenc_ascii_mbc_case_fold(OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower, OnigEncoding enc);
|
153
|
+
ONIG_EXTERN int onigenc_single_byte_mbc_enc_len(const UChar* p, const UChar* e, OnigEncoding enc);
|
154
|
+
ONIG_EXTERN OnigCodePoint onigenc_single_byte_mbc_to_code(const UChar* p, const UChar* end, OnigEncoding enc);
|
155
|
+
ONIG_EXTERN int onigenc_single_byte_code_to_mbclen(OnigCodePoint code, OnigEncoding enc);
|
156
|
+
ONIG_EXTERN int onigenc_single_byte_code_to_mbc(OnigCodePoint code, UChar *buf, OnigEncoding enc);
|
157
|
+
ONIG_EXTERN UChar* onigenc_single_byte_left_adjust_char_head(const UChar* start, const UChar* s, const OnigUChar* end, OnigEncoding enc);
|
158
|
+
ONIG_EXTERN int onigenc_always_true_is_allowed_reverse_match(const UChar* s, const UChar* end, OnigEncoding enc);
|
159
|
+
ONIG_EXTERN int onigenc_always_false_is_allowed_reverse_match(const UChar* s, const UChar* end, OnigEncoding enc);
|
160
|
+
ONIG_EXTERN int onigenc_ascii_is_code_ctype(OnigCodePoint code, unsigned int ctype, OnigEncoding enc);
|
161
|
+
|
162
|
+
/* methods for multi byte encoding */
|
163
|
+
ONIG_EXTERN OnigCodePoint onigenc_mbn_mbc_to_code(OnigEncoding enc, const UChar* p, const UChar* end);
|
164
|
+
ONIG_EXTERN int onigenc_mbn_mbc_case_fold(OnigEncoding enc, OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower);
|
165
|
+
ONIG_EXTERN int onigenc_mb2_code_to_mbclen(OnigCodePoint code, OnigEncoding enc);
|
166
|
+
ONIG_EXTERN int onigenc_mb2_code_to_mbc(OnigEncoding enc, OnigCodePoint code, UChar *buf);
|
167
|
+
ONIG_EXTERN int onigenc_minimum_property_name_to_ctype(OnigEncoding enc, const UChar* p, const UChar* end);
|
168
|
+
ONIG_EXTERN int onigenc_unicode_property_name_to_ctype(OnigEncoding enc, const UChar* p, const UChar* end);
|
169
|
+
ONIG_EXTERN int onigenc_mb2_is_code_ctype(OnigEncoding enc, OnigCodePoint code, unsigned int ctype);
|
170
|
+
ONIG_EXTERN int onigenc_mb4_code_to_mbclen(OnigCodePoint code, OnigEncoding enc);
|
171
|
+
ONIG_EXTERN int onigenc_mb4_code_to_mbc(OnigEncoding enc, OnigCodePoint code, UChar *buf);
|
172
|
+
ONIG_EXTERN int onigenc_mb4_is_code_ctype(OnigEncoding enc, OnigCodePoint code, unsigned int ctype);
|
173
|
+
|
174
|
+
ONIG_EXTERN int onigenc_unicode_case_map(OnigCaseFoldType* flagP, const OnigUChar** pp, const OnigUChar* end, OnigUChar* to, OnigUChar* to_end, const struct OnigEncodingTypeST* enc);
|
175
|
+
|
176
|
+
|
177
|
+
/* in enc/unicode.c */
|
178
|
+
ONIG_EXTERN int onigenc_unicode_is_code_ctype(OnigCodePoint code, unsigned int ctype, OnigEncoding enc);
|
179
|
+
ONIG_EXTERN int onigenc_utf16_32_get_ctype_code_range(OnigCtype ctype, OnigCodePoint *sb_out, const OnigCodePoint* ranges[], OnigEncoding enc);
|
180
|
+
ONIG_EXTERN int onigenc_unicode_ctype_code_range(int ctype, const OnigCodePoint* ranges[]);
|
181
|
+
ONIG_EXTERN int onigenc_unicode_get_case_fold_codes_by_str(OnigEncoding enc, OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[]);
|
182
|
+
ONIG_EXTERN int onigenc_unicode_mbc_case_fold(OnigEncoding enc, OnigCaseFoldType flag, const UChar** pp, const UChar* end, UChar* fold);
|
183
|
+
ONIG_EXTERN int onigenc_unicode_apply_all_case_fold(OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc);
|
184
|
+
|
185
|
+
|
186
|
+
#define UTF16_IS_SURROGATE_FIRST(c) (((c) & 0xfc) == 0xd8)
|
187
|
+
#define UTF16_IS_SURROGATE_SECOND(c) (((c) & 0xfc) == 0xdc)
|
188
|
+
#define UTF16_IS_SURROGATE(c) (((c) & 0xf8) == 0xd8)
|
189
|
+
#define UNICODE_VALID_CODEPOINT_P(c) ( \
|
190
|
+
((c) <= 0x10ffff) && \
|
191
|
+
!((c) < 0x10000 && UTF16_IS_SURROGATE((c) >> 8)))
|
192
|
+
|
193
|
+
#define ONIGENC_ISO_8859_1_TO_LOWER_CASE(c) \
|
194
|
+
OnigEncISO_8859_1_ToLowerCaseTable[c]
|
195
|
+
#define ONIGENC_ISO_8859_1_TO_UPPER_CASE(c) \
|
196
|
+
OnigEncISO_8859_1_ToUpperCaseTable[c]
|
197
|
+
|
198
|
+
ONIG_EXTERN const UChar OnigEncISO_8859_1_ToLowerCaseTable[];
|
199
|
+
ONIG_EXTERN const UChar OnigEncISO_8859_1_ToUpperCaseTable[];
|
200
|
+
|
201
|
+
ONIG_EXTERN int
|
202
|
+
onigenc_with_ascii_strncmp(OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n);
|
203
|
+
ONIG_EXTERN int
|
204
|
+
onigenc_with_ascii_strnicmp(OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n);
|
205
|
+
ONIG_EXTERN UChar*
|
206
|
+
onigenc_step(OnigEncoding enc, const UChar* p, const UChar* end, int n);
|
207
|
+
|
208
|
+
/* defined in regexec.c, but used in enc/xxx.c */
|
209
|
+
extern int onig_is_in_code_range(const UChar* p, OnigCodePoint code);
|
210
|
+
|
211
|
+
ONIG_EXTERN OnigEncoding OnigEncDefaultCharEncoding;
|
212
|
+
ONIG_EXTERN const UChar OnigEncAsciiToLowerCaseTable[];
|
213
|
+
ONIG_EXTERN const UChar OnigEncAsciiToUpperCaseTable[];
|
214
|
+
ONIG_EXTERN const unsigned short OnigEncAsciiCtypeTable[];
|
215
|
+
|
216
|
+
#define ONIGENC_IS_ASCII_CODE(code) ((code) < 0x80)
|
217
|
+
#define ONIGENC_ASCII_CODE_TO_LOWER_CASE(c) OnigEncAsciiToLowerCaseTable[c]
|
218
|
+
#define ONIGENC_ASCII_CODE_TO_UPPER_CASE(c) OnigEncAsciiToUpperCaseTable[c]
|
219
|
+
#define ONIGENC_IS_ASCII_CODE_CTYPE(code,ctype) \
|
220
|
+
((OnigEncAsciiCtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0)
|
221
|
+
#define ONIGENC_IS_ASCII_CODE_CASE_AMBIG(code) \
|
222
|
+
(ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_UPPER) ||\
|
223
|
+
ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_LOWER))
|
224
|
+
|
225
|
+
/* Check if the code is in the range. (from <= code && code <= to) */
|
226
|
+
#define ONIGENC_IS_IN_RANGE(code, from, to) \
|
227
|
+
((OnigCodePoint )((code) - (from)) <= (OnigCodePoint )((to) - (from)))
|
228
|
+
|
229
|
+
|
230
|
+
#ifdef ONIG_ENC_REGISTER
|
231
|
+
extern int ONIG_ENC_REGISTER(const char *, OnigEncoding);
|
232
|
+
# define OnigEncodingName(n) encoding_##n
|
233
|
+
# define OnigEncodingDeclare(n) static const OnigEncodingType OnigEncodingName(n)
|
234
|
+
# define OnigEncodingDefine(f,n) \
|
235
|
+
OnigEncodingDeclare(n); \
|
236
|
+
void Init_##f(void) { \
|
237
|
+
ONIG_ENC_REGISTER(OnigEncodingName(n).name, \
|
238
|
+
&OnigEncodingName(n)); \
|
239
|
+
} \
|
240
|
+
OnigEncodingDeclare(n)
|
241
|
+
#else
|
242
|
+
# define OnigEncodingName(n) OnigEncoding##n
|
243
|
+
# define OnigEncodingDeclare(n) const OnigEncodingType OnigEncodingName(n)
|
244
|
+
# define OnigEncodingDefine(f,n) OnigEncodingDeclare(n)
|
245
|
+
#endif
|
246
|
+
|
247
|
+
/* macros for define replica encoding and encoding alias */
|
248
|
+
#define ENC_REPLICATE(name, orig)
|
249
|
+
#define ENC_ALIAS(name, orig)
|
250
|
+
#define ENC_DUMMY(name)
|
251
|
+
|
252
|
+
RUBY_SYMBOL_EXPORT_END
|
253
|
+
|
254
|
+
#endif /* ONIGMO_REGENC_H */
|