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 112
10 #define REGMATCH_STATE_MAX 152
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 non-UTF-8 string (not guaranteed to be folded) using /id rules (w/len). */
62 #define EXACTFL 50 /* 0x32 Match this string (not guaranteed to be folded) using /il rules (w/len). */
63 #define EXACTFU 51 /* 0x33 Match this string (folded iff in UTF-8, length in folding doesn't change if not in UTF-8) using /iu rules (w/len). */
64 #define EXACTFU_SS 52 /* 0x34 Match this string (folded iff in UTF-8, length in folding may change even if not in UTF-8) using /iu rules (w/len). */
65 #define EXACTFA 53 /* 0x35 Match this string (not guaranteed to be folded) using /iaa rules (w/len). */
66 #define NOTHING 54 /* 0x36 Match empty string. */
67 #define TAIL 55 /* 0x37 Match empty string. Can jump here from outside. */
68 #define STAR 56 /* 0x38 Match this (simple) thing 0 or more times. */
69 #define PLUS 57 /* 0x39 Match this (simple) thing 1 or more times. */
70 #define CURLY 58 /* 0x3a Match this simple thing {n,m} times. */
71 #define CURLYN 59 /* 0x3b Capture next-after-this simple thing */
72 #define CURLYM 60 /* 0x3c Capture this medium-complex thing {n,m} times. */
73 #define CURLYX 61 /* 0x3d Match this complex thing {n,m} times. */
74 #define WHILEM 62 /* 0x3e Do curly processing and see if rest matches. */
75 #define OPEN 63 /* 0x3f Mark this point in input as start of */
76 #define CLOSE 64 /* 0x40 Analogous to OPEN. */
77 #define REF 65 /* 0x41 Match some already matched string */
78 #define REFF 66 /* 0x42 Match already matched string, folded using native charset semantics for non-utf8 */
79 #define REFFL 67 /* 0x43 Match already matched string, folded in loc. */
80 #define REFFU 68 /* 0x44 Match already matched string, folded using unicode semantics for non-utf8 */
81 #define REFFA 69 /* 0x45 Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
82 #define NREF 70 /* 0x46 Match some already matched string */
83 #define NREFF 71 /* 0x47 Match already matched string, folded using native charset semantics for non-utf8 */
84 #define NREFFL 72 /* 0x48 Match already matched string, folded in loc. */
85 #define NREFFU 73 /* 0x49 Match already matched string, folded using unicode semantics for non-utf8 */
86 #define NREFFA 74 /* 0x4a Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
87 #define IFMATCH 75 /* 0x4b Succeeds if the following matches. */
88 #define UNLESSM 76 /* 0x4c Fails if the following matches. */
89 #define SUSPEND 77 /* 0x4d "Independent" sub-RE. */
90 #define IFTHEN 78 /* 0x4e Switch, should be preceded by switcher . */
91 #define GROUPP 79 /* 0x4f Whether the group matched. */
92 #define LONGJMP 80 /* 0x50 Jump far away. */
93 #define BRANCHJ 81 /* 0x51 BRANCH with long offset. */
94 #define EVAL 82 /* 0x52 Execute some Perl code. */
95 #define MINMOD 83 /* 0x53 Next operator is not greedy. */
96 #define LOGICAL 84 /* 0x54 Next opcode should set the flag only. */
97 #define RENUM 85 /* 0x55 Group with independently numbered parens. */
98 #define TRIE 86 /* 0x56 Match many EXACT(F[ALU]?)? at once. flags==type */
99 #define TRIEC 87 /* 0x57 Same as TRIE, but with embedded charclass data */
100 #define AHOCORASICK 88 /* 0x58 Aho Corasick stclass. flags==type */
101 #define AHOCORASICKC 89 /* 0x59 Same as AHOCORASICK, but with embedded charclass data */
102 #define GOSUB 90 /* 0x5a recurse to paren arg1 at (signed) ofs arg2 */
103 #define GOSTART 91 /* 0x5b recurse to start of pattern */
104 #define NGROUPP 92 /* 0x5c Whether the group matched. */
105 #define INSUBP 93 /* 0x5d Whether we are in a specific recurse. */
106 #define DEFINEP 94 /* 0x5e Never execute directly. */
107 #define ENDLIKE 95 /* 0x5f Used only for the type field of verbs */
108 #define OPFAIL 96 /* 0x60 Same as (?!) */
109 #define ACCEPT 97 /* 0x61 Accepts the current matched string. */
110 #define VERB 98 /* 0x62 Used only for the type field of verbs */
111 #define PRUNE 99 /* 0x63 Pattern fails at this startpoint if no-backtracking through this */
112 #define MARKPOINT 100 /* 0x64 Push the current location for rollback by cut. */
113 #define SKIP 101 /* 0x65 On failure skip forward (to the mark) before retrying */
114 #define COMMIT 102 /* 0x66 Pattern fails outright if backtracking through this */
115 #define CUTGROUP 103 /* 0x67 On failure go to the next alternation in the group */
116 #define KEEPS 104 /* 0x68 $& begins here. */
117 #define LNBREAK 105 /* 0x69 generic newline pattern */
118 #define VERTWS 106 /* 0x6a vertical whitespace (Perl 6) */
119 #define NVERTWS 107 /* 0x6b not vertical whitespace (Perl 6) */
120 #define HORIZWS 108 /* 0x6c horizontal whitespace (Perl 6) */
121 #define NHORIZWS 109 /* 0x6d not horizontal whitespace (Perl 6) */
122 #define FOLDCHAR 110 /* 0x6e codepoint with tricky case folding properties. */
123 #define OPTIMIZED 111 /* 0x6f Placeholder for dump. */
124 #define PSEUDO 112 /* 0x70 Pseudo opcode for internal use. */
125 /* ------------ States ------------- */
126 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
127 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
128 #define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
129 #define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
130 #define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
131 #define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
132 #define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
133 #define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
134 #define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
135 #define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
136 #define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
137 #define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
138 #define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
139 #define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
140 #define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
141 #define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
142 #define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
143 #define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
144 #define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
145 #define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
146 #define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
147 #define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
148 #define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
149 #define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
150 #define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
151 #define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
152 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
153 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
154 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
155 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
156 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
157 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
158 #define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
159 #define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
160 #define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
161 #define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
162 #define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
163 #define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
164 #define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
165 #define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
167 /* PL_regkind[] What type of regop or state is this. */
170 EXTCONST U8 PL_regkind[];
172 EXTCONST U8 PL_regkind[] = {
187 NBOUND, /* NBOUNDL */
188 NBOUND, /* NBOUNDU */
189 NBOUND, /* NBOUNDA */
191 REG_ANY, /* REG_ANY */
201 NALNUM, /* NALNUML */
202 NALNUM, /* NALNUMU */
203 NALNUM, /* NALNUMA */
209 NSPACE, /* NSPACEL */
210 NSPACE, /* NSPACEU */
211 NSPACE, /* NSPACEA */
216 NDIGIT, /* NDIGITL */
217 NDIGIT, /* NDIGITA */
225 EXACT, /* EXACTFU_SS */
227 NOTHING, /* NOTHING */
248 BRANCHJ, /* IFMATCH */
249 BRANCHJ, /* UNLESSM */
250 BRANCHJ, /* SUSPEND */
251 BRANCHJ, /* IFTHEN */
253 LONGJMP, /* LONGJMP */
254 BRANCHJ, /* BRANCHJ */
257 LOGICAL, /* LOGICAL */
261 TRIE, /* AHOCORASICK */
262 TRIE, /* AHOCORASICKC */
264 GOSTART, /* GOSTART */
265 NGROUPP, /* NGROUPP */
267 DEFINEP, /* DEFINEP */
268 ENDLIKE, /* ENDLIKE */
269 ENDLIKE, /* OPFAIL */
270 ENDLIKE, /* ACCEPT */
273 VERB, /* MARKPOINT */
278 LNBREAK, /* LNBREAK */
280 NVERTWS, /* NVERTWS */
281 HORIZWS, /* HORIZWS */
282 NHORIZWS, /* NHORIZWS */
283 FOLDCHAR, /* FOLDCHAR */
284 NOTHING, /* OPTIMIZED */
286 /* ------------ States ------------- */
287 TRIE, /* TRIE_next */
288 TRIE, /* TRIE_next_fail */
290 EVAL, /* EVAL_AB_fail */
291 CURLYX, /* CURLYX_end */
292 CURLYX, /* CURLYX_end_fail */
293 WHILEM, /* WHILEM_A_pre */
294 WHILEM, /* WHILEM_A_pre_fail */
295 WHILEM, /* WHILEM_A_min */
296 WHILEM, /* WHILEM_A_min_fail */
297 WHILEM, /* WHILEM_A_max */
298 WHILEM, /* WHILEM_A_max_fail */
299 WHILEM, /* WHILEM_B_min */
300 WHILEM, /* WHILEM_B_min_fail */
301 WHILEM, /* WHILEM_B_max */
302 WHILEM, /* WHILEM_B_max_fail */
303 BRANCH, /* BRANCH_next */
304 BRANCH, /* BRANCH_next_fail */
305 CURLYM, /* CURLYM_A */
306 CURLYM, /* CURLYM_A_fail */
307 CURLYM, /* CURLYM_B */
308 CURLYM, /* CURLYM_B_fail */
309 IFMATCH, /* IFMATCH_A */
310 IFMATCH, /* IFMATCH_A_fail */
311 CURLY, /* CURLY_B_min_known */
312 CURLY, /* CURLY_B_min_known_fail */
313 CURLY, /* CURLY_B_min */
314 CURLY, /* CURLY_B_min_fail */
315 CURLY, /* CURLY_B_max */
316 CURLY, /* CURLY_B_max_fail */
317 COMMIT, /* COMMIT_next */
318 COMMIT, /* COMMIT_next_fail */
319 MARKPOINT, /* MARKPOINT_next */
320 MARKPOINT, /* MARKPOINT_next_fail */
321 SKIP, /* SKIP_next */
322 SKIP, /* SKIP_next_fail */
323 CUTGROUP, /* CUTGROUP_next */
324 CUTGROUP, /* CUTGROUP_next_fail */
325 KEEPS, /* KEEPS_next */
326 KEEPS, /* KEEPS_next_fail */
330 /* regarglen[] - How large is the argument part of the node (in regnodes) */
333 static const U8 regarglen[] = {
392 EXTRA_SIZE(struct regnode_2), /* CURLY */
393 EXTRA_SIZE(struct regnode_2), /* CURLYN */
394 EXTRA_SIZE(struct regnode_2), /* CURLYM */
395 EXTRA_SIZE(struct regnode_2), /* CURLYX */
397 EXTRA_SIZE(struct regnode_1), /* OPEN */
398 EXTRA_SIZE(struct regnode_1), /* CLOSE */
399 EXTRA_SIZE(struct regnode_1), /* REF */
400 EXTRA_SIZE(struct regnode_1), /* REFF */
401 EXTRA_SIZE(struct regnode_1), /* REFFL */
402 EXTRA_SIZE(struct regnode_1), /* REFFU */
403 EXTRA_SIZE(struct regnode_1), /* REFFA */
404 EXTRA_SIZE(struct regnode_1), /* NREF */
405 EXTRA_SIZE(struct regnode_1), /* NREFF */
406 EXTRA_SIZE(struct regnode_1), /* NREFFL */
407 EXTRA_SIZE(struct regnode_1), /* NREFFU */
408 EXTRA_SIZE(struct regnode_1), /* NREFFA */
409 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
410 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
411 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
412 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
413 EXTRA_SIZE(struct regnode_1), /* GROUPP */
414 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
415 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
416 EXTRA_SIZE(struct regnode_1), /* EVAL */
419 EXTRA_SIZE(struct regnode_1), /* RENUM */
420 EXTRA_SIZE(struct regnode_1), /* TRIE */
421 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
422 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
423 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
424 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
426 EXTRA_SIZE(struct regnode_1), /* NGROUPP */
427 EXTRA_SIZE(struct regnode_1), /* INSUBP */
428 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
431 EXTRA_SIZE(struct regnode_1), /* ACCEPT */
432 EXTRA_SIZE(struct regnode_1), /* VERB */
433 EXTRA_SIZE(struct regnode_1), /* PRUNE */
434 EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
435 EXTRA_SIZE(struct regnode_1), /* SKIP */
436 EXTRA_SIZE(struct regnode_1), /* COMMIT */
437 EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
444 EXTRA_SIZE(struct regnode_1), /* FOLDCHAR */
449 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
451 static const char reg_off_by_arg[] = {
541 0, /* AHOCORASICKC */
567 #endif /* REG_COMP_C */
569 /* reg_name[] - Opcode/state names in string form, for debugging */
572 EXTCONST char * PL_reg_name[];
574 EXTCONST char * const PL_reg_name[] = {
576 "SUCCEED", /* 0x01 */
589 "NBOUNDL", /* 0x0e */
590 "NBOUNDU", /* 0x0f */
591 "NBOUNDA", /* 0x10 */
593 "REG_ANY", /* 0x12 */
603 "NALNUML", /* 0x1c */
604 "NALNUMU", /* 0x1d */
605 "NALNUMA", /* 0x1e */
611 "NSPACEL", /* 0x24 */
612 "NSPACEU", /* 0x25 */
613 "NSPACEA", /* 0x26 */
618 "NDIGITL", /* 0x2b */
619 "NDIGITA", /* 0x2c */
625 "EXACTFL", /* 0x32 */
626 "EXACTFU", /* 0x33 */
627 "EXACTFU_SS", /* 0x34 */
628 "EXACTFA", /* 0x35 */
629 "NOTHING", /* 0x36 */
650 "IFMATCH", /* 0x4b */
651 "UNLESSM", /* 0x4c */
652 "SUSPEND", /* 0x4d */
655 "LONGJMP", /* 0x50 */
656 "BRANCHJ", /* 0x51 */
659 "LOGICAL", /* 0x54 */
663 "AHOCORASICK", /* 0x58 */
664 "AHOCORASICKC", /* 0x59 */
666 "GOSTART", /* 0x5b */
667 "NGROUPP", /* 0x5c */
669 "DEFINEP", /* 0x5e */
670 "ENDLIKE", /* 0x5f */
675 "MARKPOINT", /* 0x64 */
678 "CUTGROUP", /* 0x67 */
680 "LNBREAK", /* 0x69 */
682 "NVERTWS", /* 0x6b */
683 "HORIZWS", /* 0x6c */
684 "NHORIZWS", /* 0x6d */
685 "FOLDCHAR", /* 0x6e */
686 "OPTIMIZED", /* 0x6f */
688 /* ------------ States ------------- */
689 "TRIE_next", /* REGNODE_MAX +0x01 */
690 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
691 "EVAL_AB", /* REGNODE_MAX +0x03 */
692 "EVAL_AB_fail", /* REGNODE_MAX +0x04 */
693 "CURLYX_end", /* REGNODE_MAX +0x05 */
694 "CURLYX_end_fail", /* REGNODE_MAX +0x06 */
695 "WHILEM_A_pre", /* REGNODE_MAX +0x07 */
696 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
697 "WHILEM_A_min", /* REGNODE_MAX +0x09 */
698 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
699 "WHILEM_A_max", /* REGNODE_MAX +0x0b */
700 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
701 "WHILEM_B_min", /* REGNODE_MAX +0x0d */
702 "WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
703 "WHILEM_B_max", /* REGNODE_MAX +0x0f */
704 "WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
705 "BRANCH_next", /* REGNODE_MAX +0x11 */
706 "BRANCH_next_fail", /* REGNODE_MAX +0x12 */
707 "CURLYM_A", /* REGNODE_MAX +0x13 */
708 "CURLYM_A_fail", /* REGNODE_MAX +0x14 */
709 "CURLYM_B", /* REGNODE_MAX +0x15 */
710 "CURLYM_B_fail", /* REGNODE_MAX +0x16 */
711 "IFMATCH_A", /* REGNODE_MAX +0x17 */
712 "IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
713 "CURLY_B_min_known", /* REGNODE_MAX +0x19 */
714 "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
715 "CURLY_B_min", /* REGNODE_MAX +0x1b */
716 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
717 "CURLY_B_max", /* REGNODE_MAX +0x1d */
718 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
719 "COMMIT_next", /* REGNODE_MAX +0x1f */
720 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
721 "MARKPOINT_next", /* REGNODE_MAX +0x21 */
722 "MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
723 "SKIP_next", /* REGNODE_MAX +0x23 */
724 "SKIP_next_fail", /* REGNODE_MAX +0x24 */
725 "CUTGROUP_next", /* REGNODE_MAX +0x25 */
726 "CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
727 "KEEPS_next", /* REGNODE_MAX +0x27 */
728 "KEEPS_next_fail", /* REGNODE_MAX +0x28 */
732 /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
735 EXTCONST char * PL_reg_extflags_name[];
737 EXTCONST char * const PL_reg_extflags_name[] = {
738 /* Bits in extflags defined: 11111111111111111111111011111111 */
739 "MULTILINE", /* 0x00000001 */
740 "SINGLELINE", /* 0x00000002 */
741 "FOLD", /* 0x00000004 */
742 "EXTENDED", /* 0x00000008 */
743 "KEEPCOPY", /* 0x00000010 */
744 "CHARSET", /* 0x000000e0 */
745 "CHARSET", /* 0x000000e0 */
746 "CHARSET", /* 0x000000e0 */
747 "UNUSED_BIT_8", /* 0x00000100 */
748 "ANCH_BOL", /* 0x00000200 */
749 "ANCH_MBOL", /* 0x00000400 */
750 "ANCH_SBOL", /* 0x00000800 */
751 "ANCH_GPOS", /* 0x00001000 */
752 "GPOS_SEEN", /* 0x00002000 */
753 "GPOS_FLOAT", /* 0x00004000 */
754 "LOOKBEHIND_SEEN", /* 0x00008000 */
755 "EVAL_SEEN", /* 0x00010000 */
756 "CANY_SEEN", /* 0x00020000 */
757 "NOSCAN", /* 0x00040000 */
758 "CHECK_ALL", /* 0x00080000 */
759 "MATCH_UTF8", /* 0x00100000 */
760 "USE_INTUIT_NOML", /* 0x00200000 */
761 "USE_INTUIT_ML", /* 0x00400000 */
762 "INTUIT_TAIL", /* 0x00800000 */
763 "SPLIT", /* 0x01000000 */
764 "COPY_DONE", /* 0x02000000 */
765 "TAINTED_SEEN", /* 0x04000000 */
766 "TAINTED", /* 0x08000000 */
767 "START_ONLY", /* 0x10000000 */
768 "SKIPWHITE", /* 0x20000000 */
769 "WHITE", /* 0x40000000 */
770 "NULL", /* 0x80000000 */
774 /* The following have no fixed length. U8 so we can do strchr() on it. */
775 #define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
778 EXTCONST U8 PL_varies[] __attribute__deprecated__;
780 EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
781 ANYOFV, CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX,
782 WHILEM, REF, REFF, REFFL, REFFU, REFFA, NREF, NREFF, NREFFL, NREFFU,
783 NREFFA, SUSPEND, IFTHEN, BRANCHJ,
789 EXTCONST U8 PL_varies_bitmask[];
791 EXTCONST U8 PL_varies_bitmask[] = {
792 0x00, 0x00, 0x40, 0x00, 0x00, 0xE0, 0x00, 0x7F, 0xFE, 0x67, 0x02, 0x00, 0x00, 0x00, 0x00
796 /* The following always have a length of 1. U8 we can do strchr() on it. */
797 /* (Note that length 1 means "one character" under UTF8, not "one octet".) */
798 #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
801 EXTCONST U8 PL_simple[] __attribute__deprecated__;
803 EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
804 REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, ALNUMU, ALNUMA, NALNUM,
805 NALNUML, NALNUMU, NALNUMA, SPACE, SPACEL, SPACEU, SPACEA, NSPACE,
806 NSPACEL, NSPACEU, NSPACEA, DIGIT, DIGITL, DIGITA, NDIGIT, NDIGITL,
807 NDIGITA, VERTWS, NVERTWS, HORIZWS, NHORIZWS,
813 EXTCONST U8 PL_simple_bitmask[];
815 EXTCONST U8 PL_simple_bitmask[] = {
816 0x00, 0x00, 0xBC, 0xFF, 0xFF, 0x1F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x3C, 0x00