did_you_mean 0.2.0 → 0.3.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (39) hide show
  1. checksums.yaml +4 -4
  2. data/.travis.yml +2 -0
  3. data/did_you_mean.gemspec +4 -0
  4. data/ext/did_you_mean/extconf.rb +7 -2
  5. data/ext/did_you_mean/ruby_headers/220/addr2line.h +21 -0
  6. data/ext/did_you_mean/ruby_headers/220/constant.h +36 -0
  7. data/ext/did_you_mean/ruby_headers/220/dln.h +51 -0
  8. data/ext/did_you_mean/ruby_headers/220/encdb.h +170 -0
  9. data/ext/did_you_mean/ruby_headers/220/eval_intern.h +256 -0
  10. data/ext/did_you_mean/ruby_headers/220/gc.h +102 -0
  11. data/ext/did_you_mean/ruby_headers/220/id.h +171 -0
  12. data/ext/did_you_mean/ruby_headers/220/internal.h +1006 -0
  13. data/ext/did_you_mean/ruby_headers/220/iseq.h +136 -0
  14. data/ext/did_you_mean/ruby_headers/220/method.h +142 -0
  15. data/ext/did_you_mean/ruby_headers/220/node.h +543 -0
  16. data/ext/did_you_mean/ruby_headers/220/parse.h +183 -0
  17. data/ext/did_you_mean/ruby_headers/220/probes.h +83 -0
  18. data/ext/did_you_mean/ruby_headers/220/probes_helper.h +67 -0
  19. data/ext/did_you_mean/ruby_headers/220/regenc.h +223 -0
  20. data/ext/did_you_mean/ruby_headers/220/regint.h +911 -0
  21. data/ext/did_you_mean/ruby_headers/220/regparse.h +363 -0
  22. data/ext/did_you_mean/ruby_headers/220/revision.h +1 -0
  23. data/ext/did_you_mean/ruby_headers/220/ruby_atomic.h +170 -0
  24. data/ext/did_you_mean/ruby_headers/220/siphash.h +48 -0
  25. data/ext/did_you_mean/ruby_headers/220/thread_native.h +23 -0
  26. data/ext/did_you_mean/ruby_headers/220/thread_pthread.h +56 -0
  27. data/ext/did_you_mean/ruby_headers/220/thread_win32.h +45 -0
  28. data/ext/did_you_mean/ruby_headers/220/timev.h +42 -0
  29. data/ext/did_you_mean/ruby_headers/220/transcode_data.h +123 -0
  30. data/ext/did_you_mean/ruby_headers/220/transdb.h +190 -0
  31. data/ext/did_you_mean/ruby_headers/220/verconf.h +13 -0
  32. data/ext/did_you_mean/ruby_headers/220/version.h +53 -0
  33. data/ext/did_you_mean/ruby_headers/220/vm_core.h +1024 -0
  34. data/ext/did_you_mean/ruby_headers/220/vm_debug.h +37 -0
  35. data/ext/did_you_mean/ruby_headers/220/vm_exec.h +182 -0
  36. data/ext/did_you_mean/ruby_headers/220/vm_insnhelper.h +273 -0
  37. data/ext/did_you_mean/ruby_headers/220/vm_opts.h +56 -0
  38. data/lib/did_you_mean/version.rb +1 -1
  39. metadata +51 -4
