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.
22 #ifdef PERL_EXT_RE_BUILD
23 /* need to replace pregcomp et al, so enable that */
24 # ifndef PERL_IN_XSUB_RE
25 # define PERL_IN_XSUB_RE
27 /* need access to debugger hooks */
33 #ifdef PERL_IN_XSUB_RE
34 /* We *really* need to overwrite these symbols: */
35 # define Perl_pregcomp my_regcomp
36 # define Perl_regdump my_regdump
37 # define Perl_regprop my_regprop
38 /* *These* symbols are masked to allow static link. */
39 # define Perl_pregfree my_regfree
40 # define Perl_regnext my_regnext
45 * pregcomp and pregexec -- regsub and regerror are not used in perl
47 * Copyright (c) 1986 by University of Toronto.
48 * Written by Henry Spencer. Not derived from licensed software.
50 * Permission is granted to anyone to use this software for any
51 * purpose on any computer system, and to redistribute it freely,
52 * subject to the following restrictions:
54 * 1. The author is not responsible for the consequences of use of
55 * this software, no matter how awful, even if they arise
58 * 2. The origin of this software must not be misrepresented, either
59 * by explicit claim or by omission.
61 * 3. Altered versions must be plainly marked as such, and must not
62 * be misrepresented as being the original software.
65 **** Alterations to Henry's code are...
67 **** Copyright (c) 1991-1997, Larry Wall
69 **** You may distribute under the terms of either the GNU General Public
70 **** License or the Artistic License, as specified in the README file.
73 * Beware that some of this code is subtly aware of the way operator
74 * precedence is structured in regular expressions. Serious changes in
75 * regular-expression syntax might require a total rethink.
80 #ifndef PERL_IN_XSUB_RE
92 # if defined(BUGGY_MSC6)
93 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
94 # pragma optimize("a",off)
95 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
96 # pragma optimize("w",on )
97 # endif /* BUGGY_MSC6 */
101 #define STATIC static
104 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
105 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
106 ((*s) == '{' && regcurly(s)))
108 #define PERL_META "^$.[()|?+*\\"
110 #define META "^$.[()|?+*\\"
114 #undef SPSTART /* dratted cpp namespace... */
117 * Flags to be passed up and down.
119 #define WORST 0 /* Worst case. */
120 #define HASWIDTH 0x1 /* Known to match non-null strings. */
121 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
122 #define SPSTART 0x4 /* Starts with * or +. */
123 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
126 * Forward declarations for pregcomp()'s friends.
130 static regnode *reg _((I32, I32 *));
131 static regnode *reganode _((U8, U32));
132 static regnode *regatom _((I32 *));
133 static regnode *regbranch _((I32 *, I32));
134 static void regc _((U8, char *));
135 static regnode *regclass _((void));
136 STATIC I32 regcurly _((char *));
137 static regnode *reg_node _((U8));
138 static regnode *regpiece _((I32 *));
139 static void reginsert _((U8, regnode *));
140 static void regoptail _((regnode *, regnode *));
141 static void regtail _((regnode *, regnode *));
142 static char* regwhite _((char *, char *));
143 static char* nextchar _((void));
144 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
147 /* Length of a variant. */
156 I32 last_end; /* min value, <0 unless valid. */
159 SV **longest; /* Either &l_fixed, or &l_float. */
163 I32 offset_float_min;
164 I32 offset_float_max;
169 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
171 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
172 #define SF_BEFORE_SEOL 0x1
173 #define SF_BEFORE_MEOL 0x2
174 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
175 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
178 # define SF_FIX_SHIFT_EOL (0+2)
179 # define SF_FL_SHIFT_EOL (0+4)
181 # define SF_FIX_SHIFT_EOL (+2)
182 # define SF_FL_SHIFT_EOL (+4)
185 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
186 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
188 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
189 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
190 #define SF_IS_INF 0x40
191 #define SF_HAS_PAR 0x80
192 #define SF_IN_PAR 0x100
193 #define SF_HAS_EVAL 0x200
194 #define SCF_DO_SUBSTR 0x400
197 scan_commit(scan_data_t *data)
199 STRLEN l = SvCUR(data->last_found);
200 STRLEN old_l = SvCUR(*data->longest);
202 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
203 sv_setsv(*data->longest, data->last_found);
204 if (*data->longest == data->longest_fixed) {
205 data->offset_fixed = l ? data->last_start_min : data->pos_min;
206 if (data->flags & SF_BEFORE_EOL)
208 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
210 data->flags &= ~SF_FIX_BEFORE_EOL;
212 data->offset_float_min = l ? data->last_start_min : data->pos_min;
213 data->offset_float_max = (l
214 ? data->last_start_max
215 : data->pos_min + data->pos_delta);
216 if (data->flags & SF_BEFORE_EOL)
218 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
220 data->flags &= ~SF_FL_BEFORE_EOL;
223 SvCUR_set(data->last_found, 0);
225 data->flags &= ~SF_BEFORE_EOL;
228 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
229 to the position after last scanned or to NULL. */
232 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
233 /* scanp: Start here (read-write). */
234 /* deltap: Write maxlen-minlen here. */
235 /* last: Stop before this one. */
238 I32 min = 0, pars = 0, code;
239 regnode *scan = *scanp, *next;
241 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
242 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
243 scan_data_t data_fake;
245 while (scan && OP(scan) != END && scan < last) {
246 /* Peephole optimizer: */
248 if (regkind[(U8)OP(scan)] == EXACT) {
249 regnode *n = regnext(scan);
252 regnode *stop = scan;
255 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
256 /* Skip NOTHING, merge EXACT*. */
258 ( regkind[(U8)OP(n)] == NOTHING ||
259 (stringok && (OP(n) == OP(scan))))
261 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
262 if (OP(n) == TAIL || n > next)
264 if (regkind[(U8)OP(n)] == NOTHING) {
265 NEXT_OFF(scan) += NEXT_OFF(n);
266 next = n + NODE_STEP_REGNODE;
273 int oldl = *OPERAND(scan);
274 regnode *nnext = regnext(n);
276 if (oldl + *OPERAND(n) > U8_MAX)
278 NEXT_OFF(scan) += NEXT_OFF(n);
279 *OPERAND(scan) += *OPERAND(n);
280 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
281 /* Now we can overwrite *n : */
282 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
283 *OPERAND(n) + 1, char);
293 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
295 /* Purify reports a benign UMR here sometimes, because we
296 * don't initialize the OP() slot of a node when that node
297 * is occupied by just the trailing null of the string in
299 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
308 if (OP(scan) != CURLYX) {
309 int max = (reg_off_by_arg[OP(scan)]
311 /* I32 may be smaller than U16 on CRAYs! */
312 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
313 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
317 /* Skip NOTHING and LONGJMP. */
318 while ((n = regnext(n))
319 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
320 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
323 if (reg_off_by_arg[OP(scan)])
326 NEXT_OFF(scan) = off;
328 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
329 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
330 next = regnext(scan);
333 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
334 I32 max1 = 0, min1 = I32_MAX, num = 0;
336 if (flags & SCF_DO_SUBSTR)
338 while (OP(scan) == code) {
339 I32 deltanext, minnext;
343 next = regnext(scan);
344 scan = NEXTOPER(scan);
346 scan = NEXTOPER(scan);
347 /* We suppose the run is continuous, last=next...*/
348 minnext = study_chunk(&scan, &deltanext, next,
352 if (max1 < minnext + deltanext)
353 max1 = minnext + deltanext;
354 if (deltanext == I32_MAX)
357 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
359 if (data && (data_fake.flags & SF_HAS_EVAL))
360 data->flags |= SF_HAS_EVAL;
364 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
366 if (flags & SCF_DO_SUBSTR) {
367 data->pos_min += min1;
368 data->pos_delta += max1 - min1;
369 if (max1 != min1 || is_inf)
370 data->longest = &(data->longest_float);
373 delta += max1 - min1;
374 } else if (code == BRANCHJ) /* single branch is optimized. */
375 scan = NEXTOPER(NEXTOPER(scan));
376 else /* single branch is optimized. */
377 scan = NEXTOPER(scan);
379 } else if (OP(scan) == EXACT) {
380 min += *OPERAND(scan);
381 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
382 I32 l = *OPERAND(scan);
384 /* The code below prefers earlier match for fixed
385 offset, later match for variable offset. */
386 if (data->last_end == -1) { /* Update the start info. */
387 data->last_start_min = data->pos_min;
388 data->last_start_max = is_inf
389 ? I32_MAX : data->pos_min + data->pos_delta;
391 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
392 data->last_end = data->pos_min + l;
393 data->pos_min += l; /* As in the first entry. */
394 data->flags &= ~SF_BEFORE_EOL;
396 } else if (regkind[(U8)OP(scan)] == EXACT) {
397 if (flags & SCF_DO_SUBSTR)
399 min += *OPERAND(scan);
400 if (data && (flags & SCF_DO_SUBSTR))
401 data->pos_min += *OPERAND(scan);
402 } else if (strchr(varies,OP(scan))) {
403 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
404 regnode *oscan = scan;
406 switch (regkind[(U8)OP(scan)]) {
408 scan = NEXTOPER(scan);
411 if (flags & SCF_DO_SUBSTR) {
412 next = NEXTOPER(scan);
413 if (OP(next) == EXACT) {
415 maxcount = REG_INFTY;
416 next = regnext(scan);
417 scan = NEXTOPER(scan);
421 if (flags & SCF_DO_SUBSTR)
427 scan = regnext(scan);
428 if (flags & SCF_DO_SUBSTR) {
430 data->longest = &(data->longest_float);
432 goto optimize_curly_tail;
434 mincount = ARG1(scan);
435 maxcount = ARG2(scan);
436 next = regnext(scan);
437 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
439 if (flags & SCF_DO_SUBSTR) {
440 if (mincount == 0) scan_commit(data);
441 pos_before = data->pos_min;
445 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
447 data->flags |= SF_IS_INF;
449 /* This will finish on WHILEM, setting scan, or on NULL: */
450 minnext = study_chunk(&scan, &deltanext, last, data,
452 ? (flags & ~SCF_DO_SUBSTR) : flags);
453 if (!scan) /* It was not CURLYX, but CURLY. */
455 if (PL_dowarn && (minnext + deltanext == 0)
456 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
457 && maxcount <= 10000) /* Complement check for big count */
458 warn("Strange *+?{} on zero-length expression");
459 min += minnext * mincount;
460 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
461 || deltanext == I32_MAX);
462 delta += (minnext + deltanext) * maxcount - minnext * mincount;
464 /* Try powerful optimization CURLYX => CURLYN. */
465 if ( OP(oscan) == CURLYX && data
466 && data->flags & SF_IN_PAR
467 && !(data->flags & SF_HAS_EVAL)
468 && !deltanext && minnext == 1 ) {
469 /* Try to optimize to CURLYN. */
470 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
471 regnode *nxt1 = nxt, *nxt2;
475 if (!strchr(simple,OP(nxt))
476 && !(regkind[(U8)OP(nxt)] == EXACT
477 && *OPERAND(nxt) == 1))
481 if (OP(nxt) != CLOSE)
483 /* Now we know that nxt2 is the only contents: */
484 oscan->flags = ARG(nxt);
486 OP(nxt1) = NOTHING; /* was OPEN. */
488 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
489 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
490 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
491 OP(nxt) = OPTIMIZED; /* was CLOSE. */
492 OP(nxt + 1) = OPTIMIZED; /* was count. */
493 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
498 /* Try optimization CURLYX => CURLYM. */
499 if ( OP(oscan) == CURLYX && data
500 && !(data->flags & SF_HAS_PAR)
501 && !(data->flags & SF_HAS_EVAL)
503 /* XXXX How to optimize if data == 0? */
504 /* Optimize to a simpler form. */
505 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
509 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
510 && (OP(nxt2) != WHILEM))
512 OP(nxt2) = SUCCEED; /* Whas WHILEM */
513 /* Need to optimize away parenths. */
514 if (data->flags & SF_IN_PAR) {
515 /* Set the parenth number. */
516 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
518 if (OP(nxt) != CLOSE)
519 FAIL("panic opt close");
520 oscan->flags = ARG(nxt);
521 OP(nxt1) = OPTIMIZED; /* was OPEN. */
522 OP(nxt) = OPTIMIZED; /* was CLOSE. */
524 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
525 OP(nxt + 1) = OPTIMIZED; /* was count. */
526 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
527 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
530 while ( nxt1 && (OP(nxt1) != WHILEM)) {
531 regnode *nnxt = regnext(nxt1);
534 if (reg_off_by_arg[OP(nxt1)])
535 ARG_SET(nxt1, nxt2 - nxt1);
536 else if (nxt2 - nxt1 < U16_MAX)
537 NEXT_OFF(nxt1) = nxt2 - nxt1;
539 OP(nxt) = NOTHING; /* Cannot beautify */
544 /* Optimize again: */
545 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
549 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
551 if (flags & SCF_DO_SUBSTR) {
552 SV *last_str = Nullsv;
553 int counted = mincount != 0;
555 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
556 I32 b = pos_before >= data->last_start_min
557 ? pos_before : data->last_start_min;
559 char *s = SvPV(data->last_found, l);
561 l -= b - data->last_start_min;
562 /* Get the added string: */
563 last_str = newSVpv(s + b - data->last_start_min, l);
564 if (deltanext == 0 && pos_before == b) {
565 /* What was added is a constant string */
567 SvGROW(last_str, (mincount * l) + 1);
568 repeatcpy(SvPVX(last_str) + l,
569 SvPVX(last_str), l, mincount - 1);
570 SvCUR(last_str) *= mincount;
571 /* Add additional parts. */
572 SvCUR_set(data->last_found,
573 SvCUR(data->last_found) - l);
574 sv_catsv(data->last_found, last_str);
575 data->last_end += l * (mincount - 1);
579 /* It is counted once already... */
580 data->pos_min += minnext * (mincount - counted);
581 data->pos_delta += - counted * deltanext +
582 (minnext + deltanext) * maxcount - minnext * mincount;
583 if (mincount != maxcount) {
585 if (mincount && last_str) {
586 sv_setsv(data->last_found, last_str);
587 data->last_end = data->pos_min;
588 data->last_start_min =
589 data->pos_min - SvCUR(last_str);
590 data->last_start_max = is_inf
592 : data->pos_min + data->pos_delta
595 data->longest = &(data->longest_float);
598 if (data && (fl & SF_HAS_EVAL))
599 data->flags |= SF_HAS_EVAL;
601 if (OP(oscan) != CURLYX) {
602 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
604 NEXT_OFF(oscan) += NEXT_OFF(next);
607 default: /* REF only? */
608 if (flags & SCF_DO_SUBSTR) {
610 data->longest = &(data->longest_float);
615 } else if (strchr(simple,OP(scan))) {
616 if (flags & SCF_DO_SUBSTR) {
621 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
622 data->flags |= (OP(scan) == MEOL
625 } else if (regkind[(U8)OP(scan)] == BRANCHJ
626 && (scan->flags || data)
627 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
628 I32 deltanext, minnext;
632 next = regnext(scan);
633 nscan = NEXTOPER(NEXTOPER(scan));
634 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
637 FAIL("variable length lookbehind not implemented");
638 } else if (minnext > U8_MAX) {
639 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
641 scan->flags = minnext;
643 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
645 if (data && (data_fake.flags & SF_HAS_EVAL))
646 data->flags |= SF_HAS_EVAL;
647 } else if (OP(scan) == OPEN) {
649 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
650 next = regnext(scan);
652 if ( next && (OP(next) != WHILEM) && next < last)
653 is_par = 0; /* Disable optimization */
654 } else if (OP(scan) == EVAL) {
656 data->flags |= SF_HAS_EVAL;
658 /* Else: zero-length, ignore. */
659 scan = regnext(scan);
664 *deltap = is_inf ? I32_MAX : delta;
665 if (flags & SCF_DO_SUBSTR && is_inf)
666 data->pos_delta = I32_MAX - data->pos_min;
669 if (is_par && pars==1 && data) {
670 data->flags |= SF_IN_PAR;
671 data->flags &= ~SF_HAS_PAR;
672 } else if (pars && data) {
673 data->flags |= SF_HAS_PAR;
674 data->flags &= ~SF_IN_PAR;
680 add_data(I32 n, char *s)
683 if (PL_regcomp_rx->data) {
684 Renewc(PL_regcomp_rx->data,
685 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
686 char, struct reg_data);
687 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
688 PL_regcomp_rx->data->count += n;
690 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
691 char, struct reg_data);
692 New(1208, PL_regcomp_rx->data->what, n, U8);
693 PL_regcomp_rx->data->count = n;
695 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
696 return PL_regcomp_rx->data->count - n;
700 - pregcomp - compile a regular expression into internal code
702 * We can't allocate space until we know how big the compiled form will be,
703 * but we can't compile it (and thus know how big it is) until we've got a
704 * place to put the code. So we cheat: we compile it twice, once with code
705 * generation turned off and size counting turned on, and once "for real".
706 * This also means that we don't allocate space until we are sure that the
707 * thing really will compile successfully, and we never have to move the
708 * code and thus invalidate pointers into it. (Note that it has to be in
709 * one piece because free() must be able to free it all.) [NB: not true in perl]
711 * Beware that the optimization-preparation code in here knows about some
712 * of the structure of the compiled regexp. [I'll say.]
715 pregcomp(char *exp, char *xend, PMOP *pm)
730 FAIL("NULL regexp argument");
732 PL_regprecomp = savepvn(exp, xend - exp);
736 char *s = PerlEnv_getenv("PERL_RE_COLORS");
739 PL_colors[0] = s = savepv(s);
756 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling%s RE `%s%*s%s'\n",
757 PL_colors[4],PL_colors[5],PL_colors[0],
758 xend - exp, PL_regprecomp, PL_colors[1]));
759 PL_regflags = pm->op_pmflags;
763 PL_seen_zerolen = *exp == '^' ? -1 : 0;
767 /* First pass: determine size, legality. */
768 PL_regcomp_parse = exp;
773 PL_regcode = &PL_regdummy;
774 regc((U8)MAGIC, (char*)PL_regcode);
775 if (reg(0, &flags) == NULL) {
776 Safefree(PL_regprecomp);
777 PL_regprecomp = Nullch;
780 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
782 /* Small enough for pointer-storage convention?
783 If extralen==0, this means that we will not need long jumps. */
784 if (PL_regsize >= 0x10000L && PL_extralen)
785 PL_regsize += PL_extralen;
789 /* Allocate space and initialize. */
790 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
793 FAIL("regexp out of space");
795 r->prelen = xend - exp;
796 r->precomp = PL_regprecomp;
797 r->subbeg = r->subbase = NULL;
798 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
801 /* Second pass: emit code. */
802 PL_regcomp_parse = exp;
806 PL_regcode = r->program;
807 /* Store the count of eval-groups for security checks: */
808 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
809 regc((U8)MAGIC, (char*) PL_regcode++);
811 if (reg(0, &flags) == NULL)
814 /* Dig out information for optimizations. */
815 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
816 pm->op_pmflags = PL_regflags;
817 r->regstclass = NULL;
818 r->naughty = PL_regnaughty >= 10; /* Probably an expensive pattern. */
819 scan = r->program + 1; /* First BRANCH. */
821 /* XXXX To minimize changes to RE engine we always allocate
822 3-units-long substrs field. */
823 Newz(1004, r->substrs, 1, struct reg_substr_data);
825 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
828 STRLEN longest_float_length, longest_fixed_length;
830 StructCopy(&zero_scan_data, &data, scan_data_t);
832 /* Skip introductions and multiplicators >= 1. */
833 while ((OP(first) == OPEN && (sawopen = 1)) ||
834 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
835 (OP(first) == PLUS) ||
836 (OP(first) == MINMOD) ||
837 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
838 if (OP(first) == PLUS)
841 first += regarglen[(U8)OP(first)];
842 first = NEXTOPER(first);
845 /* Starting-point info. */
847 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
848 else if (strchr(simple+2,OP(first)))
849 r->regstclass = first;
850 else if (regkind[(U8)OP(first)] == BOUND ||
851 regkind[(U8)OP(first)] == NBOUND)
852 r->regstclass = first;
853 else if (regkind[(U8)OP(first)] == BOL) {
854 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
855 first = NEXTOPER(first);
858 else if (OP(first) == GPOS) {
859 r->reganch |= ROPT_ANCH_GPOS;
860 first = NEXTOPER(first);
863 else if ((OP(first) == STAR &&
864 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
865 !(r->reganch & ROPT_ANCH) )
867 /* turn .* into ^.* with an implied $*=1 */
868 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
869 first = NEXTOPER(first);
872 if (sawplus && (!sawopen || !PL_regsawback))
873 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
875 /* Scan is after the zeroth branch, first is atomic matcher. */
876 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
879 * If there's something expensive in the r.e., find the
880 * longest literal string that must appear and make it the
881 * regmust. Resolve ties in favor of later strings, since
882 * the regstart check works with the beginning of the r.e.
883 * and avoiding duplication strengthens checking. Not a
884 * strong reason, but sufficient in the absence of others.
885 * [Now we resolve ties in favor of the earlier string if
886 * it happens that c_offset_min has been invalidated, since the
887 * earlier string may buy us something the later one won't.]
891 data.longest_fixed = newSVpv("",0);
892 data.longest_float = newSVpv("",0);
893 data.last_found = newSVpv("",0);
894 data.longest = &(data.longest_fixed);
897 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
898 &data, SCF_DO_SUBSTR);
899 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
900 && data.last_start_min == 0 && data.last_end > 0
902 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
903 r->reganch |= ROPT_CHECK_ALL;
905 SvREFCNT_dec(data.last_found);
907 longest_float_length = SvCUR(data.longest_float);
908 if (longest_float_length
909 || (data.flags & SF_FL_BEFORE_EOL
910 && (!(data.flags & SF_FL_BEFORE_MEOL)
911 || (PL_regflags & PMf_MULTILINE)))) {
912 if (SvCUR(data.longest_fixed)
913 && data.offset_fixed == data.offset_float_min)
914 goto remove; /* Like in (a)+. */
916 r->float_substr = data.longest_float;
917 r->float_min_offset = data.offset_float_min;
918 r->float_max_offset = data.offset_float_max;
919 fbm_compile(r->float_substr, 0);
920 BmUSEFUL(r->float_substr) = 100;
921 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
922 && (!(data.flags & SF_FL_BEFORE_MEOL)
923 || (PL_regflags & PMf_MULTILINE)))
924 SvTAIL_on(r->float_substr);
927 r->float_substr = Nullsv;
928 SvREFCNT_dec(data.longest_float);
929 longest_float_length = 0;
932 longest_fixed_length = SvCUR(data.longest_fixed);
933 if (longest_fixed_length
934 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
935 && (!(data.flags & SF_FIX_BEFORE_MEOL)
936 || (PL_regflags & PMf_MULTILINE)))) {
937 r->anchored_substr = data.longest_fixed;
938 r->anchored_offset = data.offset_fixed;
939 fbm_compile(r->anchored_substr, 0);
940 BmUSEFUL(r->anchored_substr) = 100;
941 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
942 && (!(data.flags & SF_FIX_BEFORE_MEOL)
943 || (PL_regflags & PMf_MULTILINE)))
944 SvTAIL_on(r->anchored_substr);
946 r->anchored_substr = Nullsv;
947 SvREFCNT_dec(data.longest_fixed);
948 longest_fixed_length = 0;
951 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
952 if (longest_fixed_length > longest_float_length) {
953 r->check_substr = r->anchored_substr;
954 r->check_offset_min = r->check_offset_max = r->anchored_offset;
955 if (r->reganch & ROPT_ANCH_SINGLE)
956 r->reganch |= ROPT_NOSCAN;
958 r->check_substr = r->float_substr;
959 r->check_offset_min = data.offset_float_min;
960 r->check_offset_max = data.offset_float_max;
963 /* Several toplevels. Best we can is to set minlen. */
966 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
967 scan = r->program + 1;
968 minlen = study_chunk(&scan, &fake, scan + PL_regsize, NULL, 0);
969 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
973 if (PL_regseen & REG_SEEN_GPOS)
974 r->reganch |= ROPT_GPOS_SEEN;
975 if (PL_regseen & REG_SEEN_LOOKBEHIND)
976 r->reganch |= ROPT_LOOKBEHIND_SEEN;
977 if (PL_regseen & REG_SEEN_EVAL)
978 r->reganch |= ROPT_EVAL_SEEN;
979 Newz(1002, r->startp, PL_regnpar, char*);
980 Newz(1002, r->endp, PL_regnpar, char*);
986 - reg - regular expression, i.e. main body or parenthesized thing
988 * Caller must absorb opening parenthesis.
990 * Combining parenthesis handling with the base level of regular expression
991 * is a trifle forced, but the need to tie the tails of the branches to what
992 * follows makes it hard to avoid.
995 reg(I32 paren, I32 *flagp)
996 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
999 register regnode *ret; /* Will be the head of the group. */
1000 register regnode *br;
1001 register regnode *lastbr;
1002 register regnode *ender = 0;
1003 register I32 parno = 0;
1004 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1007 *flagp = 0; /* Tentatively. */
1009 /* Make an OPEN node, if parenthesized. */
1011 if (*PL_regcomp_parse == '?') {
1012 U16 posflags = 0, negflags = 0;
1013 U16 *flagsp = &posflags;
1016 paren = *PL_regcomp_parse++;
1017 ret = NULL; /* For look-ahead/behind. */
1020 PL_regseen |= REG_SEEN_LOOKBEHIND;
1021 if (*PL_regcomp_parse == '!')
1023 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1034 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1037 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1039 if (*PL_regcomp_parse != ')')
1040 FAIL("Sequence (?#... not terminated");
1047 I32 count = 1, n = 0;
1049 char *s = PL_regcomp_parse;
1051 OP_4tree *sop, *rop;
1054 PL_regseen |= REG_SEEN_EVAL;
1055 while (count && (c = *PL_regcomp_parse)) {
1056 if (c == '\\' && PL_regcomp_parse[1])
1064 if (*PL_regcomp_parse != ')')
1065 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1069 if (PL_regcomp_parse - 1 - s)
1070 sv = newSVpv(s, PL_regcomp_parse - 1 - s);
1072 sv = newSVpv("", 0);
1074 rop = sv_compile_2op(sv, &sop, "re", &av);
1076 n = add_data(3, "nso");
1077 PL_regcomp_rx->data->data[n] = (void*)rop;
1078 PL_regcomp_rx->data->data[n+1] = (void*)av;
1079 PL_regcomp_rx->data->data[n+2] = (void*)sop;
1081 } else { /* First pass */
1082 if (PL_reginterp_cnt < ++PL_seen_evals && PL_curcop != &PL_compiling)
1083 /* No compiled RE interpolated, has runtime
1084 components ===> unsafe. */
1085 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1087 FAIL("Eval-group in insecure regular expression");
1091 return reganode(EVAL, n);
1095 if (PL_regcomp_parse[0] == '?') {
1096 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1097 || PL_regcomp_parse[1] == '<'
1098 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1101 ret = reg_node(LOGICAL);
1102 regtail(ret, reg(1, &flag));
1105 } else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1106 parno = atoi(PL_regcomp_parse++);
1108 while (isDIGIT(*PL_regcomp_parse))
1110 ret = reganode(GROUPP, parno);
1111 if ((c = *nextchar()) != ')')
1112 FAIL2("Switch (?(number%c not recognized", c);
1114 regtail(ret, reganode(IFTHEN, 0));
1115 br = regbranch(&flags, 1);
1117 br = reganode(LONGJMP, 0);
1119 regtail(br, reganode(LONGJMP, 0));
1122 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1123 regbranch(&flags, 1);
1124 regtail(ret, lastbr);
1129 FAIL("Switch (?(condition)... contains too many branches");
1130 ender = reg_node(TAIL);
1133 regtail(lastbr, ender);
1134 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1136 regtail(ret, ender);
1139 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1143 FAIL("Sequence (? incomplete");
1148 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1149 if (*PL_regcomp_parse != 'o')
1150 pmflag(flagsp, *PL_regcomp_parse);
1153 if (*PL_regcomp_parse == '-') {
1158 PL_regflags |= posflags;
1159 PL_regflags &= ~negflags;
1160 if (*PL_regcomp_parse == ':') {
1166 if (*PL_regcomp_parse != ')')
1167 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1176 ret = reganode(OPEN, parno);
1182 /* Pick up the branches, linking them together. */
1183 br = regbranch(&flags, 1);
1186 if (*PL_regcomp_parse == '|') {
1187 if (!SIZE_ONLY && PL_extralen) {
1188 reginsert(BRANCHJ, br);
1190 reginsert(BRANCH, br);
1193 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1194 } else if (paren == ':') {
1195 *flagp |= flags&SIMPLE;
1197 if (open) { /* Starts with OPEN. */
1198 regtail(ret, br); /* OPEN -> first. */
1199 } else if (paren != '?') /* Not Conditional */
1203 *flagp |= flags&SPSTART;
1205 while (*PL_regcomp_parse == '|') {
1206 if (!SIZE_ONLY && PL_extralen) {
1207 ender = reganode(LONGJMP,0);
1208 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1211 PL_extralen += 2; /* Account for LONGJMP. */
1213 br = regbranch(&flags, 0);
1216 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1220 *flagp |= flags&SPSTART;
1223 if (have_branch || paren != ':') {
1224 /* Make a closing node, and hook it on the end. */
1227 ender = reg_node(TAIL);
1230 ender = reganode(CLOSE, parno);
1236 *flagp &= ~HASWIDTH;
1239 ender = reg_node(SUCCEED);
1242 ender = reg_node(END);
1245 regtail(lastbr, ender);
1248 /* Hook the tails of the branches to the closing node. */
1249 for (br = ret; br != NULL; br = regnext(br)) {
1250 regoptail(br, ender);
1257 static char parens[] = "=!<,>";
1259 if (paren && (p = strchr(parens, paren))) {
1260 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1261 int flag = (p - parens) > 1;
1264 node = SUSPEND, flag = 0;
1265 reginsert(node,ret);
1267 regtail(ret, reg_node(TAIL));
1271 /* Check for proper termination. */
1272 if (paren && (PL_regcomp_parse >= PL_regxend || *nextchar() != ')')) {
1273 FAIL("unmatched () in regexp");
1274 } else if (!paren && PL_regcomp_parse < PL_regxend) {
1275 if (*PL_regcomp_parse == ')') {
1276 FAIL("unmatched () in regexp");
1278 FAIL("junk on end of regexp"); /* "Can't happen". */
1282 PL_regflags = oregflags;
1289 - regbranch - one alternative of an | operator
1291 * Implements the concatenation operator.
1294 regbranch(I32 *flagp, I32 first)
1297 register regnode *ret;
1298 register regnode *chain = NULL;
1299 register regnode *latest;
1300 I32 flags = 0, c = 0;
1305 if (!SIZE_ONLY && PL_extralen)
1306 ret = reganode(BRANCHJ,0);
1308 ret = reg_node(BRANCH);
1311 if (!first && SIZE_ONLY)
1312 PL_extralen += 1; /* BRANCHJ */
1314 *flagp = WORST; /* Tentatively. */
1318 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
1320 latest = regpiece(&flags);
1321 if (latest == NULL) {
1322 if (flags & TRYAGAIN)
1325 } else if (ret == NULL)
1327 *flagp |= flags&HASWIDTH;
1328 if (chain == NULL) /* First piece. */
1329 *flagp |= flags&SPSTART;
1332 regtail(chain, latest);
1337 if (chain == NULL) { /* Loop ran zero times. */
1338 chain = reg_node(NOTHING);
1343 *flagp |= flags&SIMPLE;
1350 - regpiece - something followed by possible [*+?]
1352 * Note that the branching code sequences used for ? and the general cases
1353 * of * and + are somewhat optimized: they use the same NOTHING node as
1354 * both the endmarker for their branch list and the body of the last branch.
1355 * It might seem that this node could be dispensed with entirely, but the
1356 * endmarker role is not redundant.
1359 regpiece(I32 *flagp)
1362 register regnode *ret;
1364 register char *next;
1366 char *origparse = PL_regcomp_parse;
1369 I32 max = REG_INFTY;
1371 ret = regatom(&flags);
1373 if (flags & TRYAGAIN)
1378 op = *PL_regcomp_parse;
1380 if (op == '{' && regcurly(PL_regcomp_parse)) {
1381 next = PL_regcomp_parse + 1;
1383 while (isDIGIT(*next) || *next == ',') {
1392 if (*next == '}') { /* got one */
1396 min = atoi(PL_regcomp_parse);
1400 maxpos = PL_regcomp_parse;
1402 if (!max && *maxpos != '0')
1403 max = REG_INFTY; /* meaning "infinity" */
1404 else if (max >= REG_INFTY)
1405 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1406 PL_regcomp_parse = next;
1410 if ((flags&SIMPLE)) {
1411 PL_regnaughty += 2 + PL_regnaughty / 2;
1412 reginsert(CURLY, ret);
1415 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
1416 regtail(ret, reg_node(WHILEM));
1417 if (!SIZE_ONLY && PL_extralen) {
1418 reginsert(LONGJMP,ret);
1419 reginsert(NOTHING,ret);
1420 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1422 reginsert(CURLYX,ret);
1423 if (!SIZE_ONLY && PL_extralen)
1424 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1425 regtail(ret, reg_node(NOTHING));
1435 if (max && max < min)
1436 FAIL("Can't do {n,m} with n > m");
1451 #if 0 /* Now runtime fix should be reliable. */
1452 if (!(flags&HASWIDTH) && op != '?')
1453 FAIL("regexp *+ operand could be empty");
1458 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1460 if (op == '*' && (flags&SIMPLE)) {
1461 reginsert(STAR, ret);
1465 else if (op == '*') {
1468 } else if (op == '+' && (flags&SIMPLE)) {
1469 reginsert(PLUS, ret);
1473 else if (op == '+') {
1476 } else if (op == '?') {
1481 if (PL_dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1482 warn("%.*s matches null string many times",
1483 PL_regcomp_parse - origparse, origparse);
1486 if (*PL_regcomp_parse == '?') {
1488 reginsert(MINMOD, ret);
1489 regtail(ret, ret + NODE_STEP_REGNODE);
1491 if (ISMULT2(PL_regcomp_parse))
1492 FAIL("nested *?+ in regexp");
1498 - regatom - the lowest level
1500 * Optimization: gobbles an entire sequence of ordinary characters so that
1501 * it can turn them into a single node, which is smaller to store and
1502 * faster to run. Backslashed characters are exceptions, each becoming a
1503 * separate node; the code is simpler that way and it's not worth fixing.
1505 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1511 register regnode *ret = 0;
1514 *flagp = WORST; /* Tentatively. */
1517 switch (*PL_regcomp_parse) {
1521 if (PL_regflags & PMf_MULTILINE)
1522 ret = reg_node(MBOL);
1523 else if (PL_regflags & PMf_SINGLELINE)
1524 ret = reg_node(SBOL);
1526 ret = reg_node(BOL);
1529 if (PL_regcomp_parse[1])
1532 if (PL_regflags & PMf_MULTILINE)
1533 ret = reg_node(MEOL);
1534 else if (PL_regflags & PMf_SINGLELINE)
1535 ret = reg_node(SEOL);
1537 ret = reg_node(EOL);
1541 if (PL_regflags & PMf_SINGLELINE)
1542 ret = reg_node(SANY);
1544 ret = reg_node(ANY);
1546 *flagp |= HASWIDTH|SIMPLE;
1551 *flagp |= HASWIDTH|SIMPLE;
1555 ret = reg(1, &flags);
1557 if (flags & TRYAGAIN)
1561 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1565 if (flags & TRYAGAIN) {
1569 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
1570 /* Supposed to be caught earlier. */
1573 if (!regcurly(PL_regcomp_parse)) {
1581 FAIL("?+*{} follows nothing in regexp");
1584 switch (*++PL_regcomp_parse) {
1587 ret = reg_node(SBOL);
1592 ret = reg_node(GPOS);
1593 PL_regseen |= REG_SEEN_GPOS;
1598 ret = reg_node(SEOL);
1603 ret = reg_node(EOS);
1605 PL_seen_zerolen++; /* Do not optimize RE away */
1609 ret = reg_node((PL_regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1610 *flagp |= HASWIDTH|SIMPLE;
1614 ret = reg_node((PL_regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1615 *flagp |= HASWIDTH|SIMPLE;
1620 ret = reg_node((PL_regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1626 ret = reg_node((PL_regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1631 ret = reg_node((PL_regflags & PMf_LOCALE) ? SPACEL : SPACE);
1632 *flagp |= HASWIDTH|SIMPLE;
1636 ret = reg_node((PL_regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1637 *flagp |= HASWIDTH|SIMPLE;
1641 ret = reg_node(DIGIT);
1642 *flagp |= HASWIDTH|SIMPLE;
1646 ret = reg_node(NDIGIT);
1647 *flagp |= HASWIDTH|SIMPLE;
1660 case '1': case '2': case '3': case '4':
1661 case '5': case '6': case '7': case '8': case '9':
1663 I32 num = atoi(PL_regcomp_parse);
1665 if (num > 9 && num >= PL_regnpar)
1668 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
1669 FAIL("reference to nonexistent group");
1671 ret = reganode((PL_regflags & PMf_FOLD)
1672 ? ((PL_regflags & PMf_LOCALE) ? REFFL : REFF)
1675 while (isDIGIT(*PL_regcomp_parse))
1683 if (PL_regcomp_parse >= PL_regxend)
1684 FAIL("trailing \\ in regexp");
1692 if (PL_regflags & PMf_EXTENDED) {
1693 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1694 if (PL_regcomp_parse < PL_regxend)
1709 ret = reg_node((PL_regflags & PMf_FOLD)
1710 ? ((PL_regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1712 s = (char *) OPERAND(ret);
1713 regc(0, s++); /* save spot for len */
1714 for (len = 0, p = PL_regcomp_parse - 1;
1715 len < 127 && p < PL_regxend;
1720 if (PL_regflags & PMf_EXTENDED)
1721 p = regwhite(p, PL_regxend);
1772 ender = scan_hex(++p, 2, &numlen);
1777 ender = UCHARAT(p++);
1778 ender = toCTRL(ender);
1780 case '0': case '1': case '2': case '3':case '4':
1781 case '5': case '6': case '7': case '8':case '9':
1783 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
1784 ender = scan_oct(p, 3, &numlen);
1793 if (p >= PL_regxend)
1794 FAIL("trailing \\ in regexp");
1805 if (PL_regflags & PMf_EXTENDED)
1806 p = regwhite(p, PL_regxend);
1807 if (ISMULT2(p)) { /* Back off on ?+*. */
1819 PL_regcomp_parse = p - 1;
1822 FAIL("internal disaster in regexp");
1828 *OPERAND(ret) = len;
1831 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1833 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1843 regwhite(char *p, char *e)
1848 else if (*p == '#') {
1851 } while (p < e && *p != '\n');
1863 register char *opnd, *s;
1865 register I32 lastclass = 1234;
1866 register I32 range = 0;
1867 register regnode *ret;
1871 s = opnd = (char *) OPERAND(PL_regcode);
1872 ret = reg_node(ANYOF);
1873 for (Class = 0; Class < 33; Class++)
1875 if (*PL_regcomp_parse == '^') { /* Complement of range. */
1879 *opnd |= ANYOF_INVERT;
1882 PL_regcode += ANY_SKIP;
1883 if (PL_regflags & PMf_FOLD)
1884 *opnd |= ANYOF_FOLD;
1885 if (PL_regflags & PMf_LOCALE)
1886 *opnd |= ANYOF_LOCALE;
1888 PL_regsize += ANY_SKIP;
1890 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
1891 goto skipcond; /* allow 1st char to be ] or - */
1892 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
1894 Class = UCHARAT(PL_regcomp_parse++);
1895 if (Class == '[' && PL_regcomp_parse + 1 < PL_regxend &&
1896 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1897 (*PL_regcomp_parse == ':' || *PL_regcomp_parse == '=' || *PL_regcomp_parse == '.')) {
1898 char posixccc = *PL_regcomp_parse;
1899 char* posixccs = PL_regcomp_parse++;
1901 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != posixccc)
1903 if (PL_regcomp_parse == PL_regxend)
1904 /* Grandfather lone [:, [=, [. */
1905 PL_regcomp_parse = posixccs;
1907 PL_regcomp_parse++; /* skip over the posixccc */
1908 if (*PL_regcomp_parse == ']') {
1909 /* Not Implemented Yet.
1910 * (POSIX Extended Character Classes, that is)
1911 * The text between e.g. [: and :] would start
1912 * at posixccs + 1 and stop at regcomp_parse - 2. */
1913 if (PL_dowarn && !SIZE_ONLY)
1914 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1915 PL_regcomp_parse++; /* skip over the ending ] */
1919 if (Class == '\\') {
1920 Class = UCHARAT(PL_regcomp_parse++);
1924 if (PL_regflags & PMf_LOCALE)
1925 *opnd |= ANYOF_ALNUML;
1927 for (Class = 0; Class < 256; Class++)
1929 ANYOF_SET(opnd, Class);
1936 if (PL_regflags & PMf_LOCALE)
1937 *opnd |= ANYOF_NALNUML;
1939 for (Class = 0; Class < 256; Class++)
1940 if (!isALNUM(Class))
1941 ANYOF_SET(opnd, Class);
1948 if (PL_regflags & PMf_LOCALE)
1949 *opnd |= ANYOF_SPACEL;
1951 for (Class = 0; Class < 256; Class++)
1953 ANYOF_SET(opnd, Class);
1960 if (PL_regflags & PMf_LOCALE)
1961 *opnd |= ANYOF_NSPACEL;
1963 for (Class = 0; Class < 256; Class++)
1964 if (!isSPACE(Class))
1965 ANYOF_SET(opnd, Class);
1972 for (Class = '0'; Class <= '9'; Class++)
1973 ANYOF_SET(opnd, Class);
1979 for (Class = 0; Class < '0'; Class++)
1980 ANYOF_SET(opnd, Class);
1981 for (Class = '9' + 1; Class < 256; Class++)
1982 ANYOF_SET(opnd, Class);
2008 Class = scan_hex(PL_regcomp_parse, 2, &numlen);
2009 PL_regcomp_parse += numlen;
2012 Class = UCHARAT(PL_regcomp_parse++);
2013 Class = toCTRL(Class);
2015 case '0': case '1': case '2': case '3': case '4':
2016 case '5': case '6': case '7': case '8': case '9':
2017 Class = scan_oct(--PL_regcomp_parse, 3, &numlen);
2018 PL_regcomp_parse += numlen;
2023 if (lastclass > Class)
2024 FAIL("invalid [] range in regexp");
2029 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2030 PL_regcomp_parse[1] != ']') {
2033 continue; /* do it next time */
2037 for ( ; lastclass <= Class; lastclass++)
2038 ANYOF_SET(opnd, lastclass);
2042 if (*PL_regcomp_parse != ']')
2043 FAIL("unmatched [] in regexp");
2045 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2046 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2047 for (Class = 0; Class < 256; ++Class) {
2048 if (ANYOF_TEST(opnd, Class)) {
2049 I32 cf = fold[Class];
2050 ANYOF_SET(opnd, cf);
2053 *opnd &= ~ANYOF_FOLD;
2055 /* optimize inverted simple patterns (e.g. [^a-z]) */
2056 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2057 for (Class = 0; Class < 32; ++Class)
2058 opnd[1 + Class] ^= 0xFF;
2068 char* retval = PL_regcomp_parse++;
2071 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2072 PL_regcomp_parse[2] == '#') {
2073 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2078 if (PL_regflags & PMf_EXTENDED) {
2079 if (isSPACE(*PL_regcomp_parse)) {
2083 else if (*PL_regcomp_parse == '#') {
2084 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2095 - reg_node - emit a node
2097 STATIC regnode * /* Location. */
2101 register regnode *ret;
2102 register regnode *ptr;
2106 SIZE_ALIGN(PL_regsize);
2111 NODE_ALIGN_FILL(ret);
2113 FILL_ADVANCE_NODE(ptr, op);
2120 - reganode - emit a node with an argument
2122 STATIC regnode * /* Location. */
2123 reganode(U8 op, U32 arg)
2126 register regnode *ret;
2127 register regnode *ptr;
2131 SIZE_ALIGN(PL_regsize);
2136 NODE_ALIGN_FILL(ret);
2138 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2145 - regc - emit (if appropriate) a byte of code
2156 - reginsert - insert an operator in front of already-emitted operand
2158 * Means relocating the operand.
2161 reginsert(U8 op, regnode *opnd)
2164 register regnode *src;
2165 register regnode *dst;
2166 register regnode *place;
2167 register int offset = regarglen[(U8)op];
2169 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2172 PL_regsize += NODE_STEP_REGNODE + offset;
2177 PL_regcode += NODE_STEP_REGNODE + offset;
2180 StructCopy(--src, --dst, regnode);
2182 place = opnd; /* Op node, where operand used to be. */
2183 src = NEXTOPER(place);
2184 FILL_ADVANCE_NODE(place, op);
2185 Zero(src, offset, regnode);
2189 - regtail - set the next-pointer at the end of a node chain of p to val.
2192 regtail(regnode *p, regnode *val)
2195 register regnode *scan;
2196 register regnode *temp;
2197 register I32 offset;
2202 /* Find last node. */
2205 temp = regnext(scan);
2211 if (reg_off_by_arg[OP(scan)]) {
2212 ARG_SET(scan, val - scan);
2214 NEXT_OFF(scan) = val - scan;
2219 - regoptail - regtail on operand of first argument; nop if operandless
2222 regoptail(regnode *p, regnode *val)
2225 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2226 if (p == NULL || SIZE_ONLY)
2228 if (regkind[(U8)OP(p)] == BRANCH) {
2229 regtail(NEXTOPER(p), val);
2230 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2231 regtail(NEXTOPER(NEXTOPER(p)), val);
2237 - regcurly - a little FSA that accepts {\d+,?\d*}
2240 regcurly(register char *s)
2259 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2262 register char op = EXACT; /* Arbitrary non-END op. */
2263 register regnode *next, *onode;
2265 while (op != END && (!last || node < last)) {
2266 /* While that wasn't END last time... */
2272 next = regnext(node);
2274 if (OP(node) == OPTIMIZED)
2277 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2278 2*l + 1, "", SvPVX(sv));
2279 if (next == NULL) /* Next ptr. */
2280 PerlIO_printf(Perl_debug_log, "(0)");
2282 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2283 (void)PerlIO_putc(Perl_debug_log, '\n');
2285 if (regkind[(U8)op] == BRANCHJ) {
2286 register regnode *nnode = (OP(next) == LONGJMP
2289 if (last && nnode > last)
2291 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2292 } else if (regkind[(U8)op] == BRANCH) {
2293 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2294 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2295 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2296 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2297 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2298 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2300 } else if ( op == PLUS || op == STAR) {
2301 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2302 } else if (op == ANYOF) {
2303 node = NEXTOPER(node);
2305 } else if (regkind[(U8)op] == EXACT) {
2306 /* Literal string, where present. */
2307 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2308 node = NEXTOPER(node);
2310 node = NEXTOPER(node);
2311 node += regarglen[(U8)op];
2313 if (op == CURLYX || op == OPEN)
2315 else if (op == WHILEM)
2318 #endif /* DEBUGGING */
2323 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2330 SV *sv = sv_newmortal();
2332 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2334 /* Header fields of interest. */
2335 if (r->anchored_substr)
2336 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2338 SvPVX(r->anchored_substr),
2340 SvTAIL(r->anchored_substr) ? "$" : "",
2341 r->anchored_offset);
2342 if (r->float_substr)
2343 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2345 SvPVX(r->float_substr),
2347 SvTAIL(r->float_substr) ? "$" : "",
2348 r->float_min_offset, r->float_max_offset);
2349 if (r->check_substr)
2350 PerlIO_printf(Perl_debug_log,
2351 r->check_substr == r->float_substr
2352 ? "(checking floating" : "(checking anchored");
2353 if (r->reganch & ROPT_NOSCAN)
2354 PerlIO_printf(Perl_debug_log, " noscan");
2355 if (r->reganch & ROPT_CHECK_ALL)
2356 PerlIO_printf(Perl_debug_log, " isall");
2357 if (r->check_substr)
2358 PerlIO_printf(Perl_debug_log, ") ");
2360 if (r->regstclass) {
2361 regprop(sv, r->regstclass);
2362 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2364 if (r->reganch & ROPT_ANCH) {
2365 PerlIO_printf(Perl_debug_log, "anchored");
2366 if (r->reganch & ROPT_ANCH_BOL)
2367 PerlIO_printf(Perl_debug_log, "(BOL)");
2368 if (r->reganch & ROPT_ANCH_MBOL)
2369 PerlIO_printf(Perl_debug_log, "(MBOL)");
2370 if (r->reganch & ROPT_ANCH_GPOS)
2371 PerlIO_printf(Perl_debug_log, "(GPOS)");
2372 PerlIO_putc(Perl_debug_log, ' ');
2374 if (r->reganch & ROPT_GPOS_SEEN)
2375 PerlIO_printf(Perl_debug_log, "GPOS ");
2376 if (r->reganch & ROPT_SKIP)
2377 PerlIO_printf(Perl_debug_log, "plus ");
2378 if (r->reganch & ROPT_IMPLICIT)
2379 PerlIO_printf(Perl_debug_log, "implicit ");
2380 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2381 if (r->reganch & ROPT_EVAL_SEEN)
2382 PerlIO_printf(Perl_debug_log, "with eval ");
2383 PerlIO_printf(Perl_debug_log, "\n");
2384 #endif /* DEBUGGING */
2388 - regprop - printable representation of opcode
2391 regprop(SV *sv, regnode *o)
2395 register char *p = 0;
2397 sv_setpvn(sv, "", 0);
2433 sv_catpvf(sv, "EXACT <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2436 sv_catpvf(sv, "EXACTF <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2439 sv_catpvf(sv, "EXACTFL <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2466 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2469 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2472 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2475 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2478 sv_catpvf(sv, "REF%d", ARG(o));
2481 sv_catpvf(sv, "REFF%d", ARG(o));
2484 sv_catpvf(sv, "REFFL%d", ARG(o));
2487 sv_catpvf(sv, "OPEN%d", ARG(o));
2490 sv_catpvf(sv, "CLOSE%d", ARG(o));
2506 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2509 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2560 sv_catpvf(sv, "GROUPP%d", ARG(o));
2575 FAIL("corrupted regexp opcode");
2579 #endif /* DEBUGGING */
2583 pregfree(struct regexp *r)
2586 if (!r || (--r->refcnt > 0))
2589 Safefree(r->precomp);
2591 Safefree(r->subbase);
2593 if (r->anchored_substr)
2594 SvREFCNT_dec(r->anchored_substr);
2595 if (r->float_substr)
2596 SvREFCNT_dec(r->float_substr);
2597 Safefree(r->substrs);
2600 int n = r->data->count;
2602 switch (r->data->what[n]) {
2604 SvREFCNT_dec((SV*)r->data->data[n]);
2607 op_free((OP_4tree*)r->data->data[n]);
2612 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2615 Safefree(r->data->what);
2618 Safefree(r->startp);
2624 - regnext - dig the "next" pointer out of a node
2626 * [Note, when REGALIGN is defined there are two places in regmatch()
2627 * that bypass this code for speed.]
2630 regnext(register regnode *p)
2633 register I32 offset;
2635 if (p == &PL_regdummy)
2638 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2646 re_croak2(const char* pat1,const char* pat2,...)
2649 STRLEN l1 = strlen(pat1);
2650 STRLEN l2 = strlen(pat2);
2658 Copy(pat1, buf, l1 , char);
2659 Copy(pat2, buf + l1, l2 , char);
2660 buf[l1 + l2] = '\n';
2661 buf[l1 + l2 + 1] = '\0';
2662 va_start(args, pat2);
2663 message = mess(buf, &args);
2665 l1 = strlen(message);
2668 Copy(message, buf, l1 , char);
2669 buf[l1] = '\0'; /* Overwrite \n */