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.
105 static char* regwhite _((char *, char *));
107 static regnode *reg _((I32, I32 *));
108 static regnode *reganode _((U8, U32));
109 static regnode *regatom _((I32 *));
110 static regnode *regbranch _((I32 *, I32));
111 static void regc _((U8, char *));
112 static regnode *regclass _((void));
113 STATIC I32 regcurly _((char *));
114 static regnode *reg_node _((U8));
115 static regnode *regpiece _((I32 *));
116 static void reginsert _((U8, regnode *));
117 static void regoptail _((regnode *, regnode *));
118 static void regset _((char *, I32));
119 static void regtail _((regnode *, regnode *));
120 static char* nextchar _((void));
122 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
125 /* Length of a variant. */
134 I32 last_end; /* min value, <0 unless valid. */
137 SV **longest; /* Either &l_fixed, or &l_float. */
141 I32 offset_float_min;
142 I32 offset_float_max;
147 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
149 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
150 #define SF_BEFORE_SEOL 0x1
151 #define SF_BEFORE_MEOL 0x2
152 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
153 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
156 # define SF_FIX_SHIFT_EOL (0+2)
157 # define SF_FL_SHIFT_EOL (0+4)
159 # define SF_FIX_SHIFT_EOL (+2)
160 # define SF_FL_SHIFT_EOL (+4)
163 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
164 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
166 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
167 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
168 #define SF_IS_INF 0x40
169 #define SF_HAS_PAR 0x80
170 #define SF_IN_PAR 0x100
171 #define SF_HAS_EVAL 0x200
172 #define SCF_DO_SUBSTR 0x400
175 scan_commit(scan_data_t *data)
177 STRLEN l = SvCUR(data->last_found);
178 STRLEN old_l = SvCUR(*data->longest);
180 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
181 sv_setsv(*data->longest, data->last_found);
182 if (*data->longest == data->longest_fixed) {
183 data->offset_fixed = l ? data->last_start_min : data->pos_min;
184 if (data->flags & SF_BEFORE_EOL)
186 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
188 data->flags &= ~SF_FIX_BEFORE_EOL;
190 data->offset_float_min = l ? data->last_start_min : data->pos_min;
191 data->offset_float_max = (l
192 ? data->last_start_max
193 : data->pos_min + data->pos_delta);
194 if (data->flags & SF_BEFORE_EOL)
196 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
198 data->flags &= ~SF_FL_BEFORE_EOL;
201 SvCUR_set(data->last_found, 0);
203 data->flags &= ~SF_BEFORE_EOL;
206 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
207 to the position after last scanned or to NULL. */
210 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
211 /* scanp: Start here (read-write). */
212 /* deltap: Write maxlen-minlen here. */
213 /* last: Stop before this one. */
215 I32 min = 0, pars = 0, code;
216 regnode *scan = *scanp, *next;
218 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
219 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
220 scan_data_t data_fake;
222 while (scan && OP(scan) != END && scan < last) {
223 /* Peephole optimizer: */
225 if (regkind[(U8)OP(scan)] == EXACT) {
226 regnode *n = regnext(scan);
229 regnode *stop = scan;
232 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
233 /* Skip NOTHING, merge EXACT*. */
235 ( regkind[(U8)OP(n)] == NOTHING ||
236 (stringok && (OP(n) == OP(scan))))
238 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
239 if (OP(n) == TAIL || n > next)
241 if (regkind[(U8)OP(n)] == NOTHING) {
242 NEXT_OFF(scan) += NEXT_OFF(n);
243 next = n + NODE_STEP_REGNODE;
250 int oldl = *OPERAND(scan);
251 regnode *nnext = regnext(n);
253 if (oldl + *OPERAND(n) > U8_MAX)
255 NEXT_OFF(scan) += NEXT_OFF(n);
256 *OPERAND(scan) += *OPERAND(n);
257 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
258 /* Now we can overwrite *n : */
259 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
260 *OPERAND(n) + 1, char);
270 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
272 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
281 if (OP(scan) != CURLYX) {
282 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
283 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
287 /* Skip NOTHING and LONGJMP. */
288 while ((n = regnext(n))
289 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
290 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
293 if (reg_off_by_arg[OP(scan)])
296 NEXT_OFF(scan) = off;
298 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
299 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
300 next = regnext(scan);
303 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
304 I32 max1 = 0, min1 = I32_MAX, num = 0;
306 if (flags & SCF_DO_SUBSTR)
308 while (OP(scan) == code) {
309 I32 deltanext, minnext;
313 next = regnext(scan);
314 scan = NEXTOPER(scan);
316 scan = NEXTOPER(scan);
317 /* We suppose the run is continuous, last=next...*/
318 minnext = study_chunk(&scan, &deltanext, next,
322 if (max1 < minnext + deltanext)
323 max1 = minnext + deltanext;
324 if (deltanext == I32_MAX)
327 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
329 if (data && (data_fake.flags & SF_HAS_EVAL))
330 data->flags |= SF_HAS_EVAL;
334 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
336 if (flags & SCF_DO_SUBSTR) {
337 data->pos_min += min1;
338 data->pos_delta += max1 - min1;
339 if (max1 != min1 || is_inf)
340 data->longest = &(data->longest_float);
343 delta += max1 - min1;
344 } else if (code == BRANCHJ) /* single branch is optimized. */
345 scan = NEXTOPER(NEXTOPER(scan));
346 else /* single branch is optimized. */
347 scan = NEXTOPER(scan);
349 } else if (OP(scan) == EXACT) {
350 min += *OPERAND(scan);
351 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
352 I32 l = *OPERAND(scan);
354 /* The code below prefers earlier match for fixed
355 offset, later match for variable offset. */
356 if (data->last_end == -1) { /* Update the start info. */
357 data->last_start_min = data->pos_min;
358 data->last_start_max = is_inf
359 ? I32_MAX : data->pos_min + data->pos_delta;
361 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
362 data->last_end = data->pos_min + l;
363 data->pos_min += l; /* As in the first entry. */
364 data->flags &= ~SF_BEFORE_EOL;
366 } else if (regkind[(U8)OP(scan)] == EXACT) {
367 if (flags & SCF_DO_SUBSTR)
369 min += *OPERAND(scan);
370 if (data && (flags & SCF_DO_SUBSTR))
371 data->pos_min += *OPERAND(scan);
372 } else if (strchr(varies,OP(scan))) {
373 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
374 regnode *oscan = scan;
376 switch (regkind[(U8)OP(scan)]) {
378 scan = NEXTOPER(scan);
381 if (flags & SCF_DO_SUBSTR) {
382 next = NEXTOPER(scan);
383 if (OP(next) == EXACT) {
385 maxcount = REG_INFTY;
386 next = regnext(scan);
387 scan = NEXTOPER(scan);
391 if (flags & SCF_DO_SUBSTR)
397 scan = regnext(scan);
398 if (flags & SCF_DO_SUBSTR) {
400 data->longest = &(data->longest_float);
402 goto optimize_curly_tail;
404 mincount = ARG1(scan);
405 maxcount = ARG2(scan);
406 next = regnext(scan);
407 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
409 if (flags & SCF_DO_SUBSTR) {
410 if (mincount == 0) scan_commit(data);
411 pos_before = data->pos_min;
415 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
417 data->flags |= SF_IS_INF;
419 /* This will finish on WHILEM, setting scan, or on NULL: */
420 minnext = study_chunk(&scan, &deltanext, last, data,
422 ? (flags & ~SCF_DO_SUBSTR) : flags);
423 if (!scan) /* It was not CURLYX, but CURLY. */
425 if (dowarn && (minnext + deltanext == 0)
426 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
427 warn("Strange *+?{} on zero-length expression");
428 min += minnext * mincount;
429 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
430 || deltanext == I32_MAX);
431 delta += (minnext + deltanext) * maxcount - minnext * mincount;
433 /* Try powerful optimization CURLYX => CURLYN. */
434 #ifdef REGALIGN_STRUCT
435 if ( OP(oscan) == CURLYX && data
436 && data->flags & SF_IN_PAR
437 && !(data->flags & SF_HAS_EVAL)
438 && !deltanext && minnext == 1 ) {
439 /* Try to optimize to CURLYN. */
440 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
441 regnode *nxt1 = nxt, *nxt2;
445 if (!strchr(simple,OP(nxt))
446 && !(regkind[(U8)OP(nxt)] == EXACT
447 && *OPERAND(nxt) == 1))
451 if (OP(nxt) != CLOSE)
453 /* Now we know that nxt2 is the only contents: */
454 oscan->flags = ARG(nxt);
456 OP(nxt1) = NOTHING; /* was OPEN. */
458 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
459 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
460 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
461 OP(nxt) = OPTIMIZED; /* was CLOSE. */
462 OP(nxt + 1) = OPTIMIZED; /* was count. */
463 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
469 /* Try optimization CURLYX => CURLYM. */
470 if ( OP(oscan) == CURLYX && data
471 #ifdef REGALIGN_STRUCT
472 && !(data->flags & SF_HAS_PAR)
474 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
476 && !(data->flags & SF_HAS_EVAL)
478 /* XXXX How to optimize if data == 0? */
479 /* Optimize to a simpler form. */
480 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
484 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
485 && (OP(nxt2) != WHILEM))
487 OP(nxt2) = SUCCEED; /* Whas WHILEM */
488 #ifdef REGALIGN_STRUCT
489 /* Need to optimize away parenths. */
490 if (data->flags & SF_IN_PAR) {
491 /* Set the parenth number. */
492 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
494 if (OP(nxt) != CLOSE)
495 FAIL("panic opt close");
496 oscan->flags = ARG(nxt);
497 OP(nxt1) = OPTIMIZED; /* was OPEN. */
498 OP(nxt) = OPTIMIZED; /* was CLOSE. */
500 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
501 OP(nxt + 1) = OPTIMIZED; /* was count. */
502 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
503 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
506 while ( nxt1 && (OP(nxt1) != WHILEM)) {
507 regnode *nnxt = regnext(nxt1);
510 if (reg_off_by_arg[OP(nxt1)])
511 ARG_SET(nxt1, nxt2 - nxt1);
512 else if (nxt2 - nxt1 < U16_MAX)
513 NEXT_OFF(nxt1) = nxt2 - nxt1;
515 OP(nxt) = NOTHING; /* Cannot beautify */
520 /* Optimize again: */
521 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
526 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
528 if (flags & SCF_DO_SUBSTR) {
529 SV *last_str = Nullsv;
530 int counted = mincount != 0;
532 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
533 I32 b = pos_before >= data->last_start_min
534 ? pos_before : data->last_start_min;
536 char *s = SvPV(data->last_found, l);
538 l -= b - data->last_start_min;
539 /* Get the added string: */
540 last_str = newSVpv(s + b - data->last_start_min, l);
541 if (deltanext == 0 && pos_before == b) {
542 /* What was added is a constant string */
544 SvGROW(last_str, (mincount * l) + 1);
545 repeatcpy(SvPVX(last_str) + l,
546 SvPVX(last_str), l, mincount - 1);
547 SvCUR(last_str) *= mincount;
548 /* Add additional parts. */
549 SvCUR_set(data->last_found,
550 SvCUR(data->last_found) - l);
551 sv_catsv(data->last_found, last_str);
552 data->last_end += l * (mincount - 1);
556 /* It is counted once already... */
557 data->pos_min += minnext * (mincount - counted);
558 data->pos_delta += - counted * deltanext +
559 (minnext + deltanext) * maxcount - minnext * mincount;
560 if (mincount != maxcount) {
562 if (mincount && last_str) {
563 sv_setsv(data->last_found, last_str);
564 data->last_end = data->pos_min;
565 data->last_start_min =
566 data->pos_min - SvCUR(last_str);
567 data->last_start_max = is_inf
569 : data->pos_min + data->pos_delta
572 data->longest = &(data->longest_float);
575 if (data && (fl & SF_HAS_EVAL))
576 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);
586 default: /* REF only? */
587 if (flags & SCF_DO_SUBSTR) {
589 data->longest = &(data->longest_float);
594 } else if (strchr(simple,OP(scan))) {
595 if (flags & SCF_DO_SUBSTR) {
600 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
601 data->flags |= (OP(scan) == MEOL
604 } else if (regkind[(U8)OP(scan)] == BRANCHJ
605 && (scan->flags || data)
606 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
607 I32 deltanext, minnext;
611 next = regnext(scan);
612 nscan = NEXTOPER(NEXTOPER(scan));
613 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
616 FAIL("variable length lookbehind not implemented");
617 } else if (minnext > U8_MAX) {
618 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
620 scan->flags = minnext;
622 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
624 if (data && (data_fake.flags & SF_HAS_EVAL))
625 data->flags |= SF_HAS_EVAL;
626 } else if (OP(scan) == OPEN) {
628 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
629 #ifdef REGALIGN_STRUCT
630 next = regnext(scan);
632 if ( next && (OP(next) != WHILEM) && next < last)
634 is_par = 0; /* Disable optimization */
635 } else if (OP(scan) == EVAL) {
637 data->flags |= SF_HAS_EVAL;
639 /* Else: zero-length, ignore. */
640 scan = regnext(scan);
645 *deltap = is_inf ? I32_MAX : delta;
646 if (flags & SCF_DO_SUBSTR && is_inf)
647 data->pos_delta = I32_MAX - data->pos_min;
650 if (is_par && pars==1 && data) {
651 data->flags |= SF_IN_PAR;
652 data->flags &= ~SF_HAS_PAR;
653 } else if (pars && data) {
654 data->flags |= SF_HAS_PAR;
655 data->flags &= ~SF_IN_PAR;
661 add_data(I32 n, char *s)
665 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
666 char, struct reg_data);
667 Renew(rx->data->what, rx->data->count + n, U8);
668 rx->data->count += n;
670 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
671 char, struct reg_data);
672 New(1208, rx->data->what, n, U8);
675 Copy(s, rx->data->what + rx->data->count - n, n, U8);
676 return rx->data->count - n;
680 - pregcomp - compile a regular expression into internal code
682 * We can't allocate space until we know how big the compiled form will be,
683 * but we can't compile it (and thus know how big it is) until we've got a
684 * place to put the code. So we cheat: we compile it twice, once with code
685 * generation turned off and size counting turned on, and once "for real".
686 * This also means that we don't allocate space until we are sure that the
687 * thing really will compile successfully, and we never have to move the
688 * code and thus invalidate pointers into it. (Note that it has to be in
689 * one piece because free() must be able to free it all.) [NB: not true in perl]
691 * Beware that the optimization-preparation code in here knows about some
692 * of the structure of the compiled regexp. [I'll say.]
695 pregcomp(char *exp, char *xend, PMOP *pm)
709 FAIL("NULL regexp argument");
711 regprecomp = savepvn(exp, xend - exp);
712 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
713 xend - exp, regprecomp));
714 regflags = pm->op_pmflags;
718 seen_zerolen = *exp == '^' ? -1 : 0;
721 /* First pass: determine size, legality. */
728 regc((U8)MAGIC, (char*)regcode);
729 if (reg(0, &flags) == NULL) {
730 Safefree(regprecomp);
734 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
739 char *s = PerlEnv_getenv("TERMCAP_COLORS");
743 colors[0] = s = savepv(s);
747 FAIL("Not enough TABs in TERMCAP_COLORS");
756 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
757 colors[0],colors[1],colors[2],colors[3]);
761 /* Small enough for pointer-storage convention?
762 If extralen==0, this means that we will not need long jumps. */
763 #ifndef REGALIGN_STRUCT
764 if (regsize >= 0x10000L && extralen)
765 FAIL("regexp too big");
767 if (regsize >= 0x10000L && extralen)
773 /* Allocate space and initialize. */
774 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
777 FAIL("regexp out of space");
779 r->prelen = xend - exp;
780 r->precomp = regprecomp;
781 r->subbeg = r->subbase = NULL;
784 /* Second pass: emit code. */
789 regcode = r->program;
790 regc((U8)MAGIC, (char*) regcode++);
792 if (reg(0, &flags) == NULL)
795 /* Dig out information for optimizations. */
796 pm->op_pmflags = regflags;
798 r->regstclass = NULL;
799 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
800 scan = r->program + 1; /* First BRANCH. */
802 /* XXXX To minimize changes to RE engine we always allocate
803 3-units-long substrs field. */
804 Newz(1004, r->substrs, 1, struct reg_substr_data);
806 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
809 STRLEN longest_float_length, longest_fixed_length;
811 StructCopy(&zero_scan_data, &data, scan_data_t);
813 /* Skip introductions and multiplicators >= 1. */
814 while ((OP(first) == OPEN && (sawopen = 1)) ||
815 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
816 (OP(first) == PLUS) ||
817 (OP(first) == MINMOD) ||
818 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
819 if (OP(first) == PLUS)
822 first += regarglen[(U8)OP(first)];
823 first = NEXTOPER(first);
826 /* Starting-point info. */
828 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
829 else if (strchr(simple+2,OP(first)))
830 r->regstclass = first;
831 else if (regkind[(U8)OP(first)] == BOUND ||
832 regkind[(U8)OP(first)] == NBOUND)
833 r->regstclass = first;
834 else if (regkind[(U8)OP(first)] == BOL) {
835 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
836 first = NEXTOPER(first);
839 else if (OP(first) == GPOS) {
840 r->reganch |= ROPT_ANCH_GPOS;
841 first = NEXTOPER(first);
844 else if ((OP(first) == STAR &&
845 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
846 !(r->reganch & ROPT_ANCH) )
848 /* turn .* into ^.* with an implied $*=1 */
849 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
850 first = NEXTOPER(first);
853 if (sawplus && (!sawopen || !regsawback))
854 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
856 /* Scan is after the zeroth branch, first is atomic matcher. */
857 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
860 * If there's something expensive in the r.e., find the
861 * longest literal string that must appear and make it the
862 * regmust. Resolve ties in favor of later strings, since
863 * the regstart check works with the beginning of the r.e.
864 * and avoiding duplication strengthens checking. Not a
865 * strong reason, but sufficient in the absence of others.
866 * [Now we resolve ties in favor of the earlier string if
867 * it happens that c_offset_min has been invalidated, since the
868 * earlier string may buy us something the later one won't.]
872 data.longest_fixed = newSVpv("",0);
873 data.longest_float = newSVpv("",0);
874 data.last_found = newSVpv("",0);
875 data.longest = &(data.longest_fixed);
878 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
879 &data, SCF_DO_SUBSTR);
880 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
881 && data.last_start_min == 0 && data.last_end > 0
883 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
884 r->reganch |= ROPT_CHECK_ALL;
886 SvREFCNT_dec(data.last_found);
888 longest_float_length = SvCUR(data.longest_float);
889 if (longest_float_length
890 || (data.flags & SF_FL_BEFORE_EOL
891 && (!(data.flags & SF_FL_BEFORE_MEOL)
892 || (regflags & PMf_MULTILINE)))) {
893 if (SvCUR(data.longest_fixed)
894 && data.offset_fixed == data.offset_float_min)
895 goto remove; /* Like in (a)+. */
897 r->float_substr = data.longest_float;
898 r->float_min_offset = data.offset_float_min;
899 r->float_max_offset = data.offset_float_max;
900 fbm_compile(r->float_substr, 0);
901 BmUSEFUL(r->float_substr) = 100;
902 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
903 && (!(data.flags & SF_FL_BEFORE_MEOL)
904 || (regflags & PMf_MULTILINE)))
905 SvTAIL_on(r->float_substr);
908 r->float_substr = Nullsv;
909 SvREFCNT_dec(data.longest_float);
910 longest_float_length = 0;
913 longest_fixed_length = SvCUR(data.longest_fixed);
914 if (longest_fixed_length
915 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
916 && (!(data.flags & SF_FIX_BEFORE_MEOL)
917 || (regflags & PMf_MULTILINE)))) {
918 r->anchored_substr = data.longest_fixed;
919 r->anchored_offset = data.offset_fixed;
920 fbm_compile(r->anchored_substr, 0);
921 BmUSEFUL(r->anchored_substr) = 100;
922 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
923 && (!(data.flags & SF_FIX_BEFORE_MEOL)
924 || (regflags & PMf_MULTILINE)))
925 SvTAIL_on(r->anchored_substr);
927 r->anchored_substr = Nullsv;
928 SvREFCNT_dec(data.longest_fixed);
929 longest_fixed_length = 0;
932 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
933 if (longest_fixed_length > longest_float_length) {
934 r->check_substr = r->anchored_substr;
935 r->check_offset_min = r->check_offset_max = r->anchored_offset;
936 if (r->reganch & ROPT_ANCH_SINGLE)
937 r->reganch |= ROPT_NOSCAN;
939 r->check_substr = r->float_substr;
940 r->check_offset_min = data.offset_float_min;
941 r->check_offset_max = data.offset_float_max;
944 /* Several toplevels. Best we can is to set minlen. */
947 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
948 scan = r->program + 1;
949 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
950 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
953 r->nparens = regnpar - 1;
955 if (regseen & REG_SEEN_GPOS)
956 r->reganch |= ROPT_GPOS_SEEN;
957 if (regseen & REG_SEEN_LOOKBEHIND)
958 r->reganch |= ROPT_LOOKBEHIND_SEEN;
959 Newz(1002, r->startp, regnpar, char*);
960 Newz(1002, r->endp, regnpar, char*);
966 - reg - regular expression, i.e. main body or parenthesized thing
968 * Caller must absorb opening parenthesis.
970 * Combining parenthesis handling with the base level of regular expression
971 * is a trifle forced, but the need to tie the tails of the branches to what
972 * follows makes it hard to avoid.
975 reg(I32 paren, I32 *flagp)
976 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
978 register regnode *ret; /* Will be the head of the group. */
979 register regnode *br;
980 register regnode *lastbr;
981 register regnode *ender = 0;
982 register I32 parno = 0;
983 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
986 *flagp = HASWIDTH; /* Tentatively. */
988 /* Make an OPEN node, if parenthesized. */
990 if (*regparse == '?') {
993 ret = NULL; /* For look-ahead/behind. */
996 #ifndef REGALIGN_STRUCT
997 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
999 regseen |= REG_SEEN_LOOKBEHIND;
1000 if (*regparse == '!')
1002 if (*regparse != '=' && *regparse != '!')
1013 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1016 while (*regparse && *regparse != ')')
1018 if (*regparse != ')')
1019 FAIL("Sequence (?#... not terminated");
1026 I32 count = 1, n = 0;
1030 OP_4tree *sop, *rop;
1033 while (count && (c = *regparse)) {
1034 if (c == '\\' && regparse[1])
1042 if (*regparse != ')')
1043 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1047 if (regparse - 1 - s)
1048 sv = newSVpv(s, regparse - 1 - s);
1050 sv = newSVpv("", 0);
1052 rop = sv_compile_2op(sv, &sop, "re", &av);
1054 n = add_data(3, "nso");
1055 rx->data->data[n] = (void*)rop;
1056 rx->data->data[n+1] = (void*)av;
1057 rx->data->data[n+2] = (void*)sop;
1059 } else { /* First pass */
1061 FAIL("Eval-group in insecure regular expression");
1065 return reganode(EVAL, n);
1069 if (regparse[0] == '?') {
1070 if (regparse[1] == '=' || regparse[1] == '!'
1071 || regparse[1] == '<'
1072 || regparse[1] == '{') { /* Lookahead or eval. */
1075 ret = reg_node(LOGICAL);
1076 regtail(ret, reg(1, &flag));
1079 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1080 parno = atoi(regparse++);
1082 while (isDIGIT(*regparse))
1084 ret = reganode(GROUPP, parno);
1085 if ((c = *nextchar()) != ')')
1086 FAIL2("Switch (?(number%c not recognized", c);
1088 regtail(ret, reganode(IFTHEN, 0));
1089 br = regbranch(&flags, 1);
1091 br = reganode(LONGJMP, 0);
1093 regtail(br, reganode(LONGJMP, 0));
1096 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1097 regbranch(&flags, 1);
1098 regtail(ret, lastbr);
1103 FAIL("Switch (?(condition)... contains too many branches");
1104 ender = reg_node(TAIL);
1107 regtail(lastbr, ender);
1108 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1110 regtail(ret, ender);
1113 FAIL2("Unknown condition for (?(%.2s", regparse);
1117 FAIL("Sequence (? incomplete");
1121 while (*regparse && strchr("iogcmsx", *regparse))
1122 pmflag(®flags, *regparse++);
1124 if (*regparse != ')')
1125 FAIL2("Sequence (?%c...) not recognized", *regparse);
1134 ret = reganode(OPEN, parno);
1140 /* Pick up the branches, linking them together. */
1141 br = regbranch(&flags, 1);
1144 if (*regparse == '|') {
1145 if (!SIZE_ONLY && extralen) {
1146 reginsert(BRANCHJ, br);
1148 reginsert(BRANCH, br);
1151 extralen += 1; /* For BRANCHJ-BRANCH. */
1152 } else if (paren == ':') {
1153 *flagp |= flags&SIMPLE;
1155 if (open) { /* Starts with OPEN. */
1156 regtail(ret, br); /* OPEN -> first. */
1157 } else if (paren != '?') /* Not Conditional */
1159 if (!(flags&HASWIDTH))
1160 *flagp &= ~HASWIDTH;
1161 *flagp |= flags&SPSTART;
1163 while (*regparse == '|') {
1164 if (!SIZE_ONLY && extralen) {
1165 ender = reganode(LONGJMP,0);
1166 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1169 extralen += 2; /* Account for LONGJMP. */
1171 br = regbranch(&flags, 0);
1174 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1176 if (!(flags&HASWIDTH))
1177 *flagp &= ~HASWIDTH;
1178 *flagp |= flags&SPSTART;
1181 if (have_branch || paren != ':') {
1182 /* Make a closing node, and hook it on the end. */
1185 ender = reg_node(TAIL);
1188 ender = reganode(CLOSE, parno);
1195 ender = reg_node(SUCCEED);
1196 *flagp &= ~HASWIDTH;
1199 ender = reg_node(END);
1202 regtail(lastbr, ender);
1205 /* Hook the tails of the branches to the closing node. */
1206 for (br = ret; br != NULL; br = regnext(br)) {
1207 regoptail(br, ender);
1214 static char parens[] = "=!<,>";
1216 if (paren && (p = strchr(parens, paren))) {
1217 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1218 int flag = (p - parens) > 1;
1221 node = SUSPEND, flag = 0;
1222 reginsert(node,ret);
1223 #ifdef REGALIGN_STRUCT
1226 regtail(ret, reg_node(TAIL));
1230 /* Check for proper termination. */
1231 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1232 FAIL("unmatched () in regexp");
1233 } else if (!paren && regparse < regxend) {
1234 if (*regparse == ')') {
1235 FAIL("unmatched () in regexp");
1237 FAIL("junk on end of regexp"); /* "Can't happen". */
1241 regflags = oregflags;
1248 - regbranch - one alternative of an | operator
1250 * Implements the concatenation operator.
1253 regbranch(I32 *flagp, I32 first)
1255 register regnode *ret;
1256 register regnode *chain = NULL;
1257 register regnode *latest;
1258 I32 flags = 0, c = 0;
1263 if (!SIZE_ONLY && extralen)
1264 ret = reganode(BRANCHJ,0);
1266 ret = reg_node(BRANCH);
1269 if (!first && SIZE_ONLY)
1270 extralen += 1; /* BRANCHJ */
1272 *flagp = WORST; /* Tentatively. */
1276 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1278 latest = regpiece(&flags);
1279 if (latest == NULL) {
1280 if (flags & TRYAGAIN)
1283 } else if (ret == NULL)
1285 *flagp |= flags&HASWIDTH;
1286 if (chain == NULL) /* First piece. */
1287 *flagp |= flags&SPSTART;
1290 regtail(chain, latest);
1295 if (chain == NULL) { /* Loop ran zero times. */
1296 chain = reg_node(NOTHING);
1301 *flagp |= flags&SIMPLE;
1308 - regpiece - something followed by possible [*+?]
1310 * Note that the branching code sequences used for ? and the general cases
1311 * of * and + are somewhat optimized: they use the same NOTHING node as
1312 * both the endmarker for their branch list and the body of the last branch.
1313 * It might seem that this node could be dispensed with entirely, but the
1314 * endmarker role is not redundant.
1317 regpiece(I32 *flagp)
1319 register regnode *ret;
1321 register char *next;
1323 char *origparse = regparse;
1326 I32 max = REG_INFTY;
1328 ret = regatom(&flags);
1330 if (flags & TRYAGAIN)
1337 if (op == '{' && regcurly(regparse)) {
1338 next = regparse + 1;
1340 while (isDIGIT(*next) || *next == ',') {
1349 if (*next == '}') { /* got one */
1353 min = atoi(regparse);
1359 if (!max && *maxpos != '0')
1360 max = REG_INFTY; /* meaning "infinity" */
1361 else if (max >= REG_INFTY)
1362 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1367 if ((flags&SIMPLE)) {
1368 regnaughty += 2 + regnaughty / 2;
1369 reginsert(CURLY, ret);
1372 regnaughty += 4 + regnaughty; /* compound interest */
1373 regtail(ret, reg_node(WHILEM));
1374 if (!SIZE_ONLY && extralen) {
1375 reginsert(LONGJMP,ret);
1376 reginsert(NOTHING,ret);
1377 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1379 reginsert(CURLYX,ret);
1380 if (!SIZE_ONLY && extralen)
1381 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1382 regtail(ret, reg_node(NOTHING));
1386 #ifdef REGALIGN_STRUCT
1391 *flagp = (WORST|HASWIDTH);
1392 if (max && max < min)
1393 FAIL("Can't do {n,m} with n > m");
1408 #if 0 /* Now runtime fix should be reliable. */
1409 if (!(flags&HASWIDTH) && op != '?')
1410 FAIL("regexp *+ operand could be empty");
1415 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1417 if (op == '*' && (flags&SIMPLE)) {
1418 reginsert(STAR, ret);
1419 #ifdef REGALIGN_STRUCT
1424 else if (op == '*') {
1427 } else if (op == '+' && (flags&SIMPLE)) {
1428 reginsert(PLUS, ret);
1429 #ifdef REGALIGN_STRUCT
1434 else if (op == '+') {
1437 } else if (op == '?') {
1442 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1443 warn("%.*s matches null string many times",
1444 regparse - origparse, origparse);
1447 if (*regparse == '?') {
1449 reginsert(MINMOD, ret);
1451 regtail(ret, ret + NODE_STEP_REGNODE);
1453 regtail(ret, ret + 3);
1456 if (ISMULT2(regparse))
1457 FAIL("nested *?+ in regexp");
1463 - regatom - the lowest level
1465 * Optimization: gobbles an entire sequence of ordinary characters so that
1466 * it can turn them into a single node, which is smaller to store and
1467 * faster to run. Backslashed characters are exceptions, each becoming a
1468 * separate node; the code is simpler that way and it's not worth fixing.
1470 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1475 register regnode *ret = 0;
1478 *flagp = WORST; /* Tentatively. */
1481 switch (*regparse) {
1485 if (regflags & PMf_MULTILINE)
1486 ret = reg_node(MBOL);
1487 else if (regflags & PMf_SINGLELINE)
1488 ret = reg_node(SBOL);
1490 ret = reg_node(BOL);
1496 if (regflags & PMf_MULTILINE)
1497 ret = reg_node(MEOL);
1498 else if (regflags & PMf_SINGLELINE)
1499 ret = reg_node(SEOL);
1501 ret = reg_node(EOL);
1505 if (regflags & PMf_SINGLELINE)
1506 ret = reg_node(SANY);
1508 ret = reg_node(ANY);
1510 *flagp |= HASWIDTH|SIMPLE;
1515 *flagp |= HASWIDTH|SIMPLE;
1519 ret = reg(1, &flags);
1521 if (flags & TRYAGAIN)
1525 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1529 if (flags & TRYAGAIN) {
1533 FAIL2("internal urp in regexp at /%s/", regparse);
1534 /* Supposed to be caught earlier. */
1537 if (!regcurly(regparse)) {
1545 FAIL("?+*{} follows nothing in regexp");
1548 switch (*++regparse) {
1551 ret = reg_node(SBOL);
1556 ret = reg_node(GPOS);
1557 regseen |= REG_SEEN_GPOS;
1562 ret = reg_node(SEOL);
1567 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1568 *flagp |= HASWIDTH|SIMPLE;
1572 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1573 *flagp |= HASWIDTH|SIMPLE;
1578 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1584 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1589 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1590 *flagp |= HASWIDTH|SIMPLE;
1594 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1595 *flagp |= HASWIDTH|SIMPLE;
1599 ret = reg_node(DIGIT);
1600 *flagp |= HASWIDTH|SIMPLE;
1604 ret = reg_node(NDIGIT);
1605 *flagp |= HASWIDTH|SIMPLE;
1618 case '1': case '2': case '3': case '4':
1619 case '5': case '6': case '7': case '8': case '9':
1621 I32 num = atoi(regparse);
1623 if (num > 9 && num >= regnpar)
1627 ret = reganode((regflags & PMf_FOLD)
1628 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1631 while (isDIGIT(*regparse))
1639 if (regparse >= regxend)
1640 FAIL("trailing \\ in regexp");
1648 if (regflags & PMf_EXTENDED) {
1649 while (regparse < regxend && *regparse != '\n') regparse++;
1650 if (regparse < regxend)
1665 ret = reg_node((regflags & PMf_FOLD)
1666 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1668 s = (char *) OPERAND(ret);
1669 regc(0, s++); /* save spot for len */
1670 for (len = 0, p = regparse - 1;
1671 len < 127 && p < regxend;
1676 if (regflags & PMf_EXTENDED)
1677 p = regwhite(p, regxend);
1727 ender = scan_hex(++p, 2, &numlen);
1732 ender = UCHARAT(p++);
1733 ender = toCTRL(ender);
1735 case '0': case '1': case '2': case '3':case '4':
1736 case '5': case '6': case '7': case '8':case '9':
1738 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1739 ender = scan_oct(p, 3, &numlen);
1749 FAIL("trailing \\ in regexp");
1760 if (regflags & PMf_EXTENDED)
1761 p = regwhite(p, regxend);
1762 if (ISMULT2(p)) { /* Back off on ?+*. */
1777 FAIL("internal disaster in regexp");
1783 *OPERAND(ret) = len;
1786 #ifdef REGALIGN_STRUCT
1787 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');
1817 regset(char *opnd, register I32 c)
1822 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1828 register char *opnd, *s;
1830 register I32 lastclass = 1234;
1831 register I32 range = 0;
1832 register regnode *ret;
1836 s = opnd = (char *) OPERAND(regcode);
1837 ret = reg_node(ANYOF);
1838 for (Class = 0; Class < 33; Class++)
1840 if (*regparse == '^') { /* Complement of range. */
1844 *opnd |= ANYOF_INVERT;
1847 regcode += ANY_SKIP;
1848 if (regflags & PMf_FOLD)
1849 *opnd |= ANYOF_FOLD;
1850 if (regflags & PMf_LOCALE)
1851 *opnd |= ANYOF_LOCALE;
1853 regsize += ANY_SKIP;
1855 if (*regparse == ']' || *regparse == '-')
1856 goto skipcond; /* allow 1st char to be ] or - */
1857 while (regparse < regxend && *regparse != ']') {
1859 Class = UCHARAT(regparse++);
1860 if (Class == '[' && regparse + 1 < regxend &&
1861 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1862 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1863 char posixccc = *regparse;
1864 char* posixccs = regparse++;
1866 while (regparse < regxend && *regparse != posixccc)
1868 if (regparse == regxend)
1869 /* Grandfather lone [:, [=, [. */
1870 regparse = posixccs;
1872 regparse++; /* skip over the posixccc */
1873 if (*regparse == ']') {
1874 /* Not Implemented Yet.
1875 * (POSIX Extended Character Classes, that is)
1876 * The text between e.g. [: and :] would start
1877 * at posixccs + 1 and stop at regparse - 2. */
1878 if (dowarn && !SIZE_ONLY)
1879 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1880 regparse++; /* skip over the ending ] */
1884 if (Class == '\\') {
1885 Class = UCHARAT(regparse++);
1888 if (regflags & PMf_LOCALE) {
1890 *opnd |= ANYOF_ALNUML;
1893 for (Class = 0; Class < 256; Class++)
1895 regset(opnd, Class);
1900 if (regflags & PMf_LOCALE) {
1902 *opnd |= ANYOF_NALNUML;
1905 for (Class = 0; Class < 256; Class++)
1906 if (!isALNUM(Class))
1907 regset(opnd, Class);
1912 if (regflags & PMf_LOCALE) {
1914 *opnd |= ANYOF_SPACEL;
1917 for (Class = 0; Class < 256; Class++)
1919 regset(opnd, Class);
1924 if (regflags & PMf_LOCALE) {
1926 *opnd |= ANYOF_NSPACEL;
1929 for (Class = 0; Class < 256; Class++)
1930 if (!isSPACE(Class))
1931 regset(opnd, Class);
1936 for (Class = '0'; Class <= '9'; Class++)
1937 regset(opnd, Class);
1941 for (Class = 0; Class < '0'; Class++)
1942 regset(opnd, Class);
1943 for (Class = '9' + 1; Class < 256; Class++)
1944 regset(opnd, Class);
1969 Class = scan_hex(regparse, 2, &numlen);
1973 Class = UCHARAT(regparse++);
1974 Class = toCTRL(Class);
1976 case '0': case '1': case '2': case '3': case '4':
1977 case '5': case '6': case '7': case '8': case '9':
1978 Class = scan_oct(--regparse, 3, &numlen);
1984 if (lastclass > Class)
1985 FAIL("invalid [] range in regexp");
1990 if (*regparse == '-' && regparse+1 < regxend &&
1991 regparse[1] != ']') {
1994 continue; /* do it next time */
1997 for ( ; lastclass <= Class; lastclass++)
1998 regset(opnd, lastclass);
2001 if (*regparse != ']')
2002 FAIL("unmatched [] in regexp");
2010 char* retval = regparse++;
2013 if (*regparse == '(' && regparse[1] == '?' &&
2014 regparse[2] == '#') {
2015 while (*regparse && *regparse != ')')
2020 if (regflags & PMf_EXTENDED) {
2021 if (isSPACE(*regparse)) {
2025 else if (*regparse == '#') {
2026 while (*regparse && *regparse != '\n')
2037 - reg_node - emit a node
2039 STATIC regnode * /* Location. */
2042 register regnode *ret;
2043 register regnode *ptr;
2047 SIZE_ALIGN(regsize);
2048 #ifdef REGALIGN_STRUCT
2056 NODE_ALIGN_FILL(ret);
2058 FILL_ADVANCE_NODE(ptr, op);
2065 - reganode - emit a node with an argument
2067 STATIC regnode * /* Location. */
2068 reganode(U8 op, U32 arg)
2070 register regnode *ret;
2071 register regnode *ptr;
2075 SIZE_ALIGN(regsize);
2084 NODE_ALIGN_FILL(ret);
2086 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2093 - regc - emit (if appropriate) a byte of code
2103 - reginsert - insert an operator in front of already-emitted operand
2105 * Means relocating the operand.
2108 reginsert(U8 op, regnode *opnd)
2110 register regnode *src;
2111 register regnode *dst;
2112 register regnode *place;
2113 register int offset = regarglen[(U8)op];
2115 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2118 regsize += NODE_STEP_REGNODE + offset;
2123 regcode += NODE_STEP_REGNODE + offset;
2126 StructCopy(--src, --dst, regnode);
2128 place = opnd; /* Op node, where operand used to be. */
2129 src = NEXTOPER(place);
2130 FILL_ADVANCE_NODE(place, op);
2131 Zero(src, offset, regnode);
2132 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2133 src[offset + 1] = '\177';
2138 - regtail - set the next-pointer at the end of a node chain of p to val.
2141 regtail(regnode *p, regnode *val)
2143 register regnode *scan;
2144 register regnode *temp;
2145 register I32 offset;
2150 /* Find last node. */
2153 temp = regnext(scan);
2160 # ifdef REGALIGN_STRUCT
2161 if (reg_off_by_arg[OP(scan)]) {
2162 ARG_SET(scan, val - scan);
2164 NEXT_OFF(scan) = val - scan;
2167 offset = val - scan;
2169 *(short*)(scan+1) = offset;
2173 if (OP(scan) == BACK)
2174 offset = scan - val;
2176 offset = val - scan;
2177 *(scan+1) = (offset>>8)&0377;
2178 *(scan+2) = offset&0377;
2183 - regoptail - regtail on operand of first argument; nop if operandless
2186 regoptail(regnode *p, regnode *val)
2188 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2189 if (p == NULL || SIZE_ONLY)
2191 if (regkind[(U8)OP(p)] == BRANCH) {
2192 regtail(NEXTOPER(p), val);
2193 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2194 regtail(NEXTOPER(NEXTOPER(p)), val);
2200 - regcurly - a little FSA that accepts {\d+,?\d*}
2203 regcurly(register char *s)
2223 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2225 register char op = EXACT; /* Arbitrary non-END op. */
2226 register regnode *next, *onode;
2228 while (op != END && (!last || node < last)) {
2229 /* While that wasn't END last time... */
2235 next = regnext(node);
2237 if (OP(node) == OPTIMIZED)
2240 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2241 2*l + 1, "", SvPVX(sv));
2242 if (next == NULL) /* Next ptr. */
2243 PerlIO_printf(Perl_debug_log, "(0)");
2245 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2246 (void)PerlIO_putc(Perl_debug_log, '\n');
2248 if (regkind[(U8)op] == BRANCHJ) {
2249 register regnode *nnode = (OP(next) == LONGJMP
2252 if (last && nnode > last)
2254 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2255 } else if (regkind[(U8)op] == BRANCH) {
2256 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2257 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2258 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2259 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2260 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2261 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2263 } else if ( op == PLUS || op == STAR) {
2264 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2265 } else if (op == ANYOF) {
2266 node = NEXTOPER(node);
2268 } else if (regkind[(U8)op] == EXACT) {
2269 /* Literal string, where present. */
2270 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2271 node = NEXTOPER(node);
2273 node = NEXTOPER(node);
2274 node += regarglen[(U8)op];
2276 if (op == CURLYX || op == OPEN)
2278 else if (op == WHILEM)
2285 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2290 SV *sv = sv_newmortal();
2292 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2294 /* Header fields of interest. */
2295 if (r->anchored_substr)
2296 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2298 SvPVX(r->anchored_substr),
2300 SvTAIL(r->anchored_substr) ? "$" : "",
2301 r->anchored_offset);
2302 if (r->float_substr)
2303 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2305 SvPVX(r->float_substr),
2307 SvTAIL(r->float_substr) ? "$" : "",
2308 r->float_min_offset, r->float_max_offset);
2309 if (r->check_substr)
2310 PerlIO_printf(Perl_debug_log,
2311 r->check_substr == r->float_substr
2312 ? "(checking floating" : "(checking anchored");
2313 if (r->reganch & ROPT_NOSCAN)
2314 PerlIO_printf(Perl_debug_log, " noscan");
2315 if (r->reganch & ROPT_CHECK_ALL)
2316 PerlIO_printf(Perl_debug_log, " isall");
2317 if (r->check_substr)
2318 PerlIO_printf(Perl_debug_log, ") ");
2320 if (r->regstclass) {
2321 regprop(sv, r->regstclass);
2322 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2324 if (r->reganch & ROPT_ANCH) {
2325 PerlIO_printf(Perl_debug_log, "anchored");
2326 if (r->reganch & ROPT_ANCH_BOL)
2327 PerlIO_printf(Perl_debug_log, "(BOL)");
2328 if (r->reganch & ROPT_ANCH_MBOL)
2329 PerlIO_printf(Perl_debug_log, "(MBOL)");
2330 if (r->reganch & ROPT_ANCH_GPOS)
2331 PerlIO_printf(Perl_debug_log, "(GPOS)");
2332 PerlIO_putc(Perl_debug_log, ' ');
2334 if (r->reganch & ROPT_GPOS_SEEN)
2335 PerlIO_printf(Perl_debug_log, "GPOS ");
2336 if (r->reganch & ROPT_SKIP)
2337 PerlIO_printf(Perl_debug_log, "plus ");
2338 if (r->reganch & ROPT_IMPLICIT)
2339 PerlIO_printf(Perl_debug_log, "implicit ");
2340 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2341 PerlIO_printf(Perl_debug_log, "\n");
2345 - regprop - printable representation of opcode
2348 regprop(SV *sv, regnode *o)
2350 register char *p = 0;
2385 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2388 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2391 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2418 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2421 #ifdef REGALIGN_STRUCT
2422 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2424 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2428 #ifdef REGALIGN_STRUCT
2429 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2431 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2435 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2438 sv_catpvf(sv, "REF%d", ARG(o));
2441 sv_catpvf(sv, "REFF%d", ARG(o));
2444 sv_catpvf(sv, "REFFL%d", ARG(o));
2447 sv_catpvf(sv, "OPEN%d", ARG(o));
2450 sv_catpvf(sv, "CLOSE%d", ARG(o));
2466 #ifdef REGALIGN_STRUCT
2467 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2473 #ifdef REGALIGN_STRUCT
2474 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2528 sv_catpvf(sv, "GROUPP%d", ARG(o));
2543 FAIL("corrupted regexp opcode");
2548 #endif /* DEBUGGING */
2551 pregfree(struct regexp *r)
2553 if (!r || (--r->refcnt > 0))
2556 Safefree(r->precomp);
2558 Safefree(r->subbase);
2560 if (r->anchored_substr)
2561 SvREFCNT_dec(r->anchored_substr);
2562 if (r->float_substr)
2563 SvREFCNT_dec(r->float_substr);
2564 Safefree(r->substrs);
2567 int n = r->data->count;
2569 switch (r->data->what[n]) {
2571 SvREFCNT_dec((SV*)r->data->data[n]);
2574 op_free((OP_4tree*)r->data->data[n]);
2579 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2582 Safefree(r->data->what);
2585 Safefree(r->startp);
2591 - regnext - dig the "next" pointer out of a node
2593 * [Note, when REGALIGN is defined there are two places in regmatch()
2594 * that bypass this code for speed.]
2597 regnext(register regnode *p)
2599 register I32 offset;
2604 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2620 re_croak2(const char* pat1,const char* pat2,...)
2624 re_croak2(const char* pat1,const char* pat2, va_alist)
2631 STRLEN l1 = strlen(pat1);
2632 STRLEN l2 = strlen(pat2);
2640 Copy(pat1, buf, l1 , char);
2641 Copy(pat2, buf + l1, l2 , char);
2642 buf[l1 + l2 + 1] = '\n';
2643 buf[l1 + l2 + 2] = '\0';
2645 va_start(args, pat2);
2649 message = mess(buf, &args);
2651 l1 = strlen(message);
2654 Copy(message, buf, l1 , char);
2655 buf[l1] = '\0'; /* Overwrite \n */