5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
8 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
9 * confused with the original package (see point 3 below). Thanks, Henry!
12 /* Additional note: this code is very heavily munged from Henry's version
13 * in places. In some spots I've traded clarity for efficiency, so don't
14 * blame Henry for some of the lack of readability.
17 /* The names of the functions have been changed from regcomp and
18 * regexec to pregcomp and pregexec in order to avoid conflicts
19 * with the POSIX routines of the same names.
24 * pregcomp and pregexec -- regsub and regerror are not used in perl
26 * Copyright (c) 1986 by University of Toronto.
27 * Written by Henry Spencer. Not derived from licensed software.
29 * Permission is granted to anyone to use this software for any
30 * purpose on any computer system, and to redistribute it freely,
31 * subject to the following restrictions:
33 * 1. The author is not responsible for the consequences of use of
34 * this software, no matter how awful, even if they arise
37 * 2. The origin of this software must not be misrepresented, either
38 * by explicit claim or by omission.
40 * 3. Altered versions must be plainly marked as such, and must not
41 * be misrepresented as being the original software.
44 **** Alterations to Henry's code are...
46 **** Copyright (c) 1991-1997, Larry Wall
48 **** You may distribute under the terms of either the GNU General Public
49 **** License or the Artistic License, as specified in the README file.
52 * Beware that some of this code is subtly aware of the way operator
53 * precedence is structured in regular expressions. Serious changes in
54 * regular-expression syntax might require a total rethink.
68 # if defined(BUGGY_MSC6)
69 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
70 # pragma optimize("a",off)
71 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
72 # pragma optimize("w",on )
73 # endif /* BUGGY_MSC6 */
80 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
81 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
82 ((*s) == '{' && regcurly(s)))
84 #define PERL_META "^$.[()|?+*\\"
86 #define META "^$.[()|?+*\\"
90 #undef SPSTART /* dratted cpp namespace... */
93 * Flags to be passed up and down.
95 #define WORST 0 /* Worst case. */
96 #define HASWIDTH 0x1 /* Known never to match null string. */
97 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
98 #define SPSTART 0x4 /* Starts with * or +. */
99 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
102 * Forward declarations for pregcomp()'s friends.
106 static regnode *reg _((I32, I32 *));
107 static regnode *reganode _((U8, U32));
108 static regnode *regatom _((I32 *));
109 static regnode *regbranch _((I32 *, I32));
110 static void regc _((U8, char *));
111 static regnode *regclass _((void));
112 STATIC I32 regcurly _((char *));
113 static regnode *reg_node _((U8));
114 static regnode *regpiece _((I32 *));
115 static void reginsert _((U8, regnode *));
116 static void regoptail _((regnode *, regnode *));
117 static void regtail _((regnode *, regnode *));
118 static char* regwhite _((char *, char *));
119 static char* nextchar _((void));
120 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
123 /* Length of a variant. */
132 I32 last_end; /* min value, <0 unless valid. */
135 SV **longest; /* Either &l_fixed, or &l_float. */
139 I32 offset_float_min;
140 I32 offset_float_max;
145 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
147 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
148 #define SF_BEFORE_SEOL 0x1
149 #define SF_BEFORE_MEOL 0x2
150 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
151 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
154 # define SF_FIX_SHIFT_EOL (0+2)
155 # define SF_FL_SHIFT_EOL (0+4)
157 # define SF_FIX_SHIFT_EOL (+2)
158 # define SF_FL_SHIFT_EOL (+4)
161 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
162 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
164 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
165 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
166 #define SF_IS_INF 0x40
167 #define SF_HAS_PAR 0x80
168 #define SF_IN_PAR 0x100
169 #define SF_HAS_EVAL 0x200
170 #define SCF_DO_SUBSTR 0x400
173 scan_commit(scan_data_t *data)
175 STRLEN l = SvCUR(data->last_found);
176 STRLEN old_l = SvCUR(*data->longest);
178 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
179 sv_setsv(*data->longest, data->last_found);
180 if (*data->longest == data->longest_fixed) {
181 data->offset_fixed = l ? data->last_start_min : data->pos_min;
182 if (data->flags & SF_BEFORE_EOL)
184 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
186 data->flags &= ~SF_FIX_BEFORE_EOL;
188 data->offset_float_min = l ? data->last_start_min : data->pos_min;
189 data->offset_float_max = (l
190 ? data->last_start_max
191 : data->pos_min + data->pos_delta);
192 if (data->flags & SF_BEFORE_EOL)
194 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
196 data->flags &= ~SF_FL_BEFORE_EOL;
199 SvCUR_set(data->last_found, 0);
201 data->flags &= ~SF_BEFORE_EOL;
204 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
205 to the position after last scanned or to NULL. */
208 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
209 /* scanp: Start here (read-write). */
210 /* deltap: Write maxlen-minlen here. */
211 /* last: Stop before this one. */
213 I32 min = 0, pars = 0, code;
214 regnode *scan = *scanp, *next;
216 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
217 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
218 scan_data_t data_fake;
220 while (scan && OP(scan) != END && scan < last) {
221 /* Peephole optimizer: */
223 if (regkind[(U8)OP(scan)] == EXACT) {
224 regnode *n = regnext(scan);
227 regnode *stop = scan;
230 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
231 /* Skip NOTHING, merge EXACT*. */
233 ( regkind[(U8)OP(n)] == NOTHING ||
234 (stringok && (OP(n) == OP(scan))))
236 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
237 if (OP(n) == TAIL || n > next)
239 if (regkind[(U8)OP(n)] == NOTHING) {
240 NEXT_OFF(scan) += NEXT_OFF(n);
241 next = n + NODE_STEP_REGNODE;
248 int oldl = *OPERAND(scan);
249 regnode *nnext = regnext(n);
251 if (oldl + *OPERAND(n) > U8_MAX)
253 NEXT_OFF(scan) += NEXT_OFF(n);
254 *OPERAND(scan) += *OPERAND(n);
255 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
256 /* Now we can overwrite *n : */
257 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
258 *OPERAND(n) + 1, char);
268 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
270 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
279 if (OP(scan) != CURLYX) {
280 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
281 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
285 /* Skip NOTHING and LONGJMP. */
286 while ((n = regnext(n))
287 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
288 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
291 if (reg_off_by_arg[OP(scan)])
294 NEXT_OFF(scan) = off;
296 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
297 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
298 next = regnext(scan);
301 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
302 I32 max1 = 0, min1 = I32_MAX, num = 0;
304 if (flags & SCF_DO_SUBSTR)
306 while (OP(scan) == code) {
307 I32 deltanext, minnext;
311 next = regnext(scan);
312 scan = NEXTOPER(scan);
314 scan = NEXTOPER(scan);
315 /* We suppose the run is continuous, last=next...*/
316 minnext = study_chunk(&scan, &deltanext, next,
320 if (max1 < minnext + deltanext)
321 max1 = minnext + deltanext;
322 if (deltanext == I32_MAX)
325 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
327 if (data && (data_fake.flags & SF_HAS_EVAL))
328 data->flags |= SF_HAS_EVAL;
332 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
334 if (flags & SCF_DO_SUBSTR) {
335 data->pos_min += min1;
336 data->pos_delta += max1 - min1;
337 if (max1 != min1 || is_inf)
338 data->longest = &(data->longest_float);
341 delta += max1 - min1;
342 } else if (code == BRANCHJ) /* single branch is optimized. */
343 scan = NEXTOPER(NEXTOPER(scan));
344 else /* single branch is optimized. */
345 scan = NEXTOPER(scan);
347 } else if (OP(scan) == EXACT) {
348 min += *OPERAND(scan);
349 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
350 I32 l = *OPERAND(scan);
352 /* The code below prefers earlier match for fixed
353 offset, later match for variable offset. */
354 if (data->last_end == -1) { /* Update the start info. */
355 data->last_start_min = data->pos_min;
356 data->last_start_max = is_inf
357 ? I32_MAX : data->pos_min + data->pos_delta;
359 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
360 data->last_end = data->pos_min + l;
361 data->pos_min += l; /* As in the first entry. */
362 data->flags &= ~SF_BEFORE_EOL;
364 } else if (regkind[(U8)OP(scan)] == EXACT) {
365 if (flags & SCF_DO_SUBSTR)
367 min += *OPERAND(scan);
368 if (data && (flags & SCF_DO_SUBSTR))
369 data->pos_min += *OPERAND(scan);
370 } else if (strchr(varies,OP(scan))) {
371 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
372 regnode *oscan = scan;
374 switch (regkind[(U8)OP(scan)]) {
376 scan = NEXTOPER(scan);
379 if (flags & SCF_DO_SUBSTR) {
380 next = NEXTOPER(scan);
381 if (OP(next) == EXACT) {
383 maxcount = REG_INFTY;
384 next = regnext(scan);
385 scan = NEXTOPER(scan);
389 if (flags & SCF_DO_SUBSTR)
395 scan = regnext(scan);
396 if (flags & SCF_DO_SUBSTR) {
398 data->longest = &(data->longest_float);
400 goto optimize_curly_tail;
402 mincount = ARG1(scan);
403 maxcount = ARG2(scan);
404 next = regnext(scan);
405 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
407 if (flags & SCF_DO_SUBSTR) {
408 if (mincount == 0) scan_commit(data);
409 pos_before = data->pos_min;
413 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
415 data->flags |= SF_IS_INF;
417 /* This will finish on WHILEM, setting scan, or on NULL: */
418 minnext = study_chunk(&scan, &deltanext, last, data,
420 ? (flags & ~SCF_DO_SUBSTR) : flags);
421 if (!scan) /* It was not CURLYX, but CURLY. */
423 if (dowarn && (minnext + deltanext == 0)
424 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
425 warn("Strange *+?{} on zero-length expression");
426 min += minnext * mincount;
427 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
428 || deltanext == I32_MAX);
429 delta += (minnext + deltanext) * maxcount - minnext * mincount;
431 /* Try powerful optimization CURLYX => CURLYN. */
432 #ifdef REGALIGN_STRUCT
433 if ( OP(oscan) == CURLYX && data
434 && data->flags & SF_IN_PAR
435 && !(data->flags & SF_HAS_EVAL)
436 && !deltanext && minnext == 1 ) {
437 /* Try to optimize to CURLYN. */
438 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
439 regnode *nxt1 = nxt, *nxt2;
443 if (!strchr(simple,OP(nxt))
444 && !(regkind[(U8)OP(nxt)] == EXACT
445 && *OPERAND(nxt) == 1))
449 if (OP(nxt) != CLOSE)
451 /* Now we know that nxt2 is the only contents: */
452 oscan->flags = ARG(nxt);
454 OP(nxt1) = NOTHING; /* was OPEN. */
456 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
457 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
458 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
459 OP(nxt) = OPTIMIZED; /* was CLOSE. */
460 OP(nxt + 1) = OPTIMIZED; /* was count. */
461 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
467 /* Try optimization CURLYX => CURLYM. */
468 if ( OP(oscan) == CURLYX && data
469 #ifdef REGALIGN_STRUCT
470 && !(data->flags & SF_HAS_PAR)
472 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
474 && !(data->flags & SF_HAS_EVAL)
476 /* XXXX How to optimize if data == 0? */
477 /* Optimize to a simpler form. */
478 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
482 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
483 && (OP(nxt2) != WHILEM))
485 OP(nxt2) = SUCCEED; /* Whas WHILEM */
486 #ifdef REGALIGN_STRUCT
487 /* Need to optimize away parenths. */
488 if (data->flags & SF_IN_PAR) {
489 /* Set the parenth number. */
490 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
492 if (OP(nxt) != CLOSE)
493 FAIL("panic opt close");
494 oscan->flags = ARG(nxt);
495 OP(nxt1) = OPTIMIZED; /* was OPEN. */
496 OP(nxt) = OPTIMIZED; /* was CLOSE. */
498 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
499 OP(nxt + 1) = OPTIMIZED; /* was count. */
500 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
501 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
504 while ( nxt1 && (OP(nxt1) != WHILEM)) {
505 regnode *nnxt = regnext(nxt1);
508 if (reg_off_by_arg[OP(nxt1)])
509 ARG_SET(nxt1, nxt2 - nxt1);
510 else if (nxt2 - nxt1 < U16_MAX)
511 NEXT_OFF(nxt1) = nxt2 - nxt1;
513 OP(nxt) = NOTHING; /* Cannot beautify */
518 /* Optimize again: */
519 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
524 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
526 if (flags & SCF_DO_SUBSTR) {
527 SV *last_str = Nullsv;
528 int counted = mincount != 0;
530 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
531 I32 b = pos_before >= data->last_start_min
532 ? pos_before : data->last_start_min;
534 char *s = SvPV(data->last_found, l);
536 l -= b - data->last_start_min;
537 /* Get the added string: */
538 last_str = newSVpv(s + b - data->last_start_min, l);
539 if (deltanext == 0 && pos_before == b) {
540 /* What was added is a constant string */
542 SvGROW(last_str, (mincount * l) + 1);
543 repeatcpy(SvPVX(last_str) + l,
544 SvPVX(last_str), l, mincount - 1);
545 SvCUR(last_str) *= mincount;
546 /* Add additional parts. */
547 SvCUR_set(data->last_found,
548 SvCUR(data->last_found) - l);
549 sv_catsv(data->last_found, last_str);
550 data->last_end += l * (mincount - 1);
554 /* It is counted once already... */
555 data->pos_min += minnext * (mincount - counted);
556 data->pos_delta += - counted * deltanext +
557 (minnext + deltanext) * maxcount - minnext * mincount;
558 if (mincount != maxcount) {
560 if (mincount && last_str) {
561 sv_setsv(data->last_found, last_str);
562 data->last_end = data->pos_min;
563 data->last_start_min =
564 data->pos_min - SvCUR(last_str);
565 data->last_start_max = is_inf
567 : data->pos_min + data->pos_delta
570 data->longest = &(data->longest_float);
573 if (data && (fl & SF_HAS_EVAL))
574 data->flags |= SF_HAS_EVAL;
577 if (OP(oscan) != CURLYX) {
578 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
580 NEXT_OFF(oscan) += NEXT_OFF(next);
584 default: /* REF only? */
585 if (flags & SCF_DO_SUBSTR) {
587 data->longest = &(data->longest_float);
592 } else if (strchr(simple,OP(scan))) {
593 if (flags & SCF_DO_SUBSTR) {
598 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
599 data->flags |= (OP(scan) == MEOL
602 } else if (regkind[(U8)OP(scan)] == BRANCHJ
603 && (scan->flags || data)
604 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
605 I32 deltanext, minnext;
609 next = regnext(scan);
610 nscan = NEXTOPER(NEXTOPER(scan));
611 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
614 FAIL("variable length lookbehind not implemented");
615 } else if (minnext > U8_MAX) {
616 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
618 scan->flags = minnext;
620 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
622 if (data && (data_fake.flags & SF_HAS_EVAL))
623 data->flags |= SF_HAS_EVAL;
624 } else if (OP(scan) == OPEN) {
626 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
627 #ifdef REGALIGN_STRUCT
628 next = regnext(scan);
630 if ( next && (OP(next) != WHILEM) && next < last)
632 is_par = 0; /* Disable optimization */
633 } else if (OP(scan) == EVAL) {
635 data->flags |= SF_HAS_EVAL;
637 /* Else: zero-length, ignore. */
638 scan = regnext(scan);
643 *deltap = is_inf ? I32_MAX : delta;
644 if (flags & SCF_DO_SUBSTR && is_inf)
645 data->pos_delta = I32_MAX - data->pos_min;
648 if (is_par && pars==1 && data) {
649 data->flags |= SF_IN_PAR;
650 data->flags &= ~SF_HAS_PAR;
651 } else if (pars && data) {
652 data->flags |= SF_HAS_PAR;
653 data->flags &= ~SF_IN_PAR;
659 add_data(I32 n, char *s)
661 if (regcomp_rx->data) {
662 Renewc(regcomp_rx->data,
663 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
664 char, struct reg_data);
665 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
666 regcomp_rx->data->count += n;
668 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
669 char, struct reg_data);
670 New(1208, regcomp_rx->data->what, n, U8);
671 regcomp_rx->data->count = n;
673 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
674 return regcomp_rx->data->count - n;
678 - pregcomp - compile a regular expression into internal code
680 * We can't allocate space until we know how big the compiled form will be,
681 * but we can't compile it (and thus know how big it is) until we've got a
682 * place to put the code. So we cheat: we compile it twice, once with code
683 * generation turned off and size counting turned on, and once "for real".
684 * This also means that we don't allocate space until we are sure that the
685 * thing really will compile successfully, and we never have to move the
686 * code and thus invalidate pointers into it. (Note that it has to be in
687 * one piece because free() must be able to free it all.) [NB: not true in perl]
689 * Beware that the optimization-preparation code in here knows about some
690 * of the structure of the compiled regexp. [I'll say.]
693 pregcomp(char *exp, char *xend, PMOP *pm)
707 FAIL("NULL regexp argument");
709 regprecomp = savepvn(exp, xend - exp);
710 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
711 xend - exp, regprecomp));
712 regflags = pm->op_pmflags;
716 seen_zerolen = *exp == '^' ? -1 : 0;
719 /* First pass: determine size, legality. */
726 regc((U8)MAGIC, (char*)regcode);
727 if (reg(0, &flags) == NULL) {
728 Safefree(regprecomp);
732 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
737 char *s = PerlEnv_getenv("TERMCAP_COLORS");
741 colors[0] = s = savepv(s);
745 FAIL("Not enough TABs in TERMCAP_COLORS");
754 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
755 colors[0],colors[1],colors[2],colors[3]);
759 /* Small enough for pointer-storage convention?
760 If extralen==0, this means that we will not need long jumps. */
761 #ifndef REGALIGN_STRUCT
762 if (regsize >= 0x10000L && extralen)
763 FAIL("regexp too big");
765 if (regsize >= 0x10000L && extralen)
771 /* Allocate space and initialize. */
772 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
775 FAIL("regexp out of space");
777 r->prelen = xend - exp;
778 r->precomp = regprecomp;
779 r->subbeg = r->subbase = NULL;
782 /* Second pass: emit code. */
787 regcode = r->program;
788 regc((U8)MAGIC, (char*) regcode++);
790 if (reg(0, &flags) == NULL)
793 /* Dig out information for optimizations. */
794 pm->op_pmflags = regflags;
796 r->regstclass = NULL;
797 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
798 scan = r->program + 1; /* First BRANCH. */
800 /* XXXX To minimize changes to RE engine we always allocate
801 3-units-long substrs field. */
802 Newz(1004, r->substrs, 1, struct reg_substr_data);
804 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
807 STRLEN longest_float_length, longest_fixed_length;
809 StructCopy(&zero_scan_data, &data, scan_data_t);
811 /* Skip introductions and multiplicators >= 1. */
812 while ((OP(first) == OPEN && (sawopen = 1)) ||
813 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
814 (OP(first) == PLUS) ||
815 (OP(first) == MINMOD) ||
816 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
817 if (OP(first) == PLUS)
820 first += regarglen[(U8)OP(first)];
821 first = NEXTOPER(first);
824 /* Starting-point info. */
826 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
827 else if (strchr(simple+2,OP(first)))
828 r->regstclass = first;
829 else if (regkind[(U8)OP(first)] == BOUND ||
830 regkind[(U8)OP(first)] == NBOUND)
831 r->regstclass = first;
832 else if (regkind[(U8)OP(first)] == BOL) {
833 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
834 first = NEXTOPER(first);
837 else if (OP(first) == GPOS) {
838 r->reganch |= ROPT_ANCH_GPOS;
839 first = NEXTOPER(first);
842 else if ((OP(first) == STAR &&
843 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
844 !(r->reganch & ROPT_ANCH) )
846 /* turn .* into ^.* with an implied $*=1 */
847 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
848 first = NEXTOPER(first);
851 if (sawplus && (!sawopen || !regsawback))
852 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
854 /* Scan is after the zeroth branch, first is atomic matcher. */
855 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
858 * If there's something expensive in the r.e., find the
859 * longest literal string that must appear and make it the
860 * regmust. Resolve ties in favor of later strings, since
861 * the regstart check works with the beginning of the r.e.
862 * and avoiding duplication strengthens checking. Not a
863 * strong reason, but sufficient in the absence of others.
864 * [Now we resolve ties in favor of the earlier string if
865 * it happens that c_offset_min has been invalidated, since the
866 * earlier string may buy us something the later one won't.]
870 data.longest_fixed = newSVpv("",0);
871 data.longest_float = newSVpv("",0);
872 data.last_found = newSVpv("",0);
873 data.longest = &(data.longest_fixed);
876 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
877 &data, SCF_DO_SUBSTR);
878 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
879 && data.last_start_min == 0 && data.last_end > 0
881 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
882 r->reganch |= ROPT_CHECK_ALL;
884 SvREFCNT_dec(data.last_found);
886 longest_float_length = SvCUR(data.longest_float);
887 if (longest_float_length
888 || (data.flags & SF_FL_BEFORE_EOL
889 && (!(data.flags & SF_FL_BEFORE_MEOL)
890 || (regflags & PMf_MULTILINE)))) {
891 if (SvCUR(data.longest_fixed)
892 && data.offset_fixed == data.offset_float_min)
893 goto remove; /* Like in (a)+. */
895 r->float_substr = data.longest_float;
896 r->float_min_offset = data.offset_float_min;
897 r->float_max_offset = data.offset_float_max;
898 fbm_compile(r->float_substr, 0);
899 BmUSEFUL(r->float_substr) = 100;
900 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
901 && (!(data.flags & SF_FL_BEFORE_MEOL)
902 || (regflags & PMf_MULTILINE)))
903 SvTAIL_on(r->float_substr);
906 r->float_substr = Nullsv;
907 SvREFCNT_dec(data.longest_float);
908 longest_float_length = 0;
911 longest_fixed_length = SvCUR(data.longest_fixed);
912 if (longest_fixed_length
913 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
914 && (!(data.flags & SF_FIX_BEFORE_MEOL)
915 || (regflags & PMf_MULTILINE)))) {
916 r->anchored_substr = data.longest_fixed;
917 r->anchored_offset = data.offset_fixed;
918 fbm_compile(r->anchored_substr, 0);
919 BmUSEFUL(r->anchored_substr) = 100;
920 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
921 && (!(data.flags & SF_FIX_BEFORE_MEOL)
922 || (regflags & PMf_MULTILINE)))
923 SvTAIL_on(r->anchored_substr);
925 r->anchored_substr = Nullsv;
926 SvREFCNT_dec(data.longest_fixed);
927 longest_fixed_length = 0;
930 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
931 if (longest_fixed_length > longest_float_length) {
932 r->check_substr = r->anchored_substr;
933 r->check_offset_min = r->check_offset_max = r->anchored_offset;
934 if (r->reganch & ROPT_ANCH_SINGLE)
935 r->reganch |= ROPT_NOSCAN;
937 r->check_substr = r->float_substr;
938 r->check_offset_min = data.offset_float_min;
939 r->check_offset_max = data.offset_float_max;
942 /* Several toplevels. Best we can is to set minlen. */
945 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
946 scan = r->program + 1;
947 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
948 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
951 r->nparens = regnpar - 1;
953 if (regseen & REG_SEEN_GPOS)
954 r->reganch |= ROPT_GPOS_SEEN;
955 if (regseen & REG_SEEN_LOOKBEHIND)
956 r->reganch |= ROPT_LOOKBEHIND_SEEN;
957 if (regseen & REG_SEEN_EVAL)
958 r->reganch |= ROPT_EVAL_SEEN;
959 Newz(1002, r->startp, regnpar, char*);
960 Newz(1002, r->endp, regnpar, char*);
966 - reg - regular expression, i.e. main body or parenthesized thing
968 * Caller must absorb opening parenthesis.
970 * Combining parenthesis handling with the base level of regular expression
971 * is a trifle forced, but the need to tie the tails of the branches to what
972 * follows makes it hard to avoid.
975 reg(I32 paren, I32 *flagp)
976 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
978 register regnode *ret; /* Will be the head of the group. */
979 register regnode *br;
980 register regnode *lastbr;
981 register regnode *ender = 0;
982 register I32 parno = 0;
983 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
986 *flagp = HASWIDTH; /* Tentatively. */
988 /* Make an OPEN node, if parenthesized. */
990 if (*regcomp_parse == '?') {
992 paren = *regcomp_parse++;
993 ret = NULL; /* For look-ahead/behind. */
996 #ifndef REGALIGN_STRUCT
997 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
999 regseen |= REG_SEEN_LOOKBEHIND;
1000 if (*regcomp_parse == '!')
1002 if (*regcomp_parse != '=' && *regcomp_parse != '!')
1013 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1016 while (*regcomp_parse && *regcomp_parse != ')')
1018 if (*regcomp_parse != ')')
1019 FAIL("Sequence (?#... not terminated");
1026 I32 count = 1, n = 0;
1028 char *s = regcomp_parse;
1030 OP_4tree *sop, *rop;
1033 regseen |= REG_SEEN_EVAL;
1034 while (count && (c = *regcomp_parse)) {
1035 if (c == '\\' && regcomp_parse[1])
1043 if (*regcomp_parse != ')')
1044 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1048 if (regcomp_parse - 1 - s)
1049 sv = newSVpv(s, regcomp_parse - 1 - s);
1051 sv = newSVpv("", 0);
1053 rop = sv_compile_2op(sv, &sop, "re", &av);
1055 n = add_data(3, "nso");
1056 regcomp_rx->data->data[n] = (void*)rop;
1057 regcomp_rx->data->data[n+1] = (void*)av;
1058 regcomp_rx->data->data[n+2] = (void*)sop;
1060 } else { /* First pass */
1062 FAIL("Eval-group in insecure regular expression");
1066 return reganode(EVAL, n);
1070 if (regcomp_parse[0] == '?') {
1071 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1072 || regcomp_parse[1] == '<'
1073 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1076 ret = reg_node(LOGICAL);
1077 regtail(ret, reg(1, &flag));
1080 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1081 parno = atoi(regcomp_parse++);
1083 while (isDIGIT(*regcomp_parse))
1085 ret = reganode(GROUPP, parno);
1086 if ((c = *nextchar()) != ')')
1087 FAIL2("Switch (?(number%c not recognized", c);
1089 regtail(ret, reganode(IFTHEN, 0));
1090 br = regbranch(&flags, 1);
1092 br = reganode(LONGJMP, 0);
1094 regtail(br, reganode(LONGJMP, 0));
1097 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1098 regbranch(&flags, 1);
1099 regtail(ret, lastbr);
1104 FAIL("Switch (?(condition)... contains too many branches");
1105 ender = reg_node(TAIL);
1108 regtail(lastbr, ender);
1109 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1111 regtail(ret, ender);
1114 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1118 FAIL("Sequence (? incomplete");
1122 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1123 if (*regcomp_parse != 'o')
1124 pmflag(®flags, *regcomp_parse);
1128 if (*regcomp_parse != ')')
1129 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1138 ret = reganode(OPEN, parno);
1144 /* Pick up the branches, linking them together. */
1145 br = regbranch(&flags, 1);
1148 if (*regcomp_parse == '|') {
1149 if (!SIZE_ONLY && extralen) {
1150 reginsert(BRANCHJ, br);
1152 reginsert(BRANCH, br);
1155 extralen += 1; /* For BRANCHJ-BRANCH. */
1156 } else if (paren == ':') {
1157 *flagp |= flags&SIMPLE;
1159 if (open) { /* Starts with OPEN. */
1160 regtail(ret, br); /* OPEN -> first. */
1161 } else if (paren != '?') /* Not Conditional */
1163 if (!(flags&HASWIDTH))
1164 *flagp &= ~HASWIDTH;
1165 *flagp |= flags&SPSTART;
1167 while (*regcomp_parse == '|') {
1168 if (!SIZE_ONLY && extralen) {
1169 ender = reganode(LONGJMP,0);
1170 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1173 extralen += 2; /* Account for LONGJMP. */
1175 br = regbranch(&flags, 0);
1178 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1180 if (!(flags&HASWIDTH))
1181 *flagp &= ~HASWIDTH;
1182 *flagp |= flags&SPSTART;
1185 if (have_branch || paren != ':') {
1186 /* Make a closing node, and hook it on the end. */
1189 ender = reg_node(TAIL);
1192 ender = reganode(CLOSE, parno);
1199 ender = reg_node(SUCCEED);
1200 *flagp &= ~HASWIDTH;
1203 ender = reg_node(END);
1206 regtail(lastbr, ender);
1209 /* Hook the tails of the branches to the closing node. */
1210 for (br = ret; br != NULL; br = regnext(br)) {
1211 regoptail(br, ender);
1218 static char parens[] = "=!<,>";
1220 if (paren && (p = strchr(parens, paren))) {
1221 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1222 int flag = (p - parens) > 1;
1225 node = SUSPEND, flag = 0;
1226 reginsert(node,ret);
1227 #ifdef REGALIGN_STRUCT
1230 regtail(ret, reg_node(TAIL));
1234 /* Check for proper termination. */
1235 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1236 FAIL("unmatched () in regexp");
1237 } else if (!paren && regcomp_parse < regxend) {
1238 if (*regcomp_parse == ')') {
1239 FAIL("unmatched () in regexp");
1241 FAIL("junk on end of regexp"); /* "Can't happen". */
1245 regflags = oregflags;
1252 - regbranch - one alternative of an | operator
1254 * Implements the concatenation operator.
1257 regbranch(I32 *flagp, I32 first)
1259 register regnode *ret;
1260 register regnode *chain = NULL;
1261 register regnode *latest;
1262 I32 flags = 0, c = 0;
1267 if (!SIZE_ONLY && extralen)
1268 ret = reganode(BRANCHJ,0);
1270 ret = reg_node(BRANCH);
1273 if (!first && SIZE_ONLY)
1274 extralen += 1; /* BRANCHJ */
1276 *flagp = WORST; /* Tentatively. */
1280 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1282 latest = regpiece(&flags);
1283 if (latest == NULL) {
1284 if (flags & TRYAGAIN)
1287 } else if (ret == NULL)
1289 *flagp |= flags&HASWIDTH;
1290 if (chain == NULL) /* First piece. */
1291 *flagp |= flags&SPSTART;
1294 regtail(chain, latest);
1299 if (chain == NULL) { /* Loop ran zero times. */
1300 chain = reg_node(NOTHING);
1305 *flagp |= flags&SIMPLE;
1312 - regpiece - something followed by possible [*+?]
1314 * Note that the branching code sequences used for ? and the general cases
1315 * of * and + are somewhat optimized: they use the same NOTHING node as
1316 * both the endmarker for their branch list and the body of the last branch.
1317 * It might seem that this node could be dispensed with entirely, but the
1318 * endmarker role is not redundant.
1321 regpiece(I32 *flagp)
1323 register regnode *ret;
1325 register char *next;
1327 char *origparse = regcomp_parse;
1330 I32 max = REG_INFTY;
1332 ret = regatom(&flags);
1334 if (flags & TRYAGAIN)
1339 op = *regcomp_parse;
1341 if (op == '{' && regcurly(regcomp_parse)) {
1342 next = regcomp_parse + 1;
1344 while (isDIGIT(*next) || *next == ',') {
1353 if (*next == '}') { /* got one */
1357 min = atoi(regcomp_parse);
1361 maxpos = regcomp_parse;
1363 if (!max && *maxpos != '0')
1364 max = REG_INFTY; /* meaning "infinity" */
1365 else if (max >= REG_INFTY)
1366 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1367 regcomp_parse = next;
1371 if ((flags&SIMPLE)) {
1372 regnaughty += 2 + regnaughty / 2;
1373 reginsert(CURLY, ret);
1376 regnaughty += 4 + regnaughty; /* compound interest */
1377 regtail(ret, reg_node(WHILEM));
1378 if (!SIZE_ONLY && extralen) {
1379 reginsert(LONGJMP,ret);
1380 reginsert(NOTHING,ret);
1381 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1383 reginsert(CURLYX,ret);
1384 if (!SIZE_ONLY && extralen)
1385 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1386 regtail(ret, reg_node(NOTHING));
1390 #ifdef REGALIGN_STRUCT
1395 *flagp = (WORST|HASWIDTH);
1396 if (max && max < min)
1397 FAIL("Can't do {n,m} with n > m");
1412 #if 0 /* Now runtime fix should be reliable. */
1413 if (!(flags&HASWIDTH) && op != '?')
1414 FAIL("regexp *+ operand could be empty");
1419 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1421 if (op == '*' && (flags&SIMPLE)) {
1422 reginsert(STAR, ret);
1423 #ifdef REGALIGN_STRUCT
1428 else if (op == '*') {
1431 } else if (op == '+' && (flags&SIMPLE)) {
1432 reginsert(PLUS, ret);
1433 #ifdef REGALIGN_STRUCT
1438 else if (op == '+') {
1441 } else if (op == '?') {
1446 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1447 warn("%.*s matches null string many times",
1448 regcomp_parse - origparse, origparse);
1451 if (*regcomp_parse == '?') {
1453 reginsert(MINMOD, ret);
1455 regtail(ret, ret + NODE_STEP_REGNODE);
1457 regtail(ret, ret + 3);
1460 if (ISMULT2(regcomp_parse))
1461 FAIL("nested *?+ in regexp");
1467 - regatom - the lowest level
1469 * Optimization: gobbles an entire sequence of ordinary characters so that
1470 * it can turn them into a single node, which is smaller to store and
1471 * faster to run. Backslashed characters are exceptions, each becoming a
1472 * separate node; the code is simpler that way and it's not worth fixing.
1474 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1479 register regnode *ret = 0;
1482 *flagp = WORST; /* Tentatively. */
1485 switch (*regcomp_parse) {
1489 if (regflags & PMf_MULTILINE)
1490 ret = reg_node(MBOL);
1491 else if (regflags & PMf_SINGLELINE)
1492 ret = reg_node(SBOL);
1494 ret = reg_node(BOL);
1497 if (regcomp_parse[1])
1500 if (regflags & PMf_MULTILINE)
1501 ret = reg_node(MEOL);
1502 else if (regflags & PMf_SINGLELINE)
1503 ret = reg_node(SEOL);
1505 ret = reg_node(EOL);
1509 if (regflags & PMf_SINGLELINE)
1510 ret = reg_node(SANY);
1512 ret = reg_node(ANY);
1514 *flagp |= HASWIDTH|SIMPLE;
1519 *flagp |= HASWIDTH|SIMPLE;
1523 ret = reg(1, &flags);
1525 if (flags & TRYAGAIN)
1529 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1533 if (flags & TRYAGAIN) {
1537 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1538 /* Supposed to be caught earlier. */
1541 if (!regcurly(regcomp_parse)) {
1549 FAIL("?+*{} follows nothing in regexp");
1552 switch (*++regcomp_parse) {
1555 ret = reg_node(SBOL);
1560 ret = reg_node(GPOS);
1561 regseen |= REG_SEEN_GPOS;
1566 ret = reg_node(SEOL);
1571 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1572 *flagp |= HASWIDTH|SIMPLE;
1576 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1577 *flagp |= HASWIDTH|SIMPLE;
1582 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1588 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1593 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1594 *flagp |= HASWIDTH|SIMPLE;
1598 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1599 *flagp |= HASWIDTH|SIMPLE;
1603 ret = reg_node(DIGIT);
1604 *flagp |= HASWIDTH|SIMPLE;
1608 ret = reg_node(NDIGIT);
1609 *flagp |= HASWIDTH|SIMPLE;
1622 case '1': case '2': case '3': case '4':
1623 case '5': case '6': case '7': case '8': case '9':
1625 I32 num = atoi(regcomp_parse);
1627 if (num > 9 && num >= regnpar)
1631 ret = reganode((regflags & PMf_FOLD)
1632 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1635 while (isDIGIT(*regcomp_parse))
1643 if (regcomp_parse >= regxend)
1644 FAIL("trailing \\ in regexp");
1652 if (regflags & PMf_EXTENDED) {
1653 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1654 if (regcomp_parse < regxend)
1669 ret = reg_node((regflags & PMf_FOLD)
1670 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1672 s = (char *) OPERAND(ret);
1673 regc(0, s++); /* save spot for len */
1674 for (len = 0, p = regcomp_parse - 1;
1675 len < 127 && p < regxend;
1680 if (regflags & PMf_EXTENDED)
1681 p = regwhite(p, regxend);
1731 ender = scan_hex(++p, 2, &numlen);
1736 ender = UCHARAT(p++);
1737 ender = toCTRL(ender);
1739 case '0': case '1': case '2': case '3':case '4':
1740 case '5': case '6': case '7': case '8':case '9':
1742 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1743 ender = scan_oct(p, 3, &numlen);
1753 FAIL("trailing \\ in regexp");
1764 if (regflags & PMf_EXTENDED)
1765 p = regwhite(p, regxend);
1766 if (ISMULT2(p)) { /* Back off on ?+*. */
1778 regcomp_parse = p - 1;
1781 FAIL("internal disaster in regexp");
1787 *OPERAND(ret) = len;
1790 #ifdef REGALIGN_STRUCT
1791 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1794 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1804 regwhite(char *p, char *e)
1809 else if (*p == '#') {
1812 } while (p < e && *p != '\n');
1823 register char *opnd, *s;
1825 register I32 lastclass = 1234;
1826 register I32 range = 0;
1827 register regnode *ret;
1831 s = opnd = (char *) OPERAND(regcode);
1832 ret = reg_node(ANYOF);
1833 for (Class = 0; Class < 33; Class++)
1835 if (*regcomp_parse == '^') { /* Complement of range. */
1839 *opnd |= ANYOF_INVERT;
1842 regcode += ANY_SKIP;
1843 if (regflags & PMf_FOLD)
1844 *opnd |= ANYOF_FOLD;
1845 if (regflags & PMf_LOCALE)
1846 *opnd |= ANYOF_LOCALE;
1848 regsize += ANY_SKIP;
1850 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1851 goto skipcond; /* allow 1st char to be ] or - */
1852 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1854 Class = UCHARAT(regcomp_parse++);
1855 if (Class == '[' && regcomp_parse + 1 < regxend &&
1856 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1857 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1858 char posixccc = *regcomp_parse;
1859 char* posixccs = regcomp_parse++;
1861 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1863 if (regcomp_parse == regxend)
1864 /* Grandfather lone [:, [=, [. */
1865 regcomp_parse = posixccs;
1867 regcomp_parse++; /* skip over the posixccc */
1868 if (*regcomp_parse == ']') {
1869 /* Not Implemented Yet.
1870 * (POSIX Extended Character Classes, that is)
1871 * The text between e.g. [: and :] would start
1872 * at posixccs + 1 and stop at regcomp_parse - 2. */
1873 if (dowarn && !SIZE_ONLY)
1874 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1875 regcomp_parse++; /* skip over the ending ] */
1879 if (Class == '\\') {
1880 Class = UCHARAT(regcomp_parse++);
1884 if (regflags & PMf_LOCALE)
1885 *opnd |= ANYOF_ALNUML;
1887 for (Class = 0; Class < 256; Class++)
1889 ANYOF_SET(opnd, Class);
1896 if (regflags & PMf_LOCALE)
1897 *opnd |= ANYOF_NALNUML;
1899 for (Class = 0; Class < 256; Class++)
1900 if (!isALNUM(Class))
1901 ANYOF_SET(opnd, Class);
1908 if (regflags & PMf_LOCALE)
1909 *opnd |= ANYOF_SPACEL;
1911 for (Class = 0; Class < 256; Class++)
1913 ANYOF_SET(opnd, Class);
1920 if (regflags & PMf_LOCALE)
1921 *opnd |= ANYOF_NSPACEL;
1923 for (Class = 0; Class < 256; Class++)
1924 if (!isSPACE(Class))
1925 ANYOF_SET(opnd, Class);
1932 for (Class = '0'; Class <= '9'; Class++)
1933 ANYOF_SET(opnd, Class);
1939 for (Class = 0; Class < '0'; Class++)
1940 ANYOF_SET(opnd, Class);
1941 for (Class = '9' + 1; Class < 256; Class++)
1942 ANYOF_SET(opnd, Class);
1968 Class = scan_hex(regcomp_parse, 2, &numlen);
1969 regcomp_parse += numlen;
1972 Class = UCHARAT(regcomp_parse++);
1973 Class = toCTRL(Class);
1975 case '0': case '1': case '2': case '3': case '4':
1976 case '5': case '6': case '7': case '8': case '9':
1977 Class = scan_oct(--regcomp_parse, 3, &numlen);
1978 regcomp_parse += numlen;
1983 if (lastclass > Class)
1984 FAIL("invalid [] range in regexp");
1989 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
1990 regcomp_parse[1] != ']') {
1993 continue; /* do it next time */
1997 for ( ; lastclass <= Class; lastclass++)
1998 ANYOF_SET(opnd, lastclass);
2002 if (*regcomp_parse != ']')
2003 FAIL("unmatched [] in regexp");
2005 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2006 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2007 for (Class = 0; Class < 256; ++Class) {
2008 if (ANYOF_TEST(opnd, Class)) {
2009 I32 cf = fold[Class];
2010 ANYOF_SET(opnd, cf);
2013 *opnd &= ~ANYOF_FOLD;
2015 /* optimize inverted simple patterns (e.g. [^a-z]) */
2016 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2017 for (Class = 0; Class < 32; ++Class)
2018 opnd[1 + Class] ^= 0xFF;
2027 char* retval = regcomp_parse++;
2030 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2031 regcomp_parse[2] == '#') {
2032 while (*regcomp_parse && *regcomp_parse != ')')
2037 if (regflags & PMf_EXTENDED) {
2038 if (isSPACE(*regcomp_parse)) {
2042 else if (*regcomp_parse == '#') {
2043 while (*regcomp_parse && *regcomp_parse != '\n')
2054 - reg_node - emit a node
2056 STATIC regnode * /* Location. */
2059 register regnode *ret;
2060 register regnode *ptr;
2064 SIZE_ALIGN(regsize);
2065 #ifdef REGALIGN_STRUCT
2073 NODE_ALIGN_FILL(ret);
2075 FILL_ADVANCE_NODE(ptr, op);
2082 - reganode - emit a node with an argument
2084 STATIC regnode * /* Location. */
2085 reganode(U8 op, U32 arg)
2087 register regnode *ret;
2088 register regnode *ptr;
2092 SIZE_ALIGN(regsize);
2101 NODE_ALIGN_FILL(ret);
2103 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2110 - regc - emit (if appropriate) a byte of code
2120 - reginsert - insert an operator in front of already-emitted operand
2122 * Means relocating the operand.
2125 reginsert(U8 op, regnode *opnd)
2127 register regnode *src;
2128 register regnode *dst;
2129 register regnode *place;
2130 register int offset = regarglen[(U8)op];
2132 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2135 regsize += NODE_STEP_REGNODE + offset;
2140 regcode += NODE_STEP_REGNODE + offset;
2143 StructCopy(--src, --dst, regnode);
2145 place = opnd; /* Op node, where operand used to be. */
2146 src = NEXTOPER(place);
2147 FILL_ADVANCE_NODE(place, op);
2148 Zero(src, offset, regnode);
2149 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2150 src[offset + 1] = '\177';
2155 - regtail - set the next-pointer at the end of a node chain of p to val.
2158 regtail(regnode *p, regnode *val)
2160 register regnode *scan;
2161 register regnode *temp;
2162 register I32 offset;
2167 /* Find last node. */
2170 temp = regnext(scan);
2177 # ifdef REGALIGN_STRUCT
2178 if (reg_off_by_arg[OP(scan)]) {
2179 ARG_SET(scan, val - scan);
2181 NEXT_OFF(scan) = val - scan;
2184 offset = val - scan;
2186 *(short*)(scan+1) = offset;
2190 if (OP(scan) == BACK)
2191 offset = scan - val;
2193 offset = val - scan;
2194 *(scan+1) = (offset>>8)&0377;
2195 *(scan+2) = offset&0377;
2200 - regoptail - regtail on operand of first argument; nop if operandless
2203 regoptail(regnode *p, regnode *val)
2205 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2206 if (p == NULL || SIZE_ONLY)
2208 if (regkind[(U8)OP(p)] == BRANCH) {
2209 regtail(NEXTOPER(p), val);
2210 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2211 regtail(NEXTOPER(NEXTOPER(p)), val);
2217 - regcurly - a little FSA that accepts {\d+,?\d*}
2220 regcurly(register char *s)
2239 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2242 register char op = EXACT; /* Arbitrary non-END op. */
2243 register regnode *next, *onode;
2245 while (op != END && (!last || node < last)) {
2246 /* While that wasn't END last time... */
2252 next = regnext(node);
2254 if (OP(node) == OPTIMIZED)
2257 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2258 2*l + 1, "", SvPVX(sv));
2259 if (next == NULL) /* Next ptr. */
2260 PerlIO_printf(Perl_debug_log, "(0)");
2262 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2263 (void)PerlIO_putc(Perl_debug_log, '\n');
2265 if (regkind[(U8)op] == BRANCHJ) {
2266 register regnode *nnode = (OP(next) == LONGJMP
2269 if (last && nnode > last)
2271 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2272 } else if (regkind[(U8)op] == BRANCH) {
2273 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2274 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2275 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2276 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2277 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2278 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2280 } else if ( op == PLUS || op == STAR) {
2281 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2282 } else if (op == ANYOF) {
2283 node = NEXTOPER(node);
2285 } else if (regkind[(U8)op] == EXACT) {
2286 /* Literal string, where present. */
2287 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2288 node = NEXTOPER(node);
2290 node = NEXTOPER(node);
2291 node += regarglen[(U8)op];
2293 if (op == CURLYX || op == OPEN)
2295 else if (op == WHILEM)
2298 #endif /* DEBUGGING */
2303 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2309 SV *sv = sv_newmortal();
2311 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2313 /* Header fields of interest. */
2314 if (r->anchored_substr)
2315 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2317 SvPVX(r->anchored_substr),
2319 SvTAIL(r->anchored_substr) ? "$" : "",
2320 r->anchored_offset);
2321 if (r->float_substr)
2322 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2324 SvPVX(r->float_substr),
2326 SvTAIL(r->float_substr) ? "$" : "",
2327 r->float_min_offset, r->float_max_offset);
2328 if (r->check_substr)
2329 PerlIO_printf(Perl_debug_log,
2330 r->check_substr == r->float_substr
2331 ? "(checking floating" : "(checking anchored");
2332 if (r->reganch & ROPT_NOSCAN)
2333 PerlIO_printf(Perl_debug_log, " noscan");
2334 if (r->reganch & ROPT_CHECK_ALL)
2335 PerlIO_printf(Perl_debug_log, " isall");
2336 if (r->check_substr)
2337 PerlIO_printf(Perl_debug_log, ") ");
2339 if (r->regstclass) {
2340 regprop(sv, r->regstclass);
2341 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2343 if (r->reganch & ROPT_ANCH) {
2344 PerlIO_printf(Perl_debug_log, "anchored");
2345 if (r->reganch & ROPT_ANCH_BOL)
2346 PerlIO_printf(Perl_debug_log, "(BOL)");
2347 if (r->reganch & ROPT_ANCH_MBOL)
2348 PerlIO_printf(Perl_debug_log, "(MBOL)");
2349 if (r->reganch & ROPT_ANCH_GPOS)
2350 PerlIO_printf(Perl_debug_log, "(GPOS)");
2351 PerlIO_putc(Perl_debug_log, ' ');
2353 if (r->reganch & ROPT_GPOS_SEEN)
2354 PerlIO_printf(Perl_debug_log, "GPOS ");
2355 if (r->reganch & ROPT_SKIP)
2356 PerlIO_printf(Perl_debug_log, "plus ");
2357 if (r->reganch & ROPT_IMPLICIT)
2358 PerlIO_printf(Perl_debug_log, "implicit ");
2359 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2360 if (r->reganch & ROPT_EVAL_SEEN)
2361 PerlIO_printf(Perl_debug_log, "with eval ");
2362 PerlIO_printf(Perl_debug_log, "\n");
2363 #endif /* DEBUGGING */
2367 - regprop - printable representation of opcode
2370 regprop(SV *sv, regnode *o)
2373 register char *p = 0;
2408 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2411 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2414 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2441 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2444 #ifdef REGALIGN_STRUCT
2445 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2447 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2451 #ifdef REGALIGN_STRUCT
2452 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2454 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2458 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2461 sv_catpvf(sv, "REF%d", ARG(o));
2464 sv_catpvf(sv, "REFF%d", ARG(o));
2467 sv_catpvf(sv, "REFFL%d", ARG(o));
2470 sv_catpvf(sv, "OPEN%d", ARG(o));
2473 sv_catpvf(sv, "CLOSE%d", ARG(o));
2489 #ifdef REGALIGN_STRUCT
2490 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2496 #ifdef REGALIGN_STRUCT
2497 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2551 sv_catpvf(sv, "GROUPP%d", ARG(o));
2566 FAIL("corrupted regexp opcode");
2570 #endif /* DEBUGGING */
2574 pregfree(struct regexp *r)
2576 if (!r || (--r->refcnt > 0))
2579 Safefree(r->precomp);
2581 Safefree(r->subbase);
2583 if (r->anchored_substr)
2584 SvREFCNT_dec(r->anchored_substr);
2585 if (r->float_substr)
2586 SvREFCNT_dec(r->float_substr);
2587 Safefree(r->substrs);
2590 int n = r->data->count;
2592 switch (r->data->what[n]) {
2594 SvREFCNT_dec((SV*)r->data->data[n]);
2597 op_free((OP_4tree*)r->data->data[n]);
2602 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2605 Safefree(r->data->what);
2608 Safefree(r->startp);
2614 - regnext - dig the "next" pointer out of a node
2616 * [Note, when REGALIGN is defined there are two places in regmatch()
2617 * that bypass this code for speed.]
2620 regnext(register regnode *p)
2622 register I32 offset;
2627 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2642 re_croak2(const char* pat1,const char* pat2,...)
2645 STRLEN l1 = strlen(pat1);
2646 STRLEN l2 = strlen(pat2);
2654 Copy(pat1, buf, l1 , char);
2655 Copy(pat2, buf + l1, l2 , char);
2656 buf[l1 + l2 + 1] = '\n';
2657 buf[l1 + l2 + 2] = '\0';
2658 va_start(args, pat2);
2659 message = mess(buf, &args);
2661 l1 = strlen(message);
2664 Copy(message, buf, l1 , char);
2665 buf[l1] = '\0'; /* Overwrite \n */