X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=regexec.c;h=7a0e84a0c10cb976d4817c86c7e0b7783e244407;hb=ac4c12e7aee90d31d5da776601addbfd9d738a5a;hp=32c9c75d890d627b563a63a4eb4719d48d932c92;hpb=565764a853a177193a027e73655fad354d57fc10;p=p5sagit%2Fp5-mst-13.2.git

diff --git a/regexec.c b/regexec.c
index 32c9c75..7a0e84a 100644
--- a/regexec.c
+++ b/regexec.c
@@ -55,26 +55,6 @@
 #include "perl.h"
 #include "regcomp.h"
 
-static char *  reginput;       /* String-input pointer. */
-static char *  regbol;         /* Beginning of input, for ^ check. */
-static char *  regeol;         /* End of input, for $ check. */
-static char ** regstartp;      /* Pointer to startp array. */
-static char ** regendp;        /* Ditto for endp. */
-static U32 *   reglastparen;   /* Similarly for lastparen. */
-static char *  regtill;        /* How far we are required to go. */
-static char    regprev;        /* char before regbol, \n if none */
-
-static char *  regprecomp;     /* uncompiled string. */
-static I32		regnpar;	/* () count. */
-static I32		regsize;	/* Largest OPEN seens. */
-static char ** reg_start_tmp;
-static U32 reg_start_tmpl;
-static struct reg_data *data;
-static char *bostr;
-
-static U32 reg_flags;			/* tainted/warned */
-static I32 reg_eval_set;
-
 #define RF_tainted	1		/* tainted information used? */
 #define RF_warned	2		/* warned about big count? */
 #define RF_evaled	4		/* Did an EVAL? */
@@ -83,27 +63,6 @@ static I32 reg_eval_set;
 #define	STATIC	static
 #endif
 
-#ifdef DEBUGGING
-static I32	regnarrate = 0;
-static regnode* regprogram = 0;
-#endif
-
-/* Current curly descriptor */
-typedef struct curcur CURCUR;
-struct curcur {
-    int		parenfloor;	/* how far back to strip paren data */
-    int		cur;		/* how many instances of scan we've matched */
-    int		min;		/* the minimal number of scans to match */
-    int		max;		/* the maximal number of scans to match */
-    int		minmod;		/* whether to work our way up or down */
-    regnode *	scan;		/* the thing to match */
-    regnode *	next;		/* what has to match after it */
-    char *	lastloc;	/* where we started matching this scan */
-    CURCUR *	oldcc;		/* current curly before we started this one */
-};
-
-static CURCUR* regcc;
-
 #ifndef PERL_OBJECT
 typedef I32 CHECKPOINT;
 
@@ -705,7 +664,7 @@ regtry(regexp *prog, char *startpos)
 
     sp = prog->startp;
     ep = prog->endp;
-    data = prog->data;
+    regdata = prog->data;
     if (prog->nparens) {
 	for (i = prog->nparens; i >= 0; i--) {
 	    *sp++ = NULL;
@@ -751,7 +710,6 @@ regmatch(regnode *prog)
     register I32 c1, c2, paren;	/* case fold search, parenth */
     int minmod = 0, sw = 0, logical = 0;
 #ifdef DEBUGGING
-    static int regindent = 0;
     regindent++;
 #endif
 
@@ -981,7 +939,7 @@ regmatch(regnode *prog)
 	    n = ARG(scan);  /* which paren pair */
 	    s = regstartp[n];
 	    if (*reglastparen < n || !s)
-		break;			/* Zero length always matches */
+		sayNO;			/* Do not match unless seen CLOSEn. */
 	    if (s == regendp[n])
 		break;
 	    /* Inline the first character, for speed. */
@@ -1017,9 +975,9 @@ regmatch(regnode *prog)
 	    SV *ret;
 	    
 	    n = ARG(scan);
-	    op = (OP_4tree*)data->data[n];
+	    op = (OP_4tree*)regdata->data[n];
 	    DEBUG_r( PerlIO_printf(Perl_debug_log, "  re_eval 0x%x\n", op) );
-	    curpad = AvARRAY((AV*)data->data[n + 1]);
+	    curpad = AvARRAY((AV*)regdata->data[n + 1]);
 	    if (!reg_eval_set) {
 		/* Preserve whatever is on stack now, otherwise
 		   OP_NEXTSTATE will overwrite it. */