[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           	71
#define REGMATCH_STATE_MAX    	101

#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 Match next-after-this simple thing */
#define	CURLYM                	42	/* 0x2a Match 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	OPTIMIZED             	70	/* 0x46 Placeholder for dump. */
#define	PSEUDO                	71	/* 0x47 Pseudo opcode for internal use. */

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

#define	TRIE_next             	72	/* 0x48 Regmatch state for TRIE */
#define	TRIE_next_fail        	73	/* 0x49 Regmatch state for TRIE */
#define	EVAL_AB               	74	/* 0x4a Regmatch state for EVAL */
#define	EVAL_AB_fail          	75	/* 0x4b Regmatch state for EVAL */
#define	CURLYX_end            	76	/* 0x4c Regmatch state for CURLYX */
#define	CURLYX_end_fail       	77	/* 0x4d Regmatch state for CURLYX */
#define	WHILEM_A_pre          	78	/* 0x4e Regmatch state for WHILEM */
#define	WHILEM_A_pre_fail     	79	/* 0x4f Regmatch state for WHILEM */
#define	WHILEM_A_min          	80	/* 0x50 Regmatch state for WHILEM */
#define	WHILEM_A_min_fail     	81	/* 0x51 Regmatch state for WHILEM */
#define	WHILEM_A_max          	82	/* 0x52 Regmatch state for WHILEM */
#define	WHILEM_A_max_fail     	83	/* 0x53 Regmatch state for WHILEM */
#define	WHILEM_B_min          	84	/* 0x54 Regmatch state for WHILEM */
#define	WHILEM_B_min_fail     	85	/* 0x55 Regmatch state for WHILEM */
#define	WHILEM_B_max          	86	/* 0x56 Regmatch state for WHILEM */
#define	WHILEM_B_max_fail     	87	/* 0x57 Regmatch state for WHILEM */
#define	BRANCH_next           	88	/* 0x58 Regmatch state for BRANCH */
#define	BRANCH_next_fail      	89	/* 0x59 Regmatch state for BRANCH */
#define	CURLYM_A              	90	/* 0x5a Regmatch state for CURLYM */
#define	CURLYM_A_fail         	91	/* 0x5b Regmatch state for CURLYM */
#define	CURLYM_B              	92	/* 0x5c Regmatch state for CURLYM */
#define	CURLYM_B_fail         	93	/* 0x5d Regmatch state for CURLYM */
#define	IFMATCH_A             	94	/* 0x5e Regmatch state for IFMATCH */
#define	IFMATCH_A_fail        	95	/* 0x5f Regmatch state for IFMATCH */
#define	CURLY_B_min_known     	96	/* 0x60 Regmatch state for CURLY */
#define	CURLY_B_min_known_fail	97	/* 0x61 Regmatch state for CURLY */
#define	CURLY_B_min           	98	/* 0x62 Regmatch state for CURLY */
#define	CURLY_B_min_fail      	99	/* 0x63 Regmatch state for CURLY */
#define	CURLY_B_max           	100	/* 0x64 Regmatch state for CURLY */
#define	CURLY_B_max_fail      	101	/* 0x65 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                */
	RECURSE,	/* SRECURSE               */
	NREF,   	/* NREF                   */
	NREF,   	/* NREFF                  */
	NREF,   	/* NREFFL                 */
	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       */
	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,	/* 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 */
	"OPTIMIZED",             	/* 0x46 */
	"PSEUDO",                	/* 0x47 */
	/* ------------ States ------------- */
	"TRIE_next",             	/* 0x48 */
	"TRIE_next_fail",        	/* 0x49 */
	"EVAL_AB",               	/* 0x4a */
	"EVAL_AB_fail",          	/* 0x4b */
	"CURLYX_end",            	/* 0x4c */
	"CURLYX_end_fail",       	/* 0x4d */
	"WHILEM_A_pre",          	/* 0x4e */
	"WHILEM_A_pre_fail",     	/* 0x4f */
	"WHILEM_A_min",          	/* 0x50 */
	"WHILEM_A_min_fail",     	/* 0x51 */
	"WHILEM_A_max",          	/* 0x52 */
	"WHILEM_A_max_fail",     	/* 0x53 */
	"WHILEM_B_min",          	/* 0x54 */
	"WHILEM_B_min_fail",     	/* 0x55 */
	"WHILEM_B_max",          	/* 0x56 */
	"WHILEM_B_max_fail",     	/* 0x57 */
	"BRANCH_next",           	/* 0x58 */
	"BRANCH_next_fail",      	/* 0x59 */
	"CURLYM_A",              	/* 0x5a */
	"CURLYM_A_fail",         	/* 0x5b */
	"CURLYM_B",              	/* 0x5c */
	"CURLYM_B_fail",         	/* 0x5d */
	"IFMATCH_A",             	/* 0x5e */
	"IFMATCH_A_fail",        	/* 0x5f */
	"CURLY_B_min_known",     	/* 0x60 */
	"CURLY_B_min_known_fail",	/* 0x61 */
	"CURLY_B_min",           	/* 0x62 */
	"CURLY_B_min_fail",      	/* 0x63 */
	"CURLY_B_max",           	/* 0x64 */
	"CURLY_B_max_fail",      	/* 0x65 */
};
#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
81714fb9 YO	9	#define REGNODE_MAX 71
81714fb9 YO	10	#define REGMATCH_STATE_MAX 101
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. */
	53	#define CURLYN 41 /* 0x29 Match next-after-this simple thing */
	54	#define CURLYM 42 /* 0x2a Match this medium-complex thing {n,m} times. */
	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. */
	82	#define OPTIMIZED 70 /* 0x46 Placeholder for dump. */
	83	#define PSEUDO 71 /* 0x47 Pseudo opcode for internal use. */
