-/* $Header: regcomp.h,v 3.0 89/10/18 15:22:39 lwall Locked $
- *
- * $Log: regcomp.h,v $
- * Revision 3.0 89/10/18 15:22:39 lwall
- * 3.0 baseline
- *
+/* regcomp.h
*/
/*
* compile to execute that permits the execute phase to run lots faster on
* simple cases. They are:
*
- * regstart str that must begin a match; Nullch if none obvious
+ * regstart sv that must begin a match; Nullch if none obvious
* reganch is the match anchored (at beginning-of-line only)?
* regmust string (pointer into program) that match must include, or NULL
- * [regmust changed to STR* for bminstr()--law]
+ * [regmust changed to SV* for bminstr()--law]
* regmlen length of regmust string
* [regmlen not used currently]
*
* Regstart and reganch permit very fast decisions on suitable starting points
* for a match, cutting down the work a lot. Regmust permits fast rejection
* of lines that cannot possibly match. The regmust tests are costly enough
- * that regcomp() supplies a regmust only if the r.e. contains something
+ * that pregcomp() supplies a regmust only if the r.e. contains something
* potentially expensive (at present, the only such thing detected is * or +
* at the start of the r.e., which can involve a lot of backup). Regmlen is
- * supplied because the test in regexec() needs it and regcomp() is computing
+ * supplied because the test in pregexec() needs it and pregcomp() is computing
* it anyway.
* [regmust is now supplied always. The tests that use regmust have a
* heuristic that disables the test if it usually matches.]
/* definition number opnd? meaning */
#define END 0 /* no End of program. */
#define BOL 1 /* no Match "" at beginning of line. */
-#define EOL 2 /* no Match "" at end of line. */
-#define ANY 3 /* no Match any one character. */
-#define ANYOF 4 /* str Match any character in this string. */
-#define ANYBUT 5 /* str Match any character not in this string. */
-#define BRANCH 6 /* node Match this alternative, or the next... */
-#define BACK 7 /* no Match "", "next" ptr points backward. */
-#define EXACTLY 8 /* str Match this string (preceded by length). */
-#define NOTHING 9 /* no Match empty string. */
-#define STAR 10 /* node Match this (simple) thing 0 or more times. */
-#define PLUS 11 /* node Match this (simple) thing 1 or more times. */
-#define ALNUM 12 /* no Match any alphanumeric character */
-#define NALNUM 13 /* no Match any non-alphanumeric character */
-#define BOUND 14 /* no Match "" at any word boundary */
-#define NBOUND 15 /* no Match "" at any word non-boundary */
-#define SPACE 16 /* no Match any whitespace character */
-#define NSPACE 17 /* no Match any non-whitespace character */
-#define DIGIT 18 /* no Match any numeric character */
-#define NDIGIT 19 /* no Match any non-numeric character */
-#define REF 20 /* no Match some already matched string */
-#define OPEN 30 /* no Mark this point in input as start of #n. */
- /* OPEN+1 is number 1, etc. */
-#define CLOSE 40 /* no Analogous to OPEN. */
-/* CLOSE must be last one! see regmust finder */
+#define MBOL 2 /* no Same, assuming multiline. */
+#define SBOL 3 /* no Same, assuming singleline. */
+#define EOL 4 /* no Match "" at end of line. */
+#define MEOL 5 /* no Same, assuming multiline. */
+#define SEOL 6 /* no Same, assuming singleline. */
+#define ANY 7 /* no Match any one character (except newline). */
+#define SANY 8 /* no Match any one character. */
+#define ANYOF 9 /* sv Match character in (or not in) this class. */
+#define CURLY 10 /* sv Match this simple thing {n,m} times. */
+#define CURLYX 11 /* sv Match this complex thing {n,m} times. */
+#define BRANCH 12 /* node Match this alternative, or the next... */
+#define BACK 13 /* no Match "", "next" ptr points backward. */
+#define EXACTLY 14 /* sv Match this string (preceded by length). */
+#define NOTHING 15 /* no Match empty string. */
+#define STAR 16 /* node Match this (simple) thing 0 or more times. */
+#define PLUS 17 /* node Match this (simple) thing 1 or more times. */
+#define ALNUM 18 /* no Match any alphanumeric character */
+#define NALNUM 19 /* no Match any non-alphanumeric character */
+#define BOUND 20 /* no Match "" at any word boundary */
+#define NBOUND 21 /* no Match "" at any word non-boundary */
+#define SPACE 22 /* no Match any whitespace character */
+#define NSPACE 23 /* no Match any non-whitespace character */
+#define DIGIT 24 /* no Match any numeric character */
+#define NDIGIT 25 /* no Match any non-numeric character */
+#define REF 26 /* num Match some already matched string */
+#define OPEN 27 /* num Mark this point in input as start of #n. */
+#define CLOSE 28 /* num Analogous to OPEN. */
+#define MINMOD 29 /* no Next operator is not greedy. */
+#define GBOL 30 /* no Matches where last m//g left off. */
+#define IFMATCH 31 /* no Succeeds if the following matches. */
+#define UNLESSM 32 /* no Fails if the following matches. */
+#define SUCCEED 33 /* no Return from a subroutine, basically. */
+#define WHILEM 34 /* no Do curly processing and see if rest matches. */
/*
* Opcode notes:
* OPEN,CLOSE ...are numbered at compile time.
*/
+#ifndef DOINIT
+EXT char regarglen[];
+#else
+EXT char regarglen[] = {0,0,0,0,0,0,0,0,0,0,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,2,0,0,0,0,0};
+#endif
+
+#ifndef DOINIT
+EXT char regkind[];
+#else
+EXT char regkind[] = {
+ END,
+ BOL,
+ BOL,
+ BOL,
+ EOL,
+ EOL,
+ EOL,
+ ANY,
+ ANY,
+ ANYOF,
+ CURLY,
+ CURLY,
+ BRANCH,
+ BACK,
+ EXACTLY,
+ NOTHING,
+ STAR,
+ PLUS,
+ ALNUM,
+ NALNUM,
+ BOUND,
+ NBOUND,
+ SPACE,
+ NSPACE,
+ DIGIT,
+ NDIGIT,
+ REF,
+ OPEN,
+ CLOSE,
+ MINMOD,
+ BOL,
+ BRANCH,
+ BRANCH,
+ END,
+ WHILEM
+};
+#endif
+
/* The following have no fixed length. */
#ifndef DOINIT
-extern char varies[];
+EXT char varies[];
#else
-char varies[] = {BRANCH,BACK,STAR,PLUS,
- REF+1,REF+2,REF+3,REF+4,REF+5,REF+6,REF+7,REF+8,REF+9,0};
+EXT char varies[] = {BRANCH,BACK,STAR,PLUS,CURLY,CURLYX,REF,WHILEM,0};
#endif
/* The following always have a length of 1. */
#ifndef DOINIT
-extern char simple[];
+EXT char simple[];
#else
-char simple[] = {ANY,ANYOF,ANYBUT,ALNUM,NALNUM,SPACE,NSPACE,DIGIT,NDIGIT,0};
+EXT char simple[] = {ANY,SANY,ANYOF,ALNUM,NALNUM,SPACE,NSPACE,DIGIT,NDIGIT,0};
#endif
EXT char regdummy;
#ifndef gould
#ifndef cray
+#ifndef eta10
#define REGALIGN
#endif
#endif
+#endif
#define OP(p) (*(p))
#ifndef lint
#ifdef REGALIGN
#define NEXT(p) (*(short*)(p+1))
+#define ARG1(p) (*(unsigned short*)(p+3))
+#define ARG2(p) (*(unsigned short*)(p+5))
#else
#define NEXT(p) (((*((p)+1)&0377)<<8) + (*((p)+2)&0377))
+#define ARG1(p) (((*((p)+3)&0377)<<8) + (*((p)+4)&0377))
+#define ARG2(p) (((*((p)+5)&0377)<<8) + (*((p)+6)&0377))
#endif
#else /* lint */
#define NEXT(p) 0
#ifdef REGALIGN
#define NEXTOPER(p) ((p) + 4)
+#define PREVOPER(p) ((p) - 4)
#else
#define NEXTOPER(p) ((p) + 3)
+#define PREVOPER(p) ((p) - 3)
#endif
#define MAGIC 0234
* Utility definitions.
*/
#ifndef lint
-#ifndef CHARBITS
+#ifndef CHARMASK
#define UCHARAT(p) ((int)*(unsigned char *)(p))
#else
-#define UCHARAT(p) ((int)*(p)&CHARBITS)
+#define UCHARAT(p) ((int)*(p)&CHARMASK)
#endif
#else /* lint */
#define UCHARAT(p) regdummy
#endif /* lint */
-#define FAIL(m) fatal("/%s/: %s",regprecomp,m)
-
-char *regnext();
-#ifdef DEBUGGING
-void regdump();
-char *regprop();
-#endif
-
+#define FAIL(m) croak("/%.127s/: %s",regprecomp,m)
projects / p5sagit/p5-mst-13.2.git / blobdiff