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 # define Perl_pregcomp my_regcomp
24 # define Perl_regdump my_regdump
25 # define Perl_regprop my_regprop
30 * pregcomp and pregexec -- regsub and regerror are not used in perl
32 * Copyright (c) 1986 by University of Toronto.
33 * Written by Henry Spencer. Not derived from licensed software.
35 * Permission is granted to anyone to use this software for any
36 * purpose on any computer system, and to redistribute it freely,
37 * subject to the following restrictions:
39 * 1. The author is not responsible for the consequences of use of
40 * this software, no matter how awful, even if they arise
43 * 2. The origin of this software must not be misrepresented, either
44 * by explicit claim or by omission.
46 * 3. Altered versions must be plainly marked as such, and must not
47 * be misrepresented as being the original software.
50 **** Alterations to Henry's code are...
52 **** Copyright (c) 1991-1997, Larry Wall
54 **** You may distribute under the terms of either the GNU General Public
55 **** License or the Artistic License, as specified in the README file.
58 * Beware that some of this code is subtly aware of the way operator
59 * precedence is structured in regular expressions. Serious changes in
60 * regular-expression syntax might require a total rethink.
74 # if defined(BUGGY_MSC6)
75 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
76 # pragma optimize("a",off)
77 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
78 # pragma optimize("w",on )
79 # endif /* BUGGY_MSC6 */
86 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
87 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
88 ((*s) == '{' && regcurly(s)))
90 #define PERL_META "^$.[()|?+*\\"
92 #define META "^$.[()|?+*\\"
96 #undef SPSTART /* dratted cpp namespace... */
99 * Flags to be passed up and down.
101 #define WORST 0 /* Worst case. */
102 #define HASWIDTH 0x1 /* Known to match non-null strings. */
103 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
104 #define SPSTART 0x4 /* Starts with * or +. */
105 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
108 * Forward declarations for pregcomp()'s friends.
112 static regnode *reg _((I32, I32 *));
113 static regnode *reganode _((U8, U32));
114 static regnode *regatom _((I32 *));
115 static regnode *regbranch _((I32 *, I32));
116 static void regc _((U8, char *));
117 static regnode *regclass _((void));
118 STATIC I32 regcurly _((char *));
119 static regnode *reg_node _((U8));
120 static regnode *regpiece _((I32 *));
121 static void reginsert _((U8, regnode *));
122 static void regoptail _((regnode *, regnode *));
123 static void regtail _((regnode *, regnode *));
124 static char* regwhite _((char *, char *));
125 static char* nextchar _((void));
126 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
129 /* Length of a variant. */
138 I32 last_end; /* min value, <0 unless valid. */
141 SV **longest; /* Either &l_fixed, or &l_float. */
145 I32 offset_float_min;
146 I32 offset_float_max;
151 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
153 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
154 #define SF_BEFORE_SEOL 0x1
155 #define SF_BEFORE_MEOL 0x2
156 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
157 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
160 # define SF_FIX_SHIFT_EOL (0+2)
161 # define SF_FL_SHIFT_EOL (0+4)
163 # define SF_FIX_SHIFT_EOL (+2)
164 # define SF_FL_SHIFT_EOL (+4)
167 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
168 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
170 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
171 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
172 #define SF_IS_INF 0x40
173 #define SF_HAS_PAR 0x80
174 #define SF_IN_PAR 0x100
175 #define SF_HAS_EVAL 0x200
176 #define SCF_DO_SUBSTR 0x400
179 scan_commit(scan_data_t *data)
181 STRLEN l = SvCUR(data->last_found);
182 STRLEN old_l = SvCUR(*data->longest);
184 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
185 sv_setsv(*data->longest, data->last_found);
186 if (*data->longest == data->longest_fixed) {
187 data->offset_fixed = l ? data->last_start_min : data->pos_min;
188 if (data->flags & SF_BEFORE_EOL)
190 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
192 data->flags &= ~SF_FIX_BEFORE_EOL;
194 data->offset_float_min = l ? data->last_start_min : data->pos_min;
195 data->offset_float_max = (l
196 ? data->last_start_max
197 : data->pos_min + data->pos_delta);
198 if (data->flags & SF_BEFORE_EOL)
200 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
202 data->flags &= ~SF_FL_BEFORE_EOL;
205 SvCUR_set(data->last_found, 0);
207 data->flags &= ~SF_BEFORE_EOL;
210 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
211 to the position after last scanned or to NULL. */
214 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
215 /* scanp: Start here (read-write). */
216 /* deltap: Write maxlen-minlen here. */
217 /* last: Stop before this one. */
219 I32 min = 0, pars = 0, code;
220 regnode *scan = *scanp, *next;
222 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
223 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
224 scan_data_t data_fake;
226 while (scan && OP(scan) != END && scan < last) {
227 /* Peephole optimizer: */
229 if (regkind[(U8)OP(scan)] == EXACT) {
230 regnode *n = regnext(scan);
233 regnode *stop = scan;
236 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
237 /* Skip NOTHING, merge EXACT*. */
239 ( regkind[(U8)OP(n)] == NOTHING ||
240 (stringok && (OP(n) == OP(scan))))
242 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
243 if (OP(n) == TAIL || n > next)
245 if (regkind[(U8)OP(n)] == NOTHING) {
246 NEXT_OFF(scan) += NEXT_OFF(n);
247 next = n + NODE_STEP_REGNODE;
254 int oldl = *OPERAND(scan);
255 regnode *nnext = regnext(n);
257 if (oldl + *OPERAND(n) > U8_MAX)
259 NEXT_OFF(scan) += NEXT_OFF(n);
260 *OPERAND(scan) += *OPERAND(n);
261 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
262 /* Now we can overwrite *n : */
263 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
264 *OPERAND(n) + 1, char);
274 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
276 /* Purify reports a benign UMR here sometimes, because we
277 * don't initialize the OP() slot of a node when that node
278 * is occupied by just the trailing null of the string in
280 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
289 if (OP(scan) != CURLYX) {
290 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
291 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
295 /* Skip NOTHING and LONGJMP. */
296 while ((n = regnext(n))
297 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
298 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
301 if (reg_off_by_arg[OP(scan)])
304 NEXT_OFF(scan) = off;
306 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
307 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
308 next = regnext(scan);
311 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
312 I32 max1 = 0, min1 = I32_MAX, num = 0;
314 if (flags & SCF_DO_SUBSTR)
316 while (OP(scan) == code) {
317 I32 deltanext, minnext;
321 next = regnext(scan);
322 scan = NEXTOPER(scan);
324 scan = NEXTOPER(scan);
325 /* We suppose the run is continuous, last=next...*/
326 minnext = study_chunk(&scan, &deltanext, next,
330 if (max1 < minnext + deltanext)
331 max1 = minnext + deltanext;
332 if (deltanext == I32_MAX)
335 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
337 if (data && (data_fake.flags & SF_HAS_EVAL))
338 data->flags |= SF_HAS_EVAL;
342 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
344 if (flags & SCF_DO_SUBSTR) {
345 data->pos_min += min1;
346 data->pos_delta += max1 - min1;
347 if (max1 != min1 || is_inf)
348 data->longest = &(data->longest_float);
351 delta += max1 - min1;
352 } else if (code == BRANCHJ) /* single branch is optimized. */
353 scan = NEXTOPER(NEXTOPER(scan));
354 else /* single branch is optimized. */
355 scan = NEXTOPER(scan);
357 } else if (OP(scan) == EXACT) {
358 min += *OPERAND(scan);
359 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
360 I32 l = *OPERAND(scan);
362 /* The code below prefers earlier match for fixed
363 offset, later match for variable offset. */
364 if (data->last_end == -1) { /* Update the start info. */
365 data->last_start_min = data->pos_min;
366 data->last_start_max = is_inf
367 ? I32_MAX : data->pos_min + data->pos_delta;
369 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
370 data->last_end = data->pos_min + l;
371 data->pos_min += l; /* As in the first entry. */
372 data->flags &= ~SF_BEFORE_EOL;
374 } else if (regkind[(U8)OP(scan)] == EXACT) {
375 if (flags & SCF_DO_SUBSTR)
377 min += *OPERAND(scan);
378 if (data && (flags & SCF_DO_SUBSTR))
379 data->pos_min += *OPERAND(scan);
380 } else if (strchr(varies,OP(scan))) {
381 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
382 regnode *oscan = scan;
384 switch (regkind[(U8)OP(scan)]) {
386 scan = NEXTOPER(scan);
389 if (flags & SCF_DO_SUBSTR) {
390 next = NEXTOPER(scan);
391 if (OP(next) == EXACT) {
393 maxcount = REG_INFTY;
394 next = regnext(scan);
395 scan = NEXTOPER(scan);
399 if (flags & SCF_DO_SUBSTR)
405 scan = regnext(scan);
406 if (flags & SCF_DO_SUBSTR) {
408 data->longest = &(data->longest_float);
410 goto optimize_curly_tail;
412 mincount = ARG1(scan);
413 maxcount = ARG2(scan);
414 next = regnext(scan);
415 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
417 if (flags & SCF_DO_SUBSTR) {
418 if (mincount == 0) scan_commit(data);
419 pos_before = data->pos_min;
423 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
425 data->flags |= SF_IS_INF;
427 /* This will finish on WHILEM, setting scan, or on NULL: */
428 minnext = study_chunk(&scan, &deltanext, last, data,
430 ? (flags & ~SCF_DO_SUBSTR) : flags);
431 if (!scan) /* It was not CURLYX, but CURLY. */
433 if (dowarn && (minnext + deltanext == 0)
434 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
435 && maxcount <= 10000) /* Complement check for big count */
436 warn("Strange *+?{} on zero-length expression");
437 min += minnext * mincount;
438 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
439 || deltanext == I32_MAX);
440 delta += (minnext + deltanext) * maxcount - minnext * mincount;
442 /* Try powerful optimization CURLYX => CURLYN. */
443 if ( OP(oscan) == CURLYX && data
444 && data->flags & SF_IN_PAR
445 && !(data->flags & SF_HAS_EVAL)
446 && !deltanext && minnext == 1 ) {
447 /* Try to optimize to CURLYN. */
448 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
449 regnode *nxt1 = nxt, *nxt2;
453 if (!strchr(simple,OP(nxt))
454 && !(regkind[(U8)OP(nxt)] == EXACT
455 && *OPERAND(nxt) == 1))
459 if (OP(nxt) != CLOSE)
461 /* Now we know that nxt2 is the only contents: */
462 oscan->flags = ARG(nxt);
464 OP(nxt1) = NOTHING; /* was OPEN. */
466 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
467 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
468 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
469 OP(nxt) = OPTIMIZED; /* was CLOSE. */
470 OP(nxt + 1) = OPTIMIZED; /* was count. */
471 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
476 /* Try optimization CURLYX => CURLYM. */
477 if ( OP(oscan) == CURLYX && data
478 && !(data->flags & SF_HAS_PAR)
479 && !(data->flags & SF_HAS_EVAL)
481 /* XXXX How to optimize if data == 0? */
482 /* Optimize to a simpler form. */
483 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
487 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
488 && (OP(nxt2) != WHILEM))
490 OP(nxt2) = SUCCEED; /* Whas WHILEM */
491 /* Need to optimize away parenths. */
492 if (data->flags & SF_IN_PAR) {
493 /* Set the parenth number. */
494 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
496 if (OP(nxt) != CLOSE)
497 FAIL("panic opt close");
498 oscan->flags = ARG(nxt);
499 OP(nxt1) = OPTIMIZED; /* was OPEN. */
500 OP(nxt) = OPTIMIZED; /* was CLOSE. */
502 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
503 OP(nxt + 1) = OPTIMIZED; /* was count. */
504 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
505 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
508 while ( nxt1 && (OP(nxt1) != WHILEM)) {
509 regnode *nnxt = regnext(nxt1);
512 if (reg_off_by_arg[OP(nxt1)])
513 ARG_SET(nxt1, nxt2 - nxt1);
514 else if (nxt2 - nxt1 < U16_MAX)
515 NEXT_OFF(nxt1) = nxt2 - nxt1;
517 OP(nxt) = NOTHING; /* Cannot beautify */
522 /* Optimize again: */
523 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
527 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
529 if (flags & SCF_DO_SUBSTR) {
530 SV *last_str = Nullsv;
531 int counted = mincount != 0;
533 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
534 I32 b = pos_before >= data->last_start_min
535 ? pos_before : data->last_start_min;
537 char *s = SvPV(data->last_found, l);
539 l -= b - data->last_start_min;
540 /* Get the added string: */
541 last_str = newSVpv(s + b - data->last_start_min, l);
542 if (deltanext == 0 && pos_before == b) {
543 /* What was added is a constant string */
545 SvGROW(last_str, (mincount * l) + 1);
546 repeatcpy(SvPVX(last_str) + l,
547 SvPVX(last_str), l, mincount - 1);
548 SvCUR(last_str) *= mincount;
549 /* Add additional parts. */
550 SvCUR_set(data->last_found,
551 SvCUR(data->last_found) - l);
552 sv_catsv(data->last_found, last_str);
553 data->last_end += l * (mincount - 1);
557 /* It is counted once already... */
558 data->pos_min += minnext * (mincount - counted);
559 data->pos_delta += - counted * deltanext +
560 (minnext + deltanext) * maxcount - minnext * mincount;
561 if (mincount != maxcount) {
563 if (mincount && last_str) {
564 sv_setsv(data->last_found, last_str);
565 data->last_end = data->pos_min;
566 data->last_start_min =
567 data->pos_min - SvCUR(last_str);
568 data->last_start_max = is_inf
570 : data->pos_min + data->pos_delta
573 data->longest = &(data->longest_float);
576 if (data && (fl & SF_HAS_EVAL))
577 data->flags |= SF_HAS_EVAL;
579 if (OP(oscan) != CURLYX) {
580 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
582 NEXT_OFF(oscan) += NEXT_OFF(next);
585 default: /* REF only? */
586 if (flags & SCF_DO_SUBSTR) {
588 data->longest = &(data->longest_float);
593 } else if (strchr(simple,OP(scan))) {
594 if (flags & SCF_DO_SUBSTR) {
599 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
600 data->flags |= (OP(scan) == MEOL
603 } else if (regkind[(U8)OP(scan)] == BRANCHJ
604 && (scan->flags || data)
605 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
606 I32 deltanext, minnext;
610 next = regnext(scan);
611 nscan = NEXTOPER(NEXTOPER(scan));
612 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
615 FAIL("variable length lookbehind not implemented");
616 } else if (minnext > U8_MAX) {
617 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
619 scan->flags = minnext;
621 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
623 if (data && (data_fake.flags & SF_HAS_EVAL))
624 data->flags |= SF_HAS_EVAL;
625 } else if (OP(scan) == OPEN) {
627 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
628 next = regnext(scan);
630 if ( next && (OP(next) != WHILEM) && next < last)
631 is_par = 0; /* Disable optimization */
632 } else if (OP(scan) == EVAL) {
634 data->flags |= SF_HAS_EVAL;
636 /* Else: zero-length, ignore. */
637 scan = regnext(scan);
642 *deltap = is_inf ? I32_MAX : delta;
643 if (flags & SCF_DO_SUBSTR && is_inf)
644 data->pos_delta = I32_MAX - data->pos_min;
647 if (is_par && pars==1 && data) {
648 data->flags |= SF_IN_PAR;
649 data->flags &= ~SF_HAS_PAR;
650 } else if (pars && data) {
651 data->flags |= SF_HAS_PAR;
652 data->flags &= ~SF_IN_PAR;
658 add_data(I32 n, char *s)
660 if (regcomp_rx->data) {
661 Renewc(regcomp_rx->data,
662 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
663 char, struct reg_data);
664 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
665 regcomp_rx->data->count += n;
667 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
668 char, struct reg_data);
669 New(1208, regcomp_rx->data->what, n, U8);
670 regcomp_rx->data->count = n;
672 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
673 return regcomp_rx->data->count - n;
677 - pregcomp - compile a regular expression into internal code
679 * We can't allocate space until we know how big the compiled form will be,
680 * but we can't compile it (and thus know how big it is) until we've got a
681 * place to put the code. So we cheat: we compile it twice, once with code
682 * generation turned off and size counting turned on, and once "for real".
683 * This also means that we don't allocate space until we are sure that the
684 * thing really will compile successfully, and we never have to move the
685 * code and thus invalidate pointers into it. (Note that it has to be in
686 * one piece because free() must be able to free it all.) [NB: not true in perl]
688 * Beware that the optimization-preparation code in here knows about some
689 * of the structure of the compiled regexp. [I'll say.]
692 pregcomp(char *exp, char *xend, PMOP *pm)
706 FAIL("NULL regexp argument");
708 regprecomp = savepvn(exp, xend - exp);
709 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
710 xend - exp, regprecomp));
711 regflags = pm->op_pmflags;
715 seen_zerolen = *exp == '^' ? -1 : 0;
718 /* First pass: determine size, legality. */
725 regc((U8)MAGIC, (char*)regcode);
726 if (reg(0, &flags) == NULL) {
727 Safefree(regprecomp);
731 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
736 char *s = PerlEnv_getenv("TERMCAP_COLORS");
740 colors[0] = s = savepv(s);
744 FAIL("Not enough TABs in TERMCAP_COLORS");
753 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
754 colors[0],colors[1],colors[2],colors[3]);
758 /* Small enough for pointer-storage convention?
759 If extralen==0, this means that we will not need long jumps. */
760 if (regsize >= 0x10000L && extralen)
765 /* Allocate space and initialize. */
766 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
769 FAIL("regexp out of space");
771 r->prelen = xend - exp;
772 r->precomp = regprecomp;
773 r->subbeg = r->subbase = NULL;
774 r->nparens = regnpar - 1; /* set early to validate backrefs */
777 /* Second pass: emit code. */
782 regcode = r->program;
783 regc((U8)MAGIC, (char*) regcode++);
785 if (reg(0, &flags) == NULL)
788 /* Dig out information for optimizations. */
789 pm->op_pmflags = regflags;
791 r->regstclass = NULL;
792 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
793 scan = r->program + 1; /* First BRANCH. */
795 /* XXXX To minimize changes to RE engine we always allocate
796 3-units-long substrs field. */
797 Newz(1004, r->substrs, 1, struct reg_substr_data);
799 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
802 STRLEN longest_float_length, longest_fixed_length;
804 StructCopy(&zero_scan_data, &data, scan_data_t);
806 /* Skip introductions and multiplicators >= 1. */
807 while ((OP(first) == OPEN && (sawopen = 1)) ||
808 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
809 (OP(first) == PLUS) ||
810 (OP(first) == MINMOD) ||
811 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
812 if (OP(first) == PLUS)
815 first += regarglen[(U8)OP(first)];
816 first = NEXTOPER(first);
819 /* Starting-point info. */
821 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
822 else if (strchr(simple+2,OP(first)))
823 r->regstclass = first;
824 else if (regkind[(U8)OP(first)] == BOUND ||
825 regkind[(U8)OP(first)] == NBOUND)
826 r->regstclass = first;
827 else if (regkind[(U8)OP(first)] == BOL) {
828 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
829 first = NEXTOPER(first);
832 else if (OP(first) == GPOS) {
833 r->reganch |= ROPT_ANCH_GPOS;
834 first = NEXTOPER(first);
837 else if ((OP(first) == STAR &&
838 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
839 !(r->reganch & ROPT_ANCH) )
841 /* turn .* into ^.* with an implied $*=1 */
842 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
843 first = NEXTOPER(first);
846 if (sawplus && (!sawopen || !regsawback))
847 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
849 /* Scan is after the zeroth branch, first is atomic matcher. */
850 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
853 * If there's something expensive in the r.e., find the
854 * longest literal string that must appear and make it the
855 * regmust. Resolve ties in favor of later strings, since
856 * the regstart check works with the beginning of the r.e.
857 * and avoiding duplication strengthens checking. Not a
858 * strong reason, but sufficient in the absence of others.
859 * [Now we resolve ties in favor of the earlier string if
860 * it happens that c_offset_min has been invalidated, since the
861 * earlier string may buy us something the later one won't.]
865 data.longest_fixed = newSVpv("",0);
866 data.longest_float = newSVpv("",0);
867 data.last_found = newSVpv("",0);
868 data.longest = &(data.longest_fixed);
871 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
872 &data, SCF_DO_SUBSTR);
873 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
874 && data.last_start_min == 0 && data.last_end > 0
876 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
877 r->reganch |= ROPT_CHECK_ALL;
879 SvREFCNT_dec(data.last_found);
881 longest_float_length = SvCUR(data.longest_float);
882 if (longest_float_length
883 || (data.flags & SF_FL_BEFORE_EOL
884 && (!(data.flags & SF_FL_BEFORE_MEOL)
885 || (regflags & PMf_MULTILINE)))) {
886 if (SvCUR(data.longest_fixed)
887 && data.offset_fixed == data.offset_float_min)
888 goto remove; /* Like in (a)+. */
890 r->float_substr = data.longest_float;
891 r->float_min_offset = data.offset_float_min;
892 r->float_max_offset = data.offset_float_max;
893 fbm_compile(r->float_substr, 0);
894 BmUSEFUL(r->float_substr) = 100;
895 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
896 && (!(data.flags & SF_FL_BEFORE_MEOL)
897 || (regflags & PMf_MULTILINE)))
898 SvTAIL_on(r->float_substr);
901 r->float_substr = Nullsv;
902 SvREFCNT_dec(data.longest_float);
903 longest_float_length = 0;
906 longest_fixed_length = SvCUR(data.longest_fixed);
907 if (longest_fixed_length
908 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
909 && (!(data.flags & SF_FIX_BEFORE_MEOL)
910 || (regflags & PMf_MULTILINE)))) {
911 r->anchored_substr = data.longest_fixed;
912 r->anchored_offset = data.offset_fixed;
913 fbm_compile(r->anchored_substr, 0);
914 BmUSEFUL(r->anchored_substr) = 100;
915 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
916 && (!(data.flags & SF_FIX_BEFORE_MEOL)
917 || (regflags & PMf_MULTILINE)))
918 SvTAIL_on(r->anchored_substr);
920 r->anchored_substr = Nullsv;
921 SvREFCNT_dec(data.longest_fixed);
922 longest_fixed_length = 0;
925 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
926 if (longest_fixed_length > longest_float_length) {
927 r->check_substr = r->anchored_substr;
928 r->check_offset_min = r->check_offset_max = r->anchored_offset;
929 if (r->reganch & ROPT_ANCH_SINGLE)
930 r->reganch |= ROPT_NOSCAN;
932 r->check_substr = r->float_substr;
933 r->check_offset_min = data.offset_float_min;
934 r->check_offset_max = data.offset_float_max;
937 /* Several toplevels. Best we can is to set minlen. */
940 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
941 scan = r->program + 1;
942 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
943 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
947 if (regseen & REG_SEEN_GPOS)
948 r->reganch |= ROPT_GPOS_SEEN;
949 if (regseen & REG_SEEN_LOOKBEHIND)
950 r->reganch |= ROPT_LOOKBEHIND_SEEN;
951 if (regseen & REG_SEEN_EVAL)
952 r->reganch |= ROPT_EVAL_SEEN;
953 Newz(1002, r->startp, regnpar, char*);
954 Newz(1002, r->endp, regnpar, char*);
960 - reg - regular expression, i.e. main body or parenthesized thing
962 * Caller must absorb opening parenthesis.
964 * Combining parenthesis handling with the base level of regular expression
965 * is a trifle forced, but the need to tie the tails of the branches to what
966 * follows makes it hard to avoid.
969 reg(I32 paren, I32 *flagp)
970 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
972 register regnode *ret; /* Will be the head of the group. */
973 register regnode *br;
974 register regnode *lastbr;
975 register regnode *ender = 0;
976 register I32 parno = 0;
977 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
980 *flagp = 0; /* Tentatively. */
982 /* Make an OPEN node, if parenthesized. */
984 if (*regcomp_parse == '?') {
986 paren = *regcomp_parse++;
987 ret = NULL; /* For look-ahead/behind. */
990 regseen |= REG_SEEN_LOOKBEHIND;
991 if (*regcomp_parse == '!')
993 if (*regcomp_parse != '=' && *regcomp_parse != '!')
1004 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1007 while (*regcomp_parse && *regcomp_parse != ')')
1009 if (*regcomp_parse != ')')
1010 FAIL("Sequence (?#... not terminated");
1017 I32 count = 1, n = 0;
1019 char *s = regcomp_parse;
1021 OP_4tree *sop, *rop;
1024 regseen |= REG_SEEN_EVAL;
1025 while (count && (c = *regcomp_parse)) {
1026 if (c == '\\' && regcomp_parse[1])
1034 if (*regcomp_parse != ')')
1035 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1039 if (regcomp_parse - 1 - s)
1040 sv = newSVpv(s, regcomp_parse - 1 - s);
1042 sv = newSVpv("", 0);
1044 rop = sv_compile_2op(sv, &sop, "re", &av);
1046 n = add_data(3, "nso");
1047 regcomp_rx->data->data[n] = (void*)rop;
1048 regcomp_rx->data->data[n+1] = (void*)av;
1049 regcomp_rx->data->data[n+2] = (void*)sop;
1051 } else { /* First pass */
1052 if (curcop == &compiling) {
1053 if (!(hints & HINT_RE_EVAL))
1054 FAIL("Eval-group not allowed, use re 'eval'");
1057 FAIL("Eval-group not allowed at run time");
1060 FAIL("Eval-group in insecure regular expression");
1064 return reganode(EVAL, n);
1068 if (regcomp_parse[0] == '?') {
1069 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1070 || regcomp_parse[1] == '<'
1071 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1074 ret = reg_node(LOGICAL);
1075 regtail(ret, reg(1, &flag));
1078 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1079 parno = atoi(regcomp_parse++);
1081 while (isDIGIT(*regcomp_parse))
1083 ret = reganode(GROUPP, parno);
1084 if ((c = *nextchar()) != ')')
1085 FAIL2("Switch (?(number%c not recognized", c);
1087 regtail(ret, reganode(IFTHEN, 0));
1088 br = regbranch(&flags, 1);
1090 br = reganode(LONGJMP, 0);
1092 regtail(br, reganode(LONGJMP, 0));
1095 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1096 regbranch(&flags, 1);
1097 regtail(ret, lastbr);
1102 FAIL("Switch (?(condition)... contains too many branches");
1103 ender = reg_node(TAIL);
1106 regtail(lastbr, ender);
1107 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1109 regtail(ret, ender);
1112 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1116 FAIL("Sequence (? incomplete");
1120 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1121 if (*regcomp_parse != 'o')
1122 pmflag(®flags, *regcomp_parse);
1126 if (*regcomp_parse != ')')
1127 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1136 ret = reganode(OPEN, parno);
1142 /* Pick up the branches, linking them together. */
1143 br = regbranch(&flags, 1);
1146 if (*regcomp_parse == '|') {
1147 if (!SIZE_ONLY && extralen) {
1148 reginsert(BRANCHJ, br);
1150 reginsert(BRANCH, br);
1153 extralen += 1; /* For BRANCHJ-BRANCH. */
1154 } else if (paren == ':') {
1155 *flagp |= flags&SIMPLE;
1157 if (open) { /* Starts with OPEN. */
1158 regtail(ret, br); /* OPEN -> first. */
1159 } else if (paren != '?') /* Not Conditional */
1163 *flagp |= flags&SPSTART;
1165 while (*regcomp_parse == '|') {
1166 if (!SIZE_ONLY && extralen) {
1167 ender = reganode(LONGJMP,0);
1168 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1171 extralen += 2; /* Account for LONGJMP. */
1173 br = regbranch(&flags, 0);
1176 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1180 *flagp |= flags&SPSTART;
1183 if (have_branch || paren != ':') {
1184 /* Make a closing node, and hook it on the end. */
1187 ender = reg_node(TAIL);
1190 ender = reganode(CLOSE, parno);
1196 *flagp &= ~HASWIDTH;
1199 ender = reg_node(SUCCEED);
1202 ender = reg_node(END);
1205 regtail(lastbr, ender);
1208 /* Hook the tails of the branches to the closing node. */
1209 for (br = ret; br != NULL; br = regnext(br)) {
1210 regoptail(br, ender);
1217 static char parens[] = "=!<,>";
1219 if (paren && (p = strchr(parens, paren))) {
1220 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1221 int flag = (p - parens) > 1;
1224 node = SUSPEND, flag = 0;
1225 reginsert(node,ret);
1227 regtail(ret, reg_node(TAIL));
1231 /* Check for proper termination. */
1232 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1233 FAIL("unmatched () in regexp");
1234 } else if (!paren && regcomp_parse < regxend) {
1235 if (*regcomp_parse == ')') {
1236 FAIL("unmatched () in regexp");
1238 FAIL("junk on end of regexp"); /* "Can't happen". */
1242 regflags = oregflags;
1249 - regbranch - one alternative of an | operator
1251 * Implements the concatenation operator.
1254 regbranch(I32 *flagp, I32 first)
1256 register regnode *ret;
1257 register regnode *chain = NULL;
1258 register regnode *latest;
1259 I32 flags = 0, c = 0;
1264 if (!SIZE_ONLY && extralen)
1265 ret = reganode(BRANCHJ,0);
1267 ret = reg_node(BRANCH);
1270 if (!first && SIZE_ONLY)
1271 extralen += 1; /* BRANCHJ */
1273 *flagp = WORST; /* Tentatively. */
1277 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1279 latest = regpiece(&flags);
1280 if (latest == NULL) {
1281 if (flags & TRYAGAIN)
1284 } else if (ret == NULL)
1286 *flagp |= flags&HASWIDTH;
1287 if (chain == NULL) /* First piece. */
1288 *flagp |= flags&SPSTART;
1291 regtail(chain, latest);
1296 if (chain == NULL) { /* Loop ran zero times. */
1297 chain = reg_node(NOTHING);
1302 *flagp |= flags&SIMPLE;
1309 - regpiece - something followed by possible [*+?]
1311 * Note that the branching code sequences used for ? and the general cases
1312 * of * and + are somewhat optimized: they use the same NOTHING node as
1313 * both the endmarker for their branch list and the body of the last branch.
1314 * It might seem that this node could be dispensed with entirely, but the
1315 * endmarker role is not redundant.
1318 regpiece(I32 *flagp)
1320 register regnode *ret;
1322 register char *next;
1324 char *origparse = regcomp_parse;
1327 I32 max = REG_INFTY;
1329 ret = regatom(&flags);
1331 if (flags & TRYAGAIN)
1336 op = *regcomp_parse;
1338 if (op == '{' && regcurly(regcomp_parse)) {
1339 next = regcomp_parse + 1;
1341 while (isDIGIT(*next) || *next == ',') {
1350 if (*next == '}') { /* got one */
1354 min = atoi(regcomp_parse);
1358 maxpos = regcomp_parse;
1360 if (!max && *maxpos != '0')
1361 max = REG_INFTY; /* meaning "infinity" */
1362 else if (max >= REG_INFTY)
1363 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1364 regcomp_parse = next;
1368 if ((flags&SIMPLE)) {
1369 regnaughty += 2 + regnaughty / 2;
1370 reginsert(CURLY, ret);
1373 regnaughty += 4 + regnaughty; /* compound interest */
1374 regtail(ret, reg_node(WHILEM));
1375 if (!SIZE_ONLY && extralen) {
1376 reginsert(LONGJMP,ret);
1377 reginsert(NOTHING,ret);
1378 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1380 reginsert(CURLYX,ret);
1381 if (!SIZE_ONLY && extralen)
1382 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1383 regtail(ret, reg_node(NOTHING));
1393 if (max && max < min)
1394 FAIL("Can't do {n,m} with n > m");
1409 #if 0 /* Now runtime fix should be reliable. */
1410 if (!(flags&HASWIDTH) && op != '?')
1411 FAIL("regexp *+ operand could be empty");
1416 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1418 if (op == '*' && (flags&SIMPLE)) {
1419 reginsert(STAR, ret);
1423 else if (op == '*') {
1426 } else if (op == '+' && (flags&SIMPLE)) {
1427 reginsert(PLUS, ret);
1431 else if (op == '+') {
1434 } else if (op == '?') {
1439 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1440 warn("%.*s matches null string many times",
1441 regcomp_parse - origparse, origparse);
1444 if (*regcomp_parse == '?') {
1446 reginsert(MINMOD, ret);
1447 regtail(ret, ret + NODE_STEP_REGNODE);
1449 if (ISMULT2(regcomp_parse))
1450 FAIL("nested *?+ in regexp");
1456 - regatom - the lowest level
1458 * Optimization: gobbles an entire sequence of ordinary characters so that
1459 * it can turn them into a single node, which is smaller to store and
1460 * faster to run. Backslashed characters are exceptions, each becoming a
1461 * separate node; the code is simpler that way and it's not worth fixing.
1463 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1468 register regnode *ret = 0;
1471 *flagp = WORST; /* Tentatively. */
1474 switch (*regcomp_parse) {
1478 if (regflags & PMf_MULTILINE)
1479 ret = reg_node(MBOL);
1480 else if (regflags & PMf_SINGLELINE)
1481 ret = reg_node(SBOL);
1483 ret = reg_node(BOL);
1486 if (regcomp_parse[1])
1489 if (regflags & PMf_MULTILINE)
1490 ret = reg_node(MEOL);
1491 else if (regflags & PMf_SINGLELINE)
1492 ret = reg_node(SEOL);
1494 ret = reg_node(EOL);
1498 if (regflags & PMf_SINGLELINE)
1499 ret = reg_node(SANY);
1501 ret = reg_node(ANY);
1503 *flagp |= HASWIDTH|SIMPLE;
1508 *flagp |= HASWIDTH|SIMPLE;
1512 ret = reg(1, &flags);
1514 if (flags & TRYAGAIN)
1518 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1522 if (flags & TRYAGAIN) {
1526 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1527 /* Supposed to be caught earlier. */
1530 if (!regcurly(regcomp_parse)) {
1538 FAIL("?+*{} follows nothing in regexp");
1541 switch (*++regcomp_parse) {
1544 ret = reg_node(SBOL);
1549 ret = reg_node(GPOS);
1550 regseen |= REG_SEEN_GPOS;
1555 ret = reg_node(SEOL);
1560 ret = reg_node(EOS);
1562 seen_zerolen++; /* Do not optimize RE away */
1566 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1567 *flagp |= HASWIDTH|SIMPLE;
1571 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1572 *flagp |= HASWIDTH|SIMPLE;
1577 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1583 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1588 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1589 *flagp |= HASWIDTH|SIMPLE;
1593 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1594 *flagp |= HASWIDTH|SIMPLE;
1598 ret = reg_node(DIGIT);
1599 *flagp |= HASWIDTH|SIMPLE;
1603 ret = reg_node(NDIGIT);
1604 *flagp |= HASWIDTH|SIMPLE;
1617 case '1': case '2': case '3': case '4':
1618 case '5': case '6': case '7': case '8': case '9':
1620 I32 num = atoi(regcomp_parse);
1622 if (num > 9 && num >= regnpar)
1625 if (!SIZE_ONLY && num > regcomp_rx->nparens)
1626 FAIL("reference to nonexistent group");
1628 ret = reganode((regflags & PMf_FOLD)
1629 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1632 while (isDIGIT(*regcomp_parse))
1640 if (regcomp_parse >= regxend)
1641 FAIL("trailing \\ in regexp");
1649 if (regflags & PMf_EXTENDED) {
1650 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1651 if (regcomp_parse < regxend)
1666 ret = reg_node((regflags & PMf_FOLD)
1667 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1669 s = (char *) OPERAND(ret);
1670 regc(0, s++); /* save spot for len */
1671 for (len = 0, p = regcomp_parse - 1;
1672 len < 127 && p < regxend;
1677 if (regflags & PMf_EXTENDED)
1678 p = regwhite(p, regxend);
1729 ender = scan_hex(++p, 2, &numlen);
1734 ender = UCHARAT(p++);
1735 ender = toCTRL(ender);
1737 case '0': case '1': case '2': case '3':case '4':
1738 case '5': case '6': case '7': case '8':case '9':
1740 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1741 ender = scan_oct(p, 3, &numlen);
1751 FAIL("trailing \\ in regexp");
1762 if (regflags & PMf_EXTENDED)
1763 p = regwhite(p, regxend);
1764 if (ISMULT2(p)) { /* Back off on ?+*. */
1776 regcomp_parse = p - 1;
1779 FAIL("internal disaster in regexp");
1785 *OPERAND(ret) = len;
1788 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1790 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1800 regwhite(char *p, char *e)
1805 else if (*p == '#') {
1808 } while (p < e && *p != '\n');
1819 register char *opnd, *s;
1821 register I32 lastclass = 1234;
1822 register I32 range = 0;
1823 register regnode *ret;
1827 s = opnd = (char *) OPERAND(regcode);
1828 ret = reg_node(ANYOF);
1829 for (Class = 0; Class < 33; Class++)
1831 if (*regcomp_parse == '^') { /* Complement of range. */
1835 *opnd |= ANYOF_INVERT;
1838 regcode += ANY_SKIP;
1839 if (regflags & PMf_FOLD)
1840 *opnd |= ANYOF_FOLD;
1841 if (regflags & PMf_LOCALE)
1842 *opnd |= ANYOF_LOCALE;
1844 regsize += ANY_SKIP;
1846 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1847 goto skipcond; /* allow 1st char to be ] or - */
1848 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1850 Class = UCHARAT(regcomp_parse++);
1851 if (Class == '[' && regcomp_parse + 1 < regxend &&
1852 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1853 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1854 char posixccc = *regcomp_parse;
1855 char* posixccs = regcomp_parse++;
1857 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1859 if (regcomp_parse == regxend)
1860 /* Grandfather lone [:, [=, [. */
1861 regcomp_parse = posixccs;
1863 regcomp_parse++; /* skip over the posixccc */
1864 if (*regcomp_parse == ']') {
1865 /* Not Implemented Yet.
1866 * (POSIX Extended Character Classes, that is)
1867 * The text between e.g. [: and :] would start
1868 * at posixccs + 1 and stop at regcomp_parse - 2. */
1869 if (dowarn && !SIZE_ONLY)
1870 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1871 regcomp_parse++; /* skip over the ending ] */
1875 if (Class == '\\') {
1876 Class = UCHARAT(regcomp_parse++);
1880 if (regflags & PMf_LOCALE)
1881 *opnd |= ANYOF_ALNUML;
1883 for (Class = 0; Class < 256; Class++)
1885 ANYOF_SET(opnd, Class);
1892 if (regflags & PMf_LOCALE)
1893 *opnd |= ANYOF_NALNUML;
1895 for (Class = 0; Class < 256; Class++)
1896 if (!isALNUM(Class))
1897 ANYOF_SET(opnd, Class);
1904 if (regflags & PMf_LOCALE)
1905 *opnd |= ANYOF_SPACEL;
1907 for (Class = 0; Class < 256; Class++)
1909 ANYOF_SET(opnd, Class);
1916 if (regflags & PMf_LOCALE)
1917 *opnd |= ANYOF_NSPACEL;
1919 for (Class = 0; Class < 256; Class++)
1920 if (!isSPACE(Class))
1921 ANYOF_SET(opnd, Class);
1928 for (Class = '0'; Class <= '9'; Class++)
1929 ANYOF_SET(opnd, Class);
1935 for (Class = 0; Class < '0'; Class++)
1936 ANYOF_SET(opnd, Class);
1937 for (Class = '9' + 1; Class < 256; Class++)
1938 ANYOF_SET(opnd, Class);
1964 Class = scan_hex(regcomp_parse, 2, &numlen);
1965 regcomp_parse += numlen;
1968 Class = UCHARAT(regcomp_parse++);
1969 Class = toCTRL(Class);
1971 case '0': case '1': case '2': case '3': case '4':
1972 case '5': case '6': case '7': case '8': case '9':
1973 Class = scan_oct(--regcomp_parse, 3, &numlen);
1974 regcomp_parse += numlen;
1979 if (lastclass > Class)
1980 FAIL("invalid [] range in regexp");
1985 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
1986 regcomp_parse[1] != ']') {
1989 continue; /* do it next time */
1993 for ( ; lastclass <= Class; lastclass++)
1994 ANYOF_SET(opnd, lastclass);
1998 if (*regcomp_parse != ']')
1999 FAIL("unmatched [] in regexp");
2001 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2002 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2003 for (Class = 0; Class < 256; ++Class) {
2004 if (ANYOF_TEST(opnd, Class)) {
2005 I32 cf = fold[Class];
2006 ANYOF_SET(opnd, cf);
2009 *opnd &= ~ANYOF_FOLD;
2011 /* optimize inverted simple patterns (e.g. [^a-z]) */
2012 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2013 for (Class = 0; Class < 32; ++Class)
2014 opnd[1 + Class] ^= 0xFF;
2023 char* retval = regcomp_parse++;
2026 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2027 regcomp_parse[2] == '#') {
2028 while (*regcomp_parse && *regcomp_parse != ')')
2033 if (regflags & PMf_EXTENDED) {
2034 if (isSPACE(*regcomp_parse)) {
2038 else if (*regcomp_parse == '#') {
2039 while (*regcomp_parse && *regcomp_parse != '\n')
2050 - reg_node - emit a node
2052 STATIC regnode * /* Location. */
2055 register regnode *ret;
2056 register regnode *ptr;
2060 SIZE_ALIGN(regsize);
2065 NODE_ALIGN_FILL(ret);
2067 FILL_ADVANCE_NODE(ptr, op);
2074 - reganode - emit a node with an argument
2076 STATIC regnode * /* Location. */
2077 reganode(U8 op, U32 arg)
2079 register regnode *ret;
2080 register regnode *ptr;
2084 SIZE_ALIGN(regsize);
2089 NODE_ALIGN_FILL(ret);
2091 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2098 - regc - emit (if appropriate) a byte of code
2108 - reginsert - insert an operator in front of already-emitted operand
2110 * Means relocating the operand.
2113 reginsert(U8 op, regnode *opnd)
2115 register regnode *src;
2116 register regnode *dst;
2117 register regnode *place;
2118 register int offset = regarglen[(U8)op];
2120 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2123 regsize += NODE_STEP_REGNODE + offset;
2128 regcode += NODE_STEP_REGNODE + offset;
2131 StructCopy(--src, --dst, regnode);
2133 place = opnd; /* Op node, where operand used to be. */
2134 src = NEXTOPER(place);
2135 FILL_ADVANCE_NODE(place, op);
2136 Zero(src, offset, regnode);
2140 - regtail - set the next-pointer at the end of a node chain of p to val.
2143 regtail(regnode *p, regnode *val)
2145 register regnode *scan;
2146 register regnode *temp;
2147 register I32 offset;
2152 /* Find last node. */
2155 temp = regnext(scan);
2161 if (reg_off_by_arg[OP(scan)]) {
2162 ARG_SET(scan, val - scan);
2164 NEXT_OFF(scan) = val - scan;
2169 - regoptail - regtail on operand of first argument; nop if operandless
2172 regoptail(regnode *p, regnode *val)
2174 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2175 if (p == NULL || SIZE_ONLY)
2177 if (regkind[(U8)OP(p)] == BRANCH) {
2178 regtail(NEXTOPER(p), val);
2179 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2180 regtail(NEXTOPER(NEXTOPER(p)), val);
2186 - regcurly - a little FSA that accepts {\d+,?\d*}
2189 regcurly(register char *s)
2208 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2211 register char op = EXACT; /* Arbitrary non-END op. */
2212 register regnode *next, *onode;
2214 while (op != END && (!last || node < last)) {
2215 /* While that wasn't END last time... */
2221 next = regnext(node);
2223 if (OP(node) == OPTIMIZED)
2226 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2227 2*l + 1, "", SvPVX(sv));
2228 if (next == NULL) /* Next ptr. */
2229 PerlIO_printf(Perl_debug_log, "(0)");
2231 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2232 (void)PerlIO_putc(Perl_debug_log, '\n');
2234 if (regkind[(U8)op] == BRANCHJ) {
2235 register regnode *nnode = (OP(next) == LONGJMP
2238 if (last && nnode > last)
2240 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2241 } else if (regkind[(U8)op] == BRANCH) {
2242 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2243 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2244 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2245 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2246 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2247 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2249 } else if ( op == PLUS || op == STAR) {
2250 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2251 } else if (op == ANYOF) {
2252 node = NEXTOPER(node);
2254 } else if (regkind[(U8)op] == EXACT) {
2255 /* Literal string, where present. */
2256 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2257 node = NEXTOPER(node);
2259 node = NEXTOPER(node);
2260 node += regarglen[(U8)op];
2262 if (op == CURLYX || op == OPEN)
2264 else if (op == WHILEM)
2267 #endif /* DEBUGGING */
2272 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2278 SV *sv = sv_newmortal();
2280 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2282 /* Header fields of interest. */
2283 if (r->anchored_substr)
2284 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2286 SvPVX(r->anchored_substr),
2288 SvTAIL(r->anchored_substr) ? "$" : "",
2289 r->anchored_offset);
2290 if (r->float_substr)
2291 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2293 SvPVX(r->float_substr),
2295 SvTAIL(r->float_substr) ? "$" : "",
2296 r->float_min_offset, r->float_max_offset);
2297 if (r->check_substr)
2298 PerlIO_printf(Perl_debug_log,
2299 r->check_substr == r->float_substr
2300 ? "(checking floating" : "(checking anchored");
2301 if (r->reganch & ROPT_NOSCAN)
2302 PerlIO_printf(Perl_debug_log, " noscan");
2303 if (r->reganch & ROPT_CHECK_ALL)
2304 PerlIO_printf(Perl_debug_log, " isall");
2305 if (r->check_substr)
2306 PerlIO_printf(Perl_debug_log, ") ");
2308 if (r->regstclass) {
2309 regprop(sv, r->regstclass);
2310 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2312 if (r->reganch & ROPT_ANCH) {
2313 PerlIO_printf(Perl_debug_log, "anchored");
2314 if (r->reganch & ROPT_ANCH_BOL)
2315 PerlIO_printf(Perl_debug_log, "(BOL)");
2316 if (r->reganch & ROPT_ANCH_MBOL)
2317 PerlIO_printf(Perl_debug_log, "(MBOL)");
2318 if (r->reganch & ROPT_ANCH_GPOS)
2319 PerlIO_printf(Perl_debug_log, "(GPOS)");
2320 PerlIO_putc(Perl_debug_log, ' ');
2322 if (r->reganch & ROPT_GPOS_SEEN)
2323 PerlIO_printf(Perl_debug_log, "GPOS ");
2324 if (r->reganch & ROPT_SKIP)
2325 PerlIO_printf(Perl_debug_log, "plus ");
2326 if (r->reganch & ROPT_IMPLICIT)
2327 PerlIO_printf(Perl_debug_log, "implicit ");
2328 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2329 if (r->reganch & ROPT_EVAL_SEEN)
2330 PerlIO_printf(Perl_debug_log, "with eval ");
2331 PerlIO_printf(Perl_debug_log, "\n");
2332 #endif /* DEBUGGING */
2336 - regprop - printable representation of opcode
2339 regprop(SV *sv, regnode *o)
2342 register char *p = 0;
2380 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2383 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2386 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2413 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2416 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2419 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2422 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2425 sv_catpvf(sv, "REF%d", ARG(o));
2428 sv_catpvf(sv, "REFF%d", ARG(o));
2431 sv_catpvf(sv, "REFFL%d", ARG(o));
2434 sv_catpvf(sv, "OPEN%d", ARG(o));
2437 sv_catpvf(sv, "CLOSE%d", ARG(o));
2453 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2456 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2507 sv_catpvf(sv, "GROUPP%d", ARG(o));
2522 FAIL("corrupted regexp opcode");
2526 #endif /* DEBUGGING */
2530 pregfree(struct regexp *r)
2532 if (!r || (--r->refcnt > 0))
2535 Safefree(r->precomp);
2537 Safefree(r->subbase);
2539 if (r->anchored_substr)
2540 SvREFCNT_dec(r->anchored_substr);
2541 if (r->float_substr)
2542 SvREFCNT_dec(r->float_substr);
2543 Safefree(r->substrs);
2546 int n = r->data->count;
2548 switch (r->data->what[n]) {
2550 SvREFCNT_dec((SV*)r->data->data[n]);
2553 op_free((OP_4tree*)r->data->data[n]);
2558 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2561 Safefree(r->data->what);
2564 Safefree(r->startp);
2570 - regnext - dig the "next" pointer out of a node
2572 * [Note, when REGALIGN is defined there are two places in regmatch()
2573 * that bypass this code for speed.]
2576 regnext(register regnode *p)
2578 register I32 offset;
2583 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2591 re_croak2(const char* pat1,const char* pat2,...)
2594 STRLEN l1 = strlen(pat1);
2595 STRLEN l2 = strlen(pat2);
2603 Copy(pat1, buf, l1 , char);
2604 Copy(pat2, buf + l1, l2 , char);
2605 buf[l1 + l2] = '\n';
2606 buf[l1 + l2 + 1] = '\0';
2607 va_start(args, pat2);
2608 message = mess(buf, &args);
2610 l1 = strlen(message);
2613 Copy(message, buf, l1 , char);
2614 buf[l1] = '\0'; /* Overwrite \n */