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 111
10 #define REGMATCH_STATE_MAX 151
12 #define END 0 /* 0000 End of program. */
13 #define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
14 #define BOL 2 /* 0x02 Match "" at beginning of line. */
15 #define MBOL 3 /* 0x03 Same, assuming multiline. */
16 #define SBOL 4 /* 0x04 Same, assuming singleline. */
17 #define EOS 5 /* 0x05 Match "" at end of string. */
18 #define EOL 6 /* 0x06 Match "" at end of line. */
19 #define MEOL 7 /* 0x07 Same, assuming multiline. */
20 #define SEOL 8 /* 0x08 Same, assuming singleline. */
21 #define BOUND 9 /* 0x09 Match "" at any word boundary using native charset semantics for non-utf8 */
22 #define BOUNDL 10 /* 0x0a Match "" at any locale word boundary */
23 #define BOUNDU 11 /* 0x0b Match "" at any word boundary using Unicode semantics */
24 #define BOUNDA 12 /* 0x0c Match "" at any word boundary using ASCII semantics */
25 #define NBOUND 13 /* 0x0d Match "" at any word non-boundary using native charset semantics for non-utf8 */
26 #define NBOUNDL 14 /* 0x0e Match "" at any locale word non-boundary */
27 #define NBOUNDU 15 /* 0x0f Match "" at any word non-boundary using Unicode semantics */
28 #define NBOUNDA 16 /* 0x10 Match "" at any word non-boundary using ASCII semantics */
29 #define GPOS 17 /* 0x11 Matches where last m//g left off. */
30 #define REG_ANY 18 /* 0x12 Match any one character (except newline). */
31 #define SANY 19 /* 0x13 Match any one character. */
32 #define CANY 20 /* 0x14 Match any one byte. */
33 #define ANYOF 21 /* 0x15 Match character in (or not in) this class, single char match only */
34 #define ANYOFV 22 /* 0x16 Match character in (or not in) this class, can match-multiple chars */
35 #define ALNUM 23 /* 0x17 Match any alphanumeric character using native charset semantics for non-utf8 */
36 #define ALNUML 24 /* 0x18 Match any alphanumeric char in locale */
37 #define ALNUMU 25 /* 0x19 Match any alphanumeric char using Unicode semantics */
38 #define ALNUMA 26 /* 0x1a Match [A-Za-z_0-9] */
39 #define NALNUM 27 /* 0x1b Match any non-alphanumeric character using native charset semantics for non-utf8 */
40 #define NALNUML 28 /* 0x1c Match any non-alphanumeric char in locale */
41 #define NALNUMU 29 /* 0x1d Match any non-alphanumeric char using Unicode semantics */
42 #define NALNUMA 30 /* 0x1e Match [^A-Za-z_0-9] */
43 #define SPACE 31 /* 0x1f Match any whitespace character using native charset semantics for non-utf8 */
44 #define SPACEL 32 /* 0x20 Match any whitespace char in locale */
45 #define SPACEU 33 /* 0x21 Match any whitespace char using Unicode semantics */
46 #define SPACEA 34 /* 0x22 Match [ \t\n\f\r] */
47 #define NSPACE 35 /* 0x23 Match any non-whitespace character using native charset semantics for non-utf8 */
48 #define NSPACEL 36 /* 0x24 Match any non-whitespace char in locale */
49 #define NSPACEU 37 /* 0x25 Match any non-whitespace char using Unicode semantics */
50 #define NSPACEA 38 /* 0x26 Match [^ \t\n\f\r] */
51 #define DIGIT 39 /* 0x27 Match any numeric character using native charset semantics for non-utf8 */
52 #define DIGITL 40 /* 0x28 Match any numeric character in locale */
53 #define DIGITA 41 /* 0x29 Match [0-9] */
54 #define NDIGIT 42 /* 0x2a Match any non-numeric character using native charset semantics for non-utf8 */
55 #define NDIGITL 43 /* 0x2b Match any non-numeric character in locale */
56 #define NDIGITA 44 /* 0x2c Match [^0-9] */
57 #define CLUMP 45 /* 0x2d Match any extended grapheme cluster sequence */
58 #define BRANCH 46 /* 0x2e Match this alternative, or the next... */
59 #define BACK 47 /* 0x2f Match "", "next" ptr points backward. */
60 #define EXACT 48 /* 0x30 Match this string (preceded by length). */
61 #define EXACTF 49 /* 0x31 Match this (folded if in UTF-8) string, folded, native charset semantics for non-utf8 (prec. by length). */
62 #define EXACTFL 50 /* 0x32 Match this (not guaranteed to be folded) string, folded in locale (w/len). */
63 #define EXACTFU 51 /* 0x33 Match this (folded if in UTF-8) string, folded, Unicode semantics for non-utf8 (prec. by length). */
64 #define EXACTFA 52 /* 0x34 Match this (not guaranteed to be folded) string, folded, Unicode semantics for non-utf8, but no ASCII-range character matches outside ASCII (prec. by length),. */
65 #define NOTHING 53 /* 0x35 Match empty string. */
66 #define TAIL 54 /* 0x36 Match empty string. Can jump here from outside. */
67 #define STAR 55 /* 0x37 Match this (simple) thing 0 or more times. */
68 #define PLUS 56 /* 0x38 Match this (simple) thing 1 or more times. */
69 #define CURLY 57 /* 0x39 Match this simple thing {n,m} times. */
70 #define CURLYN 58 /* 0x3a Capture next-after-this simple thing */
71 #define CURLYM 59 /* 0x3b Capture this medium-complex thing {n,m} times. */
72 #define CURLYX 60 /* 0x3c Match this complex thing {n,m} times. */
73 #define WHILEM 61 /* 0x3d Do curly processing and see if rest matches. */
74 #define OPEN 62 /* 0x3e Mark this point in input as start of */
75 #define CLOSE 63 /* 0x3f Analogous to OPEN. */
76 #define REF 64 /* 0x40 Match some already matched string */
77 #define REFF 65 /* 0x41 Match already matched string, folded using native charset semantics for non-utf8 */
78 #define REFFL 66 /* 0x42 Match already matched string, folded in loc. */
79 #define REFFU 67 /* 0x43 Match already matched string, folded using unicode semantics for non-utf8 */
80 #define REFFA 68 /* 0x44 Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
81 #define NREF 69 /* 0x45 Match some already matched string */
82 #define NREFF 70 /* 0x46 Match already matched string, folded using native charset semantics for non-utf8 */
83 #define NREFFL 71 /* 0x47 Match already matched string, folded in loc. */
84 #define NREFFU 72 /* 0x48 Match already matched string, folded using unicode semantics for non-utf8 */
85 #define NREFFA 73 /* 0x49 Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
86 #define IFMATCH 74 /* 0x4a Succeeds if the following matches. */
87 #define UNLESSM 75 /* 0x4b Fails if the following matches. */
88 #define SUSPEND 76 /* 0x4c "Independent" sub-RE. */
89 #define IFTHEN 77 /* 0x4d Switch, should be preceded by switcher . */
90 #define GROUPP 78 /* 0x4e Whether the group matched. */
91 #define LONGJMP 79 /* 0x4f Jump far away. */
92 #define BRANCHJ 80 /* 0x50 BRANCH with long offset. */
93 #define EVAL 81 /* 0x51 Execute some Perl code. */
94 #define MINMOD 82 /* 0x52 Next operator is not greedy. */
95 #define LOGICAL 83 /* 0x53 Next opcode should set the flag only. */
96 #define RENUM 84 /* 0x54 Group with independently numbered parens. */
97 #define TRIE 85 /* 0x55 Match many EXACT(F[ALU]?)? at once. flags==type */
98 #define TRIEC 86 /* 0x56 Same as TRIE, but with embedded charclass data */
99 #define AHOCORASICK 87 /* 0x57 Aho Corasick stclass. flags==type */
100 #define AHOCORASICKC 88 /* 0x58 Same as AHOCORASICK, but with embedded charclass data */
101 #define GOSUB 89 /* 0x59 recurse to paren arg1 at (signed) ofs arg2 */
102 #define GOSTART 90 /* 0x5a recurse to start of pattern */
103 #define NGROUPP 91 /* 0x5b Whether the group matched. */
104 #define INSUBP 92 /* 0x5c Whether we are in a specific recurse. */
105 #define DEFINEP 93 /* 0x5d Never execute directly. */
106 #define ENDLIKE 94 /* 0x5e Used only for the type field of verbs */
107 #define OPFAIL 95 /* 0x5f Same as (?!) */
108 #define ACCEPT 96 /* 0x60 Accepts the current matched string. */
109 #define VERB 97 /* 0x61 Used only for the type field of verbs */
110 #define PRUNE 98 /* 0x62 Pattern fails at this startpoint if no-backtracking through this */
111 #define MARKPOINT 99 /* 0x63 Push the current location for rollback by cut. */
112 #define SKIP 100 /* 0x64 On failure skip forward (to the mark) before retrying */
113 #define COMMIT 101 /* 0x65 Pattern fails outright if backtracking through this */
114 #define CUTGROUP 102 /* 0x66 On failure go to the next alternation in the group */
115 #define KEEPS 103 /* 0x67 $& begins here. */
116 #define LNBREAK 104 /* 0x68 generic newline pattern */
117 #define VERTWS 105 /* 0x69 vertical whitespace (Perl 6) */
118 #define NVERTWS 106 /* 0x6a not vertical whitespace (Perl 6) */
119 #define HORIZWS 107 /* 0x6b horizontal whitespace (Perl 6) */
120 #define NHORIZWS 108 /* 0x6c not horizontal whitespace (Perl 6) */
121 #define FOLDCHAR 109 /* 0x6d codepoint with tricky case folding properties. */
122 #define OPTIMIZED 110 /* 0x6e Placeholder for dump. */
123 #define PSEUDO 111 /* 0x6f Pseudo opcode for internal use. */
124 /* ------------ States ------------- */
125 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
126 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
127 #define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
128 #define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
129 #define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
130 #define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
131 #define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
132 #define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
133 #define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
134 #define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
135 #define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
136 #define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
137 #define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
138 #define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
139 #define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
140 #define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
141 #define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
142 #define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
143 #define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
144 #define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
145 #define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
146 #define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
147 #define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
148 #define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
149 #define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
150 #define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
151 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
152 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
153 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
154 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
155 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
156 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
157 #define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
158 #define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
159 #define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
160 #define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
161 #define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
162 #define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
163 #define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
164 #define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
166 /* PL_regkind[] What type of regop or state is this. */
169 EXTCONST U8 PL_regkind[];
171 EXTCONST U8 PL_regkind[] = {
186 NBOUND, /* NBOUNDL */
187 NBOUND, /* NBOUNDU */
188 NBOUND, /* NBOUNDA */
190 REG_ANY, /* REG_ANY */
200 NALNUM, /* NALNUML */
201 NALNUM, /* NALNUMU */
202 NALNUM, /* NALNUMA */
208 NSPACE, /* NSPACEL */
209 NSPACE, /* NSPACEU */
210 NSPACE, /* NSPACEA */
215 NDIGIT, /* NDIGITL */
216 NDIGIT, /* NDIGITA */
225 NOTHING, /* NOTHING */
246 BRANCHJ, /* IFMATCH */
247 BRANCHJ, /* UNLESSM */
248 BRANCHJ, /* SUSPEND */
249 BRANCHJ, /* IFTHEN */
251 LONGJMP, /* LONGJMP */
252 BRANCHJ, /* BRANCHJ */
255 LOGICAL, /* LOGICAL */
259 TRIE, /* AHOCORASICK */
260 TRIE, /* AHOCORASICKC */
262 GOSTART, /* GOSTART */
263 NGROUPP, /* NGROUPP */
265 DEFINEP, /* DEFINEP */
266 ENDLIKE, /* ENDLIKE */
267 ENDLIKE, /* OPFAIL */
268 ENDLIKE, /* ACCEPT */
271 VERB, /* MARKPOINT */
276 LNBREAK, /* LNBREAK */
278 NVERTWS, /* NVERTWS */
279 HORIZWS, /* HORIZWS */
280 NHORIZWS, /* NHORIZWS */
281 FOLDCHAR, /* FOLDCHAR */
282 NOTHING, /* OPTIMIZED */
284 /* ------------ States ------------- */
285 TRIE, /* TRIE_next */
286 TRIE, /* TRIE_next_fail */
288 EVAL, /* EVAL_AB_fail */
289 CURLYX, /* CURLYX_end */
290 CURLYX, /* CURLYX_end_fail */
291 WHILEM, /* WHILEM_A_pre */
292 WHILEM, /* WHILEM_A_pre_fail */
293 WHILEM, /* WHILEM_A_min */
294 WHILEM, /* WHILEM_A_min_fail */
295 WHILEM, /* WHILEM_A_max */
296 WHILEM, /* WHILEM_A_max_fail */
297 WHILEM, /* WHILEM_B_min */
298 WHILEM, /* WHILEM_B_min_fail */
299 WHILEM, /* WHILEM_B_max */
300 WHILEM, /* WHILEM_B_max_fail */
301 BRANCH, /* BRANCH_next */
302 BRANCH, /* BRANCH_next_fail */
303 CURLYM, /* CURLYM_A */
304 CURLYM, /* CURLYM_A_fail */
305 CURLYM, /* CURLYM_B */
306 CURLYM, /* CURLYM_B_fail */
307 IFMATCH, /* IFMATCH_A */
308 IFMATCH, /* IFMATCH_A_fail */
309 CURLY, /* CURLY_B_min_known */
310 CURLY, /* CURLY_B_min_known_fail */
311 CURLY, /* CURLY_B_min */
312 CURLY, /* CURLY_B_min_fail */
313 CURLY, /* CURLY_B_max */
314 CURLY, /* CURLY_B_max_fail */
315 COMMIT, /* COMMIT_next */
316 COMMIT, /* COMMIT_next_fail */
317 MARKPOINT, /* MARKPOINT_next */
318 MARKPOINT, /* MARKPOINT_next_fail */
319 SKIP, /* SKIP_next */
320 SKIP, /* SKIP_next_fail */
321 CUTGROUP, /* CUTGROUP_next */
322 CUTGROUP, /* CUTGROUP_next_fail */
323 KEEPS, /* KEEPS_next */
324 KEEPS, /* KEEPS_next_fail */
328 /* regarglen[] - How large is the argument part of the node (in regnodes) */
331 static const U8 regarglen[] = {
389 EXTRA_SIZE(struct regnode_2), /* CURLY */
390 EXTRA_SIZE(struct regnode_2), /* CURLYN */
391 EXTRA_SIZE(struct regnode_2), /* CURLYM */
392 EXTRA_SIZE(struct regnode_2), /* CURLYX */
394 EXTRA_SIZE(struct regnode_1), /* OPEN */
395 EXTRA_SIZE(struct regnode_1), /* CLOSE */
396 EXTRA_SIZE(struct regnode_1), /* REF */
397 EXTRA_SIZE(struct regnode_1), /* REFF */
398 EXTRA_SIZE(struct regnode_1), /* REFFL */
399 EXTRA_SIZE(struct regnode_1), /* REFFU */
400 EXTRA_SIZE(struct regnode_1), /* REFFA */
401 EXTRA_SIZE(struct regnode_1), /* NREF */
402 EXTRA_SIZE(struct regnode_1), /* NREFF */
403 EXTRA_SIZE(struct regnode_1), /* NREFFL */
404 EXTRA_SIZE(struct regnode_1), /* NREFFU */
405 EXTRA_SIZE(struct regnode_1), /* NREFFA */
406 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
407 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
408 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
409 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
410 EXTRA_SIZE(struct regnode_1), /* GROUPP */
411 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
412 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
413 EXTRA_SIZE(struct regnode_1), /* EVAL */
416 EXTRA_SIZE(struct regnode_1), /* RENUM */
417 EXTRA_SIZE(struct regnode_1), /* TRIE */
418 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
419 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
420 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
421 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
423 EXTRA_SIZE(struct regnode_1), /* NGROUPP */
424 EXTRA_SIZE(struct regnode_1), /* INSUBP */
425 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
428 EXTRA_SIZE(struct regnode_1), /* ACCEPT */
429 EXTRA_SIZE(struct regnode_1), /* VERB */
430 EXTRA_SIZE(struct regnode_1), /* PRUNE */
431 EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
432 EXTRA_SIZE(struct regnode_1), /* SKIP */
433 EXTRA_SIZE(struct regnode_1), /* COMMIT */
434 EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
441 EXTRA_SIZE(struct regnode_1), /* FOLDCHAR */
446 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
448 static const char reg_off_by_arg[] = {
537 0, /* AHOCORASICKC */
563 #endif /* REG_COMP_C */
565 /* reg_name[] - Opcode/state names in string form, for debugging */
568 EXTCONST char * PL_reg_name[];
570 EXTCONST char * const PL_reg_name[] = {
572 "SUCCEED", /* 0x01 */
585 "NBOUNDL", /* 0x0e */
586 "NBOUNDU", /* 0x0f */
587 "NBOUNDA", /* 0x10 */
589 "REG_ANY", /* 0x12 */
599 "NALNUML", /* 0x1c */
600 "NALNUMU", /* 0x1d */
601 "NALNUMA", /* 0x1e */
607 "NSPACEL", /* 0x24 */
608 "NSPACEU", /* 0x25 */
609 "NSPACEA", /* 0x26 */
614 "NDIGITL", /* 0x2b */
615 "NDIGITA", /* 0x2c */
621 "EXACTFL", /* 0x32 */
622 "EXACTFU", /* 0x33 */
623 "EXACTFA", /* 0x34 */
624 "NOTHING", /* 0x35 */
645 "IFMATCH", /* 0x4a */
646 "UNLESSM", /* 0x4b */
647 "SUSPEND", /* 0x4c */
650 "LONGJMP", /* 0x4f */
651 "BRANCHJ", /* 0x50 */
654 "LOGICAL", /* 0x53 */
658 "AHOCORASICK", /* 0x57 */
659 "AHOCORASICKC", /* 0x58 */
661 "GOSTART", /* 0x5a */
662 "NGROUPP", /* 0x5b */
664 "DEFINEP", /* 0x5d */
665 "ENDLIKE", /* 0x5e */
670 "MARKPOINT", /* 0x63 */
673 "CUTGROUP", /* 0x66 */
675 "LNBREAK", /* 0x68 */
677 "NVERTWS", /* 0x6a */
678 "HORIZWS", /* 0x6b */
679 "NHORIZWS", /* 0x6c */
680 "FOLDCHAR", /* 0x6d */
681 "OPTIMIZED", /* 0x6e */
683 /* ------------ States ------------- */
684 "TRIE_next", /* REGNODE_MAX +0x01 */
685 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
686 "EVAL_AB", /* REGNODE_MAX +0x03 */
687 "EVAL_AB_fail", /* REGNODE_MAX +0x04 */
688 "CURLYX_end", /* REGNODE_MAX +0x05 */
689 "CURLYX_end_fail", /* REGNODE_MAX +0x06 */
690 "WHILEM_A_pre", /* REGNODE_MAX +0x07 */
691 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
692 "WHILEM_A_min", /* REGNODE_MAX +0x09 */
693 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
694 "WHILEM_A_max", /* REGNODE_MAX +0x0b */
695 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
696 "WHILEM_B_min", /* REGNODE_MAX +0x0d */
697 "WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
698 "WHILEM_B_max", /* REGNODE_MAX +0x0f */
699 "WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
700 "BRANCH_next", /* REGNODE_MAX +0x11 */
701 "BRANCH_next_fail", /* REGNODE_MAX +0x12 */
702 "CURLYM_A", /* REGNODE_MAX +0x13 */
703 "CURLYM_A_fail", /* REGNODE_MAX +0x14 */
704 "CURLYM_B", /* REGNODE_MAX +0x15 */
705 "CURLYM_B_fail", /* REGNODE_MAX +0x16 */
706 "IFMATCH_A", /* REGNODE_MAX +0x17 */
707 "IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
708 "CURLY_B_min_known", /* REGNODE_MAX +0x19 */
709 "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
710 "CURLY_B_min", /* REGNODE_MAX +0x1b */
711 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
712 "CURLY_B_max", /* REGNODE_MAX +0x1d */
713 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
714 "COMMIT_next", /* REGNODE_MAX +0x1f */
715 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
716 "MARKPOINT_next", /* REGNODE_MAX +0x21 */
717 "MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
718 "SKIP_next", /* REGNODE_MAX +0x23 */
719 "SKIP_next_fail", /* REGNODE_MAX +0x24 */
720 "CUTGROUP_next", /* REGNODE_MAX +0x25 */
721 "CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
722 "KEEPS_next", /* REGNODE_MAX +0x27 */
723 "KEEPS_next_fail", /* REGNODE_MAX +0x28 */
727 /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
730 EXTCONST char * PL_reg_extflags_name[];
732 EXTCONST char * const PL_reg_extflags_name[] = {
733 /* Bits in extflags defined: 11111111111111111111111011111111 */
734 "MULTILINE", /* 0x00000001 */
735 "SINGLELINE", /* 0x00000002 */
736 "FOLD", /* 0x00000004 */
737 "EXTENDED", /* 0x00000008 */
738 "KEEPCOPY", /* 0x00000010 */
739 "CHARSET", /* 0x000000e0 */
740 "CHARSET", /* 0x000000e0 */
741 "CHARSET", /* 0x000000e0 */
742 "UNUSED_BIT_8", /* 0x00000100 */
743 "ANCH_BOL", /* 0x00000200 */
744 "ANCH_MBOL", /* 0x00000400 */
745 "ANCH_SBOL", /* 0x00000800 */
746 "ANCH_GPOS", /* 0x00001000 */
747 "GPOS_SEEN", /* 0x00002000 */
748 "GPOS_FLOAT", /* 0x00004000 */
749 "LOOKBEHIND_SEEN", /* 0x00008000 */
750 "EVAL_SEEN", /* 0x00010000 */
751 "CANY_SEEN", /* 0x00020000 */
752 "NOSCAN", /* 0x00040000 */
753 "CHECK_ALL", /* 0x00080000 */
754 "MATCH_UTF8", /* 0x00100000 */
755 "USE_INTUIT_NOML", /* 0x00200000 */
756 "USE_INTUIT_ML", /* 0x00400000 */
757 "INTUIT_TAIL", /* 0x00800000 */
758 "SPLIT", /* 0x01000000 */
759 "COPY_DONE", /* 0x02000000 */
760 "TAINTED_SEEN", /* 0x04000000 */
761 "TAINTED", /* 0x08000000 */
762 "START_ONLY", /* 0x10000000 */
763 "SKIPWHITE", /* 0x20000000 */
764 "WHITE", /* 0x40000000 */
765 "NULL", /* 0x80000000 */
769 /* The following have no fixed length. U8 so we can do strchr() on it. */
770 #define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
773 EXTCONST U8 PL_varies[] __attribute__deprecated__;
775 EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
776 ANYOFV, CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX,
777 WHILEM, REF, REFF, REFFL, REFFU, REFFA, NREF, NREFF, NREFFL, NREFFU,
778 NREFFA, SUSPEND, IFTHEN, BRANCHJ,
784 EXTCONST U8 PL_varies_bitmask[];
786 EXTCONST U8 PL_varies_bitmask[] = {
787 0x00, 0x00, 0x40, 0x00, 0x00, 0xE0, 0x80, 0x3F, 0xFF, 0x33, 0x01, 0x00, 0x00, 0x00
791 /* The following always have a length of 1. U8 we can do strchr() on it. */
792 /* (Note that length 1 means "one character" under UTF8, not "one octet".) */
793 #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
796 EXTCONST U8 PL_simple[] __attribute__deprecated__;
798 EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
799 REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, ALNUMU, ALNUMA, NALNUM,
800 NALNUML, NALNUMU, NALNUMA, SPACE, SPACEL, SPACEU, SPACEA, NSPACE,
801 NSPACEL, NSPACEU, NSPACEA, DIGIT, DIGITL, DIGITA, NDIGIT, NDIGITL,
802 NDIGITA, VERTWS, NVERTWS, HORIZWS, NHORIZWS,
808 EXTCONST U8 PL_simple_bitmask[];
810 EXTCONST U8 PL_simple_bitmask[] = {
811 0x00, 0x00, 0xBC, 0xFF, 0xFF, 0x1F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x1E