1 /* -*- buffer-read-only: t -*-
2 !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
3 This file is built by regen/regcomp.pl from regcomp.sym.
4 Any changes made here will be lost!
7 /* Regops and State definitions */
9 #define REGNODE_MAX 102
10 #define REGMATCH_STATE_MAX 142
12 #define END 0 /* 0000 End of program. */
13 #define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
14 #define SBOL 2 /* 0x02 Match "" at beginning of line: /^/, /\A/ */
15 #define BOL 2 /* 0x02 type alias */
16 #define MBOL 3 /* 0x03 Same, assuming multiline: /^/m */
17 #define SEOL 4 /* 0x04 Match "" at end of line: /$/ */
18 #define EOL 4 /* 0x04 type alias */
19 #define MEOL 5 /* 0x05 Same, assuming multiline: /$/m */
20 #define EOS 6 /* 0x06 Match "" at end of string: /\z/ */
21 #define GPOS 7 /* 0x07 Matches where last m//g left off. */
22 #define BOUND 8 /* 0x08 Like BOUNDA for non-utf8, otherwise match "" between any Unicode \w\W or \W\w */
23 #define BOUNDL 9 /* 0x09 Like BOUND/BOUNDU, but \w and \W are defined by current locale */
24 #define BOUNDU 10 /* 0x0a Match "" at any boundary of a given type using /u rules. */
25 #define BOUNDA 11 /* 0x0b Match "" at any boundary between \w\W or \W\w, where \w is [_a-zA-Z0-9] */
26 #define NBOUND 12 /* 0x0c Like NBOUNDA for non-utf8, otherwise match "" between any Unicode \w\w or \W\W */
27 #define NBOUNDL 13 /* 0x0d Like NBOUND/NBOUNDU, but \w and \W are defined by current locale */
28 #define NBOUNDU 14 /* 0x0e Match "" at any non-boundary of a given type using using /u rules. */
29 #define NBOUNDA 15 /* 0x0f Match "" betweeen any \w\w or \W\W, where \w is [_a-zA-Z0-9] */
30 #define REG_ANY 16 /* 0x10 Match any one character (except newline). */
31 #define SANY 17 /* 0x11 Match any one character. */
32 #define ANYOF 18 /* 0x12 Match character in (or not in) this class, single char match only */
33 #define ANYOFD 19 /* 0x13 Like ANYOF, but /d is in effect */
34 #define ANYOFL 20 /* 0x14 Like ANYOF, but /l is in effect */
35 #define ANYOFPOSIXL 21 /* 0x15 Like ANYOFL, but matches [[:posix:]] classes */
36 #define ANYOFH 22 /* 0x16 Like ANYOF, but only has "High" matches, none in the bitmap; */
37 #define ANYOFHb 23 /* 0x17 Like ANYOFH, but all matches share the same first byte, the repurposed flags field contains it */
38 #define ANYOFM 24 /* 0x18 Like ANYOF, but matches an invariant byte as determined by the mask and arg */
39 #define NANYOFM 25 /* 0x19 complement of ANYOFM */
40 #define POSIXD 26 /* 0x1a Some [[:class:]] under /d; the FLAGS field gives which one */
41 #define POSIXL 27 /* 0x1b Some [[:class:]] under /l; the FLAGS field gives which one */
42 #define POSIXU 28 /* 0x1c Some [[:class:]] under /u; the FLAGS field gives which one */
43 #define POSIXA 29 /* 0x1d Some [[:class:]] under /a; the FLAGS field gives which one */
44 #define NPOSIXD 30 /* 0x1e complement of POSIXD, [[:^class:]] */
45 #define NPOSIXL 31 /* 0x1f complement of POSIXL, [[:^class:]] */
46 #define NPOSIXU 32 /* 0x20 complement of POSIXU, [[:^class:]] */
47 #define NPOSIXA 33 /* 0x21 complement of POSIXA, [[:^class:]] */
48 #define CLUMP 34 /* 0x22 Match any extended grapheme cluster sequence */
49 #define BRANCH 35 /* 0x23 Match this alternative, or the next... */
50 #define EXACT 36 /* 0x24 Match this string (preceded by length). */
51 #define EXACTL 37 /* 0x25 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */
52 #define EXACTF 38 /* 0x26 Match this string using /id rules (w/len); (string not UTF-8, not guaranteed to be folded). */
53 #define EXACTFL 39 /* 0x27 Match this string using /il rules (w/len); (string not guaranteed to be folded). */
54 #define EXACTFU 40 /* 0x28 Match this string using /iu rules (w/len); (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
55 #define EXACTFAA 41 /* 0x29 Match this string using /iaa rules (w/len) (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
56 #define EXACTFUP 42 /* 0x2a Match this string using /iu rules (w/len); (string not UTF-8, not guaranteed to be folded; and its Problematic). */
57 #define EXACTFLU8 43 /* 0x2b Like EXACTFU, but use /il, UTF-8, folded, and everything in it is above 255. */
58 #define EXACTFAA_NO_TRIE 44 /* 0x2c Match this string using /iaa rules (w/len) (string not UTF-8, not guaranteed to be folded, not currently trie-able). */
59 #define EXACT_ONLY8 45 /* 0x2d Like EXACT, but only UTF-8 encoded targets can match */
60 #define EXACTFU_ONLY8 46 /* 0x2e Like EXACTFU, but only UTF-8 encoded targets can match */
61 #define EXACTFU_S_EDGE 47 /* 0x2f /di rules, but nothing in it precludes /ui, except begins and/or ends with [Ss]; (string not UTF-8; compile-time only). */
62 #define NOTHING 48 /* 0x30 Match empty string. */
63 #define TAIL 49 /* 0x31 Match empty string. Can jump here from outside. */
64 #define STAR 50 /* 0x32 Match this (simple) thing 0 or more times. */
65 #define PLUS 51 /* 0x33 Match this (simple) thing 1 or more times. */
66 #define CURLY 52 /* 0x34 Match this simple thing {n,m} times. */
67 #define CURLYN 53 /* 0x35 Capture next-after-this simple thing */
68 #define CURLYM 54 /* 0x36 Capture this medium-complex thing {n,m} times. */
69 #define CURLYX 55 /* 0x37 Match this complex thing {n,m} times. */
70 #define WHILEM 56 /* 0x38 Do curly processing and see if rest matches. */
71 #define OPEN 57 /* 0x39 Mark this point in input as start of #n. */
72 #define CLOSE 58 /* 0x3a Close corresponding OPEN of #n. */
73 #define SROPEN 59 /* 0x3b Same as OPEN, but for script run */
74 #define SRCLOSE 60 /* 0x3c Close preceding SROPEN */
75 #define REF 61 /* 0x3d Match some already matched string */
76 #define REFF 62 /* 0x3e Match already matched string, using /di rules. */
77 #define REFFL 63 /* 0x3f Match already matched string, using /li rules. */
78 #define REFFU 64 /* 0x40 Match already matched string, usng /ui. */
79 #define REFFA 65 /* 0x41 Match already matched string, using /aai rules. */
80 #define REFN 66 /* 0x42 Match some already matched string */
81 #define REFFN 67 /* 0x43 Match already matched string, using /di rules. */
82 #define REFFLN 68 /* 0x44 Match already matched string, using /li rules. */
83 #define REFFUN 69 /* 0x45 Match already matched string, using /ui rules. */
84 #define REFFAN 70 /* 0x46 Match already matched string, using /aai rules. */
85 #define LONGJMP 71 /* 0x47 Jump far away. */
86 #define BRANCHJ 72 /* 0x48 BRANCH with long offset. */
87 #define IFMATCH 73 /* 0x49 Succeeds if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
88 #define UNLESSM 74 /* 0x4a Fails if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
89 #define SUSPEND 75 /* 0x4b "Independent" sub-RE. */
90 #define IFTHEN 76 /* 0x4c Switch, should be preceded by switcher. */
91 #define GROUPP 77 /* 0x4d Whether the group matched. */
92 #define EVAL 78 /* 0x4e Execute some Perl code. */
93 #define MINMOD 79 /* 0x4f Next operator is not greedy. */
94 #define LOGICAL 80 /* 0x50 Next opcode should set the flag only. */
95 #define RENUM 81 /* 0x51 Group with independently numbered parens. */
96 #define TRIE 82 /* 0x52 Match many EXACT(F[ALU]?)? at once. flags==type */
97 #define TRIEC 83 /* 0x53 Same as TRIE, but with embedded charclass data */
98 #define AHOCORASICK 84 /* 0x54 Aho Corasick stclass. flags==type */
99 #define AHOCORASICKC 85 /* 0x55 Same as AHOCORASICK, but with embedded charclass data */
100 #define GOSUB 86 /* 0x56 recurse to paren arg1 at (signed) ofs arg2 */
101 #define GROUPPN 87 /* 0x57 Whether the group matched. */
102 #define INSUBP 88 /* 0x58 Whether we are in a specific recurse. */
103 #define DEFINEP 89 /* 0x59 Never execute directly. */
104 #define ENDLIKE 90 /* 0x5a Used only for the type field of verbs */
105 #define OPFAIL 91 /* 0x5b Same as (?!), but with verb arg */
106 #define ACCEPT 92 /* 0x5c Accepts the current matched string, with verbar */
107 #define VERB 93 /* 0x5d Used only for the type field of verbs */
108 #define PRUNE 94 /* 0x5e Pattern fails at this startpoint if no-backtracking through this */
109 #define MARKPOINT 95 /* 0x5f Push the current location for rollback by cut. */
110 #define SKIP 96 /* 0x60 On failure skip forward (to the mark) before retrying */
111 #define COMMIT 97 /* 0x61 Pattern fails outright if backtracking through this */
112 #define CUTGROUP 98 /* 0x62 On failure go to the next alternation in the group */
113 #define KEEPS 99 /* 0x63 $& begins here. */
114 #define LNBREAK 100 /* 0x64 generic newline pattern */
115 #define OPTIMIZED 101 /* 0x65 Placeholder for dump. */
116 #define PSEUDO 102 /* 0x66 Pseudo opcode for internal use. */
117 /* ------------ States ------------- */
118 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
119 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
120 #define EVAL_B (REGNODE_MAX + 3) /* state for EVAL */
121 #define EVAL_B_fail (REGNODE_MAX + 4) /* state for EVAL */
122 #define EVAL_postponed_AB (REGNODE_MAX + 5) /* state for EVAL */
123 #define EVAL_postponed_AB_fail (REGNODE_MAX + 6) /* state for EVAL */
124 #define CURLYX_end (REGNODE_MAX + 7) /* state for CURLYX */
125 #define CURLYX_end_fail (REGNODE_MAX + 8) /* state for CURLYX */
126 #define WHILEM_A_pre (REGNODE_MAX + 9) /* state for WHILEM */
127 #define WHILEM_A_pre_fail (REGNODE_MAX + 10) /* state for WHILEM */
128 #define WHILEM_A_min (REGNODE_MAX + 11) /* state for WHILEM */
129 #define WHILEM_A_min_fail (REGNODE_MAX + 12) /* state for WHILEM */
130 #define WHILEM_A_max (REGNODE_MAX + 13) /* state for WHILEM */
131 #define WHILEM_A_max_fail (REGNODE_MAX + 14) /* state for WHILEM */
132 #define WHILEM_B_min (REGNODE_MAX + 15) /* state for WHILEM */
133 #define WHILEM_B_min_fail (REGNODE_MAX + 16) /* state for WHILEM */
134 #define WHILEM_B_max (REGNODE_MAX + 17) /* state for WHILEM */
135 #define WHILEM_B_max_fail (REGNODE_MAX + 18) /* state for WHILEM */
136 #define BRANCH_next (REGNODE_MAX + 19) /* state for BRANCH */
137 #define BRANCH_next_fail (REGNODE_MAX + 20) /* state for BRANCH */
138 #define CURLYM_A (REGNODE_MAX + 21) /* state for CURLYM */
139 #define CURLYM_A_fail (REGNODE_MAX + 22) /* state for CURLYM */
140 #define CURLYM_B (REGNODE_MAX + 23) /* state for CURLYM */
141 #define CURLYM_B_fail (REGNODE_MAX + 24) /* state for CURLYM */
142 #define IFMATCH_A (REGNODE_MAX + 25) /* state for IFMATCH */
143 #define IFMATCH_A_fail (REGNODE_MAX + 26) /* state for IFMATCH */
144 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
145 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
146 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
147 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
148 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
149 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
150 #define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
151 #define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
152 #define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
153 #define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
154 #define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
155 #define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
156 #define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
157 #define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
159 /* PL_regkind[] What type of regop or state is this. */
162 EXTCONST U8 PL_regkind[];
164 EXTCONST U8 PL_regkind[] = {
178 NBOUND, /* NBOUNDL */
179 NBOUND, /* NBOUNDU */
180 NBOUND, /* NBOUNDA */
181 REG_ANY, /* REG_ANY */
186 ANYOF, /* ANYOFPOSIXL */
190 ANYOFM, /* NANYOFM */
195 NPOSIXD, /* NPOSIXD */
196 NPOSIXD, /* NPOSIXL */
197 NPOSIXD, /* NPOSIXU */
198 NPOSIXD, /* NPOSIXA */
206 EXACT, /* EXACTFAA */
207 EXACT, /* EXACTFUP */
208 EXACT, /* EXACTFLU8 */
209 EXACT, /* EXACTFAA_NO_TRIE */
210 EXACT, /* EXACT_ONLY8 */
211 EXACT, /* EXACTFU_ONLY8 */
212 EXACT, /* EXACTFU_S_EDGE */
213 NOTHING, /* NOTHING */
225 SRCLOSE, /* SRCLOSE */
236 LONGJMP, /* LONGJMP */
237 BRANCHJ, /* BRANCHJ */
238 BRANCHJ, /* IFMATCH */
239 BRANCHJ, /* UNLESSM */
240 BRANCHJ, /* SUSPEND */
241 BRANCHJ, /* IFTHEN */
245 LOGICAL, /* LOGICAL */
249 TRIE, /* AHOCORASICK */
250 TRIE, /* AHOCORASICKC */
252 GROUPPN, /* GROUPPN */
254 DEFINEP, /* DEFINEP */
255 ENDLIKE, /* ENDLIKE */
256 ENDLIKE, /* OPFAIL */
257 ENDLIKE, /* ACCEPT */
260 VERB, /* MARKPOINT */
265 LNBREAK, /* LNBREAK */
266 NOTHING, /* OPTIMIZED */
268 /* ------------ States ------------- */
269 TRIE, /* TRIE_next */
270 TRIE, /* TRIE_next_fail */
272 EVAL, /* EVAL_B_fail */
273 EVAL, /* EVAL_postponed_AB */
274 EVAL, /* EVAL_postponed_AB_fail */
275 CURLYX, /* CURLYX_end */
276 CURLYX, /* CURLYX_end_fail */
277 WHILEM, /* WHILEM_A_pre */
278 WHILEM, /* WHILEM_A_pre_fail */
279 WHILEM, /* WHILEM_A_min */
280 WHILEM, /* WHILEM_A_min_fail */
281 WHILEM, /* WHILEM_A_max */
282 WHILEM, /* WHILEM_A_max_fail */
283 WHILEM, /* WHILEM_B_min */
284 WHILEM, /* WHILEM_B_min_fail */
285 WHILEM, /* WHILEM_B_max */
286 WHILEM, /* WHILEM_B_max_fail */
287 BRANCH, /* BRANCH_next */
288 BRANCH, /* BRANCH_next_fail */
289 CURLYM, /* CURLYM_A */
290 CURLYM, /* CURLYM_A_fail */
291 CURLYM, /* CURLYM_B */
292 CURLYM, /* CURLYM_B_fail */
293 IFMATCH, /* IFMATCH_A */
294 IFMATCH, /* IFMATCH_A_fail */
295 CURLY, /* CURLY_B_min */
296 CURLY, /* CURLY_B_min_fail */
297 CURLY, /* CURLY_B_max */
298 CURLY, /* CURLY_B_max_fail */
299 COMMIT, /* COMMIT_next */
300 COMMIT, /* COMMIT_next_fail */
301 MARKPOINT, /* MARKPOINT_next */
302 MARKPOINT, /* MARKPOINT_next_fail */
303 SKIP, /* SKIP_next */
304 SKIP, /* SKIP_next_fail */
305 CUTGROUP, /* CUTGROUP_next */
306 CUTGROUP, /* CUTGROUP_next_fail */
307 KEEPS, /* KEEPS_next */
308 KEEPS, /* KEEPS_next_fail */
314 /* regarglen[] - How large is the argument part of the node (in regnodes) */
316 static const U8 regarglen[] = {
335 EXTRA_SIZE(struct regnode_charclass), /* ANYOF */
336 EXTRA_SIZE(struct regnode_charclass), /* ANYOFD */
337 EXTRA_SIZE(struct regnode_charclass), /* ANYOFL */
338 EXTRA_SIZE(struct regnode_charclass_posixl), /* ANYOFPOSIXL */
339 EXTRA_SIZE(struct regnode_1), /* ANYOFH */
340 EXTRA_SIZE(struct regnode_1), /* ANYOFHb */
341 EXTRA_SIZE(struct regnode_1), /* ANYOFM */
342 EXTRA_SIZE(struct regnode_1), /* NANYOFM */
361 0, /* EXACTFAA_NO_TRIE */
363 0, /* EXACTFU_ONLY8 */
364 0, /* EXACTFU_S_EDGE */
369 EXTRA_SIZE(struct regnode_2), /* CURLY */
370 EXTRA_SIZE(struct regnode_2), /* CURLYN */
371 EXTRA_SIZE(struct regnode_2), /* CURLYM */
372 EXTRA_SIZE(struct regnode_2), /* CURLYX */
374 EXTRA_SIZE(struct regnode_1), /* OPEN */
375 EXTRA_SIZE(struct regnode_1), /* CLOSE */
378 EXTRA_SIZE(struct regnode_1), /* REF */
379 EXTRA_SIZE(struct regnode_1), /* REFF */
380 EXTRA_SIZE(struct regnode_1), /* REFFL */
381 EXTRA_SIZE(struct regnode_1), /* REFFU */
382 EXTRA_SIZE(struct regnode_1), /* REFFA */
383 EXTRA_SIZE(struct regnode_1), /* REFN */
384 EXTRA_SIZE(struct regnode_1), /* REFFN */
385 EXTRA_SIZE(struct regnode_1), /* REFFLN */
386 EXTRA_SIZE(struct regnode_1), /* REFFUN */
387 EXTRA_SIZE(struct regnode_1), /* REFFAN */
388 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
389 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
390 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
391 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
392 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
393 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
394 EXTRA_SIZE(struct regnode_1), /* GROUPP */
395 EXTRA_SIZE(struct regnode_2L), /* EVAL */
398 EXTRA_SIZE(struct regnode_1), /* RENUM */
399 EXTRA_SIZE(struct regnode_1), /* TRIE */
400 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
401 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
402 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
403 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
404 EXTRA_SIZE(struct regnode_1), /* GROUPPN */
405 EXTRA_SIZE(struct regnode_1), /* INSUBP */
406 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
408 EXTRA_SIZE(struct regnode_1), /* OPFAIL */
409 EXTRA_SIZE(struct regnode_2L), /* ACCEPT */
410 EXTRA_SIZE(struct regnode_1), /* VERB */
411 EXTRA_SIZE(struct regnode_1), /* PRUNE */
412 EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
413 EXTRA_SIZE(struct regnode_1), /* SKIP */
414 EXTRA_SIZE(struct regnode_1), /* COMMIT */
415 EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
422 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
424 static const char reg_off_by_arg[] = {
469 0, /* EXACTFAA_NO_TRIE */
471 0, /* EXACTFU_ONLY8 */
472 0, /* EXACTFU_S_EDGE */
510 0, /* AHOCORASICKC */
530 #endif /* REG_COMP_C */
533 /* reg_name[] - Opcode/state names in string form, for debugging */
536 EXTCONST char * PL_reg_name[];
538 EXTCONST char * const PL_reg_name[] = {
540 "SUCCEED", /* 0x01 */
552 "NBOUNDL", /* 0x0d */
553 "NBOUNDU", /* 0x0e */
554 "NBOUNDA", /* 0x0f */
555 "REG_ANY", /* 0x10 */
560 "ANYOFPOSIXL", /* 0x15 */
562 "ANYOFHb", /* 0x17 */
564 "NANYOFM", /* 0x19 */
569 "NPOSIXD", /* 0x1e */
570 "NPOSIXL", /* 0x1f */
571 "NPOSIXU", /* 0x20 */
572 "NPOSIXA", /* 0x21 */
578 "EXACTFL", /* 0x27 */
579 "EXACTFU", /* 0x28 */
580 "EXACTFAA", /* 0x29 */
581 "EXACTFUP", /* 0x2a */
582 "EXACTFLU8", /* 0x2b */
583 "EXACTFAA_NO_TRIE", /* 0x2c */
584 "EXACT_ONLY8", /* 0x2d */
585 "EXACTFU_ONLY8", /* 0x2e */
586 "EXACTFU_S_EDGE", /* 0x2f */
587 "NOTHING", /* 0x30 */
599 "SRCLOSE", /* 0x3c */
610 "LONGJMP", /* 0x47 */
611 "BRANCHJ", /* 0x48 */
612 "IFMATCH", /* 0x49 */
613 "UNLESSM", /* 0x4a */
614 "SUSPEND", /* 0x4b */
619 "LOGICAL", /* 0x50 */
623 "AHOCORASICK", /* 0x54 */
624 "AHOCORASICKC", /* 0x55 */
626 "GROUPPN", /* 0x57 */
628 "DEFINEP", /* 0x59 */
629 "ENDLIKE", /* 0x5a */
634 "MARKPOINT", /* 0x5f */
637 "CUTGROUP", /* 0x62 */
639 "LNBREAK", /* 0x64 */
640 "OPTIMIZED", /* 0x65 */
642 /* ------------ States ------------- */
643 "TRIE_next", /* REGNODE_MAX +0x01 */
644 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
645 "EVAL_B", /* REGNODE_MAX +0x03 */
646 "EVAL_B_fail", /* REGNODE_MAX +0x04 */
647 "EVAL_postponed_AB", /* REGNODE_MAX +0x05 */
648 "EVAL_postponed_AB_fail", /* REGNODE_MAX +0x06 */
649 "CURLYX_end", /* REGNODE_MAX +0x07 */
650 "CURLYX_end_fail", /* REGNODE_MAX +0x08 */
651 "WHILEM_A_pre", /* REGNODE_MAX +0x09 */
652 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x0a */
653 "WHILEM_A_min", /* REGNODE_MAX +0x0b */
654 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0c */
655 "WHILEM_A_max", /* REGNODE_MAX +0x0d */
656 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0e */
657 "WHILEM_B_min", /* REGNODE_MAX +0x0f */
658 "WHILEM_B_min_fail", /* REGNODE_MAX +0x10 */
659 "WHILEM_B_max", /* REGNODE_MAX +0x11 */
660 "WHILEM_B_max_fail", /* REGNODE_MAX +0x12 */
661 "BRANCH_next", /* REGNODE_MAX +0x13 */
662 "BRANCH_next_fail", /* REGNODE_MAX +0x14 */
663 "CURLYM_A", /* REGNODE_MAX +0x15 */
664 "CURLYM_A_fail", /* REGNODE_MAX +0x16 */
665 "CURLYM_B", /* REGNODE_MAX +0x17 */
666 "CURLYM_B_fail", /* REGNODE_MAX +0x18 */
667 "IFMATCH_A", /* REGNODE_MAX +0x19 */
668 "IFMATCH_A_fail", /* REGNODE_MAX +0x1a */
669 "CURLY_B_min", /* REGNODE_MAX +0x1b */
670 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
671 "CURLY_B_max", /* REGNODE_MAX +0x1d */
672 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
673 "COMMIT_next", /* REGNODE_MAX +0x1f */
674 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
675 "MARKPOINT_next", /* REGNODE_MAX +0x21 */
676 "MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
677 "SKIP_next", /* REGNODE_MAX +0x23 */
678 "SKIP_next_fail", /* REGNODE_MAX +0x24 */
679 "CUTGROUP_next", /* REGNODE_MAX +0x25 */
680 "CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
681 "KEEPS_next", /* REGNODE_MAX +0x27 */
682 "KEEPS_next_fail", /* REGNODE_MAX +0x28 */
686 /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
689 EXTCONST char * PL_reg_extflags_name[];
691 EXTCONST char * const PL_reg_extflags_name[] = {
692 /* Bits in extflags defined: 11111111111111110000111111111111 */
693 "MULTILINE", /* 0x00000001 */
694 "SINGLELINE", /* 0x00000002 */
695 "FOLD", /* 0x00000004 */
696 "EXTENDED", /* 0x00000008 */
697 "EXTENDED_MORE", /* 0x00000010 */
698 "NOCAPTURE", /* 0x00000020 */
699 "KEEPCOPY", /* 0x00000040 */
700 "CHARSET0", /* 0x00000080 : "CHARSET" - 0x00000380 */
701 "CHARSET1", /* 0x00000100 : "CHARSET" - 0x00000380 */
702 "CHARSET2", /* 0x00000200 : "CHARSET" - 0x00000380 */
703 "STRICT", /* 0x00000400 */
704 "SPLIT", /* 0x00000800 */
705 "UNUSED_BIT_12", /* 0x00001000 */
706 "UNUSED_BIT_13", /* 0x00002000 */
707 "UNUSED_BIT_14", /* 0x00004000 */
708 "UNUSED_BIT_15", /* 0x00008000 */
709 "NO_INPLACE_SUBST", /* 0x00010000 */
710 "EVAL_SEEN", /* 0x00020000 */
711 "UNBOUNDED_QUANTIFIER_SEEN",/* 0x00040000 */
712 "CHECK_ALL", /* 0x00080000 */
713 "MATCH_UTF8", /* 0x00100000 */
714 "USE_INTUIT_NOML", /* 0x00200000 */
715 "USE_INTUIT_ML", /* 0x00400000 */
716 "INTUIT_TAIL", /* 0x00800000 */
717 "IS_ANCHORED", /* 0x01000000 */
718 "COPY_DONE", /* 0x02000000 */
719 "TAINTED_SEEN", /* 0x04000000 */
720 "TAINTED", /* 0x08000000 */
721 "START_ONLY", /* 0x10000000 */
722 "SKIPWHITE", /* 0x20000000 */
723 "WHITE", /* 0x40000000 */
724 "NULL", /* 0x80000000 */
729 # define REG_EXTFLAGS_NAME_SIZE 32
732 /* PL_reg_intflags_name[] - Opcode/state names in string form, for debugging */
735 EXTCONST char * PL_reg_intflags_name[];
737 EXTCONST char * const PL_reg_intflags_name[] = {
738 "SKIP", /* 0x00000001 - PREGf_SKIP */
739 "IMPLICIT", /* 0x00000002 - PREGf_IMPLICIT - Converted .* to ^.* */
740 "NAUGHTY", /* 0x00000004 - PREGf_NAUGHTY - how exponential is this pattern? */
741 "VERBARG_SEEN", /* 0x00000008 - PREGf_VERBARG_SEEN */
742 "CUTGROUP_SEEN", /* 0x00000010 - PREGf_CUTGROUP_SEEN */
743 "USE_RE_EVAL", /* 0x00000020 - PREGf_USE_RE_EVAL - compiled with "use re 'eval'" */
744 "NOSCAN", /* 0x00000040 - PREGf_NOSCAN */
745 "GPOS_SEEN", /* 0x00000100 - PREGf_GPOS_SEEN */
746 "GPOS_FLOAT", /* 0x00000200 - PREGf_GPOS_FLOAT */
747 "ANCH_MBOL", /* 0x00000400 - PREGf_ANCH_MBOL */
748 "ANCH_SBOL", /* 0x00000800 - PREGf_ANCH_SBOL */
749 "ANCH_GPOS", /* 0x00001000 - PREGf_ANCH_GPOS */
750 "RECURSE_SEEN", /* 0x00002000 - PREGf_RECURSE_SEEN */
755 # define REG_INTFLAGS_NAME_SIZE 13
758 /* The following have no fixed length. U8 so we can do strchr() on it. */
759 #define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
762 EXTCONST U8 PL_varies[] __attribute__deprecated__;
764 EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
765 CLUMP, BRANCH, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX, WHILEM, REF,
766 REFF, REFFL, REFFU, REFFA, REFN, REFFN, REFFLN, REFFUN, REFFAN,
767 BRANCHJ, SUSPEND, IFTHEN,
773 EXTCONST U8 PL_varies_bitmask[];
775 EXTCONST U8 PL_varies_bitmask[] = {
776 0x00, 0x00, 0x00, 0x00, 0x0C, 0x00, 0xFC, 0xE1, 0x7F, 0x19, 0x00, 0x00, 0x00
780 /* The following always have a length of 1. U8 we can do strchr() on it. */
781 /* (Note that length 1 means "one character" under UTF8, not "one octet".) */
782 #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
785 EXTCONST U8 PL_simple[] __attribute__deprecated__;
787 EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
788 REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFPOSIXL, ANYOFH, ANYOFHb,
789 ANYOFM, NANYOFM, POSIXD, POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL,
796 EXTCONST U8 PL_simple_bitmask[];
798 EXTCONST U8 PL_simple_bitmask[] = {
799 0x00, 0x00, 0xFF, 0xFF, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00