@@ -0,0 +1,183 @@
1
+ /* A Bison parser, made by GNU Bison 2.5. */
2
+
3
+ /* Bison interface for Yacc-like parsers in C
4
+
5
+ Copyright (C) 1984, 1989-1990, 2000-2011 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
+
34
+ /* Tokens. */
35
+ #ifndef YYTOKENTYPE
36
+ # define YYTOKENTYPE
37
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
38
+ know about them. */
39
+ enum yytokentype {
40
+ END_OF_INPUT = 0,
41
+ keyword_class = 258,
42
+ keyword_module = 259,
43
+ keyword_def = 260,
44
+ keyword_undef = 261,
45
+ keyword_begin = 262,
46
+ keyword_rescue = 263,
47
+ keyword_ensure = 264,
48
+ keyword_end = 265,
49
+ keyword_if = 266,
50
+ keyword_unless = 267,
51
+ keyword_then = 268,
52
+ keyword_elsif = 269,
53
+ keyword_else = 270,
54
+ keyword_case = 271,
55
+ keyword_when = 272,
56
+ keyword_while = 273,
57
+ keyword_until = 274,
58
+ keyword_for = 275,
59
+ keyword_break = 276,
60
+ keyword_next = 277,
61
+ keyword_redo = 278,
62
+ keyword_retry = 279,
63
+ keyword_in = 280,
64
+ keyword_do = 281,
65
+ keyword_do_cond = 282,
66
+ keyword_do_block = 283,
67
+ keyword_do_LAMBDA = 284,
68
+ keyword_return = 285,
69
+ keyword_yield = 286,
70
+ keyword_super = 287,
71
+ keyword_self = 288,
72
+ keyword_nil = 289,
73
+ keyword_true = 290,
74
+ keyword_false = 291,
75
+ keyword_and = 292,
76
+ keyword_or = 293,
77
+ keyword_not = 294,
78
+ modifier_if = 295,
79
+ modifier_unless = 296,
80
+ modifier_while = 297,
81
+ modifier_until = 298,
82
+ modifier_rescue = 299,
83
+ keyword_alias = 300,
84
+ keyword_defined = 301,
85
+ keyword_BEGIN = 302,
86
+ keyword_END = 303,
87
+ keyword__LINE__ = 304,
88
+ keyword__FILE__ = 305,
89
+ keyword__ENCODING__ = 306,
90
+ tIDENTIFIER = 307,
91
+ tFID = 308,
92
+ tGVAR = 309,
93
+ tIVAR = 310,
94
+ tCONSTANT = 311,
95
+ tCVAR = 312,
96
+ tLABEL = 313,
97
+ tINTEGER = 314,
98
+ tFLOAT = 315,
99
+ tRATIONAL = 316,
100
+ tIMAGINARY = 317,
101
+ tSTRING_CONTENT = 318,
102
+ tCHAR = 319,
103
+ tNTH_REF = 320,
104
+ tBACK_REF = 321,
105
+ tREGEXP_END = 322,
106
+ tUPLUS = 130,
107
+ tUMINUS = 131,
108
+ tPOW = 132,
109
+ tCMP = 134,
110
+ tEQ = 139,
111
+ tEQQ = 140,
112
+ tNEQ = 141,
113
+ tGEQ = 138,
114
+ tLEQ = 137,
115
+ tANDOP = 323,
116
+ tOROP = 324,
117
+ tMATCH = 142,
118
+ tNMATCH = 143,
119
+ tDOT2 = 128,
120
+ tDOT3 = 129,
121
+ tAREF = 144,
122
+ tASET = 145,
123
+ tLSHFT = 135,
124
+ tRSHFT = 136,
125
+ tCOLON2 = 325,
126
+ tCOLON3 = 326,
127
+ tOP_ASGN = 327,
128
+ tASSOC = 328,
129
+ tLPAREN = 329,
130
+ tLPAREN_ARG = 330,
131
+ tRPAREN = 331,
132
+ tLBRACK = 332,
133
+ tLBRACE = 333,
134
+ tLBRACE_ARG = 334,
135
+ tSTAR = 335,
136
+ tDSTAR = 336,
137
+ tAMPER = 337,
138
+ tLAMBDA = 338,
139
+ tSYMBEG = 339,
140
+ tSTRING_BEG = 340,
141
+ tXSTRING_BEG = 341,
142
+ tREGEXP_BEG = 342,
143
+ tWORDS_BEG = 343,
144
+ tQWORDS_BEG = 344,
145
+ tSYMBOLS_BEG = 345,
146
+ tQSYMBOLS_BEG = 346,
147
+ tSTRING_DBEG = 347,
148
+ tSTRING_DEND = 348,
149
+ tSTRING_DVAR = 349,
150
+ tSTRING_END = 350,
151
+ tLAMBEG = 351,
152
+ tLOWEST = 352,
153
+ tUMINUS_NUM = 353,
154
+ tLAST_TOKEN = 354
155
+ };
156
+ #endif
157
+
158
+
159
+
160
+ #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
161
+ typedef union YYSTYPE
162
+ {
163
+
164
+ /* Line 2068 of yacc.c */
165
+
166
+ VALUE val;
167
+ NODE *node;
168
+ ID id;
169
+ int num;
170
+ const struct vtable *vars;
171
+
172
+
173
+
174
+ /* Line 2068 of yacc.c */
175
+ } YYSTYPE;
176
+ # define YYSTYPE_IS_TRIVIAL 1
177
+ # define yystype YYSTYPE /* obsolescent; will be withdrawn */
178
+ # define YYSTYPE_IS_DECLARED 1
179
+ #endif
180
+
181
+
182
+
183
+
@@ -0,0 +1,83 @@
1
+ /* -*- c -*- */
2
+ #include "vm_opts.h"
3
+
4
+ #ifndef _PROBES_H
5
+ #define _PROBES_H
6
+ #define DTRACE_PROBES_DISABLED 1
7
+
8
+ #define RUBY_DTRACE_METHOD_ENTRY_ENABLED() 0
9
+ #define RUBY_DTRACE_METHOD_ENTRY(arg0, arg1, arg2, arg3) do { } while(0)
10
+ #define RUBY_DTRACE_METHOD_RETURN_ENABLED() 0
11
+ #define RUBY_DTRACE_METHOD_RETURN(arg0, arg1, arg2, arg3) do { } while(0)
12
+
13
+ #define RUBY_DTRACE_CMETHOD_ENTRY_ENABLED() 0
14
+ #define RUBY_DTRACE_CMETHOD_ENTRY(arg0, arg1, arg2, arg3) do { } while(0)
15
+ #define RUBY_DTRACE_CMETHOD_RETURN_ENABLED() 0
16
+ #define RUBY_DTRACE_CMETHOD_RETURN(arg0, arg1, arg2, arg3) do { } while(0)
17
+
18
+ #define RUBY_DTRACE_REQUIRE_ENTRY_ENABLED() 0
19
+ #define RUBY_DTRACE_REQUIRE_ENTRY(arg0, arg1, arg2) do { } while(0)
20
+
21
+ #define RUBY_DTRACE_REQUIRE_RETURN_ENABLED() 0
22
+ #define RUBY_DTRACE_REQUIRE_RETURN(arg0, arg1, arg2) do { } while(0)
23
+
24
+ #define RUBY_DTRACE_FIND_REQUIRE_ENTRY_ENABLED() 0
25
+ #define RUBY_DTRACE_FIND_REQUIRE_ENTRY(arg0, arg1, arg2) do { } while(0)
26
+
27
+ #define RUBY_DTRACE_FIND_REQUIRE_RETURN_ENABLED() 0
28
+ #define RUBY_DTRACE_FIND_REQUIRE_RETURN(arg0, arg1, arg2) do { } while(0)
29
+
30
+ #define RUBY_DTRACE_LOAD_ENTRY_ENABLED() 0
31
+ #define RUBY_DTRACE_LOAD_ENTRY(arg0, arg1, arg2) do { } while(0)
32
+
33
+ #define RUBY_DTRACE_LOAD_RETURN_ENABLED() 0
34
+ #define RUBY_DTRACE_LOAD_RETURN(arg0, arg1, arg2) do { } while(0)
35
+
36
+ #define RUBY_DTRACE_RAISE_ENABLED() 0
37
+ #define RUBY_DTRACE_RAISE(arg0, arg1, arg2) do { } while(0)
38
+
39
+ #define RUBY_DTRACE_OBJECT_CREATE_ENABLED() 0
40
+ #define RUBY_DTRACE_OBJECT_CREATE(arg0, arg1, arg2) do { } while(0)
41
+
42
+ #define RUBY_DTRACE_ARRAY_CREATE_ENABLED() 0
43
+ #define RUBY_DTRACE_ARRAY_CREATE(arg0, arg1, arg2) do { } while(0)
44
+
45
+ #define RUBY_DTRACE_HASH_CREATE_ENABLED() 0
46
+ #define RUBY_DTRACE_HASH_CREATE(arg0, arg1, arg2) do { } while(0)
47
+
48
+ #define RUBY_DTRACE_STRING_CREATE_ENABLED() 0
49
+ #define RUBY_DTRACE_STRING_CREATE(arg0, arg1, arg2) do { } while(0)
50
+
51
+ #define RUBY_DTRACE_SYMBOL_CREATE_ENABLED() 0
52
+ #define RUBY_DTRACE_SYMBOL_CREATE(arg0, arg1, arg2) do { } while(0)
53
+
54
+ #define RUBY_DTRACE_PARSE_BEGIN_ENABLED() 0
55
+ #define RUBY_DTRACE_PARSE_BEGIN(arg0, arg1) do { } while(0)
56
+
57
+ #define RUBY_DTRACE_PARSE_END_ENABLED() 0
58
+ #define RUBY_DTRACE_PARSE_END(arg0, arg1) do { } while(0)
59
+
60
+ #if VM_COLLECT_USAGE_DETAILS
61
+ #define RUBY_DTRACE_INSN_ENABLED() 0
62
+ #define RUBY_DTRACE_INSN(arg0) do { } while(0)
63
+ #define RUBY_DTRACE_INSN_OPERAND_ENABLED() 0
64
+ #define RUBY_DTRACE_INSN_OPERAND(arg0, arg1) do { } while(0)
65
+ #endif
66
+
67
+ #define RUBY_DTRACE_GC_MARK_BEGIN_ENABLED() 0
68
+ #define RUBY_DTRACE_GC_MARK_BEGIN() do { } while(0)
69
+
70
+ #define RUBY_DTRACE_GC_MARK_END_ENABLED() 0
71
+ #define RUBY_DTRACE_GC_MARK_END() do { } while(0)
72
+
73
+ #define RUBY_DTRACE_GC_SWEEP_BEGIN_ENABLED() 0
74
+ #define RUBY_DTRACE_GC_SWEEP_BEGIN() do { } while(0)
75
+
76
+ #define RUBY_DTRACE_GC_SWEEP_END_ENABLED() 0
77
+ #define RUBY_DTRACE_GC_SWEEP_END() do { } while(0)
78
+
79
+ #define RUBY_DTRACE_METHOD_CACHE_CLEAR_ENABLED() 0
80
+ #define RUBY_DTRACE_METHOD_CACHE_CLEAR(arg0, arg1, arg2) do { } while(0)
81
+
82
+ #endif /* _PROBES_H */
83
+
@@ -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,223 @@
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
+ #ifndef REGINT_H
33
+ #ifndef RUBY_EXTERN
34
+ #include "ruby/config.h"
35
+ #include "ruby/defines.h"
36
+ #endif
37
+ #ifdef ONIG_ESCAPE_UCHAR_COLLISION
38
+ #undef ONIG_ESCAPE_UCHAR_COLLISION
39
+ #endif
40
+ #endif
41
+ #include "ruby/oniguruma.h"
42
+
43
+ RUBY_SYMBOL_EXPORT_BEGIN
44
+
45
+ typedef struct {
46
+ OnigCodePoint from;
47
+ OnigCodePoint to;
48
+ } OnigPairCaseFoldCodes;
49
+
50
+
51
+ #ifndef NULL
52
+ #define NULL ((void* )0)
53
+ #endif
54
+
55
+ #ifndef TRUE
56
+ #define TRUE 1
57
+ #endif
58
+
59
+ #ifndef FALSE
60
+ #define FALSE 0
61
+ #endif
62
+
63
+ #ifndef ARG_UNUSED
64
+ #if defined(__GNUC__)
65
+ # define ARG_UNUSED __attribute__ ((unused))
66
+ #else
67
+ # define ARG_UNUSED
68
+ #endif
69
+ #endif
70
+
71
+ #define ONIG_IS_NULL(p) (((void*)(p)) == (void*)0)
72
+ #define ONIG_IS_NOT_NULL(p) (((void*)(p)) != (void*)0)
73
+ #define ONIG_CHECK_NULL_RETURN(p) if (ONIG_IS_NULL(p)) return NULL
74
+ #define ONIG_CHECK_NULL_RETURN_VAL(p,val) if (ONIG_IS_NULL(p)) return (val)
75
+
76
+ #define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e))
77
+
78
+ /* character types bit flag */
79
+ #define BIT_CTYPE_NEWLINE (1<< ONIGENC_CTYPE_NEWLINE)
80
+ #define BIT_CTYPE_ALPHA (1<< ONIGENC_CTYPE_ALPHA)
81
+ #define BIT_CTYPE_BLANK (1<< ONIGENC_CTYPE_BLANK)
82
+ #define BIT_CTYPE_CNTRL (1<< ONIGENC_CTYPE_CNTRL)
83
+ #define BIT_CTYPE_DIGIT (1<< ONIGENC_CTYPE_DIGIT)
84
+ #define BIT_CTYPE_GRAPH (1<< ONIGENC_CTYPE_GRAPH)
85
+ #define BIT_CTYPE_LOWER (1<< ONIGENC_CTYPE_LOWER)
86
+ #define BIT_CTYPE_PRINT (1<< ONIGENC_CTYPE_PRINT)
87
+ #define BIT_CTYPE_PUNCT (1<< ONIGENC_CTYPE_PUNCT)
88
+ #define BIT_CTYPE_SPACE (1<< ONIGENC_CTYPE_SPACE)
89
+ #define BIT_CTYPE_UPPER (1<< ONIGENC_CTYPE_UPPER)
90
+ #define BIT_CTYPE_XDIGIT (1<< ONIGENC_CTYPE_XDIGIT)
91
+ #define BIT_CTYPE_WORD (1<< ONIGENC_CTYPE_WORD)
92
+ #define BIT_CTYPE_ALNUM (1<< ONIGENC_CTYPE_ALNUM)
93
+ #define BIT_CTYPE_ASCII (1<< ONIGENC_CTYPE_ASCII)
94
+
95
+ #define CTYPE_TO_BIT(ctype) (1<<(ctype))
96
+ #define CTYPE_IS_WORD_GRAPH_PRINT(ctype) \
97
+ ((ctype) == ONIGENC_CTYPE_WORD || (ctype) == ONIGENC_CTYPE_GRAPH ||\
98
+ (ctype) == ONIGENC_CTYPE_PRINT)
99
+
100
+
101
+ typedef struct {
102
+ const UChar *name;
103
+ int ctype;
104
+ short int len;
105
+ } PosixBracketEntryType;
106
+
107
+ #define PosixBracketEntryInit(name, ctype) {(const UChar *)name, ctype, (short int)(sizeof(name) - 1)}
108
+
109
+ #define USE_CRNL_AS_LINE_TERMINATOR
110
+ #define USE_UNICODE_PROPERTIES
111
+ /* #define USE_UNICODE_CASE_FOLD_TURKISH_AZERI */
112
+ /* #define USE_UNICODE_ALL_LINE_TERMINATORS */ /* see Unicode.org UTS #18 */
113
+
114
+
115
+ #define ONIG_ENCODING_INIT_DEFAULT ONIG_ENCODING_ASCII
116
+
117
+ /* for encoding system implementation (internal) */
118
+ ONIG_EXTERN int onigenc_ascii_apply_all_case_fold P_((OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc));
119
+ ONIG_EXTERN int onigenc_ascii_get_case_fold_codes_by_str P_((OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[], OnigEncoding enc));
120
+ 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));
121
+ 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[]));
122
+ ONIG_EXTERN int onigenc_not_support_get_ctype_code_range P_((OnigCtype ctype, OnigCodePoint* sb_out, const OnigCodePoint* ranges[], OnigEncoding enc));
123
+ ONIG_EXTERN int onigenc_is_mbc_newline_0x0a P_((const UChar* p, const UChar* end, OnigEncoding enc));
124
+
125
+
126
+ /* methods for single byte encoding */
127
+ ONIG_EXTERN int onigenc_ascii_mbc_case_fold P_((OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower, OnigEncoding enc));
128
+ ONIG_EXTERN int onigenc_single_byte_mbc_enc_len P_((const UChar* p, const UChar* e, OnigEncoding enc));
129
+ ONIG_EXTERN OnigCodePoint onigenc_single_byte_mbc_to_code P_((const UChar* p, const UChar* end, OnigEncoding enc));
130
+ ONIG_EXTERN int onigenc_single_byte_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
131
+ ONIG_EXTERN int onigenc_single_byte_code_to_mbc P_((OnigCodePoint code, UChar *buf, OnigEncoding enc));
132
+ ONIG_EXTERN UChar* onigenc_single_byte_left_adjust_char_head P_((const UChar* start, const UChar* s, const OnigUChar* end, OnigEncoding enc));
133
+ ONIG_EXTERN int onigenc_always_true_is_allowed_reverse_match P_((const UChar* s, const UChar* end, OnigEncoding enc));
134
+ ONIG_EXTERN int onigenc_always_false_is_allowed_reverse_match P_((const UChar* s, const UChar* end, OnigEncoding enc));
135
+ ONIG_EXTERN int onigenc_ascii_is_code_ctype P_((OnigCodePoint code, unsigned int ctype, OnigEncoding enc));
136
+
137
+ /* methods for multi byte encoding */
138
+ ONIG_EXTERN OnigCodePoint onigenc_mbn_mbc_to_code P_((OnigEncoding enc, const UChar* p, const UChar* end));
139
+ ONIG_EXTERN int onigenc_mbn_mbc_case_fold P_((OnigEncoding enc, OnigCaseFoldType flag, const UChar** p, const UChar* end, UChar* lower));
140
+ ONIG_EXTERN int onigenc_mb2_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
141
+ ONIG_EXTERN int onigenc_mb2_code_to_mbc P_((OnigEncoding enc, OnigCodePoint code, UChar *buf));
142
+ ONIG_EXTERN int onigenc_minimum_property_name_to_ctype P_((OnigEncoding enc, UChar* p, UChar* end));
143
+ ONIG_EXTERN int onigenc_unicode_property_name_to_ctype P_((OnigEncoding enc, UChar* p, UChar* end));
144
+ ONIG_EXTERN int onigenc_mb2_is_code_ctype P_((OnigEncoding enc, OnigCodePoint code, unsigned int ctype));
145
+ ONIG_EXTERN int onigenc_mb4_code_to_mbclen P_((OnigCodePoint code, OnigEncoding enc));
146
+ ONIG_EXTERN int onigenc_mb4_code_to_mbc P_((OnigEncoding enc, OnigCodePoint code, UChar *buf));
147
+ ONIG_EXTERN int onigenc_mb4_is_code_ctype P_((OnigEncoding enc, OnigCodePoint code, unsigned int ctype));
148
+
149
+
150
+ /* in enc/unicode.c */
151
+ ONIG_EXTERN int onigenc_unicode_is_code_ctype P_((OnigCodePoint code, unsigned int ctype, OnigEncoding enc));
152
+ ONIG_EXTERN int onigenc_utf16_32_get_ctype_code_range P_((OnigCtype ctype, OnigCodePoint *sb_out, const OnigCodePoint* ranges[], OnigEncoding enc));
153
+ ONIG_EXTERN int onigenc_unicode_ctype_code_range P_((int ctype, const OnigCodePoint* ranges[]));
154
+ ONIG_EXTERN int onigenc_unicode_get_case_fold_codes_by_str P_((OnigEncoding enc, OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[]));
155
+ ONIG_EXTERN int onigenc_unicode_mbc_case_fold P_((OnigEncoding enc, OnigCaseFoldType flag, const UChar** pp, const UChar* end, UChar* fold));
156
+ ONIG_EXTERN int onigenc_unicode_apply_all_case_fold P_((OnigCaseFoldType flag, OnigApplyAllCaseFoldFunc f, void* arg, OnigEncoding enc));
157
+
158
+
159
+ #define UTF16_IS_SURROGATE_FIRST(c) (((c) & 0xfc) == 0xd8)
160
+ #define UTF16_IS_SURROGATE_SECOND(c) (((c) & 0xfc) == 0xdc)
161
+
162
+ #define ONIGENC_ISO_8859_1_TO_LOWER_CASE(c) \
163
+ OnigEncISO_8859_1_ToLowerCaseTable[c]
164
+ #define ONIGENC_ISO_8859_1_TO_UPPER_CASE(c) \
165
+ OnigEncISO_8859_1_ToUpperCaseTable[c]
166
+
167
+ ONIG_EXTERN const UChar OnigEncISO_8859_1_ToLowerCaseTable[];
168
+ ONIG_EXTERN const UChar OnigEncISO_8859_1_ToUpperCaseTable[];
169
+
170
+ ONIG_EXTERN int
171
+ onigenc_with_ascii_strncmp P_((OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n));
172
+ ONIG_EXTERN int
173
+ onigenc_with_ascii_strnicmp P_((OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n));
174
+ ONIG_EXTERN UChar*
175
+ onigenc_step P_((OnigEncoding enc, const UChar* p, const UChar* end, int n));
176
+
177
+ /* defined in regexec.c, but used in enc/xxx.c */
178
+ extern int onig_is_in_code_range P_((const UChar* p, OnigCodePoint code));
179
+
180
+ ONIG_EXTERN OnigEncoding OnigEncDefaultCharEncoding;
181
+ ONIG_EXTERN const UChar OnigEncAsciiToLowerCaseTable[];
182
+ ONIG_EXTERN const UChar OnigEncAsciiToUpperCaseTable[];
183
+ ONIG_EXTERN const unsigned short OnigEncAsciiCtypeTable[];
184
+
185
+ #define ONIGENC_IS_ASCII_CODE(code) ((code) < 0x80)
186
+ #define ONIGENC_ASCII_CODE_TO_LOWER_CASE(c) OnigEncAsciiToLowerCaseTable[c]
187
+ #define ONIGENC_ASCII_CODE_TO_UPPER_CASE(c) OnigEncAsciiToUpperCaseTable[c]
188
+ #define ONIGENC_IS_ASCII_CODE_CTYPE(code,ctype) \
189
+ ((OnigEncAsciiCtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0)
190
+ #define ONIGENC_IS_ASCII_CODE_CASE_AMBIG(code) \
191
+ (ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_UPPER) ||\
192
+ ONIGENC_IS_ASCII_CODE_CTYPE(code, ONIGENC_CTYPE_LOWER))
193
+
194
+ /* Check if the code is in the range. (from <= code && code <= to) */
195
+ #define ONIGENC_IS_IN_RANGE(code, from, to) \
196
+ ((OnigCodePoint )((code) - (from)) <= (OnigCodePoint )((to) - (from)))
197
+
198
+
199
+ #ifdef ONIG_ENC_REGISTER
200
+ extern int ONIG_ENC_REGISTER(const char *, OnigEncodingType*);
201
+ #define OnigEncodingName(n) encoding_##n
202
+ #define OnigEncodingDeclare(n) static OnigEncodingType OnigEncodingName(n)
203
+ #define OnigEncodingDefine(f,n) \
204
+ OnigEncodingDeclare(n); \
205
+ void Init_##f(void) { \
206
+ ONIG_ENC_REGISTER(OnigEncodingName(n).name, \
207
+ &OnigEncodingName(n)); \
208
+ } \
209
+ OnigEncodingDeclare(n)
210
+ #else
211
+ #define OnigEncodingName(n) OnigEncoding##n
212
+ #define OnigEncodingDeclare(n) OnigEncodingType OnigEncodingName(n)
213
+ #define OnigEncodingDefine(f,n) OnigEncodingDeclare(n)
214
+ #endif
215
+
216
+ /* macros for define replica encoding and encoding alias */
217
+ #define ENC_REPLICATE(name, orig)
218
+ #define ENC_ALIAS(name, orig)
219
+ #define ENC_DUMMY(name)
220
+
221
+ RUBY_SYMBOL_EXPORT_END
222
+
223
+ #endif /* ONIGURUMA_REGENC_H */