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 to match non-null strings. */
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.
106 static regnode *reg _((I32, I32 *));
107 static regnode *reganode _((U8, U32));
108 static regnode *regatom _((I32 *));
109 static regnode *regbranch _((I32 *, I32));
110 static void regc _((U8, char *));
111 static regnode *regclass _((void));
112 STATIC I32 regcurly _((char *));
113 static regnode *reg_node _((U8));
114 static regnode *regpiece _((I32 *));
115 static void reginsert _((U8, regnode *));
116 static void regoptail _((regnode *, regnode *));
117 static void regtail _((regnode *, regnode *));
118 static char* regwhite _((char *, char *));
119 static char* nextchar _((void));
120 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
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)
154 # define SF_FIX_SHIFT_EOL (0+2)
155 # define SF_FL_SHIFT_EOL (0+4)
157 # define SF_FIX_SHIFT_EOL (+2)
158 # define SF_FL_SHIFT_EOL (+4)
161 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
162 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
164 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
165 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
166 #define SF_IS_INF 0x40
167 #define SF_HAS_PAR 0x80
168 #define SF_IN_PAR 0x100
169 #define SF_HAS_EVAL 0x200
170 #define SCF_DO_SUBSTR 0x400
173 scan_commit(scan_data_t *data)
175 STRLEN l = SvCUR(data->last_found);
176 STRLEN old_l = SvCUR(*data->longest);
178 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
179 sv_setsv(*data->longest, data->last_found);
180 if (*data->longest == data->longest_fixed) {
181 data->offset_fixed = l ? data->last_start_min : data->pos_min;
182 if (data->flags & SF_BEFORE_EOL)
184 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
186 data->flags &= ~SF_FIX_BEFORE_EOL;
188 data->offset_float_min = l ? data->last_start_min : data->pos_min;
189 data->offset_float_max = (l
190 ? data->last_start_max
191 : data->pos_min + data->pos_delta);
192 if (data->flags & SF_BEFORE_EOL)
194 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
196 data->flags &= ~SF_FL_BEFORE_EOL;
199 SvCUR_set(data->last_found, 0);
201 data->flags &= ~SF_BEFORE_EOL;
204 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
205 to the position after last scanned or to NULL. */
208 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
209 /* scanp: Start here (read-write). */
210 /* deltap: Write maxlen-minlen here. */
211 /* last: Stop before this one. */
213 I32 min = 0, pars = 0, code;
214 regnode *scan = *scanp, *next;
216 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
217 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
218 scan_data_t data_fake;
220 while (scan && OP(scan) != END && scan < last) {
221 /* Peephole optimizer: */
223 if (regkind[(U8)OP(scan)] == EXACT) {
224 regnode *n = regnext(scan);
227 regnode *stop = scan;
230 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
231 /* Skip NOTHING, merge EXACT*. */
233 ( regkind[(U8)OP(n)] == NOTHING ||
234 (stringok && (OP(n) == OP(scan))))
236 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
237 if (OP(n) == TAIL || n > next)
239 if (regkind[(U8)OP(n)] == NOTHING) {
240 NEXT_OFF(scan) += NEXT_OFF(n);
241 next = n + NODE_STEP_REGNODE;
248 int oldl = *OPERAND(scan);
249 regnode *nnext = regnext(n);
251 if (oldl + *OPERAND(n) > U8_MAX)
253 NEXT_OFF(scan) += NEXT_OFF(n);
254 *OPERAND(scan) += *OPERAND(n);
255 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
256 /* Now we can overwrite *n : */
257 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
258 *OPERAND(n) + 1, char);
268 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
270 /* Purify reports a benign UMR here sometimes, because we
271 * don't initialize the OP() slot of a node when that node
272 * is occupied by just the trailing null of the string in
274 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
283 if (OP(scan) != CURLYX) {
284 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
285 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
289 /* Skip NOTHING and LONGJMP. */
290 while ((n = regnext(n))
291 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
292 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
295 if (reg_off_by_arg[OP(scan)])
298 NEXT_OFF(scan) = off;
300 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
301 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
302 next = regnext(scan);
305 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
306 I32 max1 = 0, min1 = I32_MAX, num = 0;
308 if (flags & SCF_DO_SUBSTR)
310 while (OP(scan) == code) {
311 I32 deltanext, minnext;
315 next = regnext(scan);
316 scan = NEXTOPER(scan);
318 scan = NEXTOPER(scan);
319 /* We suppose the run is continuous, last=next...*/
320 minnext = study_chunk(&scan, &deltanext, next,
324 if (max1 < minnext + deltanext)
325 max1 = minnext + deltanext;
326 if (deltanext == I32_MAX)
329 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
331 if (data && (data_fake.flags & SF_HAS_EVAL))
332 data->flags |= SF_HAS_EVAL;
336 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
338 if (flags & SCF_DO_SUBSTR) {
339 data->pos_min += min1;
340 data->pos_delta += max1 - min1;
341 if (max1 != min1 || is_inf)
342 data->longest = &(data->longest_float);
345 delta += max1 - min1;
346 } else if (code == BRANCHJ) /* single branch is optimized. */
347 scan = NEXTOPER(NEXTOPER(scan));
348 else /* single branch is optimized. */
349 scan = NEXTOPER(scan);
351 } else if (OP(scan) == EXACT) {
352 min += *OPERAND(scan);
353 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
354 I32 l = *OPERAND(scan);
356 /* The code below prefers earlier match for fixed
357 offset, later match for variable offset. */
358 if (data->last_end == -1) { /* Update the start info. */
359 data->last_start_min = data->pos_min;
360 data->last_start_max = is_inf
361 ? I32_MAX : data->pos_min + data->pos_delta;
363 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
364 data->last_end = data->pos_min + l;
365 data->pos_min += l; /* As in the first entry. */
366 data->flags &= ~SF_BEFORE_EOL;
368 } else if (regkind[(U8)OP(scan)] == EXACT) {
369 if (flags & SCF_DO_SUBSTR)
371 min += *OPERAND(scan);
372 if (data && (flags & SCF_DO_SUBSTR))
373 data->pos_min += *OPERAND(scan);
374 } else if (strchr(varies,OP(scan))) {
375 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
376 regnode *oscan = scan;
378 switch (regkind[(U8)OP(scan)]) {
380 scan = NEXTOPER(scan);
383 if (flags & SCF_DO_SUBSTR) {
384 next = NEXTOPER(scan);
385 if (OP(next) == EXACT) {
387 maxcount = REG_INFTY;
388 next = regnext(scan);
389 scan = NEXTOPER(scan);
393 if (flags & SCF_DO_SUBSTR)
399 scan = regnext(scan);
400 if (flags & SCF_DO_SUBSTR) {
402 data->longest = &(data->longest_float);
404 goto optimize_curly_tail;
406 mincount = ARG1(scan);
407 maxcount = ARG2(scan);
408 next = regnext(scan);
409 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
411 if (flags & SCF_DO_SUBSTR) {
412 if (mincount == 0) scan_commit(data);
413 pos_before = data->pos_min;
417 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
419 data->flags |= SF_IS_INF;
421 /* This will finish on WHILEM, setting scan, or on NULL: */
422 minnext = study_chunk(&scan, &deltanext, last, data,
424 ? (flags & ~SCF_DO_SUBSTR) : flags);
425 if (!scan) /* It was not CURLYX, but CURLY. */
427 if (dowarn && (minnext + deltanext == 0)
428 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
429 && maxcount <= 10000) /* Complement check for big count */
430 warn("Strange *+?{} on zero-length expression");
431 min += minnext * mincount;
432 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
433 || deltanext == I32_MAX);
434 delta += (minnext + deltanext) * maxcount - minnext * mincount;
436 /* Try powerful optimization CURLYX => CURLYN. */
437 if ( OP(oscan) == CURLYX && data
438 && data->flags & SF_IN_PAR
439 && !(data->flags & SF_HAS_EVAL)
440 && !deltanext && minnext == 1 ) {
441 /* Try to optimize to CURLYN. */
442 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
443 regnode *nxt1 = nxt, *nxt2;
447 if (!strchr(simple,OP(nxt))
448 && !(regkind[(U8)OP(nxt)] == EXACT
449 && *OPERAND(nxt) == 1))
453 if (OP(nxt) != CLOSE)
455 /* Now we know that nxt2 is the only contents: */
456 oscan->flags = ARG(nxt);
458 OP(nxt1) = NOTHING; /* was OPEN. */
460 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
461 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
462 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
463 OP(nxt) = OPTIMIZED; /* was CLOSE. */
464 OP(nxt + 1) = OPTIMIZED; /* was count. */
465 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
470 /* Try optimization CURLYX => CURLYM. */
471 if ( OP(oscan) == CURLYX && data
472 && !(data->flags & SF_HAS_PAR)
473 && !(data->flags & SF_HAS_EVAL)
475 /* XXXX How to optimize if data == 0? */
476 /* Optimize to a simpler form. */
477 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
481 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
482 && (OP(nxt2) != WHILEM))
484 OP(nxt2) = SUCCEED; /* Whas WHILEM */
485 /* Need to optimize away parenths. */
486 if (data->flags & SF_IN_PAR) {
487 /* Set the parenth number. */
488 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
490 if (OP(nxt) != CLOSE)
491 FAIL("panic opt close");
492 oscan->flags = ARG(nxt);
493 OP(nxt1) = OPTIMIZED; /* was OPEN. */
494 OP(nxt) = OPTIMIZED; /* was CLOSE. */
496 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
497 OP(nxt + 1) = OPTIMIZED; /* was count. */
498 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
499 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
502 while ( nxt1 && (OP(nxt1) != WHILEM)) {
503 regnode *nnxt = regnext(nxt1);
506 if (reg_off_by_arg[OP(nxt1)])
507 ARG_SET(nxt1, nxt2 - nxt1);
508 else if (nxt2 - nxt1 < U16_MAX)
509 NEXT_OFF(nxt1) = nxt2 - nxt1;
511 OP(nxt) = NOTHING; /* Cannot beautify */
516 /* Optimize again: */
517 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
521 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
523 if (flags & SCF_DO_SUBSTR) {
524 SV *last_str = Nullsv;
525 int counted = mincount != 0;
527 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
528 I32 b = pos_before >= data->last_start_min
529 ? pos_before : data->last_start_min;
531 char *s = SvPV(data->last_found, l);
533 l -= b - data->last_start_min;
534 /* Get the added string: */
535 last_str = newSVpv(s + b - data->last_start_min, l);
536 if (deltanext == 0 && pos_before == b) {
537 /* What was added is a constant string */
539 SvGROW(last_str, (mincount * l) + 1);
540 repeatcpy(SvPVX(last_str) + l,
541 SvPVX(last_str), l, mincount - 1);
542 SvCUR(last_str) *= mincount;
543 /* Add additional parts. */
544 SvCUR_set(data->last_found,
545 SvCUR(data->last_found) - l);
546 sv_catsv(data->last_found, last_str);
547 data->last_end += l * (mincount - 1);
551 /* It is counted once already... */
552 data->pos_min += minnext * (mincount - counted);
553 data->pos_delta += - counted * deltanext +
554 (minnext + deltanext) * maxcount - minnext * mincount;
555 if (mincount != maxcount) {
557 if (mincount && last_str) {
558 sv_setsv(data->last_found, last_str);
559 data->last_end = data->pos_min;
560 data->last_start_min =
561 data->pos_min - SvCUR(last_str);
562 data->last_start_max = is_inf
564 : data->pos_min + data->pos_delta
567 data->longest = &(data->longest_float);
570 if (data && (fl & SF_HAS_EVAL))
571 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);
579 default: /* REF only? */
580 if (flags & SCF_DO_SUBSTR) {
582 data->longest = &(data->longest_float);
587 } else if (strchr(simple,OP(scan))) {
588 if (flags & SCF_DO_SUBSTR) {
593 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
594 data->flags |= (OP(scan) == MEOL
597 } else if (regkind[(U8)OP(scan)] == BRANCHJ
598 && (scan->flags || data)
599 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
600 I32 deltanext, minnext;
604 next = regnext(scan);
605 nscan = NEXTOPER(NEXTOPER(scan));
606 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
609 FAIL("variable length lookbehind not implemented");
610 } else if (minnext > U8_MAX) {
611 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
613 scan->flags = minnext;
615 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
617 if (data && (data_fake.flags & SF_HAS_EVAL))
618 data->flags |= SF_HAS_EVAL;
619 } else if (OP(scan) == OPEN) {
621 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
622 next = regnext(scan);
624 if ( next && (OP(next) != WHILEM) && next < last)
625 is_par = 0; /* Disable optimization */
626 } else if (OP(scan) == EVAL) {
628 data->flags |= SF_HAS_EVAL;
630 /* Else: zero-length, ignore. */
631 scan = regnext(scan);
636 *deltap = is_inf ? I32_MAX : delta;
637 if (flags & SCF_DO_SUBSTR && is_inf)
638 data->pos_delta = I32_MAX - data->pos_min;
641 if (is_par && pars==1 && data) {
642 data->flags |= SF_IN_PAR;
643 data->flags &= ~SF_HAS_PAR;
644 } else if (pars && data) {
645 data->flags |= SF_HAS_PAR;
646 data->flags &= ~SF_IN_PAR;
652 add_data(I32 n, char *s)
654 if (regcomp_rx->data) {
655 Renewc(regcomp_rx->data,
656 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
657 char, struct reg_data);
658 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
659 regcomp_rx->data->count += n;
661 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
662 char, struct reg_data);
663 New(1208, regcomp_rx->data->what, n, U8);
664 regcomp_rx->data->count = n;
666 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
667 return regcomp_rx->data->count - n;
671 - pregcomp - compile a regular expression into internal code
673 * We can't allocate space until we know how big the compiled form will be,
674 * but we can't compile it (and thus know how big it is) until we've got a
675 * place to put the code. So we cheat: we compile it twice, once with code
676 * generation turned off and size counting turned on, and once "for real".
677 * This also means that we don't allocate space until we are sure that the
678 * thing really will compile successfully, and we never have to move the
679 * code and thus invalidate pointers into it. (Note that it has to be in
680 * one piece because free() must be able to free it all.) [NB: not true in perl]
682 * Beware that the optimization-preparation code in here knows about some
683 * of the structure of the compiled regexp. [I'll say.]
686 pregcomp(char *exp, char *xend, PMOP *pm)
700 FAIL("NULL regexp argument");
702 regprecomp = savepvn(exp, xend - exp);
703 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
704 xend - exp, regprecomp));
705 regflags = pm->op_pmflags;
709 seen_zerolen = *exp == '^' ? -1 : 0;
712 /* First pass: determine size, legality. */
719 regc((U8)MAGIC, (char*)regcode);
720 if (reg(0, &flags) == NULL) {
721 Safefree(regprecomp);
725 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
730 char *s = PerlEnv_getenv("TERMCAP_COLORS");
734 colors[0] = s = savepv(s);
738 FAIL("Not enough TABs in TERMCAP_COLORS");
747 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
748 colors[0],colors[1],colors[2],colors[3]);
752 /* Small enough for pointer-storage convention?
753 If extralen==0, this means that we will not need long jumps. */
754 if (regsize >= 0x10000L && extralen)
759 /* Allocate space and initialize. */
760 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
763 FAIL("regexp out of space");
765 r->prelen = xend - exp;
766 r->precomp = regprecomp;
767 r->subbeg = r->subbase = NULL;
768 r->nparens = regnpar - 1; /* set early to validate backrefs */
771 /* Second pass: emit code. */
776 regcode = r->program;
777 regc((U8)MAGIC, (char*) regcode++);
779 if (reg(0, &flags) == NULL)
782 /* Dig out information for optimizations. */
783 pm->op_pmflags = regflags;
785 r->regstclass = NULL;
786 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
787 scan = r->program + 1; /* First BRANCH. */
789 /* XXXX To minimize changes to RE engine we always allocate
790 3-units-long substrs field. */
791 Newz(1004, r->substrs, 1, struct reg_substr_data);
793 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
796 STRLEN longest_float_length, longest_fixed_length;
798 StructCopy(&zero_scan_data, &data, scan_data_t);
800 /* Skip introductions and multiplicators >= 1. */
801 while ((OP(first) == OPEN && (sawopen = 1)) ||
802 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
803 (OP(first) == PLUS) ||
804 (OP(first) == MINMOD) ||
805 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
806 if (OP(first) == PLUS)
809 first += regarglen[(U8)OP(first)];
810 first = NEXTOPER(first);
813 /* Starting-point info. */
815 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
816 else if (strchr(simple+2,OP(first)))
817 r->regstclass = first;
818 else if (regkind[(U8)OP(first)] == BOUND ||
819 regkind[(U8)OP(first)] == NBOUND)
820 r->regstclass = first;
821 else if (regkind[(U8)OP(first)] == BOL) {
822 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
823 first = NEXTOPER(first);
826 else if (OP(first) == GPOS) {
827 r->reganch |= ROPT_ANCH_GPOS;
828 first = NEXTOPER(first);
831 else if ((OP(first) == STAR &&
832 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
833 !(r->reganch & ROPT_ANCH) )
835 /* turn .* into ^.* with an implied $*=1 */
836 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
837 first = NEXTOPER(first);
840 if (sawplus && (!sawopen || !regsawback))
841 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
843 /* Scan is after the zeroth branch, first is atomic matcher. */
844 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
847 * If there's something expensive in the r.e., find the
848 * longest literal string that must appear and make it the
849 * regmust. Resolve ties in favor of later strings, since
850 * the regstart check works with the beginning of the r.e.
851 * and avoiding duplication strengthens checking. Not a
852 * strong reason, but sufficient in the absence of others.
853 * [Now we resolve ties in favor of the earlier string if
854 * it happens that c_offset_min has been invalidated, since the
855 * earlier string may buy us something the later one won't.]
859 data.longest_fixed = newSVpv("",0);
860 data.longest_float = newSVpv("",0);
861 data.last_found = newSVpv("",0);
862 data.longest = &(data.longest_fixed);
865 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
866 &data, SCF_DO_SUBSTR);
867 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
868 && data.last_start_min == 0 && data.last_end > 0
870 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
871 r->reganch |= ROPT_CHECK_ALL;
873 SvREFCNT_dec(data.last_found);
875 longest_float_length = SvCUR(data.longest_float);
876 if (longest_float_length
877 || (data.flags & SF_FL_BEFORE_EOL
878 && (!(data.flags & SF_FL_BEFORE_MEOL)
879 || (regflags & PMf_MULTILINE)))) {
880 if (SvCUR(data.longest_fixed)
881 && data.offset_fixed == data.offset_float_min)
882 goto remove; /* Like in (a)+. */
884 r->float_substr = data.longest_float;
885 r->float_min_offset = data.offset_float_min;
886 r->float_max_offset = data.offset_float_max;
887 fbm_compile(r->float_substr, 0);
888 BmUSEFUL(r->float_substr) = 100;
889 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
890 && (!(data.flags & SF_FL_BEFORE_MEOL)
891 || (regflags & PMf_MULTILINE)))
892 SvTAIL_on(r->float_substr);
895 r->float_substr = Nullsv;
896 SvREFCNT_dec(data.longest_float);
897 longest_float_length = 0;
900 longest_fixed_length = SvCUR(data.longest_fixed);
901 if (longest_fixed_length
902 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
903 && (!(data.flags & SF_FIX_BEFORE_MEOL)
904 || (regflags & PMf_MULTILINE)))) {
905 r->anchored_substr = data.longest_fixed;
906 r->anchored_offset = data.offset_fixed;
907 fbm_compile(r->anchored_substr, 0);
908 BmUSEFUL(r->anchored_substr) = 100;
909 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
910 && (!(data.flags & SF_FIX_BEFORE_MEOL)
911 || (regflags & PMf_MULTILINE)))
912 SvTAIL_on(r->anchored_substr);
914 r->anchored_substr = Nullsv;
915 SvREFCNT_dec(data.longest_fixed);
916 longest_fixed_length = 0;
919 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
920 if (longest_fixed_length > longest_float_length) {
921 r->check_substr = r->anchored_substr;
922 r->check_offset_min = r->check_offset_max = r->anchored_offset;
923 if (r->reganch & ROPT_ANCH_SINGLE)
924 r->reganch |= ROPT_NOSCAN;
926 r->check_substr = r->float_substr;
927 r->check_offset_min = data.offset_float_min;
928 r->check_offset_max = data.offset_float_max;
931 /* Several toplevels. Best we can is to set minlen. */
934 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
935 scan = r->program + 1;
936 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
937 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
941 if (regseen & REG_SEEN_GPOS)
942 r->reganch |= ROPT_GPOS_SEEN;
943 if (regseen & REG_SEEN_LOOKBEHIND)
944 r->reganch |= ROPT_LOOKBEHIND_SEEN;
945 if (regseen & REG_SEEN_EVAL)
946 r->reganch |= ROPT_EVAL_SEEN;
947 Newz(1002, r->startp, regnpar, char*);
948 Newz(1002, r->endp, regnpar, char*);
954 - reg - regular expression, i.e. main body or parenthesized thing
956 * Caller must absorb opening parenthesis.
958 * Combining parenthesis handling with the base level of regular expression
959 * is a trifle forced, but the need to tie the tails of the branches to what
960 * follows makes it hard to avoid.
963 reg(I32 paren, I32 *flagp)
964 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
966 register regnode *ret; /* Will be the head of the group. */
967 register regnode *br;
968 register regnode *lastbr;
969 register regnode *ender = 0;
970 register I32 parno = 0;
971 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
974 *flagp = 0; /* Tentatively. */
976 /* Make an OPEN node, if parenthesized. */
978 if (*regcomp_parse == '?') {
980 paren = *regcomp_parse++;
981 ret = NULL; /* For look-ahead/behind. */
984 regseen |= REG_SEEN_LOOKBEHIND;
985 if (*regcomp_parse == '!')
987 if (*regcomp_parse != '=' && *regcomp_parse != '!')
998 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1001 while (*regcomp_parse && *regcomp_parse != ')')
1003 if (*regcomp_parse != ')')
1004 FAIL("Sequence (?#... not terminated");
1011 I32 count = 1, n = 0;
1013 char *s = regcomp_parse;
1015 OP_4tree *sop, *rop;
1018 regseen |= REG_SEEN_EVAL;
1019 while (count && (c = *regcomp_parse)) {
1020 if (c == '\\' && regcomp_parse[1])
1028 if (*regcomp_parse != ')')
1029 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1033 if (regcomp_parse - 1 - s)
1034 sv = newSVpv(s, regcomp_parse - 1 - s);
1036 sv = newSVpv("", 0);
1038 rop = sv_compile_2op(sv, &sop, "re", &av);
1040 n = add_data(3, "nso");
1041 regcomp_rx->data->data[n] = (void*)rop;
1042 regcomp_rx->data->data[n+1] = (void*)av;
1043 regcomp_rx->data->data[n+2] = (void*)sop;
1045 } else { /* First pass */
1046 if (curcop == &compiling) {
1047 if (!(hints & HINT_RE_EVAL))
1048 FAIL("Eval-group not allowed, use re 'eval'");
1051 FAIL("Eval-group not allowed at run time");
1054 FAIL("Eval-group in insecure regular expression");
1058 return reganode(EVAL, n);
1062 if (regcomp_parse[0] == '?') {
1063 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1064 || regcomp_parse[1] == '<'
1065 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1068 ret = reg_node(LOGICAL);
1069 regtail(ret, reg(1, &flag));
1072 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1073 parno = atoi(regcomp_parse++);
1075 while (isDIGIT(*regcomp_parse))
1077 ret = reganode(GROUPP, parno);
1078 if ((c = *nextchar()) != ')')
1079 FAIL2("Switch (?(number%c not recognized", c);
1081 regtail(ret, reganode(IFTHEN, 0));
1082 br = regbranch(&flags, 1);
1084 br = reganode(LONGJMP, 0);
1086 regtail(br, reganode(LONGJMP, 0));
1089 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1090 regbranch(&flags, 1);
1091 regtail(ret, lastbr);
1096 FAIL("Switch (?(condition)... contains too many branches");
1097 ender = reg_node(TAIL);
1100 regtail(lastbr, ender);
1101 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1103 regtail(ret, ender);
1106 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1110 FAIL("Sequence (? incomplete");
1114 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1115 if (*regcomp_parse != 'o')
1116 pmflag(®flags, *regcomp_parse);
1120 if (*regcomp_parse != ')')
1121 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1130 ret = reganode(OPEN, parno);
1136 /* Pick up the branches, linking them together. */
1137 br = regbranch(&flags, 1);
1140 if (*regcomp_parse == '|') {
1141 if (!SIZE_ONLY && extralen) {
1142 reginsert(BRANCHJ, br);
1144 reginsert(BRANCH, br);
1147 extralen += 1; /* For BRANCHJ-BRANCH. */
1148 } else if (paren == ':') {
1149 *flagp |= flags&SIMPLE;
1151 if (open) { /* Starts with OPEN. */
1152 regtail(ret, br); /* OPEN -> first. */
1153 } else if (paren != '?') /* Not Conditional */
1157 *flagp |= flags&SPSTART;
1159 while (*regcomp_parse == '|') {
1160 if (!SIZE_ONLY && extralen) {
1161 ender = reganode(LONGJMP,0);
1162 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1165 extralen += 2; /* Account for LONGJMP. */
1167 br = regbranch(&flags, 0);
1170 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1174 *flagp |= flags&SPSTART;
1177 if (have_branch || paren != ':') {
1178 /* Make a closing node, and hook it on the end. */
1181 ender = reg_node(TAIL);
1184 ender = reganode(CLOSE, parno);
1190 *flagp &= ~HASWIDTH;
1193 ender = reg_node(SUCCEED);
1196 ender = reg_node(END);
1199 regtail(lastbr, ender);
1202 /* Hook the tails of the branches to the closing node. */
1203 for (br = ret; br != NULL; br = regnext(br)) {
1204 regoptail(br, ender);
1211 static char parens[] = "=!<,>";
1213 if (paren && (p = strchr(parens, paren))) {
1214 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1215 int flag = (p - parens) > 1;
1218 node = SUSPEND, flag = 0;
1219 reginsert(node,ret);
1221 regtail(ret, reg_node(TAIL));
1225 /* Check for proper termination. */
1226 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1227 FAIL("unmatched () in regexp");
1228 } else if (!paren && regcomp_parse < regxend) {
1229 if (*regcomp_parse == ')') {
1230 FAIL("unmatched () in regexp");
1232 FAIL("junk on end of regexp"); /* "Can't happen". */
1236 regflags = oregflags;
1243 - regbranch - one alternative of an | operator
1245 * Implements the concatenation operator.
1248 regbranch(I32 *flagp, I32 first)
1250 register regnode *ret;
1251 register regnode *chain = NULL;
1252 register regnode *latest;
1253 I32 flags = 0, c = 0;
1258 if (!SIZE_ONLY && extralen)
1259 ret = reganode(BRANCHJ,0);
1261 ret = reg_node(BRANCH);
1264 if (!first && SIZE_ONLY)
1265 extralen += 1; /* BRANCHJ */
1267 *flagp = WORST; /* Tentatively. */
1271 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1273 latest = regpiece(&flags);
1274 if (latest == NULL) {
1275 if (flags & TRYAGAIN)
1278 } else if (ret == NULL)
1280 *flagp |= flags&HASWIDTH;
1281 if (chain == NULL) /* First piece. */
1282 *flagp |= flags&SPSTART;
1285 regtail(chain, latest);
1290 if (chain == NULL) { /* Loop ran zero times. */
1291 chain = reg_node(NOTHING);
1296 *flagp |= flags&SIMPLE;
1303 - regpiece - something followed by possible [*+?]
1305 * Note that the branching code sequences used for ? and the general cases
1306 * of * and + are somewhat optimized: they use the same NOTHING node as
1307 * both the endmarker for their branch list and the body of the last branch.
1308 * It might seem that this node could be dispensed with entirely, but the
1309 * endmarker role is not redundant.
1312 regpiece(I32 *flagp)
1314 register regnode *ret;
1316 register char *next;
1318 char *origparse = regcomp_parse;
1321 I32 max = REG_INFTY;
1323 ret = regatom(&flags);
1325 if (flags & TRYAGAIN)
1330 op = *regcomp_parse;
1332 if (op == '{' && regcurly(regcomp_parse)) {
1333 next = regcomp_parse + 1;
1335 while (isDIGIT(*next) || *next == ',') {
1344 if (*next == '}') { /* got one */
1348 min = atoi(regcomp_parse);
1352 maxpos = regcomp_parse;
1354 if (!max && *maxpos != '0')
1355 max = REG_INFTY; /* meaning "infinity" */
1356 else if (max >= REG_INFTY)
1357 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1358 regcomp_parse = next;
1362 if ((flags&SIMPLE)) {
1363 regnaughty += 2 + regnaughty / 2;
1364 reginsert(CURLY, ret);
1367 regnaughty += 4 + regnaughty; /* compound interest */
1368 regtail(ret, reg_node(WHILEM));
1369 if (!SIZE_ONLY && extralen) {
1370 reginsert(LONGJMP,ret);
1371 reginsert(NOTHING,ret);
1372 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1374 reginsert(CURLYX,ret);
1375 if (!SIZE_ONLY && extralen)
1376 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1377 regtail(ret, reg_node(NOTHING));
1387 if (max && max < min)
1388 FAIL("Can't do {n,m} with n > m");
1403 #if 0 /* Now runtime fix should be reliable. */
1404 if (!(flags&HASWIDTH) && op != '?')
1405 FAIL("regexp *+ operand could be empty");
1410 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1412 if (op == '*' && (flags&SIMPLE)) {
1413 reginsert(STAR, ret);
1417 else if (op == '*') {
1420 } else if (op == '+' && (flags&SIMPLE)) {
1421 reginsert(PLUS, ret);
1425 else if (op == '+') {
1428 } else if (op == '?') {
1433 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1434 warn("%.*s matches null string many times",
1435 regcomp_parse - origparse, origparse);
1438 if (*regcomp_parse == '?') {
1440 reginsert(MINMOD, ret);
1441 regtail(ret, ret + NODE_STEP_REGNODE);
1443 if (ISMULT2(regcomp_parse))
1444 FAIL("nested *?+ in regexp");
1450 - regatom - the lowest level
1452 * Optimization: gobbles an entire sequence of ordinary characters so that
1453 * it can turn them into a single node, which is smaller to store and
1454 * faster to run. Backslashed characters are exceptions, each becoming a
1455 * separate node; the code is simpler that way and it's not worth fixing.
1457 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1462 register regnode *ret = 0;
1465 *flagp = WORST; /* Tentatively. */
1468 switch (*regcomp_parse) {
1472 if (regflags & PMf_MULTILINE)
1473 ret = reg_node(MBOL);
1474 else if (regflags & PMf_SINGLELINE)
1475 ret = reg_node(SBOL);
1477 ret = reg_node(BOL);
1480 if (regcomp_parse[1])
1483 if (regflags & PMf_MULTILINE)
1484 ret = reg_node(MEOL);
1485 else if (regflags & PMf_SINGLELINE)
1486 ret = reg_node(SEOL);
1488 ret = reg_node(EOL);
1492 if (regflags & PMf_SINGLELINE)
1493 ret = reg_node(SANY);
1495 ret = reg_node(ANY);
1497 *flagp |= HASWIDTH|SIMPLE;
1502 *flagp |= HASWIDTH|SIMPLE;
1506 ret = reg(1, &flags);
1508 if (flags & TRYAGAIN)
1512 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1516 if (flags & TRYAGAIN) {
1520 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1521 /* Supposed to be caught earlier. */
1524 if (!regcurly(regcomp_parse)) {
1532 FAIL("?+*{} follows nothing in regexp");
1535 switch (*++regcomp_parse) {
1538 ret = reg_node(SBOL);
1543 ret = reg_node(GPOS);
1544 regseen |= REG_SEEN_GPOS;
1549 ret = reg_node(SEOL);
1554 ret = reg_node(EOS);
1556 seen_zerolen++; /* Do not optimize RE away */
1560 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1561 *flagp |= HASWIDTH|SIMPLE;
1565 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1566 *flagp |= HASWIDTH|SIMPLE;
1571 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1577 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1582 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1583 *flagp |= HASWIDTH|SIMPLE;
1587 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1588 *flagp |= HASWIDTH|SIMPLE;
1592 ret = reg_node(DIGIT);
1593 *flagp |= HASWIDTH|SIMPLE;
1597 ret = reg_node(NDIGIT);
1598 *flagp |= HASWIDTH|SIMPLE;
1611 case '1': case '2': case '3': case '4':
1612 case '5': case '6': case '7': case '8': case '9':
1614 I32 num = atoi(regcomp_parse);
1616 if (num > 9 && num >= regnpar)
1619 if (!SIZE_ONLY && num > regcomp_rx->nparens)
1620 FAIL("reference to nonexistent group");
1622 ret = reganode((regflags & PMf_FOLD)
1623 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1626 while (isDIGIT(*regcomp_parse))
1634 if (regcomp_parse >= regxend)
1635 FAIL("trailing \\ in regexp");
1643 if (regflags & PMf_EXTENDED) {
1644 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1645 if (regcomp_parse < regxend)
1660 ret = reg_node((regflags & PMf_FOLD)
1661 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1663 s = (char *) OPERAND(ret);
1664 regc(0, s++); /* save spot for len */
1665 for (len = 0, p = regcomp_parse - 1;
1666 len < 127 && p < regxend;
1671 if (regflags & PMf_EXTENDED)
1672 p = regwhite(p, regxend);
1723 ender = scan_hex(++p, 2, &numlen);
1728 ender = UCHARAT(p++);
1729 ender = toCTRL(ender);
1731 case '0': case '1': case '2': case '3':case '4':
1732 case '5': case '6': case '7': case '8':case '9':
1734 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1735 ender = scan_oct(p, 3, &numlen);
1745 FAIL("trailing \\ in regexp");
1756 if (regflags & PMf_EXTENDED)
1757 p = regwhite(p, regxend);
1758 if (ISMULT2(p)) { /* Back off on ?+*. */
1770 regcomp_parse = p - 1;
1773 FAIL("internal disaster in regexp");
1779 *OPERAND(ret) = len;
1782 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1784 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1794 regwhite(char *p, char *e)
1799 else if (*p == '#') {
1802 } while (p < e && *p != '\n');
1813 register char *opnd, *s;
1815 register I32 lastclass = 1234;
1816 register I32 range = 0;
1817 register regnode *ret;
1821 s = opnd = (char *) OPERAND(regcode);
1822 ret = reg_node(ANYOF);
1823 for (Class = 0; Class < 33; Class++)
1825 if (*regcomp_parse == '^') { /* Complement of range. */
1829 *opnd |= ANYOF_INVERT;
1832 regcode += ANY_SKIP;
1833 if (regflags & PMf_FOLD)
1834 *opnd |= ANYOF_FOLD;
1835 if (regflags & PMf_LOCALE)
1836 *opnd |= ANYOF_LOCALE;
1838 regsize += ANY_SKIP;
1840 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1841 goto skipcond; /* allow 1st char to be ] or - */
1842 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1844 Class = UCHARAT(regcomp_parse++);
1845 if (Class == '[' && regcomp_parse + 1 < regxend &&
1846 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1847 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1848 char posixccc = *regcomp_parse;
1849 char* posixccs = regcomp_parse++;
1851 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1853 if (regcomp_parse == regxend)
1854 /* Grandfather lone [:, [=, [. */
1855 regcomp_parse = posixccs;
1857 regcomp_parse++; /* skip over the posixccc */
1858 if (*regcomp_parse == ']') {
1859 /* Not Implemented Yet.
1860 * (POSIX Extended Character Classes, that is)
1861 * The text between e.g. [: and :] would start
1862 * at posixccs + 1 and stop at regcomp_parse - 2. */
1863 if (dowarn && !SIZE_ONLY)
1864 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1865 regcomp_parse++; /* skip over the ending ] */
1869 if (Class == '\\') {
1870 Class = UCHARAT(regcomp_parse++);
1874 if (regflags & PMf_LOCALE)
1875 *opnd |= ANYOF_ALNUML;
1877 for (Class = 0; Class < 256; Class++)
1879 ANYOF_SET(opnd, Class);
1886 if (regflags & PMf_LOCALE)
1887 *opnd |= ANYOF_NALNUML;
1889 for (Class = 0; Class < 256; Class++)
1890 if (!isALNUM(Class))
1891 ANYOF_SET(opnd, Class);
1898 if (regflags & PMf_LOCALE)
1899 *opnd |= ANYOF_SPACEL;
1901 for (Class = 0; Class < 256; Class++)
1903 ANYOF_SET(opnd, Class);
1910 if (regflags & PMf_LOCALE)
1911 *opnd |= ANYOF_NSPACEL;
1913 for (Class = 0; Class < 256; Class++)
1914 if (!isSPACE(Class))
1915 ANYOF_SET(opnd, Class);
1922 for (Class = '0'; Class <= '9'; Class++)
1923 ANYOF_SET(opnd, Class);
1929 for (Class = 0; Class < '0'; Class++)
1930 ANYOF_SET(opnd, Class);
1931 for (Class = '9' + 1; Class < 256; Class++)
1932 ANYOF_SET(opnd, Class);
1958 Class = scan_hex(regcomp_parse, 2, &numlen);
1959 regcomp_parse += numlen;
1962 Class = UCHARAT(regcomp_parse++);
1963 Class = toCTRL(Class);
1965 case '0': case '1': case '2': case '3': case '4':
1966 case '5': case '6': case '7': case '8': case '9':
1967 Class = scan_oct(--regcomp_parse, 3, &numlen);
1968 regcomp_parse += numlen;
1973 if (lastclass > Class)
1974 FAIL("invalid [] range in regexp");
1979 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
1980 regcomp_parse[1] != ']') {
1983 continue; /* do it next time */
1987 for ( ; lastclass <= Class; lastclass++)
1988 ANYOF_SET(opnd, lastclass);
1992 if (*regcomp_parse != ']')
1993 FAIL("unmatched [] in regexp");
1995 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
1996 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
1997 for (Class = 0; Class < 256; ++Class) {
1998 if (ANYOF_TEST(opnd, Class)) {
1999 I32 cf = fold[Class];
2000 ANYOF_SET(opnd, cf);
2003 *opnd &= ~ANYOF_FOLD;
2005 /* optimize inverted simple patterns (e.g. [^a-z]) */
2006 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2007 for (Class = 0; Class < 32; ++Class)
2008 opnd[1 + Class] ^= 0xFF;
2017 char* retval = regcomp_parse++;
2020 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2021 regcomp_parse[2] == '#') {
2022 while (*regcomp_parse && *regcomp_parse != ')')
2027 if (regflags & PMf_EXTENDED) {
2028 if (isSPACE(*regcomp_parse)) {
2032 else if (*regcomp_parse == '#') {
2033 while (*regcomp_parse && *regcomp_parse != '\n')
2044 - reg_node - emit a node
2046 STATIC regnode * /* Location. */
2049 register regnode *ret;
2050 register regnode *ptr;
2054 SIZE_ALIGN(regsize);
2059 NODE_ALIGN_FILL(ret);
2061 FILL_ADVANCE_NODE(ptr, op);
2068 - reganode - emit a node with an argument
2070 STATIC regnode * /* Location. */
2071 reganode(U8 op, U32 arg)
2073 register regnode *ret;
2074 register regnode *ptr;
2078 SIZE_ALIGN(regsize);
2083 NODE_ALIGN_FILL(ret);
2085 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2092 - regc - emit (if appropriate) a byte of code
2102 - reginsert - insert an operator in front of already-emitted operand
2104 * Means relocating the operand.
2107 reginsert(U8 op, regnode *opnd)
2109 register regnode *src;
2110 register regnode *dst;
2111 register regnode *place;
2112 register int offset = regarglen[(U8)op];
2114 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2117 regsize += NODE_STEP_REGNODE + offset;
2122 regcode += NODE_STEP_REGNODE + offset;
2125 StructCopy(--src, --dst, regnode);
2127 place = opnd; /* Op node, where operand used to be. */
2128 src = NEXTOPER(place);
2129 FILL_ADVANCE_NODE(place, op);
2130 Zero(src, offset, regnode);
2134 - regtail - set the next-pointer at the end of a node chain of p to val.
2137 regtail(regnode *p, regnode *val)
2139 register regnode *scan;
2140 register regnode *temp;
2141 register I32 offset;
2146 /* Find last node. */
2149 temp = regnext(scan);
2155 if (reg_off_by_arg[OP(scan)]) {
2156 ARG_SET(scan, val - scan);
2158 NEXT_OFF(scan) = val - scan;
2163 - regoptail - regtail on operand of first argument; nop if operandless
2166 regoptail(regnode *p, regnode *val)
2168 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2169 if (p == NULL || SIZE_ONLY)
2171 if (regkind[(U8)OP(p)] == BRANCH) {
2172 regtail(NEXTOPER(p), val);
2173 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2174 regtail(NEXTOPER(NEXTOPER(p)), val);
2180 - regcurly - a little FSA that accepts {\d+,?\d*}
2183 regcurly(register char *s)
2202 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2205 register char op = EXACT; /* Arbitrary non-END op. */
2206 register regnode *next, *onode;
2208 while (op != END && (!last || node < last)) {
2209 /* While that wasn't END last time... */
2215 next = regnext(node);
2217 if (OP(node) == OPTIMIZED)
2220 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2221 2*l + 1, "", SvPVX(sv));
2222 if (next == NULL) /* Next ptr. */
2223 PerlIO_printf(Perl_debug_log, "(0)");
2225 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2226 (void)PerlIO_putc(Perl_debug_log, '\n');
2228 if (regkind[(U8)op] == BRANCHJ) {
2229 register regnode *nnode = (OP(next) == LONGJMP
2232 if (last && nnode > last)
2234 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2235 } else if (regkind[(U8)op] == BRANCH) {
2236 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2237 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2238 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2239 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2240 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2241 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2243 } else if ( op == PLUS || op == STAR) {
2244 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2245 } else if (op == ANYOF) {
2246 node = NEXTOPER(node);
2248 } else if (regkind[(U8)op] == EXACT) {
2249 /* Literal string, where present. */
2250 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2251 node = NEXTOPER(node);
2253 node = NEXTOPER(node);
2254 node += regarglen[(U8)op];
2256 if (op == CURLYX || op == OPEN)
2258 else if (op == WHILEM)
2261 #endif /* DEBUGGING */
2266 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2272 SV *sv = sv_newmortal();
2274 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2276 /* Header fields of interest. */
2277 if (r->anchored_substr)
2278 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2280 SvPVX(r->anchored_substr),
2282 SvTAIL(r->anchored_substr) ? "$" : "",
2283 r->anchored_offset);
2284 if (r->float_substr)
2285 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2287 SvPVX(r->float_substr),
2289 SvTAIL(r->float_substr) ? "$" : "",
2290 r->float_min_offset, r->float_max_offset);
2291 if (r->check_substr)
2292 PerlIO_printf(Perl_debug_log,
2293 r->check_substr == r->float_substr
2294 ? "(checking floating" : "(checking anchored");
2295 if (r->reganch & ROPT_NOSCAN)
2296 PerlIO_printf(Perl_debug_log, " noscan");
2297 if (r->reganch & ROPT_CHECK_ALL)
2298 PerlIO_printf(Perl_debug_log, " isall");
2299 if (r->check_substr)
2300 PerlIO_printf(Perl_debug_log, ") ");
2302 if (r->regstclass) {
2303 regprop(sv, r->regstclass);
2304 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2306 if (r->reganch & ROPT_ANCH) {
2307 PerlIO_printf(Perl_debug_log, "anchored");
2308 if (r->reganch & ROPT_ANCH_BOL)
2309 PerlIO_printf(Perl_debug_log, "(BOL)");
2310 if (r->reganch & ROPT_ANCH_MBOL)
2311 PerlIO_printf(Perl_debug_log, "(MBOL)");
2312 if (r->reganch & ROPT_ANCH_GPOS)
2313 PerlIO_printf(Perl_debug_log, "(GPOS)");
2314 PerlIO_putc(Perl_debug_log, ' ');
2316 if (r->reganch & ROPT_GPOS_SEEN)
2317 PerlIO_printf(Perl_debug_log, "GPOS ");
2318 if (r->reganch & ROPT_SKIP)
2319 PerlIO_printf(Perl_debug_log, "plus ");
2320 if (r->reganch & ROPT_IMPLICIT)
2321 PerlIO_printf(Perl_debug_log, "implicit ");
2322 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2323 if (r->reganch & ROPT_EVAL_SEEN)
2324 PerlIO_printf(Perl_debug_log, "with eval ");
2325 PerlIO_printf(Perl_debug_log, "\n");
2326 #endif /* DEBUGGING */
2330 - regprop - printable representation of opcode
2333 regprop(SV *sv, regnode *o)
2336 register char *p = 0;
2374 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2377 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2380 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2407 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2410 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2413 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2416 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2419 sv_catpvf(sv, "REF%d", ARG(o));
2422 sv_catpvf(sv, "REFF%d", ARG(o));
2425 sv_catpvf(sv, "REFFL%d", ARG(o));
2428 sv_catpvf(sv, "OPEN%d", ARG(o));
2431 sv_catpvf(sv, "CLOSE%d", ARG(o));
2447 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2450 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2501 sv_catpvf(sv, "GROUPP%d", ARG(o));
2516 FAIL("corrupted regexp opcode");
2520 #endif /* DEBUGGING */
2524 pregfree(struct regexp *r)
2526 if (!r || (--r->refcnt > 0))
2529 Safefree(r->precomp);
2531 Safefree(r->subbase);
2533 if (r->anchored_substr)
2534 SvREFCNT_dec(r->anchored_substr);
2535 if (r->float_substr)
2536 SvREFCNT_dec(r->float_substr);
2537 Safefree(r->substrs);
2540 int n = r->data->count;
2542 switch (r->data->what[n]) {
2544 SvREFCNT_dec((SV*)r->data->data[n]);
2547 op_free((OP_4tree*)r->data->data[n]);
2552 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2555 Safefree(r->data->what);
2558 Safefree(r->startp);
2564 - regnext - dig the "next" pointer out of a node
2566 * [Note, when REGALIGN is defined there are two places in regmatch()
2567 * that bypass this code for speed.]
2570 regnext(register regnode *p)
2572 register I32 offset;
2577 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2585 re_croak2(const char* pat1,const char* pat2,...)
2588 STRLEN l1 = strlen(pat1);
2589 STRLEN l2 = strlen(pat2);
2597 Copy(pat1, buf, l1 , char);
2598 Copy(pat2, buf + l1, l2 , char);
2599 buf[l1 + l2] = '\n';
2600 buf[l1 + l2 + 1] = '\0';
2601 va_start(args, pat2);
2602 message = mess(buf, &args);
2604 l1 = strlen(message);
2607 Copy(message, buf, l1 , char);
2608 buf[l1] = '\0'; /* Overwrite \n */