[perl5.git] / regnodes.h

/* -*- buffer-read-only: t -*-
   !!!!!!!   DO NOT EDIT THIS FILE   !!!!!!!
   This file is built by regcomp.pl from regcomp.sym.
   Any changes made here will be lost!
*/

/* Regops and State definitions */

#define REGNODE_MAX           	75
#define REGMATCH_STATE_MAX    	105

#define	END                   	0	/* 0000 End of program. */
#define	SUCCEED               	1	/* 0x01 Return from a subroutine, basically. */
#define	BOL                   	2	/* 0x02 Match "" at beginning of line. */
#define	MBOL                  	3	/* 0x03 Same, assuming multiline. */
#define	SBOL                  	4	/* 0x04 Same, assuming singleline. */
#define	EOS                   	5	/* 0x05 Match "" at end of string. */
#define	EOL                   	6	/* 0x06 Match "" at end of line. */
#define	MEOL                  	7	/* 0x07 Same, assuming multiline. */
#define	SEOL                  	8	/* 0x08 Same, assuming singleline. */
#define	BOUND                 	9	/* 0x09 Match "" at any word boundary */
#define	BOUNDL                	10	/* 0x0a Match "" at any word boundary */
#define	NBOUND                	11	/* 0x0b Match "" at any word non-boundary */
#define	NBOUNDL               	12	/* 0x0c Match "" at any word non-boundary */
#define	GPOS                  	13	/* 0x0d Matches where last m//g left off. */
#define	REG_ANY               	14	/* 0x0e Match any one character (except newline). */
#define	SANY                  	15	/* 0x0f Match any one character. */
#define	CANY                  	16	/* 0x10 Match any one byte. */
#define	ANYOF                 	17	/* 0x11 Match character in (or not in) this class. */
#define	ALNUM                 	18	/* 0x12 Match any alphanumeric character */
#define	ALNUML                	19	/* 0x13 Match any alphanumeric char in locale */
#define	NALNUM                	20	/* 0x14 Match any non-alphanumeric character */
#define	NALNUML               	21	/* 0x15 Match any non-alphanumeric char in locale */
#define	SPACE                 	22	/* 0x16 Match any whitespace character */
#define	SPACEL                	23	/* 0x17 Match any whitespace char in locale */
#define	NSPACE                	24	/* 0x18 Match any non-whitespace character */
#define	NSPACEL               	25	/* 0x19 Match any non-whitespace char in locale */
#define	DIGIT                 	26	/* 0x1a Match any numeric character */
#define	DIGITL                	27	/* 0x1b Match any numeric character in locale */
#define	NDIGIT                	28	/* 0x1c Match any non-numeric character */
#define	NDIGITL               	29	/* 0x1d Match any non-numeric character in locale */
#define	CLUMP                 	30	/* 0x1e Match any combining character sequence */
#define	BRANCH                	31	/* 0x1f Match this alternative, or the next... */
#define	BACK                  	32	/* 0x20 Match "", "next" ptr points backward. */
#define	EXACT                 	33	/* 0x21 Match this string (preceded by length). */
#define	EXACTF                	34	/* 0x22 Match this string, folded (prec. by length). */
#define	EXACTFL               	35	/* 0x23 Match this string, folded in locale (w/len). */
#define	NOTHING               	36	/* 0x24 Match empty string. */
#define	TAIL                  	37	/* 0x25 Match empty string. Can jump here from outside. */
#define	STAR                  	38	/* 0x26 Match this (simple) thing 0 or more times. */
#define	PLUS                  	39	/* 0x27 Match this (simple) thing 1 or more times. */
#define	CURLY                 	40	/* 0x28 Match this simple thing {n,m} times. */
#define	CURLYN                	41	/* 0x29 Capture next-after-this simple thing */
#define	CURLYM                	42	/* 0x2a Capture this medium-complex thing {n,m} times. */
#define	CURLYX                	43	/* 0x2b Match this complex thing {n,m} times. */
#define	WHILEM                	44	/* 0x2c Do curly processing and see if rest matches. */
#define	OPEN                  	45	/* 0x2d Mark this point in input as start of */
#define	CLOSE                 	46	/* 0x2e Analogous to OPEN. */
#define	REF                   	47	/* 0x2f Match some already matched string */
#define	REFF                  	48	/* 0x30 Match already matched string, folded */
#define	REFFL                 	49	/* 0x31 Match already matched string, folded in loc. */
#define	IFMATCH               	50	/* 0x32 Succeeds if the following matches. */
#define	UNLESSM               	51	/* 0x33 Fails if the following matches. */
#define	SUSPEND               	52	/* 0x34 "Independent" sub-RE. */
#define	IFTHEN                	53	/* 0x35 Switch, should be preceeded by switcher . */
#define	GROUPP                	54	/* 0x36 Whether the group matched. */
#define	LONGJMP               	55	/* 0x37 Jump far away. */
#define	BRANCHJ               	56	/* 0x38 BRANCH with long offset. */
#define	EVAL                  	57	/* 0x39 Execute some Perl code. */
#define	MINMOD                	58	/* 0x3a Next operator is not greedy. */
#define	LOGICAL               	59	/* 0x3b Next opcode should set the flag only. */
#define	RENUM                 	60	/* 0x3c Group with independently numbered parens. */
#define	TRIE                  	61	/* 0x3d Match many EXACT(FL?)? at once. flags==type */
#define	TRIEC                 	62	/* 0x3e Same as TRIE, but with embedded charclass data */
#define	AHOCORASICK           	63	/* 0x3f Aho Corasick stclass. flags==type */
#define	AHOCORASICKC          	64	/* 0x40 Same as AHOCORASICK, but with embedded charclass data */
#define	RECURSE               	65	/* 0x41 recurse to paren arg1 at (signed) ofs arg2 */
#define	SRECURSE              	66	/* 0x42 recurse to start of pattern */
#define	NREF                  	67	/* 0x43 Match some already matched string */
#define	NREFF                 	68	/* 0x44 Match already matched string, folded */
#define	NREFFL                	69	/* 0x45 Match already matched string, folded in loc. */
#define	NGROUPP               	70	/* 0x46 Whether the group matched. */
#define	RECURSEP              	71	/* 0x47 Whether we are in a specific recurse. */
#define	DEFINEP               	72	/* 0x48 Never execute directly. */
#define	OPFAIL                	73	/* 0x49 Same as (?!) */
#define	OPTIMIZED             	74	/* 0x4a Placeholder for dump. */
#define	PSEUDO                	75	/* 0x4b Pseudo opcode for internal use. */

	/* ------------ States ------------- */

