forked from schacon/perl
/
regnodes.h
724 lines (703 loc) · 32.6 KB
/
regnodes.h
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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
/* -*- buffer-read-only: t -*-
!!!!!!! DO NOT EDIT THIS FILE !!!!!!!
This file is built by regen/regcomp.pl from regcomp.sym.
Any changes made here will be lost!
*/
/* Regops and State definitions */
#define REGNODE_MAX 93
#define REGMATCH_STATE_MAX 133
#define END 0 /* 0000 End of program. */
#define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
#define BOL 2 /* 0x02 Match "" at beginning of line. */
#define MBOL 3 /* 0x03 Same, assuming multiline. */
#define SBOL 4 /* 0x04 Same, assuming singleline. */
#define EOS 5 /* 0x05 Match "" at end of string. */
#define EOL 6 /* 0x06 Match "" at end of line. */
#define MEOL 7 /* 0x07 Same, assuming multiline. */
#define SEOL 8 /* 0x08 Same, assuming singleline. */
#define BOUND 9 /* 0x09 Match "" at any word boundary */
#define BOUNDL 10 /* 0x0a Match "" at any word boundary */
#define NBOUND 11 /* 0x0b Match "" at any word non-boundary */
#define NBOUNDL 12 /* 0x0c Match "" at any word non-boundary */
#define GPOS 13 /* 0x0d Matches where last m//g left off. */
#define REG_ANY 14 /* 0x0e Match any one character (except newline). */
#define SANY 15 /* 0x0f Match any one character. */
#define CANY 16 /* 0x10 Match any one byte. */
#define ANYOF 17 /* 0x11 Match character in (or not in) this class, folding is native charset for non-utf8. */
#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 extended grapheme cluster 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, native charset semantics for non-utf8 (prec. by length). */
#define EXACTFL 35 /* 0x23 Match this string, folded in locale (w/len). */
#define EXACTFU 36 /* 0x24 Match this string, folded, Unicode semantics for non-utf8 (prec. by length). */
#define NOTHING 37 /* 0x25 Match empty string. */
#define TAIL 38 /* 0x26 Match empty string. Can jump here from outside. */
#define STAR 39 /* 0x27 Match this (simple) thing 0 or more times. */
#define PLUS 40 /* 0x28 Match this (simple) thing 1 or more times. */
#define CURLY 41 /* 0x29 Match this simple thing {n,m} times. */
#define CURLYN 42 /* 0x2a Capture next-after-this simple thing */
#define CURLYM 43 /* 0x2b Capture this medium-complex thing {n,m} times. */
#define CURLYX 44 /* 0x2c Match this complex thing {n,m} times. */
#define WHILEM 45 /* 0x2d Do curly processing and see if rest matches. */
#define OPEN 46 /* 0x2e Mark this point in input as start of */
#define CLOSE 47 /* 0x2f Analogous to OPEN. */
#define REF 48 /* 0x30 Match some already matched string */
#define REFF 49 /* 0x31 Match already matched string, folded using native charset semantics for non-utf8 */
#define REFFL 50 /* 0x32 Match already matched string, folded in loc. */
#define REFFU 51 /* 0x33 Match already matched string, folded using unicode semantics for non-utf8 */
#define NREF 52 /* 0x34 Match some already matched string */
#define NREFF 53 /* 0x35 Match already matched string, folded using native charset semantics for non-utf8 */
#define NREFFL 54 /* 0x36 Match already matched string, folded in loc. */
#define NREFFU 55 /* 0x37 Match already matched string, folded using unicode semantics for non-utf8 */
#define IFMATCH 56 /* 0x38 Succeeds if the following matches. */
#define UNLESSM 57 /* 0x39 Fails if the following matches. */
#define SUSPEND 58 /* 0x3a "Independent" sub-RE. */
#define IFTHEN 59 /* 0x3b Switch, should be preceeded by switcher . */
#define GROUPP 60 /* 0x3c Whether the group matched. */
#define LONGJMP 61 /* 0x3d Jump far away. */
#define BRANCHJ 62 /* 0x3e BRANCH with long offset. */
#define EVAL 63 /* 0x3f Execute some Perl code. */
#define MINMOD 64 /* 0x40 Next operator is not greedy. */
#define LOGICAL 65 /* 0x41 Next opcode should set the flag only. */
#define RENUM 66 /* 0x42 Group with independently numbered parens. */
#define TRIE 67 /* 0x43 Match many EXACT(F[LU]?)? at once. flags==type */
#define TRIEC 68 /* 0x44 Same as TRIE, but with embedded charclass data */
#define AHOCORASICK 69 /* 0x45 Aho Corasick stclass. flags==type */
#define AHOCORASICKC 70 /* 0x46 Same as AHOCORASICK, but with embedded charclass data */
#define GOSUB 71 /* 0x47 recurse to paren arg1 at (signed) ofs arg2 */
#define GOSTART 72 /* 0x48 recurse to start of pattern */
#define NGROUPP 73 /* 0x49 Whether the group matched. */
#define INSUBP 74 /* 0x4a Whether we are in a specific recurse. */
#define DEFINEP 75 /* 0x4b Never execute directly. */
#define ENDLIKE 76 /* 0x4c Used only for the type field of verbs */
#define OPFAIL 77 /* 0x4d Same as (?!) */
#define ACCEPT 78 /* 0x4e Accepts the current matched string. */
#define VERB 79 /* 0x4f Used only for the type field of verbs */
#define PRUNE 80 /* 0x50 Pattern fails at this startpoint if no-backtracking through this */
#define MARKPOINT 81 /* 0x51 Push the current location for rollback by cut. */
#define SKIP 82 /* 0x52 On failure skip forward (to the mark) before retrying */
#define COMMIT 83 /* 0x53 Pattern fails outright if backtracking through this */
#define CUTGROUP 84 /* 0x54 On failure go to the next alternation in the group */
#define KEEPS 85 /* 0x55 $& begins here. */
#define LNBREAK 86 /* 0x56 generic newline pattern */
#define VERTWS 87 /* 0x57 vertical whitespace (Perl 6) */
#define NVERTWS 88 /* 0x58 not vertical whitespace (Perl 6) */
#define HORIZWS 89 /* 0x59 horizontal whitespace (Perl 6) */
#define NHORIZWS 90 /* 0x5a not horizontal whitespace (Perl 6) */
#define FOLDCHAR 91 /* 0x5b codepoint with tricky case folding properties. */
#define OPTIMIZED 92 /* 0x5c Placeholder for dump. */
#define PSEUDO 93 /* 0x5d Pseudo opcode for internal use. */
/* ------------ States ------------- */
#define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */
#define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */
#define EVAL_AB (REGNODE_MAX + 3) /* state for EVAL */
#define EVAL_AB_fail (REGNODE_MAX + 4) /* state for EVAL */
#define CURLYX_end (REGNODE_MAX + 5) /* state for CURLYX */
#define CURLYX_end_fail (REGNODE_MAX + 6) /* state for CURLYX */
#define WHILEM_A_pre (REGNODE_MAX + 7) /* state for WHILEM */
#define WHILEM_A_pre_fail (REGNODE_MAX + 8) /* state for WHILEM */
#define WHILEM_A_min (REGNODE_MAX + 9) /* state for WHILEM */
#define WHILEM_A_min_fail (REGNODE_MAX + 10) /* state for WHILEM */
#define WHILEM_A_max (REGNODE_MAX + 11) /* state for WHILEM */
#define WHILEM_A_max_fail (REGNODE_MAX + 12) /* state for WHILEM */
#define WHILEM_B_min (REGNODE_MAX + 13) /* state for WHILEM */
#define WHILEM_B_min_fail (REGNODE_MAX + 14) /* state for WHILEM */
#define WHILEM_B_max (REGNODE_MAX + 15) /* state for WHILEM */
#define WHILEM_B_max_fail (REGNODE_MAX + 16) /* state for WHILEM */
#define BRANCH_next (REGNODE_MAX + 17) /* state for BRANCH */
#define BRANCH_next_fail (REGNODE_MAX + 18) /* state for BRANCH */
#define CURLYM_A (REGNODE_MAX + 19) /* state for CURLYM */
#define CURLYM_A_fail (REGNODE_MAX + 20) /* state for CURLYM */
#define CURLYM_B (REGNODE_MAX + 21) /* state for CURLYM */
#define CURLYM_B_fail (REGNODE_MAX + 22) /* state for CURLYM */
#define IFMATCH_A (REGNODE_MAX + 23) /* state for IFMATCH */
#define IFMATCH_A_fail (REGNODE_MAX + 24) /* state for IFMATCH */
#define CURLY_B_min_known (REGNODE_MAX + 25) /* state for CURLY */
#define CURLY_B_min_known_fail (REGNODE_MAX + 26) /* state for CURLY */
#define CURLY_B_min (REGNODE_MAX + 27) /* state for CURLY */
#define CURLY_B_min_fail (REGNODE_MAX + 28) /* state for CURLY */
#define CURLY_B_max (REGNODE_MAX + 29) /* state for CURLY */
#define CURLY_B_max_fail (REGNODE_MAX + 30) /* state for CURLY */
#define COMMIT_next (REGNODE_MAX + 31) /* state for COMMIT */
#define COMMIT_next_fail (REGNODE_MAX + 32) /* state for COMMIT */
#define MARKPOINT_next (REGNODE_MAX + 33) /* state for MARKPOINT */
#define MARKPOINT_next_fail (REGNODE_MAX + 34) /* state for MARKPOINT */
#define SKIP_next (REGNODE_MAX + 35) /* state for SKIP */
#define SKIP_next_fail (REGNODE_MAX + 36) /* state for SKIP */
#define CUTGROUP_next (REGNODE_MAX + 37) /* state for CUTGROUP */
#define CUTGROUP_next_fail (REGNODE_MAX + 38) /* state for CUTGROUP */
#define KEEPS_next (REGNODE_MAX + 39) /* state for KEEPS */
#define KEEPS_next_fail (REGNODE_MAX + 40) /* state for KEEPS */
/* PL_regkind[] What type of regop or state is this. */
#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 */
EXACT, /* EXACTFU */
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 */
REF, /* REFFU */
REF, /* NREF */
REF, /* NREFF */
REF, /* NREFFL */
REF, /* NREFFU */
BRANCHJ, /* IFMATCH */
BRANCHJ, /* UNLESSM */
BRANCHJ, /* SUSPEND */
BRANCHJ, /* IFTHEN */
GROUPP, /* GROUPP */
LONGJMP, /* LONGJMP */
BRANCHJ, /* BRANCHJ */
EVAL, /* EVAL */
MINMOD, /* MINMOD */
LOGICAL, /* LOGICAL */
BRANCHJ, /* RENUM */
TRIE, /* TRIE */
TRIE, /* TRIEC */
TRIE, /* AHOCORASICK */
TRIE, /* AHOCORASICKC */
GOSUB, /* GOSUB */
GOSTART, /* GOSTART */
NGROUPP, /* NGROUPP */
INSUBP, /* INSUBP */
DEFINEP, /* DEFINEP */
ENDLIKE, /* ENDLIKE */
ENDLIKE, /* OPFAIL */
ENDLIKE, /* ACCEPT */
VERB, /* VERB */
VERB, /* PRUNE */
VERB, /* MARKPOINT */
VERB, /* SKIP */
VERB, /* COMMIT */
VERB, /* CUTGROUP */
KEEPS, /* KEEPS */
LNBREAK, /* LNBREAK */
VERTWS, /* VERTWS */
NVERTWS, /* NVERTWS */
HORIZWS, /* HORIZWS */
NHORIZWS, /* NHORIZWS */
FOLDCHAR, /* FOLDCHAR */
NOTHING, /* OPTIMIZED */
PSEUDO, /* PSEUDO */
/* ------------ States ------------- */
TRIE, /* TRIE_next */
TRIE, /* TRIE_next_fail */
EVAL, /* EVAL_AB */
EVAL, /* EVAL_AB_fail */
CURLYX, /* CURLYX_end */
CURLYX, /* CURLYX_end_fail */
WHILEM, /* WHILEM_A_pre */
WHILEM, /* WHILEM_A_pre_fail */
WHILEM, /* WHILEM_A_min */
WHILEM, /* WHILEM_A_min_fail */
WHILEM, /* WHILEM_A_max */
WHILEM, /* WHILEM_A_max_fail */
WHILEM, /* WHILEM_B_min */
WHILEM, /* WHILEM_B_min_fail */
WHILEM, /* WHILEM_B_max */
WHILEM, /* WHILEM_B_max_fail */
BRANCH, /* BRANCH_next */
BRANCH, /* BRANCH_next_fail */
CURLYM, /* CURLYM_A */
CURLYM, /* CURLYM_A_fail */
CURLYM, /* CURLYM_B */
CURLYM, /* CURLYM_B_fail */
IFMATCH, /* IFMATCH_A */
IFMATCH, /* IFMATCH_A_fail */
CURLY, /* CURLY_B_min_known */
CURLY, /* CURLY_B_min_known_fail */
CURLY, /* CURLY_B_min */
CURLY, /* CURLY_B_min_fail */
CURLY, /* CURLY_B_max */
CURLY, /* CURLY_B_max_fail */
COMMIT, /* COMMIT_next */
COMMIT, /* COMMIT_next_fail */
MARKPOINT, /* MARKPOINT_next */
MARKPOINT, /* MARKPOINT_next_fail */
SKIP, /* SKIP_next */
SKIP, /* SKIP_next_fail */
CUTGROUP, /* CUTGROUP_next */
CUTGROUP, /* CUTGROUP_next_fail */
KEEPS, /* KEEPS_next */
KEEPS, /* KEEPS_next_fail */
};
#endif
/* regarglen[] - How large is the argument part of the node (in regnodes) */
#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 */
0, /* EXACTFU */
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), /* REFFU */
EXTRA_SIZE(struct regnode_1), /* NREF */
EXTRA_SIZE(struct regnode_1), /* NREFF */
EXTRA_SIZE(struct regnode_1), /* NREFFL */
EXTRA_SIZE(struct regnode_1), /* NREFFU */
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 */
EXTRA_SIZE(struct regnode_1), /* TRIE */
EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
EXTRA_SIZE(struct regnode_2L), /* GOSUB */
0, /* GOSTART */
EXTRA_SIZE(struct regnode_1), /* NGROUPP */
EXTRA_SIZE(struct regnode_1), /* INSUBP */
EXTRA_SIZE(struct regnode_1), /* DEFINEP */
0, /* ENDLIKE */
0, /* OPFAIL */
EXTRA_SIZE(struct regnode_1), /* ACCEPT */
EXTRA_SIZE(struct regnode_1), /* VERB */
EXTRA_SIZE(struct regnode_1), /* PRUNE */
EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
EXTRA_SIZE(struct regnode_1), /* SKIP */
EXTRA_SIZE(struct regnode_1), /* COMMIT */
EXTRA_SIZE(struct regnode_1), /* CUTGROUP */
0, /* KEEPS */
0, /* LNBREAK */
0, /* VERTWS */
0, /* NVERTWS */
0, /* HORIZWS */
0, /* NHORIZWS */
EXTRA_SIZE(struct regnode_1), /* FOLDCHAR */
0, /* OPTIMIZED */
0, /* PSEUDO */
};
/* reg_off_by_arg[] - Which argument holds the offset to the next node */
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, /* EXACTFU */
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 */
0, /* REFFU */
0, /* NREF */
0, /* NREFF */
0, /* NREFFL */
0, /* NREFFU */
2, /* IFMATCH */
2, /* UNLESSM */
1, /* SUSPEND */
1, /* IFTHEN */
0, /* GROUPP */
1, /* LONGJMP */
1, /* BRANCHJ */
0, /* EVAL */
0, /* MINMOD */
0, /* LOGICAL */
1, /* RENUM */
0, /* TRIE */
0, /* TRIEC */
0, /* AHOCORASICK */
0, /* AHOCORASICKC */
0, /* GOSUB */
0, /* GOSTART */
0, /* NGROUPP */
0, /* INSUBP */
0, /* DEFINEP */
0, /* ENDLIKE */
0, /* OPFAIL */
0, /* ACCEPT */
0, /* VERB */
0, /* PRUNE */
0, /* MARKPOINT */
0, /* SKIP */
0, /* COMMIT */
0, /* CUTGROUP */
0, /* KEEPS */
0, /* LNBREAK */
0, /* VERTWS */
0, /* NVERTWS */
0, /* HORIZWS */
0, /* NHORIZWS */
0, /* FOLDCHAR */
0, /* OPTIMIZED */
0, /* PSEUDO */
};
#endif /* REG_COMP_C */
/* reg_name[] - Opcode/state names in string form, for debugging */
#ifndef DOINIT
EXTCONST char * PL_reg_name[];
#else
EXTCONST char * const PL_reg_name[] = {
"END", /* 0000 */
"SUCCEED", /* 0x01 */
"BOL", /* 0x02 */
"MBOL", /* 0x03 */
"SBOL", /* 0x04 */
"EOS", /* 0x05 */
"EOL", /* 0x06 */
"MEOL", /* 0x07 */
"SEOL", /* 0x08 */
"BOUND", /* 0x09 */
"BOUNDL", /* 0x0a */
"NBOUND", /* 0x0b */
"NBOUNDL", /* 0x0c */
"GPOS", /* 0x0d */
"REG_ANY", /* 0x0e */
"SANY", /* 0x0f */
"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 */
"EXACTFU", /* 0x24 */
"NOTHING", /* 0x25 */
"TAIL", /* 0x26 */
"STAR", /* 0x27 */
"PLUS", /* 0x28 */
"CURLY", /* 0x29 */
"CURLYN", /* 0x2a */
"CURLYM", /* 0x2b */
"CURLYX", /* 0x2c */
"WHILEM", /* 0x2d */
"OPEN", /* 0x2e */
"CLOSE", /* 0x2f */
"REF", /* 0x30 */
"REFF", /* 0x31 */
"REFFL", /* 0x32 */
"REFFU", /* 0x33 */
"NREF", /* 0x34 */
"NREFF", /* 0x35 */
"NREFFL", /* 0x36 */
"NREFFU", /* 0x37 */
"IFMATCH", /* 0x38 */
"UNLESSM", /* 0x39 */
"SUSPEND", /* 0x3a */
"IFTHEN", /* 0x3b */
"GROUPP", /* 0x3c */
"LONGJMP", /* 0x3d */
"BRANCHJ", /* 0x3e */
"EVAL", /* 0x3f */
"MINMOD", /* 0x40 */
"LOGICAL", /* 0x41 */
"RENUM", /* 0x42 */
"TRIE", /* 0x43 */
"TRIEC", /* 0x44 */
"AHOCORASICK", /* 0x45 */
"AHOCORASICKC", /* 0x46 */
"GOSUB", /* 0x47 */
"GOSTART", /* 0x48 */
"NGROUPP", /* 0x49 */
"INSUBP", /* 0x4a */
"DEFINEP", /* 0x4b */
"ENDLIKE", /* 0x4c */
"OPFAIL", /* 0x4d */
"ACCEPT", /* 0x4e */
"VERB", /* 0x4f */
"PRUNE", /* 0x50 */
"MARKPOINT", /* 0x51 */
"SKIP", /* 0x52 */
"COMMIT", /* 0x53 */
"CUTGROUP", /* 0x54 */
"KEEPS", /* 0x55 */
"LNBREAK", /* 0x56 */
"VERTWS", /* 0x57 */
"NVERTWS", /* 0x58 */
"HORIZWS", /* 0x59 */
"NHORIZWS", /* 0x5a */
"FOLDCHAR", /* 0x5b */
"OPTIMIZED", /* 0x5c */
"PSEUDO", /* 0x5d */
/* ------------ States ------------- */
"TRIE_next", /* REGNODE_MAX +0x01 */
"TRIE_next_fail", /* REGNODE_MAX +0x02 */
"EVAL_AB", /* REGNODE_MAX +0x03 */
"EVAL_AB_fail", /* REGNODE_MAX +0x04 */
"CURLYX_end", /* REGNODE_MAX +0x05 */
"CURLYX_end_fail", /* REGNODE_MAX +0x06 */
"WHILEM_A_pre", /* REGNODE_MAX +0x07 */
"WHILEM_A_pre_fail", /* REGNODE_MAX +0x08 */
"WHILEM_A_min", /* REGNODE_MAX +0x09 */
"WHILEM_A_min_fail", /* REGNODE_MAX +0x0a */
"WHILEM_A_max", /* REGNODE_MAX +0x0b */
"WHILEM_A_max_fail", /* REGNODE_MAX +0x0c */
"WHILEM_B_min", /* REGNODE_MAX +0x0d */
"WHILEM_B_min_fail", /* REGNODE_MAX +0x0e */
"WHILEM_B_max", /* REGNODE_MAX +0x0f */
"WHILEM_B_max_fail", /* REGNODE_MAX +0x10 */
"BRANCH_next", /* REGNODE_MAX +0x11 */
"BRANCH_next_fail", /* REGNODE_MAX +0x12 */
"CURLYM_A", /* REGNODE_MAX +0x13 */
"CURLYM_A_fail", /* REGNODE_MAX +0x14 */
"CURLYM_B", /* REGNODE_MAX +0x15 */
"CURLYM_B_fail", /* REGNODE_MAX +0x16 */
"IFMATCH_A", /* REGNODE_MAX +0x17 */
"IFMATCH_A_fail", /* REGNODE_MAX +0x18 */
"CURLY_B_min_known", /* REGNODE_MAX +0x19 */
"CURLY_B_min_known_fail", /* REGNODE_MAX +0x1a */
"CURLY_B_min", /* REGNODE_MAX +0x1b */
"CURLY_B_min_fail", /* REGNODE_MAX +0x1c */
"CURLY_B_max", /* REGNODE_MAX +0x1d */
"CURLY_B_max_fail", /* REGNODE_MAX +0x1e */
"COMMIT_next", /* REGNODE_MAX +0x1f */
"COMMIT_next_fail", /* REGNODE_MAX +0x20 */
"MARKPOINT_next", /* REGNODE_MAX +0x21 */
"MARKPOINT_next_fail", /* REGNODE_MAX +0x22 */
"SKIP_next", /* REGNODE_MAX +0x23 */
"SKIP_next_fail", /* REGNODE_MAX +0x24 */
"CUTGROUP_next", /* REGNODE_MAX +0x25 */
"CUTGROUP_next_fail", /* REGNODE_MAX +0x26 */
"KEEPS_next", /* REGNODE_MAX +0x27 */
"KEEPS_next_fail", /* REGNODE_MAX +0x28 */
};
#endif /* DOINIT */
/* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
#ifndef DOINIT
EXTCONST char * PL_reg_extflags_name[];
#else
EXTCONST char * const PL_reg_extflags_name[] = {
/* Bits in extflags defined: 11111111111111111111111001111111 */
"MULTILINE", /* 0x00000001 */
"SINGLELINE", /* 0x00000002 */
"FOLD", /* 0x00000004 */
"EXTENDED", /* 0x00000008 */
"KEEPCOPY", /* 0x00000010 */
"LOCALE", /* 0x00000020 */
"UNICODE", /* 0x00000040 */
"UNUSED_BIT_7", /* 0x00000080 */
"UNUSED_BIT_8", /* 0x00000100 */
"ANCH_BOL", /* 0x00000200 */
"ANCH_MBOL", /* 0x00000400 */
"ANCH_SBOL", /* 0x00000800 */
"ANCH_GPOS", /* 0x00001000 */
"GPOS_SEEN", /* 0x00002000 */
"GPOS_FLOAT", /* 0x00004000 */
"LOOKBEHIND_SEEN", /* 0x00008000 */
"EVAL_SEEN", /* 0x00010000 */
"CANY_SEEN", /* 0x00020000 */
"NOSCAN", /* 0x00040000 */
"CHECK_ALL", /* 0x00080000 */
"MATCH_UTF8", /* 0x00100000 */
"USE_INTUIT_NOML", /* 0x00200000 */
"USE_INTUIT_ML", /* 0x00400000 */
"INTUIT_TAIL", /* 0x00800000 */
"SPLIT", /* 0x01000000 */
"COPY_DONE", /* 0x02000000 */
"TAINTED_SEEN", /* 0x04000000 */
"TAINTED", /* 0x08000000 */
"START_ONLY", /* 0x10000000 */
"SKIPWHITE", /* 0x20000000 */
"WHITE", /* 0x40000000 */
"NULL", /* 0x80000000 */
};
#endif /* DOINIT */
/* The following have no fixed length. U8 so we can do strchr() on it. */
#define REGNODE_VARIES(node) (PL_varies_bitmask[(node) >> 3] & (1 << ((node) & 7)))
#ifndef DOINIT
EXTCONST U8 PL_varies[] __attribute__deprecated__;
#else
EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX, WHILEM,
REF, REFF, REFFL, REFFU, NREF, NREFF, NREFFL, NREFFU, SUSPEND, IFTHEN,
BRANCHJ,
0
};
#endif /* DOINIT */
#ifndef DOINIT
EXTCONST U8 PL_varies_bitmask[];
#else
EXTCONST U8 PL_varies_bitmask[] = {
0x00, 0x00, 0x00, 0xC0, 0x81, 0x3F, 0xFF, 0x4C, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
/* The following always have a length of 1. U8 we can do strchr() on it. */
/* (Note that length 1 means "one character" under UTF8, not "one octet".) */
#define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7)))
#ifndef DOINIT
EXTCONST U8 PL_simple[] __attribute__deprecated__;
#else
EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, NALNUM, NALNUML, SPACE,
SPACEL, NSPACE, NSPACEL, DIGIT, DIGITL, NDIGIT, NDIGITL, VERTWS,
NVERTWS, HORIZWS, NHORIZWS,
0
};
#endif /* DOINIT */
#ifndef DOINIT
EXTCONST U8 PL_simple_bitmask[];
#else
EXTCONST U8 PL_simple_bitmask[] = {
0x00, 0xC0, 0xFF, 0x3F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x07
};
#endif /* DOINIT */
/* ex: set ro: */