X-Git-Url: https://perl5.git.perl.org/perl5.git/blobdiff_plain/fee505829585692618c3f9bb28a8f0464553ec94..a9cea67c10bc154f974a3207d7ce3f81611266bc:/regnodes.h diff --git a/regnodes.h b/regnodes.h index c05003d..412a630 100644 --- a/regnodes.h +++ b/regnodes.h @@ -6,8 +6,8 @@ /* Regops and State definitions */ -#define REGNODE_MAX 93 -#define REGMATCH_STATE_MAX 133 +#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. */ @@ -32,106 +32,114 @@ #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 POSIXD 21 /* 0x15 Some [[:class:]] under /d; the FLAGS field gives which one */ -#define POSIXL 22 /* 0x16 Some [[:class:]] under /l; the FLAGS field gives which one */ -#define POSIXU 23 /* 0x17 Some [[:class:]] under /u; the FLAGS field gives which one */ -#define POSIXA 24 /* 0x18 Some [[:class:]] under /a; the FLAGS field gives which one */ -#define NPOSIXD 25 /* 0x19 complement of POSIXD, [[:^class:]] */ -#define NPOSIXL 26 /* 0x1a complement of POSIXL, [[:^class:]] */ -#define NPOSIXU 27 /* 0x1b complement of POSIXU, [[:^class:]] */ -#define NPOSIXA 28 /* 0x1c complement of POSIXA, [[:^class:]] */ -#define CLUMP 29 /* 0x1d Match any extended grapheme cluster sequence */ -#define BRANCH 30 /* 0x1e Match this alternative, or the next... */ -#define EXACT 31 /* 0x1f Match this string (preceded by length). */ -#define EXACTL 32 /* 0x20 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */ -#define EXACTF 33 /* 0x21 Match this non-UTF-8 string (not guaranteed to be folded) using /id rules (w/len). */ -#define EXACTFL 34 /* 0x22 Match this string (not guaranteed to be folded) using /il rules (w/len). */ -#define EXACTFU 35 /* 0x23 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 36 /* 0x24 Match this string (not guaranteed to be folded) using /iaa rules (w/len). */ -#define EXACTFU_SS 37 /* 0x25 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 38 /* 0x26 Rare cirucmstances: like EXACTFU, but is under /l, UTF-8, folded, and everything in it is above 255. */ -#define EXACTFA_NO_TRIE 39 /* 0x27 Match this string (which is not trie-able; not guaranteed to be folded) using /iaa rules (w/len). */ -#define NOTHING 40 /* 0x28 Match empty string. */ -#define TAIL 41 /* 0x29 Match empty string. Can jump here from outside. */ -#define STAR 42 /* 0x2a Match this (simple) thing 0 or more times. */ -#define PLUS 43 /* 0x2b Match this (simple) thing 1 or more times. */ -#define CURLY 44 /* 0x2c Match this simple thing {n,m} times. */ -#define CURLYN 45 /* 0x2d Capture next-after-this simple thing */ -#define CURLYM 46 /* 0x2e Capture this medium-complex thing {n,m} times. */ -#define CURLYX 47 /* 0x2f Match this complex thing {n,m} times. */ -#define WHILEM 48 /* 0x30 Do curly processing and see if rest matches. */ -#define OPEN 49 /* 0x31 Mark this point in input as start of #n. */ -#define CLOSE 50 /* 0x32 Analogous to OPEN. */ -#define REF 51 /* 0x33 Match some already matched string */ -#define REFF 52 /* 0x34 Match already matched string, folded using native charset rules for non-utf8 */ -#define REFFL 53 /* 0x35 Match already matched string, folded in loc. */ -#define REFFU 54 /* 0x36 Match already matched string, folded using unicode rules for non-utf8 */ -#define REFFA 55 /* 0x37 Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */ -#define NREF 56 /* 0x38 Match some already matched string */ -#define NREFF 57 /* 0x39 Match already matched string, folded using native charset rules for non-utf8 */ -#define NREFFL 58 /* 0x3a Match already matched string, folded in loc. */ -#define NREFFU 59 /* 0x3b Match already matched string, folded using unicode rules for non-utf8 */ -#define NREFFA 60 /* 0x3c Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */ -#define LONGJMP 61 /* 0x3d Jump far away. */ -#define BRANCHJ 62 /* 0x3e BRANCH with long offset. */ -#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 EVAL 68 /* 0x44 Execute some Perl code. */ -#define MINMOD 69 /* 0x45 Next operator is not greedy. */ -#define LOGICAL 70 /* 0x46 Next opcode should set the flag only. */ -#define RENUM 71 /* 0x47 Group with independently numbered parens. */ -#define TRIE 72 /* 0x48 Match many EXACT(F[ALU]?)? at once. flags==type */ -#define TRIEC 73 /* 0x49 Same as TRIE, but with embedded charclass data */ -#define AHOCORASICK 74 /* 0x4a Aho Corasick stclass. flags==type */ -#define AHOCORASICKC 75 /* 0x4b Same as AHOCORASICK, but with embedded charclass data */ -#define GOSUB 76 /* 0x4c recurse to paren arg1 at (signed) ofs arg2 */ -#define GOSTART 77 /* 0x4d recurse to start of pattern */ -#define NGROUPP 78 /* 0x4e Whether the group matched. */ -#define INSUBP 79 /* 0x4f Whether we are in a specific recurse. */ -#define DEFINEP 80 /* 0x50 Never execute directly. */ -#define ENDLIKE 81 /* 0x51 Used only for the type field of verbs */ -#define OPFAIL 82 /* 0x52 Same as (?!), but with verb arg */ -#define ACCEPT 83 /* 0x53 Accepts the current matched string, with verbar */ -#define VERB 84 /* 0x54 Used only for the type field of verbs */ -#define PRUNE 85 /* 0x55 Pattern fails at this startpoint if no-backtracking through this */ -#define MARKPOINT 86 /* 0x56 Push the current location for rollback by cut. */ -#define SKIP 87 /* 0x57 On failure skip forward (to the mark) before retrying */ -#define COMMIT 88 /* 0x58 Pattern fails outright if backtracking through this */ -#define CUTGROUP 89 /* 0x59 On failure go to the next alternation in the group */ -#define KEEPS 90 /* 0x5a $& begins here. */ -#define LNBREAK 91 /* 0x5b generic newline pattern */ -#define OPTIMIZED 92 /* 0x5c Placeholder for dump. */ -#define PSEUDO 93 /* 0x5d 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 */ +#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, folded using native charset rules for non-utf8 */ +#define REFFL 62 /* 0x3e Match already matched string, folded in loc. */ +#define REFFU 63 /* 0x3f Match already matched string, folded using unicode rules for non-utf8 */ +#define REFFA 64 /* 0x40 Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */ +#define NREF 65 /* 0x41 Match some already matched string */ +#define NREFF 66 /* 0x42 Match already matched string, folded using native charset rules for non-utf8 */ +#define NREFFL 67 /* 0x43 Match already matched string, folded in loc. */ +#define NREFFU 68 /* 0x44 Match already matched string, folded using unicode rules for non-utf8 */ +#define NREFFA 69 /* 0x45 Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII */ +#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" means lookbehind assertion starting "f" characters before current */ +#define UNLESSM 73 /* 0x49 Fails if the following matches; non-zero flags "f" means lookbehind assertion starting "f" 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 */ -#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 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 (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 */ @@ -174,6 +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,10 +201,13 @@ EXTCONST U8 PL_regkind[] = { EXACT, /* EXACTF */ EXACT, /* EXACTFL */ EXACT, /* EXACTFU */ - EXACT, /* EXACTFA */ - EXACT, /* EXACTFU_SS */ + EXACT, /* EXACTFAA */ + EXACT, /* EXACTFUP */ EXACT, /* EXACTFLU8 */ - EXACT, /* EXACTFA_NO_TRIE */ + EXACT, /* EXACTFAA_NO_TRIE */ + EXACT, /* EXACT_ONLY8 */ + EXACT, /* EXACTFU_ONLY8 */ + EXACT, /* EXACTFU_S_EDGE */ NOTHING, /* NOTHING */ NOTHING, /* TAIL */ STAR, /* STAR */ @@ -204,6 +219,8 @@ EXTCONST U8 PL_regkind[] = { WHILEM, /* WHILEM */ OPEN, /* OPEN */ CLOSE, /* CLOSE */ + SROPEN, /* SROPEN */ + SRCLOSE, /* SRCLOSE */ REF, /* REF */ REF, /* REFF */ REF, /* REFFL */ @@ -230,7 +247,6 @@ EXTCONST U8 PL_regkind[] = { TRIE, /* AHOCORASICK */ TRIE, /* AHOCORASICKC */ GOSUB, /* GOSUB */ - GOSTART, /* GOSTART */ NGROUPP, /* NGROUPP */ INSUBP, /* INSUBP */ DEFINEP, /* DEFINEP */ @@ -250,8 +266,10 @@ EXTCONST U8 PL_regkind[] = { /* ------------ 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 */ @@ -272,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 */ @@ -291,9 +307,10 @@ EXTCONST U8 PL_regkind[] = { }; #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 */ @@ -313,9 +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 */ @@ -331,10 +352,13 @@ static const U8 regarglen[] = { 0, /* EXACTF */ 0, /* EXACTFL */ 0, /* EXACTFU */ - 0, /* EXACTFA */ - 0, /* EXACTFU_SS */ + 0, /* EXACTFAA */ + 0, /* EXACTFUP */ 0, /* EXACTFLU8 */ - 0, /* EXACTFA_NO_TRIE */ + 0, /* EXACTFAA_NO_TRIE */ + 0, /* EXACT_ONLY8 */ + 0, /* EXACTFU_ONLY8 */ + 0, /* EXACTFU_S_EDGE */ 0, /* NOTHING */ 0, /* TAIL */ 0, /* STAR */ @@ -346,6 +370,8 @@ static const U8 regarglen[] = { 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 */ @@ -372,7 +398,6 @@ static const U8 regarglen[] = { 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 */ @@ -415,6 +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 */ @@ -430,10 +459,13 @@ static const char reg_off_by_arg[] = { 0, /* EXACTF */ 0, /* EXACTFL */ 0, /* EXACTFU */ - 0, /* EXACTFA */ - 0, /* EXACTFU_SS */ + 0, /* EXACTFAA */ + 0, /* EXACTFUP */ 0, /* EXACTFLU8 */ - 0, /* EXACTFA_NO_TRIE */ + 0, /* EXACTFAA_NO_TRIE */ + 0, /* EXACT_ONLY8 */ + 0, /* EXACTFU_ONLY8 */ + 0, /* EXACTFU_S_EDGE */ 0, /* NOTHING */ 0, /* TAIL */ 0, /* STAR */ @@ -445,6 +477,8 @@ static const char reg_off_by_arg[] = { 0, /* WHILEM */ 0, /* OPEN */ 0, /* CLOSE */ + 0, /* SROPEN */ + 0, /* SRCLOSE */ 0, /* REF */ 0, /* REFF */ 0, /* REFFL */ @@ -457,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 */ @@ -471,7 +505,6 @@ static const char reg_off_by_arg[] = { 0, /* AHOCORASICK */ 0, /* AHOCORASICKC */ 0, /* GOSUB */ - 0, /* GOSTART */ 0, /* NGROUPP */ 0, /* INSUBP */ 0, /* DEFINEP */ @@ -492,6 +525,7 @@ static const char reg_off_by_arg[] = { #endif /* REG_COMP_C */ + /* reg_name[] - Opcode/state names in string form, for debugging */ #ifndef DOINIT @@ -519,106 +553,114 @@ EXTCONST char * const PL_reg_name[] = { "ANYOF", /* 0x12 */ "ANYOFD", /* 0x13 */ "ANYOFL", /* 0x14 */ - "POSIXD", /* 0x15 */ - "POSIXL", /* 0x16 */ - "POSIXU", /* 0x17 */ - "POSIXA", /* 0x18 */ - "NPOSIXD", /* 0x19 */ - "NPOSIXL", /* 0x1a */ - "NPOSIXU", /* 0x1b */ - "NPOSIXA", /* 0x1c */ - "CLUMP", /* 0x1d */ - "BRANCH", /* 0x1e */ - "EXACT", /* 0x1f */ - "EXACTL", /* 0x20 */ - "EXACTF", /* 0x21 */ - "EXACTFL", /* 0x22 */ - "EXACTFU", /* 0x23 */ - "EXACTFA", /* 0x24 */ - "EXACTFU_SS", /* 0x25 */ - "EXACTFLU8", /* 0x26 */ - "EXACTFA_NO_TRIE", /* 0x27 */ - "NOTHING", /* 0x28 */ - "TAIL", /* 0x29 */ - "STAR", /* 0x2a */ - "PLUS", /* 0x2b */ - "CURLY", /* 0x2c */ - "CURLYN", /* 0x2d */ - "CURLYM", /* 0x2e */ - "CURLYX", /* 0x2f */ - "WHILEM", /* 0x30 */ - "OPEN", /* 0x31 */ - "CLOSE", /* 0x32 */ - "REF", /* 0x33 */ - "REFF", /* 0x34 */ - "REFFL", /* 0x35 */ - "REFFU", /* 0x36 */ - "REFFA", /* 0x37 */ - "NREF", /* 0x38 */ - "NREFF", /* 0x39 */ - "NREFFL", /* 0x3a */ - "NREFFU", /* 0x3b */ - "NREFFA", /* 0x3c */ - "LONGJMP", /* 0x3d */ - "BRANCHJ", /* 0x3e */ - "IFMATCH", /* 0x3f */ - "UNLESSM", /* 0x40 */ - "SUSPEND", /* 0x41 */ - "IFTHEN", /* 0x42 */ - "GROUPP", /* 0x43 */ - "EVAL", /* 0x44 */ - "MINMOD", /* 0x45 */ - "LOGICAL", /* 0x46 */ - "RENUM", /* 0x47 */ - "TRIE", /* 0x48 */ - "TRIEC", /* 0x49 */ - "AHOCORASICK", /* 0x4a */ - "AHOCORASICKC", /* 0x4b */ - "GOSUB", /* 0x4c */ - "GOSTART", /* 0x4d */ - "NGROUPP", /* 0x4e */ - "INSUBP", /* 0x4f */ - "DEFINEP", /* 0x50 */ - "ENDLIKE", /* 0x51 */ - "OPFAIL", /* 0x52 */ - "ACCEPT", /* 0x53 */ - "VERB", /* 0x54 */ - "PRUNE", /* 0x55 */ - "MARKPOINT", /* 0x56 */ - "SKIP", /* 0x57 */ - "COMMIT", /* 0x58 */ - "CUTGROUP", /* 0x59 */ - "KEEPS", /* 0x5a */ - "LNBREAK", /* 0x5b */ - "OPTIMIZED", /* 0x5c */ - "PSEUDO", /* 0x5d */ + "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 */ - "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 */ + "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", /* REGNODE_MAX +0x1b */ "CURLY_B_min_fail", /* REGNODE_MAX +0x1c */ "CURLY_B_max", /* REGNODE_MAX +0x1d */ @@ -700,11 +742,12 @@ EXTCONST char * const PL_reg_intflags_name[] = { "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 12 +# define REG_INTFLAGS_NAME_SIZE 13 #endif /* The following have no fixed length. U8 so we can do strchr() on it. */ @@ -725,7 +768,7 @@ EXTCONST U8 PL_varies[] __attribute__deprecated__ = { EXTCONST U8 PL_varies_bitmask[]; #else EXTCONST U8 PL_varies_bitmask[] = { - 0x00, 0x00, 0x00, 0x60, 0x00, 0xFC, 0xF9, 0x5F, 0x06, 0x00, 0x00, 0x00 + 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0xFE, 0xF0, 0xBF, 0x0C, 0x00, 0x00, 0x00 }; #endif /* DOINIT */ @@ -737,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, POSIXD, POSIXL, POSIXU, POSIXA, - NPOSIXD, NPOSIXL, NPOSIXU, NPOSIXA, + REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFPOSIXL, ANYOFH, ANYOFM, + NANYOFM, POSIXD, POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL, NPOSIXU, + NPOSIXA, 0 }; #endif /* DOINIT */ @@ -747,7 +791,7 @@ EXTCONST U8 PL_simple[] __attribute__deprecated__ = { EXTCONST U8 PL_simple_bitmask[]; #else EXTCONST U8 PL_simple_bitmask[] = { - 0x00, 0x00, 0xFF, 0x1F, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + 0x00, 0x00, 0xFF, 0xFF, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif /* DOINIT */