#define	TRIE_next             	76	/* 0x4c Regmatch state for TRIE */
#define	TRIE_next_fail        	77	/* 0x4d Regmatch state for TRIE */
#define	EVAL_AB               	78	/* 0x4e Regmatch state for EVAL */
#define	EVAL_AB_fail          	79	/* 0x4f Regmatch state for EVAL */
#define	CURLYX_end            	80	/* 0x50 Regmatch state for CURLYX */
#define	CURLYX_end_fail       	81	/* 0x51 Regmatch state for CURLYX */
#define	WHILEM_A_pre          	82	/* 0x52 Regmatch state for WHILEM */
#define	WHILEM_A_pre_fail     	83	/* 0x53 Regmatch state for WHILEM */
#define	WHILEM_A_min          	84	/* 0x54 Regmatch state for WHILEM */
#define	WHILEM_A_min_fail     	85	/* 0x55 Regmatch state for WHILEM */
#define	WHILEM_A_max          	86	/* 0x56 Regmatch state for WHILEM */
#define	WHILEM_A_max_fail     	87	/* 0x57 Regmatch state for WHILEM */
#define	WHILEM_B_min          	88	/* 0x58 Regmatch state for WHILEM */
#define	WHILEM_B_min_fail     	89	/* 0x59 Regmatch state for WHILEM */
#define	WHILEM_B_max          	90	/* 0x5a Regmatch state for WHILEM */
#define	WHILEM_B_max_fail     	91	/* 0x5b Regmatch state for WHILEM */
#define	BRANCH_next           	92	/* 0x5c Regmatch state for BRANCH */
#define	BRANCH_next_fail      	93	/* 0x5d Regmatch state for BRANCH */
#define	CURLYM_A              	94	/* 0x5e Regmatch state for CURLYM */
#define	CURLYM_A_fail         	95	/* 0x5f Regmatch state for CURLYM */
#define	CURLYM_B              	96	/* 0x60 Regmatch state for CURLYM */
#define	CURLYM_B_fail         	97	/* 0x61 Regmatch state for CURLYM */
#define	IFMATCH_A             	98	/* 0x62 Regmatch state for IFMATCH */
#define	IFMATCH_A_fail        	99	/* 0x63 Regmatch state for IFMATCH */
#define	CURLY_B_min_known     	100	/* 0x64 Regmatch state for CURLY */
#define	CURLY_B_min_known_fail	101	/* 0x65 Regmatch state for CURLY */
#define	CURLY_B_min           	102	/* 0x66 Regmatch state for CURLY */
#define	CURLY_B_min_fail      	103	/* 0x67 Regmatch state for CURLY */
#define	CURLY_B_max           	104	/* 0x68 Regmatch state for CURLY */
#define	CURLY_B_max_fail      	105	/* 0x69 Regmatch state for CURLY */

/* 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,     	/* BOL                    */
	BOL,     	/* MBOL                   */
	BOL,     	/* SBOL                   */
	EOL,     	/* EOS                    */
	EOL,     	/* EOL                    */
	EOL,     	/* MEOL                   */
	EOL,     	/* SEOL                   */
	BOUND,   	/* BOUND                  */
	BOUND,   	/* BOUNDL                 */
	NBOUND,  	/* NBOUND                 */
	NBOUND,  	/* NBOUNDL                */
	GPOS,    	/* GPOS                   */
	REG_ANY, 	/* REG_ANY                */
	REG_ANY, 	/* SANY                   */
	REG_ANY, 	/* CANY                   */
	ANYOF,   	/* ANYOF                  */
	ALNUM,   	/* ALNUM                  */
	ALNUM,   	/* ALNUML                 */
	NALNUM,  	/* NALNUM                 */
	NALNUM,  	/* NALNUML                */
	SPACE,   	/* SPACE                  */
	SPACE,   	/* SPACEL                 */
	NSPACE,  	/* NSPACE                 */
	NSPACE,  	/* NSPACEL                */
	DIGIT,   	/* DIGIT                  */
	DIGIT,   	/* DIGITL                 */
	NDIGIT,  	/* NDIGIT                 */
	NDIGIT,  	/* NDIGITL                */
	CLUMP,   	/* CLUMP                  */
	BRANCH,  	/* BRANCH                 */
	BACK,    	/* BACK                   */
	EXACT,   	/* EXACT                  */
	EXACT,   	/* EXACTF                 */
	EXACT,   	/* EXACTFL                */
	NOTHING, 	/* NOTHING                */
	NOTHING, 	/* TAIL                   */
	STAR,    	/* STAR                   */
	PLUS,    	/* PLUS                   */
	CURLY,   	/* CURLY                  */
	CURLY,   	/* CURLYN                 */
	CURLY,   	/* CURLYM                 */
	CURLY,   	/* CURLYX                 */
	WHILEM,  	/* WHILEM                 */
	OPEN,    	/* OPEN                   */
	CLOSE,   	/* CLOSE                  */
	REF,     	/* REF                    */
	REF,     	/* REFF                   */
	REF,     	/* REFFL                  */
	BRANCHJ, 	/* IFMATCH                */
	BRANCHJ, 	/* UNLESSM                */
	BRANCHJ, 	/* SUSPEND                */
	BRANCHJ, 	/* IFTHEN                 */
	GROUPP,  	/* GROUPP                 */
	LONGJMP, 	/* LONGJMP                */
	BRANCHJ, 	/* BRANCHJ                */
	EVAL,    	/* EVAL                   */
	MINMOD,  	/* MINMOD                 */
	LOGICAL, 	/* LOGICAL                */
	BRANCHJ, 	/* RENUM                  */
	TRIE,    	/* TRIE                   */
	TRIE,    	/* TRIEC                  */
	TRIE,    	/* AHOCORASICK            */
	TRIE,    	/* AHOCORASICKC           */
	RECURSE, 	/* RECURSE                */
	SRECURSE,	/* SRECURSE               */
	NREF,    	/* NREF                   */
	NREF,    	/* NREFF                  */
	NREF,    	/* NREFFL                 */
	NGROUPP, 	/* NGROUPP                */
	RECURSEP,	/* RECURSEP               */
	DEFINEP, 	/* DEFINEP                */
	OPFAIL,  	/* OPFAIL                 */
	NOTHING, 	/* OPTIMIZED              */
	PSEUDO,  	/* PSEUDO                 */
	/* ------------ States ------------- */
	TRIE,    	/* TRIE_next              */
	TRIE,    	/* TRIE_next_fail         */
	EVAL,    	/* EVAL_AB                */
	EVAL,    	/* EVAL_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       */
};
#endif

/* regarglen[] - How large is the argument part of the node (in regnodes) */