03363afd YO	84
	85	/* ------------ States ------------- */
	86
81714fb9 YO	87	#define TRIE_next 72 /* 0x48 Regmatch state for TRIE */
	88	#define TRIE_next_fail 73 /* 0x49 Regmatch state for TRIE */
	89	#define EVAL_AB 74 /* 0x4a Regmatch state for EVAL */
	90	#define EVAL_AB_fail 75 /* 0x4b Regmatch state for EVAL */
	91	#define CURLYX_end 76 /* 0x4c Regmatch state for CURLYX */
	92	#define CURLYX_end_fail 77 /* 0x4d Regmatch state for CURLYX */
	93	#define WHILEM_A_pre 78 /* 0x4e Regmatch state for WHILEM */
	94	#define WHILEM_A_pre_fail 79 /* 0x4f Regmatch state for WHILEM */
	95	#define WHILEM_A_min 80 /* 0x50 Regmatch state for WHILEM */
	96	#define WHILEM_A_min_fail 81 /* 0x51 Regmatch state for WHILEM */
	97	#define WHILEM_A_max 82 /* 0x52 Regmatch state for WHILEM */
	98	#define WHILEM_A_max_fail 83 /* 0x53 Regmatch state for WHILEM */
	99	#define WHILEM_B_min 84 /* 0x54 Regmatch state for WHILEM */
	100	#define WHILEM_B_min_fail 85 /* 0x55 Regmatch state for WHILEM */
	101	#define WHILEM_B_max 86 /* 0x56 Regmatch state for WHILEM */
	102	#define WHILEM_B_max_fail 87 /* 0x57 Regmatch state for WHILEM */
	103	#define BRANCH_next 88 /* 0x58 Regmatch state for BRANCH */
	104	#define BRANCH_next_fail 89 /* 0x59 Regmatch state for BRANCH */
	105	#define CURLYM_A 90 /* 0x5a Regmatch state for CURLYM */
	106	#define CURLYM_A_fail 91 /* 0x5b Regmatch state for CURLYM */
	107	#define CURLYM_B 92 /* 0x5c Regmatch state for CURLYM */
	108	#define CURLYM_B_fail 93 /* 0x5d Regmatch state for CURLYM */
	109	#define IFMATCH_A 94 /* 0x5e Regmatch state for IFMATCH */
	110	#define IFMATCH_A_fail 95 /* 0x5f Regmatch state for IFMATCH */
	111	#define CURLY_B_min_known 96 /* 0x60 Regmatch state for CURLY */
	112	#define CURLY_B_min_known_fail 97 /* 0x61 Regmatch state for CURLY */
	113	#define CURLY_B_min 98 /* 0x62 Regmatch state for CURLY */
	114	#define CURLY_B_min_fail 99 /* 0x63 Regmatch state for CURLY */
	115	#define CURLY_B_max 100 /* 0x64 Regmatch state for CURLY */
	116	#define CURLY_B_max_fail 101 /* 0x65 Regmatch state for CURLY */
