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 /* Purify reports a benign UMR here sometimes, because we
271 * don't initialize the OP() slot of a node when that node
272 * is occupied by just the trailing null of the string in
274 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
283 if (OP(scan) != CURLYX) {
284 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
285 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
289 /* Skip NOTHING and LONGJMP. */
290 while ((n = regnext(n))
291 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
292 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
295 if (reg_off_by_arg[OP(scan)])
298 NEXT_OFF(scan) = off;
300 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
301 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
302 next = regnext(scan);
305 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
306 I32 max1 = 0, min1 = I32_MAX, num = 0;
308 if (flags & SCF_DO_SUBSTR)
310 while (OP(scan) == code) {
311 I32 deltanext, minnext;
315 next = regnext(scan);
316 scan = NEXTOPER(scan);
318 scan = NEXTOPER(scan);
319 /* We suppose the run is continuous, last=next...*/
320 minnext = study_chunk(&scan, &deltanext, next,
324 if (max1 < minnext + deltanext)
325 max1 = minnext + deltanext;
326 if (deltanext == I32_MAX)
329 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
331 if (data && (data_fake.flags & SF_HAS_EVAL))
332 data->flags |= SF_HAS_EVAL;
336 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
338 if (flags & SCF_DO_SUBSTR) {
339 data->pos_min += min1;
340 data->pos_delta += max1 - min1;
341 if (max1 != min1 || is_inf)
342 data->longest = &(data->longest_float);
345 delta += max1 - min1;
346 } else if (code == BRANCHJ) /* single branch is optimized. */
347 scan = NEXTOPER(NEXTOPER(scan));
348 else /* single branch is optimized. */
349 scan = NEXTOPER(scan);
351 } else if (OP(scan) == EXACT) {
352 min += *OPERAND(scan);
353 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
354 I32 l = *OPERAND(scan);
356 /* The code below prefers earlier match for fixed
357 offset, later match for variable offset. */
358 if (data->last_end == -1) { /* Update the start info. */
359 data->last_start_min = data->pos_min;
360 data->last_start_max = is_inf
361 ? I32_MAX : data->pos_min + data->pos_delta;
363 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
364 data->last_end = data->pos_min + l;
365 data->pos_min += l; /* As in the first entry. */
366 data->flags &= ~SF_BEFORE_EOL;
368 } else if (regkind[(U8)OP(scan)] == EXACT) {
369 if (flags & SCF_DO_SUBSTR)
371 min += *OPERAND(scan);
372 if (data && (flags & SCF_DO_SUBSTR))
373 data->pos_min += *OPERAND(scan);
374 } else if (strchr(varies,OP(scan))) {
375 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
376 regnode *oscan = scan;
378 switch (regkind[(U8)OP(scan)]) {
380 scan = NEXTOPER(scan);
383 if (flags & SCF_DO_SUBSTR) {
384 next = NEXTOPER(scan);
385 if (OP(next) == EXACT) {
387 maxcount = REG_INFTY;
388 next = regnext(scan);
389 scan = NEXTOPER(scan);
393 if (flags & SCF_DO_SUBSTR)
399 scan = regnext(scan);
400 if (flags & SCF_DO_SUBSTR) {
402 data->longest = &(data->longest_float);
404 goto optimize_curly_tail;
406 mincount = ARG1(scan);
407 maxcount = ARG2(scan);
408 next = regnext(scan);
409 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
411 if (flags & SCF_DO_SUBSTR) {
412 if (mincount == 0) scan_commit(data);
413 pos_before = data->pos_min;
417 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
419 data->flags |= SF_IS_INF;
421 /* This will finish on WHILEM, setting scan, or on NULL: */
422 minnext = study_chunk(&scan, &deltanext, last, data,
424 ? (flags & ~SCF_DO_SUBSTR) : flags);
425 if (!scan) /* It was not CURLYX, but CURLY. */
427 if (dowarn && (minnext + deltanext == 0)
428 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
429 warn("Strange *+?{} on zero-length expression");
430 min += minnext * mincount;
431 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
432 || deltanext == I32_MAX);
433 delta += (minnext + deltanext) * maxcount - minnext * mincount;
435 /* Try powerful optimization CURLYX => CURLYN. */
436 if ( OP(oscan) == CURLYX && data
437 && data->flags & SF_IN_PAR
438 && !(data->flags & SF_HAS_EVAL)
439 && !deltanext && minnext == 1 ) {
440 /* Try to optimize to CURLYN. */
441 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
442 regnode *nxt1 = nxt, *nxt2;
446 if (!strchr(simple,OP(nxt))
447 && !(regkind[(U8)OP(nxt)] == EXACT
448 && *OPERAND(nxt) == 1))
452 if (OP(nxt) != CLOSE)
454 /* Now we know that nxt2 is the only contents: */
455 oscan->flags = ARG(nxt);
457 OP(nxt1) = NOTHING; /* was OPEN. */
459 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
460 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
461 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
462 OP(nxt) = OPTIMIZED; /* was CLOSE. */
463 OP(nxt + 1) = OPTIMIZED; /* was count. */
464 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
469 /* Try optimization CURLYX => CURLYM. */
470 if ( OP(oscan) == CURLYX && data
471 && !(data->flags & SF_HAS_PAR)
472 && !(data->flags & SF_HAS_EVAL)
474 /* XXXX How to optimize if data == 0? */
475 /* Optimize to a simpler form. */
476 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
480 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
481 && (OP(nxt2) != WHILEM))
483 OP(nxt2) = SUCCEED; /* Whas WHILEM */
484 /* Need to optimize away parenths. */
485 if (data->flags & SF_IN_PAR) {
486 /* Set the parenth number. */
487 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
489 if (OP(nxt) != CLOSE)
490 FAIL("panic opt close");
491 oscan->flags = ARG(nxt);
492 OP(nxt1) = OPTIMIZED; /* was OPEN. */
493 OP(nxt) = OPTIMIZED; /* was CLOSE. */
495 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
496 OP(nxt + 1) = OPTIMIZED; /* was count. */
497 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
498 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
501 while ( nxt1 && (OP(nxt1) != WHILEM)) {
502 regnode *nnxt = regnext(nxt1);
505 if (reg_off_by_arg[OP(nxt1)])
506 ARG_SET(nxt1, nxt2 - nxt1);
507 else if (nxt2 - nxt1 < U16_MAX)
508 NEXT_OFF(nxt1) = nxt2 - nxt1;
510 OP(nxt) = NOTHING; /* Cannot beautify */
515 /* Optimize again: */
516 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
520 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
522 if (flags & SCF_DO_SUBSTR) {
523 SV *last_str = Nullsv;
524 int counted = mincount != 0;
526 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
527 I32 b = pos_before >= data->last_start_min
528 ? pos_before : data->last_start_min;
530 char *s = SvPV(data->last_found, l);
532 l -= b - data->last_start_min;
533 /* Get the added string: */
534 last_str = newSVpv(s + b - data->last_start_min, l);
535 if (deltanext == 0 && pos_before == b) {
536 /* What was added is a constant string */
538 SvGROW(last_str, (mincount * l) + 1);
539 repeatcpy(SvPVX(last_str) + l,
540 SvPVX(last_str), l, mincount - 1);
541 SvCUR(last_str) *= mincount;
542 /* Add additional parts. */
543 SvCUR_set(data->last_found,
544 SvCUR(data->last_found) - l);
545 sv_catsv(data->last_found, last_str);
546 data->last_end += l * (mincount - 1);
550 /* It is counted once already... */
551 data->pos_min += minnext * (mincount - counted);
552 data->pos_delta += - counted * deltanext +
553 (minnext + deltanext) * maxcount - minnext * mincount;
554 if (mincount != maxcount) {
556 if (mincount && last_str) {
557 sv_setsv(data->last_found, last_str);
558 data->last_end = data->pos_min;
559 data->last_start_min =
560 data->pos_min - SvCUR(last_str);
561 data->last_start_max = is_inf
563 : data->pos_min + data->pos_delta
566 data->longest = &(data->longest_float);
569 if (data && (fl & SF_HAS_EVAL))
570 data->flags |= SF_HAS_EVAL;
572 if (OP(oscan) != CURLYX) {
573 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
575 NEXT_OFF(oscan) += NEXT_OFF(next);
578 default: /* REF only? */
579 if (flags & SCF_DO_SUBSTR) {
581 data->longest = &(data->longest_float);
586 } else if (strchr(simple,OP(scan))) {
587 if (flags & SCF_DO_SUBSTR) {
592 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
593 data->flags |= (OP(scan) == MEOL
596 } else if (regkind[(U8)OP(scan)] == BRANCHJ
597 && (scan->flags || data)
598 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
599 I32 deltanext, minnext;
603 next = regnext(scan);
604 nscan = NEXTOPER(NEXTOPER(scan));
605 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
608 FAIL("variable length lookbehind not implemented");
609 } else if (minnext > U8_MAX) {
610 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
612 scan->flags = minnext;
614 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
616 if (data && (data_fake.flags & SF_HAS_EVAL))
617 data->flags |= SF_HAS_EVAL;
618 } else if (OP(scan) == OPEN) {
620 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
621 next = regnext(scan);
623 if ( next && (OP(next) != WHILEM) && next < last)
624 is_par = 0; /* Disable optimization */
625 } else if (OP(scan) == EVAL) {
627 data->flags |= SF_HAS_EVAL;
629 /* Else: zero-length, ignore. */
630 scan = regnext(scan);
635 *deltap = is_inf ? I32_MAX : delta;
636 if (flags & SCF_DO_SUBSTR && is_inf)
637 data->pos_delta = I32_MAX - data->pos_min;
640 if (is_par && pars==1 && data) {
641 data->flags |= SF_IN_PAR;
642 data->flags &= ~SF_HAS_PAR;
643 } else if (pars && data) {
644 data->flags |= SF_HAS_PAR;
645 data->flags &= ~SF_IN_PAR;
651 add_data(I32 n, char *s)
653 if (regcomp_rx->data) {
654 Renewc(regcomp_rx->data,
655 sizeof(*regcomp_rx->data) + sizeof(void*) * (regcomp_rx->data->count + n - 1),
656 char, struct reg_data);
657 Renew(regcomp_rx->data->what, regcomp_rx->data->count + n, U8);
658 regcomp_rx->data->count += n;
660 Newc(1207, regcomp_rx->data, sizeof(*regcomp_rx->data) + sizeof(void*) * (n - 1),
661 char, struct reg_data);
662 New(1208, regcomp_rx->data->what, n, U8);
663 regcomp_rx->data->count = n;
665 Copy(s, regcomp_rx->data->what + regcomp_rx->data->count - n, n, U8);
666 return regcomp_rx->data->count - n;
670 - pregcomp - compile a regular expression into internal code
672 * We can't allocate space until we know how big the compiled form will be,
673 * but we can't compile it (and thus know how big it is) until we've got a
674 * place to put the code. So we cheat: we compile it twice, once with code
675 * generation turned off and size counting turned on, and once "for real".
676 * This also means that we don't allocate space until we are sure that the
677 * thing really will compile successfully, and we never have to move the
678 * code and thus invalidate pointers into it. (Note that it has to be in
679 * one piece because free() must be able to free it all.) [NB: not true in perl]
681 * Beware that the optimization-preparation code in here knows about some
682 * of the structure of the compiled regexp. [I'll say.]
685 pregcomp(char *exp, char *xend, PMOP *pm)
699 FAIL("NULL regexp argument");
701 regprecomp = savepvn(exp, xend - exp);
702 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
703 xend - exp, regprecomp));
704 regflags = pm->op_pmflags;
708 seen_zerolen = *exp == '^' ? -1 : 0;
711 /* First pass: determine size, legality. */
718 regc((U8)MAGIC, (char*)regcode);
719 if (reg(0, &flags) == NULL) {
720 Safefree(regprecomp);
724 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
729 char *s = PerlEnv_getenv("TERMCAP_COLORS");
733 colors[0] = s = savepv(s);
737 FAIL("Not enough TABs in TERMCAP_COLORS");
746 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
747 colors[0],colors[1],colors[2],colors[3]);
751 /* Small enough for pointer-storage convention?
752 If extralen==0, this means that we will not need long jumps. */
753 if (regsize >= 0x10000L && extralen)
758 /* Allocate space and initialize. */
759 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
762 FAIL("regexp out of space");
764 r->prelen = xend - exp;
765 r->precomp = regprecomp;
766 r->subbeg = r->subbase = NULL;
769 /* Second pass: emit code. */
774 regcode = r->program;
775 regc((U8)MAGIC, (char*) regcode++);
777 if (reg(0, &flags) == NULL)
780 /* Dig out information for optimizations. */
781 pm->op_pmflags = regflags;
783 r->regstclass = NULL;
784 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
785 scan = r->program + 1; /* First BRANCH. */
787 /* XXXX To minimize changes to RE engine we always allocate
788 3-units-long substrs field. */
789 Newz(1004, r->substrs, 1, struct reg_substr_data);
791 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
794 STRLEN longest_float_length, longest_fixed_length;
796 StructCopy(&zero_scan_data, &data, scan_data_t);
798 /* Skip introductions and multiplicators >= 1. */
799 while ((OP(first) == OPEN && (sawopen = 1)) ||
800 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
801 (OP(first) == PLUS) ||
802 (OP(first) == MINMOD) ||
803 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
804 if (OP(first) == PLUS)
807 first += regarglen[(U8)OP(first)];
808 first = NEXTOPER(first);
811 /* Starting-point info. */
813 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
814 else if (strchr(simple+2,OP(first)))
815 r->regstclass = first;
816 else if (regkind[(U8)OP(first)] == BOUND ||
817 regkind[(U8)OP(first)] == NBOUND)
818 r->regstclass = first;
819 else if (regkind[(U8)OP(first)] == BOL) {
820 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
821 first = NEXTOPER(first);
824 else if (OP(first) == GPOS) {
825 r->reganch |= ROPT_ANCH_GPOS;
826 first = NEXTOPER(first);
829 else if ((OP(first) == STAR &&
830 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
831 !(r->reganch & ROPT_ANCH) )
833 /* turn .* into ^.* with an implied $*=1 */
834 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
835 first = NEXTOPER(first);
838 if (sawplus && (!sawopen || !regsawback))
839 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
841 /* Scan is after the zeroth branch, first is atomic matcher. */
842 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
845 * If there's something expensive in the r.e., find the
846 * longest literal string that must appear and make it the
847 * regmust. Resolve ties in favor of later strings, since
848 * the regstart check works with the beginning of the r.e.
849 * and avoiding duplication strengthens checking. Not a
850 * strong reason, but sufficient in the absence of others.
851 * [Now we resolve ties in favor of the earlier string if
852 * it happens that c_offset_min has been invalidated, since the
853 * earlier string may buy us something the later one won't.]
857 data.longest_fixed = newSVpv("",0);
858 data.longest_float = newSVpv("",0);
859 data.last_found = newSVpv("",0);
860 data.longest = &(data.longest_fixed);
863 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
864 &data, SCF_DO_SUBSTR);
865 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
866 && data.last_start_min == 0 && data.last_end > 0
868 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
869 r->reganch |= ROPT_CHECK_ALL;
871 SvREFCNT_dec(data.last_found);
873 longest_float_length = SvCUR(data.longest_float);
874 if (longest_float_length
875 || (data.flags & SF_FL_BEFORE_EOL
876 && (!(data.flags & SF_FL_BEFORE_MEOL)
877 || (regflags & PMf_MULTILINE)))) {
878 if (SvCUR(data.longest_fixed)
879 && data.offset_fixed == data.offset_float_min)
880 goto remove; /* Like in (a)+. */
882 r->float_substr = data.longest_float;
883 r->float_min_offset = data.offset_float_min;
884 r->float_max_offset = data.offset_float_max;
885 fbm_compile(r->float_substr, 0);
886 BmUSEFUL(r->float_substr) = 100;
887 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
888 && (!(data.flags & SF_FL_BEFORE_MEOL)
889 || (regflags & PMf_MULTILINE)))
890 SvTAIL_on(r->float_substr);
893 r->float_substr = Nullsv;
894 SvREFCNT_dec(data.longest_float);
895 longest_float_length = 0;
898 longest_fixed_length = SvCUR(data.longest_fixed);
899 if (longest_fixed_length
900 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
901 && (!(data.flags & SF_FIX_BEFORE_MEOL)
902 || (regflags & PMf_MULTILINE)))) {
903 r->anchored_substr = data.longest_fixed;
904 r->anchored_offset = data.offset_fixed;
905 fbm_compile(r->anchored_substr, 0);
906 BmUSEFUL(r->anchored_substr) = 100;
907 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
908 && (!(data.flags & SF_FIX_BEFORE_MEOL)
909 || (regflags & PMf_MULTILINE)))
910 SvTAIL_on(r->anchored_substr);
912 r->anchored_substr = Nullsv;
913 SvREFCNT_dec(data.longest_fixed);
914 longest_fixed_length = 0;
917 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
918 if (longest_fixed_length > longest_float_length) {
919 r->check_substr = r->anchored_substr;
920 r->check_offset_min = r->check_offset_max = r->anchored_offset;
921 if (r->reganch & ROPT_ANCH_SINGLE)
922 r->reganch |= ROPT_NOSCAN;
924 r->check_substr = r->float_substr;
925 r->check_offset_min = data.offset_float_min;
926 r->check_offset_max = data.offset_float_max;
929 /* Several toplevels. Best we can is to set minlen. */
932 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
933 scan = r->program + 1;
934 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
935 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
938 r->nparens = regnpar - 1;
940 if (regseen & REG_SEEN_GPOS)
941 r->reganch |= ROPT_GPOS_SEEN;
942 if (regseen & REG_SEEN_LOOKBEHIND)
943 r->reganch |= ROPT_LOOKBEHIND_SEEN;
944 if (regseen & REG_SEEN_EVAL)
945 r->reganch |= ROPT_EVAL_SEEN;
946 Newz(1002, r->startp, regnpar, char*);
947 Newz(1002, r->endp, regnpar, char*);
953 - reg - regular expression, i.e. main body or parenthesized thing
955 * Caller must absorb opening parenthesis.
957 * Combining parenthesis handling with the base level of regular expression
958 * is a trifle forced, but the need to tie the tails of the branches to what
959 * follows makes it hard to avoid.
962 reg(I32 paren, I32 *flagp)
963 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
965 register regnode *ret; /* Will be the head of the group. */
966 register regnode *br;
967 register regnode *lastbr;
968 register regnode *ender = 0;
969 register I32 parno = 0;
970 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
973 *flagp = HASWIDTH; /* Tentatively. */
975 /* Make an OPEN node, if parenthesized. */
977 if (*regcomp_parse == '?') {
979 paren = *regcomp_parse++;
980 ret = NULL; /* For look-ahead/behind. */
983 regseen |= REG_SEEN_LOOKBEHIND;
984 if (*regcomp_parse == '!')
986 if (*regcomp_parse != '=' && *regcomp_parse != '!')
997 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1000 while (*regcomp_parse && *regcomp_parse != ')')
1002 if (*regcomp_parse != ')')
1003 FAIL("Sequence (?#... not terminated");
1010 I32 count = 1, n = 0;
1012 char *s = regcomp_parse;
1014 OP_4tree *sop, *rop;
1017 regseen |= REG_SEEN_EVAL;
1018 while (count && (c = *regcomp_parse)) {
1019 if (c == '\\' && regcomp_parse[1])
1027 if (*regcomp_parse != ')')
1028 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1032 if (regcomp_parse - 1 - s)
1033 sv = newSVpv(s, regcomp_parse - 1 - s);
1035 sv = newSVpv("", 0);
1037 rop = sv_compile_2op(sv, &sop, "re", &av);
1039 n = add_data(3, "nso");
1040 regcomp_rx->data->data[n] = (void*)rop;
1041 regcomp_rx->data->data[n+1] = (void*)av;
1042 regcomp_rx->data->data[n+2] = (void*)sop;
1044 } else { /* First pass */
1046 FAIL("Eval-group in insecure regular expression");
1050 return reganode(EVAL, n);
1054 if (regcomp_parse[0] == '?') {
1055 if (regcomp_parse[1] == '=' || regcomp_parse[1] == '!'
1056 || regcomp_parse[1] == '<'
1057 || regcomp_parse[1] == '{') { /* Lookahead or eval. */
1060 ret = reg_node(LOGICAL);
1061 regtail(ret, reg(1, &flag));
1064 } else if (regcomp_parse[0] >= '1' && regcomp_parse[0] <= '9' ) {
1065 parno = atoi(regcomp_parse++);
1067 while (isDIGIT(*regcomp_parse))
1069 ret = reganode(GROUPP, parno);
1070 if ((c = *nextchar()) != ')')
1071 FAIL2("Switch (?(number%c not recognized", c);
1073 regtail(ret, reganode(IFTHEN, 0));
1074 br = regbranch(&flags, 1);
1076 br = reganode(LONGJMP, 0);
1078 regtail(br, reganode(LONGJMP, 0));
1081 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1082 regbranch(&flags, 1);
1083 regtail(ret, lastbr);
1088 FAIL("Switch (?(condition)... contains too many branches");
1089 ender = reg_node(TAIL);
1092 regtail(lastbr, ender);
1093 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1095 regtail(ret, ender);
1098 FAIL2("Unknown condition for (?(%.2s", regcomp_parse);
1102 FAIL("Sequence (? incomplete");
1106 while (*regcomp_parse && strchr("iogcmsx", *regcomp_parse)) {
1107 if (*regcomp_parse != 'o')
1108 pmflag(®flags, *regcomp_parse);
1112 if (*regcomp_parse != ')')
1113 FAIL2("Sequence (?%c...) not recognized", *regcomp_parse);
1122 ret = reganode(OPEN, parno);
1128 /* Pick up the branches, linking them together. */
1129 br = regbranch(&flags, 1);
1132 if (*regcomp_parse == '|') {
1133 if (!SIZE_ONLY && extralen) {
1134 reginsert(BRANCHJ, br);
1136 reginsert(BRANCH, br);
1139 extralen += 1; /* For BRANCHJ-BRANCH. */
1140 } else if (paren == ':') {
1141 *flagp |= flags&SIMPLE;
1143 if (open) { /* Starts with OPEN. */
1144 regtail(ret, br); /* OPEN -> first. */
1145 } else if (paren != '?') /* Not Conditional */
1147 if (!(flags&HASWIDTH))
1148 *flagp &= ~HASWIDTH;
1149 *flagp |= flags&SPSTART;
1151 while (*regcomp_parse == '|') {
1152 if (!SIZE_ONLY && extralen) {
1153 ender = reganode(LONGJMP,0);
1154 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1157 extralen += 2; /* Account for LONGJMP. */
1159 br = regbranch(&flags, 0);
1162 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1164 if (!(flags&HASWIDTH))
1165 *flagp &= ~HASWIDTH;
1166 *flagp |= flags&SPSTART;
1169 if (have_branch || paren != ':') {
1170 /* Make a closing node, and hook it on the end. */
1173 ender = reg_node(TAIL);
1176 ender = reganode(CLOSE, parno);
1183 ender = reg_node(SUCCEED);
1184 *flagp &= ~HASWIDTH;
1187 ender = reg_node(END);
1190 regtail(lastbr, ender);
1193 /* Hook the tails of the branches to the closing node. */
1194 for (br = ret; br != NULL; br = regnext(br)) {
1195 regoptail(br, ender);
1202 static char parens[] = "=!<,>";
1204 if (paren && (p = strchr(parens, paren))) {
1205 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1206 int flag = (p - parens) > 1;
1209 node = SUSPEND, flag = 0;
1210 reginsert(node,ret);
1212 regtail(ret, reg_node(TAIL));
1216 /* Check for proper termination. */
1217 if (paren && (regcomp_parse >= regxend || *nextchar() != ')')) {
1218 FAIL("unmatched () in regexp");
1219 } else if (!paren && regcomp_parse < regxend) {
1220 if (*regcomp_parse == ')') {
1221 FAIL("unmatched () in regexp");
1223 FAIL("junk on end of regexp"); /* "Can't happen". */
1227 regflags = oregflags;
1234 - regbranch - one alternative of an | operator
1236 * Implements the concatenation operator.
1239 regbranch(I32 *flagp, I32 first)
1241 register regnode *ret;
1242 register regnode *chain = NULL;
1243 register regnode *latest;
1244 I32 flags = 0, c = 0;
1249 if (!SIZE_ONLY && extralen)
1250 ret = reganode(BRANCHJ,0);
1252 ret = reg_node(BRANCH);
1255 if (!first && SIZE_ONLY)
1256 extralen += 1; /* BRANCHJ */
1258 *flagp = WORST; /* Tentatively. */
1262 while (regcomp_parse < regxend && *regcomp_parse != '|' && *regcomp_parse != ')') {
1264 latest = regpiece(&flags);
1265 if (latest == NULL) {
1266 if (flags & TRYAGAIN)
1269 } else if (ret == NULL)
1271 *flagp |= flags&HASWIDTH;
1272 if (chain == NULL) /* First piece. */
1273 *flagp |= flags&SPSTART;
1276 regtail(chain, latest);
1281 if (chain == NULL) { /* Loop ran zero times. */
1282 chain = reg_node(NOTHING);
1287 *flagp |= flags&SIMPLE;
1294 - regpiece - something followed by possible [*+?]
1296 * Note that the branching code sequences used for ? and the general cases
1297 * of * and + are somewhat optimized: they use the same NOTHING node as
1298 * both the endmarker for their branch list and the body of the last branch.
1299 * It might seem that this node could be dispensed with entirely, but the
1300 * endmarker role is not redundant.
1303 regpiece(I32 *flagp)
1305 register regnode *ret;
1307 register char *next;
1309 char *origparse = regcomp_parse;
1312 I32 max = REG_INFTY;
1314 ret = regatom(&flags);
1316 if (flags & TRYAGAIN)
1321 op = *regcomp_parse;
1323 if (op == '{' && regcurly(regcomp_parse)) {
1324 next = regcomp_parse + 1;
1326 while (isDIGIT(*next) || *next == ',') {
1335 if (*next == '}') { /* got one */
1339 min = atoi(regcomp_parse);
1343 maxpos = regcomp_parse;
1345 if (!max && *maxpos != '0')
1346 max = REG_INFTY; /* meaning "infinity" */
1347 else if (max >= REG_INFTY)
1348 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1349 regcomp_parse = next;
1353 if ((flags&SIMPLE)) {
1354 regnaughty += 2 + regnaughty / 2;
1355 reginsert(CURLY, ret);
1358 regnaughty += 4 + regnaughty; /* compound interest */
1359 regtail(ret, reg_node(WHILEM));
1360 if (!SIZE_ONLY && extralen) {
1361 reginsert(LONGJMP,ret);
1362 reginsert(NOTHING,ret);
1363 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1365 reginsert(CURLYX,ret);
1366 if (!SIZE_ONLY && extralen)
1367 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1368 regtail(ret, reg_node(NOTHING));
1375 *flagp = (WORST|HASWIDTH);
1376 if (max && max < min)
1377 FAIL("Can't do {n,m} with n > m");
1392 #if 0 /* Now runtime fix should be reliable. */
1393 if (!(flags&HASWIDTH) && op != '?')
1394 FAIL("regexp *+ operand could be empty");
1399 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1401 if (op == '*' && (flags&SIMPLE)) {
1402 reginsert(STAR, ret);
1406 else if (op == '*') {
1409 } else if (op == '+' && (flags&SIMPLE)) {
1410 reginsert(PLUS, ret);
1414 else if (op == '+') {
1417 } else if (op == '?') {
1422 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1423 warn("%.*s matches null string many times",
1424 regcomp_parse - origparse, origparse);
1427 if (*regcomp_parse == '?') {
1429 reginsert(MINMOD, ret);
1430 regtail(ret, ret + NODE_STEP_REGNODE);
1432 if (ISMULT2(regcomp_parse))
1433 FAIL("nested *?+ in regexp");
1439 - regatom - the lowest level
1441 * Optimization: gobbles an entire sequence of ordinary characters so that
1442 * it can turn them into a single node, which is smaller to store and
1443 * faster to run. Backslashed characters are exceptions, each becoming a
1444 * separate node; the code is simpler that way and it's not worth fixing.
1446 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1451 register regnode *ret = 0;
1454 *flagp = WORST; /* Tentatively. */
1457 switch (*regcomp_parse) {
1461 if (regflags & PMf_MULTILINE)
1462 ret = reg_node(MBOL);
1463 else if (regflags & PMf_SINGLELINE)
1464 ret = reg_node(SBOL);
1466 ret = reg_node(BOL);
1469 if (regcomp_parse[1])
1472 if (regflags & PMf_MULTILINE)
1473 ret = reg_node(MEOL);
1474 else if (regflags & PMf_SINGLELINE)
1475 ret = reg_node(SEOL);
1477 ret = reg_node(EOL);
1481 if (regflags & PMf_SINGLELINE)
1482 ret = reg_node(SANY);
1484 ret = reg_node(ANY);
1486 *flagp |= HASWIDTH|SIMPLE;
1491 *flagp |= HASWIDTH|SIMPLE;
1495 ret = reg(1, &flags);
1497 if (flags & TRYAGAIN)
1501 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1505 if (flags & TRYAGAIN) {
1509 FAIL2("internal urp in regexp at /%s/", regcomp_parse);
1510 /* Supposed to be caught earlier. */
1513 if (!regcurly(regcomp_parse)) {
1521 FAIL("?+*{} follows nothing in regexp");
1524 switch (*++regcomp_parse) {
1527 ret = reg_node(SBOL);
1532 ret = reg_node(GPOS);
1533 regseen |= REG_SEEN_GPOS;
1538 ret = reg_node(SEOL);
1543 ret = reg_node(EOS);
1545 seen_zerolen++; /* Do not optimize RE away */
1549 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1550 *flagp |= HASWIDTH|SIMPLE;
1554 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1555 *flagp |= HASWIDTH|SIMPLE;
1560 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1566 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1571 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1572 *flagp |= HASWIDTH|SIMPLE;
1576 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1577 *flagp |= HASWIDTH|SIMPLE;
1581 ret = reg_node(DIGIT);
1582 *flagp |= HASWIDTH|SIMPLE;
1586 ret = reg_node(NDIGIT);
1587 *flagp |= HASWIDTH|SIMPLE;
1600 case '1': case '2': case '3': case '4':
1601 case '5': case '6': case '7': case '8': case '9':
1603 I32 num = atoi(regcomp_parse);
1605 if (num > 9 && num >= regnpar)
1609 ret = reganode((regflags & PMf_FOLD)
1610 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1613 while (isDIGIT(*regcomp_parse))
1621 if (regcomp_parse >= regxend)
1622 FAIL("trailing \\ in regexp");
1630 if (regflags & PMf_EXTENDED) {
1631 while (regcomp_parse < regxend && *regcomp_parse != '\n') regcomp_parse++;
1632 if (regcomp_parse < regxend)
1647 ret = reg_node((regflags & PMf_FOLD)
1648 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1650 s = (char *) OPERAND(ret);
1651 regc(0, s++); /* save spot for len */
1652 for (len = 0, p = regcomp_parse - 1;
1653 len < 127 && p < regxend;
1658 if (regflags & PMf_EXTENDED)
1659 p = regwhite(p, regxend);
1710 ender = scan_hex(++p, 2, &numlen);
1715 ender = UCHARAT(p++);
1716 ender = toCTRL(ender);
1718 case '0': case '1': case '2': case '3':case '4':
1719 case '5': case '6': case '7': case '8':case '9':
1721 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1722 ender = scan_oct(p, 3, &numlen);
1732 FAIL("trailing \\ in regexp");
1743 if (regflags & PMf_EXTENDED)
1744 p = regwhite(p, regxend);
1745 if (ISMULT2(p)) { /* Back off on ?+*. */
1757 regcomp_parse = p - 1;
1760 FAIL("internal disaster in regexp");
1766 *OPERAND(ret) = len;
1769 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1771 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1781 regwhite(char *p, char *e)
1786 else if (*p == '#') {
1789 } while (p < e && *p != '\n');
1800 register char *opnd, *s;
1802 register I32 lastclass = 1234;
1803 register I32 range = 0;
1804 register regnode *ret;
1808 s = opnd = (char *) OPERAND(regcode);
1809 ret = reg_node(ANYOF);
1810 for (Class = 0; Class < 33; Class++)
1812 if (*regcomp_parse == '^') { /* Complement of range. */
1816 *opnd |= ANYOF_INVERT;
1819 regcode += ANY_SKIP;
1820 if (regflags & PMf_FOLD)
1821 *opnd |= ANYOF_FOLD;
1822 if (regflags & PMf_LOCALE)
1823 *opnd |= ANYOF_LOCALE;
1825 regsize += ANY_SKIP;
1827 if (*regcomp_parse == ']' || *regcomp_parse == '-')
1828 goto skipcond; /* allow 1st char to be ] or - */
1829 while (regcomp_parse < regxend && *regcomp_parse != ']') {
1831 Class = UCHARAT(regcomp_parse++);
1832 if (Class == '[' && regcomp_parse + 1 < regxend &&
1833 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1834 (*regcomp_parse == ':' || *regcomp_parse == '=' || *regcomp_parse == '.')) {
1835 char posixccc = *regcomp_parse;
1836 char* posixccs = regcomp_parse++;
1838 while (regcomp_parse < regxend && *regcomp_parse != posixccc)
1840 if (regcomp_parse == regxend)
1841 /* Grandfather lone [:, [=, [. */
1842 regcomp_parse = posixccs;
1844 regcomp_parse++; /* skip over the posixccc */
1845 if (*regcomp_parse == ']') {
1846 /* Not Implemented Yet.
1847 * (POSIX Extended Character Classes, that is)
1848 * The text between e.g. [: and :] would start
1849 * at posixccs + 1 and stop at regcomp_parse - 2. */
1850 if (dowarn && !SIZE_ONLY)
1851 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1852 regcomp_parse++; /* skip over the ending ] */
1856 if (Class == '\\') {
1857 Class = UCHARAT(regcomp_parse++);
1861 if (regflags & PMf_LOCALE)
1862 *opnd |= ANYOF_ALNUML;
1864 for (Class = 0; Class < 256; Class++)
1866 ANYOF_SET(opnd, Class);
1873 if (regflags & PMf_LOCALE)
1874 *opnd |= ANYOF_NALNUML;
1876 for (Class = 0; Class < 256; Class++)
1877 if (!isALNUM(Class))
1878 ANYOF_SET(opnd, Class);
1885 if (regflags & PMf_LOCALE)
1886 *opnd |= ANYOF_SPACEL;
1888 for (Class = 0; Class < 256; Class++)
1890 ANYOF_SET(opnd, Class);
1897 if (regflags & PMf_LOCALE)
1898 *opnd |= ANYOF_NSPACEL;
1900 for (Class = 0; Class < 256; Class++)
1901 if (!isSPACE(Class))
1902 ANYOF_SET(opnd, Class);
1909 for (Class = '0'; Class <= '9'; Class++)
1910 ANYOF_SET(opnd, Class);
1916 for (Class = 0; Class < '0'; Class++)
1917 ANYOF_SET(opnd, Class);
1918 for (Class = '9' + 1; Class < 256; Class++)
1919 ANYOF_SET(opnd, Class);
1945 Class = scan_hex(regcomp_parse, 2, &numlen);
1946 regcomp_parse += numlen;
1949 Class = UCHARAT(regcomp_parse++);
1950 Class = toCTRL(Class);
1952 case '0': case '1': case '2': case '3': case '4':
1953 case '5': case '6': case '7': case '8': case '9':
1954 Class = scan_oct(--regcomp_parse, 3, &numlen);
1955 regcomp_parse += numlen;
1960 if (lastclass > Class)
1961 FAIL("invalid [] range in regexp");
1966 if (*regcomp_parse == '-' && regcomp_parse+1 < regxend &&
1967 regcomp_parse[1] != ']') {
1970 continue; /* do it next time */
1974 for ( ; lastclass <= Class; lastclass++)
1975 ANYOF_SET(opnd, lastclass);
1979 if (*regcomp_parse != ']')
1980 FAIL("unmatched [] in regexp");
1982 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
1983 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
1984 for (Class = 0; Class < 256; ++Class) {
1985 if (ANYOF_TEST(opnd, Class)) {
1986 I32 cf = fold[Class];
1987 ANYOF_SET(opnd, cf);
1990 *opnd &= ~ANYOF_FOLD;
1992 /* optimize inverted simple patterns (e.g. [^a-z]) */
1993 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
1994 for (Class = 0; Class < 32; ++Class)
1995 opnd[1 + Class] ^= 0xFF;
2004 char* retval = regcomp_parse++;
2007 if (*regcomp_parse == '(' && regcomp_parse[1] == '?' &&
2008 regcomp_parse[2] == '#') {
2009 while (*regcomp_parse && *regcomp_parse != ')')
2014 if (regflags & PMf_EXTENDED) {
2015 if (isSPACE(*regcomp_parse)) {
2019 else if (*regcomp_parse == '#') {
2020 while (*regcomp_parse && *regcomp_parse != '\n')
2031 - reg_node - emit a node
2033 STATIC regnode * /* Location. */
2036 register regnode *ret;
2037 register regnode *ptr;
2041 SIZE_ALIGN(regsize);
2046 NODE_ALIGN_FILL(ret);
2048 FILL_ADVANCE_NODE(ptr, op);
2055 - reganode - emit a node with an argument
2057 STATIC regnode * /* Location. */
2058 reganode(U8 op, U32 arg)
2060 register regnode *ret;
2061 register regnode *ptr;
2065 SIZE_ALIGN(regsize);
2070 NODE_ALIGN_FILL(ret);
2072 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2079 - regc - emit (if appropriate) a byte of code
2089 - reginsert - insert an operator in front of already-emitted operand
2091 * Means relocating the operand.
2094 reginsert(U8 op, regnode *opnd)
2096 register regnode *src;
2097 register regnode *dst;
2098 register regnode *place;
2099 register int offset = regarglen[(U8)op];
2101 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2104 regsize += NODE_STEP_REGNODE + offset;
2109 regcode += NODE_STEP_REGNODE + offset;
2112 StructCopy(--src, --dst, regnode);
2114 place = opnd; /* Op node, where operand used to be. */
2115 src = NEXTOPER(place);
2116 FILL_ADVANCE_NODE(place, op);
2117 Zero(src, offset, regnode);
2121 - regtail - set the next-pointer at the end of a node chain of p to val.
2124 regtail(regnode *p, regnode *val)
2126 register regnode *scan;
2127 register regnode *temp;
2128 register I32 offset;
2133 /* Find last node. */
2136 temp = regnext(scan);
2142 if (reg_off_by_arg[OP(scan)]) {
2143 ARG_SET(scan, val - scan);
2145 NEXT_OFF(scan) = val - scan;
2150 - regoptail - regtail on operand of first argument; nop if operandless
2153 regoptail(regnode *p, regnode *val)
2155 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2156 if (p == NULL || SIZE_ONLY)
2158 if (regkind[(U8)OP(p)] == BRANCH) {
2159 regtail(NEXTOPER(p), val);
2160 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2161 regtail(NEXTOPER(NEXTOPER(p)), val);
2167 - regcurly - a little FSA that accepts {\d+,?\d*}
2170 regcurly(register char *s)
2189 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2192 register char op = EXACT; /* Arbitrary non-END op. */
2193 register regnode *next, *onode;
2195 while (op != END && (!last || node < last)) {
2196 /* While that wasn't END last time... */
2202 next = regnext(node);
2204 if (OP(node) == OPTIMIZED)
2207 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2208 2*l + 1, "", SvPVX(sv));
2209 if (next == NULL) /* Next ptr. */
2210 PerlIO_printf(Perl_debug_log, "(0)");
2212 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2213 (void)PerlIO_putc(Perl_debug_log, '\n');
2215 if (regkind[(U8)op] == BRANCHJ) {
2216 register regnode *nnode = (OP(next) == LONGJMP
2219 if (last && nnode > last)
2221 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2222 } else if (regkind[(U8)op] == BRANCH) {
2223 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2224 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2225 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2226 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2227 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2228 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2230 } else if ( op == PLUS || op == STAR) {
2231 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2232 } else if (op == ANYOF) {
2233 node = NEXTOPER(node);
2235 } else if (regkind[(U8)op] == EXACT) {
2236 /* Literal string, where present. */
2237 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2238 node = NEXTOPER(node);
2240 node = NEXTOPER(node);
2241 node += regarglen[(U8)op];
2243 if (op == CURLYX || op == OPEN)
2245 else if (op == WHILEM)
2248 #endif /* DEBUGGING */
2253 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2259 SV *sv = sv_newmortal();
2261 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2263 /* Header fields of interest. */
2264 if (r->anchored_substr)
2265 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2267 SvPVX(r->anchored_substr),
2269 SvTAIL(r->anchored_substr) ? "$" : "",
2270 r->anchored_offset);
2271 if (r->float_substr)
2272 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2274 SvPVX(r->float_substr),
2276 SvTAIL(r->float_substr) ? "$" : "",
2277 r->float_min_offset, r->float_max_offset);
2278 if (r->check_substr)
2279 PerlIO_printf(Perl_debug_log,
2280 r->check_substr == r->float_substr
2281 ? "(checking floating" : "(checking anchored");
2282 if (r->reganch & ROPT_NOSCAN)
2283 PerlIO_printf(Perl_debug_log, " noscan");
2284 if (r->reganch & ROPT_CHECK_ALL)
2285 PerlIO_printf(Perl_debug_log, " isall");
2286 if (r->check_substr)
2287 PerlIO_printf(Perl_debug_log, ") ");
2289 if (r->regstclass) {
2290 regprop(sv, r->regstclass);
2291 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2293 if (r->reganch & ROPT_ANCH) {
2294 PerlIO_printf(Perl_debug_log, "anchored");
2295 if (r->reganch & ROPT_ANCH_BOL)
2296 PerlIO_printf(Perl_debug_log, "(BOL)");
2297 if (r->reganch & ROPT_ANCH_MBOL)
2298 PerlIO_printf(Perl_debug_log, "(MBOL)");
2299 if (r->reganch & ROPT_ANCH_GPOS)
2300 PerlIO_printf(Perl_debug_log, "(GPOS)");
2301 PerlIO_putc(Perl_debug_log, ' ');
2303 if (r->reganch & ROPT_GPOS_SEEN)
2304 PerlIO_printf(Perl_debug_log, "GPOS ");
2305 if (r->reganch & ROPT_SKIP)
2306 PerlIO_printf(Perl_debug_log, "plus ");
2307 if (r->reganch & ROPT_IMPLICIT)
2308 PerlIO_printf(Perl_debug_log, "implicit ");
2309 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2310 if (r->reganch & ROPT_EVAL_SEEN)
2311 PerlIO_printf(Perl_debug_log, "with eval ");
2312 PerlIO_printf(Perl_debug_log, "\n");
2313 #endif /* DEBUGGING */
2317 - regprop - printable representation of opcode
2320 regprop(SV *sv, regnode *o)
2323 register char *p = 0;
2361 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2364 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2367 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2394 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2397 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2400 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2403 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2406 sv_catpvf(sv, "REF%d", ARG(o));
2409 sv_catpvf(sv, "REFF%d", ARG(o));
2412 sv_catpvf(sv, "REFFL%d", ARG(o));
2415 sv_catpvf(sv, "OPEN%d", ARG(o));
2418 sv_catpvf(sv, "CLOSE%d", ARG(o));
2434 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2437 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2488 sv_catpvf(sv, "GROUPP%d", ARG(o));
2503 FAIL("corrupted regexp opcode");
2507 #endif /* DEBUGGING */
2511 pregfree(struct regexp *r)
2513 if (!r || (--r->refcnt > 0))
2516 Safefree(r->precomp);
2518 Safefree(r->subbase);
2520 if (r->anchored_substr)
2521 SvREFCNT_dec(r->anchored_substr);
2522 if (r->float_substr)
2523 SvREFCNT_dec(r->float_substr);
2524 Safefree(r->substrs);
2527 int n = r->data->count;
2529 switch (r->data->what[n]) {
2531 SvREFCNT_dec((SV*)r->data->data[n]);
2534 op_free((OP_4tree*)r->data->data[n]);
2539 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2542 Safefree(r->data->what);
2545 Safefree(r->startp);
2551 - regnext - dig the "next" pointer out of a node
2553 * [Note, when REGALIGN is defined there are two places in regmatch()
2554 * that bypass this code for speed.]
2557 regnext(register regnode *p)
2559 register I32 offset;
2564 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2572 re_croak2(const char* pat1,const char* pat2,...)
2575 STRLEN l1 = strlen(pat1);
2576 STRLEN l2 = strlen(pat2);
2584 Copy(pat1, buf, l1 , char);
2585 Copy(pat2, buf + l1, l2 , char);
2586 buf[l1 + l2] = '\n';
2587 buf[l1 + l2 + 1] = '\0';
2588 va_start(args, pat2);
2589 message = mess(buf, &args);
2591 l1 = strlen(message);
2594 Copy(message, buf, l1 , char);
2595 buf[l1] = '\0'; /* Overwrite \n */