JezK
Edit File: regnodes.h
/* -*- buffer-read-only: t -*- !!!!!!! 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 97 #define REGMATCH_STATE_MAX 139 #define END 0 /* 0000 End of program. */ #define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */ #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 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. */ /* ------------ States ------------- */ #define TRIE_next (REGNODE_MAX + 1) /* state for TRIE */ #define TRIE_next_fail (REGNODE_MAX + 2) /* state for TRIE */ #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. */ #ifndef DOINIT EXTCONST U8 PL_regkind[]; #else EXTCONST U8 PL_regkind[] = { END, /* END */ END, /* SUCCEED */ BOL, /* SBOL */ BOL, /* MBOL */ EOL, /* SEOL */ EOL, /* MEOL */ EOL, /* EOS */ GPOS, /* GPOS */ BOUND, /* BOUND */ BOUND, /* BOUNDL */ BOUND, /* BOUNDU */ BOUND, /* BOUNDA */ NBOUND, /* NBOUND */ NBOUND, /* NBOUNDL */ NBOUND, /* NBOUNDU */ NBOUND, /* NBOUNDA */ REG_ANY, /* REG_ANY */ REG_ANY, /* SANY */ ANYOF, /* ANYOF */ 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 */ 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 */ PLUS, /* PLUS */ CURLY, /* CURLY */ CURLY, /* CURLYN */ CURLY, /* CURLYM */ CURLY, /* CURLYX */ 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 */ EVAL, /* EVAL */ MINMOD, /* MINMOD */ LOGICAL, /* LOGICAL */ BRANCHJ, /* RENUM */ TRIE, /* TRIE */ TRIE, /* TRIEC */ TRIE, /* AHOCORASICK */ TRIE, /* AHOCORASICKC */ GOSUB, /* GOSUB */ NGROUPP, /* NGROUPP */ INSUBP, /* INSUBP */ DEFINEP, /* DEFINEP */ ENDLIKE, /* ENDLIKE */ ENDLIKE, /* OPFAIL */ ENDLIKE, /* ACCEPT */ VERB, /* VERB */ VERB, /* PRUNE */ VERB, /* MARKPOINT */ VERB, /* SKIP */ VERB, /* COMMIT */ VERB, /* CUTGROUP */ KEEPS, /* KEEPS */ LNBREAK, /* LNBREAK */ NOTHING, /* OPTIMIZED */ PSEUDO, /* PSEUDO */ /* ------------ States ------------- */ TRIE, /* TRIE_next */ TRIE, /* TRIE_next_fail */ EVAL, /* EVAL_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 */ WHILEM, /* WHILEM_A_pre_fail */ WHILEM, /* WHILEM_A_min */ WHILEM, /* WHILEM_A_min_fail */ WHILEM, /* WHILEM_A_max */ WHILEM, /* WHILEM_A_max_fail */ WHILEM, /* WHILEM_B_min */ WHILEM, /* WHILEM_B_min_fail */ WHILEM, /* WHILEM_B_max */ WHILEM, /* WHILEM_B_max_fail */ BRANCH, /* BRANCH_next */ BRANCH, /* BRANCH_next_fail */ CURLYM, /* CURLYM_A */ CURLYM, /* CURLYM_A_fail */ CURLYM, /* CURLYM_B */ CURLYM, /* CURLYM_B_fail */ IFMATCH, /* IFMATCH_A */ IFMATCH, /* IFMATCH_A_fail */ CURLY, /* CURLY_B_min_known */ CURLY, /* CURLY_B_min_known_fail */ CURLY, /* CURLY_B_min */ CURLY, /* CURLY_B_min_fail */ CURLY, /* CURLY_B_max */ CURLY, /* CURLY_B_max_fail */ COMMIT, /* COMMIT_next */ COMMIT, /* COMMIT_next_fail */ MARKPOINT, /* MARKPOINT_next */ MARKPOINT, /* MARKPOINT_next_fail */ SKIP, /* SKIP_next */ SKIP, /* SKIP_next_fail */ CUTGROUP, /* CUTGROUP_next */ CUTGROUP, /* CUTGROUP_next_fail */ KEEPS, /* KEEPS_next */ KEEPS, /* KEEPS_next_fail */ }; #endif #ifdef REG_COMP_C /* regarglen[] - How large is the argument part of the node (in regnodes) */ static const U8 regarglen[] = { 0, /* END */ 0, /* SUCCEED */ 0, /* SBOL */ 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, /* 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_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, /* 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, /* PLUS */ EXTRA_SIZE(struct regnode_2), /* CURLY */ EXTRA_SIZE(struct regnode_2), /* CURLYN */ EXTRA_SIZE(struct regnode_2), /* CURLYM */ EXTRA_SIZE(struct regnode_2), /* CURLYX */ 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_2L), /* EVAL */ 0, /* MINMOD */ 0, /* LOGICAL */ EXTRA_SIZE(struct regnode_1), /* RENUM */ EXTRA_SIZE(struct regnode_1), /* TRIE */ EXTRA_SIZE(struct regnode_charclass), /* TRIEC */ EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */ EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */ EXTRA_SIZE(struct regnode_2L), /* GOSUB */ EXTRA_SIZE(struct regnode_1), /* NGROUPP */ EXTRA_SIZE(struct regnode_1), /* INSUBP */ EXTRA_SIZE(struct regnode_1), /* DEFINEP */ 0, /* ENDLIKE */ 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), /* SKIP */ EXTRA_SIZE(struct regnode_1), /* COMMIT */ EXTRA_SIZE(struct regnode_1), /* CUTGROUP */ 0, /* KEEPS */ 0, /* LNBREAK */ 0, /* OPTIMIZED */ 0, /* PSEUDO */ }; /* reg_off_by_arg[] - Which argument holds the offset to the next node */ static const char reg_off_by_arg[] = { 0, /* END */ 0, /* SUCCEED */ 0, /* SBOL */ 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, /* NBOUNDA */ 0, /* REG_ANY */ 0, /* SANY */ 0, /* ANYOF */ 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, /* 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, /* PLUS */ 0, /* CURLY */ 0, /* CURLYN */ 0, /* CURLYM */ 0, /* CURLYX */ 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 */ 0, /* EVAL */ 0, /* MINMOD */ 0, /* LOGICAL */ 1, /* RENUM */ 0, /* TRIE */ 0, /* TRIEC */ 0, /* AHOCORASICK */ 0, /* AHOCORASICKC */ 0, /* GOSUB */ 0, /* NGROUPP */ 0, /* INSUBP */ 0, /* DEFINEP */ 0, /* ENDLIKE */ 0, /* OPFAIL */ 0, /* ACCEPT */ 0, /* VERB */ 0, /* PRUNE */ 0, /* MARKPOINT */ 0, /* SKIP */ 0, /* COMMIT */ 0, /* CUTGROUP */ 0, /* KEEPS */ 0, /* LNBREAK */ 0, /* OPTIMIZED */ 0, /* PSEUDO */ }; #endif /* REG_COMP_C */ /* reg_name[] - Opcode/state names in string form, for debugging */ #ifndef DOINIT EXTCONST char * PL_reg_name[]; #else EXTCONST char * const PL_reg_name[] = { "END", /* 0000 */ "SUCCEED", /* 0x01 */ "SBOL", /* 0x02 */ "MBOL", /* 0x03 */ "SEOL", /* 0x04 */ "MEOL", /* 0x05 */ "EOS", /* 0x06 */ "GPOS", /* 0x07 */ "BOUND", /* 0x08 */ "BOUNDL", /* 0x09 */ "BOUNDU", /* 0x0a */ "BOUNDA", /* 0x0b */ "NBOUND", /* 0x0c */ "NBOUNDL", /* 0x0d */ "NBOUNDU", /* 0x0e */ "NBOUNDA", /* 0x0f */ "REG_ANY", /* 0x10 */ "SANY", /* 0x11 */ "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 */ /* ------------ States ------------- */ "TRIE_next", /* REGNODE_MAX +0x01 */ "TRIE_next_fail", /* REGNODE_MAX +0x02 */ "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 */ /* PL_reg_extflags_name[] - Opcode/state names in string form, for debugging */ #ifndef DOINIT EXTCONST char * PL_reg_extflags_name[]; #else EXTCONST char * const PL_reg_extflags_name[] = { /* Bits in extflags defined: 11111111111111110000111111111111 */ "MULTILINE", /* 0x00000001 */ "SINGLELINE", /* 0x00000002 */ "FOLD", /* 0x00000004 */ "EXTENDED", /* 0x00000008 */ "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 */ "IS_ANCHORED", /* 0x01000000 */ "COPY_DONE", /* 0x02000000 */ "TAINTED_SEEN", /* 0x04000000 */ "TAINTED", /* 0x08000000 */ "START_ONLY", /* 0x10000000 */ "SKIPWHITE", /* 0x20000000 */ "WHITE", /* 0x40000000 */ "NULL", /* 0x80000000 */ }; #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))) #ifndef DOINIT EXTCONST U8 PL_varies[] __attribute__deprecated__; #else EXTCONST U8 PL_varies[] __attribute__deprecated__ = { 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 */ #ifndef DOINIT EXTCONST U8 PL_varies_bitmask[]; #else EXTCONST U8 PL_varies_bitmask[] = { 0x00, 0x00, 0x00, 0x00, 0x03, 0xE0, 0x0F, 0xFF, 0xCB, 0x00, 0x00, 0x00, 0x00 }; #endif /* DOINIT */ /* The following always have a length of 1. U8 we can do strchr() on it. */ /* (Note that length 1 means "one character" under UTF8, not "one octet".) */ #define REGNODE_SIMPLE(node) (PL_simple_bitmask[(node) >> 3] & (1 << ((node) & 7))) #ifndef DOINIT EXTCONST U8 PL_simple[] __attribute__deprecated__; #else EXTCONST U8 PL_simple[] __attribute__deprecated__ = { REG_ANY, SANY, ANYOF, ANYOFD, ANYOFL, ANYOFM, POSIXD, POSIXL, POSIXU, POSIXA, NPOSIXD, NPOSIXL, NPOSIXU, NPOSIXA, ASCII, NASCII, 0 }; #endif /* DOINIT */ #ifndef DOINIT EXTCONST U8 PL_simple_bitmask[]; #else EXTCONST U8 PL_simple_bitmask[] = { 0x00, 0x00, 0xFF, 0xFF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif /* DOINIT */ /* ex: set ro: */