03363afd	117
6bda09f9	118	/* PL_regkind[] What type of regop or state is this. */
d09b2d29 IZ	119
d09b2d29 IZ	120	#ifndef DOINIT
22c35a8c	121	EXTCONST U8 PL_regkind[];
d09b2d29	122	#else
22c35a8c	123	EXTCONST U8 PL_regkind[] = {
03363afd YO	124	END, /* END */
	125	END, /* SUCCEED */
	126	BOL, /* BOL */
	127	BOL, /* MBOL */
	128	BOL, /* SBOL */
	129	EOL, /* EOS */
	130	EOL, /* EOL */
	131	EOL, /* MEOL */
	132	EOL, /* SEOL */
	133	BOUND, /* BOUND */
	134	BOUND, /* BOUNDL */
	135	NBOUND, /* NBOUND */
	136	NBOUND, /* NBOUNDL */
	137	GPOS, /* GPOS */
	138	REG_ANY, /* REG_ANY */
	139	REG_ANY, /* SANY */
	140	REG_ANY, /* CANY */
	141	ANYOF, /* ANYOF */
	142	ALNUM, /* ALNUM */
	143	ALNUM, /* ALNUML */
	144	NALNUM, /* NALNUM */
	145	NALNUM, /* NALNUML */
	146	SPACE, /* SPACE */
	147	SPACE, /* SPACEL */
	148	NSPACE, /* NSPACE */
	149	NSPACE, /* NSPACEL */
	150	DIGIT, /* DIGIT */
	151	DIGIT, /* DIGITL */
	152	NDIGIT, /* NDIGIT */
	153	NDIGIT, /* NDIGITL */
	154	CLUMP, /* CLUMP */
	155	BRANCH, /* BRANCH */
	156	BACK, /* BACK */
	157	EXACT, /* EXACT */
	158	EXACT, /* EXACTF */
	159	EXACT, /* EXACTFL */
	160	NOTHING, /* NOTHING */
	161	NOTHING, /* TAIL */
	162	STAR, /* STAR */
	163	PLUS, /* PLUS */
	164	CURLY, /* CURLY */
	165	CURLY, /* CURLYN */
	166	CURLY, /* CURLYM */
	167	CURLY, /* CURLYX */
	168	WHILEM, /* WHILEM */
	169	OPEN, /* OPEN */
	170	CLOSE, /* CLOSE */
	171	REF, /* REF */
	172	REF, /* REFF */
	173	REF, /* REFFL */
	174	BRANCHJ, /* IFMATCH */
	175	BRANCHJ, /* UNLESSM */
	176	BRANCHJ, /* SUSPEND */
	177	BRANCHJ, /* IFTHEN */
	178	GROUPP, /* GROUPP */
	179	LONGJMP, /* LONGJMP */
	180	BRANCHJ, /* BRANCHJ */
	181	EVAL, /* EVAL */
	182	MINMOD, /* MINMOD */
	183	LOGICAL, /* LOGICAL */
	184	BRANCHJ, /* RENUM */
	185	TRIE, /* TRIE */
	186	TRIE, /* TRIEC */
	187	TRIE, /* AHOCORASICK */
188	TRIE, /* AHOCORASICKC */
6bda09f9 YO	189	RECURSE, /* RECURSE */
6bda09f9 YO	190	RECURSE, /* SRECURSE */
81714fb9 YO	191	NREF, /* NREF */
	192	NREF, /* NREFF */
	193	NREF, /* NREFFL */
03363afd YO	194	NOTHING, /* OPTIMIZED */
	195	PSEUDO, /* PSEUDO */
	196	/* ------------ States ------------- */
	197	TRIE, /* TRIE_next */
	198	TRIE, /* TRIE_next_fail */
	199	EVAL, /* EVAL_AB */
	200	EVAL, /* EVAL_AB_fail */
c476f425 DM	201	CURLYX, /* CURLYX_end */
	202	CURLYX, /* CURLYX_end_fail */
	203	WHILEM, /* WHILEM_A_pre */
	204	WHILEM, /* WHILEM_A_pre_fail */
	205	WHILEM, /* WHILEM_A_min */
	206	WHILEM, /* WHILEM_A_min_fail */
	207	WHILEM, /* WHILEM_A_max */
	208	WHILEM, /* WHILEM_A_max_fail */
	209	WHILEM, /* WHILEM_B_min */
	210	WHILEM, /* WHILEM_B_min_fail */
	211	WHILEM, /* WHILEM_B_max */
	212	WHILEM, /* WHILEM_B_max_fail */
03363afd YO	213	BRANCH, /* BRANCH_next */
	214	BRANCH, /* BRANCH_next_fail */
	215	CURLYM, /* CURLYM_A */
	216	CURLYM, /* CURLYM_A_fail */
	217	CURLYM, /* CURLYM_B */
	218	CURLYM, /* CURLYM_B_fail */
	219	IFMATCH, /* IFMATCH_A */
	220	IFMATCH, /* IFMATCH_A_fail */
	221	CURLY, /* CURLY_B_min_known */
	222	CURLY, /* CURLY_B_min_known_fail */
	223	CURLY, /* CURLY_B_min */
	224	CURLY, /* CURLY_B_min_fail */
	225	CURLY, /* CURLY_B_max */
	226	CURLY, /* CURLY_B_max_fail */
d09b2d29 IZ	227	};
	228	#endif
	229