#ifdef REG_COMP_C
static const U8 regarglen[] = {
	0,                                   	/* END          */
	0,                                   	/* SUCCEED      */
	0,                                   	/* BOL          */
	0,                                   	/* MBOL         */
	0,                                   	/* SBOL         */
	0,                                   	/* EOS          */
	0,                                   	/* EOL          */
	0,                                   	/* MEOL         */
	0,                                   	/* SEOL         */
	0,                                   	/* BOUND        */
	0,                                   	/* BOUNDL       */
	0,                                   	/* NBOUND       */
	0,                                   	/* NBOUNDL      */
	0,                                   	/* GPOS         */
	0,                                   	/* REG_ANY      */
	0,                                   	/* SANY         */
	0,                                   	/* CANY         */
	0,                                   	/* ANYOF        */
	0,                                   	/* ALNUM        */
	0,                                   	/* ALNUML       */
	0,                                   	/* NALNUM       */
	0,                                   	/* NALNUML      */
	0,                                   	/* SPACE        */
	0,                                   	/* SPACEL       */
	0,                                   	/* NSPACE       */
	0,                                   	/* NSPACEL      */
	0,                                   	/* DIGIT        */
	0,                                   	/* DIGITL       */
	0,                                   	/* NDIGIT       */
	0,                                   	/* NDIGITL      */
	0,                                   	/* CLUMP        */
	0,                                   	/* BRANCH       */
	0,                                   	/* BACK         */
	0,                                   	/* EXACT        */
	0,                                   	/* EXACTF       */
	0,                                   	/* EXACTFL      */
	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        */
	EXTRA_SIZE(struct regnode_1),        	/* REF          */
	EXTRA_SIZE(struct regnode_1),        	/* REFF         */
	EXTRA_SIZE(struct regnode_1),        	/* REFFL        */
	EXTRA_SIZE(struct regnode_1),        	/* IFMATCH      */
	EXTRA_SIZE(struct regnode_1),        	/* UNLESSM      */
	EXTRA_SIZE(struct regnode_1),        	/* SUSPEND      */
	EXTRA_SIZE(struct regnode_1),        	/* IFTHEN       */
	EXTRA_SIZE(struct regnode_1),        	/* GROUPP       */
	EXTRA_SIZE(struct regnode_1),        	/* LONGJMP      */
	EXTRA_SIZE(struct regnode_1),        	/* BRANCHJ      */
	EXTRA_SIZE(struct regnode_1),        	/* EVAL         */
	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),       	/* RECURSE      */
	0,                                   	/* SRECURSE     */
	EXTRA_SIZE(struct regnode_1),        	/* NREF         */
	EXTRA_SIZE(struct regnode_1),        	/* NREFF        */
	EXTRA_SIZE(struct regnode_1),        	/* NREFFL       */
	EXTRA_SIZE(struct regnode_1),        	/* NGROUPP      */
	EXTRA_SIZE(struct regnode_1),        	/* RECURSEP     */
	EXTRA_SIZE(struct regnode_1),        	/* DEFINEP      */
	0,                                   	/* OPFAIL       */
	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,	/* BOL          */
	0,	/* MBOL         */
	0,	/* SBOL         */
	0,	/* EOS          */
	0,	/* EOL          */
	0,	/* MEOL         */
	0,	/* SEOL         */
	0,	/* BOUND        */
	0,	/* BOUNDL       */
	0,	/* NBOUND       */
	0,	/* NBOUNDL      */
	0,	/* GPOS         */
	0,	/* REG_ANY      */
	0,	/* SANY         */
	0,	/* CANY         */
	0,	/* ANYOF        */
	0,	/* ALNUM        */
	0,	/* ALNUML       */
	0,	/* NALNUM       */
	0,	/* NALNUML      */
	0,	/* SPACE        */
	0,	/* SPACEL       */
	0,	/* NSPACE       */
	0,	/* NSPACEL      */
	0,	/* DIGIT        */
	0,	/* DIGITL       */
	0,	/* NDIGIT       */
	0,	/* NDIGITL      */
	0,	/* CLUMP        */
	0,	/* BRANCH       */
	0,	/* BACK         */
	0,	/* EXACT        */
	0,	/* EXACTF       */
	0,	/* EXACTFL      */
	0,	/* NOTHING      */
	0,	/* TAIL         */
	0,	/* STAR         */
	0,	/* PLUS         */
	0,	/* CURLY        */
	0,	/* CURLYN       */
	0,	/* CURLYM       */
	0,	/* CURLYX       */
	0,	/* WHILEM       */
	0,	/* OPEN         */
	0,	/* CLOSE        */
	0,	/* REF          */
	0,	/* REFF         */
	0,	/* REFFL        */
	2,	/* IFMATCH      */
	2,	/* UNLESSM      */
	1,	/* SUSPEND      */
	1,	/* IFTHEN       */
	0,	/* GROUPP       */
	1,	/* LONGJMP      */
	1,	/* BRANCHJ      */
	0,	/* EVAL         */
	0,	/* MINMOD       */
	0,	/* LOGICAL      */
	1,	/* RENUM        */
	0,	/* TRIE         */
	0,	/* TRIEC        */
	0,	/* AHOCORASICK  */
	0,	/* AHOCORASICKC */
	0,	/* RECURSE      */
	0,	/* SRECURSE     */
	0,	/* NREF         */
	0,	/* NREFF        */
	0,	/* NREFFL       */
	0,	/* NGROUPP      */
	0,	/* RECURSEP     */
	0,	/* DEFINEP      */
	0,	/* OPFAIL       */
	0,	/* OPTIMIZED    */
	0,	/* PSEUDO       */
};

/* reg_name[] - Opcode/state names in string form, for debugging */

