Ruby 2.1.5p273(2014-11-13revision48405)

- Main Page
- Modules
- Data Structures
- Files

- File List
- Globals

regparse.h
Go to the documentation of this file.
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 struct _Node* target;
197 AbsAddrType call_addr;
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 int num_call;
300 #ifdef USE_SUBEXP_CALL
301 UnsetAddrList* unset_addr_list;
302 #endif
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 */
ScanEnv::pattern
UChar * pattern
Definition: regparse.h:294
onig_scan_env_set_error_string
void onig_scan_env_set_error_string(ScanEnv *env, int ecode ARG_UNUSED, UChar *arg, UChar *arg_end)
Definition: regparse.c:6318
QtfrNode::is_refered
int is_refered
Definition: regparse.h:184
BRefNode
Definition: regparse.h:230
NODE_STR_BUF_SIZE
#define NODE_STR_BUF_SIZE
Definition: regparse.h:96
ScanEnv::pattern_end
UChar * pattern_end
Definition: regparse.h:295
StrNode::end
UChar * end
Definition: regparse.h:168
onig_free_node_list
int onig_free_node_list(void)
Definition: regparse.c:1112
_Node::cons
ConsAltNode cons
Definition: regparse.h:269
onig_node_str_cat
int onig_node_str_cat(Node *node, const UChar *s, const UChar *end)
Definition: regparse.c:1445
EncloseNode::regnum
int regnum
Definition: regparse.h:194
CtypeNode::ctype
int ctype
Definition: regparse.h:255
onig_node_list_add
Node * onig_node_list_add(Node *list, Node *x)
Definition: regparse.c:1261
CallNode::target
struct _Node * target
Definition: regparse.h:224
GroupNumRemap::new_val
int new_val
Definition: regparse.h:328
ScanEnv::num_call
int num_call
Definition: regparse.h:299
OnigCaseFoldType
unsigned int OnigCaseFoldType
Definition: oniguruma.h:119
ScanEnv::sourceline
int sourceline
Definition: regparse.h:318
onig_names_free
int onig_names_free(regex_t *reg)
Definition: regparse.c:486
EncloseNode::type
int type
Definition: regparse.h:193
BRefNode::nest_level
int nest_level
Definition: regparse.h:236
ScanEnv::error
UChar * error
Definition: regparse.h:296
onig_node_str_set
int onig_node_str_set(Node *node, const UChar *s, const UChar *end)
Definition: regparse.c:1481
QtfrNode::target_empty_info
int target_empty_info
Definition: regparse.h:181
StrNode::s
UChar * s
Definition: regparse.h:167
EncloseNode::opt_count
int opt_count
Definition: regparse.h:202
ScanEnv::unset_addr_list
UnsetAddrList * unset_addr_list
Definition: regparse.h:301
QtfrNode::next_head_exact
struct _Node * next_head_exact
Definition: regparse.h:183
NodeBase
Definition: regint.h:768
_Node::enclose
EncloseNode enclose
Definition: regparse.h:266
CClassNode
Definition: regint.h:774
UnsetAddrList::num
int num
Definition: regparse.h:213
_Node::base
NodeBase base
Definition: regparse.h:262
CtypeNode::not
int not
Definition: regparse.h:256
ConsAltNode::car
struct _Node * car
Definition: regparse.h:249
onig_node_new_alt
Node * onig_node_new_alt(Node *left, Node *right)
Definition: regparse.c:1279
SCANENV_MEMNODES_SIZE
#define SCANENV_MEMNODES_SIZE
Definition: regparse.h:280
OnigSyntaxType
Definition: oniguruma.h:380
re_pattern_buffer
Definition: oniguruma.h:658
UnsetAddrList::us
UnsetAddr * us
Definition: regparse.h:215
ScanEnv::reg
regex_t * reg
Definition: regparse.h:298
OnigOptionType
unsigned int OnigOptionType
Definition: oniguruma.h:347
CallNode
Definition: regparse.h:218
ScanEnv::num_named
int num_named
Definition: regparse.h:305
EncloseNode::char_len
int char_len
Definition: regparse.h:201
BitStatusType
unsigned int BitStatusType
Definition: regint.h:330
UnsetAddrList
Definition: regparse.h:212
_Node::bref
BRefNode bref
Definition: regparse.h:267
StrNode::base
NodeBase base
Definition: regparse.h:166
GroupNumRemap
Definition: regparse.h:327
CallNode::unset_addr_list
UnsetAddrList * unset_addr_list
Definition: regparse.h:225
P_
int onig_renumber_name_table P_((regex_t *reg, GroupNumRemap *map))
AnchorNode::target
struct _Node * target
Definition: regparse.h:242
CallNode::group_num
int group_num
Definition: regparse.h:221
__sFILE
Definition: vsnprintf.c:175
EncloseNode
Definition: regparse.h:190
QtfrNode::head_exact
struct _Node * head_exact
Definition: regparse.h:182
_Node::str
StrNode str
Definition: regparse.h:263
BRefNode::state
int state
Definition: regparse.h:232
ScanEnv::sourcefile
const char * sourcefile
Definition: regparse.h:317
StrNode::capa
int capa
Definition: regparse.h:170
UnsetAddr
Definition: regparse.h:207
EncloseNode::min_len
OnigDistance min_len
Definition: regparse.h:199
AbsAddrType
int AbsAddrType
Definition: regint.h:638
ScanEnv::syntax
const OnigSyntaxType * syntax
Definition: regparse.h:289
_Node::u
union _Node::@148 u
AnchorNode
Definition: regparse.h:239
CallNode::base
NodeBase base
Definition: regparse.h:219
EncloseNode::base
NodeBase base
Definition: regparse.h:191
onig_free_shared_cclass_table
int onig_free_shared_cclass_table(void)
Definition: regparse.c:5409
BRefNode::back_dynamic
int * back_dynamic
Definition: regparse.h:235
StrNode
Definition: regparse.h:165
QtfrNode::lower
int lower
Definition: regparse.h:178
onig_node_new_enclose
Node * onig_node_new_enclose(int type)
Definition: regparse.c:1416
ScanEnv::mem_alloc
int mem_alloc
Definition: regparse.h:307
UnsetAddrList::alloc
int alloc
Definition: regparse.h:214
_Node::ctype
CtypeNode ctype
Definition: regparse.h:270
_Node::cclass
CClassNode cclass
Definition: regparse.h:264
QtfrNode::upper
int upper
Definition: regparse.h:179
onig_node_conv_to_str_node
void onig_node_conv_to_str_node(Node *node, int flag)
Definition: regparse.c:1506
AnchorNode::type
int type
Definition: regparse.h:241
_Node::qtfr
QtfrNode qtfr
Definition: regparse.h:265
UnsetAddr::target
struct _Node * target
Definition: regparse.h:209
_Node
Definition: regparse.h:260
EncloseNode::max_len
OnigDistance max_len
Definition: regparse.h:200
StrNode::flag
unsigned int flag
Definition: regparse.h:169
QtfrNode::base
NodeBase base
Definition: regparse.h:175
CallNode::name_end
UChar * name_end
Definition: regparse.h:223
RUBY_SYMBOL_EXPORT_END
#define RUBY_SYMBOL_EXPORT_END
Definition: missing.h:39
ConsAltNode
Definition: regparse.h:247
EncloseNode::state
int state
Definition: regparse.h:192
buf
unsigned char buf[MIME_BUF_SIZE]
Definition: nkf.c:4308
CtypeNode::base
NodeBase base
Definition: regparse.h:254
ConsAltNode::base
NodeBase base
Definition: regparse.h:248
QtfrNode::state
int state
Definition: regparse.h:176
type
int type
Definition: tcltklib.c:112
ScanEnv::backrefed_mem
BitStatusType backrefed_mem
Definition: regparse.h:293
ScanEnv::num_mem
int num_mem
Definition: regparse.h:303
_Node::call
CallNode call
Definition: regparse.h:272
onig_strncmp
int onig_strncmp(const UChar *s1, const UChar *s2, int n)
Definition: regparse.c:220
onig_node_new_list
Node * onig_node_new_list(Node *left, Node *right)
Definition: regparse.c:1255
CtypeNode::ascii_range
int ascii_range
Definition: regparse.h:257
RUBY_SYMBOL_EXPORT_BEGIN
#define RUBY_SYMBOL_EXPORT_BEGIN
Definition: missing.h:38
NODE_BACKREFS_SIZE
#define NODE_BACKREFS_SIZE
Definition: regparse.h:97
onig_node_new_str
Node * onig_node_new_str(const UChar *s, const UChar *end)
Definition: regparse.c:1548
CtypeNode
Definition: regparse.h:253
ScanEnv::error_end
UChar * error_end
Definition: regparse.h:297
onig_node_str_clear
void onig_node_str_clear(Node *node)
Definition: regparse.c:1516
ScanEnv::mem_nodes_dynamic
Node ** mem_nodes_dynamic
Definition: regparse.h:309
ScanEnv::bt_mem_end
BitStatusType bt_mem_end
Definition: regparse.h:292
UChar
#define UChar
Definition: oniguruma.h:108
ScanEnv::enc
OnigEncoding enc
Definition: regparse.h:288
onig_node_free
void onig_node_free(Node *node)
Definition: regparse.c:1029
_Node::anchor
AnchorNode anchor
Definition: regparse.h:268
ScanEnv
Definition: regparse.h:285
ScanEnv::case_fold_flag
OnigCaseFoldType case_fold_flag
Definition: regparse.h:287
OnigDistance
size_t OnigDistance
Definition: oniguruma.h:114
onig_reduce_nested_quantifier
void onig_reduce_nested_quantifier(Node *pnode, Node *cnode)
Definition: regparse.c:2269
ConsAltNode::cdr
struct _Node * cdr
Definition: regparse.h:250
CallNode::state
int state
Definition: regparse.h:220
list
struct rb_encoding_entry * list
Definition: encoding.c:47
ScanEnv::option
OnigOptionType option
Definition: regparse.h:286
QtfrNode::target
struct _Node * target
Definition: regparse.h:177
QtfrNode::greedy
int greedy
Definition: regparse.h:180
onig_parse_make_tree
int onig_parse_make_tree(Node **root, const UChar *pattern, const UChar *end, regex_t *reg, ScanEnv *env)
Definition: regparse.c:6291
BRefNode::base
NodeBase base
Definition: regparse.h:231
onig_scan_unsigned_number
int onig_scan_unsigned_number(UChar **src, const UChar *end, OnigEncoding enc)
Definition: regparse.c:1623
AnchorNode::base
NodeBase base
Definition: regparse.h:240
regint.h
AnchorNode::char_len
int char_len
Definition: regparse.h:243
CallNode::name
UChar * name
Definition: regparse.h:222
EncloseNode::target
struct _Node * target
Definition: regparse.h:196
onig_strcpy
void onig_strcpy(UChar *dest, const UChar *src, const UChar *end)
Definition: regparse.c:232
Node
struct _Node Node
ScanEnv::bt_mem_start
BitStatusType bt_mem_start
Definition: regparse.h:291
QtfrNode
Definition: regparse.h:174
AnchorNode::ascii_range
int ascii_range
Definition: regparse.h:244
EncloseNode::option
OnigOptionType option
Definition: regparse.h:195
EncloseNode::call_addr
AbsAddrType call_addr
Definition: regparse.h:197
env
#define env
onig_renumber_name_table
int onig_renumber_name_table(regex_t *reg, GroupNumRemap *map)
Definition: regparse.c:572
BRefNode::back_num
int back_num
Definition: regparse.h:233
ScanEnv::warnings_flag
int warnings_flag
Definition: regparse.h:316
UnsetAddr::offset
int offset
Definition: regparse.h:208
OnigEncodingTypeST
Definition: oniguruma.h:158
ScanEnv::capture_history
BitStatusType capture_history
Definition: regparse.h:290
onig_node_new_anchor
Node * onig_node_new_anchor(int type)
Definition: regparse.c:1291