Ruby 2.7.7p221 (2022-11-24 revision 168ec2b1e5ad0e4688e963d9de019557c78feed9)
regparse.h
Go to the documentation of this file.
1#ifndef ONIGMO_REGPARSE_H
2#define ONIGMO_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-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#include "regint.h"
34
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) \
71 do { \
72 int value = ntype; \
73 memcpy(&((node)->u.base.type), &value, sizeof(int)); \
74 } while (0)
75
76#define NSTR(node) (&((node)->u.str))
77#define NCCLASS(node) (&((node)->u.cclass))
78#define NCTYPE(node) (&((node)->u.ctype))
79#define NBREF(node) (&((node)->u.bref))
80#define NQTFR(node) (&((node)->u.qtfr))
81#define NENCLOSE(node) (&((node)->u.enclose))
82#define NANCHOR(node) (&((node)->u.anchor))
83#define NCONS(node) (&((node)->u.cons))
84#define NCALL(node) (&((node)->u.call))
85
86#define NCAR(node) (NCONS(node)->car)
87#define NCDR(node) (NCONS(node)->cdr)
88
89
90
91#define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML)
92#define ANCHOR_END_BUF_MASK (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)
93
94#define ENCLOSE_MEMORY (1<<0)
95#define ENCLOSE_OPTION (1<<1)
96#define ENCLOSE_STOP_BACKTRACK (1<<2)
97#define ENCLOSE_CONDITION (1<<3)
98#define ENCLOSE_ABSENT (1<<4)
99
100#define NODE_STR_MARGIN 16
101#define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */
102#define NODE_BACKREFS_SIZE 6
103
104#define NSTR_RAW (1<<0) /* by backslashed number */
105#define NSTR_AMBIG (1<<1)
106#define NSTR_DONT_GET_OPT_INFO (1<<2)
107
108#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s)
109#define NSTRING_SET_RAW(node) (node)->u.str.flag |= NSTR_RAW
110#define NSTRING_CLEAR_RAW(node) (node)->u.str.flag &= ~NSTR_RAW
111#define NSTRING_SET_AMBIG(node) (node)->u.str.flag |= NSTR_AMBIG
112#define NSTRING_SET_DONT_GET_OPT_INFO(node) \
113 (node)->u.str.flag |= NSTR_DONT_GET_OPT_INFO
114#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0)
115#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0)
116#define NSTRING_IS_DONT_GET_OPT_INFO(node) \
117 (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0)
118
119#define BACKREFS_P(br) \
120 (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
121
122#define NQ_TARGET_ISNOT_EMPTY 0
123#define NQ_TARGET_IS_EMPTY 1
124#define NQ_TARGET_IS_EMPTY_MEM 2
125#define NQ_TARGET_IS_EMPTY_REC 3
126
127/* status bits */
128#define NST_MIN_FIXED (1<<0)
129#define NST_MAX_FIXED (1<<1)
130#define NST_CLEN_FIXED (1<<2)
131#define NST_MARK1 (1<<3)
132#define NST_MARK2 (1<<4)
133#define NST_MEM_BACKREFED (1<<5)
134#define NST_STOP_BT_SIMPLE_REPEAT (1<<6)
135#define NST_RECURSION (1<<7)
136#define NST_CALLED (1<<8)
137#define NST_ADDR_FIXED (1<<9)
138#define NST_NAMED_GROUP (1<<10)
139#define NST_NAME_REF (1<<11)
140#define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */
141#define NST_NEST_LEVEL (1<<13)
142#define NST_BY_NUMBER (1<<14) /* {n,m} */
143
144#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f)
145#define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f)
146
147#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0)
148#define IS_ENCLOSE_ADDR_FIXED(en) (((en)->state & NST_ADDR_FIXED) != 0)
149#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0)
150#define IS_ENCLOSE_MARK1(en) (((en)->state & NST_MARK1) != 0)
151#define IS_ENCLOSE_MARK2(en) (((en)->state & NST_MARK2) != 0)
152#define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0)
153#define IS_ENCLOSE_MAX_FIXED(en) (((en)->state & NST_MAX_FIXED) != 0)
154#define IS_ENCLOSE_CLEN_FIXED(en) (((en)->state & NST_CLEN_FIXED) != 0)
155#define IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(en) \
156 (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0)
157#define IS_ENCLOSE_NAMED_GROUP(en) (((en)->state & NST_NAMED_GROUP) != 0)
158#define IS_ENCLOSE_NAME_REF(en) (((en)->state & NST_NAME_REF) != 0)
159
160#define SET_CALL_RECURSION(node) (node)->u.call.state |= NST_RECURSION
161#define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0)
162#define IS_CALL_NAME_REF(cn) (((cn)->state & NST_NAME_REF) != 0)
163#define IS_BACKREF_NAME_REF(bn) (((bn)->state & NST_NAME_REF) != 0)
164#define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0)
165#define IS_QUANTIFIER_IN_REPEAT(qn) (((qn)->state & NST_IN_REPEAT) != 0)
166#define IS_QUANTIFIER_BY_NUMBER(qn) (((qn)->state & NST_BY_NUMBER) != 0)
167
168#define CALLNODE_REFNUM_UNDEF -1
169
170typedef struct {
174 unsigned int flag;
175 int capa; /* (allocated size - 1) or 0: use buf[] */
177} StrNode;
178
179typedef struct {
181 int state;
182 struct _Node* target;
183 int lower;
184 int upper;
189 int is_referred; /* include called node. don't eliminate even if {0} */
190#ifdef USE_COMBINATION_EXPLOSION_CHECK
191 int comb_exp_check_num; /* 1,2,3...: check, 0: no check */
192#endif
193} QtfrNode;
194
195typedef struct {
197 int state;
198 int type;
202 struct _Node* target;
203 /* for multiple call reference */
204 OnigDistance min_len; /* min length (byte) */
205 OnigDistance max_len; /* max length (byte) */
206 int char_len; /* character length */
207 int opt_count; /* referenced count in optimize_node_left() */
209
210#ifdef USE_SUBEXP_CALL
211
212typedef struct {
214 struct _Node* target;
215} UnsetAddr;
216
217typedef struct {
218 int num;
219 int alloc;
222
223typedef struct {
225 int state;
229 struct _Node* target; /* EncloseNode : ENCLOSE_MEMORY */
231} CallNode;
232
233#endif
234
235typedef struct {
237 int state;
239 int back_static[NODE_BACKREFS_SIZE];
242} BRefNode;
243
244typedef struct {
246 int type;
247 struct _Node* target;
250} AnchorNode;
251
252typedef struct {
254 struct _Node* car;
255 struct _Node* cdr;
257
258typedef struct {
260 int ctype;
261 int not;
263} CtypeNode;
264
265typedef struct _Node {
266 union {
276#ifdef USE_SUBEXP_CALL
278#endif
279 } u;
281
282
283#define NULL_NODE ((Node* )0)
284
285#define SCANENV_MEMNODES_SIZE 8
286#define SCANENV_MEM_NODES(senv) \
287 (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \
288 (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static)
289
290typedef struct {
303 regex_t* reg; /* for reg->names only */
304#ifdef USE_SUBEXP_CALL
306#endif
309#ifdef USE_NAMED_GROUP
311#endif
313 Node* mem_nodes_static[SCANENV_MEMNODES_SIZE];
315#ifdef USE_COMBINATION_EXPLOSION_CHECK
316 int num_comb_exp_check;
317 int comb_exp_max_regnum;
318 int curr_max_regnum;
319 int has_recursion;
320#endif
321 unsigned int parse_depth;
323#ifdef RUBY
324 const char* sourcefile;
326#endif
327} ScanEnv;
328
329
330#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0)
331#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0)
332#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0)
333
334#ifdef USE_NAMED_GROUP
335typedef struct {
338
339extern int onig_renumber_name_table(regex_t* reg, GroupNumRemap* map);
340#endif
341
342extern int onig_strncmp(const UChar* s1, const UChar* s2, int n);
343extern void onig_strcpy(UChar* dest, const UChar* src, const UChar* end);
344extern void onig_scan_env_set_error_string(ScanEnv* env, int ecode, UChar* arg, UChar* arg_end);
345extern int onig_scan_unsigned_number(UChar** src, const UChar* end, OnigEncoding enc);
346extern void onig_reduce_nested_quantifier(Node* pnode, Node* cnode);
347extern void onig_node_conv_to_str_node(Node* node, int raw);
348extern int onig_node_str_cat(Node* node, const UChar* s, const UChar* end);
349extern int onig_node_str_set(Node* node, const UChar* s, const UChar* end);
350extern void onig_node_free(Node* node);
351extern Node* onig_node_new_enclose(int type);
352extern Node* onig_node_new_anchor(int type);
353extern Node* onig_node_new_str(const UChar* s, const UChar* end);
354extern Node* onig_node_new_list(Node* left, Node* right);
355extern Node* onig_node_list_add(Node* list, Node* x);
356extern Node* onig_node_new_alt(Node* left, Node* right);
357extern void onig_node_str_clear(Node* node);
358extern int onig_names_free(regex_t* reg);
359extern int onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env);
361
362#ifdef ONIG_DEBUG
363# ifdef USE_NAMED_GROUP
364extern int onig_print_names(FILE*, regex_t*);
365# endif
366#endif
367
369
370#endif /* ONIGMO_REGPARSE_H */
struct rb_encoding_entry * list
Definition: encoding.c:56
VALUE type(ANYARGS)
ANYARGS-ed function type.
Definition: cxxanyargs.hpp:39
unsigned char buf[MIME_BUF_SIZE]
Definition: nkf.c:4322
unsigned int OnigCaseFoldType
Definition: onigmo.h:95
#define UChar
Definition: onigmo.h:76
unsigned int OnigOptionType
Definition: onigmo.h:445
size_t OnigDistance
Definition: onigmo.h:82
const char size_t n
#define RUBY_SYMBOL_EXPORT_BEGIN
__inline__ const void *__restrict__ src
#define RUBY_SYMBOL_EXPORT_END
const char * s2
int AbsAddrType
Definition: regint.h:668
unsigned int BitStatusType
Definition: regint.h:352
int onig_strncmp(const UChar *s1, const UChar *s2, int n)
Node * onig_node_new_list(Node *left, Node *right)
Definition: regparse.c:1186
Node * onig_node_new_anchor(int type)
Definition: regparse.c:1222
int onig_node_str_cat(Node *node, const UChar *s, const UChar *end)
Definition: regparse.c:1376
int onig_parse_make_tree(Node **root, const UChar *pattern, const UChar *end, regex_t *reg, ScanEnv *env)
Definition: regparse.c:6611
int onig_free_shared_cclass_table(void)
void onig_scan_env_set_error_string(ScanEnv *env, int ecode, UChar *arg, UChar *arg_end)
Definition: regparse.c:6638
Node * onig_node_list_add(Node *list, Node *x)
Definition: regparse.c:1192
struct _Node Node
#define NODE_STR_BUF_SIZE
Definition: regparse.h:101
void onig_node_free(Node *node)
Definition: regparse.c:1062
Node * onig_node_new_enclose(int type)
Definition: regparse.c:1347
Node * onig_node_new_alt(Node *left, Node *right)
Definition: regparse.c:1210
Node * onig_node_new_str(const UChar *s, const UChar *end)
Definition: regparse.c:1481
int onig_node_str_set(Node *node, const UChar *s, const UChar *end)
Definition: regparse.c:1412
void onig_node_conv_to_str_node(Node *node, int raw)
void onig_node_str_clear(Node *node)
Definition: regparse.c:1449
int onig_names_free(regex_t *reg)
Definition: regparse.c:525
void onig_reduce_nested_quantifier(Node *pnode, Node *cnode)
Definition: regparse.c:2204
void onig_strcpy(UChar *dest, const UChar *src, const UChar *end)
Definition: regparse.c:259
#define SCANENV_MEMNODES_SIZE
Definition: regparse.h:285
int onig_renumber_name_table(regex_t *reg, GroupNumRemap *map)
Definition: regparse.c:611
int onig_scan_unsigned_number(UChar **src, const UChar *end, OnigEncoding enc)
Definition: regparse.c:1556
#define NODE_BACKREFS_SIZE
Definition: regparse.h:102
QtfrNode qtfr
Definition: regparse.h:270
CClassNode cclass
Definition: regparse.h:269
StrNode str
Definition: regparse.h:268
BRefNode bref
Definition: regparse.h:272
EncloseNode enclose
Definition: regparse.h:271
AnchorNode anchor
Definition: regparse.h:273
ConsAltNode cons
Definition: regparse.h:274
CallNode call
Definition: regparse.h:277
CtypeNode ctype
Definition: regparse.h:275
union _Node::@214 u
NodeBase base
Definition: regparse.h:267
int ascii_range
Definition: regparse.h:249
int type
Definition: regparse.h:246
NodeBase base
Definition: regparse.h:245
int char_len
Definition: regparse.h:248
struct _Node * target
Definition: regparse.h:247
NodeBase base
Definition: regparse.h:236
int state
Definition: regparse.h:237
int nest_level
Definition: regparse.h:241
int back_num
Definition: regparse.h:238
int * back_dynamic
Definition: regparse.h:240
UChar * name
Definition: regparse.h:227
struct _Node * target
Definition: regparse.h:229
NodeBase base
Definition: regparse.h:224
int state
Definition: regparse.h:225
UChar * name_end
Definition: regparse.h:228
UnsetAddrList * unset_addr_list
Definition: regparse.h:230
int group_num
Definition: regparse.h:226
struct _Node * cdr
Definition: regparse.h:255
NodeBase base
Definition: regparse.h:253
struct _Node * car
Definition: regparse.h:254
int ascii_range
Definition: regparse.h:262
NodeBase base
Definition: regparse.h:259
int not
Definition: regparse.h:261
int ctype
Definition: regparse.h:260
NodeBase base
Definition: regparse.h:196
OnigDistance min_len
Definition: regparse.h:204
OnigOptionType option
Definition: regparse.h:200
int opt_count
Definition: regparse.h:207
int char_len
Definition: regparse.h:206
AbsAddrType call_addr
Definition: regparse.h:201
OnigDistance max_len
Definition: regparse.h:205
struct _Node * target
Definition: regparse.h:202
int regnum
Definition: regparse.h:199
int lower
Definition: regparse.h:183
struct _Node * target
Definition: regparse.h:182
int target_empty_info
Definition: regparse.h:186
struct _Node * head_exact
Definition: regparse.h:187
NodeBase base
Definition: regparse.h:180
int greedy
Definition: regparse.h:185
int is_referred
Definition: regparse.h:189
int upper
Definition: regparse.h:184
struct _Node * next_head_exact
Definition: regparse.h:188
int state
Definition: regparse.h:181
UChar * error
Definition: regparse.h:301
BitStatusType bt_mem_end
Definition: regparse.h:297
int num_call
Definition: regparse.h:307
OnigOptionType option
Definition: regparse.h:291
int mem_alloc
Definition: regparse.h:312
Node ** mem_nodes_dynamic
Definition: regparse.h:314
UChar * pattern_end
Definition: regparse.h:300
BitStatusType bt_mem_start
Definition: regparse.h:296
int sourceline
Definition: regparse.h:325
int num_mem
Definition: regparse.h:308
UnsetAddrList * unset_addr_list
Definition: regparse.h:305
int num_named
Definition: regparse.h:310
UChar * error_end
Definition: regparse.h:302
unsigned int parse_depth
Definition: regparse.h:321
BitStatusType backrefed_mem
Definition: regparse.h:298
OnigEncoding enc
Definition: regparse.h:293
BitStatusType capture_history
Definition: regparse.h:295
OnigCaseFoldType case_fold_flag
Definition: regparse.h:292
const char * sourcefile
Definition: regparse.h:324
regex_t * reg
Definition: regparse.h:303
const OnigSyntaxType * syntax
Definition: regparse.h:294
int warnings_flag
Definition: regparse.h:322
UChar * pattern
Definition: regparse.h:299
UChar * s
Definition: regparse.h:172
unsigned int flag
Definition: regparse.h:174
UChar * end
Definition: regparse.h:173
int capa
Definition: regparse.h:175
NodeBase base
Definition: regparse.h:171
struct _Node * target
Definition: regparse.h:214
int offset
Definition: regparse.h:213
UnsetAddr * us
Definition: regparse.h:220
#define env