#ifdef DEBUGGING
const char * reg_name[] = {
	"END",                   	/* 0000 */
	"SUCCEED",               	/* 0x01 */
	"BOL",                   	/* 0x02 */
	"MBOL",                  	/* 0x03 */
	"SBOL",                  	/* 0x04 */
	"EOS",                   	/* 0x05 */
	"EOL",                   	/* 0x06 */
	"MEOL",                  	/* 0x07 */
	"SEOL",                  	/* 0x08 */
	"BOUND",                 	/* 0x09 */
	"BOUNDL",                	/* 0x0a */
	"NBOUND",                	/* 0x0b */
	"NBOUNDL",               	/* 0x0c */
	"GPOS",                  	/* 0x0d */
	"REG_ANY",               	/* 0x0e */
	"SANY",                  	/* 0x0f */
	"CANY",                  	/* 0x10 */
	"ANYOF",                 	/* 0x11 */
	"ALNUM",                 	/* 0x12 */
	"ALNUML",                	/* 0x13 */
	"NALNUM",                	/* 0x14 */
	"NALNUML",               	/* 0x15 */
	"SPACE",                 	/* 0x16 */
	"SPACEL",                	/* 0x17 */
	"NSPACE",                	/* 0x18 */
	"NSPACEL",               	/* 0x19 */
	"DIGIT",                 	/* 0x1a */
	"DIGITL",                	/* 0x1b */
	"NDIGIT",                	/* 0x1c */
	"NDIGITL",               	/* 0x1d */
	"CLUMP",                 	/* 0x1e */
	"BRANCH",                	/* 0x1f */
	"BACK",                  	/* 0x20 */
	"EXACT",                 	/* 0x21 */
	"EXACTF",                	/* 0x22 */
	"EXACTFL",               	/* 0x23 */
	"NOTHING",               	/* 0x24 */
	"TAIL",                  	/* 0x25 */
	"STAR",                  	/* 0x26 */
	"PLUS",                  	/* 0x27 */
	"CURLY",                 	/* 0x28 */
	"CURLYN",                	/* 0x29 */
	"CURLYM",                	/* 0x2a */
	"CURLYX",                	/* 0x2b */
	"WHILEM",                	/* 0x2c */
	"OPEN",                  	/* 0x2d */
	"CLOSE",                 	/* 0x2e */
	"REF",                   	/* 0x2f */
	"REFF",                  	/* 0x30 */
	"REFFL",                 	/* 0x31 */
	"IFMATCH",               	/* 0x32 */
	"UNLESSM",               	/* 0x33 */
	"SUSPEND",               	/* 0x34 */
	"IFTHEN",                	/* 0x35 */
	"GROUPP",                	/* 0x36 */
	"LONGJMP",               	/* 0x37 */
	"BRANCHJ",               	/* 0x38 */
	"EVAL",                  	/* 0x39 */
	"MINMOD",                	/* 0x3a */
	"LOGICAL",               	/* 0x3b */
	"RENUM",                 	/* 0x3c */
	"TRIE",                  	/* 0x3d */
	"TRIEC",                 	/* 0x3e */
	"AHOCORASICK",           	/* 0x3f */
	"AHOCORASICKC",          	/* 0x40 */
	"RECURSE",               	/* 0x41 */
	"SRECURSE",              	/* 0x42 */
	"NREF",                  	/* 0x43 */
	"NREFF",                 	/* 0x44 */
	"NREFFL",                	/* 0x45 */
	"NGROUPP",               	/* 0x46 */
	"RECURSEP",              	/* 0x47 */
	"DEFINEP",               	/* 0x48 */
	"OPFAIL",                	/* 0x49 */
	"OPTIMIZED",             	/* 0x4a */
	"PSEUDO",                	/* 0x4b */
	/* ------------ States ------------- */
	"TRIE_next",             	/* 0x4c */
	"TRIE_next_fail",        	/* 0x4d */
	"EVAL_AB",               	/* 0x4e */
	"EVAL_AB_fail",          	/* 0x4f */
	"CURLYX_end",            	/* 0x50 */
	"CURLYX_end_fail",       	/* 0x51 */
	"WHILEM_A_pre",          	/* 0x52 */
	"WHILEM_A_pre_fail",     	/* 0x53 */
	"WHILEM_A_min",          	/* 0x54 */
	"WHILEM_A_min_fail",     	/* 0x55 */
	"WHILEM_A_max",          	/* 0x56 */
	"WHILEM_A_max_fail",     	/* 0x57 */
	"WHILEM_B_min",          	/* 0x58 */
	"WHILEM_B_min_fail",     	/* 0x59 */
	"WHILEM_B_max",          	/* 0x5a */
	"WHILEM_B_max_fail",     	/* 0x5b */
	"BRANCH_next",           	/* 0x5c */
	"BRANCH_next_fail",      	/* 0x5d */
	"CURLYM_A",              	/* 0x5e */
	"CURLYM_A_fail",         	/* 0x5f */
	"CURLYM_B",              	/* 0x60 */
	"CURLYM_B_fail",         	/* 0x61 */
	"IFMATCH_A",             	/* 0x62 */
	"IFMATCH_A_fail",        	/* 0x63 */
	"CURLY_B_min_known",     	/* 0x64 */
	"CURLY_B_min_known_fail",	/* 0x65 */
	"CURLY_B_min",           	/* 0x66 */
	"CURLY_B_min_fail",      	/* 0x67 */
	"CURLY_B_max",           	/* 0x68 */
	"CURLY_B_max_fail",      	/* 0x69 */
};
#endif /* DEBUGGING */
#else
#ifdef DEBUGGING
extern const char * reg_name[];
#endif
#endif /* REG_COMP_C */

/* ex: set ro: */
Commit	Line	Data
37442d52 RGS	1	/* -- buffer-read-only: t --
37442d52 RGS	2	!!!!!!! DO NOT EDIT THIS FILE !!!!!!!
885f9e59	3	This file is built by regcomp.pl from regcomp.sym.
d09b2d29 IZ	4	Any changes made here will be lost!
	5	*/
	6
6bda09f9 YO	7	/* Regops and State definitions */
6bda09f9 YO	8
7f69552c YO	9	#define REGNODE_MAX 75
7f69552c YO	10	#define REGMATCH_STATE_MAX 105
03363afd	11
f9f4320a YO	12	#define END 0 /* 0000 End of program. */
	13	#define SUCCEED 1 /* 0x01 Return from a subroutine, basically. */
	14	#define BOL 2 /* 0x02 Match "" at beginning of line. */
	15	#define MBOL 3 /* 0x03 Same, assuming multiline. */
	16	#define SBOL 4 /* 0x04 Same, assuming singleline. */
	17	#define EOS 5 /* 0x05 Match "" at end of string. */
	18	#define EOL 6 /* 0x06 Match "" at end of line. */
	19	#define MEOL 7 /* 0x07 Same, assuming multiline. */
	20	#define SEOL 8 /* 0x08 Same, assuming singleline. */
	21	#define BOUND 9 /* 0x09 Match "" at any word boundary */
	22	#define BOUNDL 10 /* 0x0a Match "" at any word boundary */
	23	#define NBOUND 11 /* 0x0b Match "" at any word non-boundary */
	24	#define NBOUNDL 12 /* 0x0c Match "" at any word non-boundary */
	25	#define GPOS 13 /* 0x0d Matches where last m//g left off. */
	26	#define REG_ANY 14 /* 0x0e Match any one character (except newline). */
	27	#define SANY 15 /* 0x0f Match any one character. */
	28	#define CANY 16 /* 0x10 Match any one byte. */
	29	#define ANYOF 17 /* 0x11 Match character in (or not in) this class. */
	30	#define ALNUM 18 /* 0x12 Match any alphanumeric character */
	31	#define ALNUML 19 /* 0x13 Match any alphanumeric char in locale */
	32	#define NALNUM 20 /* 0x14 Match any non-alphanumeric character */
	33	#define NALNUML 21 /* 0x15 Match any non-alphanumeric char in locale */
	34	#define SPACE 22 /* 0x16 Match any whitespace character */
	35	#define SPACEL 23 /* 0x17 Match any whitespace char in locale */
	36	#define NSPACE 24 /* 0x18 Match any non-whitespace character */
	37	#define NSPACEL 25 /* 0x19 Match any non-whitespace char in locale */
	38	#define DIGIT 26 /* 0x1a Match any numeric character */
	39	#define DIGITL 27 /* 0x1b Match any numeric character in locale */
	40	#define NDIGIT 28 /* 0x1c Match any non-numeric character */
	41	#define NDIGITL 29 /* 0x1d Match any non-numeric character in locale */
	42	#define CLUMP 30 /* 0x1e Match any combining character sequence */
	43	#define BRANCH 31 /* 0x1f Match this alternative, or the next... */
	44	#define BACK 32 /* 0x20 Match "", "next" ptr points backward. */
	45	#define EXACT 33 /* 0x21 Match this string (preceded by length). */
	46	#define EXACTF 34 /* 0x22 Match this string, folded (prec. by length). */
	47	#define EXACTFL 35 /* 0x23 Match this string, folded in locale (w/len). */
	48	#define NOTHING 36 /* 0x24 Match empty string. */
	49	#define TAIL 37 /* 0x25 Match empty string. Can jump here from outside. */
	50	#define STAR 38 /* 0x26 Match this (simple) thing 0 or more times. */
	51	#define PLUS 39 /* 0x27 Match this (simple) thing 1 or more times. */
	52	#define CURLY 40 /* 0x28 Match this simple thing {n,m} times. */
40d049e4 YO	53	#define CURLYN 41 /* 0x29 Capture next-after-this simple thing */
40d049e4 YO	54	#define CURLYM 42 /* 0x2a Capture this medium-complex thing {n,m} times. */
f9f4320a YO	55	#define CURLYX 43 /* 0x2b Match this complex thing {n,m} times. */
	56	#define WHILEM 44 /* 0x2c Do curly processing and see if rest matches. */
	57	#define OPEN 45 /* 0x2d Mark this point in input as start of */
	58	#define CLOSE 46 /* 0x2e Analogous to OPEN. */
	59	#define REF 47 /* 0x2f Match some already matched string */
	60	#define REFF 48 /* 0x30 Match already matched string, folded */
	61	#define REFFL 49 /* 0x31 Match already matched string, folded in loc. */
	62	#define IFMATCH 50 /* 0x32 Succeeds if the following matches. */
	63	#define UNLESSM 51 /* 0x33 Fails if the following matches. */
	64	#define SUSPEND 52 /* 0x34 "Independent" sub-RE. */
	65	#define IFTHEN 53 /* 0x35 Switch, should be preceeded by switcher . */
	66	#define GROUPP 54 /* 0x36 Whether the group matched. */
	67	#define LONGJMP 55 /* 0x37 Jump far away. */
	68	#define BRANCHJ 56 /* 0x38 BRANCH with long offset. */
	69	#define EVAL 57 /* 0x39 Execute some Perl code. */
	70	#define MINMOD 58 /* 0x3a Next operator is not greedy. */
	71	#define LOGICAL 59 /* 0x3b Next opcode should set the flag only. */
	72	#define RENUM 60 /* 0x3c Group with independently numbered parens. */
	73	#define TRIE 61 /* 0x3d Match many EXACT(FL?)? at once. flags==type */
	74	#define TRIEC 62 /* 0x3e Same as TRIE, but with embedded charclass data */
	75	#define AHOCORASICK 63 /* 0x3f Aho Corasick stclass. flags==type */
	76	#define AHOCORASICKC 64 /* 0x40 Same as AHOCORASICK, but with embedded charclass data */
6bda09f9 YO	77	#define RECURSE 65 /* 0x41 recurse to paren arg1 at (signed) ofs arg2 */
6bda09f9 YO	78	#define SRECURSE 66 /* 0x42 recurse to start of pattern */
81714fb9 YO	79	#define NREF 67 /* 0x43 Match some already matched string */
	80	#define NREFF 68 /* 0x44 Match already matched string, folded */
	81	#define NREFFL 69 /* 0x45 Match already matched string, folded in loc. */
0a4db386 YO	82	#define NGROUPP 70 /* 0x46 Whether the group matched. */
	83	#define RECURSEP 71 /* 0x47 Whether we are in a specific recurse. */
	84	#define DEFINEP 72 /* 0x48 Never execute directly. */
7f69552c YO	85	#define OPFAIL 73 /* 0x49 Same as (?!) */
	86	#define OPTIMIZED 74 /* 0x4a Placeholder for dump. */
	87	#define PSEUDO 75 /* 0x4b Pseudo opcode for internal use. */
03363afd YO	88
	89	/* ------------ States ------------- */
	90
7f69552c YO	91	#define TRIE_next 76 /* 0x4c Regmatch state for TRIE */
	92	#define TRIE_next_fail 77 /* 0x4d Regmatch state for TRIE */
	93	#define EVAL_AB 78 /* 0x4e Regmatch state for EVAL */
	94	#define EVAL_AB_fail 79 /* 0x4f Regmatch state for EVAL */
	95	#define CURLYX_end 80 /* 0x50 Regmatch state for CURLYX */
	96	#define CURLYX_end_fail 81 /* 0x51 Regmatch state for CURLYX */
	97	#define WHILEM_A_pre 82 /* 0x52 Regmatch state for WHILEM */
	98	#define WHILEM_A_pre_fail 83 /* 0x53 Regmatch state for WHILEM */
	99	#define WHILEM_A_min 84 /* 0x54 Regmatch state for WHILEM */
	100	#define WHILEM_A_min_fail 85 /* 0x55 Regmatch state for WHILEM */
	101	#define WHILEM_A_max 86 /* 0x56 Regmatch state for WHILEM */
	102	#define WHILEM_A_max_fail 87 /* 0x57 Regmatch state for WHILEM */
	103	#define WHILEM_B_min 88 /* 0x58 Regmatch state for WHILEM */
	104	#define WHILEM_B_min_fail 89 /* 0x59 Regmatch state for WHILEM */
	105	#define WHILEM_B_max 90 /* 0x5a Regmatch state for WHILEM */
	106	#define WHILEM_B_max_fail 91 /* 0x5b Regmatch state for WHILEM */
	107	#define BRANCH_next 92 /* 0x5c Regmatch state for BRANCH */
	108	#define BRANCH_next_fail 93 /* 0x5d Regmatch state for BRANCH */
	109	#define CURLYM_A 94 /* 0x5e Regmatch state for CURLYM */
	110	#define CURLYM_A_fail 95 /* 0x5f Regmatch state for CURLYM */
	111	#define CURLYM_B 96 /* 0x60 Regmatch state for CURLYM */
	112	#define CURLYM_B_fail 97 /* 0x61 Regmatch state for CURLYM */
	113	#define IFMATCH_A 98 /* 0x62 Regmatch state for IFMATCH */
	114	#define IFMATCH_A_fail 99 /* 0x63 Regmatch state for IFMATCH */
	115	#define CURLY_B_min_known 100 /* 0x64 Regmatch state for CURLY */
	116	#define CURLY_B_min_known_fail 101 /* 0x65 Regmatch state for CURLY */
	117	#define CURLY_B_min 102 /* 0x66 Regmatch state for CURLY */
	118	#define CURLY_B_min_fail 103 /* 0x67 Regmatch state for CURLY */
	119	#define CURLY_B_max 104 /* 0x68 Regmatch state for CURLY */
	120	#define CURLY_B_max_fail 105 /* 0x69 Regmatch state for CURLY */
03363afd	121
6bda09f9	122	/* PL_regkind[] What type of regop or state is this. */
d09b2d29 IZ	123
d09b2d29 IZ	124	#ifndef DOINIT
22c35a8c	125	EXTCONST U8 PL_regkind[];
d09b2d29	126	#else
22c35a8c	127	EXTCONST U8 PL_regkind[] = {
0a4db386 YO	128	END, /* END */
	129	END, /* SUCCEED */
	130	BOL, /* BOL */
	131	BOL, /* MBOL */
	132	BOL, /* SBOL */
	133	EOL, /* EOS */
	134	EOL, /* EOL */
	135	EOL, /* MEOL */
	136	EOL, /* SEOL */
	137	BOUND, /* BOUND */
	138	BOUND, /* BOUNDL */
	139	NBOUND, /* NBOUND */
	140	NBOUND, /* NBOUNDL */
	141	GPOS, /* GPOS */
	142	REG_ANY, /* REG_ANY */
	143	REG_ANY, /* SANY */
	144	REG_ANY, /* CANY */
	145	ANYOF, /* ANYOF */
	146	ALNUM, /* ALNUM */
	147	ALNUM, /* ALNUML */
	148	NALNUM, /* NALNUM */
	149	NALNUM, /* NALNUML */
	150	SPACE, /* SPACE */
	151	SPACE, /* SPACEL */
	152	NSPACE, /* NSPACE */
	153	NSPACE, /* NSPACEL */
	154	DIGIT, /* DIGIT */
	155	DIGIT, /* DIGITL */
	156	NDIGIT, /* NDIGIT */
	157	NDIGIT, /* NDIGITL */
	158	CLUMP, /* CLUMP */
	159	BRANCH, /* BRANCH */
	160	BACK, /* BACK */
	161	EXACT, /* EXACT */
	162	EXACT, /* EXACTF */
	163	EXACT, /* EXACTFL */
	164	NOTHING, /* NOTHING */
	165	NOTHING, /* TAIL */
	166	STAR, /* STAR */
	167	PLUS, /* PLUS */
	168	CURLY, /* CURLY */
	169	CURLY, /* CURLYN */
	170	CURLY, /* CURLYM */
	171	CURLY, /* CURLYX */
	172	WHILEM, /* WHILEM */
	173	OPEN, /* OPEN */
	174	CLOSE, /* CLOSE */
	175	REF, /* REF */
	176	REF, /* REFF */
	177	REF, /* REFFL */
	178	BRANCHJ, /* IFMATCH */
	179	BRANCHJ, /* UNLESSM */
	180	BRANCHJ, /* SUSPEND */
	181	BRANCHJ, /* IFTHEN */
	182	GROUPP, /* GROUPP */
	183	LONGJMP, /* LONGJMP */
	184	BRANCHJ, /* BRANCHJ */
	185	EVAL, /* EVAL */
	186	MINMOD, /* MINMOD */
	187	LOGICAL, /* LOGICAL */
	188	BRANCHJ, /* RENUM */
	189	TRIE, /* TRIE */
	190	TRIE, /* TRIEC */
	191	TRIE, /* AHOCORASICK */
192	TRIE, /* AHOCORASICKC */
193	RECURSE, /* RECURSE */
40d049e4	194	SRECURSE, /* SRECURSE */
0a4db386 YO	195	NREF, /* NREF */
	196	NREF, /* NREFF */
	197	NREF, /* NREFFL */
	198	NGROUPP, /* NGROUPP */
	199	RECURSEP, /* RECURSEP */
	200	DEFINEP, /* DEFINEP */
7f69552c	201	OPFAIL, /* OPFAIL */
0a4db386 YO	202	NOTHING, /* OPTIMIZED */
0a4db386 YO	203	PSEUDO, /* PSEUDO */
03363afd	204	/* ------------ States ------------- */
0a4db386 YO	205	TRIE, /* TRIE_next */
	206	TRIE, /* TRIE_next_fail */
	207	EVAL, /* EVAL_AB */
	208	EVAL, /* EVAL_AB_fail */
	209	CURLYX, /* CURLYX_end */
	210	CURLYX, /* CURLYX_end_fail */
	211	WHILEM, /* WHILEM_A_pre */
	212	WHILEM, /* WHILEM_A_pre_fail */
	213	WHILEM, /* WHILEM_A_min */
	214	WHILEM, /* WHILEM_A_min_fail */
	215	WHILEM, /* WHILEM_A_max */
	216	WHILEM, /* WHILEM_A_max_fail */
	217	WHILEM, /* WHILEM_B_min */
	218	WHILEM, /* WHILEM_B_min_fail */
	219	WHILEM, /* WHILEM_B_max */
	220	WHILEM, /* WHILEM_B_max_fail */
	221	BRANCH, /* BRANCH_next */
	222	BRANCH, /* BRANCH_next_fail */
	223	CURLYM, /* CURLYM_A */
	224	CURLYM, /* CURLYM_A_fail */
	225	CURLYM, /* CURLYM_B */
	226	CURLYM, /* CURLYM_B_fail */
	227	IFMATCH, /* IFMATCH_A */
	228	IFMATCH, /* IFMATCH_A_fail */
	229	CURLY, /* CURLY_B_min_known */
	230	CURLY, /* CURLY_B_min_known_fail */
	231	CURLY, /* CURLY_B_min */
	232	CURLY, /* CURLY_B_min_fail */
	233	CURLY, /* CURLY_B_max */
	234	CURLY, /* CURLY_B_max_fail */
d09b2d29 IZ	235	};
	236	#endif
	237
