summaryrefslogtreecommitdiff
path: root/systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h
diff options
context:
space:
mode:
Diffstat (limited to 'systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h')
-rw-r--r--systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h435
1 files changed, 225 insertions, 210 deletions
diff --git a/systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h b/systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h
index 69f3e38cdb..ba691a2c18 100644
--- a/systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h
+++ b/systems/texlive/tlnet/tlpkg/tlperl/lib/CORE/regnodes.h
@@ -6,8 +6,8 @@
/* Regops and State definitions */
-#define REGNODE_MAX 97
-#define REGMATCH_STATE_MAX 139
+#define REGNODE_MAX 101
+#define REGMATCH_STATE_MAX 141
#define END 0 /* 0000 End of program. */
#define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
@@ -21,94 +21,98 @@
#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 BOUNDU 10 /* 0x0a Match "" at any boundary of a given type using /u 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 NBOUNDU 14 /* 0x0e Match "" at any non-boundary of a given type using using /u 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 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 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 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 (?!), 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 SKIP 91 /* 0x5b On failure skip forward (to the mark) before retrying */
-#define COMMIT 92 /* 0x5c Pattern fails outright if backtracking through this */
-#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 OPTIMIZED 96 /* 0x60 Placeholder for dump. */
-#define PSEUDO 97 /* 0x61 Pseudo opcode for internal use. */
+#define ANYOFPOSIXL 21 /* 0x15 Like ANYOFL, but matches [[:posix:]] classes */
+#define ANYOFH 22 /* 0x16 Like ANYOF, but only has "High" matches, none in the bitmap; non-zero flags "f" means "f" is the first UTF-8 byte shared in common by all code points matched */
+#define ANYOFM 23 /* 0x17 Like ANYOF, but matches an invariant byte as determined by the mask and arg */
+#define NANYOFM 24 /* 0x18 complement of ANYOFM */
+#define POSIXD 25 /* 0x19 Some [[:class:]] under /d; the FLAGS field gives which one */
+#define POSIXL 26 /* 0x1a Some [[:class:]] under /l; the FLAGS field gives which one */
+#define POSIXU 27 /* 0x1b Some [[:class:]] under /u; the FLAGS field gives which one */
+#define POSIXA 28 /* 0x1c Some [[:class:]] under /a; the FLAGS field gives which one */
+#define NPOSIXD 29 /* 0x1d complement of POSIXD, [[:^class:]] */
+#define NPOSIXL 30 /* 0x1e complement of POSIXL, [[:^class:]] */
+#define NPOSIXU 31 /* 0x1f complement of POSIXU, [[:^class:]] */
+#define NPOSIXA 32 /* 0x20 complement of POSIXA, [[:^class:]] */
+#define CLUMP 33 /* 0x21 Match any extended grapheme cluster sequence */
+#define BRANCH 34 /* 0x22 Match this alternative, or the next... */
+#define EXACT 35 /* 0x23 Match this string (preceded by length). */
+#define EXACTL 36 /* 0x24 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */
+#define EXACTF 37 /* 0x25 Match this string using /id rules (w/len); (string not UTF-8, not guaranteed to be folded). */
+#define EXACTFL 38 /* 0x26 Match this string using /il rules (w/len); (string not guaranteed to be folded). */
+#define EXACTFU 39 /* 0x27 Match this string using /iu rules (w/len); (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
+#define EXACTFAA 40 /* 0x28 Match this string using /iaa rules (w/len) (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
+#define EXACTFUP 41 /* 0x29 Match this string using /iu rules (w/len); (string not UTF-8, not guaranteed to be folded; and its Problematic). */
+#define EXACTFLU8 42 /* 0x2a Like EXACTFU, but use /il, UTF-8, folded, and everything in it is above 255. */
+#define EXACTFAA_NO_TRIE 43 /* 0x2b Match this string using /iaa rules (w/len) (string not UTF-8, not guaranteed to be folded, not currently trie-able). */
+#define EXACT_ONLY8 44 /* 0x2c Like EXACT, but only UTF-8 encoded targets can match */
+#define EXACTFU_ONLY8 45 /* 0x2d Like EXACTFU, but only UTF-8 encoded targets can match */
+#define EXACTFU_S_EDGE 46 /* 0x2e /di rules, but nothing in it precludes /ui, except begins and/or ends with [Ss]; (string not UTF-8; compile-time only). */
+#define NOTHING 47 /* 0x2f Match empty string. */
+#define TAIL 48 /* 0x30 Match empty string. Can jump here from outside. */
+#define STAR 49 /* 0x31 Match this (simple) thing 0 or more times. */
+#define PLUS 50 /* 0x32 Match this (simple) thing 1 or more times. */
+#define CURLY 51 /* 0x33 Match this simple thing {n,m} times. */
+#define CURLYN 52 /* 0x34 Capture next-after-this simple thing */
+#define CURLYM 53 /* 0x35 Capture this medium-complex thing {n,m} times. */
+#define CURLYX 54 /* 0x36 Match this complex thing {n,m} times. */
+#define WHILEM 55 /* 0x37 Do curly processing and see if rest matches. */
+#define OPEN 56 /* 0x38 Mark this point in input as start of #n. */
+#define CLOSE 57 /* 0x39 Close corresponding OPEN of #n. */
+#define SROPEN 58 /* 0x3a Same as OPEN, but for script run */
+#define SRCLOSE 59 /* 0x3b Close preceding SROPEN */
+#define REF 60 /* 0x3c Match some already matched string */
+#define REFF 61 /* 0x3d Match already matched string, using /di rules. */
+#define REFFL 62 /* 0x3e Match already matched string, using /li rules. */
+#define REFFU 63 /* 0x3f Match already matched string, usng /ui. */
+#define REFFA 64 /* 0x40 Match already matched string, using /aai rules. */
+#define NREF 65 /* 0x41 Match some already matched string */
+#define NREFF 66 /* 0x42 Match already matched string, using /di rules. */
+#define NREFFL 67 /* 0x43 Match already matched string, using /li rules. */
+#define NREFFU 68 /* 0x44 Match already matched string, using /ui rules. */
+#define NREFFA 69 /* 0x45 Match already matched string, using /aai rules. */
+#define LONGJMP 70 /* 0x46 Jump far away. */
+#define BRANCHJ 71 /* 0x47 BRANCH with long offset. */
+#define IFMATCH 72 /* 0x48 Succeeds if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
+#define UNLESSM 73 /* 0x49 Fails if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
+#define SUSPEND 74 /* 0x4a "Independent" sub-RE. */
+#define IFTHEN 75 /* 0x4b Switch, should be preceded by switcher. */
+#define GROUPP 76 /* 0x4c Whether the group matched. */
+#define EVAL 77 /* 0x4d Execute some Perl code. */
+#define MINMOD 78 /* 0x4e Next operator is not greedy. */
+#define LOGICAL 79 /* 0x4f Next opcode should set the flag only. */
+#define RENUM 80 /* 0x50 Group with independently numbered parens. */
+#define TRIE 81 /* 0x51 Match many EXACT(F[ALU]?)? at once. flags==type */
+#define TRIEC 82 /* 0x52 Same as TRIE, but with embedded charclass data */
+#define AHOCORASICK 83 /* 0x53 Aho Corasick stclass. flags==type */
+#define AHOCORASICKC 84 /* 0x54 Same as AHOCORASICK, but with embedded charclass data */
+#define GOSUB 85 /* 0x55 recurse to paren arg1 at (signed) ofs arg2 */
+#define NGROUPP 86 /* 0x56 Whether the group matched. */
+#define INSUBP 87 /* 0x57 Whether we are in a specific recurse. */
+#define DEFINEP 88 /* 0x58 Never execute directly. */
+#define ENDLIKE 89 /* 0x59 Used only for the type field of verbs */
+#define OPFAIL 90 /* 0x5a Same as (?!), but with verb arg */
+#define ACCEPT 91 /* 0x5b Accepts the current matched string, with verbar */
+#define VERB 92 /* 0x5c Used only for the type field of verbs */
+#define PRUNE 93 /* 0x5d Pattern fails at this startpoint if no-backtracking through this */
+#define MARKPOINT 94 /* 0x5e Push the current location for rollback by cut. */
+#define SKIP 95 /* 0x5f On failure skip forward (to the mark) before retrying */
+#define COMMIT 96 /* 0x60 Pattern fails outright if backtracking through this */
+#define CUTGROUP 97 /* 0x61 On failure go to the next alternation in the group */
+#define KEEPS 98 /* 0x62 $& begins here. */
+#define LNBREAK 99 /* 0x63 generic newline pattern */
+#define OPTIMIZED 100 /* 0x64 Placeholder for dump. */
+#define PSEUDO 101 /* 0x65 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 */
@@ -136,22 +140,20 @@
#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 */
+#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. */
@@ -180,7 +182,10 @@ EXTCONST U8 PL_regkind[] = {
ANYOF, /* ANYOF */
ANYOF, /* ANYOFD */
ANYOF, /* ANYOFL */
+ ANYOF, /* ANYOFPOSIXL */
+ ANYOF, /* ANYOFH */
ANYOFM, /* ANYOFM */
+ ANYOFM, /* NANYOFM */
POSIXD, /* POSIXD */
POSIXD, /* POSIXL */
POSIXD, /* POSIXU */
@@ -189,8 +194,6 @@ EXTCONST U8 PL_regkind[] = {
NPOSIXD, /* NPOSIXL */
NPOSIXD, /* NPOSIXU */
NPOSIXD, /* NPOSIXA */
- ASCII, /* ASCII */
- ASCII, /* NASCII */
CLUMP, /* CLUMP */
BRANCH, /* BRANCH */
EXACT, /* EXACT */
@@ -199,9 +202,12 @@ EXTCONST U8 PL_regkind[] = {
EXACT, /* EXACTFL */
EXACT, /* EXACTFU */
EXACT, /* EXACTFAA */
- EXACT, /* EXACTFU_SS */
+ EXACT, /* EXACTFUP */
EXACT, /* EXACTFLU8 */
EXACT, /* EXACTFAA_NO_TRIE */
+ EXACT, /* EXACT_ONLY8 */
+ EXACT, /* EXACTFU_ONLY8 */
+ EXACT, /* EXACTFU_S_EDGE */
NOTHING, /* NOTHING */
NOTHING, /* TAIL */
STAR, /* STAR */
@@ -284,8 +290,6 @@ EXTCONST U8 PL_regkind[] = {
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 */
@@ -326,10 +330,13 @@ static const U8 regarglen[] = {
0, /* NBOUNDA */
0, /* REG_ANY */
0, /* SANY */
- EXTRA_SIZE(struct regnode_1), /* ANYOF */
- EXTRA_SIZE(struct regnode_1), /* ANYOFD */
- EXTRA_SIZE(struct regnode_1), /* ANYOFL */
+ EXTRA_SIZE(struct regnode_charclass), /* ANYOF */
+ EXTRA_SIZE(struct regnode_charclass), /* ANYOFD */
+ EXTRA_SIZE(struct regnode_charclass), /* ANYOFL */
+ EXTRA_SIZE(struct regnode_charclass_posixl), /* ANYOFPOSIXL */
+ EXTRA_SIZE(struct regnode_1), /* ANYOFH */
EXTRA_SIZE(struct regnode_1), /* ANYOFM */
+ EXTRA_SIZE(struct regnode_1), /* NANYOFM */
0, /* POSIXD */
0, /* POSIXL */
0, /* POSIXU */
@@ -338,8 +345,6 @@ static const U8 regarglen[] = {
0, /* NPOSIXL */
0, /* NPOSIXU */
0, /* NPOSIXA */
- 0, /* ASCII */
- 0, /* NASCII */
0, /* CLUMP */
0, /* BRANCH */
0, /* EXACT */
@@ -348,9 +353,12 @@ static const U8 regarglen[] = {
0, /* EXACTFL */
0, /* EXACTFU */
0, /* EXACTFAA */
- 0, /* EXACTFU_SS */
+ 0, /* EXACTFUP */
0, /* EXACTFLU8 */
0, /* EXACTFAA_NO_TRIE */
+ 0, /* EXACT_ONLY8 */
+ 0, /* EXACTFU_ONLY8 */
+ 0, /* EXACTFU_S_EDGE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
@@ -432,7 +440,10 @@ static const char reg_off_by_arg[] = {
0, /* ANYOF */
0, /* ANYOFD */
0, /* ANYOFL */
+ 0, /* ANYOFPOSIXL */
+ 0, /* ANYOFH */
0, /* ANYOFM */
+ 0, /* NANYOFM */
0, /* POSIXD */
0, /* POSIXL */
0, /* POSIXU */
@@ -441,8 +452,6 @@ static const char reg_off_by_arg[] = {
0, /* NPOSIXL */
0, /* NPOSIXU */
0, /* NPOSIXA */
- 0, /* ASCII */
- 0, /* NASCII */
0, /* CLUMP */
0, /* BRANCH */
0, /* EXACT */
@@ -451,9 +460,12 @@ static const char reg_off_by_arg[] = {
0, /* EXACTFL */
0, /* EXACTFU */
0, /* EXACTFAA */
- 0, /* EXACTFU_SS */
+ 0, /* EXACTFUP */
0, /* EXACTFLU8 */
0, /* EXACTFAA_NO_TRIE */
+ 0, /* EXACT_ONLY8 */
+ 0, /* EXACTFU_ONLY8 */
+ 0, /* EXACTFU_S_EDGE */
0, /* NOTHING */
0, /* TAIL */
0, /* STAR */
@@ -479,8 +491,8 @@ static const char reg_off_by_arg[] = {
0, /* NREFFA */
1, /* LONGJMP */
1, /* BRANCHJ */
- 2, /* IFMATCH */
- 2, /* UNLESSM */
+ 1, /* IFMATCH */
+ 1, /* UNLESSM */
1, /* SUSPEND */
1, /* IFTHEN */
0, /* GROUPP */
@@ -541,83 +553,87 @@ EXTCONST char * const PL_reg_name[] = {
"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 */
- "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 */
- "ENDLIKE", /* 0x55 */
- "OPFAIL", /* 0x56 */
- "ACCEPT", /* 0x57 */
- "VERB", /* 0x58 */
- "PRUNE", /* 0x59 */
- "MARKPOINT", /* 0x5a */
- "SKIP", /* 0x5b */
- "COMMIT", /* 0x5c */
- "CUTGROUP", /* 0x5d */
- "KEEPS", /* 0x5e */
- "LNBREAK", /* 0x5f */
- "OPTIMIZED", /* 0x60 */
- "PSEUDO", /* 0x61 */
+ "ANYOFPOSIXL", /* 0x15 */
+ "ANYOFH", /* 0x16 */
+ "ANYOFM", /* 0x17 */
+ "NANYOFM", /* 0x18 */
+ "POSIXD", /* 0x19 */
+ "POSIXL", /* 0x1a */
+ "POSIXU", /* 0x1b */
+ "POSIXA", /* 0x1c */
+ "NPOSIXD", /* 0x1d */
+ "NPOSIXL", /* 0x1e */
+ "NPOSIXU", /* 0x1f */
+ "NPOSIXA", /* 0x20 */
+ "CLUMP", /* 0x21 */
+ "BRANCH", /* 0x22 */
+ "EXACT", /* 0x23 */
+ "EXACTL", /* 0x24 */
+ "EXACTF", /* 0x25 */
+ "EXACTFL", /* 0x26 */
+ "EXACTFU", /* 0x27 */
+ "EXACTFAA", /* 0x28 */
+ "EXACTFUP", /* 0x29 */
+ "EXACTFLU8", /* 0x2a */
+ "EXACTFAA_NO_TRIE", /* 0x2b */
+ "EXACT_ONLY8", /* 0x2c */
+ "EXACTFU_ONLY8", /* 0x2d */
+ "EXACTFU_S_EDGE", /* 0x2e */
+ "NOTHING", /* 0x2f */
+ "TAIL", /* 0x30 */
+ "STAR", /* 0x31 */
+ "PLUS", /* 0x32 */
+ "CURLY", /* 0x33 */
+ "CURLYN", /* 0x34 */
+ "CURLYM", /* 0x35 */
+ "CURLYX", /* 0x36 */
+ "WHILEM", /* 0x37 */
+ "OPEN", /* 0x38 */
+ "CLOSE", /* 0x39 */
+ "SROPEN", /* 0x3a */
+ "SRCLOSE", /* 0x3b */
+ "REF", /* 0x3c */
+ "REFF", /* 0x3d */
+ "REFFL", /* 0x3e */
+ "REFFU", /* 0x3f */
+ "REFFA", /* 0x40 */
+ "NREF", /* 0x41 */
+ "NREFF", /* 0x42 */
+ "NREFFL", /* 0x43 */
+ "NREFFU", /* 0x44 */
+ "NREFFA", /* 0x45 */
+ "LONGJMP", /* 0x46 */
+ "BRANCHJ", /* 0x47 */
+ "IFMATCH", /* 0x48 */
+ "UNLESSM", /* 0x49 */
+ "SUSPEND", /* 0x4a */
+ "IFTHEN", /* 0x4b */
+ "GROUPP", /* 0x4c */
+ "EVAL", /* 0x4d */
+ "MINMOD", /* 0x4e */
+ "LOGICAL", /* 0x4f */
+ "RENUM", /* 0x50 */
+ "TRIE", /* 0x51 */
+ "TRIEC", /* 0x52 */
+ "AHOCORASICK", /* 0x53 */
+ "AHOCORASICKC", /* 0x54 */
+ "GOSUB", /* 0x55 */
+ "NGROUPP", /* 0x56 */
+ "INSUBP", /* 0x57 */
+ "DEFINEP", /* 0x58 */
+ "ENDLIKE", /* 0x59 */
+ "OPFAIL", /* 0x5a */
+ "ACCEPT", /* 0x5b */
+ "VERB", /* 0x5c */
+ "PRUNE", /* 0x5d */
+ "MARKPOINT", /* 0x5e */
+ "SKIP", /* 0x5f */
+ "COMMIT", /* 0x60 */
+ "CUTGROUP", /* 0x61 */
+ "KEEPS", /* 0x62 */
+ "LNBREAK", /* 0x63 */
+ "OPTIMIZED", /* 0x64 */
+ "PSEUDO", /* 0x65 */
/* ------------ States ------------- */
"TRIE_next", /* REGNODE_MAX +0x01 */
"TRIE_next_fail", /* REGNODE_MAX +0x02 */
@@ -645,22 +661,20 @@ EXTCONST char * const PL_reg_name[] = {
"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 */
+ "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 */
@@ -754,7 +768,7 @@ EXTCONST U8 PL_varies[] __attribute__deprecated__ = {
EXTCONST U8 PL_varies_bitmask[];
#else
EXTCONST U8 PL_varies_bitmask[] = {
- 0x00, 0x00, 0x00, 0x00, 0x03, 0xE0, 0x0F, 0xFF, 0xCB, 0x00, 0x00, 0x00, 0x00
+ 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0xFE, 0xF0, 0xBF, 0x0C, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
@@ -766,8 +780,9 @@ EXTCONST U8 PL_varies_bitmask[] = {
EXTCONST U8 PL_simple[] __attribute__deprecated__;
#else
EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
- REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFM, POSIXD, POSIXL, POSIXU,
- POSIXA, NPOSIXD, NPOSIXL, NPOSIXU, NPOSIXA, ASCII, NASCII,
+ REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFPOSIXL, ANYOFH, ANYOFM,
+ NANYOFM, POSIXD, POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL, NPOSIXU,
+ NPOSIXA,
0
};
#endif /* DOINIT */
@@ -776,7 +791,7 @@ EXTCONST U8 PL_simple[] __attribute__deprecated__ = {
EXTCONST U8 PL_simple_bitmask[];
#else
EXTCONST U8 PL_simple_bitmask[] = {
- 0x00, 0x00, 0xFF, 0xFF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+ 0x00, 0x00, 0xFF, 0xFF, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */