!!!!!!! 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 102
-#define REGMATCH_STATE_MAX 142
+#define REGNODE_MAX 97
+#define REGMATCH_STATE_MAX 139
#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 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 NBOUND 12 /* 0x0c Match "" at any word non-boundary using native charset semantics for non-utf8 */
-#define NBOUNDL 13 /* 0x0d Match "" at any locale word non-boundary */
-#define NBOUNDU 14 /* 0x0e Match "" at any word non-boundary using Unicode semantics */
-#define GPOS 15 /* 0x0f Matches where last m//g left off. */
+#define SBOL 2 /* 0x02 Match "" at beginning of line: /^/, /\A/ */
+#define BOL 2 /* 0x02 type alias */
+#define MBOL 3 /* 0x03 Same, assuming multiline: /^/m */
+#define SEOL 4 /* 0x04 Match "" at end of line: /$/ */
+#define EOL 4 /* 0x04 type alias */
+#define MEOL 5 /* 0x05 Same, assuming multiline: /$/m */
+#define EOS 6 /* 0x06 Match "" at end of string: /\z/ */
+#define GPOS 7 /* 0x07 Matches where last m//g left off. */
+#define BOUND 8 /* 0x08 Like BOUNDA for non-utf8, otherwise match "" between any Unicode \w\W or \W\w */
+#define BOUNDL 9 /* 0x09 Like BOUND/BOUNDU, but \w and \W are defined by current locale */
+#define BOUNDU 10 /* 0x0a Match "" at any boundary of a given type using Unicode rules */
+#define BOUNDA 11 /* 0x0b Match "" at any boundary between \w\W or \W\w, where \w is [_a-zA-Z0-9] */
+#define NBOUND 12 /* 0x0c Like NBOUNDA for non-utf8, otherwise match "" between any Unicode \w\w or \W\W */
+#define NBOUNDL 13 /* 0x0d Like NBOUND/NBOUNDU, but \w and \W are defined by current locale */
+#define NBOUNDU 14 /* 0x0e Match "" at any non-boundary of a given type using using Unicode rules */
+#define NBOUNDA 15 /* 0x0f Match "" betweeen any \w\w or \W\W, where \w is [_a-zA-Z0-9] */
#define REG_ANY 16 /* 0x10 Match any one character (except newline). */
#define SANY 17 /* 0x11 Match any one character. */
-#define CANY 18 /* 0x12 Match any one byte. */
-#define ANYOF 19 /* 0x13 Match character in (or not in) this class, single char match only */
-#define ANYOFV 20 /* 0x14 Match character in (or not in) this class, can match-multiple chars */
-#define ALNUM 21 /* 0x15 Match any alphanumeric character using native charset semantics for non-utf8 */
-#define ALNUML 22 /* 0x16 Match any alphanumeric char in locale */
-#define ALNUMU 23 /* 0x17 Match any alphanumeric char using Unicode semantics */
-#define NALNUM 24 /* 0x18 Match any non-alphanumeric character using native charset semantics for non-utf8 */
-#define NALNUML 25 /* 0x19 Match any non-alphanumeric char in locale */
-#define NALNUMU 26 /* 0x1a Match any non-alphanumeric char using Unicode semantics */
-#define SPACE 27 /* 0x1b Match any whitespace character using native charset semantics for non-utf8 */
-#define SPACEL 28 /* 0x1c Match any whitespace char in locale */
-#define SPACEU 29 /* 0x1d Match any whitespace char using Unicode semantics */
-#define NSPACE 30 /* 0x1e Match any non-whitespace character using native charset semantics for non-utf8 */
-#define NSPACEL 31 /* 0x1f Match any non-whitespace char in locale */
-#define NSPACEU 32 /* 0x20 Match any non-whitespace char using Unicode semantics */
-#define DIGIT 33 /* 0x21 Match any numeric character using native charset semantics for non-utf8 */
-#define DIGITL 34 /* 0x22 Match any numeric character in locale */
-#define DIGITU 35 /* 0x23 Match any numeric character using Unicode semantics */
-#define NDIGIT 36 /* 0x24 Match any non-numeric character using native charset semantics for non-utf8 */
-#define NDIGITL 37 /* 0x25 Match any non-numeric character in locale */
-#define NDIGITU 38 /* 0x26 Match any non-numeric character using Unicode semantics */
-#define CLUMP 39 /* 0x27 Match any extended grapheme cluster sequence */
-#define BRANCH 40 /* 0x28 Match this alternative, or the next... */
-#define BACK 41 /* 0x29 Match "", "next" ptr points backward. */
-#define EXACT 42 /* 0x2a Match this string (preceded by length). */
-#define EXACTF 43 /* 0x2b Match this string, folded, native charset semantics for non-utf8 (prec. by length). */
-#define EXACTFL 44 /* 0x2c Match this string, folded in locale (w/len). */
-#define EXACTFU 45 /* 0x2d Match this string, folded, Unicode semantics for non-utf8 (prec. by length). */
-#define NOTHING 46 /* 0x2e Match empty string. */
-#define TAIL 47 /* 0x2f Match empty string. Can jump here from outside. */
-#define STAR 48 /* 0x30 Match this (simple) thing 0 or more times. */
-#define PLUS 49 /* 0x31 Match this (simple) thing 1 or more times. */
-#define CURLY 50 /* 0x32 Match this simple thing {n,m} times. */
-#define CURLYN 51 /* 0x33 Capture next-after-this simple thing */
-#define CURLYM 52 /* 0x34 Capture this medium-complex thing {n,m} times. */
-#define CURLYX 53 /* 0x35 Match this complex thing {n,m} times. */
-#define WHILEM 54 /* 0x36 Do curly processing and see if rest matches. */
-#define OPEN 55 /* 0x37 Mark this point in input as start of */
-#define CLOSE 56 /* 0x38 Analogous to OPEN. */
-#define REF 57 /* 0x39 Match some already matched string */
-#define REFF 58 /* 0x3a Match already matched string, folded using native charset semantics for non-utf8 */
-#define REFFL 59 /* 0x3b Match already matched string, folded in loc. */
-#define REFFU 60 /* 0x3c Match already matched string, folded using unicode semantics for non-utf8 */
+#define ANYOF 18 /* 0x12 Match character in (or not in) this class, single char match only */
+#define ANYOFD 19 /* 0x13 Like ANYOF, but /d is in effect */
+#define ANYOFL 20 /* 0x14 Like ANYOF, but /l is in effect */
+#define ANYOFM 21 /* 0x15 Like ANYOF, but matches an invariant byte as determined by the mask and arg */
+#define POSIXD 22 /* 0x16 Some [[:class:]] under /d; the FLAGS field gives which one */
+#define POSIXL 23 /* 0x17 Some [[:class:]] under /l; the FLAGS field gives which one */
+#define POSIXU 24 /* 0x18 Some [[:class:]] under /u; the FLAGS field gives which one */
+#define POSIXA 25 /* 0x19 Some [[:class:]] under /a; the FLAGS field gives which one */
+#define NPOSIXD 26 /* 0x1a complement of POSIXD, [[:^class:]] */
+#define NPOSIXL 27 /* 0x1b complement of POSIXL, [[:^class:]] */
+#define NPOSIXU 28 /* 0x1c complement of POSIXU, [[:^class:]] */
+#define NPOSIXA 29 /* 0x1d complement of POSIXA, [[:^class:]] */
+#define ASCII 30 /* 0x1e [[:ascii:]] */
+#define NASCII 31 /* 0x1f [[:^ascii:]] */
+#define CLUMP 32 /* 0x20 Match any extended grapheme cluster sequence */
+#define BRANCH 33 /* 0x21 Match this alternative, or the next... */
+#define EXACT 34 /* 0x22 Match this string (preceded by length). */
+#define EXACTL 35 /* 0x23 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */
+#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 EXACTFAA 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 EXACTFLU8 41 /* 0x29 Rare circumstances: like EXACTFU, but is under /l, UTF-8, folded, and everything in it is above 255. */
+#define EXACTFAA_NO_TRIE 42 /* 0x2a Match this string (which is not trie-able; not guaranteed to be folded) using /iaa rules (w/len). */
+#define NOTHING 43 /* 0x2b Match empty string. */
+#define TAIL 44 /* 0x2c Match empty string. Can jump here from outside. */
+#define STAR 45 /* 0x2d Match this (simple) thing 0 or more times. */
+#define PLUS 46 /* 0x2e Match this (simple) thing 1 or more times. */
+#define CURLY 47 /* 0x2f Match this simple thing {n,m} times. */
+#define CURLYN 48 /* 0x30 Capture next-after-this simple thing */
+#define CURLYM 49 /* 0x31 Capture this medium-complex thing {n,m} times. */
+#define CURLYX 50 /* 0x32 Match this complex thing {n,m} times. */
+#define WHILEM 51 /* 0x33 Do curly processing and see if rest matches. */
+#define OPEN 52 /* 0x34 Mark this point in input as start of #n. */
+#define CLOSE 53 /* 0x35 Close corresponding OPEN of #n. */
+#define SROPEN 54 /* 0x36 Same as OPEN, but for script run */
+#define SRCLOSE 55 /* 0x37 Close preceding SROPEN */
+#define REF 56 /* 0x38 Match some already matched string */
+#define REFF 57 /* 0x39 Match already matched string, folded using native charset rules for non-utf8 */
+#define REFFL 58 /* 0x3a Match already matched string, folded in loc. */
+#define REFFU 59 /* 0x3b Match already matched string, folded using unicode rules for non-utf8 */
+#define REFFA 60 /* 0x3c Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */
#define NREF 61 /* 0x3d Match some already matched string */
-#define NREFF 62 /* 0x3e Match already matched string, folded using native charset semantics for non-utf8 */
+#define NREFF 62 /* 0x3e Match already matched string, folded using native charset rules for non-utf8 */
#define NREFFL 63 /* 0x3f Match already matched string, folded in loc. */
-#define NREFFU 64 /* 0x40 Match already matched string, folded using unicode semantics for non-utf8 */
-#define IFMATCH 65 /* 0x41 Succeeds if the following matches. */
-#define UNLESSM 66 /* 0x42 Fails if the following matches. */
-#define SUSPEND 67 /* 0x43 "Independent" sub-RE. */
-#define IFTHEN 68 /* 0x44 Switch, should be preceded by switcher . */
-#define GROUPP 69 /* 0x45 Whether the group matched. */
-#define LONGJMP 70 /* 0x46 Jump far away. */
-#define BRANCHJ 71 /* 0x47 BRANCH with long offset. */
-#define EVAL 72 /* 0x48 Execute some Perl code. */
-#define MINMOD 73 /* 0x49 Next operator is not greedy. */
-#define LOGICAL 74 /* 0x4a Next opcode should set the flag only. */
-#define RENUM 75 /* 0x4b Group with independently numbered parens. */
-#define TRIE 76 /* 0x4c Match many EXACT(F[LU]?)? at once. flags==type */
-#define TRIEC 77 /* 0x4d Same as TRIE, but with embedded charclass data */
-#define AHOCORASICK 78 /* 0x4e Aho Corasick stclass. flags==type */
-#define AHOCORASICKC 79 /* 0x4f Same as AHOCORASICK, but with embedded charclass data */
-#define GOSUB 80 /* 0x50 recurse to paren arg1 at (signed) ofs arg2 */
-#define GOSTART 81 /* 0x51 recurse to start of pattern */
+#define NREFFU 64 /* 0x40 Match already matched string, folded using unicode rules for non-utf8 */
+#define NREFFA 65 /* 0x41 Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */
+#define LONGJMP 66 /* 0x42 Jump far away. */
+#define BRANCHJ 67 /* 0x43 BRANCH with long offset. */
+#define IFMATCH 68 /* 0x44 Succeeds if the following matches. */
+#define UNLESSM 69 /* 0x45 Fails if the following matches. */
+#define SUSPEND 70 /* 0x46 "Independent" sub-RE. */
+#define IFTHEN 71 /* 0x47 Switch, should be preceded by switcher. */
+#define GROUPP 72 /* 0x48 Whether the group matched. */
+#define EVAL 73 /* 0x49 Execute some Perl code. */
+#define MINMOD 74 /* 0x4a Next operator is not greedy. */
+#define LOGICAL 75 /* 0x4b Next opcode should set the flag only. */
+#define RENUM 76 /* 0x4c Group with independently numbered parens. */
+#define TRIE 77 /* 0x4d Match many EXACT(F[ALU]?)? at once. flags==type */
+#define TRIEC 78 /* 0x4e Same as TRIE, but with embedded charclass data */
+#define AHOCORASICK 79 /* 0x4f Aho Corasick stclass. flags==type */
+#define AHOCORASICKC 80 /* 0x50 Same as AHOCORASICK, but with embedded charclass data */
+#define GOSUB 81 /* 0x51 recurse to paren arg1 at (signed) ofs arg2 */
#define NGROUPP 82 /* 0x52 Whether the group matched. */
#define INSUBP 83 /* 0x53 Whether we are in a specific recurse. */
#define DEFINEP 84 /* 0x54 Never execute directly. */
#define ENDLIKE 85 /* 0x55 Used only for the type field of verbs */
-#define OPFAIL 86 /* 0x56 Same as (?!) */
-#define ACCEPT 87 /* 0x57 Accepts the current matched string. */
+#define OPFAIL 86 /* 0x56 Same as (?!), but with verb arg */
+#define ACCEPT 87 /* 0x57 Accepts the current matched string, with verbar */
#define VERB 88 /* 0x58 Used only for the type field of verbs */
#define PRUNE 89 /* 0x59 Pattern fails at this startpoint if no-backtracking through this */
#define MARKPOINT 90 /* 0x5a Push the current location for rollback by cut. */
#define CUTGROUP 93 /* 0x5d On failure go to the next alternation in the group */
#define KEEPS 94 /* 0x5e $& begins here. */
#define LNBREAK 95 /* 0x5f generic newline pattern */
-#define VERTWS 96 /* 0x60 vertical whitespace (Perl 6) */
-#define NVERTWS 97 /* 0x61 not vertical whitespace (Perl 6) */
-#define HORIZWS 98 /* 0x62 horizontal whitespace (Perl 6) */
-#define NHORIZWS 99 /* 0x63 not horizontal whitespace (Perl 6) */
-#define FOLDCHAR 100 /* 0x64 codepoint with tricky case folding properties. */
-#define OPTIMIZED 101 /* 0x65 Placeholder for dump. */
-#define PSEUDO 102 /* 0x66 Pseudo opcode for internal use. */
+#define OPTIMIZED 96 /* 0x60 Placeholder for dump. */
+#define PSEUDO 97 /* 0x61 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 */
+#define EVAL_B (REGNODE_MAX + 3) /* state for EVAL */
+#define EVAL_B_fail (REGNODE_MAX + 4) /* state for EVAL */
+#define EVAL_postponed_AB (REGNODE_MAX + 5) /* state for EVAL */
+#define EVAL_postponed_AB_fail (REGNODE_MAX + 6) /* state for EVAL */
+#define CURLYX_end (REGNODE_MAX + 7) /* state for CURLYX */
+#define CURLYX_end_fail (REGNODE_MAX + 8) /* state for CURLYX */
+#define WHILEM_A_pre (REGNODE_MAX + 9) /* state for WHILEM */
+#define WHILEM_A_pre_fail (REGNODE_MAX + 10) /* state for WHILEM */
+#define WHILEM_A_min (REGNODE_MAX + 11) /* state for WHILEM */
+#define WHILEM_A_min_fail (REGNODE_MAX + 12) /* state for WHILEM */
+#define WHILEM_A_max (REGNODE_MAX + 13) /* state for WHILEM */
+#define WHILEM_A_max_fail (REGNODE_MAX + 14) /* state for WHILEM */
+#define WHILEM_B_min (REGNODE_MAX + 15) /* state for WHILEM */
+#define WHILEM_B_min_fail (REGNODE_MAX + 16) /* state for WHILEM */
+#define WHILEM_B_max (REGNODE_MAX + 17) /* state for WHILEM */
+#define WHILEM_B_max_fail (REGNODE_MAX + 18) /* state for WHILEM */
+#define BRANCH_next (REGNODE_MAX + 19) /* state for BRANCH */
+#define BRANCH_next_fail (REGNODE_MAX + 20) /* state for BRANCH */
+#define CURLYM_A (REGNODE_MAX + 21) /* state for CURLYM */
+#define CURLYM_A_fail (REGNODE_MAX + 22) /* state for CURLYM */
+#define CURLYM_B (REGNODE_MAX + 23) /* state for CURLYM */
+#define CURLYM_B_fail (REGNODE_MAX + 24) /* state for CURLYM */
+#define IFMATCH_A (REGNODE_MAX + 25) /* state for IFMATCH */
+#define IFMATCH_A_fail (REGNODE_MAX + 26) /* state for IFMATCH */
+#define CURLY_B_min_known (REGNODE_MAX + 27) /* state for CURLY */
+#define CURLY_B_min_known_fail (REGNODE_MAX + 28) /* state for CURLY */
+#define CURLY_B_min (REGNODE_MAX + 29) /* state for CURLY */
+#define CURLY_B_min_fail (REGNODE_MAX + 30) /* state for CURLY */
+#define CURLY_B_max (REGNODE_MAX + 31) /* state for CURLY */
+#define CURLY_B_max_fail (REGNODE_MAX + 32) /* state for CURLY */
+#define COMMIT_next (REGNODE_MAX + 33) /* state for COMMIT */
+#define COMMIT_next_fail (REGNODE_MAX + 34) /* state for COMMIT */
+#define MARKPOINT_next (REGNODE_MAX + 35) /* state for MARKPOINT */
+#define MARKPOINT_next_fail (REGNODE_MAX + 36) /* state for MARKPOINT */
+#define SKIP_next (REGNODE_MAX + 37) /* state for SKIP */
+#define SKIP_next_fail (REGNODE_MAX + 38) /* state for SKIP */
+#define CUTGROUP_next (REGNODE_MAX + 39) /* state for CUTGROUP */
+#define CUTGROUP_next_fail (REGNODE_MAX + 40) /* state for CUTGROUP */
+#define KEEPS_next (REGNODE_MAX + 41) /* state for KEEPS */
+#define KEEPS_next_fail (REGNODE_MAX + 42) /* state for KEEPS */
/* PL_regkind[] What type of regop or state is this. */
EXTCONST U8 PL_regkind[] = {
END, /* END */
END, /* SUCCEED */
- BOL, /* BOL */
- BOL, /* MBOL */
BOL, /* SBOL */
- EOL, /* EOS */
- EOL, /* EOL */
- EOL, /* MEOL */
+ BOL, /* MBOL */
EOL, /* SEOL */
+ EOL, /* MEOL */
+ EOL, /* EOS */
+ GPOS, /* GPOS */
BOUND, /* BOUND */
BOUND, /* BOUNDL */
BOUND, /* BOUNDU */
+ BOUND, /* BOUNDA */
NBOUND, /* NBOUND */
NBOUND, /* NBOUNDL */
NBOUND, /* NBOUNDU */
- GPOS, /* GPOS */
+ NBOUND, /* NBOUNDA */
REG_ANY, /* REG_ANY */
REG_ANY, /* SANY */
- REG_ANY, /* CANY */
ANYOF, /* ANYOF */
- ANYOF, /* ANYOFV */
- ALNUM, /* ALNUM */
- ALNUM, /* ALNUML */
- ALNUM, /* ALNUMU */
- NALNUM, /* NALNUM */
- NALNUM, /* NALNUML */
- NALNUM, /* NALNUMU */
- SPACE, /* SPACE */
- SPACE, /* SPACEL */
- SPACE, /* SPACEU */
- NSPACE, /* NSPACE */
- NSPACE, /* NSPACEL */
- NSPACE, /* NSPACEU */
- DIGIT, /* DIGIT */
- DIGIT, /* DIGITL */
- DIGIT, /* DIGITU */
- NDIGIT, /* NDIGIT */
- NDIGIT, /* NDIGITL */
- NDIGIT, /* NDIGITU */
+ ANYOF, /* ANYOFD */
+ ANYOF, /* ANYOFL */
+ ANYOFM, /* ANYOFM */
+ POSIXD, /* POSIXD */
+ POSIXD, /* POSIXL */
+ POSIXD, /* POSIXU */
+ POSIXD, /* POSIXA */
+ NPOSIXD, /* NPOSIXD */
+ NPOSIXD, /* NPOSIXL */
+ NPOSIXD, /* NPOSIXU */
+ NPOSIXD, /* NPOSIXA */
+ ASCII, /* ASCII */
+ ASCII, /* NASCII */
CLUMP, /* CLUMP */
BRANCH, /* BRANCH */
- BACK, /* BACK */
EXACT, /* EXACT */
+ EXACT, /* EXACTL */
EXACT, /* EXACTF */
EXACT, /* EXACTFL */
EXACT, /* EXACTFU */
+ EXACT, /* EXACTFAA */
+ EXACT, /* EXACTFU_SS */
+ EXACT, /* EXACTFLU8 */
+ EXACT, /* EXACTFAA_NO_TRIE */
NOTHING, /* NOTHING */
NOTHING, /* TAIL */
STAR, /* STAR */
WHILEM, /* WHILEM */
OPEN, /* OPEN */
CLOSE, /* CLOSE */
+ SROPEN, /* SROPEN */
+ SRCLOSE, /* SRCLOSE */
REF, /* REF */
REF, /* REFF */
REF, /* REFFL */
REF, /* REFFU */
+ REF, /* REFFA */
REF, /* NREF */
REF, /* NREFF */
REF, /* NREFFL */
REF, /* NREFFU */
+ REF, /* NREFFA */
+ LONGJMP, /* LONGJMP */
+ BRANCHJ, /* BRANCHJ */
BRANCHJ, /* IFMATCH */
BRANCHJ, /* UNLESSM */
BRANCHJ, /* SUSPEND */
BRANCHJ, /* IFTHEN */
GROUPP, /* GROUPP */
- LONGJMP, /* LONGJMP */
- BRANCHJ, /* BRANCHJ */
EVAL, /* EVAL */
MINMOD, /* MINMOD */
LOGICAL, /* LOGICAL */
TRIE, /* AHOCORASICK */
TRIE, /* AHOCORASICKC */
GOSUB, /* GOSUB */
- GOSTART, /* GOSTART */
NGROUPP, /* NGROUPP */
INSUBP, /* INSUBP */
DEFINEP, /* DEFINEP */
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 */
+ EVAL, /* EVAL_B */
+ EVAL, /* EVAL_B_fail */
+ EVAL, /* EVAL_postponed_AB */
+ EVAL, /* EVAL_postponed_AB_fail */
CURLYX, /* CURLYX_end */
CURLYX, /* CURLYX_end_fail */
WHILEM, /* WHILEM_A_pre */
};
#endif
+#ifdef REG_COMP_C
+
/* 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, /* MBOL */
0, /* SEOL */
+ 0, /* MEOL */
+ 0, /* EOS */
+ 0, /* GPOS */
0, /* BOUND */
0, /* BOUNDL */
0, /* BOUNDU */
+ 0, /* BOUNDA */
0, /* NBOUND */
0, /* NBOUNDL */
0, /* NBOUNDU */
- 0, /* GPOS */
+ 0, /* NBOUNDA */
0, /* REG_ANY */
0, /* SANY */
- 0, /* CANY */
- 0, /* ANYOF */
- 0, /* ANYOFV */
- 0, /* ALNUM */
- 0, /* ALNUML */
- 0, /* ALNUMU */
- 0, /* NALNUM */
- 0, /* NALNUML */
- 0, /* NALNUMU */
- 0, /* SPACE */
- 0, /* SPACEL */
- 0, /* SPACEU */
- 0, /* NSPACE */
- 0, /* NSPACEL */
- 0, /* NSPACEU */
- 0, /* DIGIT */
- 0, /* DIGITL */
- 0, /* DIGITU */
- 0, /* NDIGIT */
- 0, /* NDIGITL */
- 0, /* NDIGITU */
+ EXTRA_SIZE(struct regnode_1), /* ANYOF */
+ EXTRA_SIZE(struct regnode_1), /* ANYOFD */
+ EXTRA_SIZE(struct regnode_1), /* ANYOFL */
+ EXTRA_SIZE(struct regnode_1), /* ANYOFM */
+ 0, /* POSIXD */
+ 0, /* POSIXL */
+ 0, /* POSIXU */
+ 0, /* POSIXA */
+ 0, /* NPOSIXD */
+ 0, /* NPOSIXL */
+ 0, /* NPOSIXU */
+ 0, /* NPOSIXA */
+ 0, /* ASCII */
+ 0, /* NASCII */
0, /* CLUMP */
0, /* BRANCH */
- 0, /* BACK */
0, /* EXACT */
+ 0, /* EXACTL */
0, /* EXACTF */
0, /* EXACTFL */
0, /* EXACTFU */
+ 0, /* EXACTFAA */
+ 0, /* EXACTFU_SS */
+ 0, /* EXACTFLU8 */
+ 0, /* EXACTFAA_NO_TRIE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
0, /* WHILEM */
EXTRA_SIZE(struct regnode_1), /* OPEN */
EXTRA_SIZE(struct regnode_1), /* CLOSE */
+ 0, /* SROPEN */
+ 0, /* SRCLOSE */
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), /* LONGJMP */
+ EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
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 */
+ EXTRA_SIZE(struct regnode_2L), /* EVAL */
0, /* MINMOD */
0, /* LOGICAL */
EXTRA_SIZE(struct regnode_1), /* RENUM */
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), /* OPFAIL */
+ EXTRA_SIZE(struct regnode_2L), /* ACCEPT */
EXTRA_SIZE(struct regnode_1), /* VERB */
EXTRA_SIZE(struct regnode_1), /* PRUNE */
EXTRA_SIZE(struct regnode_1), /* MARKPOINT */
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 */
};
static const char reg_off_by_arg[] = {
0, /* END */
0, /* SUCCEED */
- 0, /* BOL */
- 0, /* MBOL */
0, /* SBOL */
- 0, /* EOS */
- 0, /* EOL */
- 0, /* MEOL */
+ 0, /* MBOL */
0, /* SEOL */
+ 0, /* MEOL */
+ 0, /* EOS */
+ 0, /* GPOS */
0, /* BOUND */
0, /* BOUNDL */
0, /* BOUNDU */
+ 0, /* BOUNDA */
0, /* NBOUND */
0, /* NBOUNDL */
0, /* NBOUNDU */
- 0, /* GPOS */
+ 0, /* NBOUNDA */
0, /* REG_ANY */
0, /* SANY */
- 0, /* CANY */
0, /* ANYOF */
- 0, /* ANYOFV */
- 0, /* ALNUM */
- 0, /* ALNUML */
- 0, /* ALNUMU */
- 0, /* NALNUM */
- 0, /* NALNUML */
- 0, /* NALNUMU */
- 0, /* SPACE */
- 0, /* SPACEL */
- 0, /* SPACEU */
- 0, /* NSPACE */
- 0, /* NSPACEL */
- 0, /* NSPACEU */
- 0, /* DIGIT */
- 0, /* DIGITL */
- 0, /* DIGITU */
- 0, /* NDIGIT */
- 0, /* NDIGITL */
- 0, /* NDIGITU */
+ 0, /* ANYOFD */
+ 0, /* ANYOFL */
+ 0, /* ANYOFM */
+ 0, /* POSIXD */
+ 0, /* POSIXL */
+ 0, /* POSIXU */
+ 0, /* POSIXA */
+ 0, /* NPOSIXD */
+ 0, /* NPOSIXL */
+ 0, /* NPOSIXU */
+ 0, /* NPOSIXA */
+ 0, /* ASCII */
+ 0, /* NASCII */
0, /* CLUMP */
0, /* BRANCH */
- 0, /* BACK */
0, /* EXACT */
+ 0, /* EXACTL */
0, /* EXACTF */
0, /* EXACTFL */
0, /* EXACTFU */
+ 0, /* EXACTFAA */
+ 0, /* EXACTFU_SS */
+ 0, /* EXACTFLU8 */
+ 0, /* EXACTFAA_NO_TRIE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
0, /* WHILEM */
0, /* OPEN */
0, /* CLOSE */
+ 0, /* SROPEN */
+ 0, /* SRCLOSE */
0, /* REF */
0, /* REFF */
0, /* REFFL */
0, /* REFFU */
+ 0, /* REFFA */
0, /* NREF */
0, /* NREFF */
0, /* NREFFL */
0, /* NREFFU */
+ 0, /* NREFFA */
+ 1, /* LONGJMP */
+ 1, /* BRANCHJ */
2, /* IFMATCH */
2, /* UNLESSM */
1, /* SUSPEND */
1, /* IFTHEN */
0, /* GROUPP */
- 1, /* LONGJMP */
- 1, /* BRANCHJ */
0, /* EVAL */
0, /* MINMOD */
0, /* LOGICAL */
0, /* AHOCORASICK */
0, /* AHOCORASICKC */
0, /* GOSUB */
- 0, /* GOSTART */
0, /* NGROUPP */
0, /* INSUBP */
0, /* DEFINEP */
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 * const PL_reg_name[] = {
"END", /* 0000 */
"SUCCEED", /* 0x01 */
- "BOL", /* 0x02 */
+ "SBOL", /* 0x02 */
"MBOL", /* 0x03 */
- "SBOL", /* 0x04 */
- "EOS", /* 0x05 */
- "EOL", /* 0x06 */
- "MEOL", /* 0x07 */
- "SEOL", /* 0x08 */
- "BOUND", /* 0x09 */
- "BOUNDL", /* 0x0a */
- "BOUNDU", /* 0x0b */
+ "SEOL", /* 0x04 */
+ "MEOL", /* 0x05 */
+ "EOS", /* 0x06 */
+ "GPOS", /* 0x07 */
+ "BOUND", /* 0x08 */
+ "BOUNDL", /* 0x09 */
+ "BOUNDU", /* 0x0a */
+ "BOUNDA", /* 0x0b */
"NBOUND", /* 0x0c */
"NBOUNDL", /* 0x0d */
"NBOUNDU", /* 0x0e */
- "GPOS", /* 0x0f */
+ "NBOUNDA", /* 0x0f */
"REG_ANY", /* 0x10 */
"SANY", /* 0x11 */
- "CANY", /* 0x12 */
- "ANYOF", /* 0x13 */
- "ANYOFV", /* 0x14 */
- "ALNUM", /* 0x15 */
- "ALNUML", /* 0x16 */
- "ALNUMU", /* 0x17 */
- "NALNUM", /* 0x18 */
- "NALNUML", /* 0x19 */
- "NALNUMU", /* 0x1a */
- "SPACE", /* 0x1b */
- "SPACEL", /* 0x1c */
- "SPACEU", /* 0x1d */
- "NSPACE", /* 0x1e */
- "NSPACEL", /* 0x1f */
- "NSPACEU", /* 0x20 */
- "DIGIT", /* 0x21 */
- "DIGITL", /* 0x22 */
- "DIGITU", /* 0x23 */
- "NDIGIT", /* 0x24 */
- "NDIGITL", /* 0x25 */
- "NDIGITU", /* 0x26 */
- "CLUMP", /* 0x27 */
- "BRANCH", /* 0x28 */
- "BACK", /* 0x29 */
- "EXACT", /* 0x2a */
- "EXACTF", /* 0x2b */
- "EXACTFL", /* 0x2c */
- "EXACTFU", /* 0x2d */
- "NOTHING", /* 0x2e */
- "TAIL", /* 0x2f */
- "STAR", /* 0x30 */
- "PLUS", /* 0x31 */
- "CURLY", /* 0x32 */
- "CURLYN", /* 0x33 */
- "CURLYM", /* 0x34 */
- "CURLYX", /* 0x35 */
- "WHILEM", /* 0x36 */
- "OPEN", /* 0x37 */
- "CLOSE", /* 0x38 */
- "REF", /* 0x39 */
- "REFF", /* 0x3a */
- "REFFL", /* 0x3b */
- "REFFU", /* 0x3c */
+ "ANYOF", /* 0x12 */
+ "ANYOFD", /* 0x13 */
+ "ANYOFL", /* 0x14 */
+ "ANYOFM", /* 0x15 */
+ "POSIXD", /* 0x16 */
+ "POSIXL", /* 0x17 */
+ "POSIXU", /* 0x18 */
+ "POSIXA", /* 0x19 */
+ "NPOSIXD", /* 0x1a */
+ "NPOSIXL", /* 0x1b */
+ "NPOSIXU", /* 0x1c */
+ "NPOSIXA", /* 0x1d */
+ "ASCII", /* 0x1e */
+ "NASCII", /* 0x1f */
+ "CLUMP", /* 0x20 */
+ "BRANCH", /* 0x21 */
+ "EXACT", /* 0x22 */
+ "EXACTL", /* 0x23 */
+ "EXACTF", /* 0x24 */
+ "EXACTFL", /* 0x25 */
+ "EXACTFU", /* 0x26 */
+ "EXACTFAA", /* 0x27 */
+ "EXACTFU_SS", /* 0x28 */
+ "EXACTFLU8", /* 0x29 */
+ "EXACTFAA_NO_TRIE", /* 0x2a */
+ "NOTHING", /* 0x2b */
+ "TAIL", /* 0x2c */
+ "STAR", /* 0x2d */
+ "PLUS", /* 0x2e */
+ "CURLY", /* 0x2f */
+ "CURLYN", /* 0x30 */
+ "CURLYM", /* 0x31 */
+ "CURLYX", /* 0x32 */
+ "WHILEM", /* 0x33 */
+ "OPEN", /* 0x34 */
+ "CLOSE", /* 0x35 */
+ "SROPEN", /* 0x36 */
+ "SRCLOSE", /* 0x37 */
+ "REF", /* 0x38 */
+ "REFF", /* 0x39 */
+ "REFFL", /* 0x3a */
+ "REFFU", /* 0x3b */
+ "REFFA", /* 0x3c */
"NREF", /* 0x3d */
"NREFF", /* 0x3e */
"NREFFL", /* 0x3f */
"NREFFU", /* 0x40 */
- "IFMATCH", /* 0x41 */
- "UNLESSM", /* 0x42 */
- "SUSPEND", /* 0x43 */
- "IFTHEN", /* 0x44 */
- "GROUPP", /* 0x45 */
- "LONGJMP", /* 0x46 */
- "BRANCHJ", /* 0x47 */
- "EVAL", /* 0x48 */
- "MINMOD", /* 0x49 */
- "LOGICAL", /* 0x4a */
- "RENUM", /* 0x4b */
- "TRIE", /* 0x4c */
- "TRIEC", /* 0x4d */
- "AHOCORASICK", /* 0x4e */
- "AHOCORASICKC", /* 0x4f */
- "GOSUB", /* 0x50 */
- "GOSTART", /* 0x51 */
+ "NREFFA", /* 0x41 */
+ "LONGJMP", /* 0x42 */
+ "BRANCHJ", /* 0x43 */
+ "IFMATCH", /* 0x44 */
+ "UNLESSM", /* 0x45 */
+ "SUSPEND", /* 0x46 */
+ "IFTHEN", /* 0x47 */
+ "GROUPP", /* 0x48 */
+ "EVAL", /* 0x49 */
+ "MINMOD", /* 0x4a */
+ "LOGICAL", /* 0x4b */
+ "RENUM", /* 0x4c */
+ "TRIE", /* 0x4d */
+ "TRIEC", /* 0x4e */
+ "AHOCORASICK", /* 0x4f */
+ "AHOCORASICKC", /* 0x50 */
+ "GOSUB", /* 0x51 */
"NGROUPP", /* 0x52 */
"INSUBP", /* 0x53 */
"DEFINEP", /* 0x54 */
"CUTGROUP", /* 0x5d */
"KEEPS", /* 0x5e */
"LNBREAK", /* 0x5f */
- "VERTWS", /* 0x60 */
- "NVERTWS", /* 0x61 */
- "HORIZWS", /* 0x62 */
- "NHORIZWS", /* 0x63 */
- "FOLDCHAR", /* 0x64 */
- "OPTIMIZED", /* 0x65 */
- "PSEUDO", /* 0x66 */
+ "OPTIMIZED", /* 0x60 */
+ "PSEUDO", /* 0x61 */
/* ------------ 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 */
+ "EVAL_B", /* REGNODE_MAX +0x03 */
+ "EVAL_B_fail", /* REGNODE_MAX +0x04 */
+ "EVAL_postponed_AB", /* REGNODE_MAX +0x05 */
+ "EVAL_postponed_AB_fail", /* REGNODE_MAX +0x06 */
+ "CURLYX_end", /* REGNODE_MAX +0x07 */
+ "CURLYX_end_fail", /* REGNODE_MAX +0x08 */
+ "WHILEM_A_pre", /* REGNODE_MAX +0x09 */
+ "WHILEM_A_pre_fail", /* REGNODE_MAX +0x0a */
+ "WHILEM_A_min", /* REGNODE_MAX +0x0b */
+ "WHILEM_A_min_fail", /* REGNODE_MAX +0x0c */
+ "WHILEM_A_max", /* REGNODE_MAX +0x0d */
+ "WHILEM_A_max_fail", /* REGNODE_MAX +0x0e */
+ "WHILEM_B_min", /* REGNODE_MAX +0x0f */
+ "WHILEM_B_min_fail", /* REGNODE_MAX +0x10 */
+ "WHILEM_B_max", /* REGNODE_MAX +0x11 */
+ "WHILEM_B_max_fail", /* REGNODE_MAX +0x12 */
+ "BRANCH_next", /* REGNODE_MAX +0x13 */
+ "BRANCH_next_fail", /* REGNODE_MAX +0x14 */
+ "CURLYM_A", /* REGNODE_MAX +0x15 */
+ "CURLYM_A_fail", /* REGNODE_MAX +0x16 */
+ "CURLYM_B", /* REGNODE_MAX +0x17 */
+ "CURLYM_B_fail", /* REGNODE_MAX +0x18 */
+ "IFMATCH_A", /* REGNODE_MAX +0x19 */
+ "IFMATCH_A_fail", /* REGNODE_MAX +0x1a */
+ "CURLY_B_min_known", /* REGNODE_MAX +0x1b */
+ "CURLY_B_min_known_fail", /* REGNODE_MAX +0x1c */
+ "CURLY_B_min", /* REGNODE_MAX +0x1d */
+ "CURLY_B_min_fail", /* REGNODE_MAX +0x1e */
+ "CURLY_B_max", /* REGNODE_MAX +0x1f */
+ "CURLY_B_max_fail", /* REGNODE_MAX +0x20 */
+ "COMMIT_next", /* REGNODE_MAX +0x21 */
+ "COMMIT_next_fail", /* REGNODE_MAX +0x22 */
+ "MARKPOINT_next", /* REGNODE_MAX +0x23 */
+ "MARKPOINT_next_fail", /* REGNODE_MAX +0x24 */
+ "SKIP_next", /* REGNODE_MAX +0x25 */
+ "SKIP_next_fail", /* REGNODE_MAX +0x26 */
+ "CUTGROUP_next", /* REGNODE_MAX +0x27 */
+ "CUTGROUP_next_fail", /* REGNODE_MAX +0x28 */
+ "KEEPS_next", /* REGNODE_MAX +0x29 */
+ "KEEPS_next_fail", /* REGNODE_MAX +0x2a */
};
#endif /* DOINIT */
EXTCONST char * PL_reg_extflags_name[];
#else
EXTCONST char * const PL_reg_extflags_name[] = {
- /* Bits in extflags defined: 11111111111111111111111001111111 */
+ /* Bits in extflags defined: 11111111111111110000111111111111 */
"MULTILINE", /* 0x00000001 */
"SINGLELINE", /* 0x00000002 */
"FOLD", /* 0x00000004 */
"EXTENDED", /* 0x00000008 */
- "KEEPCOPY", /* 0x00000010 */
- "CHARSET", /* 0x00000060 */
- "CHARSET", /* 0x00000060 */
- "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 */
+ "EXTENDED_MORE", /* 0x00000010 */
+ "NOCAPTURE", /* 0x00000020 */
+ "KEEPCOPY", /* 0x00000040 */
+ "CHARSET0", /* 0x00000080 : "CHARSET" - 0x00000380 */
+ "CHARSET1", /* 0x00000100 : "CHARSET" - 0x00000380 */
+ "CHARSET2", /* 0x00000200 : "CHARSET" - 0x00000380 */
+ "STRICT", /* 0x00000400 */
+ "SPLIT", /* 0x00000800 */
+ "UNUSED_BIT_12", /* 0x00001000 */
+ "UNUSED_BIT_13", /* 0x00002000 */
+ "UNUSED_BIT_14", /* 0x00004000 */
+ "UNUSED_BIT_15", /* 0x00008000 */
+ "NO_INPLACE_SUBST", /* 0x00010000 */
+ "EVAL_SEEN", /* 0x00020000 */
+ "UNBOUNDED_QUANTIFIER_SEEN",/* 0x00040000 */
"CHECK_ALL", /* 0x00080000 */
"MATCH_UTF8", /* 0x00100000 */
"USE_INTUIT_NOML", /* 0x00200000 */
"USE_INTUIT_ML", /* 0x00400000 */
"INTUIT_TAIL", /* 0x00800000 */
- "SPLIT", /* 0x01000000 */
+ "IS_ANCHORED", /* 0x01000000 */
"COPY_DONE", /* 0x02000000 */
"TAINTED_SEEN", /* 0x04000000 */
"TAINTED", /* 0x08000000 */
};
#endif /* DOINIT */
+#ifdef DEBUGGING
+# define REG_EXTFLAGS_NAME_SIZE 32
+#endif
+
+/* 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'" */
+ "NOSCAN", /* 0x00000040 - PREGf_NOSCAN */
+ "GPOS_SEEN", /* 0x00000100 - PREGf_GPOS_SEEN */
+ "GPOS_FLOAT", /* 0x00000200 - PREGf_GPOS_FLOAT */
+ "ANCH_MBOL", /* 0x00000400 - PREGf_ANCH_MBOL */
+ "ANCH_SBOL", /* 0x00000800 - PREGf_ANCH_SBOL */
+ "ANCH_GPOS", /* 0x00001000 - PREGf_ANCH_GPOS */
+ "RECURSE_SEEN", /* 0x00002000 - PREGf_RECURSE_SEEN */
+};
+#endif /* DOINIT */
+
+#ifdef DEBUGGING
+# define REG_INTFLAGS_NAME_SIZE 13
+#endif
+
/* 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)))
EXTCONST U8 PL_varies[] __attribute__deprecated__;
#else
EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
- ANYOFV, CLUMP, BRANCH, BACK, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX,
- WHILEM, REF, REFF, REFFL, REFFU, NREF, NREFF, NREFFL, NREFFU, SUSPEND,
- IFTHEN, BRANCHJ,
+ CLUMP, BRANCH, STAR, PLUS, CURLY, CURLYN, CURLYM, CURLYX, WHILEM, REF,
+ REFF, REFFL, REFFU, REFFA, NREF, NREFF, NREFFL, NREFFU, NREFFA,
+ BRANCHJ, SUSPEND, IFTHEN,
0
};
#endif /* DOINIT */
EXTCONST U8 PL_varies_bitmask[];
#else
EXTCONST U8 PL_varies_bitmask[] = {
- 0x00, 0x00, 0x10, 0x00, 0x80, 0x03, 0x7F, 0xFE, 0x99, 0x00, 0x00, 0x00, 0x00
+ 0x00, 0x00, 0x00, 0x00, 0x03, 0xE0, 0x0F, 0xFF, 0xCB, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
EXTCONST U8 PL_simple[] __attribute__deprecated__;
#else
EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
- REG_ANY, SANY, CANY, ANYOF, ALNUM, ALNUML, ALNUMU, NALNUM, NALNUML,
- NALNUMU, SPACE, SPACEL, SPACEU, NSPACE, NSPACEL, NSPACEU, DIGIT,
- DIGITL, DIGITU, NDIGIT, NDIGITL, NDIGITU, VERTWS, NVERTWS, HORIZWS,
- NHORIZWS,
+ REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFM, POSIXD, POSIXL, POSIXU,
+ POSIXA, NPOSIXD, NPOSIXL, NPOSIXU, NPOSIXA, ASCII, NASCII,
0
};
#endif /* DOINIT */
EXTCONST U8 PL_simple_bitmask[];
#else
EXTCONST U8 PL_simple_bitmask[] = {
- 0x00, 0x00, 0xEF, 0xFF, 0x7F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0F
+ 0x00, 0x00, 0xFF, 0xFF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
https://perl5.git.perl.org / perl5.git / blobdiff