5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
8 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
9 * confused with the original package (see point 3 below). Thanks, Henry!
12 /* Additional note: this code is very heavily munged from Henry's version
13 * in places. In some spots I've traded clarity for efficiency, so don't
14 * blame Henry for some of the lack of readability.
17 /* The names of the functions have been changed from regcomp and
18 * regexec to pregcomp and pregexec in order to avoid conflicts
19 * with the POSIX routines of the same names.
24 * pregcomp and pregexec -- regsub and regerror are not used in perl
26 * Copyright (c) 1986 by University of Toronto.
27 * Written by Henry Spencer. Not derived from licensed software.
29 * Permission is granted to anyone to use this software for any
30 * purpose on any computer system, and to redistribute it freely,
31 * subject to the following restrictions:
33 * 1. The author is not responsible for the consequences of use of
34 * this software, no matter how awful, even if they arise
37 * 2. The origin of this software must not be misrepresented, either
38 * by explicit claim or by omission.
40 * 3. Altered versions must be plainly marked as such, and must not
41 * be misrepresented as being the original software.
44 **** Alterations to Henry's code are...
46 **** Copyright (c) 1991-1997, Larry Wall
48 **** You may distribute under the terms of either the GNU General Public
49 **** License or the Artistic License, as specified in the README file.
52 * Beware that some of this code is subtly aware of the way operator
53 * precedence is structured in regular expressions. Serious changes in
54 * regular-expression syntax might require a total rethink.
65 #endif /* USE_THREADS */
67 static regnode regdummy;
68 static char * regparse; /* Input-scan pointer. */
69 static char * regxend; /* End of input for compile */
70 static regnode * regcode; /* Code-emit pointer; ®dummy = don't. */
71 static I32 regnaughty; /* How bad is this pattern? */
72 static I32 regsawback; /* Did we see \1, ...? */
74 /* This guys appear both in regcomp.c and regexec.c, but there is no
75 other reason to have them global. */
76 static char * regprecomp; /* uncompiled string. */
77 static I32 regnpar; /* () count. */
78 static I32 regsize; /* Code size. */
79 static U16 regflags; /* are we folding, multilining? */
82 # if defined(BUGGY_MSC6)
83 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
84 # pragma optimize("a",off)
85 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
86 # pragma optimize("w",on )
87 # endif /* BUGGY_MSC6 */
94 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
95 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
96 ((*s) == '{' && regcurly(s)))
98 #define PERL_META "^$.[()|?+*\\"
100 #define META "^$.[()|?+*\\"
104 #undef SPSTART /* dratted cpp namespace... */
107 * Flags to be passed up and down.
109 #define WORST 0 /* Worst case. */
110 #define HASWIDTH 0x1 /* Known never to match null string. */
111 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
112 #define SPSTART 0x4 /* Starts with * or +. */
113 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
116 * Forward declarations for pregcomp()'s friends.
119 static regnode *reg _((I32, I32 *));
120 static regnode *reganode _((U8, U32));
121 static regnode *regatom _((I32 *));
122 static regnode *regbranch _((I32 *, I32));
123 static void regc _((U8, char *));
124 static regnode *regclass _((void));
125 STATIC I32 regcurly _((char *));
126 static regnode *reg_node _((U8));
127 static regnode *regpiece _((I32 *));
128 static void reginsert _((U8, regnode *));
129 static void regoptail _((regnode *, regnode *));
130 static void regset _((char *, I32));
131 static void regtail _((regnode *, regnode *));
132 static char* regwhite _((char *, char *));
133 static char* nextchar _((void));
136 static I32 seen_zerolen;
145 /* Length of a variant. */
153 I32 last_end; /* min value, <0 unless valid. */
156 SV **longest; /* Either &l_fixed, or &l_float. */
160 I32 offset_float_min;
161 I32 offset_float_max;
165 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
167 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
168 #define SF_BEFORE_SEOL 0x1
169 #define SF_BEFORE_MEOL 0x2
170 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
171 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
173 #define SF_FIX_SHIFT_EOL (+2)
174 #define SF_FL_SHIFT_EOL (+4)
176 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
177 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
179 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
180 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
181 #define SF_IS_INF 0x40
182 #define SF_HAS_PAR 0x80
183 #define SF_IN_PAR 0x100
184 #define SF_HAS_EVAL 0x200
187 scan_commit(scan_data_t *data)
189 STRLEN l = SvCUR(data->last_found);
190 STRLEN old_l = SvCUR(*data->longest);
192 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
193 sv_setsv(*data->longest, data->last_found);
194 if (*data->longest == data->longest_fixed) {
195 data->offset_fixed = l ? data->last_start_min : data->pos_min;
196 if (data->flags & SF_BEFORE_EOL)
198 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
200 data->flags &= ~SF_FIX_BEFORE_EOL;
202 data->offset_float_min = l ? data->last_start_min : data->pos_min;
203 data->offset_float_max = (l
204 ? data->last_start_max
205 : data->pos_min + data->pos_delta);
206 if (data->flags & SF_BEFORE_EOL)
208 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
210 data->flags &= ~SF_FL_BEFORE_EOL;
213 SvCUR_set(data->last_found, 0);
215 data->flags &= ~SF_BEFORE_EOL;
218 #define SCF_DO_SUBSTR 1
220 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
221 to the position after last scanned or to NULL. */
224 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
225 /* scanp: Start here (read-write). */
226 /* deltap: Write maxlen-minlen here. */
227 /* last: Stop before this one. */
229 I32 min = 0, pars = 0, code;
230 regnode *scan = *scanp, *next;
232 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
233 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
234 scan_data_t data_fake;
236 while (scan && OP(scan) != END && scan < last) {
237 /* Peephole optimizer: */
239 if (regkind[(U8)OP(scan)] == EXACT) {
240 regnode *n = regnext(scan);
243 regnode *stop = scan;
246 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
247 /* Skip NOTHING, merge EXACT*. */
249 ( regkind[(U8)OP(n)] == NOTHING ||
250 (stringok && (OP(n) == OP(scan))))
252 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
253 if (OP(n) == TAIL || n > next)
255 if (regkind[(U8)OP(n)] == NOTHING) {
256 NEXT_OFF(scan) += NEXT_OFF(n);
257 next = n + NODE_STEP_REGNODE;
264 int oldl = *OPERAND(scan);
265 regnode *nnext = regnext(n);
267 if (oldl + *OPERAND(n) > U8_MAX)
269 NEXT_OFF(scan) += NEXT_OFF(n);
270 *OPERAND(scan) += *OPERAND(n);
271 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
272 /* Now we can overwrite *n : */
273 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
274 *OPERAND(n) + 1, char);
284 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
286 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
295 if (OP(scan) != CURLYX) {
296 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
297 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
301 /* Skip NOTHING and LONGJMP. */
302 while ((n = regnext(n))
303 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
304 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
307 if (reg_off_by_arg[OP(scan)])
310 NEXT_OFF(scan) = off;
312 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
313 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
314 next = regnext(scan);
317 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
318 I32 max1 = 0, min1 = I32_MAX, num = 0;
320 if (flags & SCF_DO_SUBSTR)
322 while (OP(scan) == code) {
323 I32 deltanext, minnext;
327 next = regnext(scan);
328 scan = NEXTOPER(scan);
330 scan = NEXTOPER(scan);
331 /* We suppose the run is continuous, last=next...*/
332 minnext = study_chunk(&scan, &deltanext, next,
336 if (max1 < minnext + deltanext)
337 max1 = minnext + deltanext;
338 if (deltanext == I32_MAX)
341 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
343 if (data_fake.flags & SF_HAS_EVAL)
344 data->flags |= SF_HAS_EVAL;
348 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
350 if (flags & SCF_DO_SUBSTR) {
351 data->pos_min += min1;
352 data->pos_delta += max1 - min1;
353 if (max1 != min1 || is_inf)
354 data->longest = &(data->longest_float);
357 delta += max1 - min1;
358 } else if (code == BRANCHJ) /* single branch is optimized. */
359 scan = NEXTOPER(NEXTOPER(scan));
360 else /* single branch is optimized. */
361 scan = NEXTOPER(scan);
363 } else if (OP(scan) == EXACT) {
364 min += *OPERAND(scan);
365 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
366 I32 l = *OPERAND(scan);
368 /* The code below prefers earlier match for fixed
369 offset, later match for variable offset. */
370 if (data->last_end == -1) { /* Update the start info. */
371 data->last_start_min = data->pos_min;
372 data->last_start_max = is_inf
373 ? I32_MAX : data->pos_min + data->pos_delta;
375 sv_catpvn(data->last_found, OPERAND(scan)+1, l);
376 data->last_end = data->pos_min + l;
377 data->pos_min += l; /* As in the first entry. */
378 data->flags &= ~SF_BEFORE_EOL;
380 } else if (regkind[(U8)OP(scan)] == EXACT) {
381 if (flags & SCF_DO_SUBSTR)
383 min += *OPERAND(scan);
384 if (data && (flags & SCF_DO_SUBSTR))
385 data->pos_min += *OPERAND(scan);
386 } else if (strchr(varies,OP(scan))) {
387 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
388 regnode *oscan = scan;
390 switch (regkind[(U8)OP(scan)]) {
392 scan = NEXTOPER(scan);
395 if (flags & SCF_DO_SUBSTR) {
396 next = NEXTOPER(scan);
397 if (OP(next) == EXACT) {
399 maxcount = REG_INFTY;
400 next = regnext(scan);
401 scan = NEXTOPER(scan);
405 if (flags & SCF_DO_SUBSTR)
411 scan = regnext(scan);
412 if (flags & SCF_DO_SUBSTR) {
414 data->longest = &(data->longest_float);
416 goto optimize_curly_tail;
418 mincount = ARG1(scan);
419 maxcount = ARG2(scan);
420 next = regnext(scan);
421 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
423 if (flags & SCF_DO_SUBSTR) {
424 if (mincount == 0) scan_commit(data);
425 pos_before = data->pos_min;
429 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
431 data->flags |= SF_IS_INF;
433 /* This will finish on WHILEM, setting scan, or on NULL: */
434 minnext = study_chunk(&scan, &deltanext, last, data,
436 ? (flags & ~SCF_DO_SUBSTR) : flags);
437 if (!scan) /* It was not CURLYX, but CURLY. */
439 if (dowarn && (minnext + deltanext == 0)
440 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
441 warn("Strange *+?{} on zero-length expression");
442 min += minnext * mincount;
443 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
444 || deltanext == I32_MAX);
445 delta += (minnext + deltanext) * maxcount - minnext * mincount;
447 /* Try powerful optimization CURLYX => CURLYN. */
448 #ifdef REGALIGN_STRUCT
449 if ( OP(oscan) == CURLYX && data
450 && data->flags & SF_IN_PAR
451 && !(data->flags & SF_HAS_EVAL)
452 && !deltanext && minnext == 1 ) {
453 /* Try to optimize to CURLYN. */
454 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
455 regnode *nxt1 = nxt, *nxt2;
459 if (!strchr(simple,OP(nxt))
460 && !(regkind[(U8)OP(nxt)] == EXACT
461 && *OPERAND(nxt) == 1))
465 if (OP(nxt) != CLOSE)
467 /* Now we know that nxt2 is the only contents: */
468 oscan->flags = ARG(nxt);
470 OP(nxt1) = NOTHING; /* was OPEN. */
472 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
473 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
474 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
475 OP(nxt) = OPTIMIZED; /* was CLOSE. */
476 OP(nxt + 1) = OPTIMIZED; /* was count. */
477 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
483 /* Try optimization CURLYX => CURLYM. */
484 if ( OP(oscan) == CURLYX && data
485 #ifdef REGALIGN_STRUCT
486 && !(data->flags & SF_HAS_PAR)
488 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
490 && !(data->flags & SF_HAS_EVAL)
492 /* XXXX How to optimize if data == 0? */
493 /* Optimize to a simpler form. */
494 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
498 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
499 && (OP(nxt2) != WHILEM))
501 OP(nxt2) = SUCCEED; /* Whas WHILEM */
502 #ifdef REGALIGN_STRUCT
503 /* Need to optimize away parenths. */
504 if (data->flags & SF_IN_PAR) {
505 /* Set the parenth number. */
506 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
508 if (OP(nxt) != CLOSE)
509 FAIL("panic opt close");
510 oscan->flags = ARG(nxt);
511 OP(nxt1) = OPTIMIZED; /* was OPEN. */
512 OP(nxt) = OPTIMIZED; /* was CLOSE. */
514 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
515 OP(nxt + 1) = OPTIMIZED; /* was count. */
516 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
517 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
520 while ( nxt1 && (OP(nxt1) != WHILEM)) {
521 regnode *nnxt = regnext(nxt1);
524 if (reg_off_by_arg[OP(nxt1)])
525 ARG_SET(nxt1, nxt2 - nxt1);
526 else if (nxt2 - nxt1 < U16_MAX)
527 NEXT_OFF(nxt1) = nxt2 - nxt1;
529 OP(nxt) = NOTHING; /* Cannot beautify */
534 /* Optimize again: */
535 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
540 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
542 if (flags & SCF_DO_SUBSTR) {
543 SV *last_str = Nullsv;
544 int counted = mincount != 0;
546 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
547 I32 b = pos_before >= data->last_start_min
548 ? pos_before : data->last_start_min;
550 char *s = SvPV(data->last_found, l);
552 l -= b - data->last_start_min;
553 /* Get the added string: */
554 last_str = newSVpv(s + b - data->last_start_min, l);
555 if (deltanext == 0 && pos_before == b) {
556 /* What was added is a constant string */
558 SvGROW(last_str, (mincount * l) + 1);
559 repeatcpy(SvPVX(last_str) + l,
560 SvPVX(last_str), l, mincount - 1);
561 SvCUR(last_str) *= mincount;
562 /* Add additional parts. */
563 SvCUR_set(data->last_found,
564 SvCUR(data->last_found) - l);
565 sv_catsv(data->last_found, last_str);
566 data->last_end += l * (mincount - 1);
570 /* It is counted once already... */
571 data->pos_min += minnext * (mincount - counted);
572 data->pos_delta += - counted * deltanext +
573 (minnext + deltanext) * maxcount - minnext * mincount;
574 if (mincount != maxcount) {
576 if (mincount && last_str) {
577 sv_setsv(data->last_found, last_str);
578 data->last_end = data->pos_min;
579 data->last_start_min =
580 data->pos_min - SvCUR(last_str);
581 data->last_start_max = is_inf
583 : data->pos_min + data->pos_delta
586 data->longest = &(data->longest_float);
589 if (fl & SF_HAS_EVAL)
590 data->flags |= SF_HAS_EVAL;
593 if (OP(oscan) != CURLYX) {
594 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
596 NEXT_OFF(oscan) += NEXT_OFF(next);
600 default: /* REF only? */
601 if (flags & SCF_DO_SUBSTR) {
603 data->longest = &(data->longest_float);
608 } else if (strchr(simple,OP(scan))) {
609 if (flags & SCF_DO_SUBSTR) {
614 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
615 data->flags |= (OP(scan) == MEOL
618 } else if (regkind[(U8)OP(scan)] == BRANCHJ
619 && (scan->flags || data)
620 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
621 I32 deltanext, minnext;
625 next = regnext(scan);
626 nscan = NEXTOPER(NEXTOPER(scan));
627 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
630 FAIL("variable length lookbehind not implemented");
631 } else if (minnext > U8_MAX) {
632 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
634 scan->flags = minnext;
636 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
638 if (data_fake.flags & SF_HAS_EVAL)
639 data->flags |= SF_HAS_EVAL;
640 } else if (OP(scan) == OPEN) {
642 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
643 #ifdef REGALIGN_STRUCT
644 next = regnext(scan);
646 if ( next && (OP(next) != WHILEM) && next < last)
648 is_par = 0; /* Disable optimization */
649 } else if (OP(scan) == EVAL) {
651 data->flags |= SF_HAS_EVAL;
653 /* Else: zero-length, ignore. */
654 scan = regnext(scan);
659 *deltap = is_inf ? I32_MAX : delta;
660 if (flags & SCF_DO_SUBSTR && is_inf)
661 data->pos_delta = I32_MAX - data->pos_min;
664 if (is_par && pars==1 && data) {
665 data->flags |= SF_IN_PAR;
666 data->flags &= ~SF_HAS_PAR;
667 } else if (pars && data) {
668 data->flags |= SF_HAS_PAR;
669 data->flags &= ~SF_IN_PAR;
675 add_data(I32 n, char *s)
679 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
680 char, struct reg_data);
681 Renew(rx->data->what, rx->data->count + n, U8);
682 rx->data->count += n;
684 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
685 char, struct reg_data);
686 New(1208, rx->data->what, n, U8);
689 Copy(s, rx->data->what + rx->data->count - n, n, U8);
690 return rx->data->count - n;
694 - pregcomp - compile a regular expression into internal code
696 * We can't allocate space until we know how big the compiled form will be,
697 * but we can't compile it (and thus know how big it is) until we've got a
698 * place to put the code. So we cheat: we compile it twice, once with code
699 * generation turned off and size counting turned on, and once "for real".
700 * This also means that we don't allocate space until we are sure that the
701 * thing really will compile successfully, and we never have to move the
702 * code and thus invalidate pointers into it. (Note that it has to be in
703 * one piece because free() must be able to free it all.) [NB: not true in perl]
705 * Beware that the optimization-preparation code in here knows about some
706 * of the structure of the compiled regexp. [I'll say.]
709 pregcomp(char *exp, char *xend, PMOP *pm)
723 FAIL("NULL regexp argument");
725 regprecomp = savepvn(exp, xend - exp);
726 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
727 xend - exp, regprecomp));
728 regflags = pm->op_pmflags;
732 seen_zerolen = *exp == '^' ? -1 : 0;
735 /* First pass: determine size, legality. */
742 regc((U8)MAGIC, (char*)regcode);
743 if (reg(0, &flags) == NULL) {
744 Safefree(regprecomp);
748 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
753 char *s = getenv("TERMCAP_COLORS");
757 colors[0] = s = savepv(s);
761 FAIL("Not enough TABs in TERMCAP_COLORS");
770 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
771 colors[0],colors[1],colors[2],colors[3]);
775 /* Small enough for pointer-storage convention?
776 If extralen==0, this means that we will not need long jumps. */
777 #ifndef REGALIGN_STRUCT
778 if (regsize >= 0x10000L && extralen)
779 FAIL("regexp too big");
781 if (regsize >= 0x10000L && extralen)
787 /* Allocate space and initialize. */
788 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
791 FAIL("regexp out of space");
793 r->prelen = xend - exp;
794 r->precomp = regprecomp;
795 r->subbeg = r->subbase = NULL;
798 /* Second pass: emit code. */
803 regcode = r->program;
804 regc((U8)MAGIC, (char*) regcode++);
806 if (reg(0, &flags) == NULL)
809 /* Dig out information for optimizations. */
810 pm->op_pmflags = regflags;
812 r->regstclass = NULL;
813 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
814 scan = r->program + 1; /* First BRANCH. */
815 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
819 StructCopy(&zero_scan_data, &data, scan_data_t);
821 /* Skip introductions and multiplicators >= 1. */
822 while ((OP(first) == OPEN && (sawopen = 1)) ||
823 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
824 (OP(first) == PLUS) ||
825 (OP(first) == MINMOD) ||
826 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
827 if (OP(first) == PLUS)
830 first += regarglen[(U8)OP(first)];
831 first = NEXTOPER(first);
834 /* Starting-point info. */
836 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
837 else if (strchr(simple+2,OP(first)))
838 r->regstclass = first;
839 else if (regkind[(U8)OP(first)] == BOUND ||
840 regkind[(U8)OP(first)] == NBOUND)
841 r->regstclass = first;
842 else if (regkind[(U8)OP(first)] == BOL) {
843 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
844 first = NEXTOPER(first);
847 else if (OP(first) == GPOS) {
848 r->reganch |= ROPT_ANCH_GPOS;
849 first = NEXTOPER(first);
852 else if ((OP(first) == STAR &&
853 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
854 !(r->reganch & ROPT_ANCH) )
856 /* turn .* into ^.* with an implied $*=1 */
857 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
858 first = NEXTOPER(first);
861 if (sawplus && (!sawopen || !regsawback))
862 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
864 /* Scan is after the zeroth branch, first is atomic matcher. */
865 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
868 * If there's something expensive in the r.e., find the
869 * longest literal string that must appear and make it the
870 * regmust. Resolve ties in favor of later strings, since
871 * the regstart check works with the beginning of the r.e.
872 * and avoiding duplication strengthens checking. Not a
873 * strong reason, but sufficient in the absence of others.
874 * [Now we resolve ties in favor of the earlier string if
875 * it happens that c_offset_min has been invalidated, since the
876 * earlier string may buy us something the later one won't.]
880 data.longest_fixed = newSVpv("",0);
881 data.longest_float = newSVpv("",0);
882 data.last_found = newSVpv("",0);
883 data.longest = &(data.longest_fixed);
886 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
887 &data, SCF_DO_SUBSTR);
888 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
889 && data.last_start_min == 0 && data.last_end > 0
891 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
892 r->reganch |= ROPT_CHECK_ALL;
894 SvREFCNT_dec(data.last_found);
896 if (SvCUR(data.longest_float)
897 || (data.flags & SF_FL_BEFORE_EOL
898 && (!(data.flags & SF_FL_BEFORE_MEOL)
899 || (regflags & PMf_MULTILINE)))) {
900 if (SvCUR(data.longest_fixed)
901 && data.offset_fixed == data.offset_float_min)
902 goto remove; /* Like in (a)+. */
904 r->float_substr = data.longest_float;
905 r->float_min_offset = data.offset_float_min;
906 r->float_max_offset = data.offset_float_max;
907 fbm_compile(r->float_substr);
908 BmUSEFUL(r->float_substr) = 100;
909 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
910 && (!(data.flags & SF_FL_BEFORE_MEOL)
911 || (regflags & PMf_MULTILINE)))
912 SvTAIL_on(r->float_substr);
915 r->float_substr = Nullsv;
916 SvREFCNT_dec(data.longest_float);
919 if (SvCUR(data.longest_fixed)
920 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
921 && (!(data.flags & SF_FIX_BEFORE_MEOL)
922 || (regflags & PMf_MULTILINE)))) {
923 r->anchored_substr = data.longest_fixed;
924 r->anchored_offset = data.offset_fixed;
925 fbm_compile(r->anchored_substr);
926 BmUSEFUL(r->anchored_substr) = 100;
927 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
928 && (!(data.flags & SF_FIX_BEFORE_MEOL)
929 || (regflags & PMf_MULTILINE)))
930 SvTAIL_on(r->anchored_substr);
932 r->anchored_substr = Nullsv;
933 SvREFCNT_dec(data.longest_fixed);
936 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
937 if (SvCUR(data.longest_fixed) > SvCUR(data.longest_float)) {
938 r->check_substr = r->anchored_substr;
939 r->check_offset_min = r->check_offset_max = r->anchored_offset;
940 if (r->reganch & ROPT_ANCH_SINGLE)
941 r->reganch |= ROPT_NOSCAN;
943 r->check_substr = r->float_substr;
944 r->check_offset_min = data.offset_float_min;
945 r->check_offset_max = data.offset_float_max;
948 /* Several toplevels. Best we can is to set minlen. */
951 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
952 scan = r->program + 1;
953 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
954 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
957 r->nparens = regnpar - 1;
959 if (regseen & REG_SEEN_GPOS)
960 r->reganch |= ROPT_GPOS_SEEN;
961 if (regseen & REG_SEEN_LOOKBEHIND)
962 r->reganch |= ROPT_LOOKBEHIND_SEEN;
963 Newz(1002, r->startp, regnpar, char*);
964 Newz(1002, r->endp, regnpar, char*);
970 - reg - regular expression, i.e. main body or parenthesized thing
972 * Caller must absorb opening parenthesis.
974 * Combining parenthesis handling with the base level of regular expression
975 * is a trifle forced, but the need to tie the tails of the branches to what
976 * follows makes it hard to avoid.
979 reg(I32 paren, I32 *flagp)
980 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
982 register regnode *ret; /* Will be the head of the group. */
983 register regnode *br;
984 register regnode *lastbr;
985 register regnode *ender = 0;
986 register I32 parno = 0;
987 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
990 *flagp = HASWIDTH; /* Tentatively. */
992 /* Make an OPEN node, if parenthesized. */
994 if (*regparse == '?') {
997 ret = NULL; /* For look-ahead/behind. */
1000 #ifndef REGALIGN_STRUCT
1001 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
1003 regseen |= REG_SEEN_LOOKBEHIND;
1004 if (*regparse == '!')
1006 if (*regparse != '=' && *regparse != '!')
1017 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1020 while (*regparse && *regparse != ')')
1022 if (*regparse != ')')
1023 FAIL("Sequence (?#... not terminated");
1030 I32 count = 1, n = 0;
1034 OP_4tree *sop, *rop;
1037 while (count && (c = *regparse)) {
1038 if (c == '\\' && regparse[1])
1046 if (*regparse != ')')
1047 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1051 if (regparse - 1 - s)
1052 sv = newSVpv(s, regparse - 1 - s);
1054 sv = newSVpv("", 0);
1056 rop = sv_compile_2op(sv, &sop, "re", &av);
1058 n = add_data(3, "nso");
1059 rx->data->data[n] = (void*)rop;
1060 rx->data->data[n+1] = (void*)av;
1061 rx->data->data[n+2] = (void*)sop;
1067 FAIL("Eval-group in insecure regular expression");
1068 return reganode(EVAL, n);
1072 if (regparse[0] == '?') {
1073 if (regparse[1] == '=' || regparse[1] == '!'
1074 || regparse[1] == '<'
1075 || regparse[1] == '{') { /* Lookahead or eval. */
1078 ret = reg_node(LOGICAL);
1079 regtail(ret, reg(1, &flag));
1082 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1083 parno = atoi(regparse++);
1085 while (isDIGIT(*regparse))
1087 ret = reganode(GROUPP, parno);
1088 if ((c = *nextchar()) != ')')
1089 FAIL2("Switch (?(number%c not recognized", c);
1091 regtail(ret, reganode(IFTHEN, 0));
1092 br = regbranch(&flags, 1);
1094 br = reganode(LONGJMP, 0);
1096 regtail(br, reganode(LONGJMP, 0));
1099 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1100 regbranch(&flags, 1);
1101 regtail(ret, lastbr);
1106 FAIL("Switch (?(condition)... contains too many branches");
1107 ender = reg_node(TAIL);
1110 regtail(lastbr, ender);
1111 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1113 regtail(ret, ender);
1116 FAIL2("Unknown condition for (?(%.2s", regparse);
1120 FAIL("Sequence (? incomplete");
1124 while (*regparse && strchr("iogcmsx", *regparse))
1125 pmflag(®flags, *regparse++);
1127 if (*regparse != ')')
1128 FAIL2("Sequence (?%c...) not recognized", *regparse);
1137 ret = reganode(OPEN, parno);
1143 /* Pick up the branches, linking them together. */
1144 br = regbranch(&flags, 1);
1147 if (*regparse == '|') {
1148 if (!SIZE_ONLY && extralen) {
1149 reginsert(BRANCHJ, br);
1151 reginsert(BRANCH, br);
1154 extralen += 1; /* For BRANCHJ-BRANCH. */
1155 } else if (paren == ':') {
1156 *flagp |= flags&SIMPLE;
1158 if (open) { /* Starts with OPEN. */
1159 regtail(ret, br); /* OPEN -> first. */
1160 } else if (paren != '?') /* Not Conditional */
1162 if (!(flags&HASWIDTH))
1163 *flagp &= ~HASWIDTH;
1164 *flagp |= flags&SPSTART;
1166 while (*regparse == '|') {
1167 if (!SIZE_ONLY && extralen) {
1168 ender = reganode(LONGJMP,0);
1169 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1172 extralen += 2; /* Account for LONGJMP. */
1174 br = regbranch(&flags, 0);
1177 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1179 if (!(flags&HASWIDTH))
1180 *flagp &= ~HASWIDTH;
1181 *flagp |= flags&SPSTART;
1184 if (have_branch || paren != ':') {
1185 /* Make a closing node, and hook it on the end. */
1188 ender = reg_node(TAIL);
1191 ender = reganode(CLOSE, parno);
1198 ender = reg_node(SUCCEED);
1199 *flagp &= ~HASWIDTH;
1202 ender = reg_node(END);
1205 regtail(lastbr, ender);
1208 /* Hook the tails of the branches to the closing node. */
1209 for (br = ret; br != NULL; br = regnext(br)) {
1210 regoptail(br, ender);
1217 static char parens[] = "=!<,>";
1219 if (paren && (p = strchr(parens, paren))) {
1220 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1221 int flag = (p - parens) > 1;
1224 node = SUSPEND, flag = 0;
1225 reginsert(node,ret);
1226 #ifdef REGALIGN_STRUCT
1229 regtail(ret, reg_node(TAIL));
1233 /* Check for proper termination. */
1234 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1235 FAIL("unmatched () in regexp");
1236 } else if (!paren && regparse < regxend) {
1237 if (*regparse == ')') {
1238 FAIL("unmatched () in regexp");
1240 FAIL("junk on end of regexp"); /* "Can't happen". */
1244 regflags = oregflags;
1251 - regbranch - one alternative of an | operator
1253 * Implements the concatenation operator.
1256 regbranch(I32 *flagp, I32 first)
1258 register regnode *ret;
1259 register regnode *chain = NULL;
1260 register regnode *latest;
1261 I32 flags = 0, c = 0;
1266 if (!SIZE_ONLY && extralen)
1267 ret = reganode(BRANCHJ,0);
1269 ret = reg_node(BRANCH);
1272 if (!first && SIZE_ONLY)
1273 extralen += 1; /* BRANCHJ */
1275 *flagp = WORST; /* Tentatively. */
1279 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1281 latest = regpiece(&flags);
1282 if (latest == NULL) {
1283 if (flags & TRYAGAIN)
1286 } else if (ret == NULL)
1288 *flagp |= flags&HASWIDTH;
1289 if (chain == NULL) /* First piece. */
1290 *flagp |= flags&SPSTART;
1293 regtail(chain, latest);
1298 if (chain == NULL) { /* Loop ran zero times. */
1299 chain = reg_node(NOTHING);
1304 *flagp |= flags&SIMPLE;
1311 - regpiece - something followed by possible [*+?]
1313 * Note that the branching code sequences used for ? and the general cases
1314 * of * and + are somewhat optimized: they use the same NOTHING node as
1315 * both the endmarker for their branch list and the body of the last branch.
1316 * It might seem that this node could be dispensed with entirely, but the
1317 * endmarker role is not redundant.
1320 regpiece(I32 *flagp)
1322 register regnode *ret;
1324 register char *next;
1326 char *origparse = regparse;
1329 I32 max = REG_INFTY;
1331 ret = regatom(&flags);
1333 if (flags & TRYAGAIN)
1340 if (op == '{' && regcurly(regparse)) {
1341 next = regparse + 1;
1343 while (isDIGIT(*next) || *next == ',') {
1352 if (*next == '}') { /* got one */
1356 min = atoi(regparse);
1362 if (!max && *maxpos != '0')
1363 max = REG_INFTY; /* meaning "infinity" */
1364 else if (max >= REG_INFTY)
1365 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1370 if ((flags&SIMPLE)) {
1371 regnaughty += 2 + regnaughty / 2;
1372 reginsert(CURLY, ret);
1375 regnaughty += 4 + regnaughty; /* compound interest */
1376 regtail(ret, reg_node(WHILEM));
1377 if (!SIZE_ONLY && extralen) {
1378 reginsert(LONGJMP,ret);
1379 reginsert(NOTHING,ret);
1380 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1382 reginsert(CURLYX,ret);
1383 if (!SIZE_ONLY && extralen)
1384 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1385 regtail(ret, reg_node(NOTHING));
1389 #ifdef REGALIGN_STRUCT
1394 *flagp = (WORST|HASWIDTH);
1395 if (max && max < min)
1396 FAIL("Can't do {n,m} with n > m");
1411 #if 0 /* Now runtime fix should be reliable. */
1412 if (!(flags&HASWIDTH) && op != '?')
1413 FAIL("regexp *+ operand could be empty");
1418 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1420 if (op == '*' && (flags&SIMPLE)) {
1421 reginsert(STAR, ret);
1422 #ifdef REGALIGN_STRUCT
1427 else if (op == '*') {
1430 } else if (op == '+' && (flags&SIMPLE)) {
1431 reginsert(PLUS, ret);
1432 #ifdef REGALIGN_STRUCT
1437 else if (op == '+') {
1440 } else if (op == '?') {
1445 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1446 warn("%.*s matches null string many times",
1447 regparse - origparse, origparse);
1450 if (*regparse == '?') {
1452 reginsert(MINMOD, ret);
1454 regtail(ret, ret + NODE_STEP_REGNODE);
1456 regtail(ret, ret + 3);
1459 if (ISMULT2(regparse))
1460 FAIL("nested *?+ in regexp");
1466 - regatom - the lowest level
1468 * Optimization: gobbles an entire sequence of ordinary characters so that
1469 * it can turn them into a single node, which is smaller to store and
1470 * faster to run. Backslashed characters are exceptions, each becoming a
1471 * separate node; the code is simpler that way and it's not worth fixing.
1473 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1478 register regnode *ret = 0;
1481 *flagp = WORST; /* Tentatively. */
1484 switch (*regparse) {
1488 if (regflags & PMf_MULTILINE)
1489 ret = reg_node(MBOL);
1490 else if (regflags & PMf_SINGLELINE)
1491 ret = reg_node(SBOL);
1493 ret = reg_node(BOL);
1499 if (regflags & PMf_MULTILINE)
1500 ret = reg_node(MEOL);
1501 else if (regflags & PMf_SINGLELINE)
1502 ret = reg_node(SEOL);
1504 ret = reg_node(EOL);
1508 if (regflags & PMf_SINGLELINE)
1509 ret = reg_node(SANY);
1511 ret = reg_node(ANY);
1513 *flagp |= HASWIDTH|SIMPLE;
1518 *flagp |= HASWIDTH|SIMPLE;
1522 ret = reg(1, &flags);
1524 if (flags & TRYAGAIN)
1528 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1532 if (flags & TRYAGAIN) {
1536 FAIL2("internal urp in regexp at /%s/", regparse);
1537 /* Supposed to be caught earlier. */
1540 if (!regcurly(regparse)) {
1548 FAIL("?+*{} follows nothing in regexp");
1551 switch (*++regparse) {
1554 ret = reg_node(SBOL);
1559 ret = reg_node(GPOS);
1560 regseen |= REG_SEEN_GPOS;
1565 ret = reg_node(SEOL);
1570 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1571 *flagp |= HASWIDTH|SIMPLE;
1575 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1576 *flagp |= HASWIDTH|SIMPLE;
1581 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1587 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1592 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1593 *flagp |= HASWIDTH|SIMPLE;
1597 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1598 *flagp |= HASWIDTH|SIMPLE;
1602 ret = reg_node(DIGIT);
1603 *flagp |= HASWIDTH|SIMPLE;
1607 ret = reg_node(NDIGIT);
1608 *flagp |= HASWIDTH|SIMPLE;
1621 case '1': case '2': case '3': case '4':
1622 case '5': case '6': case '7': case '8': case '9':
1624 I32 num = atoi(regparse);
1626 if (num > 9 && num >= regnpar)
1630 ret = reganode((regflags & PMf_FOLD)
1631 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1634 while (isDIGIT(*regparse))
1642 if (regparse >= regxend)
1643 FAIL("trailing \\ in regexp");
1651 if (regflags & PMf_EXTENDED) {
1652 while (regparse < regxend && *regparse != '\n') regparse++;
1653 if (regparse < regxend)
1668 ret = reg_node((regflags & PMf_FOLD)
1669 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1672 regc(0, s++); /* save spot for len */
1673 for (len = 0, p = regparse - 1;
1674 len < 127 && p < regxend;
1679 if (regflags & PMf_EXTENDED)
1680 p = regwhite(p, regxend);
1730 ender = scan_hex(++p, 2, &numlen);
1735 ender = UCHARAT(p++);
1736 ender = toCTRL(ender);
1738 case '0': case '1': case '2': case '3':case '4':
1739 case '5': case '6': case '7': case '8':case '9':
1741 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1742 ender = scan_oct(p, 3, &numlen);
1752 FAIL("trailing \\ in regexp");
1763 if (regflags & PMf_EXTENDED)
1764 p = regwhite(p, regxend);
1765 if (ISMULT2(p)) { /* Back off on ?+*. */
1780 FAIL("internal disaster in regexp");
1786 *OPERAND(ret) = len;
1789 #ifdef REGALIGN_STRUCT
1790 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1793 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1803 regwhite(char *p, char *e)
1808 else if (*p == '#') {
1811 } while (p < e && *p != '\n');
1820 regset(char *opnd, register I32 c)
1825 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1831 register char *opnd, *s;
1833 register I32 lastclass = 1234;
1834 register I32 range = 0;
1835 register regnode *ret;
1839 s = opnd = OPERAND(regcode);
1840 ret = reg_node(ANYOF);
1841 for (Class = 0; Class < 33; Class++)
1843 if (*regparse == '^') { /* Complement of range. */
1847 *opnd |= ANYOF_INVERT;
1850 regcode += ANY_SKIP;
1851 if (regflags & PMf_FOLD)
1852 *opnd |= ANYOF_FOLD;
1853 if (regflags & PMf_LOCALE)
1854 *opnd |= ANYOF_LOCALE;
1856 regsize += ANY_SKIP;
1858 if (*regparse == ']' || *regparse == '-')
1859 goto skipcond; /* allow 1st char to be ] or - */
1860 while (regparse < regxend && *regparse != ']') {
1862 Class = UCHARAT(regparse++);
1863 if (Class == '\\') {
1864 Class = UCHARAT(regparse++);
1867 if (regflags & PMf_LOCALE) {
1869 *opnd |= ANYOF_ALNUML;
1872 for (Class = 0; Class < 256; Class++)
1874 regset(opnd, Class);
1879 if (regflags & PMf_LOCALE) {
1881 *opnd |= ANYOF_NALNUML;
1884 for (Class = 0; Class < 256; Class++)
1885 if (!isALNUM(Class))
1886 regset(opnd, Class);
1891 if (regflags & PMf_LOCALE) {
1893 *opnd |= ANYOF_SPACEL;
1896 for (Class = 0; Class < 256; Class++)
1898 regset(opnd, Class);
1903 if (regflags & PMf_LOCALE) {
1905 *opnd |= ANYOF_NSPACEL;
1908 for (Class = 0; Class < 256; Class++)
1909 if (!isSPACE(Class))
1910 regset(opnd, Class);
1915 for (Class = '0'; Class <= '9'; Class++)
1916 regset(opnd, Class);
1920 for (Class = 0; Class < '0'; Class++)
1921 regset(opnd, Class);
1922 for (Class = '9' + 1; Class < 256; Class++)
1923 regset(opnd, Class);
1948 Class = scan_hex(regparse, 2, &numlen);
1952 Class = UCHARAT(regparse++);
1953 Class = toCTRL(Class);
1955 case '0': case '1': case '2': case '3': case '4':
1956 case '5': case '6': case '7': case '8': case '9':
1957 Class = scan_oct(--regparse, 3, &numlen);
1963 if (lastclass > Class)
1964 FAIL("invalid [] range in regexp");
1969 if (*regparse == '-' && regparse+1 < regxend &&
1970 regparse[1] != ']') {
1973 continue; /* do it next time */
1976 for ( ; lastclass <= Class; lastclass++)
1977 regset(opnd, lastclass);
1980 if (*regparse != ']')
1981 FAIL("unmatched [] in regexp");
1989 char* retval = regparse++;
1992 if (*regparse == '(' && regparse[1] == '?' &&
1993 regparse[2] == '#') {
1994 while (*regparse && *regparse != ')')
1999 if (regflags & PMf_EXTENDED) {
2000 if (isSPACE(*regparse)) {
2004 else if (*regparse == '#') {
2005 while (*regparse && *regparse != '\n')
2016 - reg_node - emit a node
2018 static regnode * /* Location. */
2019 #ifdef CAN_PROTOTYPE
2026 register regnode *ret;
2027 register regnode *ptr;
2031 SIZE_ALIGN(regsize);
2032 #ifdef REGALIGN_STRUCT
2040 NODE_ALIGN_FILL(ret);
2042 FILL_ADVANCE_NODE(ptr, op);
2049 - reganode - emit a node with an argument
2051 static regnode * /* Location. */
2052 #ifdef CAN_PROTOTYPE
2053 reganode(U8 op, U32 arg)
2060 register regnode *ret;
2061 register regnode *ptr;
2065 SIZE_ALIGN(regsize);
2074 NODE_ALIGN_FILL(ret);
2076 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2083 - regc - emit (if appropriate) a byte of code
2085 #ifdef CAN_PROTOTYPE
2100 - reginsert - insert an operator in front of already-emitted operand
2102 * Means relocating the operand.
2104 #ifdef CAN_PROTOTYPE
2106 reginsert(U8 op, regnode *opnd)
2114 register regnode *src;
2115 register regnode *dst;
2116 register regnode *place;
2117 register int offset = regarglen[(U8)op];
2119 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2122 regsize += NODE_STEP_REGNODE + offset;
2127 regcode += NODE_STEP_REGNODE + offset;
2130 StructCopy(--src, --dst, regnode);
2132 place = opnd; /* Op node, where operand used to be. */
2133 src = NEXTOPER(place);
2134 FILL_ADVANCE_NODE(place, op);
2135 Zero(src, offset, regnode);
2136 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2137 src[offset + 1] = '\177';
2142 - regtail - set the next-pointer at the end of a node chain of p to val.
2145 regtail(regnode *p, regnode *val)
2147 register regnode *scan;
2148 register regnode *temp;
2149 register I32 offset;
2154 /* Find last node. */
2157 temp = regnext(scan);
2164 # ifdef REGALIGN_STRUCT
2165 if (reg_off_by_arg[OP(scan)]) {
2166 ARG_SET(scan, val - scan);
2168 NEXT_OFF(scan) = val - scan;
2171 offset = val - scan;
2173 *(short*)(scan+1) = offset;
2177 if (OP(scan) == BACK)
2178 offset = scan - val;
2180 offset = val - scan;
2181 *(scan+1) = (offset>>8)&0377;
2182 *(scan+2) = offset&0377;
2187 - regoptail - regtail on operand of first argument; nop if operandless
2190 regoptail(regnode *p, regnode *val)
2192 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2193 if (p == NULL || SIZE_ONLY)
2195 if (regkind[(U8)OP(p)] == BRANCH) {
2196 regtail(NEXTOPER(p), val);
2197 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2198 regtail(NEXTOPER(NEXTOPER(p)), val);
2204 - regcurly - a little FSA that accepts {\d+,?\d*}
2207 regcurly(register char *s)
2227 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2229 register char op = EXACT; /* Arbitrary non-END op. */
2230 register regnode *next, *onode;
2232 while (op != END && (!last || node < last)) {
2233 /* While that wasn't END last time... */
2239 next = regnext(node);
2241 if (OP(node) == OPTIMIZED)
2244 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2245 2*l + 1, "", SvPVX(sv));
2246 if (next == NULL) /* Next ptr. */
2247 PerlIO_printf(Perl_debug_log, "(0)");
2249 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2250 (void)PerlIO_putc(Perl_debug_log, '\n');
2252 if (regkind[(U8)op] == BRANCHJ) {
2253 register regnode *nnode = (OP(next) == LONGJMP
2256 if (last && nnode > last)
2258 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2259 } else if (regkind[(U8)op] == BRANCH) {
2260 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2261 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2262 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2263 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2264 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2265 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2267 } else if ( op == PLUS || op == STAR) {
2268 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2269 } else if (op == ANYOF) {
2270 node = NEXTOPER(node);
2272 } else if (regkind[(U8)op] == EXACT) {
2273 /* Literal string, where present. */
2274 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2275 node = NEXTOPER(node);
2277 node = NEXTOPER(node);
2278 node += regarglen[(U8)op];
2280 if (op == CURLYX || op == OPEN)
2282 else if (op == WHILEM)
2289 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2294 SV *sv = sv_newmortal();
2296 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2298 /* Header fields of interest. */
2299 if (r->anchored_substr)
2300 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2302 SvPVX(r->anchored_substr),
2304 SvTAIL(r->anchored_substr) ? "$" : "",
2305 r->anchored_offset);
2306 if (r->float_substr)
2307 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2309 SvPVX(r->float_substr),
2311 SvTAIL(r->float_substr) ? "$" : "",
2312 r->float_min_offset, r->float_max_offset);
2313 if (r->check_substr)
2314 PerlIO_printf(Perl_debug_log,
2315 r->check_substr == r->float_substr
2316 ? "(checking floating" : "(checking anchored");
2317 if (r->reganch & ROPT_NOSCAN)
2318 PerlIO_printf(Perl_debug_log, " noscan");
2319 if (r->reganch & ROPT_CHECK_ALL)
2320 PerlIO_printf(Perl_debug_log, " isall");
2321 if (r->check_substr)
2322 PerlIO_printf(Perl_debug_log, ") ");
2324 if (r->regstclass) {
2325 regprop(sv, r->regstclass);
2326 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2328 if (r->reganch & ROPT_ANCH) {
2329 PerlIO_printf(Perl_debug_log, "anchored");
2330 if (r->reganch & ROPT_ANCH_BOL)
2331 PerlIO_printf(Perl_debug_log, "(BOL)");
2332 if (r->reganch & ROPT_ANCH_MBOL)
2333 PerlIO_printf(Perl_debug_log, "(MBOL)");
2334 if (r->reganch & ROPT_ANCH_GPOS)
2335 PerlIO_printf(Perl_debug_log, "(GPOS)");
2336 PerlIO_putc(Perl_debug_log, ' ');
2338 if (r->reganch & ROPT_GPOS_SEEN)
2339 PerlIO_printf(Perl_debug_log, "GPOS ");
2340 if (r->reganch & ROPT_SKIP)
2341 PerlIO_printf(Perl_debug_log, "plus ");
2342 if (r->reganch & ROPT_IMPLICIT)
2343 PerlIO_printf(Perl_debug_log, "implicit ");
2344 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2345 PerlIO_printf(Perl_debug_log, "\n");
2349 - regprop - printable representation of opcode
2352 regprop(SV *sv, regnode *o)
2354 register char *p = 0;
2389 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2392 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2395 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2422 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2425 #ifdef REGALIGN_STRUCT
2426 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2428 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2432 #ifdef REGALIGN_STRUCT
2433 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2435 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2439 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2442 sv_catpvf(sv, "REF%d", ARG(o));
2445 sv_catpvf(sv, "REFF%d", ARG(o));
2448 sv_catpvf(sv, "REFFL%d", ARG(o));
2451 sv_catpvf(sv, "OPEN%d", ARG(o));
2454 sv_catpvf(sv, "CLOSE%d", ARG(o));
2470 #ifdef REGALIGN_STRUCT
2471 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2477 #ifdef REGALIGN_STRUCT
2478 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2532 sv_catpvf(sv, "GROUPP%d", ARG(o));
2547 FAIL("corrupted regexp opcode");
2552 #endif /* DEBUGGING */
2555 pregfree(struct regexp *r)
2557 if (!r || (--r->refcnt > 0))
2560 Safefree(r->precomp);
2562 Safefree(r->subbase);
2563 if (r->anchored_substr)
2564 SvREFCNT_dec(r->anchored_substr);
2565 if (r->float_substr)
2566 SvREFCNT_dec(r->float_substr);
2568 int n = r->data->count;
2570 switch (r->data->what[n]) {
2572 SvREFCNT_dec((SV*)r->data->data[n]);
2575 op_free((OP_4tree*)r->data->data[n]);
2580 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2583 Safefree(r->data->what);
2586 Safefree(r->startp);
2592 - regnext - dig the "next" pointer out of a node
2594 * [Note, when REGALIGN is defined there are two places in regmatch()
2595 * that bypass this code for speed.]
2598 regnext(register regnode *p)
2600 register I32 offset;
2605 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2621 re_croak2(const char* pat1,const char* pat2,...)
2625 re_croak2(const char* pat1,const char* pat2, va_alist)
2632 STRLEN l1 = strlen(pat1);
2633 STRLEN l2 = strlen(pat2);
2641 Copy(pat1, buf, l1 , char);
2642 Copy(pat2, buf + l1, l2 , char);
2643 buf[l1 + l2 + 1] = '\n';
2644 buf[l1 + l2 + 2] = '\0';
2646 va_start(args, pat2);
2650 message = mess(buf, &args);
2652 l1 = strlen(message);
2655 Copy(message, buf, l1 , char);
2656 buf[l1] = '\0'; /* Overwrite \n */