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 */
10 #define REGMATCH_STATE_MAX 133
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 */
22 #define BOUNDL 10 /* 0x0a Match "" at any word boundary */
23 #define NBOUND 11 /* 0x0b Match "" at any word non-boundary */
24 #define NBOUNDL 12 /* 0x0c Match "" at any word non-boundary */
25 #define GPOS 13 /* 0x0d Matches where last m//g left off. */
26 #define REG_ANY 14 /* 0x0e Match any one character (except newline). */
27 #define SANY 15 /* 0x0f Match any one character. */
28 #define CANY 16 /* 0x10 Match any one byte. */
29 #define ANYOF 17 /* 0x11 Match character in (or not in) this class, folding is native charset for non-utf8. */
30 #define ALNUM 18 /* 0x12 Match any alphanumeric character */
31 #define ALNUML 19 /* 0x13 Match any alphanumeric char in locale */
32 #define NALNUM 20 /* 0x14 Match any non-alphanumeric character */
33 #define NALNUML 21 /* 0x15 Match any non-alphanumeric char in locale */
34 #define SPACE 22 /* 0x16 Match any whitespace character */
35 #define SPACEL 23 /* 0x17 Match any whitespace char in locale */
36 #define NSPACE 24 /* 0x18 Match any non-whitespace character */
37 #define NSPACEL 25 /* 0x19 Match any non-whitespace char in locale */
38 #define DIGIT 26 /* 0x1a Match any numeric character */
39 #define DIGITL 27 /* 0x1b Match any numeric character in locale */
40 #define NDIGIT 28 /* 0x1c Match any non-numeric character */
41 #define NDIGITL 29 /* 0x1d Match any non-numeric character in locale */
42 #define CLUMP 30 /* 0x1e Match any extended grapheme cluster sequence */
43 #define BRANCH 31 /* 0x1f Match this alternative, or the next... */
44 #define BACK 32 /* 0x20 Match "", "next" ptr points backward. */
45 #define EXACT 33 /* 0x21 Match this string (preceded by length). */
46 #define EXACTF 34 /* 0x22 Match this string, folded, native charset semantics for non-utf8 (prec. by length). */
47 #define EXACTFL 35 /* 0x23 Match this string, folded in locale (w/len). */
48 #define EXACTFU 36 /* 0x24 Match this string, folded, Unicode semantics for non-utf8 (prec. by length). */
49 #define NOTHING 37 /* 0x25 Match empty string. */
50 #define TAIL 38 /* 0x26 Match empty string. Can jump here from outside. */
51 #define STAR 39 /* 0x27 Match this (simple) thing 0 or more times. */
52 #define PLUS 40 /* 0x28 Match this (simple) thing 1 or more times. */
53 #define CURLY 41 /* 0x29 Match this simple thing {n,m} times. */
54 #define CURLYN 42 /* 0x2a Capture next-after-this simple thing */
55 #define CURLYM 43 /* 0x2b Capture this medium-complex thing {n,m} times. */
56 #define CURLYX 44 /* 0x2c Match this complex thing {n,m} times. */
57 #define WHILEM 45 /* 0x2d Do curly processing and see if rest matches. */
58 #define OPEN 46 /* 0x2e Mark this point in input as start of */
59 #define CLOSE 47 /* 0x2f Analogous to OPEN. */
60 #define REF 48 /* 0x30 Match some already matched string */
61 #define REFF 49 /* 0x31 Match already matched string, folded using native charset semantics for non-utf8 */
62 #define REFFL 50 /* 0x32 Match already matched string, folded in loc. */
63 #define REFFU 51 /* 0x33 Match already matched string, folded using unicode semantics for non-utf8 */
64 #define NREF 52 /* 0x34 Match some already matched string */
65 #define NREFF 53 /* 0x35 Match already matched string, folded using native charset semantics for non-utf8 */
66 #define NREFFL 54 /* 0x36 Match already matched string, folded in loc. */
67 #define NREFFU 55 /* 0x37 Match already matched string, folded using unicode semantics for non-utf8 */
68 #define IFMATCH 56 /* 0x38 Succeeds if the following matches. */
69 #define UNLESSM 57 /* 0x39 Fails if the following matches. */
70 #define SUSPEND 58 /* 0x3a "Independent" sub-RE. */
71 #define IFTHEN 59 /* 0x3b Switch, should be preceeded by switcher . */
72 #define GROUPP 60 /* 0x3c Whether the group matched. */
73 #define LONGJMP 61 /* 0x3d Jump far away. */
74 #define BRANCHJ 62 /* 0x3e BRANCH with long offset. */
75 #define EVAL 63 /* 0x3f Execute some Perl code. */
76 #define MINMOD 64 /* 0x40 Next operator is not greedy. */
77 #define LOGICAL 65 /* 0x41 Next opcode should set the flag only. */
78 #define RENUM 66 /* 0x42 Group with independently numbered parens. */
79 #define TRIE 67 /* 0x43 Match many EXACT(F[LU]?)? at once. flags==type */
80 #define TRIEC 68 /* 0x44 Same as TRIE, but with embedded charclass data */
81 #define AHOCORASICK 69 /* 0x45 Aho Corasick stclass. flags==type */
82 #define AHOCORASICKC 70 /* 0x46 Same as AHOCORASICK, but with embedded charclass data */
83 #define GOSUB 71 /* 0x47 recurse to paren arg1 at (signed) ofs arg2 */
84 #define GOSTART 72 /* 0x48 recurse to start of pattern */
85 #define NGROUPP 73 /* 0x49 Whether the group matched. */
86 #define INSUBP 74 /* 0x4a Whether we are in a specific recurse. */
87 #define DEFINEP 75 /* 0x4b Never execute directly. */
88 #define ENDLIKE 76 /* 0x4c Used only for the type field of verbs */
89 #define OPFAIL 77 /* 0x4d Same as (?!) */
90 #define ACCEPT 78 /* 0x4e Accepts the current matched string. */
91 #define VERB 79 /* 0x4f Used only for the type field of verbs */
92 #define PRUNE 80 /* 0x50 Pattern fails at this startpoint if no-backtracking through this */
93 #define MARKPOINT 81 /* 0x51 Push the current location for rollback by cut. */
94 #define SKIP 82 /* 0x52 On failure skip forward (to the mark) before retrying */
95 #define COMMIT 83 /* 0x53 Pattern fails outright if backtracking through this */
96 #define CUTGROUP 84 /* 0x54 On failure go to the next alternation in the group */
97 #define KEEPS 85 /* 0x55 $& begins here. */
98 #define LNBREAK 86 /* 0x56 generic newline pattern */
99 #define VERTWS 87 /* 0x57 vertical whitespace (Perl 6) */
100 #define NVERTWS 88 /* 0x58 not vertical whitespace (Perl 6) */
101 #define HORIZWS 89 /* 0x59 horizontal whitespace (Perl 6) */
102 #define NHORIZWS 90 /* 0x5a not horizontal whitespace (Perl 6) */
103 #define FOLDCHAR 91 /* 0x5b codepoint with tricky case folding properties. */
104 #define OPTIMIZED 92 /* 0x5c Placeholder for dump. */
105 #define PSEUDO 93 /* 0x5d Pseudo opcode for internal use. */
106 /* ------------ States ------------- */
107 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
108 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
109 #define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
110 #define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
111 #define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
112 #define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
113 #define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
114 #define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
115 #define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
116 #define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
117 #define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
118 #define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
119 #define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
120 #define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
121 #define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
122 #define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
123 #define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
124 #define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
125 #define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
126 #define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
127 #define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
128 #define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
129 #define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
130 #define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
131 #define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
132 #define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
133 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
134 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
135 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
136 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
137 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
138 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
139 #define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
140 #define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
141 #define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
142 #define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
143 #define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
144 #define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
145 #define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
146 #define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
148 /* PL_regkind[] What type of regop or state is this. */
151 EXTCONST U8 PL_regkind[];
153 EXTCONST U8 PL_regkind[] = {
166 NBOUND, /* NBOUNDL */
168 REG_ANY, /* REG_ANY */
175 NALNUM, /* NALNUML */
179 NSPACE, /* NSPACEL */
183 NDIGIT, /* NDIGITL */
191 NOTHING, /* NOTHING */
210 BRANCHJ, /* IFMATCH */
211 BRANCHJ, /* UNLESSM */
212 BRANCHJ, /* SUSPEND */
213 BRANCHJ, /* IFTHEN */
215 LONGJMP, /* LONGJMP */
216 BRANCHJ, /* BRANCHJ */
219 LOGICAL, /* LOGICAL */
223 TRIE, /* AHOCORASICK */
224 TRIE, /* AHOCORASICKC */
226 GOSTART, /* GOSTART */
227 NGROUPP, /* NGROUPP */
229 DEFINEP, /* DEFINEP */
230 ENDLIKE, /* ENDLIKE */
231 ENDLIKE, /* OPFAIL */
232 ENDLIKE, /* ACCEPT */
235 VERB, /* MARKPOINT */
240 LNBREAK, /* LNBREAK */
242 NVERTWS, /* NVERTWS */
243 HORIZWS, /* HORIZWS */
244 NHORIZWS, /* NHORIZWS */
245 FOLDCHAR, /* FOLDCHAR */
246 NOTHING, /* OPTIMIZED */
248 /* ------------ States ------------- */
249 TRIE, /* TRIE_next */
250 TRIE, /* TRIE_next_fail */
252 EVAL, /* EVAL_AB_fail */
253 CURLYX, /* CURLYX_end */
254 CURLYX, /* CURLYX_end_fail */
255 WHILEM, /* WHILEM_A_pre */
256 WHILEM, /* WHILEM_A_pre_fail */
257 WHILEM, /* WHILEM_A_min */
258 WHILEM, /* WHILEM_A_min_fail */
259 WHILEM, /* WHILEM_A_max */
260 WHILEM, /* WHILEM_A_max_fail */
261 WHILEM, /* WHILEM_B_min */
262 WHILEM, /* WHILEM_B_min_fail */
263 WHILEM, /* WHILEM_B_max */
264 WHILEM, /* WHILEM_B_max_fail */
265 BRANCH, /* BRANCH_next */
266 BRANCH, /* BRANCH_next_fail */
267 CURLYM, /* CURLYM_A */
268 CURLYM, /* CURLYM_A_fail */
269 CURLYM, /* CURLYM_B */
270 CURLYM, /* CURLYM_B_fail */
271 IFMATCH, /* IFMATCH_A */
272 IFMATCH, /* IFMATCH_A_fail */
273 CURLY, /* CURLY_B_min_known */
274 CURLY, /* CURLY_B_min_known_fail */
275 CURLY, /* CURLY_B_min */
276 CURLY, /* CURLY_B_min_fail */
277 CURLY, /* CURLY_B_max */
278 CURLY, /* CURLY_B_max_fail */
279 COMMIT, /* COMMIT_next */
280 COMMIT, /* COMMIT_next_fail */
281 MARKPOINT, /* MARKPOINT_next */
282 MARKPOINT, /* MARKPOINT_next_fail */
283 SKIP, /* SKIP_next */
284 SKIP, /* SKIP_next_fail */
285 CUTGROUP, /* CUTGROUP_next */
286 CUTGROUP, /* CUTGROUP_next_fail */
287 KEEPS, /* KEEPS_next */
288 KEEPS, /* KEEPS_next_fail */
292 /* regarglen[] - How large is the argument part of the node (in regnodes) */
295 static const U8 regarglen[] = {
337 EXTRA_SIZE(struct regnode_2), /* CURLY */
338 EXTRA_SIZE(struct regnode_2), /* CURLYN */
339 EXTRA_SIZE(struct regnode_2), /* CURLYM */
340 EXTRA_SIZE(struct regnode_2), /* CURLYX */
342 EXTRA_SIZE(struct regnode_1), /* OPEN */
343 EXTRA_SIZE(struct regnode_1), /* CLOSE */
344 EXTRA_SIZE(struct regnode_1), /* REF */
345 EXTRA_SIZE(struct regnode_1), /* REFF */
346 EXTRA_SIZE(struct regnode_1), /* REFFL */
347 EXTRA_SIZE(struct regnode_1), /* REFFU */
348 EXTRA_SIZE(struct regnode_1), /* NREF */
349 EXTRA_SIZE(struct regnode_1), /* NREFF */
350 EXTRA_SIZE(struct regnode_1), /* NREFFL */
351 EXTRA_SIZE(struct regnode_1), /* NREFFU */
352 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
353 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
354 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
355 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
356 EXTRA_SIZE(struct regnode_1), /* GROUPP */
357 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
358 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
359 EXTRA_SIZE(struct regnode_1), /* EVAL */
362 EXTRA_SIZE(struct regnode_1), /* RENUM */
363 EXTRA_SIZE(struct regnode_1), /* TRIE */
364 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
365 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
366 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
367 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
369 EXTRA_SIZE(struct regnode_1), /* NGROUPP */
370 EXTRA_SIZE(struct regnode_1), /* INSUBP */
371 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
374 EXTRA_SIZE(struct regnode_1), /* ACCEPT */
375 EXTRA_SIZE(struct regnode_1), /* VERB */
376 EXTRA_SIZE(struct regnode_1), /* PRUNE */
377 EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
378 EXTRA_SIZE(struct regnode_1), /* SKIP */
379 EXTRA_SIZE(struct regnode_1), /* COMMIT */
380 EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
387 EXTRA_SIZE(struct regnode_1), /* FOLDCHAR */
392 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
394 static const char reg_off_by_arg[] = {
465 0, /* AHOCORASICKC */
491 #endif /* REG_COMP_C */
493 /* reg_name[] - Opcode/state names in string form, for debugging */
496 EXTCONST char * PL_reg_name[];
498 EXTCONST char * const PL_reg_name[] = {
500 "SUCCEED", /* 0x01 */
511 "NBOUNDL", /* 0x0c */
513 "REG_ANY", /* 0x0e */
520 "NALNUML", /* 0x15 */
524 "NSPACEL", /* 0x19 */
528 "NDIGITL", /* 0x1d */
534 "EXACTFL", /* 0x23 */
535 "EXACTFU", /* 0x24 */
536 "NOTHING", /* 0x25 */
555 "IFMATCH", /* 0x38 */
556 "UNLESSM", /* 0x39 */
557 "SUSPEND", /* 0x3a */
560 "LONGJMP", /* 0x3d */
561 "BRANCHJ", /* 0x3e */
564 "LOGICAL", /* 0x41 */
568 "AHOCORASICK", /* 0x45 */
569 "AHOCORASICKC", /* 0x46 */
571 "GOSTART", /* 0x48 */
572 "NGROUPP", /* 0x49 */
574 "DEFINEP", /* 0x4b */
575 "ENDLIKE", /* 0x4c */
580 "MARKPOINT", /* 0x51 */
583 "CUTGROUP", /* 0x54 */
585 "LNBREAK", /* 0x56 */
587 "NVERTWS", /* 0x58 */
588 "HORIZWS", /* 0x59 */
589 "NHORIZWS", /* 0x5a */
590 "FOLDCHAR", /* 0x5b */
591 "OPTIMIZED", /* 0x5c */
593 /* ------------ States ------------- */
594 "TRIE_next", /* REGNODE_MAX +0x01 */
595 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
596 "EVAL_AB", /* REGNODE_MAX +0x03 */
597 "EVAL_AB_fail", /* REGNODE_MAX +0x04 */
598 "CURLYX_end", /* REGNODE_MAX +0x05 */
599 "CURLYX_end_fail", /* REGNODE_MAX +0x06 */
600 "WHILEM_A_pre", /* REGNODE_MAX +0x07 */
601 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
602 "WHILEM_A_min", /* REGNODE_MAX +0x09 */
603 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
604 "WHILEM_A_max", /* REGNODE_MAX +0x0b */
605 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
606 "WHILEM_B_min", /* REGNODE_MAX +0x0d */
607 "WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
608 "WHILEM_B_max", /* REGNODE_MAX +0x0f */
609 "WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
610 "BRANCH_next", /* REGNODE_MAX +0x11 */
611 "BRANCH_next_fail", /* REGNODE_MAX +0x12 */
612 "CURLYM_A", /* REGNODE_MAX +0x13 */
613 "CURLYM_A_fail", /* REGNODE_MAX +0x14 */
614 "CURLYM_B", /* REGNODE_MAX +0x15 */
615 "CURLYM_B_fail", /* REGNODE_MAX +0x16 */
616 "IFMATCH_A", /* REGNODE_MAX +0x17 */
617 "IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
618 "CURLY_B_min_known", /* REGNODE_MAX +0x19 */
619 "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
620 "CURLY_B_min", /* REGNODE_MAX +0x1b */
621 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
622 "CURLY_B_max", /* REGNODE_MAX +0x1d */
623 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
624 "COMMIT_next", /* REGNODE_MAX +0x1f */
625 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
626 "MARKPOINT_next", /* REGNODE_MAX +0x21 */
627 "MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
628 "SKIP_next", /* REGNODE_MAX +0x23 */
629 "SKIP_next_fail", /* REGNODE_MAX +0x24 */
630 "CUTGROUP_next", /* REGNODE_MAX +0x25 */
631 "CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
632 "KEEPS_next", /* REGNODE_MAX +0x27 */
633 "KEEPS_next_fail", /* REGNODE_MAX +0x28 */
637 /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
640 EXTCONST char * PL_reg_extflags_name[];
642 EXTCONST char * const PL_reg_extflags_name[] = {
643 /* Bits in extflags defined: 11111111111111111111111001111111 */
644 "MULTILINE", /* 0x00000001 */
645 "SINGLELINE", /* 0x00000002 */
646 "FOLD", /* 0x00000004 */
647 "EXTENDED", /* 0x00000008 */
648 "KEEPCOPY", /* 0x00000010 */
649 "LOCALE", /* 0x00000020 */
650 "UNICODE", /* 0x00000040 */
651 "UNUSED_BIT_7", /* 0x00000080 */
652 "UNUSED_BIT_8", /* 0x00000100 */
653 "ANCH_BOL", /* 0x00000200 */
654 "ANCH_MBOL", /* 0x00000400 */
655 "ANCH_SBOL", /* 0x00000800 */
656 "ANCH_GPOS", /* 0x00001000 */
657 "GPOS_SEEN", /* 0x00002000 */
658 "GPOS_FLOAT", /* 0x00004000 */
659 "LOOKBEHIND_SEEN", /* 0x00008000 */
660 "EVAL_SEEN", /* 0x00010000 */
661 "CANY_SEEN", /* 0x00020000 */
662 "NOSCAN", /* 0x00040000 */
663 "CHECK_ALL", /* 0x00080000 */
664 "MATCH_UTF8", /* 0x00100000 */
665 "USE_INTUIT_NOML", /* 0x00200000 */
666 "USE_INTUIT_ML", /* 0x00400000 */
667 "INTUIT_TAIL", /* 0x00800000 */
668 "SPLIT", /* 0x01000000 */
669 "COPY_DONE", /* 0x02000000 */
670 "TAINTED_SEEN", /* 0x04000000 */
671 "TAINTED", /* 0x08000000 */
672 "START_ONLY", /* 0x10000000 */
673 "SKIPWHITE", /* 0x20000000 */
674 "WHITE", /* 0x40000000 */
675 "NULL", /* 0x80000000 */
679 /* The following have no fixed length. U8 so we can do strchr() on it. */
680 #define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
683 EXTCONST U8 PL_varies[] __attribute__deprecated__;
685 EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
686 CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX, WHILEM,
687 REF, REFF, REFFL, REFFU, NREF, NREFF, NREFFL, NREFFU, SUSPEND, IFTHEN,
694 EXTCONST U8 PL_varies_bitmask[];
696 EXTCONST U8 PL_varies_bitmask[] = {
697 0x00, 0x00, 0x00, 0xC0, 0x81, 0x3F, 0xFF, 0x4C, 0x00, 0x00, 0x00, 0x00
701 /* The following always have a length of 1. U8 we can do strchr() on it. */
702 /* (Note that length 1 means "one character" under UTF8, not "one octet".) */
703 #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
706 EXTCONST U8 PL_simple[] __attribute__deprecated__;
708 EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
709 REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, NALNUM, NALNUML, SPACE,
710 SPACEL, NSPACE, NSPACEL, DIGIT, DIGITL, NDIGIT, NDIGITL, VERTWS,
711 NVERTWS, HORIZWS, NHORIZWS,
717 EXTCONST U8 PL_simple_bitmask[];
719 EXTCONST U8 PL_simple_bitmask[] = {
720 0x00, 0xC0, 0xFF, 0x3F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x07