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 98
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 Match next-after-this simple thing */
54 #define CURLYM 42 /* 0x2a Match 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 RECURSE 65 /* 0x41 recurse to paren arg1 at (signed) ofs arg2 */
78 #define SRECURSE 66 /* 0x42 recurse to start of pattern */
79 #define OPTIMIZED 67 /* 0x43 Placeholder for dump. */
80 #define PSEUDO 68 /* 0x44 Pseudo opcode for internal use. */
82 /* ------------ States ------------- */
84 #define TRIE_next 69 /* 0x45 Regmatch state for TRIE */
85 #define TRIE_next_fail 70 /* 0x46 Regmatch state for TRIE */
86 #define EVAL_AB 71 /* 0x47 Regmatch state for EVAL */
87 #define EVAL_AB_fail 72 /* 0x48 Regmatch state for EVAL */
88 #define CURLYX_end 73 /* 0x49 Regmatch state for CURLYX */
89 #define CURLYX_end_fail 74 /* 0x4a Regmatch state for CURLYX */
90 #define WHILEM_A_pre 75 /* 0x4b Regmatch state for WHILEM */
91 #define WHILEM_A_pre_fail 76 /* 0x4c Regmatch state for WHILEM */
92 #define WHILEM_A_min 77 /* 0x4d Regmatch state for WHILEM */
93 #define WHILEM_A_min_fail 78 /* 0x4e Regmatch state for WHILEM */
94 #define WHILEM_A_max 79 /* 0x4f Regmatch state for WHILEM */
95 #define WHILEM_A_max_fail 80 /* 0x50 Regmatch state for WHILEM */
96 #define WHILEM_B_min 81 /* 0x51 Regmatch state for WHILEM */
97 #define WHILEM_B_min_fail 82 /* 0x52 Regmatch state for WHILEM */
98 #define WHILEM_B_max 83 /* 0x53 Regmatch state for WHILEM */
99 #define WHILEM_B_max_fail 84 /* 0x54 Regmatch state for WHILEM */
100 #define BRANCH_next 85 /* 0x55 Regmatch state for BRANCH */
101 #define BRANCH_next_fail 86 /* 0x56 Regmatch state for BRANCH */
102 #define CURLYM_A 87 /* 0x57 Regmatch state for CURLYM */
103 #define CURLYM_A_fail 88 /* 0x58 Regmatch state for CURLYM */
104 #define CURLYM_B 89 /* 0x59 Regmatch state for CURLYM */
105 #define CURLYM_B_fail 90 /* 0x5a Regmatch state for CURLYM */
106 #define IFMATCH_A 91 /* 0x5b Regmatch state for IFMATCH */
107 #define IFMATCH_A_fail 92 /* 0x5c Regmatch state for IFMATCH */
108 #define CURLY_B_min_known 93 /* 0x5d Regmatch state for CURLY */
109 #define CURLY_B_min_known_fail 94 /* 0x5e Regmatch state for CURLY */
110 #define CURLY_B_min 95 /* 0x5f Regmatch state for CURLY */
111 #define CURLY_B_min_fail 96 /* 0x60 Regmatch state for CURLY */
112 #define CURLY_B_max 97 /* 0x61 Regmatch state for CURLY */
113 #define CURLY_B_max_fail 98 /* 0x62 Regmatch state for CURLY */
115 /* PL_regkind[] What type of regop or state is this. */
118 EXTCONST U8 PL_regkind[];
120 EXTCONST U8 PL_regkind[] = {
133 NBOUND, /* NBOUNDL */
135 REG_ANY, /* REG_ANY */
142 NALNUM, /* NALNUML */
146 NSPACE, /* NSPACEL */
150 NDIGIT, /* NDIGITL */
157 NOTHING, /* NOTHING */
171 BRANCHJ, /* IFMATCH */
172 BRANCHJ, /* UNLESSM */
173 BRANCHJ, /* SUSPEND */
174 BRANCHJ, /* IFTHEN */
176 LONGJMP, /* LONGJMP */
177 BRANCHJ, /* BRANCHJ */
180 LOGICAL, /* LOGICAL */
184 TRIE, /* AHOCORASICK */
185 TRIE, /* AHOCORASICKC */
186 RECURSE, /* RECURSE */
187 RECURSE, /* SRECURSE */
188 NOTHING, /* OPTIMIZED */
190 /* ------------ States ------------- */
191 TRIE, /* TRIE_next */
192 TRIE, /* TRIE_next_fail */
194 EVAL, /* EVAL_AB_fail */
195 CURLYX, /* CURLYX_end */
196 CURLYX, /* CURLYX_end_fail */
197 WHILEM, /* WHILEM_A_pre */
198 WHILEM, /* WHILEM_A_pre_fail */
199 WHILEM, /* WHILEM_A_min */
200 WHILEM, /* WHILEM_A_min_fail */
201 WHILEM, /* WHILEM_A_max */
202 WHILEM, /* WHILEM_A_max_fail */
203 WHILEM, /* WHILEM_B_min */
204 WHILEM, /* WHILEM_B_min_fail */
205 WHILEM, /* WHILEM_B_max */
206 WHILEM, /* WHILEM_B_max_fail */
207 BRANCH, /* BRANCH_next */
208 BRANCH, /* BRANCH_next_fail */
209 CURLYM, /* CURLYM_A */
210 CURLYM, /* CURLYM_A_fail */
211 CURLYM, /* CURLYM_B */
212 CURLYM, /* CURLYM_B_fail */
213 IFMATCH, /* IFMATCH_A */
214 IFMATCH, /* IFMATCH_A_fail */
215 CURLY, /* CURLY_B_min_known */
216 CURLY, /* CURLY_B_min_known_fail */
217 CURLY, /* CURLY_B_min */
218 CURLY, /* CURLY_B_min_fail */
219 CURLY, /* CURLY_B_max */
220 CURLY, /* CURLY_B_max_fail */
224 /* regarglen[] - How large is the argument part of the node (in regnodes) */
227 static const U8 regarglen[] = {
268 EXTRA_SIZE(struct regnode_2), /* CURLY */
269 EXTRA_SIZE(struct regnode_2), /* CURLYN */
270 EXTRA_SIZE(struct regnode_2), /* CURLYM */
271 EXTRA_SIZE(struct regnode_2), /* CURLYX */
273 EXTRA_SIZE(struct regnode_1), /* OPEN */
274 EXTRA_SIZE(struct regnode_1), /* CLOSE */
275 EXTRA_SIZE(struct regnode_1), /* REF */
276 EXTRA_SIZE(struct regnode_1), /* REFF */
277 EXTRA_SIZE(struct regnode_1), /* REFFL */
278 EXTRA_SIZE(struct regnode_1), /* IFMATCH */
279 EXTRA_SIZE(struct regnode_1), /* UNLESSM */
280 EXTRA_SIZE(struct regnode_1), /* SUSPEND */
281 EXTRA_SIZE(struct regnode_1), /* IFTHEN */
282 EXTRA_SIZE(struct regnode_1), /* GROUPP */
283 EXTRA_SIZE(struct regnode_1), /* LONGJMP */
284 EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
285 EXTRA_SIZE(struct regnode_1), /* EVAL */
288 EXTRA_SIZE(struct regnode_1), /* RENUM */
289 EXTRA_SIZE(struct regnode_1), /* TRIE */
290 EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
291 EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
292 EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
293 EXTRA_SIZE(struct regnode_2L), /* RECURSE */
299 /* reg_off_by_arg[] - Which argument holds the offset to the next node */
301 static const char reg_off_by_arg[] = {
366 0, /* AHOCORASICKC */
373 /* reg_name[] - Opcode/state names in string form, for debugging */
376 const char * reg_name[] = {
378 "SUCCEED", /* 0x01 */
389 "NBOUNDL", /* 0x0c */
391 "REG_ANY", /* 0x0e */
398 "NALNUML", /* 0x15 */
402 "NSPACEL", /* 0x19 */
406 "NDIGITL", /* 0x1d */
412 "EXACTFL", /* 0x23 */
413 "NOTHING", /* 0x24 */
427 "IFMATCH", /* 0x32 */
428 "UNLESSM", /* 0x33 */
429 "SUSPEND", /* 0x34 */
432 "LONGJMP", /* 0x37 */
433 "BRANCHJ", /* 0x38 */
436 "LOGICAL", /* 0x3b */
440 "AHOCORASICK", /* 0x3f */
441 "AHOCORASICKC", /* 0x40 */
442 "RECURSE", /* 0x41 */
443 "SRECURSE", /* 0x42 */
444 "OPTIMIZED", /* 0x43 */
446 /* ------------ States ------------- */
447 "TRIE_next", /* 0x45 */
448 "TRIE_next_fail", /* 0x46 */
449 "EVAL_AB", /* 0x47 */
450 "EVAL_AB_fail", /* 0x48 */
451 "CURLYX_end", /* 0x49 */
452 "CURLYX_end_fail", /* 0x4a */
453 "WHILEM_A_pre", /* 0x4b */
454 "WHILEM_A_pre_fail", /* 0x4c */
455 "WHILEM_A_min", /* 0x4d */
456 "WHILEM_A_min_fail", /* 0x4e */
457 "WHILEM_A_max", /* 0x4f */
458 "WHILEM_A_max_fail", /* 0x50 */
459 "WHILEM_B_min", /* 0x51 */
460 "WHILEM_B_min_fail", /* 0x52 */
461 "WHILEM_B_max", /* 0x53 */
462 "WHILEM_B_max_fail", /* 0x54 */
463 "BRANCH_next", /* 0x55 */
464 "BRANCH_next_fail", /* 0x56 */
465 "CURLYM_A", /* 0x57 */
466 "CURLYM_A_fail", /* 0x58 */
467 "CURLYM_B", /* 0x59 */
468 "CURLYM_B_fail", /* 0x5a */
469 "IFMATCH_A", /* 0x5b */
470 "IFMATCH_A_fail", /* 0x5c */
471 "CURLY_B_min_known", /* 0x5d */
472 "CURLY_B_min_known_fail", /* 0x5e */
473 "CURLY_B_min", /* 0x5f */
474 "CURLY_B_min_fail", /* 0x60 */
475 "CURLY_B_max", /* 0x61 */
476 "CURLY_B_max_fail", /* 0x62 */
478 #endif /* DEBUGGING */
481 extern const char * reg_name[];
483 #endif /* REG_COMP_C */