6bda09f9	238	/* regarglen[] - How large is the argument part of the node (in regnodes) */
d09b2d29 IZ	239
d09b2d29 IZ	240	#ifdef REG_COMP_C
29de9391	241	static const U8 regarglen[] = {
03363afd YO	242	0, /* END */
	243	0, /* SUCCEED */
	244	0, /* BOL */
	245	0, /* MBOL */
	246	0, /* SBOL */
	247	0, /* EOS */
	248	0, /* EOL */
	249	0, /* MEOL */
	250	0, /* SEOL */
	251	0, /* BOUND */
	252	0, /* BOUNDL */
	253	0, /* NBOUND */
	254	0, /* NBOUNDL */
	255	0, /* GPOS */
	256	0, /* REG_ANY */
	257	0, /* SANY */
	258	0, /* CANY */
	259	0, /* ANYOF */
	260	0, /* ALNUM */
	261	0, /* ALNUML */
	262	0, /* NALNUM */
	263	0, /* NALNUML */
	264	0, /* SPACE */
	265	0, /* SPACEL */
	266	0, /* NSPACE */
	267	0, /* NSPACEL */
	268	0, /* DIGIT */
	269	0, /* DIGITL */
	270	0, /* NDIGIT */
	271	0, /* NDIGITL */
	272	0, /* CLUMP */
	273	0, /* BRANCH */
	274	0, /* BACK */
	275	0, /* EXACT */
	276	0, /* EXACTF */
	277	0, /* EXACTFL */
	278	0, /* NOTHING */
	279	0, /* TAIL */
	280	0, /* STAR */
	281	0, /* PLUS */
	282	EXTRA_SIZE(struct regnode_2), /* CURLY */
	283	EXTRA_SIZE(struct regnode_2), /* CURLYN */
	284	EXTRA_SIZE(struct regnode_2), /* CURLYM */
	285	EXTRA_SIZE(struct regnode_2), /* CURLYX */
	286	0, /* WHILEM */
	287	EXTRA_SIZE(struct regnode_1), /* OPEN */
	288	EXTRA_SIZE(struct regnode_1), /* CLOSE */
	289	EXTRA_SIZE(struct regnode_1), /* REF */
	290	EXTRA_SIZE(struct regnode_1), /* REFF */
	291	EXTRA_SIZE(struct regnode_1), /* REFFL */
	292	EXTRA_SIZE(struct regnode_1), /* IFMATCH */
	293	EXTRA_SIZE(struct regnode_1), /* UNLESSM */
	294	EXTRA_SIZE(struct regnode_1), /* SUSPEND */
	295	EXTRA_SIZE(struct regnode_1), /* IFTHEN */
	296	EXTRA_SIZE(struct regnode_1), /* GROUPP */
	297	EXTRA_SIZE(struct regnode_1), /* LONGJMP */
	298	EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
	299	EXTRA_SIZE(struct regnode_1), /* EVAL */
	300	0, /* MINMOD */
	301	0, /* LOGICAL */
	302	EXTRA_SIZE(struct regnode_1), /* RENUM */
	303	EXTRA_SIZE(struct regnode_1), /* TRIE */
	304	EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
	305	EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
306	EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
6bda09f9 YO	307	EXTRA_SIZE(struct regnode_2L), /* RECURSE */
6bda09f9 YO	308	0, /* SRECURSE */
81714fb9 YO	309	EXTRA_SIZE(struct regnode_1), /* NREF */
	310	EXTRA_SIZE(struct regnode_1), /* NREFF */
	311	EXTRA_SIZE(struct regnode_1), /* NREFFL */
0a4db386 YO	312	EXTRA_SIZE(struct regnode_1), /* NGROUPP */
	313	EXTRA_SIZE(struct regnode_1), /* RECURSEP */
	314	EXTRA_SIZE(struct regnode_1), /* DEFINEP */
7f69552c	315	0, /* OPFAIL */
03363afd YO	316	0, /* OPTIMIZED */
03363afd YO	317	0, /* PSEUDO */
d09b2d29 IZ	318	};
d09b2d29 IZ	319
6bda09f9 YO	320	/* reg_off_by_arg[] - Which argument holds the offset to the next node */
6bda09f9 YO	321
29de9391	322	static const char reg_off_by_arg[] = {
03363afd YO	323	0, /* END */
	324	0, /* SUCCEED */
	325	0, /* BOL */
	326	0, /* MBOL */
	327	0, /* SBOL */
	328	0, /* EOS */
	329	0, /* EOL */
	330	0, /* MEOL */
	331	0, /* SEOL */
	332	0, /* BOUND */
	333	0, /* BOUNDL */
	334	0, /* NBOUND */
	335	0, /* NBOUNDL */
	336	0, /* GPOS */
	337	0, /* REG_ANY */
	338	0, /* SANY */
	339	0, /* CANY */
	340	0, /* ANYOF */
	341	0, /* ALNUM */
	342	0, /* ALNUML */
	343	0, /* NALNUM */
	344	0, /* NALNUML */
	345	0, /* SPACE */
	346	0, /* SPACEL */
	347	0, /* NSPACE */
	348	0, /* NSPACEL */
	349	0, /* DIGIT */
	350	0, /* DIGITL */
	351	0, /* NDIGIT */
	352	0, /* NDIGITL */
	353	0, /* CLUMP */
	354	0, /* BRANCH */
	355	0, /* BACK */
	356	0, /* EXACT */
	357	0, /* EXACTF */
	358	0, /* EXACTFL */
	359	0, /* NOTHING */
	360	0, /* TAIL */
	361	0, /* STAR */
	362	0, /* PLUS */
	363	0, /* CURLY */
	364	0, /* CURLYN */
	365	0, /* CURLYM */
	366	0, /* CURLYX */
	367	0, /* WHILEM */
	368	0, /* OPEN */
	369	0, /* CLOSE */
	370	0, /* REF */
	371	0, /* REFF */
	372	0, /* REFFL */
	373	2, /* IFMATCH */
	374	2, /* UNLESSM */
	375	1, /* SUSPEND */
	376	1, /* IFTHEN */
	377	0, /* GROUPP */
	378	1, /* LONGJMP */
	379	1, /* BRANCHJ */
	380	0, /* EVAL */
	381	0, /* MINMOD */
	382	0, /* LOGICAL */
	383	1, /* RENUM */
	384	0, /* TRIE */
	385	0, /* TRIEC */
	386	0, /* AHOCORASICK */
387	0, /* AHOCORASICKC */
6bda09f9 YO	388	0, /* RECURSE */
6bda09f9 YO	389	0, /* SRECURSE */
81714fb9 YO	390	0, /* NREF */
	391	0, /* NREFF */
	392	0, /* NREFFL */
0a4db386 YO	393	0, /* NGROUPP */
	394	0, /* RECURSEP */
	395	0, /* DEFINEP */
7f69552c	396	0, /* OPFAIL */
03363afd YO	397	0, /* OPTIMIZED */
03363afd YO	398	0, /* PSEUDO */
d09b2d29	399	};
885f9e59	400
6bda09f9 YO	401	/* reg_name[] - Opcode/state names in string form, for debugging */
6bda09f9 YO	402
885f9e59	403	#ifdef DEBUGGING
6d9c9890	404	const char * reg_name[] = {
03363afd YO	405	"END", /* 0000 */
	406	"SUCCEED", /* 0x01 */
	407	"BOL", /* 0x02 */
	408	"MBOL", /* 0x03 */
	409	"SBOL", /* 0x04 */
	410	"EOS", /* 0x05 */
	411	"EOL", /* 0x06 */
	412	"MEOL", /* 0x07 */
	413	"SEOL", /* 0x08 */
	414	"BOUND", /* 0x09 */
	415	"BOUNDL", /* 0x0a */
	416	"NBOUND", /* 0x0b */
	417	"NBOUNDL", /* 0x0c */
	418	"GPOS", /* 0x0d */
	419	"REG_ANY", /* 0x0e */
	420	"SANY", /* 0x0f */
	421	"CANY", /* 0x10 */
	422	"ANYOF", /* 0x11 */
	423	"ALNUM", /* 0x12 */
	424	"ALNUML", /* 0x13 */
	425	"NALNUM", /* 0x14 */
	426	"NALNUML", /* 0x15 */
	427	"SPACE", /* 0x16 */
	428	"SPACEL", /* 0x17 */
	429	"NSPACE", /* 0x18 */
	430	"NSPACEL", /* 0x19 */
	431	"DIGIT", /* 0x1a */
	432	"DIGITL", /* 0x1b */
	433	"NDIGIT", /* 0x1c */
	434	"NDIGITL", /* 0x1d */
	435	"CLUMP", /* 0x1e */
	436	"BRANCH", /* 0x1f */
	437	"BACK", /* 0x20 */
	438	"EXACT", /* 0x21 */
	439	"EXACTF", /* 0x22 */
	440	"EXACTFL", /* 0x23 */
	441	"NOTHING", /* 0x24 */
	442	"TAIL", /* 0x25 */
	443	"STAR", /* 0x26 */
	444	"PLUS", /* 0x27 */
	445	"CURLY", /* 0x28 */
	446	"CURLYN", /* 0x29 */
	447	"CURLYM", /* 0x2a */
	448	"CURLYX", /* 0x2b */
	449	"WHILEM", /* 0x2c */
	450	"OPEN", /* 0x2d */
	451	"CLOSE", /* 0x2e */
	452	"REF", /* 0x2f */
	453	"REFF", /* 0x30 */
	454	"REFFL", /* 0x31 */
	455	"IFMATCH", /* 0x32 */
	456	"UNLESSM", /* 0x33 */
	457	"SUSPEND", /* 0x34 */
	458	"IFTHEN", /* 0x35 */
	459	"GROUPP", /* 0x36 */
	460	"LONGJMP", /* 0x37 */
	461	"BRANCHJ", /* 0x38 */
	462	"EVAL", /* 0x39 */
	463	"MINMOD", /* 0x3a */
	464	"LOGICAL", /* 0x3b */
	465	"RENUM", /* 0x3c */
	466	"TRIE", /* 0x3d */
	467	"TRIEC", /* 0x3e */
	468	"AHOCORASICK", /* 0x3f */
469	"AHOCORASICKC", /* 0x40 */
6bda09f9 YO	470	"RECURSE", /* 0x41 */
6bda09f9 YO	471	"SRECURSE", /* 0x42 */
81714fb9 YO	472	"NREF", /* 0x43 */
	473	"NREFF", /* 0x44 */
	474	"NREFFL", /* 0x45 */
0a4db386 YO	475	"NGROUPP", /* 0x46 */
	476	"RECURSEP", /* 0x47 */
	477	"DEFINEP", /* 0x48 */
7f69552c YO	478	"OPFAIL", /* 0x49 */
	479	"OPTIMIZED", /* 0x4a */
	480	"PSEUDO", /* 0x4b */
03363afd	481	/* ------------ States ------------- */
7f69552c YO	482	"TRIE_next", /* 0x4c */
	483	"TRIE_next_fail", /* 0x4d */
	484	"EVAL_AB", /* 0x4e */
	485	"EVAL_AB_fail", /* 0x4f */
	486	"CURLYX_end", /* 0x50 */
	487	"CURLYX_end_fail", /* 0x51 */
	488	"WHILEM_A_pre", /* 0x52 */
	489	"WHILEM_A_pre_fail", /* 0x53 */
	490	"WHILEM_A_min", /* 0x54 */
	491	"WHILEM_A_min_fail", /* 0x55 */
	492	"WHILEM_A_max", /* 0x56 */
	493	"WHILEM_A_max_fail", /* 0x57 */
	494	"WHILEM_B_min", /* 0x58 */
	495	"WHILEM_B_min_fail", /* 0x59 */
	496	"WHILEM_B_max", /* 0x5a */
	497	"WHILEM_B_max_fail", /* 0x5b */
	498	"BRANCH_next", /* 0x5c */
	499	"BRANCH_next_fail", /* 0x5d */
	500	"CURLYM_A", /* 0x5e */
	501	"CURLYM_A_fail", /* 0x5f */
	502	"CURLYM_B", /* 0x60 */
	503	"CURLYM_B_fail", /* 0x61 */
	504	"IFMATCH_A", /* 0x62 */
	505	"IFMATCH_A_fail", /* 0x63 */
	506	"CURLY_B_min_known", /* 0x64 */
	507	"CURLY_B_min_known_fail", /* 0x65 */
	508	"CURLY_B_min", /* 0x66 */
	509	"CURLY_B_min_fail", /* 0x67 */
	510	"CURLY_B_max", /* 0x68 */
	511	"CURLY_B_max_fail", /* 0x69 */
885f9e59	512	};
885f9e59	513	#endif /* DEBUGGING */
03363afd YO	514	#else
03363afd YO	515	#ifdef DEBUGGING
6d9c9890	516	extern const char * reg_name[];
03363afd	517	#endif
d09b2d29 IZ	518	#endif /* REG_COMP_C */
d09b2d29 IZ	519
37442d52	520	/* ex: set ro: */