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.
23 /* We *really* need to overwrite these symbols: */
24 # define Perl_pregcomp my_regcomp
25 # define Perl_regdump my_regdump
26 # define Perl_regprop my_regprop
27 /* *These* symbols are masked to allow static link. */
28 # define Perl_pregfree my_regfree
29 # define Perl_regnext my_regnext
34 * pregcomp and pregexec -- regsub and regerror are not used in perl
36 * Copyright (c) 1986 by University of Toronto.
37 * Written by Henry Spencer. Not derived from licensed software.
39 * Permission is granted to anyone to use this software for any
40 * purpose on any computer system, and to redistribute it freely,
41 * subject to the following restrictions:
43 * 1. The author is not responsible for the consequences of use of
44 * this software, no matter how awful, even if they arise
47 * 2. The origin of this software must not be misrepresented, either
48 * by explicit claim or by omission.
50 * 3. Altered versions must be plainly marked as such, and must not
51 * be misrepresented as being the original software.
54 **** Alterations to Henry's code are...
56 **** Copyright (c) 1991-1997, Larry Wall
58 **** You may distribute under the terms of either the GNU General Public
59 **** License or the Artistic License, as specified in the README file.
62 * Beware that some of this code is subtly aware of the way operator
63 * precedence is structured in regular expressions. Serious changes in
64 * regular-expression syntax might require a total rethink.
81 # if defined(BUGGY_MSC6)
82 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
83 # pragma optimize("a",off)
84 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
85 # pragma optimize("w",on )
86 # endif /* BUGGY_MSC6 */
93 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
94 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
95 ((*s) == '{' && regcurly(s)))
97 #define PERL_META "^$.[()|?+*\\"
99 #define META "^$.[()|?+*\\"
103 #undef SPSTART /* dratted cpp namespace... */
106 * Flags to be passed up and down.
108 #define WORST 0 /* Worst case. */
109 #define HASWIDTH 0x1 /* Known to match non-null strings. */
110 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
111 #define SPSTART 0x4 /* Starts with * or +. */
112 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
115 * Forward declarations for pregcomp()'s friends.
119 static regnode *reg _((I32, I32 *));
120 static regnode *reganode _((U8, U32));
121 static regnode *regatom _((I32 *));
122 static regnode *regbranch _((I32 *, I32));
123 static void regc _((U8, char *));
124 static regnode *regclass _((void));
125 STATIC I32 regcurly _((char *));
126 static regnode *reg_node _((U8));
127 static regnode *regpiece _((I32 *));
128 static void reginsert _((U8, regnode *));
129 static void regoptail _((regnode *, regnode *));
130 static void regtail _((regnode *, regnode *));
131 static char* regwhite _((char *, char *));
132 static char* nextchar _((void));
133 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
136 /* Length of a variant. */
145 I32 last_end; /* min value, <0 unless valid. */
148 SV **longest; /* Either &l_fixed, or &l_float. */
152 I32 offset_float_min;
153 I32 offset_float_max;
158 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
160 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
161 #define SF_BEFORE_SEOL 0x1
162 #define SF_BEFORE_MEOL 0x2
163 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
164 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
167 # define SF_FIX_SHIFT_EOL (0+2)
168 # define SF_FL_SHIFT_EOL (0+4)
170 # define SF_FIX_SHIFT_EOL (+2)
171 # define SF_FL_SHIFT_EOL (+4)
174 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
175 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
177 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
178 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
179 #define SF_IS_INF 0x40
180 #define SF_HAS_PAR 0x80
181 #define SF_IN_PAR 0x100
182 #define SF_HAS_EVAL 0x200
183 #define SCF_DO_SUBSTR 0x400
186 scan_commit(scan_data_t *data)
188 STRLEN l = SvCUR(data->last_found);
189 STRLEN old_l = SvCUR(*data->longest);
191 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
192 sv_setsv(*data->longest, data->last_found);
193 if (*data->longest == data->longest_fixed) {
194 data->offset_fixed = l ? data->last_start_min : data->pos_min;
195 if (data->flags & SF_BEFORE_EOL)
197 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
199 data->flags &= ~SF_FIX_BEFORE_EOL;
201 data->offset_float_min = l ? data->last_start_min : data->pos_min;
202 data->offset_float_max = (l
203 ? data->last_start_max
204 : data->pos_min + data->pos_delta);
205 if (data->flags & SF_BEFORE_EOL)
207 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
209 data->flags &= ~SF_FL_BEFORE_EOL;
212 SvCUR_set(data->last_found, 0);
214 data->flags &= ~SF_BEFORE_EOL;
217 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
218 to the position after last scanned or to NULL. */
221 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
222 /* scanp: Start here (read-write). */
223 /* deltap: Write maxlen-minlen here. */
224 /* last: Stop before this one. */
227 I32 min = 0, pars = 0, code;
228 regnode *scan = *scanp, *next;
230 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
231 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
232 scan_data_t data_fake;
234 while (scan && OP(scan) != END && scan < last) {
235 /* Peephole optimizer: */
237 if (regkind[(U8)OP(scan)] == EXACT) {
238 regnode *n = regnext(scan);
241 regnode *stop = scan;
244 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
245 /* Skip NOTHING, merge EXACT*. */
247 ( regkind[(U8)OP(n)] == NOTHING ||
248 (stringok && (OP(n) == OP(scan))))
250 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
251 if (OP(n) == TAIL || n > next)
253 if (regkind[(U8)OP(n)] == NOTHING) {
254 NEXT_OFF(scan) += NEXT_OFF(n);
255 next = n + NODE_STEP_REGNODE;
262 int oldl = *OPERAND(scan);
263 regnode *nnext = regnext(n);
265 if (oldl + *OPERAND(n) > U8_MAX)
267 NEXT_OFF(scan) += NEXT_OFF(n);
268 *OPERAND(scan) += *OPERAND(n);
269 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
270 /* Now we can overwrite *n : */
271 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
272 *OPERAND(n) + 1, char);
282 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
284 /* Purify reports a benign UMR here sometimes, because we
285 * don't initialize the OP() slot of a node when that node
286 * is occupied by just the trailing null of the string in
288 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
297 if (OP(scan) != CURLYX) {
298 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
299 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
303 /* Skip NOTHING and LONGJMP. */
304 while ((n = regnext(n))
305 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
306 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
309 if (reg_off_by_arg[OP(scan)])
312 NEXT_OFF(scan) = off;
314 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
315 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
316 next = regnext(scan);
319 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
320 I32 max1 = 0, min1 = I32_MAX, num = 0;
322 if (flags & SCF_DO_SUBSTR)
324 while (OP(scan) == code) {
325 I32 deltanext, minnext;
329 next = regnext(scan);
330 scan = NEXTOPER(scan);
332 scan = NEXTOPER(scan);
333 /* We suppose the run is continuous, last=next...*/
334 minnext = study_chunk(&scan, &deltanext, next,
338 if (max1 < minnext + deltanext)
339 max1 = minnext + deltanext;
340 if (deltanext == I32_MAX)
343 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
345 if (data && (data_fake.flags & SF_HAS_EVAL))
346 data->flags |= SF_HAS_EVAL;
350 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
352 if (flags & SCF_DO_SUBSTR) {
353 data->pos_min += min1;
354 data->pos_delta += max1 - min1;
355 if (max1 != min1 || is_inf)
356 data->longest = &(data->longest_float);
359 delta += max1 - min1;
360 } else if (code == BRANCHJ) /* single branch is optimized. */
361 scan = NEXTOPER(NEXTOPER(scan));
362 else /* single branch is optimized. */
363 scan = NEXTOPER(scan);
365 } else if (OP(scan) == EXACT) {
366 min += *OPERAND(scan);
367 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
368 I32 l = *OPERAND(scan);
370 /* The code below prefers earlier match for fixed
371 offset, later match for variable offset. */
372 if (data->last_end == -1) { /* Update the start info. */
373 data->last_start_min = data->pos_min;
374 data->last_start_max = is_inf
375 ? I32_MAX : data->pos_min + data->pos_delta;
377 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
378 data->last_end = data->pos_min + l;
379 data->pos_min += l; /* As in the first entry. */
380 data->flags &= ~SF_BEFORE_EOL;
382 } else if (regkind[(U8)OP(scan)] == EXACT) {
383 if (flags & SCF_DO_SUBSTR)
385 min += *OPERAND(scan);
386 if (data && (flags & SCF_DO_SUBSTR))
387 data->pos_min += *OPERAND(scan);
388 } else if (strchr(varies,OP(scan))) {
389 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
390 regnode *oscan = scan;
392 switch (regkind[(U8)OP(scan)]) {
394 scan = NEXTOPER(scan);
397 if (flags & SCF_DO_SUBSTR) {
398 next = NEXTOPER(scan);
399 if (OP(next) == EXACT) {
401 maxcount = REG_INFTY;
402 next = regnext(scan);
403 scan = NEXTOPER(scan);
407 if (flags & SCF_DO_SUBSTR)
413 scan = regnext(scan);
414 if (flags & SCF_DO_SUBSTR) {
416 data->longest = &(data->longest_float);
418 goto optimize_curly_tail;
420 mincount = ARG1(scan);
421 maxcount = ARG2(scan);
422 next = regnext(scan);
423 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
425 if (flags & SCF_DO_SUBSTR) {
426 if (mincount == 0) scan_commit(data);
427 pos_before = data->pos_min;
431 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
433 data->flags |= SF_IS_INF;
435 /* This will finish on WHILEM, setting scan, or on NULL: */
436 minnext = study_chunk(&scan, &deltanext, last, data,
438 ? (flags & ~SCF_DO_SUBSTR) : flags);
439 if (!scan) /* It was not CURLYX, but CURLY. */
441 if (dowarn && (minnext + deltanext == 0)
442 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
443 && maxcount <= 10000) /* Complement check for big count */
444 warn("Strange *+?{} on zero-length expression");
445 min += minnext * mincount;
446 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
447 || deltanext == I32_MAX);
448 delta += (minnext + deltanext) * maxcount - minnext * mincount;
450 /* Try powerful optimization CURLYX => CURLYN. */
451 if ( OP(oscan) == CURLYX && data
452 && data->flags & SF_IN_PAR
453 && !(data->flags & SF_HAS_EVAL)
454 && !deltanext && minnext == 1 ) {
455 /* Try to optimize to CURLYN. */
456 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
457 regnode *nxt1 = nxt, *nxt2;
461 if (!strchr(simple,OP(nxt))
462 && !(regkind[(U8)OP(nxt)] == EXACT
463 && *OPERAND(nxt) == 1))
467 if (OP(nxt) != CLOSE)
469 /* Now we know that nxt2 is the only contents: */
470 oscan->flags = ARG(nxt);
472 OP(nxt1) = NOTHING; /* was OPEN. */
474 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
475 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
476 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
477 OP(nxt) = OPTIMIZED; /* was CLOSE. */
478 OP(nxt + 1) = OPTIMIZED; /* was count. */
479 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
484 /* Try optimization CURLYX => CURLYM. */
485 if ( OP(oscan) == CURLYX && data
486 && !(data->flags & SF_HAS_PAR)
487 && !(data->flags & SF_HAS_EVAL)
489 /* XXXX How to optimize if data == 0? */
490 /* Optimize to a simpler form. */
491 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
495 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
496 && (OP(nxt2) != WHILEM))
498 OP(nxt2) = SUCCEED; /* Whas WHILEM */
499 /* Need to optimize away parenths. */
500 if (data->flags & SF_IN_PAR) {
501 /* Set the parenth number. */
502 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
504 if (OP(nxt) != CLOSE)
505 FAIL("panic opt close");
506 oscan->flags = ARG(nxt);
507 OP(nxt1) = OPTIMIZED; /* was OPEN. */
508 OP(nxt) = OPTIMIZED; /* was CLOSE. */
510 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
511 OP(nxt + 1) = OPTIMIZED; /* was count. */
512 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
513 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
516 while ( nxt1 && (OP(nxt1) != WHILEM)) {
517 regnode *nnxt = regnext(nxt1);
520 if (reg_off_by_arg[OP(nxt1)])
521 ARG_SET(nxt1, nxt2 - nxt1);
522 else if (nxt2 - nxt1 < U16_MAX)
523 NEXT_OFF(nxt1) = nxt2 - nxt1;
525 OP(nxt) = NOTHING; /* Cannot beautify */
530 /* Optimize again: */
531 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
535 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
537 if (flags & SCF_DO_SUBSTR) {
538 SV *last_str = Nullsv;
539 int counted = mincount != 0;
541 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
542 I32 b = pos_before >= data->last_start_min
543 ? pos_before : data->last_start_min;
545 char *s = SvPV(data->last_found, l);
547 l -= b - data->last_start_min;
548 /* Get the added string: */
549 last_str = newSVpv(s + b - data->last_start_min, l);
550 if (deltanext == 0 && pos_before == b) {
551 /* What was added is a constant string */
553 SvGROW(last_str, (mincount * l) + 1);
554 repeatcpy(SvPVX(last_str) + l,
555 SvPVX(last_str), l, mincount - 1);
556 SvCUR(last_str) *= mincount;
557 /* Add additional parts. */
558 SvCUR_set(data->last_found,
559 SvCUR(data->last_found) - l);
560 sv_catsv(data->last_found, last_str);
561 data->last_end += l * (mincount - 1);
565 /* It is counted once already... */
566 data->pos_min += minnext * (mincount - counted);
567 data->pos_delta += - counted * deltanext +
568 (minnext + deltanext) * maxcount - minnext * mincount;
569 if (mincount != maxcount) {
571 if (mincount && last_str) {
572 sv_setsv(data->last_found, last_str);
573 data->last_end = data->pos_min;
574 data->last_start_min =
575 data->pos_min - SvCUR(last_str);
576 data->last_start_max = is_inf
578 : data->pos_min + data->pos_delta
581 data->longest = &(data->longest_float);
584 if (data && (fl & SF_HAS_EVAL))
585 data->flags |= SF_HAS_EVAL;
587 if (OP(oscan) != CURLYX) {
588 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
590 NEXT_OFF(oscan) += NEXT_OFF(next);
593 default: /* REF only? */
594 if (flags & SCF_DO_SUBSTR) {
596 data->longest = &(data->longest_float);
601 } else if (strchr(simple,OP(scan))) {
602 if (flags & SCF_DO_SUBSTR) {
607 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
608 data->flags |= (OP(scan) == MEOL
611 } else if (regkind[(U8)OP(scan)] == BRANCHJ
612 && (scan->flags || data)
613 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
614 I32 deltanext, minnext;
618 next = regnext(scan);
619 nscan = NEXTOPER(NEXTOPER(scan));
620 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
623 FAIL("variable length lookbehind not implemented");
624 } else if (minnext > U8_MAX) {
625 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
627 scan->flags = minnext;
629 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
631 if (data && (data_fake.flags & SF_HAS_EVAL))
632 data->flags |= SF_HAS_EVAL;
633 } else if (OP(scan) == OPEN) {
635 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
636 next = regnext(scan);
638 if ( next && (OP(next) != WHILEM) && next < last)
639 is_par = 0; /* Disable optimization */
640 } else if (OP(scan) == EVAL) {
642 data->flags |= SF_HAS_EVAL;
644 /* Else: zero-length, ignore. */
645 scan = regnext(scan);
650 *deltap = is_inf ? I32_MAX : delta;
651 if (flags & SCF_DO_SUBSTR && is_inf)
652 data->pos_delta = I32_MAX - data->pos_min;
655 if (is_par && pars==1 && data) {
656 data->flags |= SF_IN_PAR;
657 data->flags &= ~SF_HAS_PAR;
658 } else if (pars && data) {
659 data->flags |= SF_HAS_PAR;
660 data->flags &= ~SF_IN_PAR;
666 add_data(I32 n, char *s)
669 if (regcomp_rx->data) {
670 Renewc(regcomp_rx->data,
671 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
672 char, struct reg_data);
673 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
674 regcomp_rx->data->count += n;
676 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
677 char, struct reg_data);
678 New(1208, regcomp_rx->data->what, n, U8);
679 regcomp_rx->data->count = n;
681 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
682 return regcomp_rx->data->count - n;
686 - pregcomp - compile a regular expression into internal code
688 * We can't allocate space until we know how big the compiled form will be,
689 * but we can't compile it (and thus know how big it is) until we've got a
690 * place to put the code. So we cheat: we compile it twice, once with code
691 * generation turned off and size counting turned on, and once "for real".
692 * This also means that we don't allocate space until we are sure that the
693 * thing really will compile successfully, and we never have to move the
694 * code and thus invalidate pointers into it. (Note that it has to be in
695 * one piece because free() must be able to free it all.) [NB: not true in perl]
697 * Beware that the optimization-preparation code in here knows about some
698 * of the structure of the compiled regexp. [I'll say.]
701 pregcomp(char *exp, char *xend, PMOP *pm)
716 FAIL("NULL regexp argument");
718 regprecomp = savepvn(exp, xend - exp);
719 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
720 xend - exp, regprecomp));
721 regflags = pm->op_pmflags;
725 seen_zerolen = *exp == '^' ? -1 : 0;
729 /* First pass: determine size, legality. */
736 regc((U8)MAGIC, (char*)regcode);
737 if (reg(0, &flags) == NULL) {
738 Safefree(regprecomp);
742 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
747 char *s = PerlEnv_getenv("TERMCAP_COLORS");
751 colors[0] = s = savepv(s);
755 FAIL("Not enough TABs in TERMCAP_COLORS");
764 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
765 colors[0],colors[1],colors[2],colors[3]);
769 /* Small enough for pointer-storage convention?
770 If extralen==0, this means that we will not need long jumps. */
771 if (regsize >= 0x10000L && extralen)
776 /* Allocate space and initialize. */
777 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
780 FAIL("regexp out of space");
782 r->prelen = xend - exp;
783 r->precomp = regprecomp;
784 r->subbeg = r->subbase = NULL;
785 r->nparens = regnpar - 1; /* set early to validate backrefs */
788 /* Second pass: emit code. */
793 regcode = r->program;
794 /* Store the count of eval-groups for security checks: */
795 regcode->next_off = ((seen_evals > U16_MAX) ? U16_MAX : seen_evals);
796 regc((U8)MAGIC, (char*) regcode++);
798 if (reg(0, &flags) == NULL)
801 /* Dig out information for optimizations. */
802 pm->op_pmflags = regflags;
804 r->regstclass = NULL;
805 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
806 scan = r->program + 1; /* First BRANCH. */
808 /* XXXX To minimize changes to RE engine we always allocate
809 3-units-long substrs field. */
810 Newz(1004, r->substrs, 1, struct reg_substr_data);
812 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
815 STRLEN longest_float_length, longest_fixed_length;
817 StructCopy(&zero_scan_data, &data, scan_data_t);
819 /* Skip introductions and multiplicators >= 1. */
820 while ((OP(first) == OPEN && (sawopen = 1)) ||
821 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
822 (OP(first) == PLUS) ||
823 (OP(first) == MINMOD) ||
824 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
825 if (OP(first) == PLUS)
828 first += regarglen[(U8)OP(first)];
829 first = NEXTOPER(first);
832 /* Starting-point info. */
834 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
835 else if (strchr(simple+2,OP(first)))
836 r->regstclass = first;
837 else if (regkind[(U8)OP(first)] == BOUND ||
838 regkind[(U8)OP(first)] == NBOUND)
839 r->regstclass = first;
840 else if (regkind[(U8)OP(first)] == BOL) {
841 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
842 first = NEXTOPER(first);
845 else if (OP(first) == GPOS) {
846 r->reganch |= ROPT_ANCH_GPOS;
847 first = NEXTOPER(first);
850 else if ((OP(first) == STAR &&
851 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
852 !(r->reganch & ROPT_ANCH) )
854 /* turn .* into ^.* with an implied $*=1 */
855 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
856 first = NEXTOPER(first);
859 if (sawplus && (!sawopen || !regsawback))
860 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
862 /* Scan is after the zeroth branch, first is atomic matcher. */
863 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
866 * If there's something expensive in the r.e., find the
867 * longest literal string that must appear and make it the
868 * regmust. Resolve ties in favor of later strings, since
869 * the regstart check works with the beginning of the r.e.
870 * and avoiding duplication strengthens checking. Not a
871 * strong reason, but sufficient in the absence of others.
872 * [Now we resolve ties in favor of the earlier string if
873 * it happens that c_offset_min has been invalidated, since the
874 * earlier string may buy us something the later one won't.]
878 data.longest_fixed = newSVpv("",0);
879 data.longest_float = newSVpv("",0);
880 data.last_found = newSVpv("",0);
881 data.longest = &(data.longest_fixed);
884 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
885 &data, SCF_DO_SUBSTR);
886 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
887 && data.last_start_min == 0 && data.last_end > 0
889 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
890 r->reganch |= ROPT_CHECK_ALL;
892 SvREFCNT_dec(data.last_found);
894 longest_float_length = SvCUR(data.longest_float);
895 if (longest_float_length
896 || (data.flags & SF_FL_BEFORE_EOL
897 && (!(data.flags & SF_FL_BEFORE_MEOL)
898 || (regflags & PMf_MULTILINE)))) {
899 if (SvCUR(data.longest_fixed)
900 && data.offset_fixed == data.offset_float_min)
901 goto remove; /* Like in (a)+. */
903 r->float_substr = data.longest_float;
904 r->float_min_offset = data.offset_float_min;
905 r->float_max_offset = data.offset_float_max;
906 fbm_compile(r->float_substr, 0);
907 BmUSEFUL(r->float_substr) = 100;
908 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
909 && (!(data.flags & SF_FL_BEFORE_MEOL)
910 || (regflags & PMf_MULTILINE)))
911 SvTAIL_on(r->float_substr);
914 r->float_substr = Nullsv;
915 SvREFCNT_dec(data.longest_float);
916 longest_float_length = 0;
919 longest_fixed_length = SvCUR(data.longest_fixed);
920 if (longest_fixed_length
921 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
922 && (!(data.flags & SF_FIX_BEFORE_MEOL)
923 || (regflags & PMf_MULTILINE)))) {
924 r->anchored_substr = data.longest_fixed;
925 r->anchored_offset = data.offset_fixed;
926 fbm_compile(r->anchored_substr, 0);
927 BmUSEFUL(r->anchored_substr) = 100;
928 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
929 && (!(data.flags & SF_FIX_BEFORE_MEOL)
930 || (regflags & PMf_MULTILINE)))
931 SvTAIL_on(r->anchored_substr);
933 r->anchored_substr = Nullsv;
934 SvREFCNT_dec(data.longest_fixed);
935 longest_fixed_length = 0;
938 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
939 if (longest_fixed_length > longest_float_length) {
940 r->check_substr = r->anchored_substr;
941 r->check_offset_min = r->check_offset_max = r->anchored_offset;
942 if (r->reganch & ROPT_ANCH_SINGLE)
943 r->reganch |= ROPT_NOSCAN;
945 r->check_substr = r->float_substr;
946 r->check_offset_min = data.offset_float_min;
947 r->check_offset_max = data.offset_float_max;
950 /* Several toplevels. Best we can is to set minlen. */
953 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
954 scan = r->program + 1;
955 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
956 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
960 if (regseen & REG_SEEN_GPOS)
961 r->reganch |= ROPT_GPOS_SEEN;
962 if (regseen & REG_SEEN_LOOKBEHIND)
963 r->reganch |= ROPT_LOOKBEHIND_SEEN;
964 if (regseen & REG_SEEN_EVAL)
965 r->reganch |= ROPT_EVAL_SEEN;
966 Newz(1002, r->startp, regnpar, char*);
967 Newz(1002, r->endp, regnpar, char*);
973 - reg - regular expression, i.e. main body or parenthesized thing
975 * Caller must absorb opening parenthesis.
977 * Combining parenthesis handling with the base level of regular expression
978 * is a trifle forced, but the need to tie the tails of the branches to what
979 * follows makes it hard to avoid.
982 reg(I32 paren, I32 *flagp)
983 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
986 register regnode *ret; /* Will be the head of the group. */
987 register regnode *br;
988 register regnode *lastbr;
989 register regnode *ender = 0;
990 register I32 parno = 0;
991 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
994 *flagp = 0; /* Tentatively. */
996 /* Make an OPEN node, if parenthesized. */
998 if (*regcomp_parse == '?') {
999 U16 posflags = 0, negflags = 0;
1000 U16 *flagsp = &posflags;
1003 paren = *regcomp_parse++;
1004 ret = NULL; /* For look-ahead/behind. */
1007 regseen |= REG_SEEN_LOOKBEHIND;
1008 if (*regcomp_parse == '!')
1010 if (*regcomp_parse != '=' && *regcomp_parse != '!')
1021 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1024 while (*regcomp_parse && *regcomp_parse != ')')
1026 if (*regcomp_parse != ')')
1027 FAIL("Sequence (?#... not terminated");
1034 I32 count = 1, n = 0;
1036 char *s = regcomp_parse;
1038 OP_4tree *sop, *rop;
1041 regseen |= REG_SEEN_EVAL;
1042 while (count && (c = *regcomp_parse)) {
1043 if (c == '\\' && regcomp_parse[1])
1051 if (*regcomp_parse != ')')
1052 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1056 if (regcomp_parse - 1 - s)
1057 sv = newSVpv(s, regcomp_parse - 1 - s);
1059 sv = newSVpv("", 0);
1061 rop = sv_compile_2op(sv, &sop, "re", &av);
1063 n = add_data(3, "nso");
1064 regcomp_rx->data->data[n] = (void*)rop;
1065 regcomp_rx->data->data[n+1] = (void*)av;
1066 regcomp_rx->data->data[n+2] = (void*)sop;
1068 } else { /* First pass */
1069 if (reginterp_cnt < ++seen_evals && curcop != &compiling)
1070 /* No compiled RE interpolated, has runtime
1071 components ===> unsafe. */
1072 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1074 FAIL("Eval-group in insecure regular expression");
1078 return reganode(EVAL, n);
1082 if (regcomp_parse[0] == '?') {
1083 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1084 || regcomp_parse[1] == '<'
1085 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1088 ret = reg_node(LOGICAL);
1089 regtail(ret, reg(1, &flag));
1092 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1093 parno = atoi(regcomp_parse++);
1095 while (isDIGIT(*regcomp_parse))
1097 ret = reganode(GROUPP, parno);
1098 if ((c = *nextchar()) != ')')
1099 FAIL2("Switch (?(number%c not recognized", c);
1101 regtail(ret, reganode(IFTHEN, 0));
1102 br = regbranch(&flags, 1);
1104 br = reganode(LONGJMP, 0);
1106 regtail(br, reganode(LONGJMP, 0));
1109 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1110 regbranch(&flags, 1);
1111 regtail(ret, lastbr);
1116 FAIL("Switch (?(condition)... contains too many branches");
1117 ender = reg_node(TAIL);
1120 regtail(lastbr, ender);
1121 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1123 regtail(ret, ender);
1126 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1130 FAIL("Sequence (? incomplete");
1135 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1136 if (*regcomp_parse != 'o')
1137 pmflag(flagsp, *regcomp_parse);
1140 if (*regcomp_parse == '-') {
1145 regflags |= posflags;
1146 regflags &= ~negflags;
1147 if (*regcomp_parse == ':') {
1153 if (*regcomp_parse != ')')
1154 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1163 ret = reganode(OPEN, parno);
1169 /* Pick up the branches, linking them together. */
1170 br = regbranch(&flags, 1);
1173 if (*regcomp_parse == '|') {
1174 if (!SIZE_ONLY && extralen) {
1175 reginsert(BRANCHJ, br);
1177 reginsert(BRANCH, br);
1180 extralen += 1; /* For BRANCHJ-BRANCH. */
1181 } else if (paren == ':') {
1182 *flagp |= flags&SIMPLE;
1184 if (open) { /* Starts with OPEN. */
1185 regtail(ret, br); /* OPEN -> first. */
1186 } else if (paren != '?') /* Not Conditional */
1190 *flagp |= flags&SPSTART;
1192 while (*regcomp_parse == '|') {
1193 if (!SIZE_ONLY && extralen) {
1194 ender = reganode(LONGJMP,0);
1195 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1198 extralen += 2; /* Account for LONGJMP. */
1200 br = regbranch(&flags, 0);
1203 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1207 *flagp |= flags&SPSTART;
1210 if (have_branch || paren != ':') {
1211 /* Make a closing node, and hook it on the end. */
1214 ender = reg_node(TAIL);
1217 ender = reganode(CLOSE, parno);
1223 *flagp &= ~HASWIDTH;
1226 ender = reg_node(SUCCEED);
1229 ender = reg_node(END);
1232 regtail(lastbr, ender);
1235 /* Hook the tails of the branches to the closing node. */
1236 for (br = ret; br != NULL; br = regnext(br)) {
1237 regoptail(br, ender);
1244 static char parens[] = "=!<,>";
1246 if (paren && (p = strchr(parens, paren))) {
1247 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1248 int flag = (p - parens) > 1;
1251 node = SUSPEND, flag = 0;
1252 reginsert(node,ret);
1254 regtail(ret, reg_node(TAIL));
1258 /* Check for proper termination. */
1259 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1260 FAIL("unmatched () in regexp");
1261 } else if (!paren && regcomp_parse < regxend) {
1262 if (*regcomp_parse == ')') {
1263 FAIL("unmatched () in regexp");
1265 FAIL("junk on end of regexp"); /* "Can't happen". */
1269 regflags = oregflags;
1276 - regbranch - one alternative of an | operator
1278 * Implements the concatenation operator.
1281 regbranch(I32 *flagp, I32 first)
1284 register regnode *ret;
1285 register regnode *chain = NULL;
1286 register regnode *latest;
1287 I32 flags = 0, c = 0;
1292 if (!SIZE_ONLY && extralen)
1293 ret = reganode(BRANCHJ,0);
1295 ret = reg_node(BRANCH);
1298 if (!first && SIZE_ONLY)
1299 extralen += 1; /* BRANCHJ */
1301 *flagp = WORST; /* Tentatively. */
1305 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1307 latest = regpiece(&flags);
1308 if (latest == NULL) {
1309 if (flags & TRYAGAIN)
1312 } else if (ret == NULL)
1314 *flagp |= flags&HASWIDTH;
1315 if (chain == NULL) /* First piece. */
1316 *flagp |= flags&SPSTART;
1319 regtail(chain, latest);
1324 if (chain == NULL) { /* Loop ran zero times. */
1325 chain = reg_node(NOTHING);
1330 *flagp |= flags&SIMPLE;
1337 - regpiece - something followed by possible [*+?]
1339 * Note that the branching code sequences used for ? and the general cases
1340 * of * and + are somewhat optimized: they use the same NOTHING node as
1341 * both the endmarker for their branch list and the body of the last branch.
1342 * It might seem that this node could be dispensed with entirely, but the
1343 * endmarker role is not redundant.
1346 regpiece(I32 *flagp)
1349 register regnode *ret;
1351 register char *next;
1353 char *origparse = regcomp_parse;
1356 I32 max = REG_INFTY;
1358 ret = regatom(&flags);
1360 if (flags & TRYAGAIN)
1365 op = *regcomp_parse;
1367 if (op == '{' && regcurly(regcomp_parse)) {
1368 next = regcomp_parse + 1;
1370 while (isDIGIT(*next) || *next == ',') {
1379 if (*next == '}') { /* got one */
1383 min = atoi(regcomp_parse);
1387 maxpos = regcomp_parse;
1389 if (!max && *maxpos != '0')
1390 max = REG_INFTY; /* meaning "infinity" */
1391 else if (max >= REG_INFTY)
1392 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1393 regcomp_parse = next;
1397 if ((flags&SIMPLE)) {
1398 regnaughty += 2 + regnaughty / 2;
1399 reginsert(CURLY, ret);
1402 regnaughty += 4 + regnaughty; /* compound interest */
1403 regtail(ret, reg_node(WHILEM));
1404 if (!SIZE_ONLY && extralen) {
1405 reginsert(LONGJMP,ret);
1406 reginsert(NOTHING,ret);
1407 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1409 reginsert(CURLYX,ret);
1410 if (!SIZE_ONLY && extralen)
1411 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1412 regtail(ret, reg_node(NOTHING));
1422 if (max && max < min)
1423 FAIL("Can't do {n,m} with n > m");
1438 #if 0 /* Now runtime fix should be reliable. */
1439 if (!(flags&HASWIDTH) && op != '?')
1440 FAIL("regexp *+ operand could be empty");
1445 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1447 if (op == '*' && (flags&SIMPLE)) {
1448 reginsert(STAR, ret);
1452 else if (op == '*') {
1455 } else if (op == '+' && (flags&SIMPLE)) {
1456 reginsert(PLUS, ret);
1460 else if (op == '+') {
1463 } else if (op == '?') {
1468 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1469 warn("%.*s matches null string many times",
1470 regcomp_parse - origparse, origparse);
1473 if (*regcomp_parse == '?') {
1475 reginsert(MINMOD, ret);
1476 regtail(ret, ret + NODE_STEP_REGNODE);
1478 if (ISMULT2(regcomp_parse))
1479 FAIL("nested *?+ in regexp");
1485 - regatom - the lowest level
1487 * Optimization: gobbles an entire sequence of ordinary characters so that
1488 * it can turn them into a single node, which is smaller to store and
1489 * faster to run. Backslashed characters are exceptions, each becoming a
1490 * separate node; the code is simpler that way and it's not worth fixing.
1492 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1498 register regnode *ret = 0;
1501 *flagp = WORST; /* Tentatively. */
1504 switch (*regcomp_parse) {
1508 if (regflags & PMf_MULTILINE)
1509 ret = reg_node(MBOL);
1510 else if (regflags & PMf_SINGLELINE)
1511 ret = reg_node(SBOL);
1513 ret = reg_node(BOL);
1516 if (regcomp_parse[1])
1519 if (regflags & PMf_MULTILINE)
1520 ret = reg_node(MEOL);
1521 else if (regflags & PMf_SINGLELINE)
1522 ret = reg_node(SEOL);
1524 ret = reg_node(EOL);
1528 if (regflags & PMf_SINGLELINE)
1529 ret = reg_node(SANY);
1531 ret = reg_node(ANY);
1533 *flagp |= HASWIDTH|SIMPLE;
1538 *flagp |= HASWIDTH|SIMPLE;
1542 ret = reg(1, &flags);
1544 if (flags & TRYAGAIN)
1548 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1552 if (flags & TRYAGAIN) {
1556 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1557 /* Supposed to be caught earlier. */
1560 if (!regcurly(regcomp_parse)) {
1568 FAIL("?+*{} follows nothing in regexp");
1571 switch (*++regcomp_parse) {
1574 ret = reg_node(SBOL);
1579 ret = reg_node(GPOS);
1580 regseen |= REG_SEEN_GPOS;
1585 ret = reg_node(SEOL);
1590 ret = reg_node(EOS);
1592 seen_zerolen++; /* Do not optimize RE away */
1596 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1597 *flagp |= HASWIDTH|SIMPLE;
1601 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1602 *flagp |= HASWIDTH|SIMPLE;
1607 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1613 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1618 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1619 *flagp |= HASWIDTH|SIMPLE;
1623 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1624 *flagp |= HASWIDTH|SIMPLE;
1628 ret = reg_node(DIGIT);
1629 *flagp |= HASWIDTH|SIMPLE;
1633 ret = reg_node(NDIGIT);
1634 *flagp |= HASWIDTH|SIMPLE;
1647 case '1': case '2': case '3': case '4':
1648 case '5': case '6': case '7': case '8': case '9':
1650 I32 num = atoi(regcomp_parse);
1652 if (num > 9 && num >= regnpar)
1655 if (!SIZE_ONLY && num > regcomp_rx->nparens)
1656 FAIL("reference to nonexistent group");
1658 ret = reganode((regflags & PMf_FOLD)
1659 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1662 while (isDIGIT(*regcomp_parse))
1670 if (regcomp_parse >= regxend)
1671 FAIL("trailing \\ in regexp");
1679 if (regflags & PMf_EXTENDED) {
1680 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1681 if (regcomp_parse < regxend)
1696 ret = reg_node((regflags & PMf_FOLD)
1697 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1699 s = (char *) OPERAND(ret);
1700 regc(0, s++); /* save spot for len */
1701 for (len = 0, p = regcomp_parse - 1;
1702 len < 127 && p < regxend;
1707 if (regflags & PMf_EXTENDED)
1708 p = regwhite(p, regxend);
1759 ender = scan_hex(++p, 2, &numlen);
1764 ender = UCHARAT(p++);
1765 ender = toCTRL(ender);
1767 case '0': case '1': case '2': case '3':case '4':
1768 case '5': case '6': case '7': case '8':case '9':
1770 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1771 ender = scan_oct(p, 3, &numlen);
1781 FAIL("trailing \\ in regexp");
1792 if (regflags & PMf_EXTENDED)
1793 p = regwhite(p, regxend);
1794 if (ISMULT2(p)) { /* Back off on ?+*. */
1806 regcomp_parse = p - 1;
1809 FAIL("internal disaster in regexp");
1815 *OPERAND(ret) = len;
1818 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1820 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1830 regwhite(char *p, char *e)
1835 else if (*p == '#') {
1838 } while (p < e && *p != '\n');
1850 register char *opnd, *s;
1852 register I32 lastclass = 1234;
1853 register I32 range = 0;
1854 register regnode *ret;
1858 s = opnd = (char *) OPERAND(regcode);
1859 ret = reg_node(ANYOF);
1860 for (Class = 0; Class < 33; Class++)
1862 if (*regcomp_parse == '^') { /* Complement of range. */
1866 *opnd |= ANYOF_INVERT;
1869 regcode += ANY_SKIP;
1870 if (regflags & PMf_FOLD)
1871 *opnd |= ANYOF_FOLD;
1872 if (regflags & PMf_LOCALE)
1873 *opnd |= ANYOF_LOCALE;
1875 regsize += ANY_SKIP;
1877 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1878 goto skipcond; /* allow 1st char to be ] or - */
1879 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1881 Class = UCHARAT(regcomp_parse++);
1882 if (Class == '[' && regcomp_parse + 1 < regxend &&
1883 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1884 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1885 char posixccc = *regcomp_parse;
1886 char* posixccs = regcomp_parse++;
1888 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1890 if (regcomp_parse == regxend)
1891 /* Grandfather lone [:, [=, [. */
1892 regcomp_parse = posixccs;
1894 regcomp_parse++; /* skip over the posixccc */
1895 if (*regcomp_parse == ']') {
1896 /* Not Implemented Yet.
1897 * (POSIX Extended Character Classes, that is)
1898 * The text between e.g. [: and :] would start
1899 * at posixccs + 1 and stop at regcomp_parse - 2. */
1900 if (dowarn && !SIZE_ONLY)
1901 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1902 regcomp_parse++; /* skip over the ending ] */
1906 if (Class == '\\') {
1907 Class = UCHARAT(regcomp_parse++);
1911 if (regflags & PMf_LOCALE)
1912 *opnd |= ANYOF_ALNUML;
1914 for (Class = 0; Class < 256; Class++)
1916 ANYOF_SET(opnd, Class);
1923 if (regflags & PMf_LOCALE)
1924 *opnd |= ANYOF_NALNUML;
1926 for (Class = 0; Class < 256; Class++)
1927 if (!isALNUM(Class))
1928 ANYOF_SET(opnd, Class);
1935 if (regflags & PMf_LOCALE)
1936 *opnd |= ANYOF_SPACEL;
1938 for (Class = 0; Class < 256; Class++)
1940 ANYOF_SET(opnd, Class);
1947 if (regflags & PMf_LOCALE)
1948 *opnd |= ANYOF_NSPACEL;
1950 for (Class = 0; Class < 256; Class++)
1951 if (!isSPACE(Class))
1952 ANYOF_SET(opnd, Class);
1959 for (Class = '0'; Class <= '9'; Class++)
1960 ANYOF_SET(opnd, Class);
1966 for (Class = 0; Class < '0'; Class++)
1967 ANYOF_SET(opnd, Class);
1968 for (Class = '9' + 1; Class < 256; Class++)
1969 ANYOF_SET(opnd, Class);
1995 Class = scan_hex(regcomp_parse, 2, &numlen);
1996 regcomp_parse += numlen;
1999 Class = UCHARAT(regcomp_parse++);
2000 Class = toCTRL(Class);
2002 case '0': case '1': case '2': case '3': case '4':
2003 case '5': case '6': case '7': case '8': case '9':
2004 Class = scan_oct(--regcomp_parse, 3, &numlen);
2005 regcomp_parse += numlen;
2010 if (lastclass > Class)
2011 FAIL("invalid [] range in regexp");
2016 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
2017 regcomp_parse[1] != ']') {
2020 continue; /* do it next time */
2024 for ( ; lastclass <= Class; lastclass++)
2025 ANYOF_SET(opnd, lastclass);
2029 if (*regcomp_parse != ']')
2030 FAIL("unmatched [] in regexp");
2032 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2033 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2034 for (Class = 0; Class < 256; ++Class) {
2035 if (ANYOF_TEST(opnd, Class)) {
2036 I32 cf = fold[Class];
2037 ANYOF_SET(opnd, cf);
2040 *opnd &= ~ANYOF_FOLD;
2042 /* optimize inverted simple patterns (e.g. [^a-z]) */
2043 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2044 for (Class = 0; Class < 32; ++Class)
2045 opnd[1 + Class] ^= 0xFF;
2055 char* retval = regcomp_parse++;
2058 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2059 regcomp_parse[2] == '#') {
2060 while (*regcomp_parse && *regcomp_parse != ')')
2065 if (regflags & PMf_EXTENDED) {
2066 if (isSPACE(*regcomp_parse)) {
2070 else if (*regcomp_parse == '#') {
2071 while (*regcomp_parse && *regcomp_parse != '\n')
2082 - reg_node - emit a node
2084 STATIC regnode * /* Location. */
2088 register regnode *ret;
2089 register regnode *ptr;
2093 SIZE_ALIGN(regsize);
2098 NODE_ALIGN_FILL(ret);
2100 FILL_ADVANCE_NODE(ptr, op);
2107 - reganode - emit a node with an argument
2109 STATIC regnode * /* Location. */
2110 reganode(U8 op, U32 arg)
2113 register regnode *ret;
2114 register regnode *ptr;
2118 SIZE_ALIGN(regsize);
2123 NODE_ALIGN_FILL(ret);
2125 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2132 - regc - emit (if appropriate) a byte of code
2143 - reginsert - insert an operator in front of already-emitted operand
2145 * Means relocating the operand.
2148 reginsert(U8 op, regnode *opnd)
2151 register regnode *src;
2152 register regnode *dst;
2153 register regnode *place;
2154 register int offset = regarglen[(U8)op];
2156 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2159 regsize += NODE_STEP_REGNODE + offset;
2164 regcode += NODE_STEP_REGNODE + offset;
2167 StructCopy(--src, --dst, regnode);
2169 place = opnd; /* Op node, where operand used to be. */
2170 src = NEXTOPER(place);
2171 FILL_ADVANCE_NODE(place, op);
2172 Zero(src, offset, regnode);
2176 - regtail - set the next-pointer at the end of a node chain of p to val.
2179 regtail(regnode *p, regnode *val)
2182 register regnode *scan;
2183 register regnode *temp;
2184 register I32 offset;
2189 /* Find last node. */
2192 temp = regnext(scan);
2198 if (reg_off_by_arg[OP(scan)]) {
2199 ARG_SET(scan, val - scan);
2201 NEXT_OFF(scan) = val - scan;
2206 - regoptail - regtail on operand of first argument; nop if operandless
2209 regoptail(regnode *p, regnode *val)
2212 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2213 if (p == NULL || SIZE_ONLY)
2215 if (regkind[(U8)OP(p)] == BRANCH) {
2216 regtail(NEXTOPER(p), val);
2217 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2218 regtail(NEXTOPER(NEXTOPER(p)), val);
2224 - regcurly - a little FSA that accepts {\d+,?\d*}
2227 regcurly(register char *s)
2246 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2249 register char op = EXACT; /* Arbitrary non-END op. */
2250 register regnode *next, *onode;
2252 while (op != END && (!last || node < last)) {
2253 /* While that wasn't END last time... */
2259 next = regnext(node);
2261 if (OP(node) == OPTIMIZED)
2264 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2265 2*l + 1, "", SvPVX(sv));
2266 if (next == NULL) /* Next ptr. */
2267 PerlIO_printf(Perl_debug_log, "(0)");
2269 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2270 (void)PerlIO_putc(Perl_debug_log, '\n');
2272 if (regkind[(U8)op] == BRANCHJ) {
2273 register regnode *nnode = (OP(next) == LONGJMP
2276 if (last && nnode > last)
2278 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2279 } else if (regkind[(U8)op] == BRANCH) {
2280 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2281 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2282 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2283 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2284 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2285 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2287 } else if ( op == PLUS || op == STAR) {
2288 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2289 } else if (op == ANYOF) {
2290 node = NEXTOPER(node);
2292 } else if (regkind[(U8)op] == EXACT) {
2293 /* Literal string, where present. */
2294 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2295 node = NEXTOPER(node);
2297 node = NEXTOPER(node);
2298 node += regarglen[(U8)op];
2300 if (op == CURLYX || op == OPEN)
2302 else if (op == WHILEM)
2305 #endif /* DEBUGGING */
2310 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2317 SV *sv = sv_newmortal();
2319 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2321 /* Header fields of interest. */
2322 if (r->anchored_substr)
2323 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2325 SvPVX(r->anchored_substr),
2327 SvTAIL(r->anchored_substr) ? "$" : "",
2328 r->anchored_offset);
2329 if (r->float_substr)
2330 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2332 SvPVX(r->float_substr),
2334 SvTAIL(r->float_substr) ? "$" : "",
2335 r->float_min_offset, r->float_max_offset);
2336 if (r->check_substr)
2337 PerlIO_printf(Perl_debug_log,
2338 r->check_substr == r->float_substr
2339 ? "(checking floating" : "(checking anchored");
2340 if (r->reganch & ROPT_NOSCAN)
2341 PerlIO_printf(Perl_debug_log, " noscan");
2342 if (r->reganch & ROPT_CHECK_ALL)
2343 PerlIO_printf(Perl_debug_log, " isall");
2344 if (r->check_substr)
2345 PerlIO_printf(Perl_debug_log, ") ");
2347 if (r->regstclass) {
2348 regprop(sv, r->regstclass);
2349 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2351 if (r->reganch & ROPT_ANCH) {
2352 PerlIO_printf(Perl_debug_log, "anchored");
2353 if (r->reganch & ROPT_ANCH_BOL)
2354 PerlIO_printf(Perl_debug_log, "(BOL)");
2355 if (r->reganch & ROPT_ANCH_MBOL)
2356 PerlIO_printf(Perl_debug_log, "(MBOL)");
2357 if (r->reganch & ROPT_ANCH_GPOS)
2358 PerlIO_printf(Perl_debug_log, "(GPOS)");
2359 PerlIO_putc(Perl_debug_log, ' ');
2361 if (r->reganch & ROPT_GPOS_SEEN)
2362 PerlIO_printf(Perl_debug_log, "GPOS ");
2363 if (r->reganch & ROPT_SKIP)
2364 PerlIO_printf(Perl_debug_log, "plus ");
2365 if (r->reganch & ROPT_IMPLICIT)
2366 PerlIO_printf(Perl_debug_log, "implicit ");
2367 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2368 if (r->reganch & ROPT_EVAL_SEEN)
2369 PerlIO_printf(Perl_debug_log, "with eval ");
2370 PerlIO_printf(Perl_debug_log, "\n");
2371 #endif /* DEBUGGING */
2375 - regprop - printable representation of opcode
2378 regprop(SV *sv, regnode *o)
2382 register char *p = 0;
2384 sv_setpvn(sv, "", 0);
2420 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2423 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2426 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2453 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2456 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2459 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2462 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2465 sv_catpvf(sv, "REF%d", ARG(o));
2468 sv_catpvf(sv, "REFF%d", ARG(o));
2471 sv_catpvf(sv, "REFFL%d", ARG(o));
2474 sv_catpvf(sv, "OPEN%d", ARG(o));
2477 sv_catpvf(sv, "CLOSE%d", ARG(o));
2493 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2496 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2547 sv_catpvf(sv, "GROUPP%d", ARG(o));
2562 FAIL("corrupted regexp opcode");
2566 #endif /* DEBUGGING */
2570 pregfree(struct regexp *r)
2573 if (!r || (--r->refcnt > 0))
2576 Safefree(r->precomp);
2578 Safefree(r->subbase);
2580 if (r->anchored_substr)
2581 SvREFCNT_dec(r->anchored_substr);
2582 if (r->float_substr)
2583 SvREFCNT_dec(r->float_substr);
2584 Safefree(r->substrs);
2587 int n = r->data->count;
2589 switch (r->data->what[n]) {
2591 SvREFCNT_dec((SV*)r->data->data[n]);
2594 op_free((OP_4tree*)r->data->data[n]);
2599 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2602 Safefree(r->data->what);
2605 Safefree(r->startp);
2611 - regnext - dig the "next" pointer out of a node
2613 * [Note, when REGALIGN is defined there are two places in regmatch()
2614 * that bypass this code for speed.]
2617 regnext(register regnode *p)
2620 register I32 offset;
2625 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2633 re_croak2(const char* pat1,const char* pat2,...)
2636 STRLEN l1 = strlen(pat1);
2637 STRLEN l2 = strlen(pat2);
2645 Copy(pat1, buf, l1 , char);
2646 Copy(pat2, buf + l1, l2 , char);
2647 buf[l1 + l2] = '\n';
2648 buf[l1 + l2 + 1] = '\0';
2649 va_start(args, pat2);
2650 message = mess(buf, &args);
2652 l1 = strlen(message);
2655 Copy(message, buf, l1 , char);
2656 buf[l1] = '\0'; /* Overwrite \n */