1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
|
/* !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
This file is built by regcomp.pl from regcomp.sym.
Any changes made here will be lost!
*/
#define END 0 /* 0 End of program. */
#define SUCCEED 1 /* 0x1 Return from a subroutine, basically. */
#define BOL 2 /* 0x2 Match "" at beginning of line. */
#define MBOL 3 /* 0x3 Same, assuming multiline. */
#define SBOL 4 /* 0x4 Same, assuming singleline. */
#define EOS 5 /* 0x5 Match "" at end of string. */
#define EOL 6 /* 0x6 Match "" at end of line. */
#define MEOL 7 /* 0x7 Same, assuming multiline. */
#define SEOL 8 /* 0x8 Same, assuming singleline. */
#define BOUND 9 /* 0x9 Match "" at any word boundary */
#define BOUNDL 10 /* 0xa Match "" at any word boundary */
#define NBOUND 11 /* 0xb Match "" at any word non-boundary */
#define NBOUNDL 12 /* 0xc Match "" at any word non-boundary */
#define GPOS 13 /* 0xd Matches where last m//g left off. */
#define REG_ANY 14 /* 0xe Match any one character (except newline). */
#define SANY 15 /* 0xf Match any one character. */
#define CANY 16 /* 0x10 Match any one byte. */
#define ANYOF 17 /* 0x11 Match character in (or not in) this class. */
#define ALNUM 18 /* 0x12 Match any alphanumeric character */
#define ALNUML 19 /* 0x13 Match any alphanumeric char in locale */
#define NALNUM 20 /* 0x14 Match any non-alphanumeric character */
#define NALNUML 21 /* 0x15 Match any non-alphanumeric char in locale */
#define SPACE 22 /* 0x16 Match any whitespace character */
#define SPACEL 23 /* 0x17 Match any whitespace char in locale */
#define NSPACE 24 /* 0x18 Match any non-whitespace character */
#define NSPACEL 25 /* 0x19 Match any non-whitespace char in locale */
#define DIGIT 26 /* 0x1a Match any numeric character */
#define DIGITL 27 /* 0x1b Match any numeric character in locale */
#define NDIGIT 28 /* 0x1c Match any non-numeric character */
#define NDIGITL 29 /* 0x1d Match any non-numeric character in locale */
#define CLUMP 30 /* 0x1e Match any combining character sequence */
#define BRANCH 31 /* 0x1f Match this alternative, or the next... */
#define BACK 32 /* 0x20 Match "", "next" ptr points backward. */
#define EXACT 33 /* 0x21 Match this string (preceded by length). */
#define EXACTF 34 /* 0x22 Match this string, folded (prec. by length). */
#define EXACTFL 35 /* 0x23 Match this string, folded in locale (w/len). */
#define TRIE 36 /* 0x24 Match one or more of many EXACT strings */
#define TRIEF 37 /* 0x25 Match one or more of many EXACTF strings */
#define TRIEFL 38 /* 0x26 Match one or more of many EXACTFL strings */
#define NOTHING 39 /* 0x27 Match empty string. */
#define TAIL 40 /* 0x28 Match empty string. Can jump here from outside. */
#define STAR 41 /* 0x29 Match this (simple) thing 0 or more times. */
#define PLUS 42 /* 0x2a Match this (simple) thing 1 or more times. */
#define CURLY 43 /* 0x2b Match this simple thing {n,m} times. */
#define CURLYN 44 /* 0x2c Match next-after-this simple thing */
#define CURLYM 45 /* 0x2d Match this medium-complex thing {n,m} times. */
#define CURLYX 46 /* 0x2e Match this complex thing {n,m} times. */
#define WHILEM 47 /* 0x2f Do curly processing and see if rest matches. */
#define OPEN 48 /* 0x30 Mark this point in input as start of #n. */
#define CLOSE 49 /* 0x31 Analogous to OPEN. */
#define REF 50 /* 0x32 Match some already matched string */
#define REFF 51 /* 0x33 Match already matched string, folded */
#define REFFL 52 /* 0x34 Match already matched string, folded in loc. */
#define IFMATCH 53 /* 0x35 Succeeds if the following matches. */
#define UNLESSM 54 /* 0x36 Fails if the following matches. */
#define SUSPEND 55 /* 0x37 "Independent" sub-RE. */
#define IFTHEN 56 /* 0x38 Switch, should be preceeded by switcher . */
#define GROUPP 57 /* 0x39 Whether the group matched. */
#define LONGJMP 58 /* 0x3a Jump far away. */
#define BRANCHJ 59 /* 0x3b BRANCH with long offset. */
#define EVAL 60 /* 0x3c Execute some Perl code. */
#define MINMOD 61 /* 0x3d Next operator is not greedy. */
#define LOGICAL 62 /* 0x3e Next opcode should set the flag only. */
#define RENUM 63 /* 0x3f Group with independently numbered parens. */
#define OPTIMIZED 64 /* 0x40 Placeholder for dump. */
#ifndef DOINIT
EXTCONST U8 PL_regkind[];
#else
EXTCONST U8 PL_regkind[] = {
END, /* END */
END, /* SUCCEED */
BOL, /* BOL */
BOL, /* MBOL */
BOL, /* SBOL */
EOL, /* EOS */
EOL, /* EOL */
EOL, /* MEOL */
EOL, /* SEOL */
BOUND, /* BOUND */
BOUND, /* BOUNDL */
NBOUND, /* NBOUND */
NBOUND, /* NBOUNDL */
GPOS, /* GPOS */
REG_ANY, /* REG_ANY */
REG_ANY, /* SANY */
REG_ANY, /* CANY */
ANYOF, /* ANYOF */
ALNUM, /* ALNUM */
ALNUM, /* ALNUML */
NALNUM, /* NALNUM */
NALNUM, /* NALNUML */
SPACE, /* SPACE */
SPACE, /* SPACEL */
NSPACE, /* NSPACE */
NSPACE, /* NSPACEL */
DIGIT, /* DIGIT */
DIGIT, /* DIGITL */
NDIGIT, /* NDIGIT */
NDIGIT, /* NDIGITL */
CLUMP, /* CLUMP */
BRANCH, /* BRANCH */
BACK, /* BACK */
EXACT, /* EXACT */
EXACT, /* EXACTF */
EXACT, /* EXACTFL */
TRIE, /* TRIE */
TRIE, /* TRIEF */
TRIE, /* TRIEFL */
NOTHING, /* NOTHING */
NOTHING, /* TAIL */
STAR, /* STAR */
PLUS, /* PLUS */
CURLY, /* CURLY */
CURLY, /* CURLYN */
CURLY, /* CURLYM */
CURLY, /* CURLYX */
WHILEM, /* WHILEM */
OPEN, /* OPEN */
CLOSE, /* CLOSE */
REF, /* REF */
REF, /* REFF */
REF, /* REFFL */
BRANCHJ, /* IFMATCH */
BRANCHJ, /* UNLESSM */
BRANCHJ, /* SUSPEND */
BRANCHJ, /* IFTHEN */
GROUPP, /* GROUPP */
LONGJMP, /* LONGJMP */
BRANCHJ, /* BRANCHJ */
EVAL, /* EVAL */
MINMOD, /* MINMOD */
LOGICAL, /* LOGICAL */
BRANCHJ, /* RENUM */
NOTHING, /* OPTIMIZED */
};
#endif
#ifdef REG_COMP_C
static const U8 regarglen[] = {
0, /* END */
0, /* SUCCEED */
0, /* BOL */
0, /* MBOL */
0, /* SBOL */
0, /* EOS */
0, /* EOL */
0, /* MEOL */
0, /* SEOL */
0, /* BOUND */
0, /* BOUNDL */
0, /* NBOUND */
0, /* NBOUNDL */
0, /* GPOS */
0, /* REG_ANY */
0, /* SANY */
0, /* CANY */
0, /* ANYOF */
0, /* ALNUM */
0, /* ALNUML */
0, /* NALNUM */
0, /* NALNUML */
0, /* SPACE */
0, /* SPACEL */
0, /* NSPACE */
0, /* NSPACEL */
0, /* DIGIT */
0, /* DIGITL */
0, /* NDIGIT */
0, /* NDIGITL */
0, /* CLUMP */
0, /* BRANCH */
0, /* BACK */
0, /* EXACT */
0, /* EXACTF */
0, /* EXACTFL */
EXTRA_SIZE(struct regnode_1), /* TRIE */
EXTRA_SIZE(struct regnode_1), /* TRIEF */
EXTRA_SIZE(struct regnode_1), /* TRIEFL */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
0, /* PLUS */
EXTRA_SIZE(struct regnode_2), /* CURLY */
EXTRA_SIZE(struct regnode_2), /* CURLYN */
EXTRA_SIZE(struct regnode_2), /* CURLYM */
EXTRA_SIZE(struct regnode_2), /* CURLYX */
0, /* WHILEM */
EXTRA_SIZE(struct regnode_1), /* OPEN */
EXTRA_SIZE(struct regnode_1), /* CLOSE */
EXTRA_SIZE(struct regnode_1), /* REF */
EXTRA_SIZE(struct regnode_1), /* REFF */
EXTRA_SIZE(struct regnode_1), /* REFFL */
EXTRA_SIZE(struct regnode_1), /* IFMATCH */
EXTRA_SIZE(struct regnode_1), /* UNLESSM */
EXTRA_SIZE(struct regnode_1), /* SUSPEND */
EXTRA_SIZE(struct regnode_1), /* IFTHEN */
EXTRA_SIZE(struct regnode_1), /* GROUPP */
EXTRA_SIZE(struct regnode_1), /* LONGJMP */
EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
EXTRA_SIZE(struct regnode_1), /* EVAL */
0, /* MINMOD */
0, /* LOGICAL */
EXTRA_SIZE(struct regnode_1), /* RENUM */
0, /* OPTIMIZED */
};
static const char reg_off_by_arg[] = {
0, /* END */
0, /* SUCCEED */
0, /* BOL */
0, /* MBOL */
0, /* SBOL */
0, /* EOS */
0, /* EOL */
0, /* MEOL */
0, /* SEOL */
0, /* BOUND */
0, /* BOUNDL */
0, /* NBOUND */
0, /* NBOUNDL */
0, /* GPOS */
0, /* REG_ANY */
0, /* SANY */
0, /* CANY */
0, /* ANYOF */
0, /* ALNUM */
0, /* ALNUML */
0, /* NALNUM */
0, /* NALNUML */
0, /* SPACE */
0, /* SPACEL */
0, /* NSPACE */
0, /* NSPACEL */
0, /* DIGIT */
0, /* DIGITL */
0, /* NDIGIT */
0, /* NDIGITL */
0, /* CLUMP */
0, /* BRANCH */
0, /* BACK */
0, /* EXACT */
0, /* EXACTF */
0, /* EXACTFL */
0, /* TRIE */
0, /* TRIEF */
0, /* TRIEFL */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
0, /* PLUS */
0, /* CURLY */
0, /* CURLYN */
0, /* CURLYM */
0, /* CURLYX */
0, /* WHILEM */
0, /* OPEN */
0, /* CLOSE */
0, /* REF */
0, /* REFF */
0, /* REFFL */
2, /* IFMATCH */
2, /* UNLESSM */
1, /* SUSPEND */
1, /* IFTHEN */
0, /* GROUPP */
1, /* LONGJMP */
1, /* BRANCHJ */
0, /* EVAL */
0, /* MINMOD */
0, /* LOGICAL */
1, /* RENUM */
0, /* OPTIMIZED */
};
#ifdef DEBUGGING
static const char * const reg_name[] = {
"END", /* 0 */
"SUCCEED", /* 0x1 */
"BOL", /* 0x2 */
"MBOL", /* 0x3 */
"SBOL", /* 0x4 */
"EOS", /* 0x5 */
"EOL", /* 0x6 */
"MEOL", /* 0x7 */
"SEOL", /* 0x8 */
"BOUND", /* 0x9 */
"BOUNDL", /* 0xa */
"NBOUND", /* 0xb */
"NBOUNDL", /* 0xc */
"GPOS", /* 0xd */
"REG_ANY", /* 0xe */
"SANY", /* 0xf */
"CANY", /* 0x10 */
"ANYOF", /* 0x11 */
"ALNUM", /* 0x12 */
"ALNUML", /* 0x13 */
"NALNUM", /* 0x14 */
"NALNUML", /* 0x15 */
"SPACE", /* 0x16 */
"SPACEL", /* 0x17 */
"NSPACE", /* 0x18 */
"NSPACEL", /* 0x19 */
"DIGIT", /* 0x1a */
"DIGITL", /* 0x1b */
"NDIGIT", /* 0x1c */
"NDIGITL", /* 0x1d */
"CLUMP", /* 0x1e */
"BRANCH", /* 0x1f */
"BACK", /* 0x20 */
"EXACT", /* 0x21 */
"EXACTF", /* 0x22 */
"EXACTFL", /* 0x23 */
"TRIE", /* 0x24 */
"TRIEF", /* 0x25 */
"TRIEFL", /* 0x26 */
"NOTHING", /* 0x27 */
"TAIL", /* 0x28 */
"STAR", /* 0x29 */
"PLUS", /* 0x2a */
"CURLY", /* 0x2b */
"CURLYN", /* 0x2c */
"CURLYM", /* 0x2d */
"CURLYX", /* 0x2e */
"WHILEM", /* 0x2f */
"OPEN", /* 0x30 */
"CLOSE", /* 0x31 */
"REF", /* 0x32 */
"REFF", /* 0x33 */
"REFFL", /* 0x34 */
"IFMATCH", /* 0x35 */
"UNLESSM", /* 0x36 */
"SUSPEND", /* 0x37 */
"IFTHEN", /* 0x38 */
"GROUPP", /* 0x39 */
"LONGJMP", /* 0x3a */
"BRANCHJ", /* 0x3b */
"EVAL", /* 0x3c */
"MINMOD", /* 0x3d */
"LOGICAL", /* 0x3e */
"RENUM", /* 0x3f */
"OPTIMIZED", /* 0x40 */
};
static const int reg_num = 65;
#endif /* DEBUGGING */
#endif /* REG_COMP_C */
|