6bda09f9	230	/* regarglen[] - How large is the argument part of the node (in regnodes) */
d09b2d29 IZ	231
d09b2d29 IZ	232	#ifdef REG_COMP_C
29de9391	233	static const U8 regarglen[] = {
03363afd YO	234	0, /* END */
	235	0, /* SUCCEED */
	236	0, /* BOL */
	237	0, /* MBOL */
	238	0, /* SBOL */
	239	0, /* EOS */
	240	0, /* EOL */
	241	0, /* MEOL */
	242	0, /* SEOL */
	243	0, /* BOUND */
	244	0, /* BOUNDL */
	245	0, /* NBOUND */
	246	0, /* NBOUNDL */
	247	0, /* GPOS */
	248	0, /* REG_ANY */
	249	0, /* SANY */
	250	0, /* CANY */
	251	0, /* ANYOF */
	252	0, /* ALNUM */
	253	0, /* ALNUML */
	254	0, /* NALNUM */
	255	0, /* NALNUML */
	256	0, /* SPACE */
	257	0, /* SPACEL */
	258	0, /* NSPACE */
	259	0, /* NSPACEL */
	260	0, /* DIGIT */
	261	0, /* DIGITL */
	262	0, /* NDIGIT */
	263	0, /* NDIGITL */
	264	0, /* CLUMP */
	265	0, /* BRANCH */
	266	0, /* BACK */
	267	0, /* EXACT */
	268	0, /* EXACTF */
	269	0, /* EXACTFL */
	270	0, /* NOTHING */
	271	0, /* TAIL */
	272	0, /* STAR */
	273	0, /* PLUS */
	274	EXTRA_SIZE(struct regnode_2), /* CURLY */
	275	EXTRA_SIZE(struct regnode_2), /* CURLYN */
	276	EXTRA_SIZE(struct regnode_2), /* CURLYM */
	277	EXTRA_SIZE(struct regnode_2), /* CURLYX */
	278	0, /* WHILEM */
	279	EXTRA_SIZE(struct regnode_1), /* OPEN */
	280	EXTRA_SIZE(struct regnode_1), /* CLOSE */
	281	EXTRA_SIZE(struct regnode_1), /* REF */
	282	EXTRA_SIZE(struct regnode_1), /* REFF */
	283	EXTRA_SIZE(struct regnode_1), /* REFFL */
	284	EXTRA_SIZE(struct regnode_1), /* IFMATCH */
	285	EXTRA_SIZE(struct regnode_1), /* UNLESSM */
	286	EXTRA_SIZE(struct regnode_1), /* SUSPEND */
	287	EXTRA_SIZE(struct regnode_1), /* IFTHEN */
	288	EXTRA_SIZE(struct regnode_1), /* GROUPP */
	289	EXTRA_SIZE(struct regnode_1), /* LONGJMP */
	290	EXTRA_SIZE(struct regnode_1), /* BRANCHJ */
	291	EXTRA_SIZE(struct regnode_1), /* EVAL */
	292	0, /* MINMOD */
	293	0, /* LOGICAL */
	294	EXTRA_SIZE(struct regnode_1), /* RENUM */
	295	EXTRA_SIZE(struct regnode_1), /* TRIE */
	296	EXTRA_SIZE(struct regnode_charclass), /* TRIEC */
	297	EXTRA_SIZE(struct regnode_1), /* AHOCORASICK */
298	EXTRA_SIZE(struct regnode_charclass), /* AHOCORASICKC */
6bda09f9 YO	299	EXTRA_SIZE(struct regnode_2L), /* RECURSE */
6bda09f9 YO	300	0, /* SRECURSE */
81714fb9 YO	301	EXTRA_SIZE(struct regnode_1), /* NREF */
	302	EXTRA_SIZE(struct regnode_1), /* NREFF */
	303	EXTRA_SIZE(struct regnode_1), /* NREFFL */
03363afd YO	304	0, /* OPTIMIZED */
03363afd YO	305	0, /* PSEUDO */
d09b2d29 IZ	306	};
d09b2d29 IZ	307
6bda09f9 YO	308	/* reg_off_by_arg[] - Which argument holds the offset to the next node */
6bda09f9 YO	309
29de9391	310	static const char reg_off_by_arg[] = {
03363afd YO	311	0, /* END */
	312	0, /* SUCCEED */
	313	0, /* BOL */
	314	0, /* MBOL */
	315	0, /* SBOL */
	316	0, /* EOS */
	317	0, /* EOL */
	318	0, /* MEOL */
	319	0, /* SEOL */
	320	0, /* BOUND */
	321	0, /* BOUNDL */
	322	0, /* NBOUND */
	323	0, /* NBOUNDL */
	324	0, /* GPOS */
	325	0, /* REG_ANY */
	326	0, /* SANY */
	327	0, /* CANY */
	328	0, /* ANYOF */
	329	0, /* ALNUM */
	330	0, /* ALNUML */
	331	0, /* NALNUM */
	332	0, /* NALNUML */
	333	0, /* SPACE */
	334	0, /* SPACEL */
	335	0, /* NSPACE */
	336	0, /* NSPACEL */
	337	0, /* DIGIT */
	338	0, /* DIGITL */
	339	0, /* NDIGIT */
	340	0, /* NDIGITL */
	341	0, /* CLUMP */
	342	0, /* BRANCH */
	343	0, /* BACK */
	344	0, /* EXACT */
	345	0, /* EXACTF */
	346	0, /* EXACTFL */
	347	0, /* NOTHING */
	348	0, /* TAIL */
	349	0, /* STAR */
	350	0, /* PLUS */
	351	0, /* CURLY */
	352	0, /* CURLYN */
	353	0, /* CURLYM */
	354	0, /* CURLYX */
	355	0, /* WHILEM */
	356	0, /* OPEN */
	357	0, /* CLOSE */
	358	0, /* REF */
	359	0, /* REFF */
	360	0, /* REFFL */
	361	2, /* IFMATCH */
	362	2, /* UNLESSM */
	363	1, /* SUSPEND */
	364	1, /* IFTHEN */
	365	0, /* GROUPP */
	366	1, /* LONGJMP */
	367	1, /* BRANCHJ */
	368	0, /* EVAL */
	369	0, /* MINMOD */
	370	0, /* LOGICAL */
	371	1, /* RENUM */
	372	0, /* TRIE */
	373	0, /* TRIEC */
	374	0, /* AHOCORASICK */
375	0, /* AHOCORASICKC */
6bda09f9 YO	376	0, /* RECURSE */
6bda09f9 YO	377	0, /* SRECURSE */
81714fb9 YO	378	0, /* NREF */
	379	0, /* NREFF */
	380	0, /* NREFFL */
03363afd YO	381	0, /* OPTIMIZED */
03363afd YO	382	0, /* PSEUDO */
d09b2d29	383	};
885f9e59	384
6bda09f9 YO	385	/* reg_name[] - Opcode/state names in string form, for debugging */
6bda09f9 YO	386
885f9e59	387	#ifdef DEBUGGING
6d9c9890	388	const char * reg_name[] = {
03363afd YO	389	"END", /* 0000 */
	390	"SUCCEED", /* 0x01 */
	391	"BOL", /* 0x02 */
	392	"MBOL", /* 0x03 */
	393	"SBOL", /* 0x04 */
	394	"EOS", /* 0x05 */
	395	"EOL", /* 0x06 */
	396	"MEOL", /* 0x07 */
	397	"SEOL", /* 0x08 */
	398	"BOUND", /* 0x09 */
	399	"BOUNDL", /* 0x0a */
	400	"NBOUND", /* 0x0b */
	401	"NBOUNDL", /* 0x0c */
	402	"GPOS", /* 0x0d */
	403	"REG_ANY", /* 0x0e */
	404	"SANY", /* 0x0f */
	405	"CANY", /* 0x10 */
	406	"ANYOF", /* 0x11 */
	407	"ALNUM", /* 0x12 */
	408	"ALNUML", /* 0x13 */
	409	"NALNUM", /* 0x14 */
	410	"NALNUML", /* 0x15 */
	411	"SPACE", /* 0x16 */
	412	"SPACEL", /* 0x17 */
	413	"NSPACE", /* 0x18 */
	414	"NSPACEL", /* 0x19 */
	415	"DIGIT", /* 0x1a */
	416	"DIGITL", /* 0x1b */
	417	"NDIGIT", /* 0x1c */
	418	"NDIGITL", /* 0x1d */
	419	"CLUMP", /* 0x1e */
	420	"BRANCH", /* 0x1f */
	421	"BACK", /* 0x20 */
	422	"EXACT", /* 0x21 */
	423	"EXACTF", /* 0x22 */
	424	"EXACTFL", /* 0x23 */
	425	"NOTHING", /* 0x24 */
	426	"TAIL", /* 0x25 */
	427	"STAR", /* 0x26 */
	428	"PLUS", /* 0x27 */
	429	"CURLY", /* 0x28 */
	430	"CURLYN", /* 0x29 */
	431	"CURLYM", /* 0x2a */
	432	"CURLYX", /* 0x2b */
	433	"WHILEM", /* 0x2c */
	434	"OPEN", /* 0x2d */
	435	"CLOSE", /* 0x2e */
	436	"REF", /* 0x2f */
	437	"REFF", /* 0x30 */
	438	"REFFL", /* 0x31 */
	439	"IFMATCH", /* 0x32 */
	440	"UNLESSM", /* 0x33 */
	441	"SUSPEND", /* 0x34 */
	442	"IFTHEN", /* 0x35 */
	443	"GROUPP", /* 0x36 */
	444	"LONGJMP", /* 0x37 */
	445	"BRANCHJ", /* 0x38 */
	446	"EVAL", /* 0x39 */
	447	"MINMOD", /* 0x3a */
	448	"LOGICAL", /* 0x3b */
	449	"RENUM", /* 0x3c */
	450	"TRIE", /* 0x3d */
	451	"TRIEC", /* 0x3e */
	452	"AHOCORASICK", /* 0x3f */
453	"AHOCORASICKC", /* 0x40 */
6bda09f9 YO	454	"RECURSE", /* 0x41 */
6bda09f9 YO	455	"SRECURSE", /* 0x42 */
81714fb9 YO	456	"NREF", /* 0x43 */
	457	"NREFF", /* 0x44 */
	458	"NREFFL", /* 0x45 */
	459	"OPTIMIZED", /* 0x46 */
	460	"PSEUDO", /* 0x47 */
03363afd	461	/* ------------ States ------------- */
81714fb9 YO	462	"TRIE_next", /* 0x48 */
	463	"TRIE_next_fail", /* 0x49 */
	464	"EVAL_AB", /* 0x4a */
	465	"EVAL_AB_fail", /* 0x4b */
	466	"CURLYX_end", /* 0x4c */
	467	"CURLYX_end_fail", /* 0x4d */
	468	"WHILEM_A_pre", /* 0x4e */
	469	"WHILEM_A_pre_fail", /* 0x4f */
	470	"WHILEM_A_min", /* 0x50 */
	471	"WHILEM_A_min_fail", /* 0x51 */
	472	"WHILEM_A_max", /* 0x52 */
	473	"WHILEM_A_max_fail", /* 0x53 */
	474	"WHILEM_B_min", /* 0x54 */
	475	"WHILEM_B_min_fail", /* 0x55 */
	476	"WHILEM_B_max", /* 0x56 */
	477	"WHILEM_B_max_fail", /* 0x57 */
	478	"BRANCH_next", /* 0x58 */
	479	"BRANCH_next_fail", /* 0x59 */
	480	"CURLYM_A", /* 0x5a */
	481	"CURLYM_A_fail", /* 0x5b */
	482	"CURLYM_B", /* 0x5c */
	483	"CURLYM_B_fail", /* 0x5d */
	484	"IFMATCH_A", /* 0x5e */
	485	"IFMATCH_A_fail", /* 0x5f */
	486	"CURLY_B_min_known", /* 0x60 */
	487	"CURLY_B_min_known_fail", /* 0x61 */
	488	"CURLY_B_min", /* 0x62 */
	489	"CURLY_B_min_fail", /* 0x63 */
	490	"CURLY_B_max", /* 0x64 */
	491	"CURLY_B_max_fail", /* 0x65 */
885f9e59	492	};
885f9e59	493	#endif /* DEBUGGING */
03363afd YO	494	#else
03363afd YO	495	#ifdef DEBUGGING
6d9c9890	496	extern const char * reg_name[];
03363afd	497	#endif
d09b2d29 IZ	498	#endif /* REG_COMP_C */
d09b2d29 IZ	499
37442d52	500	/* ex: set ro: */