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 121
10 #define REGMATCH_STATE_MAX 161
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 ALNUM 22 /* 0x16 Match any alphanumeric character using native charset semantics for non-utf8 */
35 #define ALNUML 23 /* 0x17 Match any alphanumeric char in locale */
36 #define ALNUMU 24 /* 0x18 Match any alphanumeric char using Unicode semantics */
37 #define ALNUMA 25 /* 0x19 Match [A-Za-z_0-9] */
38 #define NALNUM 26 /* 0x1a Match any non-alphanumeric character using native charset semantics for non-utf8 */
39 #define NALNUML 27 /* 0x1b Match any non-alphanumeric char in locale */
40 #define NALNUMU 28 /* 0x1c Match any non-alphanumeric char using Unicode semantics */
41 #define NALNUMA 29 /* 0x1d Match [^A-Za-z_0-9] */
42 #define SPACE 30 /* 0x1e Match any whitespace character using native charset semantics for non-utf8 */
43 #define SPACEL 31 /* 0x1f Match any whitespace char in locale */
44 #define SPACEU 32 /* 0x20 Match any whitespace char using Unicode semantics */
45 #define SPACEA 33 /* 0x21 Match [ \t\n\f\r] */
46 #define NSPACE 34 /* 0x22 Match any non-whitespace character using native charset semantics for non-utf8 */
47 #define NSPACEL 35 /* 0x23 Match any non-whitespace char in locale */
48 #define NSPACEU 36 /* 0x24 Match any non-whitespace char using Unicode semantics */
49 #define NSPACEA 37 /* 0x25 Match [^ \t\n\f\r] */
50 #define DIGIT 38 /* 0x26 Match any numeric character using native charset semantics for non-utf8 */
51 #define DIGITL 39 /* 0x27 Match any numeric character in locale */
52 #define PLACEHOLDER1 40 /* 0x28 placeholder for missing DIGITU */
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 PLACEHOLDER2 44 /* 0x2c placeholder for missing NDIGITU */
57 #define NDIGITA 45 /* 0x2d Match [^0-9] */
58 #define POSIXD 46 /* 0x2e currently unused except as a placeholder */
59 #define POSIXL 47 /* 0x2f currently unused except as a placeholder */
60 #define POSIXU 48 /* 0x30 currently unused except as a placeholder */
61 #define POSIXA 49 /* 0x31 Some [[:class:]] under /a; the FLAGS field gives which one */
62 #define NPOSIXD 50 /* 0x32 currently unused except as a placeholder */
63 #define NPOSIXL 51 /* 0x33 currently unused except as a placeholder */
64 #define NPOSIXU 52 /* 0x34 currently unused except as a placeholder */
65 #define NPOSIXA 53 /* 0x35 complement of POSIXA, [[:^class:]] */
66 #define CLUMP 54 /* 0x36 Match any extended grapheme cluster sequence */
67 #define BRANCH 55 /* 0x37 Match this alternative, or the next... */
68 #define BACK 56 /* 0x38 Match "", "next" ptr points backward. */
69 #define EXACT 57 /* 0x39 Match this string (preceded by length). */
70 #define EXACTF 58 /* 0x3a Match this non-UTF-8 string (not guaranteed to be folded) using /id rules (w/len). */
71 #define EXACTFL 59 /* 0x3b Match this string (not guaranteed to be folded) using /il rules (w/len). */
72 #define EXACTFU 60 /* 0x3c Match this string (folded iff in UTF-8, length in folding doesn't change if not in UTF-8) using /iu rules (w/len). */
73 #define EXACTFA 61 /* 0x3d Match this string (not guaranteed to be folded) using /iaa rules (w/len). */
74 #define EXACTFU_SS 62 /* 0x3e Match this string (folded iff in UTF-8, length in folding may change even if not in UTF-8) using /iu rules (w/len). */
75 #define EXACTFU_TRICKYFOLD 63 /* 0x3f Match this folded UTF-8 string using /iu rules */
76 #define NOTHING 64 /* 0x40 Match empty string. */
77 #define TAIL 65 /* 0x41 Match empty string. Can jump here from outside. */
78 #define STAR 66 /* 0x42 Match this (simple) thing 0 or more times. */
79 #define PLUS 67 /* 0x43 Match this (simple) thing 1 or more times. */
80 #define CURLY 68 /* 0x44 Match this simple thing {n,m} times. */
81 #define CURLYN 69 /* 0x45 Capture next-after-this simple thing */
82 #define CURLYM 70 /* 0x46 Capture this medium-complex thing {n,m} times. */
83 #define CURLYX 71 /* 0x47 Match this complex thing {n,m} times. */
84 #define WHILEM 72 /* 0x48 Do curly processing and see if rest matches. */
85 #define OPEN 73 /* 0x49 Mark this point in input as start of */
86 #define CLOSE 74 /* 0x4a Analogous to OPEN. */
87 #define REF 75 /* 0x4b Match some already matched string */
88 #define REFF 76 /* 0x4c Match already matched string, folded using native charset semantics for non-utf8 */
89 #define REFFL 77 /* 0x4d Match already matched string, folded in loc. */
90 #define REFFU 78 /* 0x4e Match already matched string, folded using unicode semantics for non-utf8 */
91 #define REFFA 79 /* 0x4f Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
92 #define NREF 80 /* 0x50 Match some already matched string */
93 #define NREFF 81 /* 0x51 Match already matched string, folded using native charset semantics for non-utf8 */
94 #define NREFFL 82 /* 0x52 Match already matched string, folded in loc. */
95 #define NREFFU 83 /* 0x53 Match already matched string, folded using unicode semantics for non-utf8 */
96 #define NREFFA 84 /* 0x54 Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
97 #define IFMATCH 85 /* 0x55 Succeeds if the following matches. */
98 #define UNLESSM 86 /* 0x56 Fails if the following matches. */
99 #define SUSPEND 87 /* 0x57 "Independent" sub-RE. */
100 #define IFTHEN 88 /* 0x58 Switch, should be preceded by switcher . */
101 #define GROUPP 89 /* 0x59 Whether the group matched. */
102 #define LONGJMP 90 /* 0x5a Jump far away. */
103 #define BRANCHJ 91 /* 0x5b BRANCH with long offset. */
104 #define EVAL 92 /* 0x5c Execute some Perl code. */
105 #define MINMOD 93 /* 0x5d Next operator is not greedy. */
106 #define LOGICAL 94 /* 0x5e Next opcode should set the flag only. */
107 #define RENUM 95 /* 0x5f Group with independently numbered parens. */
108 #define TRIE 96 /* 0x60 Match many EXACT(F[ALU]?)? at once. flags==type */
109 #define TRIEC 97 /* 0x61 Same as TRIE, but with embedded charclass data */
110 #define AHOCORASICK 98 /* 0x62 Aho Corasick stclass. flags==type */
111 #define AHOCORASICKC 99 /* 0x63 Same as AHOCORASICK, but with embedded charclass data */
112 #define GOSUB 100 /* 0x64 recurse to paren arg1 at (signed) ofs arg2 */
113 #define GOSTART 101 /* 0x65 recurse to start of pattern */
114 #define NGROUPP 102 /* 0x66 Whether the group matched. */
115 #define INSUBP 103 /* 0x67 Whether we are in a specific recurse. */
116 #define DEFINEP 104 /* 0x68 Never execute directly. */
117 #define ENDLIKE 105 /* 0x69 Used only for the type field of verbs */
118 #define OPFAIL 106 /* 0x6a Same as (?!) */
119 #define ACCEPT 107 /* 0x6b Accepts the current matched string. */
120 #define VERB 108 /* 0x6c Used only for the type field of verbs */
121 #define PRUNE 109 /* 0x6d Pattern fails at this startpoint if no-backtracking through this */
122 #define MARKPOINT 110 /* 0x6e Push the current location for rollback by cut. */
123 #define SKIP 111 /* 0x6f On failure skip forward (to the mark) before retrying */
124 #define COMMIT 112 /* 0x70 Pattern fails outright if backtracking through this */
125 #define CUTGROUP 113 /* 0x71 On failure go to the next alternation in the group */
126 #define KEEPS 114 /* 0x72 $& begins here. */
127 #define LNBREAK 115 /* 0x73 generic newline pattern */
128 #define VERTWS 116 /* 0x74 vertical whitespace (Perl 6) */
129 #define NVERTWS 117 /* 0x75 not vertical whitespace (Perl 6) */
130 #define HORIZWS 118 /* 0x76 horizontal whitespace (Perl 6) */
131 #define NHORIZWS 119 /* 0x77 not horizontal whitespace (Perl 6) */
132 #define OPTIMIZED 120 /* 0x78 Placeholder for dump. */
133 #define PSEUDO 121 /* 0x79 Pseudo opcode for internal use. */
134 /* ------------ States ------------- */
135 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
136 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
137 #define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
138 #define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
139 #define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
140 #define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
141 #define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
142 #define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
143 #define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
144 #define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
145 #define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
146 #define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
147 #define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
148 #define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
149 #define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
150 #define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
151 #define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
152 #define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
153 #define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
154 #define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
155 #define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
156 #define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
157 #define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
158 #define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
159 #define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
160 #define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
161 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
162 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
163 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
164 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
165 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
166 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
167 #define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
168 #define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
169 #define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
170 #define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
171 #define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
172 #define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
173 #define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
174 #define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
176 /* PL_regkind[] What type of regop or state is this. */
179 EXTCONST U8 PL_regkind[];
181 EXTCONST U8 PL_regkind[] = {
196 NBOUND, /* NBOUNDL */
197 NBOUND, /* NBOUNDU */
198 NBOUND, /* NBOUNDA */
200 REG_ANY, /* REG_ANY */
209 NALNUM, /* NALNUML */
210 NALNUM, /* NALNUMU */
211 NALNUM, /* NALNUMA */
217 NSPACE, /* NSPACEL */
218 NSPACE, /* NSPACEU */
219 NSPACE, /* NSPACEA */
222 NOTHING, /* PLACEHOLDER1 */
225 NDIGIT, /* NDIGITL */
226 NOTHING, /* PLACEHOLDER2 */
227 NDIGIT, /* NDIGITA */
232 NPOSIXD, /* NPOSIXD */
233 NPOSIXD, /* NPOSIXL */
234 NPOSIXD, /* NPOSIXU */
235 NPOSIXD, /* NPOSIXA */
244 EXACT, /* EXACTFU_SS */
245 EXACT, /* EXACTFU_TRICKYFOLD */
246 NOTHING, /* NOTHING */
267 BRANCHJ, /* IFMATCH */
268 BRANCHJ, /* UNLESSM */
269 BRANCHJ, /* SUSPEND */
270 BRANCHJ, /* IFTHEN */
272 LONGJMP, /* LONGJMP */
273 BRANCHJ, /* BRANCHJ */
276 LOGICAL, /* LOGICAL */
280 TRIE, /* AHOCORASICK */
281 TRIE, /* AHOCORASICKC */
283 GOSTART, /* GOSTART */
284 NGROUPP, /* NGROUPP */
286 DEFINEP, /* DEFINEP */
287 ENDLIKE, /* ENDLIKE */
288 ENDLIKE, /* OPFAIL */
289 ENDLIKE, /* ACCEPT */
292 VERB, /* MARKPOINT */
297 LNBREAK, /* LNBREAK */
299 NVERTWS, /* NVERTWS */
300 HORIZWS, /* HORIZWS */
301 NHORIZWS, /* NHORIZWS */
302 NOTHING, /* OPTIMIZED */
304 /* ------------ States ------------- */
305 TRIE, /* TRIE_next */
306 TRIE, /* TRIE_next_fail */
308 EVAL, /* EVAL_AB_fail */
309 CURLYX, /* CURLYX_end */
310 CURLYX, /* CURLYX_end_fail */
311 WHILEM, /* WHILEM_A_pre */
312 WHILEM, /* WHILEM_A_pre_fail */
313 WHILEM, /* WHILEM_A_min */
314 WHILEM, /* WHILEM_A_min_fail */
315 WHILEM, /* WHILEM_A_max */
316 WHILEM, /* WHILEM_A_max_fail */
317 WHILEM, /* WHILEM_B_min */
318 WHILEM, /* WHILEM_B_min_fail */
319 WHILEM, /* WHILEM_B_max */
320 WHILEM, /* WHILEM_B_max_fail */
321 BRANCH, /* BRANCH_next */
322 BRANCH, /* BRANCH_next_fail */
323 CURLYM, /* CURLYM_A */
324 CURLYM, /* CURLYM_A_fail */
325 CURLYM, /* CURLYM_B */
326 CURLYM, /* CURLYM_B_fail */
327 IFMATCH, /* IFMATCH_A */
328 IFMATCH, /* IFMATCH_A_fail */
329 CURLY, /* CURLY_B_min_known */
330 CURLY, /* CURLY_B_min_known_fail */
331 CURLY, /* CURLY_B_min */
332 CURLY, /* CURLY_B_min_fail */
333 CURLY, /* CURLY_B_max */
334 CURLY, /* CURLY_B_max_fail */
335 COMMIT, /* COMMIT_next */
336 COMMIT, /* COMMIT_next_fail */
337 MARKPOINT, /* MARKPOINT_next */
338 MARKPOINT, /* MARKPOINT_next_fail */
339 SKIP, /* SKIP_next */
340 SKIP, /* SKIP_next_fail */
341 CUTGROUP, /* CUTGROUP_next */
342 CUTGROUP, /* CUTGROUP_next_fail */
343 KEEPS, /* KEEPS_next */
344 KEEPS, /* KEEPS_next_fail */
348 /* regarglen[] - How large is the argument part of the node (in regnodes) */
351 static const U8 regarglen[] = {
392 0, /* PLACEHOLDER1 */
396 0, /* PLACEHOLDER2 */
415 0, /* EXACTFU_TRICKYFOLD */
420 EXTRA_SIZE(struct regnode_2), /* CURLY */
421 EXTRA_SIZE(struct regnode_2), /* CURLYN */
422 EXTRA_SIZE(struct regnode_2), /* CURLYM */
423 EXTRA_SIZE(struct regnode_2), /* CURLYX */
425 EXTRA_SIZE(struct regnode_1), /* OPEN */
426 EXTRA_SIZE(struct regnode_1), /* CLOSE */
427 EXTRA_SIZE(struct regnode_1), /* REF */
428 EXTRA_SIZE(struct regnode_1), /* REFF */
429 EXTRA_SIZE(struct regnode_1), /* REFFL */
430 EXTRA_SIZE(struct regnode_1), /* REFFU */
431 EXTRA_SIZE(struct regnode_1), /* REFFA */
432 EXTRA_SIZE(struct regnode_1), /* NREF */
433 EXTRA_SIZE(struct regnode_1), /* NREFF */
434 EXTRA_SIZE(struct regnode_1), /* NREFFL */
435 EXTRA_SIZE(struct regnode_1), /* NREFFU */
436 EXTRA_SIZE(struct regnode_1), /* NREFFA */
437 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
438 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
439 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
440 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
441 EXTRA_SIZE(struct regnode_1), /* GROUPP */
442 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
443 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
444 EXTRA_SIZE(struct regnode_1), /* EVAL */
447 EXTRA_SIZE(struct regnode_1), /* RENUM */
448 EXTRA_SIZE(struct regnode_1), /* TRIE */
449 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
450 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
451 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
452 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
454 EXTRA_SIZE(struct regnode_1), /* NGROUPP */
455 EXTRA_SIZE(struct regnode_1), /* INSUBP */
456 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
459 EXTRA_SIZE(struct regnode_1), /* ACCEPT */
460 EXTRA_SIZE(struct regnode_1), /* VERB */
461 EXTRA_SIZE(struct regnode_1), /* PRUNE */
462 EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
463 EXTRA_SIZE(struct regnode_1), /* SKIP */
464 EXTRA_SIZE(struct regnode_1), /* COMMIT */
465 EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
476 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
478 static const char reg_off_by_arg[] = {
519 0, /* PLACEHOLDER1 */
523 0, /* PLACEHOLDER2 */
542 0, /* EXACTFU_TRICKYFOLD */
578 0, /* AHOCORASICKC */
603 #endif /* REG_COMP_C */
605 /* reg_name[] - Opcode/state names in string form, for debugging */
608 EXTCONST char * PL_reg_name[];
610 EXTCONST char * const PL_reg_name[] = {
612 "SUCCEED", /* 0x01 */
625 "NBOUNDL", /* 0x0e */
626 "NBOUNDU", /* 0x0f */
627 "NBOUNDA", /* 0x10 */
629 "REG_ANY", /* 0x12 */
638 "NALNUML", /* 0x1b */
639 "NALNUMU", /* 0x1c */
640 "NALNUMA", /* 0x1d */
646 "NSPACEL", /* 0x23 */
647 "NSPACEU", /* 0x24 */
648 "NSPACEA", /* 0x25 */
651 "PLACEHOLDER1", /* 0x28 */
654 "NDIGITL", /* 0x2b */
655 "PLACEHOLDER2", /* 0x2c */
656 "NDIGITA", /* 0x2d */
661 "NPOSIXD", /* 0x32 */
662 "NPOSIXL", /* 0x33 */
663 "NPOSIXU", /* 0x34 */
664 "NPOSIXA", /* 0x35 */
670 "EXACTFL", /* 0x3b */
671 "EXACTFU", /* 0x3c */
672 "EXACTFA", /* 0x3d */
673 "EXACTFU_SS", /* 0x3e */
674 "EXACTFU_TRICKYFOLD", /* 0x3f */
675 "NOTHING", /* 0x40 */
696 "IFMATCH", /* 0x55 */
697 "UNLESSM", /* 0x56 */
698 "SUSPEND", /* 0x57 */
701 "LONGJMP", /* 0x5a */
702 "BRANCHJ", /* 0x5b */
705 "LOGICAL", /* 0x5e */
709 "AHOCORASICK", /* 0x62 */
710 "AHOCORASICKC", /* 0x63 */
712 "GOSTART", /* 0x65 */
713 "NGROUPP", /* 0x66 */
715 "DEFINEP", /* 0x68 */
716 "ENDLIKE", /* 0x69 */
721 "MARKPOINT", /* 0x6e */
724 "CUTGROUP", /* 0x71 */
726 "LNBREAK", /* 0x73 */
728 "NVERTWS", /* 0x75 */
729 "HORIZWS", /* 0x76 */
730 "NHORIZWS", /* 0x77 */
731 "OPTIMIZED", /* 0x78 */
733 /* ------------ States ------------- */
734 "TRIE_next", /* REGNODE_MAX +0x01 */
735 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
736 "EVAL_AB", /* REGNODE_MAX +0x03 */
737 "EVAL_AB_fail", /* REGNODE_MAX +0x04 */
738 "CURLYX_end", /* REGNODE_MAX +0x05 */
739 "CURLYX_end_fail", /* REGNODE_MAX +0x06 */
740 "WHILEM_A_pre", /* REGNODE_MAX +0x07 */
741 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
742 "WHILEM_A_min", /* REGNODE_MAX +0x09 */
743 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
744 "WHILEM_A_max", /* REGNODE_MAX +0x0b */
745 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
746 "WHILEM_B_min", /* REGNODE_MAX +0x0d */
747 "WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
748 "WHILEM_B_max", /* REGNODE_MAX +0x0f */
749 "WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
750 "BRANCH_next", /* REGNODE_MAX +0x11 */
751 "BRANCH_next_fail", /* REGNODE_MAX +0x12 */
752 "CURLYM_A", /* REGNODE_MAX +0x13 */
753 "CURLYM_A_fail", /* REGNODE_MAX +0x14 */
754 "CURLYM_B", /* REGNODE_MAX +0x15 */
755 "CURLYM_B_fail", /* REGNODE_MAX +0x16 */
756 "IFMATCH_A", /* REGNODE_MAX +0x17 */
757 "IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
758 "CURLY_B_min_known", /* REGNODE_MAX +0x19 */
759 "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
760 "CURLY_B_min", /* REGNODE_MAX +0x1b */
761 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
762 "CURLY_B_max", /* REGNODE_MAX +0x1d */
763 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
764 "COMMIT_next", /* REGNODE_MAX +0x1f */
765 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
766 "MARKPOINT_next", /* REGNODE_MAX +0x21 */
767 "MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
768 "SKIP_next", /* REGNODE_MAX +0x23 */
769 "SKIP_next_fail", /* REGNODE_MAX +0x24 */
770 "CUTGROUP_next", /* REGNODE_MAX +0x25 */
771 "CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
772 "KEEPS_next", /* REGNODE_MAX +0x27 */
773 "KEEPS_next_fail", /* REGNODE_MAX +0x28 */
777 /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
780 EXTCONST char * PL_reg_extflags_name[];
782 EXTCONST char * const PL_reg_extflags_name[] = {
783 /* Bits in extflags defined: 11011111111111111111111011111111 */
784 "MULTILINE", /* 0x00000001 */
785 "SINGLELINE", /* 0x00000002 */
786 "FOLD", /* 0x00000004 */
787 "EXTENDED", /* 0x00000008 */
788 "KEEPCOPY", /* 0x00000010 */
789 "CHARSET", /* 0x000000e0 */
790 "CHARSET", /* 0x000000e0 */
791 "CHARSET", /* 0x000000e0 */
792 "UNUSED_BIT_8", /* 0x00000100 */
793 "ANCH_BOL", /* 0x00000200 */
794 "ANCH_MBOL", /* 0x00000400 */
795 "ANCH_SBOL", /* 0x00000800 */
796 "ANCH_GPOS", /* 0x00001000 */
797 "GPOS_SEEN", /* 0x00002000 */
798 "GPOS_FLOAT", /* 0x00004000 */
799 "LOOKBEHIND_SEEN", /* 0x00008000 */
800 "EVAL_SEEN", /* 0x00010000 */
801 "CANY_SEEN", /* 0x00020000 */
802 "NOSCAN", /* 0x00040000 */
803 "CHECK_ALL", /* 0x00080000 */
804 "MATCH_UTF8", /* 0x00100000 */
805 "USE_INTUIT_NOML", /* 0x00200000 */
806 "USE_INTUIT_ML", /* 0x00400000 */
807 "INTUIT_TAIL", /* 0x00800000 */
808 "MODIFIES_VARS", /* 0x01000000 */
809 "COPY_DONE", /* 0x02000000 */
810 "TAINTED_SEEN", /* 0x04000000 */
811 "TAINTED", /* 0x08000000 */
812 "START_ONLY", /* 0x10000000 */
813 "UNUSED_BIT_29", /* 0x20000000 */
814 "WHITE", /* 0x40000000 */
815 "NULL", /* 0x80000000 */
819 /* The following have no fixed length. U8 so we can do strchr() on it. */
820 #define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
823 EXTCONST U8 PL_varies[] __attribute__deprecated__;
825 EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
826 CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX, WHILEM,
827 REF, REFF, REFFL, REFFU, REFFA, NREF, NREFF, NREFFL, NREFFU, NREFFA,
828 SUSPEND, IFTHEN, BRANCHJ,
834 EXTCONST U8 PL_varies_bitmask[];
836 EXTCONST U8 PL_varies_bitmask[] = {
837 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xC0, 0x01, 0xFC, 0xF9, 0x9F, 0x09, 0x00, 0x00, 0x00, 0x00
841 /* The following always have a length of 1. U8 we can do strchr() on it. */
842 /* (Note that length 1 means "one character" under UTF8, not "one octet".) */
843 #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
846 EXTCONST U8 PL_simple[] __attribute__deprecated__;
848 EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
849 REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, ALNUMU, ALNUMA, NALNUM,
850 NALNUML, NALNUMU, NALNUMA, SPACE, SPACEL, SPACEU, SPACEA, NSPACE,
851 NSPACEL, NSPACEU, NSPACEA, DIGIT, DIGITL, DIGITA, NDIGIT, NDIGITL,
852 NDIGITA, POSIXD, POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL, NPOSIXU,
853 NPOSIXA, VERTWS, NVERTWS, HORIZWS, NHORIZWS,
859 EXTCONST U8 PL_simple_bitmask[];
861 EXTCONST U8 PL_simple_bitmask[] = {
862 0x00, 0x00, 0xFC, 0xFF, 0xFF, 0xEE, 0x3F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xF0, 0x00