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.
68 # if defined(BUGGY_MSC6)
69 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
70 # pragma optimize("a",off)
71 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
72 # pragma optimize("w",on )
73 # endif /* BUGGY_MSC6 */
80 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
81 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
82 ((*s) == '{' && regcurly(s)))
84 #define PERL_META "^$.[()|?+*\\"
86 #define META "^$.[()|?+*\\"
90 #undef SPSTART /* dratted cpp namespace... */
93 * Flags to be passed up and down.
95 #define WORST 0 /* Worst case. */
96 #define HASWIDTH 0x1 /* Known never to match null string. */
97 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
98 #define SPSTART 0x4 /* Starts with * or +. */
99 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
102 * Forward declarations for pregcomp()'s friends.
105 static char* regwhite _((char *, char *));
107 static regnode *reg _((I32, I32 *));
108 static regnode *reganode _((U8, U32));
109 static regnode *regatom _((I32 *));
110 static regnode *regbranch _((I32 *, I32));
111 static void regc _((U8, char *));
112 static regnode *regclass _((void));
113 STATIC I32 regcurly _((char *));
114 static regnode *reg_node _((U8));
115 static regnode *regpiece _((I32 *));
116 static void reginsert _((U8, regnode *));
117 static void regoptail _((regnode *, regnode *));
118 static void regset _((char *, I32));
119 static void regtail _((regnode *, regnode *));
120 static char* nextchar _((void));
123 /* Length of a variant. */
132 I32 last_end; /* min value, <0 unless valid. */
135 SV **longest; /* Either &l_fixed, or &l_float. */
139 I32 offset_float_min;
140 I32 offset_float_max;
145 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
147 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
148 #define SF_BEFORE_SEOL 0x1
149 #define SF_BEFORE_MEOL 0x2
150 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
151 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
153 #define SF_FIX_SHIFT_EOL (+2)
154 #define SF_FL_SHIFT_EOL (+4)
156 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
157 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
159 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
160 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
161 #define SF_IS_INF 0x40
162 #define SF_HAS_PAR 0x80
163 #define SF_IN_PAR 0x100
164 #define SF_HAS_EVAL 0x200
167 scan_commit(scan_data_t *data)
169 STRLEN l = SvCUR(data->last_found);
170 STRLEN old_l = SvCUR(*data->longest);
172 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
173 sv_setsv(*data->longest, data->last_found);
174 if (*data->longest == data->longest_fixed) {
175 data->offset_fixed = l ? data->last_start_min : data->pos_min;
176 if (data->flags & SF_BEFORE_EOL)
178 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
180 data->flags &= ~SF_FIX_BEFORE_EOL;
182 data->offset_float_min = l ? data->last_start_min : data->pos_min;
183 data->offset_float_max = (l
184 ? data->last_start_max
185 : data->pos_min + data->pos_delta);
186 if (data->flags & SF_BEFORE_EOL)
188 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
190 data->flags &= ~SF_FL_BEFORE_EOL;
193 SvCUR_set(data->last_found, 0);
195 data->flags &= ~SF_BEFORE_EOL;
198 #define SCF_DO_SUBSTR 1
200 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
201 to the position after last scanned or to NULL. */
204 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
205 /* scanp: Start here (read-write). */
206 /* deltap: Write maxlen-minlen here. */
207 /* last: Stop before this one. */
209 I32 min = 0, pars = 0, code;
210 regnode *scan = *scanp, *next;
212 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
213 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
214 scan_data_t data_fake;
216 while (scan && OP(scan) != END && scan < last) {
217 /* Peephole optimizer: */
219 if (regkind[(U8)OP(scan)] == EXACT) {
220 regnode *n = regnext(scan);
223 regnode *stop = scan;
226 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
227 /* Skip NOTHING, merge EXACT*. */
229 ( regkind[(U8)OP(n)] == NOTHING ||
230 (stringok && (OP(n) == OP(scan))))
232 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
233 if (OP(n) == TAIL || n > next)
235 if (regkind[(U8)OP(n)] == NOTHING) {
236 NEXT_OFF(scan) += NEXT_OFF(n);
237 next = n + NODE_STEP_REGNODE;
244 int oldl = *OPERAND(scan);
245 regnode *nnext = regnext(n);
247 if (oldl + *OPERAND(n) > U8_MAX)
249 NEXT_OFF(scan) += NEXT_OFF(n);
250 *OPERAND(scan) += *OPERAND(n);
251 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
252 /* Now we can overwrite *n : */
253 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
254 *OPERAND(n) + 1, char);
264 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
266 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
275 if (OP(scan) != CURLYX) {
276 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
277 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
281 /* Skip NOTHING and LONGJMP. */
282 while ((n = regnext(n))
283 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
284 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
287 if (reg_off_by_arg[OP(scan)])
290 NEXT_OFF(scan) = off;
292 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
293 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
294 next = regnext(scan);
297 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
298 I32 max1 = 0, min1 = I32_MAX, num = 0;
300 if (flags & SCF_DO_SUBSTR)
302 while (OP(scan) == code) {
303 I32 deltanext, minnext;
307 next = regnext(scan);
308 scan = NEXTOPER(scan);
310 scan = NEXTOPER(scan);
311 /* We suppose the run is continuous, last=next...*/
312 minnext = study_chunk(&scan, &deltanext, next,
316 if (max1 < minnext + deltanext)
317 max1 = minnext + deltanext;
318 if (deltanext == I32_MAX)
321 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
323 if (data_fake.flags & SF_HAS_EVAL)
324 data->flags |= SF_HAS_EVAL;
328 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
330 if (flags & SCF_DO_SUBSTR) {
331 data->pos_min += min1;
332 data->pos_delta += max1 - min1;
333 if (max1 != min1 || is_inf)
334 data->longest = &(data->longest_float);
337 delta += max1 - min1;
338 } else if (code == BRANCHJ) /* single branch is optimized. */
339 scan = NEXTOPER(NEXTOPER(scan));
340 else /* single branch is optimized. */
341 scan = NEXTOPER(scan);
343 } else if (OP(scan) == EXACT) {
344 min += *OPERAND(scan);
345 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
346 I32 l = *OPERAND(scan);
348 /* The code below prefers earlier match for fixed
349 offset, later match for variable offset. */
350 if (data->last_end == -1) { /* Update the start info. */
351 data->last_start_min = data->pos_min;
352 data->last_start_max = is_inf
353 ? I32_MAX : data->pos_min + data->pos_delta;
355 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
356 data->last_end = data->pos_min + l;
357 data->pos_min += l; /* As in the first entry. */
358 data->flags &= ~SF_BEFORE_EOL;
360 } else if (regkind[(U8)OP(scan)] == EXACT) {
361 if (flags & SCF_DO_SUBSTR)
363 min += *OPERAND(scan);
364 if (data && (flags & SCF_DO_SUBSTR))
365 data->pos_min += *OPERAND(scan);
366 } else if (strchr(varies,OP(scan))) {
367 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
368 regnode *oscan = scan;
370 switch (regkind[(U8)OP(scan)]) {
372 scan = NEXTOPER(scan);
375 if (flags & SCF_DO_SUBSTR) {
376 next = NEXTOPER(scan);
377 if (OP(next) == EXACT) {
379 maxcount = REG_INFTY;
380 next = regnext(scan);
381 scan = NEXTOPER(scan);
385 if (flags & SCF_DO_SUBSTR)
391 scan = regnext(scan);
392 if (flags & SCF_DO_SUBSTR) {
394 data->longest = &(data->longest_float);
396 goto optimize_curly_tail;
398 mincount = ARG1(scan);
399 maxcount = ARG2(scan);
400 next = regnext(scan);
401 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
403 if (flags & SCF_DO_SUBSTR) {
404 if (mincount == 0) scan_commit(data);
405 pos_before = data->pos_min;
409 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
411 data->flags |= SF_IS_INF;
413 /* This will finish on WHILEM, setting scan, or on NULL: */
414 minnext = study_chunk(&scan, &deltanext, last, data,
416 ? (flags & ~SCF_DO_SUBSTR) : flags);
417 if (!scan) /* It was not CURLYX, but CURLY. */
419 if (dowarn && (minnext + deltanext == 0)
420 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
421 warn("Strange *+?{} on zero-length expression");
422 min += minnext * mincount;
423 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
424 || deltanext == I32_MAX);
425 delta += (minnext + deltanext) * maxcount - minnext * mincount;
427 /* Try powerful optimization CURLYX => CURLYN. */
428 #ifdef REGALIGN_STRUCT
429 if ( OP(oscan) == CURLYX && data
430 && data->flags & SF_IN_PAR
431 && !(data->flags & SF_HAS_EVAL)
432 && !deltanext && minnext == 1 ) {
433 /* Try to optimize to CURLYN. */
434 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
435 regnode *nxt1 = nxt, *nxt2;
439 if (!strchr(simple,OP(nxt))
440 && !(regkind[(U8)OP(nxt)] == EXACT
441 && *OPERAND(nxt) == 1))
445 if (OP(nxt) != CLOSE)
447 /* Now we know that nxt2 is the only contents: */
448 oscan->flags = ARG(nxt);
450 OP(nxt1) = NOTHING; /* was OPEN. */
452 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
453 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
454 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
455 OP(nxt) = OPTIMIZED; /* was CLOSE. */
456 OP(nxt + 1) = OPTIMIZED; /* was count. */
457 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
463 /* Try optimization CURLYX => CURLYM. */
464 if ( OP(oscan) == CURLYX && data
465 #ifdef REGALIGN_STRUCT
466 && !(data->flags & SF_HAS_PAR)
468 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
470 && !(data->flags & SF_HAS_EVAL)
472 /* XXXX How to optimize if data == 0? */
473 /* Optimize to a simpler form. */
474 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
478 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
479 && (OP(nxt2) != WHILEM))
481 OP(nxt2) = SUCCEED; /* Whas WHILEM */
482 #ifdef REGALIGN_STRUCT
483 /* Need to optimize away parenths. */
484 if (data->flags & SF_IN_PAR) {
485 /* Set the parenth number. */
486 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
488 if (OP(nxt) != CLOSE)
489 FAIL("panic opt close");
490 oscan->flags = ARG(nxt);
491 OP(nxt1) = OPTIMIZED; /* was OPEN. */
492 OP(nxt) = OPTIMIZED; /* was CLOSE. */
494 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
495 OP(nxt + 1) = OPTIMIZED; /* was count. */
496 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
497 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
500 while ( nxt1 && (OP(nxt1) != WHILEM)) {
501 regnode *nnxt = regnext(nxt1);
504 if (reg_off_by_arg[OP(nxt1)])
505 ARG_SET(nxt1, nxt2 - nxt1);
506 else if (nxt2 - nxt1 < U16_MAX)
507 NEXT_OFF(nxt1) = nxt2 - nxt1;
509 OP(nxt) = NOTHING; /* Cannot beautify */
514 /* Optimize again: */
515 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
520 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
522 if (flags & SCF_DO_SUBSTR) {
523 SV *last_str = Nullsv;
524 int counted = mincount != 0;
526 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
527 I32 b = pos_before >= data->last_start_min
528 ? pos_before : data->last_start_min;
530 char *s = SvPV(data->last_found, l);
532 l -= b - data->last_start_min;
533 /* Get the added string: */
534 last_str = newSVpv(s + b - data->last_start_min, l);
535 if (deltanext == 0 && pos_before == b) {
536 /* What was added is a constant string */
538 SvGROW(last_str, (mincount * l) + 1);
539 repeatcpy(SvPVX(last_str) + l,
540 SvPVX(last_str), l, mincount - 1);
541 SvCUR(last_str) *= mincount;
542 /* Add additional parts. */
543 SvCUR_set(data->last_found,
544 SvCUR(data->last_found) - l);
545 sv_catsv(data->last_found, last_str);
546 data->last_end += l * (mincount - 1);
550 /* It is counted once already... */
551 data->pos_min += minnext * (mincount - counted);
552 data->pos_delta += - counted * deltanext +
553 (minnext + deltanext) * maxcount - minnext * mincount;
554 if (mincount != maxcount) {
556 if (mincount && last_str) {
557 sv_setsv(data->last_found, last_str);
558 data->last_end = data->pos_min;
559 data->last_start_min =
560 data->pos_min - SvCUR(last_str);
561 data->last_start_max = is_inf
563 : data->pos_min + data->pos_delta
566 data->longest = &(data->longest_float);
569 if (fl & SF_HAS_EVAL)
570 data->flags |= SF_HAS_EVAL;
573 if (OP(oscan) != CURLYX) {
574 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
576 NEXT_OFF(oscan) += NEXT_OFF(next);
580 default: /* REF only? */
581 if (flags & SCF_DO_SUBSTR) {
583 data->longest = &(data->longest_float);
588 } else if (strchr(simple,OP(scan))) {
589 if (flags & SCF_DO_SUBSTR) {
594 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
595 data->flags |= (OP(scan) == MEOL
598 } else if (regkind[(U8)OP(scan)] == BRANCHJ
599 && (scan->flags || data)
600 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
601 I32 deltanext, minnext;
605 next = regnext(scan);
606 nscan = NEXTOPER(NEXTOPER(scan));
607 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
610 FAIL("variable length lookbehind not implemented");
611 } else if (minnext > U8_MAX) {
612 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
614 scan->flags = minnext;
616 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
618 if (data_fake.flags & SF_HAS_EVAL)
619 data->flags |= SF_HAS_EVAL;
620 } else if (OP(scan) == OPEN) {
622 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
623 #ifdef REGALIGN_STRUCT
624 next = regnext(scan);
626 if ( next && (OP(next) != WHILEM) && next < last)
628 is_par = 0; /* Disable optimization */
629 } else if (OP(scan) == EVAL) {
631 data->flags |= SF_HAS_EVAL;
633 /* Else: zero-length, ignore. */
634 scan = regnext(scan);
639 *deltap = is_inf ? I32_MAX : delta;
640 if (flags & SCF_DO_SUBSTR && is_inf)
641 data->pos_delta = I32_MAX - data->pos_min;
644 if (is_par && pars==1 && data) {
645 data->flags |= SF_IN_PAR;
646 data->flags &= ~SF_HAS_PAR;
647 } else if (pars && data) {
648 data->flags |= SF_HAS_PAR;
649 data->flags &= ~SF_IN_PAR;
655 add_data(I32 n, char *s)
659 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
660 char, struct reg_data);
661 Renew(rx->data->what, rx->data->count + n, U8);
662 rx->data->count += n;
664 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
665 char, struct reg_data);
666 New(1208, rx->data->what, n, U8);
669 Copy(s, rx->data->what + rx->data->count - n, n, U8);
670 return rx->data->count - n;
674 - pregcomp - compile a regular expression into internal code
676 * We can't allocate space until we know how big the compiled form will be,
677 * but we can't compile it (and thus know how big it is) until we've got a
678 * place to put the code. So we cheat: we compile it twice, once with code
679 * generation turned off and size counting turned on, and once "for real".
680 * This also means that we don't allocate space until we are sure that the
681 * thing really will compile successfully, and we never have to move the
682 * code and thus invalidate pointers into it. (Note that it has to be in
683 * one piece because free() must be able to free it all.) [NB: not true in perl]
685 * Beware that the optimization-preparation code in here knows about some
686 * of the structure of the compiled regexp. [I'll say.]
689 pregcomp(char *exp, char *xend, PMOP *pm)
703 FAIL("NULL regexp argument");
705 regprecomp = savepvn(exp, xend - exp);
706 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
707 xend - exp, regprecomp));
708 regflags = pm->op_pmflags;
712 seen_zerolen = *exp == '^' ? -1 : 0;
715 /* First pass: determine size, legality. */
722 regc((U8)MAGIC, (char*)regcode);
723 if (reg(0, &flags) == NULL) {
724 Safefree(regprecomp);
728 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
733 char *s = PerlEnv_getenv("TERMCAP_COLORS");
737 colors[0] = s = savepv(s);
741 FAIL("Not enough TABs in TERMCAP_COLORS");
750 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
751 colors[0],colors[1],colors[2],colors[3]);
755 /* Small enough for pointer-storage convention?
756 If extralen==0, this means that we will not need long jumps. */
757 #ifndef REGALIGN_STRUCT
758 if (regsize >= 0x10000L && extralen)
759 FAIL("regexp too big");
761 if (regsize >= 0x10000L && extralen)
767 /* Allocate space and initialize. */
768 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
771 FAIL("regexp out of space");
773 r->prelen = xend - exp;
774 r->precomp = regprecomp;
775 r->subbeg = r->subbase = NULL;
778 /* Second pass: emit code. */
783 regcode = r->program;
784 regc((U8)MAGIC, (char*) regcode++);
786 if (reg(0, &flags) == NULL)
789 /* Dig out information for optimizations. */
790 pm->op_pmflags = regflags;
792 r->regstclass = NULL;
793 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
794 scan = r->program + 1; /* First BRANCH. */
795 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
798 STRLEN longest_float_length, longest_fixed_length;
800 StructCopy(&zero_scan_data, &data, scan_data_t);
802 /* Skip introductions and multiplicators >= 1. */
803 while ((OP(first) == OPEN && (sawopen = 1)) ||
804 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
805 (OP(first) == PLUS) ||
806 (OP(first) == MINMOD) ||
807 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
808 if (OP(first) == PLUS)
811 first += regarglen[(U8)OP(first)];
812 first = NEXTOPER(first);
815 /* Starting-point info. */
817 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
818 else if (strchr(simple+2,OP(first)))
819 r->regstclass = first;
820 else if (regkind[(U8)OP(first)] == BOUND ||
821 regkind[(U8)OP(first)] == NBOUND)
822 r->regstclass = first;
823 else if (regkind[(U8)OP(first)] == BOL) {
824 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
825 first = NEXTOPER(first);
828 else if (OP(first) == GPOS) {
829 r->reganch |= ROPT_ANCH_GPOS;
830 first = NEXTOPER(first);
833 else if ((OP(first) == STAR &&
834 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
835 !(r->reganch & ROPT_ANCH) )
837 /* turn .* into ^.* with an implied $*=1 */
838 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
839 first = NEXTOPER(first);
842 if (sawplus && (!sawopen || !regsawback))
843 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
845 /* Scan is after the zeroth branch, first is atomic matcher. */
846 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
849 * If there's something expensive in the r.e., find the
850 * longest literal string that must appear and make it the
851 * regmust. Resolve ties in favor of later strings, since
852 * the regstart check works with the beginning of the r.e.
853 * and avoiding duplication strengthens checking. Not a
854 * strong reason, but sufficient in the absence of others.
855 * [Now we resolve ties in favor of the earlier string if
856 * it happens that c_offset_min has been invalidated, since the
857 * earlier string may buy us something the later one won't.]
861 data.longest_fixed = newSVpv("",0);
862 data.longest_float = newSVpv("",0);
863 data.last_found = newSVpv("",0);
864 data.longest = &(data.longest_fixed);
867 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
868 &data, SCF_DO_SUBSTR);
869 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
870 && data.last_start_min == 0 && data.last_end > 0
872 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
873 r->reganch |= ROPT_CHECK_ALL;
875 SvREFCNT_dec(data.last_found);
877 longest_float_length = SvCUR(data.longest_float);
878 if (longest_float_length
879 || (data.flags & SF_FL_BEFORE_EOL
880 && (!(data.flags & SF_FL_BEFORE_MEOL)
881 || (regflags & PMf_MULTILINE)))) {
882 if (SvCUR(data.longest_fixed)
883 && data.offset_fixed == data.offset_float_min)
884 goto remove; /* Like in (a)+. */
886 r->float_substr = data.longest_float;
887 r->float_min_offset = data.offset_float_min;
888 r->float_max_offset = data.offset_float_max;
889 fbm_compile(r->float_substr);
890 BmUSEFUL(r->float_substr) = 100;
891 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
892 && (!(data.flags & SF_FL_BEFORE_MEOL)
893 || (regflags & PMf_MULTILINE)))
894 SvTAIL_on(r->float_substr);
897 r->float_substr = Nullsv;
898 SvREFCNT_dec(data.longest_float);
899 longest_float_length = 0;
902 longest_fixed_length = SvCUR(data.longest_fixed);
903 if (longest_fixed_length
904 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
905 && (!(data.flags & SF_FIX_BEFORE_MEOL)
906 || (regflags & PMf_MULTILINE)))) {
907 r->anchored_substr = data.longest_fixed;
908 r->anchored_offset = data.offset_fixed;
909 fbm_compile(r->anchored_substr);
910 BmUSEFUL(r->anchored_substr) = 100;
911 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
912 && (!(data.flags & SF_FIX_BEFORE_MEOL)
913 || (regflags & PMf_MULTILINE)))
914 SvTAIL_on(r->anchored_substr);
916 r->anchored_substr = Nullsv;
917 SvREFCNT_dec(data.longest_fixed);
918 longest_fixed_length = 0;
921 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
922 if (longest_fixed_length > longest_float_length) {
923 r->check_substr = r->anchored_substr;
924 r->check_offset_min = r->check_offset_max = r->anchored_offset;
925 if (r->reganch & ROPT_ANCH_SINGLE)
926 r->reganch |= ROPT_NOSCAN;
928 r->check_substr = r->float_substr;
929 r->check_offset_min = data.offset_float_min;
930 r->check_offset_max = data.offset_float_max;
933 /* Several toplevels. Best we can is to set minlen. */
936 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
937 scan = r->program + 1;
938 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
939 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
942 r->nparens = regnpar - 1;
944 if (regseen & REG_SEEN_GPOS)
945 r->reganch |= ROPT_GPOS_SEEN;
946 if (regseen & REG_SEEN_LOOKBEHIND)
947 r->reganch |= ROPT_LOOKBEHIND_SEEN;
948 Newz(1002, r->startp, regnpar, char*);
949 Newz(1002, r->endp, regnpar, char*);
955 - reg - regular expression, i.e. main body or parenthesized thing
957 * Caller must absorb opening parenthesis.
959 * Combining parenthesis handling with the base level of regular expression
960 * is a trifle forced, but the need to tie the tails of the branches to what
961 * follows makes it hard to avoid.
964 reg(I32 paren, I32 *flagp)
965 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
967 register regnode *ret; /* Will be the head of the group. */
968 register regnode *br;
969 register regnode *lastbr;
970 register regnode *ender = 0;
971 register I32 parno = 0;
972 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
975 *flagp = HASWIDTH; /* Tentatively. */
977 /* Make an OPEN node, if parenthesized. */
979 if (*regparse == '?') {
982 ret = NULL; /* For look-ahead/behind. */
985 #ifndef REGALIGN_STRUCT
986 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
988 regseen |= REG_SEEN_LOOKBEHIND;
989 if (*regparse == '!')
991 if (*regparse != '=' && *regparse != '!')
1002 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1005 while (*regparse && *regparse != ')')
1007 if (*regparse != ')')
1008 FAIL("Sequence (?#... not terminated");
1015 I32 count = 1, n = 0;
1019 OP_4tree *sop, *rop;
1022 while (count && (c = *regparse)) {
1023 if (c == '\\' && regparse[1])
1031 if (*regparse != ')')
1032 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1036 if (regparse - 1 - s)
1037 sv = newSVpv(s, regparse - 1 - s);
1039 sv = newSVpv("", 0);
1041 rop = sv_compile_2op(sv, &sop, "re", &av);
1043 n = add_data(3, "nso");
1044 rx->data->data[n] = (void*)rop;
1045 rx->data->data[n+1] = (void*)av;
1046 rx->data->data[n+2] = (void*)sop;
1048 } else { /* First pass */
1050 FAIL("Eval-group in insecure regular expression");
1054 return reganode(EVAL, n);
1058 if (regparse[0] == '?') {
1059 if (regparse[1] == '=' || regparse[1] == '!'
1060 || regparse[1] == '<'
1061 || regparse[1] == '{') { /* Lookahead or eval. */
1064 ret = reg_node(LOGICAL);
1065 regtail(ret, reg(1, &flag));
1068 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1069 parno = atoi(regparse++);
1071 while (isDIGIT(*regparse))
1073 ret = reganode(GROUPP, parno);
1074 if ((c = *nextchar()) != ')')
1075 FAIL2("Switch (?(number%c not recognized", c);
1077 regtail(ret, reganode(IFTHEN, 0));
1078 br = regbranch(&flags, 1);
1080 br = reganode(LONGJMP, 0);
1082 regtail(br, reganode(LONGJMP, 0));
1085 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1086 regbranch(&flags, 1);
1087 regtail(ret, lastbr);
1092 FAIL("Switch (?(condition)... contains too many branches");
1093 ender = reg_node(TAIL);
1096 regtail(lastbr, ender);
1097 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1099 regtail(ret, ender);
1102 FAIL2("Unknown condition for (?(%.2s", regparse);
1106 FAIL("Sequence (? incomplete");
1110 while (*regparse && strchr("iogcmsx", *regparse))
1111 pmflag(®flags, *regparse++);
1113 if (*regparse != ')')
1114 FAIL2("Sequence (?%c...) not recognized", *regparse);
1123 ret = reganode(OPEN, parno);
1129 /* Pick up the branches, linking them together. */
1130 br = regbranch(&flags, 1);
1133 if (*regparse == '|') {
1134 if (!SIZE_ONLY && extralen) {
1135 reginsert(BRANCHJ, br);
1137 reginsert(BRANCH, br);
1140 extralen += 1; /* For BRANCHJ-BRANCH. */
1141 } else if (paren == ':') {
1142 *flagp |= flags&SIMPLE;
1144 if (open) { /* Starts with OPEN. */
1145 regtail(ret, br); /* OPEN -> first. */
1146 } else if (paren != '?') /* Not Conditional */
1148 if (!(flags&HASWIDTH))
1149 *flagp &= ~HASWIDTH;
1150 *flagp |= flags&SPSTART;
1152 while (*regparse == '|') {
1153 if (!SIZE_ONLY && extralen) {
1154 ender = reganode(LONGJMP,0);
1155 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1158 extralen += 2; /* Account for LONGJMP. */
1160 br = regbranch(&flags, 0);
1163 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1165 if (!(flags&HASWIDTH))
1166 *flagp &= ~HASWIDTH;
1167 *flagp |= flags&SPSTART;
1170 if (have_branch || paren != ':') {
1171 /* Make a closing node, and hook it on the end. */
1174 ender = reg_node(TAIL);
1177 ender = reganode(CLOSE, parno);
1184 ender = reg_node(SUCCEED);
1185 *flagp &= ~HASWIDTH;
1188 ender = reg_node(END);
1191 regtail(lastbr, ender);
1194 /* Hook the tails of the branches to the closing node. */
1195 for (br = ret; br != NULL; br = regnext(br)) {
1196 regoptail(br, ender);
1203 static char parens[] = "=!<,>";
1205 if (paren && (p = strchr(parens, paren))) {
1206 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1207 int flag = (p - parens) > 1;
1210 node = SUSPEND, flag = 0;
1211 reginsert(node,ret);
1212 #ifdef REGALIGN_STRUCT
1215 regtail(ret, reg_node(TAIL));
1219 /* Check for proper termination. */
1220 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1221 FAIL("unmatched () in regexp");
1222 } else if (!paren && regparse < regxend) {
1223 if (*regparse == ')') {
1224 FAIL("unmatched () in regexp");
1226 FAIL("junk on end of regexp"); /* "Can't happen". */
1230 regflags = oregflags;
1237 - regbranch - one alternative of an | operator
1239 * Implements the concatenation operator.
1242 regbranch(I32 *flagp, I32 first)
1244 register regnode *ret;
1245 register regnode *chain = NULL;
1246 register regnode *latest;
1247 I32 flags = 0, c = 0;
1252 if (!SIZE_ONLY && extralen)
1253 ret = reganode(BRANCHJ,0);
1255 ret = reg_node(BRANCH);
1258 if (!first && SIZE_ONLY)
1259 extralen += 1; /* BRANCHJ */
1261 *flagp = WORST; /* Tentatively. */
1265 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1267 latest = regpiece(&flags);
1268 if (latest == NULL) {
1269 if (flags & TRYAGAIN)
1272 } else if (ret == NULL)
1274 *flagp |= flags&HASWIDTH;
1275 if (chain == NULL) /* First piece. */
1276 *flagp |= flags&SPSTART;
1279 regtail(chain, latest);
1284 if (chain == NULL) { /* Loop ran zero times. */
1285 chain = reg_node(NOTHING);
1290 *flagp |= flags&SIMPLE;
1297 - regpiece - something followed by possible [*+?]
1299 * Note that the branching code sequences used for ? and the general cases
1300 * of * and + are somewhat optimized: they use the same NOTHING node as
1301 * both the endmarker for their branch list and the body of the last branch.
1302 * It might seem that this node could be dispensed with entirely, but the
1303 * endmarker role is not redundant.
1306 regpiece(I32 *flagp)
1308 register regnode *ret;
1310 register char *next;
1312 char *origparse = regparse;
1315 I32 max = REG_INFTY;
1317 ret = regatom(&flags);
1319 if (flags & TRYAGAIN)
1326 if (op == '{' && regcurly(regparse)) {
1327 next = regparse + 1;
1329 while (isDIGIT(*next) || *next == ',') {
1338 if (*next == '}') { /* got one */
1342 min = atoi(regparse);
1348 if (!max && *maxpos != '0')
1349 max = REG_INFTY; /* meaning "infinity" */
1350 else if (max >= REG_INFTY)
1351 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1356 if ((flags&SIMPLE)) {
1357 regnaughty += 2 + regnaughty / 2;
1358 reginsert(CURLY, ret);
1361 regnaughty += 4 + regnaughty; /* compound interest */
1362 regtail(ret, reg_node(WHILEM));
1363 if (!SIZE_ONLY && extralen) {
1364 reginsert(LONGJMP,ret);
1365 reginsert(NOTHING,ret);
1366 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1368 reginsert(CURLYX,ret);
1369 if (!SIZE_ONLY && extralen)
1370 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1371 regtail(ret, reg_node(NOTHING));
1375 #ifdef REGALIGN_STRUCT
1380 *flagp = (WORST|HASWIDTH);
1381 if (max && max < min)
1382 FAIL("Can't do {n,m} with n > m");
1397 #if 0 /* Now runtime fix should be reliable. */
1398 if (!(flags&HASWIDTH) && op != '?')
1399 FAIL("regexp *+ operand could be empty");
1404 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1406 if (op == '*' && (flags&SIMPLE)) {
1407 reginsert(STAR, ret);
1408 #ifdef REGALIGN_STRUCT
1413 else if (op == '*') {
1416 } else if (op == '+' && (flags&SIMPLE)) {
1417 reginsert(PLUS, ret);
1418 #ifdef REGALIGN_STRUCT
1423 else if (op == '+') {
1426 } else if (op == '?') {
1431 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1432 warn("%.*s matches null string many times",
1433 regparse - origparse, origparse);
1436 if (*regparse == '?') {
1438 reginsert(MINMOD, ret);
1440 regtail(ret, ret + NODE_STEP_REGNODE);
1442 regtail(ret, ret + 3);
1445 if (ISMULT2(regparse))
1446 FAIL("nested *?+ in regexp");
1452 - regatom - the lowest level
1454 * Optimization: gobbles an entire sequence of ordinary characters so that
1455 * it can turn them into a single node, which is smaller to store and
1456 * faster to run. Backslashed characters are exceptions, each becoming a
1457 * separate node; the code is simpler that way and it's not worth fixing.
1459 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1464 register regnode *ret = 0;
1467 *flagp = WORST; /* Tentatively. */
1470 switch (*regparse) {
1474 if (regflags & PMf_MULTILINE)
1475 ret = reg_node(MBOL);
1476 else if (regflags & PMf_SINGLELINE)
1477 ret = reg_node(SBOL);
1479 ret = reg_node(BOL);
1485 if (regflags & PMf_MULTILINE)
1486 ret = reg_node(MEOL);
1487 else if (regflags & PMf_SINGLELINE)
1488 ret = reg_node(SEOL);
1490 ret = reg_node(EOL);
1494 if (regflags & PMf_SINGLELINE)
1495 ret = reg_node(SANY);
1497 ret = reg_node(ANY);
1499 *flagp |= HASWIDTH|SIMPLE;
1504 *flagp |= HASWIDTH|SIMPLE;
1508 ret = reg(1, &flags);
1510 if (flags & TRYAGAIN)
1514 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1518 if (flags & TRYAGAIN) {
1522 FAIL2("internal urp in regexp at /%s/", regparse);
1523 /* Supposed to be caught earlier. */
1526 if (!regcurly(regparse)) {
1534 FAIL("?+*{} follows nothing in regexp");
1537 switch (*++regparse) {
1540 ret = reg_node(SBOL);
1545 ret = reg_node(GPOS);
1546 regseen |= REG_SEEN_GPOS;
1551 ret = reg_node(SEOL);
1556 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1557 *flagp |= HASWIDTH|SIMPLE;
1561 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1562 *flagp |= HASWIDTH|SIMPLE;
1567 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1573 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1578 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1579 *flagp |= HASWIDTH|SIMPLE;
1583 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1584 *flagp |= HASWIDTH|SIMPLE;
1588 ret = reg_node(DIGIT);
1589 *flagp |= HASWIDTH|SIMPLE;
1593 ret = reg_node(NDIGIT);
1594 *flagp |= HASWIDTH|SIMPLE;
1607 case '1': case '2': case '3': case '4':
1608 case '5': case '6': case '7': case '8': case '9':
1610 I32 num = atoi(regparse);
1612 if (num > 9 && num >= regnpar)
1616 ret = reganode((regflags & PMf_FOLD)
1617 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1620 while (isDIGIT(*regparse))
1628 if (regparse >= regxend)
1629 FAIL("trailing \\ in regexp");
1637 if (regflags & PMf_EXTENDED) {
1638 while (regparse < regxend && *regparse != '\n') regparse++;
1639 if (regparse < regxend)
1654 ret = reg_node((regflags & PMf_FOLD)
1655 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1657 s = (char *) OPERAND(ret);
1658 regc(0, s++); /* save spot for len */
1659 for (len = 0, p = regparse - 1;
1660 len < 127 && p < regxend;
1665 if (regflags & PMf_EXTENDED)
1666 p = regwhite(p, regxend);
1716 ender = scan_hex(++p, 2, &numlen);
1721 ender = UCHARAT(p++);
1722 ender = toCTRL(ender);
1724 case '0': case '1': case '2': case '3':case '4':
1725 case '5': case '6': case '7': case '8':case '9':
1727 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1728 ender = scan_oct(p, 3, &numlen);
1738 FAIL("trailing \\ in regexp");
1749 if (regflags & PMf_EXTENDED)
1750 p = regwhite(p, regxend);
1751 if (ISMULT2(p)) { /* Back off on ?+*. */
1766 FAIL("internal disaster in regexp");
1772 *OPERAND(ret) = len;
1775 #ifdef REGALIGN_STRUCT
1776 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1779 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1789 regwhite(char *p, char *e)
1794 else if (*p == '#') {
1797 } while (p < e && *p != '\n');
1806 regset(char *opnd, register I32 c)
1811 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1817 register char *opnd, *s;
1819 register I32 lastclass = 1234;
1820 register I32 range = 0;
1821 register regnode *ret;
1825 s = opnd = (char *) OPERAND(regcode);
1826 ret = reg_node(ANYOF);
1827 for (Class = 0; Class < 33; Class++)
1829 if (*regparse == '^') { /* Complement of range. */
1833 *opnd |= ANYOF_INVERT;
1836 regcode += ANY_SKIP;
1837 if (regflags & PMf_FOLD)
1838 *opnd |= ANYOF_FOLD;
1839 if (regflags & PMf_LOCALE)
1840 *opnd |= ANYOF_LOCALE;
1842 regsize += ANY_SKIP;
1844 if (*regparse == ']' || *regparse == '-')
1845 goto skipcond; /* allow 1st char to be ] or - */
1846 while (regparse < regxend && *regparse != ']') {
1848 Class = UCHARAT(regparse++);
1849 if (Class == '\\') {
1850 Class = UCHARAT(regparse++);
1853 if (regflags & PMf_LOCALE) {
1855 *opnd |= ANYOF_ALNUML;
1858 for (Class = 0; Class < 256; Class++)
1860 regset(opnd, Class);
1865 if (regflags & PMf_LOCALE) {
1867 *opnd |= ANYOF_NALNUML;
1870 for (Class = 0; Class < 256; Class++)
1871 if (!isALNUM(Class))
1872 regset(opnd, Class);
1877 if (regflags & PMf_LOCALE) {
1879 *opnd |= ANYOF_SPACEL;
1882 for (Class = 0; Class < 256; Class++)
1884 regset(opnd, Class);
1889 if (regflags & PMf_LOCALE) {
1891 *opnd |= ANYOF_NSPACEL;
1894 for (Class = 0; Class < 256; Class++)
1895 if (!isSPACE(Class))
1896 regset(opnd, Class);
1901 for (Class = '0'; Class <= '9'; Class++)
1902 regset(opnd, Class);
1906 for (Class = 0; Class < '0'; Class++)
1907 regset(opnd, Class);
1908 for (Class = '9' + 1; Class < 256; Class++)
1909 regset(opnd, Class);
1934 Class = scan_hex(regparse, 2, &numlen);
1938 Class = UCHARAT(regparse++);
1939 Class = toCTRL(Class);
1941 case '0': case '1': case '2': case '3': case '4':
1942 case '5': case '6': case '7': case '8': case '9':
1943 Class = scan_oct(--regparse, 3, &numlen);
1949 if (lastclass > Class)
1950 FAIL("invalid [] range in regexp");
1955 if (*regparse == '-' && regparse+1 < regxend &&
1956 regparse[1] != ']') {
1959 continue; /* do it next time */
1962 for ( ; lastclass <= Class; lastclass++)
1963 regset(opnd, lastclass);
1966 if (*regparse != ']')
1967 FAIL("unmatched [] in regexp");
1975 char* retval = regparse++;
1978 if (*regparse == '(' && regparse[1] == '?' &&
1979 regparse[2] == '#') {
1980 while (*regparse && *regparse != ')')
1985 if (regflags & PMf_EXTENDED) {
1986 if (isSPACE(*regparse)) {
1990 else if (*regparse == '#') {
1991 while (*regparse && *regparse != '\n')
2002 - reg_node - emit a node
2004 STATIC regnode * /* Location. */
2005 #ifdef CAN_PROTOTYPE
2012 register regnode *ret;
2013 register regnode *ptr;
2017 SIZE_ALIGN(regsize);
2018 #ifdef REGALIGN_STRUCT
2026 NODE_ALIGN_FILL(ret);
2028 FILL_ADVANCE_NODE(ptr, op);
2035 - reganode - emit a node with an argument
2037 STATIC regnode * /* Location. */
2038 #ifdef CAN_PROTOTYPE
2039 reganode(U8 op, U32 arg)
2046 register regnode *ret;
2047 register regnode *ptr;
2051 SIZE_ALIGN(regsize);
2060 NODE_ALIGN_FILL(ret);
2062 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2069 - regc - emit (if appropriate) a byte of code
2071 #ifdef CAN_PROTOTYPE
2086 - reginsert - insert an operator in front of already-emitted operand
2088 * Means relocating the operand.
2090 #ifdef CAN_PROTOTYPE
2092 reginsert(U8 op, regnode *opnd)
2100 register regnode *src;
2101 register regnode *dst;
2102 register regnode *place;
2103 register int offset = regarglen[(U8)op];
2105 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2108 regsize += NODE_STEP_REGNODE + offset;
2113 regcode += NODE_STEP_REGNODE + offset;
2116 StructCopy(--src, --dst, regnode);
2118 place = opnd; /* Op node, where operand used to be. */
2119 src = NEXTOPER(place);
2120 FILL_ADVANCE_NODE(place, op);
2121 Zero(src, offset, regnode);
2122 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2123 src[offset + 1] = '\177';
2128 - regtail - set the next-pointer at the end of a node chain of p to val.
2131 regtail(regnode *p, regnode *val)
2133 register regnode *scan;
2134 register regnode *temp;
2135 register I32 offset;
2140 /* Find last node. */
2143 temp = regnext(scan);
2150 # ifdef REGALIGN_STRUCT
2151 if (reg_off_by_arg[OP(scan)]) {
2152 ARG_SET(scan, val - scan);
2154 NEXT_OFF(scan) = val - scan;
2157 offset = val - scan;
2159 *(short*)(scan+1) = offset;
2163 if (OP(scan) == BACK)
2164 offset = scan - val;
2166 offset = val - scan;
2167 *(scan+1) = (offset>>8)&0377;
2168 *(scan+2) = offset&0377;
2173 - regoptail - regtail on operand of first argument; nop if operandless
2176 regoptail(regnode *p, regnode *val)
2178 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2179 if (p == NULL || SIZE_ONLY)
2181 if (regkind[(U8)OP(p)] == BRANCH) {
2182 regtail(NEXTOPER(p), val);
2183 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2184 regtail(NEXTOPER(NEXTOPER(p)), val);
2190 - regcurly - a little FSA that accepts {\d+,?\d*}
2193 regcurly(register char *s)
2213 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2215 register char op = EXACT; /* Arbitrary non-END op. */
2216 register regnode *next, *onode;
2218 while (op != END && (!last || node < last)) {
2219 /* While that wasn't END last time... */
2225 next = regnext(node);
2227 if (OP(node) == OPTIMIZED)
2230 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2231 2*l + 1, "", SvPVX(sv));
2232 if (next == NULL) /* Next ptr. */
2233 PerlIO_printf(Perl_debug_log, "(0)");
2235 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2236 (void)PerlIO_putc(Perl_debug_log, '\n');
2238 if (regkind[(U8)op] == BRANCHJ) {
2239 register regnode *nnode = (OP(next) == LONGJMP
2242 if (last && nnode > last)
2244 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2245 } else if (regkind[(U8)op] == BRANCH) {
2246 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2247 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2248 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2249 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2250 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2251 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2253 } else if ( op == PLUS || op == STAR) {
2254 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2255 } else if (op == ANYOF) {
2256 node = NEXTOPER(node);
2258 } else if (regkind[(U8)op] == EXACT) {
2259 /* Literal string, where present. */
2260 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2261 node = NEXTOPER(node);
2263 node = NEXTOPER(node);
2264 node += regarglen[(U8)op];
2266 if (op == CURLYX || op == OPEN)
2268 else if (op == WHILEM)
2275 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2280 SV *sv = sv_newmortal();
2282 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2284 /* Header fields of interest. */
2285 if (r->anchored_substr)
2286 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2288 SvPVX(r->anchored_substr),
2290 SvTAIL(r->anchored_substr) ? "$" : "",
2291 r->anchored_offset);
2292 if (r->float_substr)
2293 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2295 SvPVX(r->float_substr),
2297 SvTAIL(r->float_substr) ? "$" : "",
2298 r->float_min_offset, r->float_max_offset);
2299 if (r->check_substr)
2300 PerlIO_printf(Perl_debug_log,
2301 r->check_substr == r->float_substr
2302 ? "(checking floating" : "(checking anchored");
2303 if (r->reganch & ROPT_NOSCAN)
2304 PerlIO_printf(Perl_debug_log, " noscan");
2305 if (r->reganch & ROPT_CHECK_ALL)
2306 PerlIO_printf(Perl_debug_log, " isall");
2307 if (r->check_substr)
2308 PerlIO_printf(Perl_debug_log, ") ");
2310 if (r->regstclass) {
2311 regprop(sv, r->regstclass);
2312 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2314 if (r->reganch & ROPT_ANCH) {
2315 PerlIO_printf(Perl_debug_log, "anchored");
2316 if (r->reganch & ROPT_ANCH_BOL)
2317 PerlIO_printf(Perl_debug_log, "(BOL)");
2318 if (r->reganch & ROPT_ANCH_MBOL)
2319 PerlIO_printf(Perl_debug_log, "(MBOL)");
2320 if (r->reganch & ROPT_ANCH_GPOS)
2321 PerlIO_printf(Perl_debug_log, "(GPOS)");
2322 PerlIO_putc(Perl_debug_log, ' ');
2324 if (r->reganch & ROPT_GPOS_SEEN)
2325 PerlIO_printf(Perl_debug_log, "GPOS ");
2326 if (r->reganch & ROPT_SKIP)
2327 PerlIO_printf(Perl_debug_log, "plus ");
2328 if (r->reganch & ROPT_IMPLICIT)
2329 PerlIO_printf(Perl_debug_log, "implicit ");
2330 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2331 PerlIO_printf(Perl_debug_log, "\n");
2335 - regprop - printable representation of opcode
2338 regprop(SV *sv, regnode *o)
2340 register char *p = 0;
2375 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2378 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2381 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2408 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2411 #ifdef REGALIGN_STRUCT
2412 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2414 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2418 #ifdef REGALIGN_STRUCT
2419 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2421 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2425 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2428 sv_catpvf(sv, "REF%d", ARG(o));
2431 sv_catpvf(sv, "REFF%d", ARG(o));
2434 sv_catpvf(sv, "REFFL%d", ARG(o));
2437 sv_catpvf(sv, "OPEN%d", ARG(o));
2440 sv_catpvf(sv, "CLOSE%d", ARG(o));
2456 #ifdef REGALIGN_STRUCT
2457 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2463 #ifdef REGALIGN_STRUCT
2464 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2518 sv_catpvf(sv, "GROUPP%d", ARG(o));
2533 FAIL("corrupted regexp opcode");
2538 #endif /* DEBUGGING */
2541 pregfree(struct regexp *r)
2543 if (!r || (--r->refcnt > 0))
2546 Safefree(r->precomp);
2548 Safefree(r->subbase);
2549 if (r->anchored_substr)
2550 SvREFCNT_dec(r->anchored_substr);
2551 if (r->float_substr)
2552 SvREFCNT_dec(r->float_substr);
2554 int n = r->data->count;
2556 switch (r->data->what[n]) {
2558 SvREFCNT_dec((SV*)r->data->data[n]);
2561 op_free((OP_4tree*)r->data->data[n]);
2566 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2569 Safefree(r->data->what);
2572 Safefree(r->startp);
2578 - regnext - dig the "next" pointer out of a node
2580 * [Note, when REGALIGN is defined there are two places in regmatch()
2581 * that bypass this code for speed.]
2584 regnext(register regnode *p)
2586 register I32 offset;
2591 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2607 re_croak2(const char* pat1,const char* pat2,...)
2611 re_croak2(const char* pat1,const char* pat2, va_alist)
2618 STRLEN l1 = strlen(pat1);
2619 STRLEN l2 = strlen(pat2);
2627 Copy(pat1, buf, l1 , char);
2628 Copy(pat2, buf + l1, l2 , char);
2629 buf[l1 + l2 + 1] = '\n';
2630 buf[l1 + l2 + 2] = '\0';
2632 va_start(args, pat2);
2636 message = mess(buf, &args);
2638 l1 = strlen(message);
2641 Copy(message, buf, l1 , char);
2642 buf[l1] = '\0'; /* Overwrite \n */