/* -*- buffer-read-only: t -*-
!!!!!!! DO NOT EDIT THIS FILE !!!!!!!
- This file is built by regcomp.pl from regcomp.sym.
+ 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 74
-#define REGMATCH_STATE_MAX 104
+#define REGNODE_MAX 95
+#define REGMATCH_STATE_MAX 135
#define END 0 /* 0000 End of program. */
#define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
#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. */
-#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 NOTHING 36 /* 0x24 Match empty string. */
-#define TAIL 37 /* 0x25 Match empty string. Can jump here from outside. */
-#define STAR 38 /* 0x26 Match this (simple) thing 0 or more times. */
-#define PLUS 39 /* 0x27 Match this (simple) thing 1 or more times. */
-#define CURLY 40 /* 0x28 Match this simple thing {n,m} times. */
-#define CURLYN 41 /* 0x29 Match next-after-this simple thing */
-#define CURLYM 42 /* 0x2a Match this medium-complex thing {n,m} times. */
-#define CURLYX 43 /* 0x2b Match this complex thing {n,m} times. */
-#define WHILEM 44 /* 0x2c Do curly processing and see if rest matches. */
-#define OPEN 45 /* 0x2d Mark this point in input as start of */
-#define CLOSE 46 /* 0x2e Analogous to OPEN. */
-#define REF 47 /* 0x2f Match some already matched string */
-#define REFF 48 /* 0x30 Match already matched string, folded */
-#define REFFL 49 /* 0x31 Match already matched string, folded in loc. */
-#define IFMATCH 50 /* 0x32 Succeeds if the following matches. */
-#define UNLESSM 51 /* 0x33 Fails if the following matches. */
-#define SUSPEND 52 /* 0x34 "Independent" sub-RE. */
-#define IFTHEN 53 /* 0x35 Switch, should be preceeded by switcher . */
-#define GROUPP 54 /* 0x36 Whether the group matched. */
-#define LONGJMP 55 /* 0x37 Jump far away. */
-#define BRANCHJ 56 /* 0x38 BRANCH with long offset. */
-#define EVAL 57 /* 0x39 Execute some Perl code. */
-#define MINMOD 58 /* 0x3a Next operator is not greedy. */
-#define LOGICAL 59 /* 0x3b Next opcode should set the flag only. */
-#define RENUM 60 /* 0x3c Group with independently numbered parens. */
-#define TRIE 61 /* 0x3d Match many EXACT(FL?)? at once. flags==type */
-#define TRIEC 62 /* 0x3e Same as TRIE, but with embedded charclass data */
-#define AHOCORASICK 63 /* 0x3f Aho Corasick stclass. flags==type */
-#define AHOCORASICKC 64 /* 0x40 Same as AHOCORASICK, but with embedded charclass data */
-#define RECURSE 65 /* 0x41 recurse to paren arg1 at (signed) ofs arg2 */
-#define SRECURSE 66 /* 0x42 recurse to start of pattern */
-#define NREF 67 /* 0x43 Match some already matched string */
-#define NREFF 68 /* 0x44 Match already matched string, folded */
-#define NREFFL 69 /* 0x45 Match already matched string, folded in loc. */
-#define NGROUPP 70 /* 0x46 Whether the group matched. */
-#define RECURSEP 71 /* 0x47 Whether we are in a specific recurse. */
-#define DEFINEP 72 /* 0x48 Never execute directly. */
-#define OPTIMIZED 73 /* 0x49 Placeholder for dump. */
-#define PSEUDO 74 /* 0x4a Pseudo opcode for internal use. */
-
+#define BOUND 9 /* 0x09 Match "" at any word boundary using native charset semantics for non-utf8 */
+#define BOUNDL 10 /* 0x0a Match "" at any locale word boundary */
+#define BOUNDU 11 /* 0x0b Match "" at any word boundary using Unicode semantics */
+#define BOUNDA 12 /* 0x0c Match "" at any word boundary using ASCII semantics */
+#define NBOUND 13 /* 0x0d Match "" at any word non-boundary using native charset semantics for non-utf8 */
+#define NBOUNDL 14 /* 0x0e Match "" at any locale word non-boundary */
+#define NBOUNDU 15 /* 0x0f Match "" at any word non-boundary using Unicode semantics */
+#define NBOUNDA 16 /* 0x10 Match "" at any word non-boundary using ASCII semantics */
+#define GPOS 17 /* 0x11 Matches where last m//g left off. */
+#define REG_ANY 18 /* 0x12 Match any one character (except newline). */
+#define SANY 19 /* 0x13 Match any one character. */
+#define CANY 20 /* 0x14 Match any one byte. */
+#define ANYOF 21 /* 0x15 Match character in (or not in) this class, single char match only */
+#define ANYOF_WARN_SUPER 22 /* 0x16 Match character in (or not in) this class, warn (if enabled) upon matching a char above Unicode max; */
+#define ANYOF_SYNTHETIC 23 /* 0x17 Synthetic start class */
+#define POSIXD 24 /* 0x18 Some [[:class:]] under /d; the FLAGS field gives which one */
+#define POSIXL 25 /* 0x19 Some [[:class:]] under /l; the FLAGS field gives which one */
+#define POSIXU 26 /* 0x1a Some [[:class:]] under /u; the FLAGS field gives which one */
+#define POSIXA 27 /* 0x1b Some [[:class:]] under /a; the FLAGS field gives which one */
+#define NPOSIXD 28 /* 0x1c complement of POSIXD, [[:^class:]] */
+#define NPOSIXL 29 /* 0x1d complement of POSIXL, [[:^class:]] */
+#define NPOSIXU 30 /* 0x1e complement of POSIXU, [[:^class:]] */
+#define NPOSIXA 31 /* 0x1f complement of POSIXA, [[:^class:]] */
+#define CLUMP 32 /* 0x20 Match any extended grapheme cluster sequence */
+#define BRANCH 33 /* 0x21 Match this alternative, or the next... */
+#define BACK 34 /* 0x22 Match "", "next" ptr points backward. */
+#define EXACT 35 /* 0x23 Match this string (preceded by length). */
+#define EXACTF 36 /* 0x24 Match this non-UTF-8 string (not guaranteed to be folded) using /id rules (w/len). */
+#define EXACTFL 37 /* 0x25 Match this string (not guaranteed to be folded) using /il rules (w/len). */
+#define EXACTFU 38 /* 0x26 Match this string (folded iff in UTF-8, length in folding doesn't change if not in UTF-8) using /iu rules (w/len). */
+#define EXACTFA 39 /* 0x27 Match this string (not guaranteed to be folded) using /iaa rules (w/len). */
+#define EXACTFU_SS 40 /* 0x28 Match this string (folded iff in UTF-8, length in folding may change even if not in UTF-8) using /iu rules (w/len). */
+#define EXACTFA_NO_TRIE 41 /* 0x29 Match this string (which is not trie-able; not guaranteed to be folded) using /iaa rules (w/len). */
+#define NOTHING 42 /* 0x2a Match empty string. */
+#define TAIL 43 /* 0x2b Match empty string. Can jump here from outside. */
+#define STAR 44 /* 0x2c Match this (simple) thing 0 or more times. */
+#define PLUS 45 /* 0x2d Match this (simple) thing 1 or more times. */
+#define CURLY 46 /* 0x2e Match this simple thing {n,m} times. */
+#define CURLYN 47 /* 0x2f Capture next-after-this simple thing */
+#define CURLYM 48 /* 0x30 Capture this medium-complex thing {n,m} times. */
+#define CURLYX 49 /* 0x31 Match this complex thing {n,m} times. */
+#define WHILEM 50 /* 0x32 Do curly processing and see if rest matches. */
+#define OPEN 51 /* 0x33 Mark this point in input as start of #n. */
+#define CLOSE 52 /* 0x34 Analogous to OPEN. */
+#define REF 53 /* 0x35 Match some already matched string */
+#define REFF 54 /* 0x36 Match already matched string, folded using native charset semantics for non-utf8 */
+#define REFFL 55 /* 0x37 Match already matched string, folded in loc. */
+#define REFFU 56 /* 0x38 Match already matched string, folded using unicode semantics for non-utf8 */
+#define REFFA 57 /* 0x39 Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
+#define NREF 58 /* 0x3a Match some already matched string */
+#define NREFF 59 /* 0x3b Match already matched string, folded using native charset semantics for non-utf8 */
+#define NREFFL 60 /* 0x3c Match already matched string, folded in loc. */
+#define NREFFU 61 /* 0x3d Match already matched string, folded using unicode semantics for non-utf8 */
+#define NREFFA 62 /* 0x3e Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII */
+#define IFMATCH 63 /* 0x3f Succeeds if the following matches. */
+#define UNLESSM 64 /* 0x40 Fails if the following matches. */
+#define SUSPEND 65 /* 0x41 "Independent" sub-RE. */
+#define IFTHEN 66 /* 0x42 Switch, should be preceded by switcher. */
+#define GROUPP 67 /* 0x43 Whether the group matched. */
+#define LONGJMP 68 /* 0x44 Jump far away. */
+#define BRANCHJ 69 /* 0x45 BRANCH with long offset. */
+#define EVAL 70 /* 0x46 Execute some Perl code. */
+#define MINMOD 71 /* 0x47 Next operator is not greedy. */
+#define LOGICAL 72 /* 0x48 Next opcode should set the flag only. */
+#define RENUM 73 /* 0x49 Group with independently numbered parens. */
+#define TRIE 74 /* 0x4a Match many EXACT(F[ALU]?)? at once. flags==type */
+#define TRIEC 75 /* 0x4b Same as TRIE, but with embedded charclass data */
+#define AHOCORASICK 76 /* 0x4c Aho Corasick stclass. flags==type */
+#define AHOCORASICKC 77 /* 0x4d Same as AHOCORASICK, but with embedded charclass data */
+#define GOSUB 78 /* 0x4e recurse to paren arg1 at (signed) ofs arg2 */
+#define GOSTART 79 /* 0x4f recurse to start of pattern */
+#define NGROUPP 80 /* 0x50 Whether the group matched. */
+#define INSUBP 81 /* 0x51 Whether we are in a specific recurse. */
+#define DEFINEP 82 /* 0x52 Never execute directly. */
+#define ENDLIKE 83 /* 0x53 Used only for the type field of verbs */
+#define OPFAIL 84 /* 0x54 Same as (?!) */
+#define ACCEPT 85 /* 0x55 Accepts the current matched string. */
+#define VERB 86 /* 0x56 Used only for the type field of verbs */
+#define PRUNE 87 /* 0x57 Pattern fails at this startpoint if no-backtracking through this */
+#define MARKPOINT 88 /* 0x58 Push the current location for rollback by cut. */
+#define SKIP 89 /* 0x59 On failure skip forward (to the mark) before retrying */
+#define COMMIT 90 /* 0x5a Pattern fails outright if backtracking through this */
+#define CUTGROUP 91 /* 0x5b On failure go to the next alternation in the group */
+#define KEEPS 92 /* 0x5c $& begins here. */
+#define LNBREAK 93 /* 0x5d generic newline pattern */
+#define OPTIMIZED 94 /* 0x5e Placeholder for dump. */
+#define PSEUDO 95 /* 0x5f Pseudo opcode for internal use. */
/* ------------ States ------------- */
-
-#define TRIE_next 75 /* 0x4b Regmatch state for TRIE */
-#define TRIE_next_fail 76 /* 0x4c Regmatch state for TRIE */
-#define EVAL_AB 77 /* 0x4d Regmatch state for EVAL */
-#define EVAL_AB_fail 78 /* 0x4e Regmatch state for EVAL */
-#define CURLYX_end 79 /* 0x4f Regmatch state for CURLYX */
-#define CURLYX_end_fail 80 /* 0x50 Regmatch state for CURLYX */
-#define WHILEM_A_pre 81 /* 0x51 Regmatch state for WHILEM */
-#define WHILEM_A_pre_fail 82 /* 0x52 Regmatch state for WHILEM */
-#define WHILEM_A_min 83 /* 0x53 Regmatch state for WHILEM */
-#define WHILEM_A_min_fail 84 /* 0x54 Regmatch state for WHILEM */
-#define WHILEM_A_max 85 /* 0x55 Regmatch state for WHILEM */
-#define WHILEM_A_max_fail 86 /* 0x56 Regmatch state for WHILEM */
-#define WHILEM_B_min 87 /* 0x57 Regmatch state for WHILEM */
-#define WHILEM_B_min_fail 88 /* 0x58 Regmatch state for WHILEM */
-#define WHILEM_B_max 89 /* 0x59 Regmatch state for WHILEM */
-#define WHILEM_B_max_fail 90 /* 0x5a Regmatch state for WHILEM */
-#define BRANCH_next 91 /* 0x5b Regmatch state for BRANCH */
-#define BRANCH_next_fail 92 /* 0x5c Regmatch state for BRANCH */
-#define CURLYM_A 93 /* 0x5d Regmatch state for CURLYM */
-#define CURLYM_A_fail 94 /* 0x5e Regmatch state for CURLYM */
-#define CURLYM_B 95 /* 0x5f Regmatch state for CURLYM */
-#define CURLYM_B_fail 96 /* 0x60 Regmatch state for CURLYM */
-#define IFMATCH_A 97 /* 0x61 Regmatch state for IFMATCH */
-#define IFMATCH_A_fail 98 /* 0x62 Regmatch state for IFMATCH */
-#define CURLY_B_min_known 99 /* 0x63 Regmatch state for CURLY */
-#define CURLY_B_min_known_fail 100 /* 0x64 Regmatch state for CURLY */
-#define CURLY_B_min 101 /* 0x65 Regmatch state for CURLY */
-#define CURLY_B_min_fail 102 /* 0x66 Regmatch state for CURLY */
-#define CURLY_B_max 103 /* 0x67 Regmatch state for CURLY */
-#define CURLY_B_max_fail 104 /* 0x68 Regmatch state for CURLY */
+#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. */
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 */
- 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 */
- TRIE, /* TRIE */
- TRIE, /* TRIEC */
- TRIE, /* AHOCORASICK */
- TRIE, /* AHOCORASICKC */
- RECURSE, /* RECURSE */
- RECURSE, /* SRECURSE */
- NREF, /* NREF */
- NREF, /* NREFF */
- NREF, /* NREFFL */
- NGROUPP, /* NGROUPP */
- RECURSEP, /* RECURSEP */
- DEFINEP, /* DEFINEP */
- NOTHING, /* OPTIMIZED */
- PSEUDO, /* PSEUDO */
+ END, /* END */
+ END, /* SUCCEED */
+ BOL, /* BOL */
+ BOL, /* MBOL */
+ BOL, /* SBOL */
+ EOL, /* EOS */
+ EOL, /* EOL */
+ EOL, /* MEOL */
+ EOL, /* SEOL */
+ BOUND, /* BOUND */
+ BOUND, /* BOUNDL */
+ BOUND, /* BOUNDU */
+ BOUND, /* BOUNDA */
+ NBOUND, /* NBOUND */
+ NBOUND, /* NBOUNDL */
+ NBOUND, /* NBOUNDU */
+ NBOUND, /* NBOUNDA */
+ GPOS, /* GPOS */
+ REG_ANY, /* REG_ANY */
+ REG_ANY, /* SANY */
+ REG_ANY, /* CANY */
+ ANYOF, /* ANYOF */
+ ANYOF, /* ANYOF_WARN_SUPER */
+ ANYOF, /* ANYOF_SYNTHETIC */
+ POSIXD, /* POSIXD */
+ POSIXD, /* POSIXL */
+ POSIXD, /* POSIXU */
+ POSIXD, /* POSIXA */
+ NPOSIXD, /* NPOSIXD */
+ NPOSIXD, /* NPOSIXL */
+ NPOSIXD, /* NPOSIXU */
+ NPOSIXD, /* NPOSIXA */
+ CLUMP, /* CLUMP */
+ BRANCH, /* BRANCH */
+ BACK, /* BACK */
+ EXACT, /* EXACT */
+ EXACT, /* EXACTF */
+ EXACT, /* EXACTFL */
+ EXACT, /* EXACTFU */
+ EXACT, /* EXACTFA */
+ EXACT, /* EXACTFU_SS */
+ EXACT, /* EXACTFA_NO_TRIE */
+ 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, /* REFFA */
+ REF, /* NREF */
+ REF, /* NREFF */
+ REF, /* NREFFL */
+ REF, /* NREFFU */
+ REF, /* NREFFA */
+ 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 */
+ 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 */
+ 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
0, /* SEOL */
0, /* BOUND */
0, /* BOUNDL */
+ 0, /* BOUNDU */
+ 0, /* BOUNDA */
0, /* NBOUND */
0, /* NBOUNDL */
+ 0, /* NBOUNDU */
+ 0, /* NBOUNDA */
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, /* ANYOF_WARN_SUPER */
+ 0, /* ANYOF_SYNTHETIC */
+ 0, /* POSIXD */
+ 0, /* POSIXL */
+ 0, /* POSIXU */
+ 0, /* POSIXA */
+ 0, /* NPOSIXD */
+ 0, /* NPOSIXL */
+ 0, /* NPOSIXU */
+ 0, /* NPOSIXA */
0, /* CLUMP */
0, /* BRANCH */
0, /* BACK */
0, /* EXACT */
0, /* EXACTF */
0, /* EXACTFL */
+ 0, /* EXACTFU */
+ 0, /* EXACTFA */
+ 0, /* EXACTFU_SS */
+ 0, /* EXACTFA_NO_TRIE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
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), /* REFFA */
+ 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), /* NREFFA */
EXTRA_SIZE(struct regnode_1), /* IFMATCH */
EXTRA_SIZE(struct regnode_1), /* UNLESSM */
EXTRA_SIZE(struct regnode_1), /* SUSPEND */
EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
- EXTRA_SIZE(struct regnode_2L), /* RECURSE */
- 0, /* SRECURSE */
- EXTRA_SIZE(struct regnode_1), /* NREF */
- EXTRA_SIZE(struct regnode_1), /* NREFF */
- EXTRA_SIZE(struct regnode_1), /* NREFFL */
+ EXTRA_SIZE(struct regnode_2L), /* GOSUB */
+ 0, /* GOSTART */
EXTRA_SIZE(struct regnode_1), /* NGROUPP */
- EXTRA_SIZE(struct regnode_1), /* RECURSEP */
+ 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, /* OPTIMIZED */
0, /* PSEUDO */
};
0, /* SEOL */
0, /* BOUND */
0, /* BOUNDL */
+ 0, /* BOUNDU */
+ 0, /* BOUNDA */
0, /* NBOUND */
0, /* NBOUNDL */
+ 0, /* NBOUNDU */
+ 0, /* NBOUNDA */
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, /* ANYOF_WARN_SUPER */
+ 0, /* ANYOF_SYNTHETIC */
+ 0, /* POSIXD */
+ 0, /* POSIXL */
+ 0, /* POSIXU */
+ 0, /* POSIXA */
+ 0, /* NPOSIXD */
+ 0, /* NPOSIXL */
+ 0, /* NPOSIXU */
+ 0, /* NPOSIXA */
0, /* CLUMP */
0, /* BRANCH */
0, /* BACK */
0, /* EXACT */
0, /* EXACTF */
0, /* EXACTFL */
+ 0, /* EXACTFU */
+ 0, /* EXACTFA */
+ 0, /* EXACTFU_SS */
+ 0, /* EXACTFA_NO_TRIE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
0, /* REF */
0, /* REFF */
0, /* REFFL */
+ 0, /* REFFU */
+ 0, /* REFFA */
+ 0, /* NREF */
+ 0, /* NREFF */
+ 0, /* NREFFL */
+ 0, /* NREFFU */
+ 0, /* NREFFA */
2, /* IFMATCH */
2, /* UNLESSM */
1, /* SUSPEND */
0, /* TRIEC */
0, /* AHOCORASICK */
0, /* AHOCORASICKC */
- 0, /* RECURSE */
- 0, /* SRECURSE */
- 0, /* NREF */
- 0, /* NREFF */
- 0, /* NREFFL */
+ 0, /* GOSUB */
+ 0, /* GOSTART */
0, /* NGROUPP */
- 0, /* RECURSEP */
+ 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, /* OPTIMIZED */
0, /* PSEUDO */
};
+#endif /* REG_COMP_C */
+
/* reg_name[] - Opcode/state names in string form, for debugging */
-#ifdef DEBUGGING
-const char * reg_name[] = {
+#ifndef DOINIT
+EXTCONST char * PL_reg_name[];
+#else
+EXTCONST char * const PL_reg_name[] = {
"END", /* 0000 */
"SUCCEED", /* 0x01 */
"BOL", /* 0x02 */
"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 */
- "NOTHING", /* 0x24 */
- "TAIL", /* 0x25 */
- "STAR", /* 0x26 */
- "PLUS", /* 0x27 */
- "CURLY", /* 0x28 */
- "CURLYN", /* 0x29 */
- "CURLYM", /* 0x2a */
- "CURLYX", /* 0x2b */
- "WHILEM", /* 0x2c */
- "OPEN", /* 0x2d */
- "CLOSE", /* 0x2e */
- "REF", /* 0x2f */
- "REFF", /* 0x30 */
- "REFFL", /* 0x31 */
- "IFMATCH", /* 0x32 */
- "UNLESSM", /* 0x33 */
- "SUSPEND", /* 0x34 */
- "IFTHEN", /* 0x35 */
- "GROUPP", /* 0x36 */
- "LONGJMP", /* 0x37 */
- "BRANCHJ", /* 0x38 */
- "EVAL", /* 0x39 */
- "MINMOD", /* 0x3a */
- "LOGICAL", /* 0x3b */
- "RENUM", /* 0x3c */
- "TRIE", /* 0x3d */
- "TRIEC", /* 0x3e */
- "AHOCORASICK", /* 0x3f */
- "AHOCORASICKC", /* 0x40 */
- "RECURSE", /* 0x41 */
- "SRECURSE", /* 0x42 */
- "NREF", /* 0x43 */
- "NREFF", /* 0x44 */
- "NREFFL", /* 0x45 */
- "NGROUPP", /* 0x46 */
- "RECURSEP", /* 0x47 */
- "DEFINEP", /* 0x48 */
- "OPTIMIZED", /* 0x49 */
- "PSEUDO", /* 0x4a */
+ "BOUNDU", /* 0x0b */
+ "BOUNDA", /* 0x0c */
+ "NBOUND", /* 0x0d */
+ "NBOUNDL", /* 0x0e */
+ "NBOUNDU", /* 0x0f */
+ "NBOUNDA", /* 0x10 */
+ "GPOS", /* 0x11 */
+ "REG_ANY", /* 0x12 */
+ "SANY", /* 0x13 */
+ "CANY", /* 0x14 */
+ "ANYOF", /* 0x15 */
+ "ANYOF_WARN_SUPER", /* 0x16 */
+ "ANYOF_SYNTHETIC", /* 0x17 */
+ "POSIXD", /* 0x18 */
+ "POSIXL", /* 0x19 */
+ "POSIXU", /* 0x1a */
+ "POSIXA", /* 0x1b */
+ "NPOSIXD", /* 0x1c */
+ "NPOSIXL", /* 0x1d */
+ "NPOSIXU", /* 0x1e */
+ "NPOSIXA", /* 0x1f */
+ "CLUMP", /* 0x20 */
+ "BRANCH", /* 0x21 */
+ "BACK", /* 0x22 */
+ "EXACT", /* 0x23 */
+ "EXACTF", /* 0x24 */
+ "EXACTFL", /* 0x25 */
+ "EXACTFU", /* 0x26 */
+ "EXACTFA", /* 0x27 */
+ "EXACTFU_SS", /* 0x28 */
+ "EXACTFA_NO_TRIE", /* 0x29 */
+ "NOTHING", /* 0x2a */
+ "TAIL", /* 0x2b */
+ "STAR", /* 0x2c */
+ "PLUS", /* 0x2d */
+ "CURLY", /* 0x2e */
+ "CURLYN", /* 0x2f */
+ "CURLYM", /* 0x30 */
+ "CURLYX", /* 0x31 */
+ "WHILEM", /* 0x32 */
+ "OPEN", /* 0x33 */
+ "CLOSE", /* 0x34 */
+ "REF", /* 0x35 */
+ "REFF", /* 0x36 */
+ "REFFL", /* 0x37 */
+ "REFFU", /* 0x38 */
+ "REFFA", /* 0x39 */
+ "NREF", /* 0x3a */
+ "NREFF", /* 0x3b */
+ "NREFFL", /* 0x3c */
+ "NREFFU", /* 0x3d */
+ "NREFFA", /* 0x3e */
+ "IFMATCH", /* 0x3f */
+ "UNLESSM", /* 0x40 */
+ "SUSPEND", /* 0x41 */
+ "IFTHEN", /* 0x42 */
+ "GROUPP", /* 0x43 */
+ "LONGJMP", /* 0x44 */
+ "BRANCHJ", /* 0x45 */
+ "EVAL", /* 0x46 */
+ "MINMOD", /* 0x47 */
+ "LOGICAL", /* 0x48 */
+ "RENUM", /* 0x49 */
+ "TRIE", /* 0x4a */
+ "TRIEC", /* 0x4b */
+ "AHOCORASICK", /* 0x4c */
+ "AHOCORASICKC", /* 0x4d */
+ "GOSUB", /* 0x4e */
+ "GOSTART", /* 0x4f */
+ "NGROUPP", /* 0x50 */
+ "INSUBP", /* 0x51 */
+ "DEFINEP", /* 0x52 */
+ "ENDLIKE", /* 0x53 */
+ "OPFAIL", /* 0x54 */
+ "ACCEPT", /* 0x55 */
+ "VERB", /* 0x56 */
+ "PRUNE", /* 0x57 */
+ "MARKPOINT", /* 0x58 */
+ "SKIP", /* 0x59 */
+ "COMMIT", /* 0x5a */
+ "CUTGROUP", /* 0x5b */
+ "KEEPS", /* 0x5c */
+ "LNBREAK", /* 0x5d */
+ "OPTIMIZED", /* 0x5e */
+ "PSEUDO", /* 0x5f */
/* ------------ States ------------- */
- "TRIE_next", /* 0x4b */
- "TRIE_next_fail", /* 0x4c */
- "EVAL_AB", /* 0x4d */
- "EVAL_AB_fail", /* 0x4e */
- "CURLYX_end", /* 0x4f */
- "CURLYX_end_fail", /* 0x50 */
- "WHILEM_A_pre", /* 0x51 */
- "WHILEM_A_pre_fail", /* 0x52 */
- "WHILEM_A_min", /* 0x53 */
- "WHILEM_A_min_fail", /* 0x54 */
- "WHILEM_A_max", /* 0x55 */
- "WHILEM_A_max_fail", /* 0x56 */
- "WHILEM_B_min", /* 0x57 */
- "WHILEM_B_min_fail", /* 0x58 */
- "WHILEM_B_max", /* 0x59 */
- "WHILEM_B_max_fail", /* 0x5a */
- "BRANCH_next", /* 0x5b */
- "BRANCH_next_fail", /* 0x5c */
- "CURLYM_A", /* 0x5d */
- "CURLYM_A_fail", /* 0x5e */
- "CURLYM_B", /* 0x5f */
- "CURLYM_B_fail", /* 0x60 */
- "IFMATCH_A", /* 0x61 */
- "IFMATCH_A_fail", /* 0x62 */
- "CURLY_B_min_known", /* 0x63 */
- "CURLY_B_min_known_fail", /* 0x64 */
- "CURLY_B_min", /* 0x65 */
- "CURLY_B_min_fail", /* 0x66 */
- "CURLY_B_max", /* 0x67 */
- "CURLY_B_max_fail", /* 0x68 */
+ "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 /* DEBUGGING */
+#endif /* DOINIT */
+
+/* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */
+
+#ifndef DOINIT
+EXTCONST char * PL_reg_extflags_name[];
#else
-#ifdef DEBUGGING
-extern const char * reg_name[];
-#endif
-#endif /* REG_COMP_C */
+EXTCONST char * const PL_reg_extflags_name[] = {
+ /* Bits in extflags defined: 11111110111111111111111111111111 */
+ "MULTILINE", /* 0x00000001 */
+ "SINGLELINE", /* 0x00000002 */
+ "FOLD", /* 0x00000004 */
+ "EXTENDED", /* 0x00000008 */
+ "KEEPCOPY", /* 0x00000010 */
+ "CHARSET0", /* 0x00000020 : "CHARSET" - 0x000000e0 */
+ "CHARSET1", /* 0x00000040 : "CHARSET" - 0x000000e0 */
+ "CHARSET2", /* 0x00000080 : "CHARSET" - 0x000000e0 */
+ "SPLIT", /* 0x00000100 */
+ "ANCH_BOL", /* 0x00000200 */
+ "ANCH_MBOL", /* 0x00000400 */
+ "ANCH_SBOL", /* 0x00000800 */
+ "ANCH_GPOS", /* 0x00001000 */
+ "GPOS_SEEN", /* 0x00002000 */
+ "GPOS_FLOAT", /* 0x00004000 */
+ "NO_INPLACE_SUBST", /* 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 */
+ "UNUSED_BIT_24", /* 0x01000000 */
+ "COPY_DONE", /* 0x02000000 */
+ "TAINTED_SEEN", /* 0x04000000 */
+ "TAINTED", /* 0x08000000 */
+ "START_ONLY", /* 0x10000000 */
+ "SKIPWHITE", /* 0x20000000 */
+ "WHITE", /* 0x40000000 */
+ "NULL", /* 0x80000000 */
+};
+#endif /* DOINIT */
+
+/* PL_reg_intflags_name[] - Opcode/state names in string form, for debugging */
+
+#ifndef DOINIT
+EXTCONST char * PL_reg_intflags_name[];
+#else
+EXTCONST char * const PL_reg_intflags_name[] = {
+ "SKIP", /* 0x00000001 - PREGf_SKIP */
+ "IMPLICIT", /* 0x00000002 - PREGf_IMPLICIT - Converted .* to ^.* */
+ "NAUGHTY", /* 0x00000004 - PREGf_NAUGHTY - how exponential is this pattern? */
+ "VERBARG_SEEN", /* 0x00000008 - PREGf_VERBARG_SEEN */
+ "CUTGROUP_SEEN", /* 0x00000010 - PREGf_CUTGROUP_SEEN */
+ "USE_RE_EVAL", /* 0x00000020 - PREGf_USE_RE_EVAL - compiled with "use re 'eval'" */
+};
+#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, REFFA, NREF, NREFF, NREFFL, NREFFU, NREFFA,
+ SUSPEND, IFTHEN, BRANCHJ,
+ 0
+};
+#endif /* DOINIT */
+
+#ifndef DOINIT
+EXTCONST U8 PL_varies_bitmask[];
+#else
+EXTCONST U8 PL_varies_bitmask[] = {
+ 0x00, 0x00, 0x00, 0x00, 0x07, 0xF0, 0xE7, 0x7F, 0x26, 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, ANYOF_WARN_SUPER, ANYOF_SYNTHETIC, POSIXD,
+ POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL, NPOSIXU, NPOSIXA,
+ 0
+};
+#endif /* DOINIT */
+
+#ifndef DOINIT
+EXTCONST U8 PL_simple_bitmask[];
+#else
+EXTCONST U8 PL_simple_bitmask[] = {
+ 0x00, 0x00, 0xFC, 0xFF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+};
+#endif /* DOINIT */
/* ex: set ro: */
https://perl5.git.perl.org / perl5.git / blobdiff