/* Regops and State definitions */
-#define REGNODE_MAX 103
-#define REGMATCH_STATE_MAX 143
+#define REGNODE_MAX 105
+#define REGMATCH_STATE_MAX 145
#define END 0 /* 0000 End of program. */
#define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
#define CLUMP 35 /* 0x23 Match any extended grapheme cluster sequence */
#define BRANCH 36 /* 0x24 Match this alternative, or the next... */
#define EXACT 37 /* 0x25 Match this string (flags field is the length). */
-#define EXACTL 38 /* 0x26 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */
-#define EXACTF 39 /* 0x27 Match this string using /id rules (w/len); (string not UTF-8, not guaranteed to be folded). */
-#define EXACTFL 40 /* 0x28 Match this string using /il rules (w/len); (string not guaranteed to be folded). */
-#define EXACTFU 41 /* 0x29 Match this string using /iu rules (w/len); (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
-#define EXACTFAA 42 /* 0x2a Match this string using /iaa rules (w/len) (string folded iff in UTF-8; non-UTF8 folded length <= unfolded). */
-#define EXACTFUP 43 /* 0x2b Match this string using /iu rules (w/len); (string not UTF-8, not guaranteed to be folded; and its Problematic). */
-#define EXACTFLU8 44 /* 0x2c Like EXACTFU, but use /il, UTF-8, folded, and everything in it is above 255. */
-#define EXACTFAA_NO_TRIE 45 /* 0x2d Match this string using /iaa rules (w/len) (string not UTF-8, not guaranteed to be folded, not currently trie-able). */
-#define EXACT_ONLY8 46 /* 0x2e Like EXACT, but only UTF-8 encoded targets can match */
-#define EXACTFU_ONLY8 47 /* 0x2f Like EXACTFU, but only UTF-8 encoded targets can match */
-#define EXACTFU_S_EDGE 48 /* 0x30 /di rules, but nothing in it precludes /ui, except begins and/or ends with [Ss]; (string not UTF-8; compile-time only). */
-#define NOTHING 49 /* 0x31 Match empty string. */
-#define TAIL 50 /* 0x32 Match empty string. Can jump here from outside. */
-#define STAR 51 /* 0x33 Match this (simple) thing 0 or more times. */
-#define PLUS 52 /* 0x34 Match this (simple) thing 1 or more times. */
-#define CURLY 53 /* 0x35 Match this simple thing {n,m} times. */
-#define CURLYN 54 /* 0x36 Capture next-after-this simple thing */
-#define CURLYM 55 /* 0x37 Capture this medium-complex thing {n,m} times. */
-#define CURLYX 56 /* 0x38 Match this complex thing {n,m} times. */
-#define WHILEM 57 /* 0x39 Do curly processing and see if rest matches. */
-#define OPEN 58 /* 0x3a Mark this point in input as start of #n. */
-#define CLOSE 59 /* 0x3b Close corresponding OPEN of #n. */
-#define SROPEN 60 /* 0x3c Same as OPEN, but for script run */
-#define SRCLOSE 61 /* 0x3d Close preceding SROPEN */
-#define REF 62 /* 0x3e Match some already matched string */
-#define REFF 63 /* 0x3f Match already matched string, using /di rules. */
-#define REFFL 64 /* 0x40 Match already matched string, using /li rules. */
-#define REFFU 65 /* 0x41 Match already matched string, usng /ui. */
-#define REFFA 66 /* 0x42 Match already matched string, using /aai rules. */
-#define REFN 67 /* 0x43 Match some already matched string */
-#define REFFN 68 /* 0x44 Match already matched string, using /di rules. */
-#define REFFLN 69 /* 0x45 Match already matched string, using /li rules. */
-#define REFFUN 70 /* 0x46 Match already matched string, using /ui rules. */
-#define REFFAN 71 /* 0x47 Match already matched string, using /aai rules. */
-#define LONGJMP 72 /* 0x48 Jump far away. */
-#define BRANCHJ 73 /* 0x49 BRANCH with long offset. */
-#define IFMATCH 74 /* 0x4a Succeeds if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
-#define UNLESSM 75 /* 0x4b Fails if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
-#define SUSPEND 76 /* 0x4c "Independent" sub-RE. */
-#define IFTHEN 77 /* 0x4d Switch, should be preceded by switcher. */
-#define GROUPP 78 /* 0x4e Whether the group matched. */
-#define EVAL 79 /* 0x4f Execute some Perl code. */
-#define MINMOD 80 /* 0x50 Next operator is not greedy. */
-#define LOGICAL 81 /* 0x51 Next opcode should set the flag only. */
-#define RENUM 82 /* 0x52 Group with independently numbered parens. */
-#define TRIE 83 /* 0x53 Match many EXACT(F[ALU]?)? at once. flags==type */
-#define TRIEC 84 /* 0x54 Same as TRIE, but with embedded charclass data */
-#define AHOCORASICK 85 /* 0x55 Aho Corasick stclass. flags==type */
-#define AHOCORASICKC 86 /* 0x56 Same as AHOCORASICK, but with embedded charclass data */
-#define GOSUB 87 /* 0x57 recurse to paren arg1 at (signed) ofs arg2 */
-#define GROUPPN 88 /* 0x58 Whether the group matched. */
-#define INSUBP 89 /* 0x59 Whether we are in a specific recurse. */
-#define DEFINEP 90 /* 0x5a Never execute directly. */
-#define ENDLIKE 91 /* 0x5b Used only for the type field of verbs */
-#define OPFAIL 92 /* 0x5c Same as (?!), but with verb arg */
-#define ACCEPT 93 /* 0x5d Accepts the current matched string, with verbar */
-#define VERB 94 /* 0x5e Used only for the type field of verbs */
-#define PRUNE 95 /* 0x5f Pattern fails at this startpoint if no-backtracking through this */
-#define MARKPOINT 96 /* 0x60 Push the current location for rollback by cut. */
-#define SKIP 97 /* 0x61 On failure skip forward (to the mark) before retrying */
-#define COMMIT 98 /* 0x62 Pattern fails outright if backtracking through this */
-#define CUTGROUP 99 /* 0x63 On failure go to the next alternation in the group */
-#define KEEPS 100 /* 0x64 $& begins here. */
-#define LNBREAK 101 /* 0x65 generic newline pattern */
-#define OPTIMIZED 102 /* 0x66 Placeholder for dump. */
-#define PSEUDO 103 /* 0x67 Pseudo opcode for internal use. */
+#define LEXACT 38 /* 0x26 Match this long string (preceded by length; flags unused). */
+#define EXACTL 39 /* 0x27 Like EXACT, but /l is in effect (used so locale-related warnings can be checked for). */
+#define EXACTF 40 /* 0x28 Like EXACT, but match using /id rules; (string not UTF-8, not guaranteed to be folded). */
+#define EXACTFL 41 /* 0x29 Like EXACT, but match using /il rules; (string not likely to be folded). */
+#define EXACTFU 42 /* 0x2a Like EXACT, but match using /iu rules; (string folded). */
+#define EXACTFAA 43 /* 0x2b Like EXACT, but match using /iaa rules; (string folded iff pattern is UTF8; folded length <= unfolded). */
+#define EXACTFUP 44 /* 0x2c Like EXACT, but match using /iu rules; (string not UTF-8, not guaranteed to be folded; and it is Problematic). */
+#define EXACTFLU8 45 /* 0x2d Like EXACTFU, but use /il, UTF-8, (string is folded, and everything in it is above 255. */
+#define EXACTFAA_NO_TRIE 46 /* 0x2e Like EXACT, but match using /iaa rules (string not UTF-8, not guaranteed to be folded, not currently trie-able). */
+#define EXACT_ONLY8 47 /* 0x2f Like EXACT, but only UTF-8 encoded targets can match */
+#define LEXACT_ONLY8 48 /* 0x30 Like LEXACT, but only UTF-8 encoded targets can match */
+#define EXACTFU_ONLY8 49 /* 0x31 Like EXACTFU, but only UTF-8 encoded targets can match */
+#define EXACTFU_S_EDGE 50 /* 0x32 /di rules, but nothing in it precludes /ui, except begins and/or ends with [Ss]; (string not UTF-8; compile-time only). */
+#define NOTHING 51 /* 0x33 Match empty string. */
+#define TAIL 52 /* 0x34 Match empty string. Can jump here from outside. */
+#define STAR 53 /* 0x35 Match this (simple) thing 0 or more times. */
+#define PLUS 54 /* 0x36 Match this (simple) thing 1 or more times. */
+#define CURLY 55 /* 0x37 Match this simple thing {n,m} times. */
+#define CURLYN 56 /* 0x38 Capture next-after-this simple thing */
+#define CURLYM 57 /* 0x39 Capture this medium-complex thing {n,m} times. */
+#define CURLYX 58 /* 0x3a Match this complex thing {n,m} times. */
+#define WHILEM 59 /* 0x3b Do curly processing and see if rest matches. */
+#define OPEN 60 /* 0x3c Mark this point in input as start of #n. */
+#define CLOSE 61 /* 0x3d Close corresponding OPEN of #n. */
+#define SROPEN 62 /* 0x3e Same as OPEN, but for script run */
+#define SRCLOSE 63 /* 0x3f Close preceding SROPEN */
+#define REF 64 /* 0x40 Match some already matched string */
+#define REFF 65 /* 0x41 Match already matched string, using /di rules. */
+#define REFFL 66 /* 0x42 Match already matched string, using /li rules. */
+#define REFFU 67 /* 0x43 Match already matched string, usng /ui. */
+#define REFFA 68 /* 0x44 Match already matched string, using /aai rules. */
+#define REFN 69 /* 0x45 Match some already matched string */
+#define REFFN 70 /* 0x46 Match already matched string, using /di rules. */
+#define REFFLN 71 /* 0x47 Match already matched string, using /li rules. */
+#define REFFUN 72 /* 0x48 Match already matched string, using /ui rules. */
+#define REFFAN 73 /* 0x49 Match already matched string, using /aai rules. */
+#define LONGJMP 74 /* 0x4a Jump far away. */
+#define BRANCHJ 75 /* 0x4b BRANCH with long offset. */
+#define IFMATCH 76 /* 0x4c Succeeds if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
+#define UNLESSM 77 /* 0x4d Fails if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current */
+#define SUSPEND 78 /* 0x4e "Independent" sub-RE. */
+#define IFTHEN 79 /* 0x4f Switch, should be preceded by switcher. */
+#define GROUPP 80 /* 0x50 Whether the group matched. */
+#define EVAL 81 /* 0x51 Execute some Perl code. */
+#define MINMOD 82 /* 0x52 Next operator is not greedy. */
+#define LOGICAL 83 /* 0x53 Next opcode should set the flag only. */
+#define RENUM 84 /* 0x54 Group with independently numbered parens. */
+#define TRIE 85 /* 0x55 Match many EXACT(F[ALU]?)? at once. flags==type */
+#define TRIEC 86 /* 0x56 Same as TRIE, but with embedded charclass data */
+#define AHOCORASICK 87 /* 0x57 Aho Corasick stclass. flags==type */
+#define AHOCORASICKC 88 /* 0x58 Same as AHOCORASICK, but with embedded charclass data */
+#define GOSUB 89 /* 0x59 recurse to paren arg1 at (signed) ofs arg2 */
+#define GROUPPN 90 /* 0x5a Whether the group matched. */
+#define INSUBP 91 /* 0x5b Whether we are in a specific recurse. */
+#define DEFINEP 92 /* 0x5c Never execute directly. */
+#define ENDLIKE 93 /* 0x5d Used only for the type field of verbs */
+#define OPFAIL 94 /* 0x5e Same as (?!), but with verb arg */
+#define ACCEPT 95 /* 0x5f Accepts the current matched string, with verbar */
+#define VERB 96 /* 0x60 Used only for the type field of verbs */
+#define PRUNE 97 /* 0x61 Pattern fails at this startpoint if no-backtracking through this */
+#define MARKPOINT 98 /* 0x62 Push the current location for rollback by cut. */
+#define SKIP 99 /* 0x63 On failure skip forward (to the mark) before retrying */
+#define COMMIT 100 /* 0x64 Pattern fails outright if backtracking through this */
+#define CUTGROUP 101 /* 0x65 On failure go to the next alternation in the group */
+#define KEEPS 102 /* 0x66 $& begins here. */
+#define LNBREAK 103 /* 0x67 generic newline pattern */
+#define OPTIMIZED 104 /* 0x68 Placeholder for dump. */
+#define PSEUDO 105 /* 0x69 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 */
CLUMP, /* CLUMP */
BRANCH, /* BRANCH */
EXACT, /* EXACT */
+ EXACT, /* LEXACT */
EXACT, /* EXACTL */
EXACT, /* EXACTF */
EXACT, /* EXACTFL */
EXACT, /* EXACTFLU8 */
EXACT, /* EXACTFAA_NO_TRIE */
EXACT, /* EXACT_ONLY8 */
+ EXACT, /* LEXACT_ONLY8 */
EXACT, /* EXACTFU_ONLY8 */
EXACT, /* EXACTFU_S_EDGE */
NOTHING, /* NOTHING */
0, /* CLUMP */
0, /* BRANCH */
0, /* EXACT */
+ EXTRA_SIZE(struct regnode_1), /* LEXACT */
0, /* EXACTL */
0, /* EXACTF */
0, /* EXACTFL */
0, /* EXACTFLU8 */
0, /* EXACTFAA_NO_TRIE */
0, /* EXACT_ONLY8 */
+ EXTRA_SIZE(struct regnode_1), /* LEXACT_ONLY8 */
0, /* EXACTFU_ONLY8 */
0, /* EXACTFU_S_EDGE */
0, /* NOTHING */
0, /* CLUMP */
0, /* BRANCH */
0, /* EXACT */
+ 0, /* LEXACT */
0, /* EXACTL */
0, /* EXACTF */
0, /* EXACTFL */
0, /* EXACTFLU8 */
0, /* EXACTFAA_NO_TRIE */
0, /* EXACT_ONLY8 */
+ 0, /* LEXACT_ONLY8 */
0, /* EXACTFU_ONLY8 */
0, /* EXACTFU_S_EDGE */
0, /* NOTHING */
"CLUMP", /* 0x23 */
"BRANCH", /* 0x24 */
"EXACT", /* 0x25 */
- "EXACTL", /* 0x26 */
- "EXACTF", /* 0x27 */
- "EXACTFL", /* 0x28 */
- "EXACTFU", /* 0x29 */
- "EXACTFAA", /* 0x2a */
- "EXACTFUP", /* 0x2b */
- "EXACTFLU8", /* 0x2c */
- "EXACTFAA_NO_TRIE", /* 0x2d */
- "EXACT_ONLY8", /* 0x2e */
- "EXACTFU_ONLY8", /* 0x2f */
- "EXACTFU_S_EDGE", /* 0x30 */
- "NOTHING", /* 0x31 */
- "TAIL", /* 0x32 */
- "STAR", /* 0x33 */
- "PLUS", /* 0x34 */
- "CURLY", /* 0x35 */
- "CURLYN", /* 0x36 */
- "CURLYM", /* 0x37 */
- "CURLYX", /* 0x38 */
- "WHILEM", /* 0x39 */
- "OPEN", /* 0x3a */
- "CLOSE", /* 0x3b */
- "SROPEN", /* 0x3c */
- "SRCLOSE", /* 0x3d */
- "REF", /* 0x3e */
- "REFF", /* 0x3f */
- "REFFL", /* 0x40 */
- "REFFU", /* 0x41 */
- "REFFA", /* 0x42 */
- "REFN", /* 0x43 */
- "REFFN", /* 0x44 */
- "REFFLN", /* 0x45 */
- "REFFUN", /* 0x46 */
- "REFFAN", /* 0x47 */
- "LONGJMP", /* 0x48 */
- "BRANCHJ", /* 0x49 */
- "IFMATCH", /* 0x4a */
- "UNLESSM", /* 0x4b */
- "SUSPEND", /* 0x4c */
- "IFTHEN", /* 0x4d */
- "GROUPP", /* 0x4e */
- "EVAL", /* 0x4f */
- "MINMOD", /* 0x50 */
- "LOGICAL", /* 0x51 */
- "RENUM", /* 0x52 */
- "TRIE", /* 0x53 */
- "TRIEC", /* 0x54 */
- "AHOCORASICK", /* 0x55 */
- "AHOCORASICKC", /* 0x56 */
- "GOSUB", /* 0x57 */
- "GROUPPN", /* 0x58 */
- "INSUBP", /* 0x59 */
- "DEFINEP", /* 0x5a */
- "ENDLIKE", /* 0x5b */
- "OPFAIL", /* 0x5c */
- "ACCEPT", /* 0x5d */
- "VERB", /* 0x5e */
- "PRUNE", /* 0x5f */
- "MARKPOINT", /* 0x60 */
- "SKIP", /* 0x61 */
- "COMMIT", /* 0x62 */
- "CUTGROUP", /* 0x63 */
- "KEEPS", /* 0x64 */
- "LNBREAK", /* 0x65 */
- "OPTIMIZED", /* 0x66 */
- "PSEUDO", /* 0x67 */
+ "LEXACT", /* 0x26 */
+ "EXACTL", /* 0x27 */
+ "EXACTF", /* 0x28 */
+ "EXACTFL", /* 0x29 */
+ "EXACTFU", /* 0x2a */
+ "EXACTFAA", /* 0x2b */
+ "EXACTFUP", /* 0x2c */
+ "EXACTFLU8", /* 0x2d */
+ "EXACTFAA_NO_TRIE", /* 0x2e */
+ "EXACT_ONLY8", /* 0x2f */
+ "LEXACT_ONLY8", /* 0x30 */
+ "EXACTFU_ONLY8", /* 0x31 */
+ "EXACTFU_S_EDGE", /* 0x32 */
+ "NOTHING", /* 0x33 */
+ "TAIL", /* 0x34 */
+ "STAR", /* 0x35 */
+ "PLUS", /* 0x36 */
+ "CURLY", /* 0x37 */
+ "CURLYN", /* 0x38 */
+ "CURLYM", /* 0x39 */
+ "CURLYX", /* 0x3a */
+ "WHILEM", /* 0x3b */
+ "OPEN", /* 0x3c */
+ "CLOSE", /* 0x3d */
+ "SROPEN", /* 0x3e */
+ "SRCLOSE", /* 0x3f */
+ "REF", /* 0x40 */
+ "REFF", /* 0x41 */
+ "REFFL", /* 0x42 */
+ "REFFU", /* 0x43 */
+ "REFFA", /* 0x44 */
+ "REFN", /* 0x45 */
+ "REFFN", /* 0x46 */
+ "REFFLN", /* 0x47 */
+ "REFFUN", /* 0x48 */
+ "REFFAN", /* 0x49 */
+ "LONGJMP", /* 0x4a */
+ "BRANCHJ", /* 0x4b */
+ "IFMATCH", /* 0x4c */
+ "UNLESSM", /* 0x4d */
+ "SUSPEND", /* 0x4e */
+ "IFTHEN", /* 0x4f */
+ "GROUPP", /* 0x50 */
+ "EVAL", /* 0x51 */
+ "MINMOD", /* 0x52 */
+ "LOGICAL", /* 0x53 */
+ "RENUM", /* 0x54 */
+ "TRIE", /* 0x55 */
+ "TRIEC", /* 0x56 */
+ "AHOCORASICK", /* 0x57 */
+ "AHOCORASICKC", /* 0x58 */
+ "GOSUB", /* 0x59 */
+ "GROUPPN", /* 0x5a */
+ "INSUBP", /* 0x5b */
+ "DEFINEP", /* 0x5c */
+ "ENDLIKE", /* 0x5d */
+ "OPFAIL", /* 0x5e */
+ "ACCEPT", /* 0x5f */
+ "VERB", /* 0x60 */
+ "PRUNE", /* 0x61 */
+ "MARKPOINT", /* 0x62 */
+ "SKIP", /* 0x63 */
+ "COMMIT", /* 0x64 */
+ "CUTGROUP", /* 0x65 */
+ "KEEPS", /* 0x66 */
+ "LNBREAK", /* 0x67 */
+ "OPTIMIZED", /* 0x68 */
+ "PSEUDO", /* 0x69 */
/* ------------ States ------------- */
"TRIE_next", /* REGNODE_MAX +0x01 */
"TRIE_next_fail", /* REGNODE_MAX +0x02 */
EXTCONST U8 PL_varies_bitmask[];
#else
EXTCONST U8 PL_varies_bitmask[] = {
- 0x00, 0x00, 0x00, 0x00, 0x18, 0x00, 0xF8, 0xC3, 0xFF, 0x32, 0x00, 0x00, 0x00
+ 0x00, 0x00, 0x00, 0x00, 0x18, 0x00, 0xE0, 0x0F, 0xFF, 0xCB, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
EXTCONST U8 PL_simple_bitmask[];
#else
EXTCONST U8 PL_simple_bitmask[] = {
- 0x00, 0x00, 0xFF, 0xFF, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+ 0x00, 0x00, 0xFF, 0xFF, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
#endif /* DOINIT */
https://perl5.git.perl.org / perl5.git / blobdiff