1 /* -*- buffer-read-only: t -*-
2 !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
3 This file is built by regcomp.pl from regcomp.sym.
4 Any changes made here will be lost!
7 /* Regops and State definitions */
10 #define REGMATCH_STATE_MAX 110
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. */
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 combining character 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 (prec. by length). */
47 #define EXACTFL 35 /* 0x23 Match this string, folded in locale (w/len). */
48 #define NOTHING 36 /* 0x24 Match empty string. */
49 #define TAIL 37 /* 0x25 Match empty string. Can jump here from outside. */
50 #define STAR 38 /* 0x26 Match this (simple) thing 0 or more times. */
51 #define PLUS 39 /* 0x27 Match this (simple) thing 1 or more times. */
52 #define CURLY 40 /* 0x28 Match this simple thing {n,m} times. */
53 #define CURLYN 41 /* 0x29 Capture next-after-this simple thing */
54 #define CURLYM 42 /* 0x2a Capture this medium-complex thing {n,m} times. */
55 #define CURLYX 43 /* 0x2b Match this complex thing {n,m} times. */
56 #define WHILEM 44 /* 0x2c Do curly processing and see if rest matches. */
57 #define OPEN 45 /* 0x2d Mark this point in input as start of */
58 #define CLOSE 46 /* 0x2e Analogous to OPEN. */
59 #define REF 47 /* 0x2f Match some already matched string */
60 #define REFF 48 /* 0x30 Match already matched string, folded */
61 #define REFFL 49 /* 0x31 Match already matched string, folded in loc. */
62 #define IFMATCH 50 /* 0x32 Succeeds if the following matches. */
63 #define UNLESSM 51 /* 0x33 Fails if the following matches. */
64 #define SUSPEND 52 /* 0x34 "Independent" sub-RE. */
65 #define IFTHEN 53 /* 0x35 Switch, should be preceeded by switcher . */
66 #define GROUPP 54 /* 0x36 Whether the group matched. */
67 #define LONGJMP 55 /* 0x37 Jump far away. */
68 #define BRANCHJ 56 /* 0x38 BRANCH with long offset. */
69 #define EVAL 57 /* 0x39 Execute some Perl code. */
70 #define MINMOD 58 /* 0x3a Next operator is not greedy. */
71 #define LOGICAL 59 /* 0x3b Next opcode should set the flag only. */
72 #define RENUM 60 /* 0x3c Group with independently numbered parens. */
73 #define TRIE 61 /* 0x3d Match many EXACT(FL?)? at once. flags==type */
74 #define TRIEC 62 /* 0x3e Same as TRIE, but with embedded charclass data */
75 #define AHOCORASICK 63 /* 0x3f Aho Corasick stclass. flags==type */
76 #define AHOCORASICKC 64 /* 0x40 Same as AHOCORASICK, but with embedded charclass data */
77 #define GOSUB 65 /* 0x41 recurse to paren arg1 at (signed) ofs arg2 */
78 #define GOSTART 66 /* 0x42 recurse to start of pattern */
79 #define NREF 67 /* 0x43 Match some already matched string */
80 #define NREFF 68 /* 0x44 Match already matched string, folded */
81 #define NREFFL 69 /* 0x45 Match already matched string, folded in loc. */
82 #define NGROUPP 70 /* 0x46 Whether the group matched. */
83 #define INSUBP 71 /* 0x47 Whether we are in a specific recurse. */
84 #define DEFINEP 72 /* 0x48 Never execute directly. */
85 #define OPFAIL 73 /* 0x49 Same as (?!) */
86 #define COMMIT 74 /* 0x4a Pattern fails if backtracking through this */
87 #define CUT 75 /* 0x4b ... and restarts at the cursor point */
88 #define OPERROR 76 /* 0x4c Pattern fails outright if backtracking through this */
89 #define OPTIMIZED 77 /* 0x4d Placeholder for dump. */
90 #define PSEUDO 78 /* 0x4e Pseudo opcode for internal use. */
91 /* ------------ States ------------- */
92 #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
93 #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
94 #define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
95 #define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
96 #define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
97 #define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
98 #define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
99 #define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
100 #define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
101 #define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
102 #define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
103 #define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
104 #define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
105 #define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
106 #define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
107 #define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
108 #define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
109 #define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
110 #define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
111 #define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
112 #define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
113 #define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
114 #define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
115 #define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
116 #define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
117 #define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
118 #define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
119 #define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
120 #define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
121 #define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
122 #define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
123 #define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
125 /* PL_regkind[] What type of regop or state is this. */
128 EXTCONST U8 PL_regkind[];
130 EXTCONST U8 PL_regkind[] = {
143 NBOUND, /* NBOUNDL */
145 REG_ANY, /* REG_ANY */
152 NALNUM, /* NALNUML */
156 NSPACE, /* NSPACEL */
160 NDIGIT, /* NDIGITL */
167 NOTHING, /* NOTHING */
181 BRANCHJ, /* IFMATCH */
182 BRANCHJ, /* UNLESSM */
183 BRANCHJ, /* SUSPEND */
184 BRANCHJ, /* IFTHEN */
186 LONGJMP, /* LONGJMP */
187 BRANCHJ, /* BRANCHJ */
190 LOGICAL, /* LOGICAL */
194 TRIE, /* AHOCORASICK */
195 TRIE, /* AHOCORASICKC */
197 GOSTART, /* GOSTART */
201 NGROUPP, /* NGROUPP */
203 DEFINEP, /* DEFINEP */
207 OPERROR, /* OPERROR */
208 NOTHING, /* OPTIMIZED */
210 /* ------------ States ------------- */
211 TRIE, /* TRIE_next */
212 TRIE, /* TRIE_next_fail */
214 EVAL, /* EVAL_AB_fail */
215 CURLYX, /* CURLYX_end */
216 CURLYX, /* CURLYX_end_fail */
217 WHILEM, /* WHILEM_A_pre */
218 WHILEM, /* WHILEM_A_pre_fail */
219 WHILEM, /* WHILEM_A_min */
220 WHILEM, /* WHILEM_A_min_fail */
221 WHILEM, /* WHILEM_A_max */
222 WHILEM, /* WHILEM_A_max_fail */
223 WHILEM, /* WHILEM_B_min */
224 WHILEM, /* WHILEM_B_min_fail */
225 WHILEM, /* WHILEM_B_max */
226 WHILEM, /* WHILEM_B_max_fail */
227 BRANCH, /* BRANCH_next */
228 BRANCH, /* BRANCH_next_fail */
229 CURLYM, /* CURLYM_A */
230 CURLYM, /* CURLYM_A_fail */
231 CURLYM, /* CURLYM_B */
232 CURLYM, /* CURLYM_B_fail */
233 IFMATCH, /* IFMATCH_A */
234 IFMATCH, /* IFMATCH_A_fail */
235 CURLY, /* CURLY_B_min_known */
236 CURLY, /* CURLY_B_min_known_fail */
237 CURLY, /* CURLY_B_min */
238 CURLY, /* CURLY_B_min_fail */
239 CURLY, /* CURLY_B_max */
240 CURLY, /* CURLY_B_max_fail */
241 COMMIT, /* COMMIT_next */
242 COMMIT, /* COMMIT_next_fail */
246 /* regarglen[] - How large is the argument part of the node (in regnodes) */
249 static const U8 regarglen[] = {
290 EXTRA_SIZE(struct regnode_2), /* CURLY */
291 EXTRA_SIZE(struct regnode_2), /* CURLYN */
292 EXTRA_SIZE(struct regnode_2), /* CURLYM */
293 EXTRA_SIZE(struct regnode_2), /* CURLYX */
295 EXTRA_SIZE(struct regnode_1), /* OPEN */
296 EXTRA_SIZE(struct regnode_1), /* CLOSE */
297 EXTRA_SIZE(struct regnode_1), /* REF */
298 EXTRA_SIZE(struct regnode_1), /* REFF */
299 EXTRA_SIZE(struct regnode_1), /* REFFL */
300 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
301 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
302 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
303 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
304 EXTRA_SIZE(struct regnode_1), /* GROUPP */
305 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
306 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
307 EXTRA_SIZE(struct regnode_1), /* EVAL */
310 EXTRA_SIZE(struct regnode_1), /* RENUM */
311 EXTRA_SIZE(struct regnode_1), /* TRIE */
312 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
313 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
314 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
315 EXTRA_SIZE(struct regnode_2L), /* GOSUB */
317 EXTRA_SIZE(struct regnode_1), /* NREF */
318 EXTRA_SIZE(struct regnode_1), /* NREFF */
319 EXTRA_SIZE(struct regnode_1), /* NREFFL */
320 EXTRA_SIZE(struct regnode_1), /* NGROUPP */
321 EXTRA_SIZE(struct regnode_1), /* INSUBP */
322 EXTRA_SIZE(struct regnode_1), /* DEFINEP */
331 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
333 static const char reg_off_by_arg[] = {
398 0, /* AHOCORASICKC */
415 /* reg_name[] - Opcode/state names in string form, for debugging */
418 const char * reg_name[] = {
420 "SUCCEED", /* 0x01 */
431 "NBOUNDL", /* 0x0c */
433 "REG_ANY", /* 0x0e */
440 "NALNUML", /* 0x15 */
444 "NSPACEL", /* 0x19 */
448 "NDIGITL", /* 0x1d */
454 "EXACTFL", /* 0x23 */
455 "NOTHING", /* 0x24 */
469 "IFMATCH", /* 0x32 */
470 "UNLESSM", /* 0x33 */
471 "SUSPEND", /* 0x34 */
474 "LONGJMP", /* 0x37 */
475 "BRANCHJ", /* 0x38 */
478 "LOGICAL", /* 0x3b */
482 "AHOCORASICK", /* 0x3f */
483 "AHOCORASICKC", /* 0x40 */
485 "GOSTART", /* 0x42 */
489 "NGROUPP", /* 0x46 */
491 "DEFINEP", /* 0x48 */
495 "OPERROR", /* 0x4c */
496 "OPTIMIZED", /* 0x4d */
498 /* ------------ States ------------- */
499 "TRIE_next", /* REGNODE_MAX +0x01 */
500 "TRIE_next_fail", /* REGNODE_MAX +0x02 */
501 "EVAL_AB", /* REGNODE_MAX +0x03 */
502 "EVAL_AB_fail", /* REGNODE_MAX +0x04 */
503 "CURLYX_end", /* REGNODE_MAX +0x05 */
504 "CURLYX_end_fail", /* REGNODE_MAX +0x06 */
505 "WHILEM_A_pre", /* REGNODE_MAX +0x07 */
506 "WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
507 "WHILEM_A_min", /* REGNODE_MAX +0x09 */
508 "WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
509 "WHILEM_A_max", /* REGNODE_MAX +0x0b */
510 "WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
511 "WHILEM_B_min", /* REGNODE_MAX +0x0d */
512 "WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
513 "WHILEM_B_max", /* REGNODE_MAX +0x0f */
514 "WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
515 "BRANCH_next", /* REGNODE_MAX +0x11 */
516 "BRANCH_next_fail", /* REGNODE_MAX +0x12 */
517 "CURLYM_A", /* REGNODE_MAX +0x13 */
518 "CURLYM_A_fail", /* REGNODE_MAX +0x14 */
519 "CURLYM_B", /* REGNODE_MAX +0x15 */
520 "CURLYM_B_fail", /* REGNODE_MAX +0x16 */
521 "IFMATCH_A", /* REGNODE_MAX +0x17 */
522 "IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
523 "CURLY_B_min_known", /* REGNODE_MAX +0x19 */
524 "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
525 "CURLY_B_min", /* REGNODE_MAX +0x1b */
526 "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
527 "CURLY_B_max", /* REGNODE_MAX +0x1d */
528 "CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
529 "COMMIT_next", /* REGNODE_MAX +0x1f */
530 "COMMIT_next_fail", /* REGNODE_MAX +0x20 */
532 #endif /* DEBUGGING */
535 extern const char * reg_name[];
537 #endif /* REG_COMP_C */