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. */
226 I32 min = 0, pars = 0, code;
227 regnode *scan = *scanp, *next;
229 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
230 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
231 scan_data_t data_fake;
233 while (scan && OP(scan) != END && scan < last) {
234 /* Peephole optimizer: */
236 if (regkind[(U8)OP(scan)] == EXACT) {
237 regnode *n = regnext(scan);
240 regnode *stop = scan;
243 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
244 /* Skip NOTHING, merge EXACT*. */
246 ( regkind[(U8)OP(n)] == NOTHING ||
247 (stringok && (OP(n) == OP(scan))))
249 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
250 if (OP(n) == TAIL || n > next)
252 if (regkind[(U8)OP(n)] == NOTHING) {
253 NEXT_OFF(scan) += NEXT_OFF(n);
254 next = n + NODE_STEP_REGNODE;
261 int oldl = *OPERAND(scan);
262 regnode *nnext = regnext(n);
264 if (oldl + *OPERAND(n) > U8_MAX)
266 NEXT_OFF(scan) += NEXT_OFF(n);
267 *OPERAND(scan) += *OPERAND(n);
268 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
269 /* Now we can overwrite *n : */
270 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
271 *OPERAND(n) + 1, char);
281 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
283 /* Purify reports a benign UMR here sometimes, because we
284 * don't initialize the OP() slot of a node when that node
285 * is occupied by just the trailing null of the string in
287 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
296 if (OP(scan) != CURLYX) {
297 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
298 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
302 /* Skip NOTHING and LONGJMP. */
303 while ((n = regnext(n))
304 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
305 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
308 if (reg_off_by_arg[OP(scan)])
311 NEXT_OFF(scan) = off;
313 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
314 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
315 next = regnext(scan);
318 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
319 I32 max1 = 0, min1 = I32_MAX, num = 0;
321 if (flags & SCF_DO_SUBSTR)
323 while (OP(scan) == code) {
324 I32 deltanext, minnext;
328 next = regnext(scan);
329 scan = NEXTOPER(scan);
331 scan = NEXTOPER(scan);
332 /* We suppose the run is continuous, last=next...*/
333 minnext = study_chunk(&scan, &deltanext, next,
337 if (max1 < minnext + deltanext)
338 max1 = minnext + deltanext;
339 if (deltanext == I32_MAX)
342 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
344 if (data && (data_fake.flags & SF_HAS_EVAL))
345 data->flags |= SF_HAS_EVAL;
349 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
351 if (flags & SCF_DO_SUBSTR) {
352 data->pos_min += min1;
353 data->pos_delta += max1 - min1;
354 if (max1 != min1 || is_inf)
355 data->longest = &(data->longest_float);
358 delta += max1 - min1;
359 } else if (code == BRANCHJ) /* single branch is optimized. */
360 scan = NEXTOPER(NEXTOPER(scan));
361 else /* single branch is optimized. */
362 scan = NEXTOPER(scan);
364 } else if (OP(scan) == EXACT) {
365 min += *OPERAND(scan);
366 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
367 I32 l = *OPERAND(scan);
369 /* The code below prefers earlier match for fixed
370 offset, later match for variable offset. */
371 if (data->last_end == -1) { /* Update the start info. */
372 data->last_start_min = data->pos_min;
373 data->last_start_max = is_inf
374 ? I32_MAX : data->pos_min + data->pos_delta;
376 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
377 data->last_end = data->pos_min + l;
378 data->pos_min += l; /* As in the first entry. */
379 data->flags &= ~SF_BEFORE_EOL;
381 } else if (regkind[(U8)OP(scan)] == EXACT) {
382 if (flags & SCF_DO_SUBSTR)
384 min += *OPERAND(scan);
385 if (data && (flags & SCF_DO_SUBSTR))
386 data->pos_min += *OPERAND(scan);
387 } else if (strchr(varies,OP(scan))) {
388 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
389 regnode *oscan = scan;
391 switch (regkind[(U8)OP(scan)]) {
393 scan = NEXTOPER(scan);
396 if (flags & SCF_DO_SUBSTR) {
397 next = NEXTOPER(scan);
398 if (OP(next) == EXACT) {
400 maxcount = REG_INFTY;
401 next = regnext(scan);
402 scan = NEXTOPER(scan);
406 if (flags & SCF_DO_SUBSTR)
412 scan = regnext(scan);
413 if (flags & SCF_DO_SUBSTR) {
415 data->longest = &(data->longest_float);
417 goto optimize_curly_tail;
419 mincount = ARG1(scan);
420 maxcount = ARG2(scan);
421 next = regnext(scan);
422 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
424 if (flags & SCF_DO_SUBSTR) {
425 if (mincount == 0) scan_commit(data);
426 pos_before = data->pos_min;
430 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
432 data->flags |= SF_IS_INF;
434 /* This will finish on WHILEM, setting scan, or on NULL: */
435 minnext = study_chunk(&scan, &deltanext, last, data,
437 ? (flags & ~SCF_DO_SUBSTR) : flags);
438 if (!scan) /* It was not CURLYX, but CURLY. */
440 if (dowarn && (minnext + deltanext == 0)
441 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
442 && maxcount <= 10000) /* Complement check for big count */
443 warn("Strange *+?{} on zero-length expression");
444 min += minnext * mincount;
445 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
446 || deltanext == I32_MAX);
447 delta += (minnext + deltanext) * maxcount - minnext * mincount;
449 /* Try powerful optimization CURLYX => CURLYN. */
450 if ( OP(oscan) == CURLYX && data
451 && data->flags & SF_IN_PAR
452 && !(data->flags & SF_HAS_EVAL)
453 && !deltanext && minnext == 1 ) {
454 /* Try to optimize to CURLYN. */
455 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
456 regnode *nxt1 = nxt, *nxt2;
460 if (!strchr(simple,OP(nxt))
461 && !(regkind[(U8)OP(nxt)] == EXACT
462 && *OPERAND(nxt) == 1))
466 if (OP(nxt) != CLOSE)
468 /* Now we know that nxt2 is the only contents: */
469 oscan->flags = ARG(nxt);
471 OP(nxt1) = NOTHING; /* was OPEN. */
473 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
474 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
475 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
476 OP(nxt) = OPTIMIZED; /* was CLOSE. */
477 OP(nxt + 1) = OPTIMIZED; /* was count. */
478 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
483 /* Try optimization CURLYX => CURLYM. */
484 if ( OP(oscan) == CURLYX && data
485 && !(data->flags & SF_HAS_PAR)
486 && !(data->flags & SF_HAS_EVAL)
488 /* XXXX How to optimize if data == 0? */
489 /* Optimize to a simpler form. */
490 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
494 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
495 && (OP(nxt2) != WHILEM))
497 OP(nxt2) = SUCCEED; /* Whas WHILEM */
498 /* Need to optimize away parenths. */
499 if (data->flags & SF_IN_PAR) {
500 /* Set the parenth number. */
501 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
503 if (OP(nxt) != CLOSE)
504 FAIL("panic opt close");
505 oscan->flags = ARG(nxt);
506 OP(nxt1) = OPTIMIZED; /* was OPEN. */
507 OP(nxt) = OPTIMIZED; /* was CLOSE. */
509 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
510 OP(nxt + 1) = OPTIMIZED; /* was count. */
511 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
512 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
515 while ( nxt1 && (OP(nxt1) != WHILEM)) {
516 regnode *nnxt = regnext(nxt1);
519 if (reg_off_by_arg[OP(nxt1)])
520 ARG_SET(nxt1, nxt2 - nxt1);
521 else if (nxt2 - nxt1 < U16_MAX)
522 NEXT_OFF(nxt1) = nxt2 - nxt1;
524 OP(nxt) = NOTHING; /* Cannot beautify */
529 /* Optimize again: */
530 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
534 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
536 if (flags & SCF_DO_SUBSTR) {
537 SV *last_str = Nullsv;
538 int counted = mincount != 0;
540 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
541 I32 b = pos_before >= data->last_start_min
542 ? pos_before : data->last_start_min;
544 char *s = SvPV(data->last_found, l);
546 l -= b - data->last_start_min;
547 /* Get the added string: */
548 last_str = newSVpv(s + b - data->last_start_min, l);
549 if (deltanext == 0 && pos_before == b) {
550 /* What was added is a constant string */
552 SvGROW(last_str, (mincount * l) + 1);
553 repeatcpy(SvPVX(last_str) + l,
554 SvPVX(last_str), l, mincount - 1);
555 SvCUR(last_str) *= mincount;
556 /* Add additional parts. */
557 SvCUR_set(data->last_found,
558 SvCUR(data->last_found) - l);
559 sv_catsv(data->last_found, last_str);
560 data->last_end += l * (mincount - 1);
564 /* It is counted once already... */
565 data->pos_min += minnext * (mincount - counted);
566 data->pos_delta += - counted * deltanext +
567 (minnext + deltanext) * maxcount - minnext * mincount;
568 if (mincount != maxcount) {
570 if (mincount && last_str) {
571 sv_setsv(data->last_found, last_str);
572 data->last_end = data->pos_min;
573 data->last_start_min =
574 data->pos_min - SvCUR(last_str);
575 data->last_start_max = is_inf
577 : data->pos_min + data->pos_delta
580 data->longest = &(data->longest_float);
583 if (data && (fl & SF_HAS_EVAL))
584 data->flags |= SF_HAS_EVAL;
586 if (OP(oscan) != CURLYX) {
587 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
589 NEXT_OFF(oscan) += NEXT_OFF(next);
592 default: /* REF only? */
593 if (flags & SCF_DO_SUBSTR) {
595 data->longest = &(data->longest_float);
600 } else if (strchr(simple,OP(scan))) {
601 if (flags & SCF_DO_SUBSTR) {
606 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
607 data->flags |= (OP(scan) == MEOL
610 } else if (regkind[(U8)OP(scan)] == BRANCHJ
611 && (scan->flags || data)
612 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
613 I32 deltanext, minnext;
617 next = regnext(scan);
618 nscan = NEXTOPER(NEXTOPER(scan));
619 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
622 FAIL("variable length lookbehind not implemented");
623 } else if (minnext > U8_MAX) {
624 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
626 scan->flags = minnext;
628 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
630 if (data && (data_fake.flags & SF_HAS_EVAL))
631 data->flags |= SF_HAS_EVAL;
632 } else if (OP(scan) == OPEN) {
634 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
635 next = regnext(scan);
637 if ( next && (OP(next) != WHILEM) && next < last)
638 is_par = 0; /* Disable optimization */
639 } else if (OP(scan) == EVAL) {
641 data->flags |= SF_HAS_EVAL;
643 /* Else: zero-length, ignore. */
644 scan = regnext(scan);
649 *deltap = is_inf ? I32_MAX : delta;
650 if (flags & SCF_DO_SUBSTR && is_inf)
651 data->pos_delta = I32_MAX - data->pos_min;
654 if (is_par && pars==1 && data) {
655 data->flags |= SF_IN_PAR;
656 data->flags &= ~SF_HAS_PAR;
657 } else if (pars && data) {
658 data->flags |= SF_HAS_PAR;
659 data->flags &= ~SF_IN_PAR;
665 add_data(I32 n, char *s)
667 if (regcomp_rx->data) {
668 Renewc(regcomp_rx->data,
669 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
670 char, struct reg_data);
671 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
672 regcomp_rx->data->count += n;
674 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
675 char, struct reg_data);
676 New(1208, regcomp_rx->data->what, n, U8);
677 regcomp_rx->data->count = n;
679 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
680 return regcomp_rx->data->count - n;
684 - pregcomp - compile a regular expression into internal code
686 * We can't allocate space until we know how big the compiled form will be,
687 * but we can't compile it (and thus know how big it is) until we've got a
688 * place to put the code. So we cheat: we compile it twice, once with code
689 * generation turned off and size counting turned on, and once "for real".
690 * This also means that we don't allocate space until we are sure that the
691 * thing really will compile successfully, and we never have to move the
692 * code and thus invalidate pointers into it. (Note that it has to be in
693 * one piece because free() must be able to free it all.) [NB: not true in perl]
695 * Beware that the optimization-preparation code in here knows about some
696 * of the structure of the compiled regexp. [I'll say.]
699 pregcomp(char *exp, char *xend, PMOP *pm)
713 FAIL("NULL regexp argument");
715 regprecomp = savepvn(exp, xend - exp);
716 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
717 xend - exp, regprecomp));
718 regflags = pm->op_pmflags;
722 seen_zerolen = *exp == '^' ? -1 : 0;
726 /* First pass: determine size, legality. */
733 regc((U8)MAGIC, (char*)regcode);
734 if (reg(0, &flags) == NULL) {
735 Safefree(regprecomp);
739 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
744 char *s = PerlEnv_getenv("TERMCAP_COLORS");
748 colors[0] = s = savepv(s);
752 FAIL("Not enough TABs in TERMCAP_COLORS");
761 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
762 colors[0],colors[1],colors[2],colors[3]);
766 /* Small enough for pointer-storage convention?
767 If extralen==0, this means that we will not need long jumps. */
768 if (regsize >= 0x10000L && extralen)
773 /* Allocate space and initialize. */
774 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
777 FAIL("regexp out of space");
779 r->prelen = xend - exp;
780 r->precomp = regprecomp;
781 r->subbeg = r->subbase = NULL;
782 r->nparens = regnpar - 1; /* set early to validate backrefs */
785 /* Second pass: emit code. */
790 regcode = r->program;
791 /* Store the count of eval-groups for security checks: */
792 regcode->next_off = ((seen_evals > U16_MAX) ? U16_MAX : seen_evals);
793 regc((U8)MAGIC, (char*) regcode++);
795 if (reg(0, &flags) == NULL)
798 /* Dig out information for optimizations. */
799 pm->op_pmflags = regflags;
801 r->regstclass = NULL;
802 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
803 scan = r->program + 1; /* First BRANCH. */
805 /* XXXX To minimize changes to RE engine we always allocate
806 3-units-long substrs field. */
807 Newz(1004, r->substrs, 1, struct reg_substr_data);
809 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
812 STRLEN longest_float_length, longest_fixed_length;
814 StructCopy(&zero_scan_data, &data, scan_data_t);
816 /* Skip introductions and multiplicators >= 1. */
817 while ((OP(first) == OPEN && (sawopen = 1)) ||
818 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
819 (OP(first) == PLUS) ||
820 (OP(first) == MINMOD) ||
821 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
822 if (OP(first) == PLUS)
825 first += regarglen[(U8)OP(first)];
826 first = NEXTOPER(first);
829 /* Starting-point info. */
831 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
832 else if (strchr(simple+2,OP(first)))
833 r->regstclass = first;
834 else if (regkind[(U8)OP(first)] == BOUND ||
835 regkind[(U8)OP(first)] == NBOUND)
836 r->regstclass = first;
837 else if (regkind[(U8)OP(first)] == BOL) {
838 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
839 first = NEXTOPER(first);
842 else if (OP(first) == GPOS) {
843 r->reganch |= ROPT_ANCH_GPOS;
844 first = NEXTOPER(first);
847 else if ((OP(first) == STAR &&
848 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
849 !(r->reganch & ROPT_ANCH) )
851 /* turn .* into ^.* with an implied $*=1 */
852 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
853 first = NEXTOPER(first);
856 if (sawplus && (!sawopen || !regsawback))
857 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
859 /* Scan is after the zeroth branch, first is atomic matcher. */
860 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
863 * If there's something expensive in the r.e., find the
864 * longest literal string that must appear and make it the
865 * regmust. Resolve ties in favor of later strings, since
866 * the regstart check works with the beginning of the r.e.
867 * and avoiding duplication strengthens checking. Not a
868 * strong reason, but sufficient in the absence of others.
869 * [Now we resolve ties in favor of the earlier string if
870 * it happens that c_offset_min has been invalidated, since the
871 * earlier string may buy us something the later one won't.]
875 data.longest_fixed = newSVpv("",0);
876 data.longest_float = newSVpv("",0);
877 data.last_found = newSVpv("",0);
878 data.longest = &(data.longest_fixed);
881 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
882 &data, SCF_DO_SUBSTR);
883 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
884 && data.last_start_min == 0 && data.last_end > 0
886 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
887 r->reganch |= ROPT_CHECK_ALL;
889 SvREFCNT_dec(data.last_found);
891 longest_float_length = SvCUR(data.longest_float);
892 if (longest_float_length
893 || (data.flags & SF_FL_BEFORE_EOL
894 && (!(data.flags & SF_FL_BEFORE_MEOL)
895 || (regflags & PMf_MULTILINE)))) {
896 if (SvCUR(data.longest_fixed)
897 && data.offset_fixed == data.offset_float_min)
898 goto remove; /* Like in (a)+. */
900 r->float_substr = data.longest_float;
901 r->float_min_offset = data.offset_float_min;
902 r->float_max_offset = data.offset_float_max;
903 fbm_compile(r->float_substr, 0);
904 BmUSEFUL(r->float_substr) = 100;
905 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
906 && (!(data.flags & SF_FL_BEFORE_MEOL)
907 || (regflags & PMf_MULTILINE)))
908 SvTAIL_on(r->float_substr);
911 r->float_substr = Nullsv;
912 SvREFCNT_dec(data.longest_float);
913 longest_float_length = 0;
916 longest_fixed_length = SvCUR(data.longest_fixed);
917 if (longest_fixed_length
918 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
919 && (!(data.flags & SF_FIX_BEFORE_MEOL)
920 || (regflags & PMf_MULTILINE)))) {
921 r->anchored_substr = data.longest_fixed;
922 r->anchored_offset = data.offset_fixed;
923 fbm_compile(r->anchored_substr, 0);
924 BmUSEFUL(r->anchored_substr) = 100;
925 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
926 && (!(data.flags & SF_FIX_BEFORE_MEOL)
927 || (regflags & PMf_MULTILINE)))
928 SvTAIL_on(r->anchored_substr);
930 r->anchored_substr = Nullsv;
931 SvREFCNT_dec(data.longest_fixed);
932 longest_fixed_length = 0;
935 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
936 if (longest_fixed_length > longest_float_length) {
937 r->check_substr = r->anchored_substr;
938 r->check_offset_min = r->check_offset_max = r->anchored_offset;
939 if (r->reganch & ROPT_ANCH_SINGLE)
940 r->reganch |= ROPT_NOSCAN;
942 r->check_substr = r->float_substr;
943 r->check_offset_min = data.offset_float_min;
944 r->check_offset_max = data.offset_float_max;
947 /* Several toplevels. Best we can is to set minlen. */
950 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
951 scan = r->program + 1;
952 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
953 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
957 if (regseen & REG_SEEN_GPOS)
958 r->reganch |= ROPT_GPOS_SEEN;
959 if (regseen & REG_SEEN_LOOKBEHIND)
960 r->reganch |= ROPT_LOOKBEHIND_SEEN;
961 if (regseen & REG_SEEN_EVAL)
962 r->reganch |= ROPT_EVAL_SEEN;
963 Newz(1002, r->startp, regnpar, char*);
964 Newz(1002, r->endp, regnpar, char*);
970 - reg - regular expression, i.e. main body or parenthesized thing
972 * Caller must absorb opening parenthesis.
974 * Combining parenthesis handling with the base level of regular expression
975 * is a trifle forced, but the need to tie the tails of the branches to what
976 * follows makes it hard to avoid.
979 reg(I32 paren, I32 *flagp)
980 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
982 register regnode *ret; /* Will be the head of the group. */
983 register regnode *br;
984 register regnode *lastbr;
985 register regnode *ender = 0;
986 register I32 parno = 0;
987 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
990 *flagp = 0; /* Tentatively. */
992 /* Make an OPEN node, if parenthesized. */
994 if (*regcomp_parse == '?') {
995 U16 posflags = 0, negflags = 0;
996 U16 *flagsp = &posflags;
999 paren = *regcomp_parse++;
1000 ret = NULL; /* For look-ahead/behind. */
1003 regseen |= REG_SEEN_LOOKBEHIND;
1004 if (*regcomp_parse == '!')
1006 if (*regcomp_parse != '=' && *regcomp_parse != '!')
1017 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1020 while (*regcomp_parse && *regcomp_parse != ')')
1022 if (*regcomp_parse != ')')
1023 FAIL("Sequence (?#... not terminated");
1030 I32 count = 1, n = 0;
1032 char *s = regcomp_parse;
1034 OP_4tree *sop, *rop;
1037 regseen |= REG_SEEN_EVAL;
1038 while (count && (c = *regcomp_parse)) {
1039 if (c == '\\' && regcomp_parse[1])
1047 if (*regcomp_parse != ')')
1048 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1052 if (regcomp_parse - 1 - s)
1053 sv = newSVpv(s, regcomp_parse - 1 - s);
1055 sv = newSVpv("", 0);
1057 rop = sv_compile_2op(sv, &sop, "re", &av);
1059 n = add_data(3, "nso");
1060 regcomp_rx->data->data[n] = (void*)rop;
1061 regcomp_rx->data->data[n+1] = (void*)av;
1062 regcomp_rx->data->data[n+2] = (void*)sop;
1064 } else { /* First pass */
1065 if (reginterp_cnt < ++seen_evals && curcop != &compiling)
1066 /* No compiled RE interpolated, has runtime
1067 components ===> unsafe. */
1068 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1070 FAIL("Eval-group in insecure regular expression");
1074 return reganode(EVAL, n);
1078 if (regcomp_parse[0] == '?') {
1079 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1080 || regcomp_parse[1] == '<'
1081 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1084 ret = reg_node(LOGICAL);
1085 regtail(ret, reg(1, &flag));
1088 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1089 parno = atoi(regcomp_parse++);
1091 while (isDIGIT(*regcomp_parse))
1093 ret = reganode(GROUPP, parno);
1094 if ((c = *nextchar()) != ')')
1095 FAIL2("Switch (?(number%c not recognized", c);
1097 regtail(ret, reganode(IFTHEN, 0));
1098 br = regbranch(&flags, 1);
1100 br = reganode(LONGJMP, 0);
1102 regtail(br, reganode(LONGJMP, 0));
1105 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1106 regbranch(&flags, 1);
1107 regtail(ret, lastbr);
1112 FAIL("Switch (?(condition)... contains too many branches");
1113 ender = reg_node(TAIL);
1116 regtail(lastbr, ender);
1117 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1119 regtail(ret, ender);
1122 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1126 FAIL("Sequence (? incomplete");
1131 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1132 if (*regcomp_parse != 'o')
1133 pmflag(flagsp, *regcomp_parse);
1136 if (*regcomp_parse == '-') {
1141 regflags |= posflags;
1142 regflags &= ~negflags;
1143 if (*regcomp_parse == ':') {
1149 if (*regcomp_parse != ')')
1150 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1159 ret = reganode(OPEN, parno);
1165 /* Pick up the branches, linking them together. */
1166 br = regbranch(&flags, 1);
1169 if (*regcomp_parse == '|') {
1170 if (!SIZE_ONLY && extralen) {
1171 reginsert(BRANCHJ, br);
1173 reginsert(BRANCH, br);
1176 extralen += 1; /* For BRANCHJ-BRANCH. */
1177 } else if (paren == ':') {
1178 *flagp |= flags&SIMPLE;
1180 if (open) { /* Starts with OPEN. */
1181 regtail(ret, br); /* OPEN -> first. */
1182 } else if (paren != '?') /* Not Conditional */
1186 *flagp |= flags&SPSTART;
1188 while (*regcomp_parse == '|') {
1189 if (!SIZE_ONLY && extralen) {
1190 ender = reganode(LONGJMP,0);
1191 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1194 extralen += 2; /* Account for LONGJMP. */
1196 br = regbranch(&flags, 0);
1199 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1203 *flagp |= flags&SPSTART;
1206 if (have_branch || paren != ':') {
1207 /* Make a closing node, and hook it on the end. */
1210 ender = reg_node(TAIL);
1213 ender = reganode(CLOSE, parno);
1219 *flagp &= ~HASWIDTH;
1222 ender = reg_node(SUCCEED);
1225 ender = reg_node(END);
1228 regtail(lastbr, ender);
1231 /* Hook the tails of the branches to the closing node. */
1232 for (br = ret; br != NULL; br = regnext(br)) {
1233 regoptail(br, ender);
1240 static char parens[] = "=!<,>";
1242 if (paren && (p = strchr(parens, paren))) {
1243 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1244 int flag = (p - parens) > 1;
1247 node = SUSPEND, flag = 0;
1248 reginsert(node,ret);
1250 regtail(ret, reg_node(TAIL));
1254 /* Check for proper termination. */
1255 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1256 FAIL("unmatched () in regexp");
1257 } else if (!paren && regcomp_parse < regxend) {
1258 if (*regcomp_parse == ')') {
1259 FAIL("unmatched () in regexp");
1261 FAIL("junk on end of regexp"); /* "Can't happen". */
1265 regflags = oregflags;
1272 - regbranch - one alternative of an | operator
1274 * Implements the concatenation operator.
1277 regbranch(I32 *flagp, I32 first)
1279 register regnode *ret;
1280 register regnode *chain = NULL;
1281 register regnode *latest;
1282 I32 flags = 0, c = 0;
1287 if (!SIZE_ONLY && extralen)
1288 ret = reganode(BRANCHJ,0);
1290 ret = reg_node(BRANCH);
1293 if (!first && SIZE_ONLY)
1294 extralen += 1; /* BRANCHJ */
1296 *flagp = WORST; /* Tentatively. */
1300 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1302 latest = regpiece(&flags);
1303 if (latest == NULL) {
1304 if (flags & TRYAGAIN)
1307 } else if (ret == NULL)
1309 *flagp |= flags&HASWIDTH;
1310 if (chain == NULL) /* First piece. */
1311 *flagp |= flags&SPSTART;
1314 regtail(chain, latest);
1319 if (chain == NULL) { /* Loop ran zero times. */
1320 chain = reg_node(NOTHING);
1325 *flagp |= flags&SIMPLE;
1332 - regpiece - something followed by possible [*+?]
1334 * Note that the branching code sequences used for ? and the general cases
1335 * of * and + are somewhat optimized: they use the same NOTHING node as
1336 * both the endmarker for their branch list and the body of the last branch.
1337 * It might seem that this node could be dispensed with entirely, but the
1338 * endmarker role is not redundant.
1341 regpiece(I32 *flagp)
1343 register regnode *ret;
1345 register char *next;
1347 char *origparse = regcomp_parse;
1350 I32 max = REG_INFTY;
1352 ret = regatom(&flags);
1354 if (flags & TRYAGAIN)
1359 op = *regcomp_parse;
1361 if (op == '{' && regcurly(regcomp_parse)) {
1362 next = regcomp_parse + 1;
1364 while (isDIGIT(*next) || *next == ',') {
1373 if (*next == '}') { /* got one */
1377 min = atoi(regcomp_parse);
1381 maxpos = regcomp_parse;
1383 if (!max && *maxpos != '0')
1384 max = REG_INFTY; /* meaning "infinity" */
1385 else if (max >= REG_INFTY)
1386 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1387 regcomp_parse = next;
1391 if ((flags&SIMPLE)) {
1392 regnaughty += 2 + regnaughty / 2;
1393 reginsert(CURLY, ret);
1396 regnaughty += 4 + regnaughty; /* compound interest */
1397 regtail(ret, reg_node(WHILEM));
1398 if (!SIZE_ONLY && extralen) {
1399 reginsert(LONGJMP,ret);
1400 reginsert(NOTHING,ret);
1401 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1403 reginsert(CURLYX,ret);
1404 if (!SIZE_ONLY && extralen)
1405 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1406 regtail(ret, reg_node(NOTHING));
1416 if (max && max < min)
1417 FAIL("Can't do {n,m} with n > m");
1432 #if 0 /* Now runtime fix should be reliable. */
1433 if (!(flags&HASWIDTH) && op != '?')
1434 FAIL("regexp *+ operand could be empty");
1439 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1441 if (op == '*' && (flags&SIMPLE)) {
1442 reginsert(STAR, ret);
1446 else if (op == '*') {
1449 } else if (op == '+' && (flags&SIMPLE)) {
1450 reginsert(PLUS, ret);
1454 else if (op == '+') {
1457 } else if (op == '?') {
1462 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1463 warn("%.*s matches null string many times",
1464 regcomp_parse - origparse, origparse);
1467 if (*regcomp_parse == '?') {
1469 reginsert(MINMOD, ret);
1470 regtail(ret, ret + NODE_STEP_REGNODE);
1472 if (ISMULT2(regcomp_parse))
1473 FAIL("nested *?+ in regexp");
1479 - regatom - the lowest level
1481 * Optimization: gobbles an entire sequence of ordinary characters so that
1482 * it can turn them into a single node, which is smaller to store and
1483 * faster to run. Backslashed characters are exceptions, each becoming a
1484 * separate node; the code is simpler that way and it's not worth fixing.
1486 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1491 register regnode *ret = 0;
1494 *flagp = WORST; /* Tentatively. */
1497 switch (*regcomp_parse) {
1501 if (regflags & PMf_MULTILINE)
1502 ret = reg_node(MBOL);
1503 else if (regflags & PMf_SINGLELINE)
1504 ret = reg_node(SBOL);
1506 ret = reg_node(BOL);
1509 if (regcomp_parse[1])
1512 if (regflags & PMf_MULTILINE)
1513 ret = reg_node(MEOL);
1514 else if (regflags & PMf_SINGLELINE)
1515 ret = reg_node(SEOL);
1517 ret = reg_node(EOL);
1521 if (regflags & PMf_SINGLELINE)
1522 ret = reg_node(SANY);
1524 ret = reg_node(ANY);
1526 *flagp |= HASWIDTH|SIMPLE;
1531 *flagp |= HASWIDTH|SIMPLE;
1535 ret = reg(1, &flags);
1537 if (flags & TRYAGAIN)
1541 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1545 if (flags & TRYAGAIN) {
1549 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1550 /* Supposed to be caught earlier. */
1553 if (!regcurly(regcomp_parse)) {
1561 FAIL("?+*{} follows nothing in regexp");
1564 switch (*++regcomp_parse) {
1567 ret = reg_node(SBOL);
1572 ret = reg_node(GPOS);
1573 regseen |= REG_SEEN_GPOS;
1578 ret = reg_node(SEOL);
1583 ret = reg_node(EOS);
1585 seen_zerolen++; /* Do not optimize RE away */
1589 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1590 *flagp |= HASWIDTH|SIMPLE;
1594 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1595 *flagp |= HASWIDTH|SIMPLE;
1600 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1606 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1611 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1612 *flagp |= HASWIDTH|SIMPLE;
1616 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1617 *flagp |= HASWIDTH|SIMPLE;
1621 ret = reg_node(DIGIT);
1622 *flagp |= HASWIDTH|SIMPLE;
1626 ret = reg_node(NDIGIT);
1627 *flagp |= HASWIDTH|SIMPLE;
1640 case '1': case '2': case '3': case '4':
1641 case '5': case '6': case '7': case '8': case '9':
1643 I32 num = atoi(regcomp_parse);
1645 if (num > 9 && num >= regnpar)
1648 if (!SIZE_ONLY && num > regcomp_rx->nparens)
1649 FAIL("reference to nonexistent group");
1651 ret = reganode((regflags & PMf_FOLD)
1652 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1655 while (isDIGIT(*regcomp_parse))
1663 if (regcomp_parse >= regxend)
1664 FAIL("trailing \\ in regexp");
1672 if (regflags & PMf_EXTENDED) {
1673 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1674 if (regcomp_parse < regxend)
1689 ret = reg_node((regflags & PMf_FOLD)
1690 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1692 s = (char *) OPERAND(ret);
1693 regc(0, s++); /* save spot for len */
1694 for (len = 0, p = regcomp_parse - 1;
1695 len < 127 && p < regxend;
1700 if (regflags & PMf_EXTENDED)
1701 p = regwhite(p, regxend);
1752 ender = scan_hex(++p, 2, &numlen);
1757 ender = UCHARAT(p++);
1758 ender = toCTRL(ender);
1760 case '0': case '1': case '2': case '3':case '4':
1761 case '5': case '6': case '7': case '8':case '9':
1763 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1764 ender = scan_oct(p, 3, &numlen);
1774 FAIL("trailing \\ in regexp");
1785 if (regflags & PMf_EXTENDED)
1786 p = regwhite(p, regxend);
1787 if (ISMULT2(p)) { /* Back off on ?+*. */
1799 regcomp_parse = p - 1;
1802 FAIL("internal disaster in regexp");
1808 *OPERAND(ret) = len;
1811 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1813 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1823 regwhite(char *p, char *e)
1828 else if (*p == '#') {
1831 } while (p < e && *p != '\n');
1842 register char *opnd, *s;
1844 register I32 lastclass = 1234;
1845 register I32 range = 0;
1846 register regnode *ret;
1850 s = opnd = (char *) OPERAND(regcode);
1851 ret = reg_node(ANYOF);
1852 for (Class = 0; Class < 33; Class++)
1854 if (*regcomp_parse == '^') { /* Complement of range. */
1858 *opnd |= ANYOF_INVERT;
1861 regcode += ANY_SKIP;
1862 if (regflags & PMf_FOLD)
1863 *opnd |= ANYOF_FOLD;
1864 if (regflags & PMf_LOCALE)
1865 *opnd |= ANYOF_LOCALE;
1867 regsize += ANY_SKIP;
1869 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1870 goto skipcond; /* allow 1st char to be ] or - */
1871 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1873 Class = UCHARAT(regcomp_parse++);
1874 if (Class == '[' && regcomp_parse + 1 < regxend &&
1875 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1876 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1877 char posixccc = *regcomp_parse;
1878 char* posixccs = regcomp_parse++;
1880 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1882 if (regcomp_parse == regxend)
1883 /* Grandfather lone [:, [=, [. */
1884 regcomp_parse = posixccs;
1886 regcomp_parse++; /* skip over the posixccc */
1887 if (*regcomp_parse == ']') {
1888 /* Not Implemented Yet.
1889 * (POSIX Extended Character Classes, that is)
1890 * The text between e.g. [: and :] would start
1891 * at posixccs + 1 and stop at regcomp_parse - 2. */
1892 if (dowarn && !SIZE_ONLY)
1893 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1894 regcomp_parse++; /* skip over the ending ] */
1898 if (Class == '\\') {
1899 Class = UCHARAT(regcomp_parse++);
1903 if (regflags & PMf_LOCALE)
1904 *opnd |= ANYOF_ALNUML;
1906 for (Class = 0; Class < 256; Class++)
1908 ANYOF_SET(opnd, Class);
1915 if (regflags & PMf_LOCALE)
1916 *opnd |= ANYOF_NALNUML;
1918 for (Class = 0; Class < 256; Class++)
1919 if (!isALNUM(Class))
1920 ANYOF_SET(opnd, Class);
1927 if (regflags & PMf_LOCALE)
1928 *opnd |= ANYOF_SPACEL;
1930 for (Class = 0; Class < 256; Class++)
1932 ANYOF_SET(opnd, Class);
1939 if (regflags & PMf_LOCALE)
1940 *opnd |= ANYOF_NSPACEL;
1942 for (Class = 0; Class < 256; Class++)
1943 if (!isSPACE(Class))
1944 ANYOF_SET(opnd, Class);
1951 for (Class = '0'; Class <= '9'; Class++)
1952 ANYOF_SET(opnd, Class);
1958 for (Class = 0; Class < '0'; Class++)
1959 ANYOF_SET(opnd, Class);
1960 for (Class = '9' + 1; Class < 256; Class++)
1961 ANYOF_SET(opnd, Class);
1987 Class = scan_hex(regcomp_parse, 2, &numlen);
1988 regcomp_parse += numlen;
1991 Class = UCHARAT(regcomp_parse++);
1992 Class = toCTRL(Class);
1994 case '0': case '1': case '2': case '3': case '4':
1995 case '5': case '6': case '7': case '8': case '9':
1996 Class = scan_oct(--regcomp_parse, 3, &numlen);
1997 regcomp_parse += numlen;
2002 if (lastclass > Class)
2003 FAIL("invalid [] range in regexp");
2008 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
2009 regcomp_parse[1] != ']') {
2012 continue; /* do it next time */
2016 for ( ; lastclass <= Class; lastclass++)
2017 ANYOF_SET(opnd, lastclass);
2021 if (*regcomp_parse != ']')
2022 FAIL("unmatched [] in regexp");
2024 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2025 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2026 for (Class = 0; Class < 256; ++Class) {
2027 if (ANYOF_TEST(opnd, Class)) {
2028 I32 cf = fold[Class];
2029 ANYOF_SET(opnd, cf);
2032 *opnd &= ~ANYOF_FOLD;
2034 /* optimize inverted simple patterns (e.g. [^a-z]) */
2035 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2036 for (Class = 0; Class < 32; ++Class)
2037 opnd[1 + Class] ^= 0xFF;
2046 char* retval = regcomp_parse++;
2049 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2050 regcomp_parse[2] == '#') {
2051 while (*regcomp_parse && *regcomp_parse != ')')
2056 if (regflags & PMf_EXTENDED) {
2057 if (isSPACE(*regcomp_parse)) {
2061 else if (*regcomp_parse == '#') {
2062 while (*regcomp_parse && *regcomp_parse != '\n')
2073 - reg_node - emit a node
2075 STATIC regnode * /* Location. */
2078 register regnode *ret;
2079 register regnode *ptr;
2083 SIZE_ALIGN(regsize);
2088 NODE_ALIGN_FILL(ret);
2090 FILL_ADVANCE_NODE(ptr, op);
2097 - reganode - emit a node with an argument
2099 STATIC regnode * /* Location. */
2100 reganode(U8 op, U32 arg)
2102 register regnode *ret;
2103 register regnode *ptr;
2107 SIZE_ALIGN(regsize);
2112 NODE_ALIGN_FILL(ret);
2114 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2121 - regc - emit (if appropriate) a byte of code
2131 - reginsert - insert an operator in front of already-emitted operand
2133 * Means relocating the operand.
2136 reginsert(U8 op, regnode *opnd)
2138 register regnode *src;
2139 register regnode *dst;
2140 register regnode *place;
2141 register int offset = regarglen[(U8)op];
2143 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2146 regsize += NODE_STEP_REGNODE + offset;
2151 regcode += NODE_STEP_REGNODE + offset;
2154 StructCopy(--src, --dst, regnode);
2156 place = opnd; /* Op node, where operand used to be. */
2157 src = NEXTOPER(place);
2158 FILL_ADVANCE_NODE(place, op);
2159 Zero(src, offset, regnode);
2163 - regtail - set the next-pointer at the end of a node chain of p to val.
2166 regtail(regnode *p, regnode *val)
2168 register regnode *scan;
2169 register regnode *temp;
2170 register I32 offset;
2175 /* Find last node. */
2178 temp = regnext(scan);
2184 if (reg_off_by_arg[OP(scan)]) {
2185 ARG_SET(scan, val - scan);
2187 NEXT_OFF(scan) = val - scan;
2192 - regoptail - regtail on operand of first argument; nop if operandless
2195 regoptail(regnode *p, regnode *val)
2197 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2198 if (p == NULL || SIZE_ONLY)
2200 if (regkind[(U8)OP(p)] == BRANCH) {
2201 regtail(NEXTOPER(p), val);
2202 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2203 regtail(NEXTOPER(NEXTOPER(p)), val);
2209 - regcurly - a little FSA that accepts {\d+,?\d*}
2212 regcurly(register char *s)
2231 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2234 register char op = EXACT; /* Arbitrary non-END op. */
2235 register regnode *next, *onode;
2237 while (op != END && (!last || node < last)) {
2238 /* While that wasn't END last time... */
2244 next = regnext(node);
2246 if (OP(node) == OPTIMIZED)
2249 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2250 2*l + 1, "", SvPVX(sv));
2251 if (next == NULL) /* Next ptr. */
2252 PerlIO_printf(Perl_debug_log, "(0)");
2254 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2255 (void)PerlIO_putc(Perl_debug_log, '\n');
2257 if (regkind[(U8)op] == BRANCHJ) {
2258 register regnode *nnode = (OP(next) == LONGJMP
2261 if (last && nnode > last)
2263 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2264 } else if (regkind[(U8)op] == BRANCH) {
2265 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2266 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2267 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2268 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2269 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2270 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2272 } else if ( op == PLUS || op == STAR) {
2273 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2274 } else if (op == ANYOF) {
2275 node = NEXTOPER(node);
2277 } else if (regkind[(U8)op] == EXACT) {
2278 /* Literal string, where present. */
2279 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2280 node = NEXTOPER(node);
2282 node = NEXTOPER(node);
2283 node += regarglen[(U8)op];
2285 if (op == CURLYX || op == OPEN)
2287 else if (op == WHILEM)
2290 #endif /* DEBUGGING */
2295 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2301 SV *sv = sv_newmortal();
2303 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2305 /* Header fields of interest. */
2306 if (r->anchored_substr)
2307 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2309 SvPVX(r->anchored_substr),
2311 SvTAIL(r->anchored_substr) ? "$" : "",
2312 r->anchored_offset);
2313 if (r->float_substr)
2314 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2316 SvPVX(r->float_substr),
2318 SvTAIL(r->float_substr) ? "$" : "",
2319 r->float_min_offset, r->float_max_offset);
2320 if (r->check_substr)
2321 PerlIO_printf(Perl_debug_log,
2322 r->check_substr == r->float_substr
2323 ? "(checking floating" : "(checking anchored");
2324 if (r->reganch & ROPT_NOSCAN)
2325 PerlIO_printf(Perl_debug_log, " noscan");
2326 if (r->reganch & ROPT_CHECK_ALL)
2327 PerlIO_printf(Perl_debug_log, " isall");
2328 if (r->check_substr)
2329 PerlIO_printf(Perl_debug_log, ") ");
2331 if (r->regstclass) {
2332 regprop(sv, r->regstclass);
2333 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2335 if (r->reganch & ROPT_ANCH) {
2336 PerlIO_printf(Perl_debug_log, "anchored");
2337 if (r->reganch & ROPT_ANCH_BOL)
2338 PerlIO_printf(Perl_debug_log, "(BOL)");
2339 if (r->reganch & ROPT_ANCH_MBOL)
2340 PerlIO_printf(Perl_debug_log, "(MBOL)");
2341 if (r->reganch & ROPT_ANCH_GPOS)
2342 PerlIO_printf(Perl_debug_log, "(GPOS)");
2343 PerlIO_putc(Perl_debug_log, ' ');
2345 if (r->reganch & ROPT_GPOS_SEEN)
2346 PerlIO_printf(Perl_debug_log, "GPOS ");
2347 if (r->reganch & ROPT_SKIP)
2348 PerlIO_printf(Perl_debug_log, "plus ");
2349 if (r->reganch & ROPT_IMPLICIT)
2350 PerlIO_printf(Perl_debug_log, "implicit ");
2351 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2352 if (r->reganch & ROPT_EVAL_SEEN)
2353 PerlIO_printf(Perl_debug_log, "with eval ");
2354 PerlIO_printf(Perl_debug_log, "\n");
2355 #endif /* DEBUGGING */
2359 - regprop - printable representation of opcode
2362 regprop(SV *sv, regnode *o)
2365 register char *p = 0;
2367 sv_setpvn(sv, "", 0);
2403 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2406 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2409 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2436 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2439 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2442 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2445 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2448 sv_catpvf(sv, "REF%d", ARG(o));
2451 sv_catpvf(sv, "REFF%d", ARG(o));
2454 sv_catpvf(sv, "REFFL%d", ARG(o));
2457 sv_catpvf(sv, "OPEN%d", ARG(o));
2460 sv_catpvf(sv, "CLOSE%d", ARG(o));
2476 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2479 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2530 sv_catpvf(sv, "GROUPP%d", ARG(o));
2545 FAIL("corrupted regexp opcode");
2549 #endif /* DEBUGGING */
2553 pregfree(struct regexp *r)
2555 if (!r || (--r->refcnt > 0))
2558 Safefree(r->precomp);
2560 Safefree(r->subbase);
2562 if (r->anchored_substr)
2563 SvREFCNT_dec(r->anchored_substr);
2564 if (r->float_substr)
2565 SvREFCNT_dec(r->float_substr);
2566 Safefree(r->substrs);
2569 int n = r->data->count;
2571 switch (r->data->what[n]) {
2573 SvREFCNT_dec((SV*)r->data->data[n]);
2576 op_free((OP_4tree*)r->data->data[n]);
2581 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2584 Safefree(r->data->what);
2587 Safefree(r->startp);
2593 - regnext - dig the "next" pointer out of a node
2595 * [Note, when REGALIGN is defined there are two places in regmatch()
2596 * that bypass this code for speed.]
2599 regnext(register regnode *p)
2601 register I32 offset;
2606 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2614 re_croak2(const char* pat1,const char* pat2,...)
2617 STRLEN l1 = strlen(pat1);
2618 STRLEN l2 = strlen(pat2);
2626 Copy(pat1, buf, l1 , char);
2627 Copy(pat2, buf + l1, l2 , char);
2628 buf[l1 + l2] = '\n';
2629 buf[l1 + l2 + 1] = '\0';
2630 va_start(args, pat2);
2631 message = mess(buf, &args);
2633 l1 = strlen(message);
2636 Copy(message, buf, l1 , char);
2637 buf[l1] = '\0'; /* Overwrite \n */