Ruby
2.7.0p0(2019-12-25revision647ee6f091eafcce70ffb75ddf7e121e192ab217)
|
Go to the documentation of this file. 1 #ifndef ONIGMO_REGPARSE_H
2 #define ONIGMO_REGPARSE_H
51 #define NTYPE2BIT(type) (1<<(type))
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)
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)
69 #define NTYPE(node) ((node)->u.base.type)
70 #define SET_NTYPE(node, ntype) \
73 memcpy(&((node)->u.base.type), &value, sizeof(int)); \
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))
86 #define NCAR(node) (NCONS(node)->car)
87 #define NCDR(node) (NCONS(node)->cdr)
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)
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)
100 #define NODE_STR_MARGIN 16
101 #define NODE_STR_BUF_SIZE 24
102 #define NODE_BACKREFS_SIZE 6
104 #define NSTR_RAW (1<<0)
105 #define NSTR_AMBIG (1<<1)
106 #define NSTR_DONT_GET_OPT_INFO (1<<2)
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)
119 #define BACKREFS_P(br) \
120 (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
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
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)
141 #define NST_NEST_LEVEL (1<<13)
142 #define NST_BY_NUMBER (1<<14)
144 #define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f)
145 #define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f)
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)
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)
168 #define CALLNODE_REFNUM_UNDEF -1
190 #ifdef USE_COMBINATION_EXPLOSION_CHECK
191 int comb_exp_check_num;
210 #ifdef USE_SUBEXP_CALL
276 #ifdef USE_SUBEXP_CALL
283 #define NULL_NODE ((Node* )0)
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)
304 #ifdef USE_SUBEXP_CALL
309 #ifdef USE_NAMED_GROUP
315 #ifdef USE_COMBINATION_EXPLOSION_CHECK
316 int num_comb_exp_check;
317 int comb_exp_max_regnum;
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)
334 #ifdef USE_NAMED_GROUP
363 # ifdef USE_NAMED_GROUP
int onig_scan_unsigned_number(UChar **src, const UChar *end, OnigEncoding enc)
#define RUBY_SYMBOL_EXPORT_END
unsigned int BitStatusType
BitStatusType capture_history
void onig_node_conv_to_str_node(Node *node, int raw)
struct _Node * next_head_exact
OnigCaseFoldType case_fold_flag
Node * onig_node_new_alt(Node *left, Node *right)
Node * onig_node_new_anchor(int type)
Node * onig_node_new_list(Node *left, Node *right)
struct _Node * head_exact
BitStatusType backrefed_mem
UnsetAddrList * unset_addr_list
int onig_strncmp(const UChar *s1, const UChar *s2, int n)
UnsetAddrList * unset_addr_list
Node * onig_node_new_str(const UChar *s, const UChar *end)
Node * onig_node_list_add(Node *list, Node *x)
void onig_node_free(Node *node)
unsigned int OnigOptionType
Node ** mem_nodes_dynamic
int onig_free_shared_cclass_table(void)
const typedef OnigEncodingType * OnigEncoding
struct rb_encoding_entry * list
void onig_scan_env_set_error_string(ScanEnv *env, int ecode, UChar *arg, UChar *arg_end)
#define NODE_STR_BUF_SIZE
void onig_reduce_nested_quantifier(Node *pnode, Node *cnode)
unsigned char buf[MIME_BUF_SIZE]
int onig_node_str_set(Node *node, const UChar *s, const UChar *end)
int onig_renumber_name_table(regex_t *reg, GroupNumRemap *map)
#define RUBY_SYMBOL_EXPORT_BEGIN
int onig_node_str_cat(Node *node, const UChar *s, const UChar *end)
Node * onig_node_new_enclose(int type)
void onig_strcpy(UChar *dest, const UChar *src, const UChar *end)
#define NODE_BACKREFS_SIZE
const OnigSyntaxType * syntax
#define SCANENV_MEMNODES_SIZE
int onig_names_free(regex_t *reg)
void onig_node_str_clear(Node *node)
unsigned int OnigCaseFoldType
BitStatusType bt_mem_start
VALUE type(ANYARGS)
ANYARGS-ed function type.
int onig_parse_make_tree(Node **root, const UChar *pattern, const UChar *end, regex_t *reg, ScanEnv *env)