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 regtail _((regnode *, regnode *));
119 static char* nextchar _((void));
121 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
124 /* Length of a variant. */
133 I32 last_end; /* min value, <0 unless valid. */
136 SV **longest; /* Either &l_fixed, or &l_float. */
140 I32 offset_float_min;
141 I32 offset_float_max;
146 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
148 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
149 #define SF_BEFORE_SEOL 0x1
150 #define SF_BEFORE_MEOL 0x2
151 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
152 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
155 # define SF_FIX_SHIFT_EOL (0+2)
156 # define SF_FL_SHIFT_EOL (0+4)
158 # define SF_FIX_SHIFT_EOL (+2)
159 # define SF_FL_SHIFT_EOL (+4)
162 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
163 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
165 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
166 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
167 #define SF_IS_INF 0x40
168 #define SF_HAS_PAR 0x80
169 #define SF_IN_PAR 0x100
170 #define SF_HAS_EVAL 0x200
171 #define SCF_DO_SUBSTR 0x400
174 scan_commit(scan_data_t *data)
176 STRLEN l = SvCUR(data->last_found);
177 STRLEN old_l = SvCUR(*data->longest);
179 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
180 sv_setsv(*data->longest, data->last_found);
181 if (*data->longest == data->longest_fixed) {
182 data->offset_fixed = l ? data->last_start_min : data->pos_min;
183 if (data->flags & SF_BEFORE_EOL)
185 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
187 data->flags &= ~SF_FIX_BEFORE_EOL;
189 data->offset_float_min = l ? data->last_start_min : data->pos_min;
190 data->offset_float_max = (l
191 ? data->last_start_max
192 : data->pos_min + data->pos_delta);
193 if (data->flags & SF_BEFORE_EOL)
195 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
197 data->flags &= ~SF_FL_BEFORE_EOL;
200 SvCUR_set(data->last_found, 0);
202 data->flags &= ~SF_BEFORE_EOL;
205 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
206 to the position after last scanned or to NULL. */
209 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
210 /* scanp: Start here (read-write). */
211 /* deltap: Write maxlen-minlen here. */
212 /* last: Stop before this one. */
214 I32 min = 0, pars = 0, code;
215 regnode *scan = *scanp, *next;
217 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
218 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
219 scan_data_t data_fake;
221 while (scan && OP(scan) != END && scan < last) {
222 /* Peephole optimizer: */
224 if (regkind[(U8)OP(scan)] == EXACT) {
225 regnode *n = regnext(scan);
228 regnode *stop = scan;
231 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
232 /* Skip NOTHING, merge EXACT*. */
234 ( regkind[(U8)OP(n)] == NOTHING ||
235 (stringok && (OP(n) == OP(scan))))
237 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
238 if (OP(n) == TAIL || n > next)
240 if (regkind[(U8)OP(n)] == NOTHING) {
241 NEXT_OFF(scan) += NEXT_OFF(n);
242 next = n + NODE_STEP_REGNODE;
249 int oldl = *OPERAND(scan);
250 regnode *nnext = regnext(n);
252 if (oldl + *OPERAND(n) > U8_MAX)
254 NEXT_OFF(scan) += NEXT_OFF(n);
255 *OPERAND(scan) += *OPERAND(n);
256 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
257 /* Now we can overwrite *n : */
258 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
259 *OPERAND(n) + 1, char);
269 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
271 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
280 if (OP(scan) != CURLYX) {
281 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
282 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
286 /* Skip NOTHING and LONGJMP. */
287 while ((n = regnext(n))
288 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
289 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
292 if (reg_off_by_arg[OP(scan)])
295 NEXT_OFF(scan) = off;
297 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
298 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
299 next = regnext(scan);
302 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
303 I32 max1 = 0, min1 = I32_MAX, num = 0;
305 if (flags & SCF_DO_SUBSTR)
307 while (OP(scan) == code) {
308 I32 deltanext, minnext;
312 next = regnext(scan);
313 scan = NEXTOPER(scan);
315 scan = NEXTOPER(scan);
316 /* We suppose the run is continuous, last=next...*/
317 minnext = study_chunk(&scan, &deltanext, next,
321 if (max1 < minnext + deltanext)
322 max1 = minnext + deltanext;
323 if (deltanext == I32_MAX)
326 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
328 if (data && (data_fake.flags & SF_HAS_EVAL))
329 data->flags |= SF_HAS_EVAL;
333 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
335 if (flags & SCF_DO_SUBSTR) {
336 data->pos_min += min1;
337 data->pos_delta += max1 - min1;
338 if (max1 != min1 || is_inf)
339 data->longest = &(data->longest_float);
342 delta += max1 - min1;
343 } else if (code == BRANCHJ) /* single branch is optimized. */
344 scan = NEXTOPER(NEXTOPER(scan));
345 else /* single branch is optimized. */
346 scan = NEXTOPER(scan);
348 } else if (OP(scan) == EXACT) {
349 min += *OPERAND(scan);
350 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
351 I32 l = *OPERAND(scan);
353 /* The code below prefers earlier match for fixed
354 offset, later match for variable offset. */
355 if (data->last_end == -1) { /* Update the start info. */
356 data->last_start_min = data->pos_min;
357 data->last_start_max = is_inf
358 ? I32_MAX : data->pos_min + data->pos_delta;
360 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
361 data->last_end = data->pos_min + l;
362 data->pos_min += l; /* As in the first entry. */
363 data->flags &= ~SF_BEFORE_EOL;
365 } else if (regkind[(U8)OP(scan)] == EXACT) {
366 if (flags & SCF_DO_SUBSTR)
368 min += *OPERAND(scan);
369 if (data && (flags & SCF_DO_SUBSTR))
370 data->pos_min += *OPERAND(scan);
371 } else if (strchr(varies,OP(scan))) {
372 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
373 regnode *oscan = scan;
375 switch (regkind[(U8)OP(scan)]) {
377 scan = NEXTOPER(scan);
380 if (flags & SCF_DO_SUBSTR) {
381 next = NEXTOPER(scan);
382 if (OP(next) == EXACT) {
384 maxcount = REG_INFTY;
385 next = regnext(scan);
386 scan = NEXTOPER(scan);
390 if (flags & SCF_DO_SUBSTR)
396 scan = regnext(scan);
397 if (flags & SCF_DO_SUBSTR) {
399 data->longest = &(data->longest_float);
401 goto optimize_curly_tail;
403 mincount = ARG1(scan);
404 maxcount = ARG2(scan);
405 next = regnext(scan);
406 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
408 if (flags & SCF_DO_SUBSTR) {
409 if (mincount == 0) scan_commit(data);
410 pos_before = data->pos_min;
414 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
416 data->flags |= SF_IS_INF;
418 /* This will finish on WHILEM, setting scan, or on NULL: */
419 minnext = study_chunk(&scan, &deltanext, last, data,
421 ? (flags & ~SCF_DO_SUBSTR) : flags);
422 if (!scan) /* It was not CURLYX, but CURLY. */
424 if (dowarn && (minnext + deltanext == 0)
425 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
426 warn("Strange *+?{} on zero-length expression");
427 min += minnext * mincount;
428 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
429 || deltanext == I32_MAX);
430 delta += (minnext + deltanext) * maxcount - minnext * mincount;
432 /* Try powerful optimization CURLYX => CURLYN. */
433 #ifdef REGALIGN_STRUCT
434 if ( OP(oscan) == CURLYX && data
435 && data->flags & SF_IN_PAR
436 && !(data->flags & SF_HAS_EVAL)
437 && !deltanext && minnext == 1 ) {
438 /* Try to optimize to CURLYN. */
439 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
440 regnode *nxt1 = nxt, *nxt2;
444 if (!strchr(simple,OP(nxt))
445 && !(regkind[(U8)OP(nxt)] == EXACT
446 && *OPERAND(nxt) == 1))
450 if (OP(nxt) != CLOSE)
452 /* Now we know that nxt2 is the only contents: */
453 oscan->flags = ARG(nxt);
455 OP(nxt1) = NOTHING; /* was OPEN. */
457 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
458 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
459 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
460 OP(nxt) = OPTIMIZED; /* was CLOSE. */
461 OP(nxt + 1) = OPTIMIZED; /* was count. */
462 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
468 /* Try optimization CURLYX => CURLYM. */
469 if ( OP(oscan) == CURLYX && data
470 #ifdef REGALIGN_STRUCT
471 && !(data->flags & SF_HAS_PAR)
473 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
475 && !(data->flags & SF_HAS_EVAL)
477 /* XXXX How to optimize if data == 0? */
478 /* Optimize to a simpler form. */
479 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
483 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
484 && (OP(nxt2) != WHILEM))
486 OP(nxt2) = SUCCEED; /* Whas WHILEM */
487 #ifdef REGALIGN_STRUCT
488 /* Need to optimize away parenths. */
489 if (data->flags & SF_IN_PAR) {
490 /* Set the parenth number. */
491 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
493 if (OP(nxt) != CLOSE)
494 FAIL("panic opt close");
495 oscan->flags = ARG(nxt);
496 OP(nxt1) = OPTIMIZED; /* was OPEN. */
497 OP(nxt) = OPTIMIZED; /* was CLOSE. */
499 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
500 OP(nxt + 1) = OPTIMIZED; /* was count. */
501 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
502 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
505 while ( nxt1 && (OP(nxt1) != WHILEM)) {
506 regnode *nnxt = regnext(nxt1);
509 if (reg_off_by_arg[OP(nxt1)])
510 ARG_SET(nxt1, nxt2 - nxt1);
511 else if (nxt2 - nxt1 < U16_MAX)
512 NEXT_OFF(nxt1) = nxt2 - nxt1;
514 OP(nxt) = NOTHING; /* Cannot beautify */
519 /* Optimize again: */
520 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
525 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
527 if (flags & SCF_DO_SUBSTR) {
528 SV *last_str = Nullsv;
529 int counted = mincount != 0;
531 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
532 I32 b = pos_before >= data->last_start_min
533 ? pos_before : data->last_start_min;
535 char *s = SvPV(data->last_found, l);
537 l -= b - data->last_start_min;
538 /* Get the added string: */
539 last_str = newSVpv(s + b - data->last_start_min, l);
540 if (deltanext == 0 && pos_before == b) {
541 /* What was added is a constant string */
543 SvGROW(last_str, (mincount * l) + 1);
544 repeatcpy(SvPVX(last_str) + l,
545 SvPVX(last_str), l, mincount - 1);
546 SvCUR(last_str) *= mincount;
547 /* Add additional parts. */
548 SvCUR_set(data->last_found,
549 SvCUR(data->last_found) - l);
550 sv_catsv(data->last_found, last_str);
551 data->last_end += l * (mincount - 1);
555 /* It is counted once already... */
556 data->pos_min += minnext * (mincount - counted);
557 data->pos_delta += - counted * deltanext +
558 (minnext + deltanext) * maxcount - minnext * mincount;
559 if (mincount != maxcount) {
561 if (mincount && last_str) {
562 sv_setsv(data->last_found, last_str);
563 data->last_end = data->pos_min;
564 data->last_start_min =
565 data->pos_min - SvCUR(last_str);
566 data->last_start_max = is_inf
568 : data->pos_min + data->pos_delta
571 data->longest = &(data->longest_float);
574 if (data && (fl & SF_HAS_EVAL))
575 data->flags |= SF_HAS_EVAL;
578 if (OP(oscan) != CURLYX) {
579 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
581 NEXT_OFF(oscan) += NEXT_OFF(next);
585 default: /* REF only? */
586 if (flags & SCF_DO_SUBSTR) {
588 data->longest = &(data->longest_float);
593 } else if (strchr(simple,OP(scan))) {
594 if (flags & SCF_DO_SUBSTR) {
599 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
600 data->flags |= (OP(scan) == MEOL
603 } else if (regkind[(U8)OP(scan)] == BRANCHJ
604 && (scan->flags || data)
605 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
606 I32 deltanext, minnext;
610 next = regnext(scan);
611 nscan = NEXTOPER(NEXTOPER(scan));
612 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
615 FAIL("variable length lookbehind not implemented");
616 } else if (minnext > U8_MAX) {
617 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
619 scan->flags = minnext;
621 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
623 if (data && (data_fake.flags & SF_HAS_EVAL))
624 data->flags |= SF_HAS_EVAL;
625 } else if (OP(scan) == OPEN) {
627 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
628 #ifdef REGALIGN_STRUCT
629 next = regnext(scan);
631 if ( next && (OP(next) != WHILEM) && next < last)
633 is_par = 0; /* Disable optimization */
634 } else if (OP(scan) == EVAL) {
636 data->flags |= SF_HAS_EVAL;
638 /* Else: zero-length, ignore. */
639 scan = regnext(scan);
644 *deltap = is_inf ? I32_MAX : delta;
645 if (flags & SCF_DO_SUBSTR && is_inf)
646 data->pos_delta = I32_MAX - data->pos_min;
649 if (is_par && pars==1 && data) {
650 data->flags |= SF_IN_PAR;
651 data->flags &= ~SF_HAS_PAR;
652 } else if (pars && data) {
653 data->flags |= SF_HAS_PAR;
654 data->flags &= ~SF_IN_PAR;
660 add_data(I32 n, char *s)
664 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
665 char, struct reg_data);
666 Renew(rx->data->what, rx->data->count + n, U8);
667 rx->data->count += n;
669 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
670 char, struct reg_data);
671 New(1208, rx->data->what, n, U8);
674 Copy(s, rx->data->what + rx->data->count - n, n, U8);
675 return rx->data->count - n;
679 - pregcomp - compile a regular expression into internal code
681 * We can't allocate space until we know how big the compiled form will be,
682 * but we can't compile it (and thus know how big it is) until we've got a
683 * place to put the code. So we cheat: we compile it twice, once with code
684 * generation turned off and size counting turned on, and once "for real".
685 * This also means that we don't allocate space until we are sure that the
686 * thing really will compile successfully, and we never have to move the
687 * code and thus invalidate pointers into it. (Note that it has to be in
688 * one piece because free() must be able to free it all.) [NB: not true in perl]
690 * Beware that the optimization-preparation code in here knows about some
691 * of the structure of the compiled regexp. [I'll say.]
694 pregcomp(char *exp, char *xend, PMOP *pm)
708 FAIL("NULL regexp argument");
710 regprecomp = savepvn(exp, xend - exp);
711 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
712 xend - exp, regprecomp));
713 regflags = pm->op_pmflags;
717 seen_zerolen = *exp == '^' ? -1 : 0;
720 /* First pass: determine size, legality. */
727 regc((U8)MAGIC, (char*)regcode);
728 if (reg(0, &flags) == NULL) {
729 Safefree(regprecomp);
733 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
738 char *s = PerlEnv_getenv("TERMCAP_COLORS");
742 colors[0] = s = savepv(s);
746 FAIL("Not enough TABs in TERMCAP_COLORS");
755 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
756 colors[0],colors[1],colors[2],colors[3]);
760 /* Small enough for pointer-storage convention?
761 If extralen==0, this means that we will not need long jumps. */
762 #ifndef REGALIGN_STRUCT
763 if (regsize >= 0x10000L && extralen)
764 FAIL("regexp too big");
766 if (regsize >= 0x10000L && extralen)
772 /* Allocate space and initialize. */
773 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
776 FAIL("regexp out of space");
778 r->prelen = xend - exp;
779 r->precomp = regprecomp;
780 r->subbeg = r->subbase = NULL;
783 /* Second pass: emit code. */
788 regcode = r->program;
789 regc((U8)MAGIC, (char*) regcode++);
791 if (reg(0, &flags) == NULL)
794 /* Dig out information for optimizations. */
795 pm->op_pmflags = regflags;
797 r->regstclass = NULL;
798 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
799 scan = r->program + 1; /* First BRANCH. */
801 /* XXXX To minimize changes to RE engine we always allocate
802 3-units-long substrs field. */
803 Newz(1004, r->substrs, 1, struct reg_substr_data);
805 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
808 STRLEN longest_float_length, longest_fixed_length;
810 StructCopy(&zero_scan_data, &data, scan_data_t);
812 /* Skip introductions and multiplicators >= 1. */
813 while ((OP(first) == OPEN && (sawopen = 1)) ||
814 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
815 (OP(first) == PLUS) ||
816 (OP(first) == MINMOD) ||
817 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
818 if (OP(first) == PLUS)
821 first += regarglen[(U8)OP(first)];
822 first = NEXTOPER(first);
825 /* Starting-point info. */
827 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
828 else if (strchr(simple+2,OP(first)))
829 r->regstclass = first;
830 else if (regkind[(U8)OP(first)] == BOUND ||
831 regkind[(U8)OP(first)] == NBOUND)
832 r->regstclass = first;
833 else if (regkind[(U8)OP(first)] == BOL) {
834 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
835 first = NEXTOPER(first);
838 else if (OP(first) == GPOS) {
839 r->reganch |= ROPT_ANCH_GPOS;
840 first = NEXTOPER(first);
843 else if ((OP(first) == STAR &&
844 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
845 !(r->reganch & ROPT_ANCH) )
847 /* turn .* into ^.* with an implied $*=1 */
848 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
849 first = NEXTOPER(first);
852 if (sawplus && (!sawopen || !regsawback))
853 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
855 /* Scan is after the zeroth branch, first is atomic matcher. */
856 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
859 * If there's something expensive in the r.e., find the
860 * longest literal string that must appear and make it the
861 * regmust. Resolve ties in favor of later strings, since
862 * the regstart check works with the beginning of the r.e.
863 * and avoiding duplication strengthens checking. Not a
864 * strong reason, but sufficient in the absence of others.
865 * [Now we resolve ties in favor of the earlier string if
866 * it happens that c_offset_min has been invalidated, since the
867 * earlier string may buy us something the later one won't.]
871 data.longest_fixed = newSVpv("",0);
872 data.longest_float = newSVpv("",0);
873 data.last_found = newSVpv("",0);
874 data.longest = &(data.longest_fixed);
877 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
878 &data, SCF_DO_SUBSTR);
879 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
880 && data.last_start_min == 0 && data.last_end > 0
882 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
883 r->reganch |= ROPT_CHECK_ALL;
885 SvREFCNT_dec(data.last_found);
887 longest_float_length = SvCUR(data.longest_float);
888 if (longest_float_length
889 || (data.flags & SF_FL_BEFORE_EOL
890 && (!(data.flags & SF_FL_BEFORE_MEOL)
891 || (regflags & PMf_MULTILINE)))) {
892 if (SvCUR(data.longest_fixed)
893 && data.offset_fixed == data.offset_float_min)
894 goto remove; /* Like in (a)+. */
896 r->float_substr = data.longest_float;
897 r->float_min_offset = data.offset_float_min;
898 r->float_max_offset = data.offset_float_max;
899 fbm_compile(r->float_substr, 0);
900 BmUSEFUL(r->float_substr) = 100;
901 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
902 && (!(data.flags & SF_FL_BEFORE_MEOL)
903 || (regflags & PMf_MULTILINE)))
904 SvTAIL_on(r->float_substr);
907 r->float_substr = Nullsv;
908 SvREFCNT_dec(data.longest_float);
909 longest_float_length = 0;
912 longest_fixed_length = SvCUR(data.longest_fixed);
913 if (longest_fixed_length
914 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
915 && (!(data.flags & SF_FIX_BEFORE_MEOL)
916 || (regflags & PMf_MULTILINE)))) {
917 r->anchored_substr = data.longest_fixed;
918 r->anchored_offset = data.offset_fixed;
919 fbm_compile(r->anchored_substr, 0);
920 BmUSEFUL(r->anchored_substr) = 100;
921 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
922 && (!(data.flags & SF_FIX_BEFORE_MEOL)
923 || (regflags & PMf_MULTILINE)))
924 SvTAIL_on(r->anchored_substr);
926 r->anchored_substr = Nullsv;
927 SvREFCNT_dec(data.longest_fixed);
928 longest_fixed_length = 0;
931 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
932 if (longest_fixed_length > longest_float_length) {
933 r->check_substr = r->anchored_substr;
934 r->check_offset_min = r->check_offset_max = r->anchored_offset;
935 if (r->reganch & ROPT_ANCH_SINGLE)
936 r->reganch |= ROPT_NOSCAN;
938 r->check_substr = r->float_substr;
939 r->check_offset_min = data.offset_float_min;
940 r->check_offset_max = data.offset_float_max;
943 /* Several toplevels. Best we can is to set minlen. */
946 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
947 scan = r->program + 1;
948 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
949 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
952 r->nparens = regnpar - 1;
954 if (regseen & REG_SEEN_GPOS)
955 r->reganch |= ROPT_GPOS_SEEN;
956 if (regseen & REG_SEEN_LOOKBEHIND)
957 r->reganch |= ROPT_LOOKBEHIND_SEEN;
958 Newz(1002, r->startp, regnpar, char*);
959 Newz(1002, r->endp, regnpar, char*);
965 - reg - regular expression, i.e. main body or parenthesized thing
967 * Caller must absorb opening parenthesis.
969 * Combining parenthesis handling with the base level of regular expression
970 * is a trifle forced, but the need to tie the tails of the branches to what
971 * follows makes it hard to avoid.
974 reg(I32 paren, I32 *flagp)
975 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
977 register regnode *ret; /* Will be the head of the group. */
978 register regnode *br;
979 register regnode *lastbr;
980 register regnode *ender = 0;
981 register I32 parno = 0;
982 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
985 *flagp = HASWIDTH; /* Tentatively. */
987 /* Make an OPEN node, if parenthesized. */
989 if (*regparse == '?') {
992 ret = NULL; /* For look-ahead/behind. */
995 #ifndef REGALIGN_STRUCT
996 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
998 regseen |= REG_SEEN_LOOKBEHIND;
999 if (*regparse == '!')
1001 if (*regparse != '=' && *regparse != '!')
1012 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1015 while (*regparse && *regparse != ')')
1017 if (*regparse != ')')
1018 FAIL("Sequence (?#... not terminated");
1025 I32 count = 1, n = 0;
1029 OP_4tree *sop, *rop;
1032 while (count && (c = *regparse)) {
1033 if (c == '\\' && regparse[1])
1041 if (*regparse != ')')
1042 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1046 if (regparse - 1 - s)
1047 sv = newSVpv(s, regparse - 1 - s);
1049 sv = newSVpv("", 0);
1051 rop = sv_compile_2op(sv, &sop, "re", &av);
1053 n = add_data(3, "nso");
1054 rx->data->data[n] = (void*)rop;
1055 rx->data->data[n+1] = (void*)av;
1056 rx->data->data[n+2] = (void*)sop;
1058 } else { /* First pass */
1060 FAIL("Eval-group in insecure regular expression");
1064 return reganode(EVAL, n);
1068 if (regparse[0] == '?') {
1069 if (regparse[1] == '=' || regparse[1] == '!'
1070 || regparse[1] == '<'
1071 || regparse[1] == '{') { /* Lookahead or eval. */
1074 ret = reg_node(LOGICAL);
1075 regtail(ret, reg(1, &flag));
1078 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1079 parno = atoi(regparse++);
1081 while (isDIGIT(*regparse))
1083 ret = reganode(GROUPP, parno);
1084 if ((c = *nextchar()) != ')')
1085 FAIL2("Switch (?(number%c not recognized", c);
1087 regtail(ret, reganode(IFTHEN, 0));
1088 br = regbranch(&flags, 1);
1090 br = reganode(LONGJMP, 0);
1092 regtail(br, reganode(LONGJMP, 0));
1095 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1096 regbranch(&flags, 1);
1097 regtail(ret, lastbr);
1102 FAIL("Switch (?(condition)... contains too many branches");
1103 ender = reg_node(TAIL);
1106 regtail(lastbr, ender);
1107 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1109 regtail(ret, ender);
1112 FAIL2("Unknown condition for (?(%.2s", regparse);
1116 FAIL("Sequence (? incomplete");
1120 while (*regparse && strchr("iogcmsx", *regparse)) {
1121 if (*regparse != 'o')
1122 pmflag(®flags, *regparse);
1126 if (*regparse != ')')
1127 FAIL2("Sequence (?%c...) not recognized", *regparse);
1136 ret = reganode(OPEN, parno);
1142 /* Pick up the branches, linking them together. */
1143 br = regbranch(&flags, 1);
1146 if (*regparse == '|') {
1147 if (!SIZE_ONLY && extralen) {
1148 reginsert(BRANCHJ, br);
1150 reginsert(BRANCH, br);
1153 extralen += 1; /* For BRANCHJ-BRANCH. */
1154 } else if (paren == ':') {
1155 *flagp |= flags&SIMPLE;
1157 if (open) { /* Starts with OPEN. */
1158 regtail(ret, br); /* OPEN -> first. */
1159 } else if (paren != '?') /* Not Conditional */
1161 if (!(flags&HASWIDTH))
1162 *flagp &= ~HASWIDTH;
1163 *flagp |= flags&SPSTART;
1165 while (*regparse == '|') {
1166 if (!SIZE_ONLY && extralen) {
1167 ender = reganode(LONGJMP,0);
1168 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1171 extralen += 2; /* Account for LONGJMP. */
1173 br = regbranch(&flags, 0);
1176 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1178 if (!(flags&HASWIDTH))
1179 *flagp &= ~HASWIDTH;
1180 *flagp |= flags&SPSTART;
1183 if (have_branch || paren != ':') {
1184 /* Make a closing node, and hook it on the end. */
1187 ender = reg_node(TAIL);
1190 ender = reganode(CLOSE, parno);
1197 ender = reg_node(SUCCEED);
1198 *flagp &= ~HASWIDTH;
1201 ender = reg_node(END);
1204 regtail(lastbr, ender);
1207 /* Hook the tails of the branches to the closing node. */
1208 for (br = ret; br != NULL; br = regnext(br)) {
1209 regoptail(br, ender);
1216 static char parens[] = "=!<,>";
1218 if (paren && (p = strchr(parens, paren))) {
1219 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1220 int flag = (p - parens) > 1;
1223 node = SUSPEND, flag = 0;
1224 reginsert(node,ret);
1225 #ifdef REGALIGN_STRUCT
1228 regtail(ret, reg_node(TAIL));
1232 /* Check for proper termination. */
1233 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1234 FAIL("unmatched () in regexp");
1235 } else if (!paren && regparse < regxend) {
1236 if (*regparse == ')') {
1237 FAIL("unmatched () in regexp");
1239 FAIL("junk on end of regexp"); /* "Can't happen". */
1243 regflags = oregflags;
1250 - regbranch - one alternative of an | operator
1252 * Implements the concatenation operator.
1255 regbranch(I32 *flagp, I32 first)
1257 register regnode *ret;
1258 register regnode *chain = NULL;
1259 register regnode *latest;
1260 I32 flags = 0, c = 0;
1265 if (!SIZE_ONLY && extralen)
1266 ret = reganode(BRANCHJ,0);
1268 ret = reg_node(BRANCH);
1271 if (!first && SIZE_ONLY)
1272 extralen += 1; /* BRANCHJ */
1274 *flagp = WORST; /* Tentatively. */
1278 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1280 latest = regpiece(&flags);
1281 if (latest == NULL) {
1282 if (flags & TRYAGAIN)
1285 } else if (ret == NULL)
1287 *flagp |= flags&HASWIDTH;
1288 if (chain == NULL) /* First piece. */
1289 *flagp |= flags&SPSTART;
1292 regtail(chain, latest);
1297 if (chain == NULL) { /* Loop ran zero times. */
1298 chain = reg_node(NOTHING);
1303 *flagp |= flags&SIMPLE;
1310 - regpiece - something followed by possible [*+?]
1312 * Note that the branching code sequences used for ? and the general cases
1313 * of * and + are somewhat optimized: they use the same NOTHING node as
1314 * both the endmarker for their branch list and the body of the last branch.
1315 * It might seem that this node could be dispensed with entirely, but the
1316 * endmarker role is not redundant.
1319 regpiece(I32 *flagp)
1321 register regnode *ret;
1323 register char *next;
1325 char *origparse = regparse;
1328 I32 max = REG_INFTY;
1330 ret = regatom(&flags);
1332 if (flags & TRYAGAIN)
1339 if (op == '{' && regcurly(regparse)) {
1340 next = regparse + 1;
1342 while (isDIGIT(*next) || *next == ',') {
1351 if (*next == '}') { /* got one */
1355 min = atoi(regparse);
1361 if (!max && *maxpos != '0')
1362 max = REG_INFTY; /* meaning "infinity" */
1363 else if (max >= REG_INFTY)
1364 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1369 if ((flags&SIMPLE)) {
1370 regnaughty += 2 + regnaughty / 2;
1371 reginsert(CURLY, ret);
1374 regnaughty += 4 + regnaughty; /* compound interest */
1375 regtail(ret, reg_node(WHILEM));
1376 if (!SIZE_ONLY && extralen) {
1377 reginsert(LONGJMP,ret);
1378 reginsert(NOTHING,ret);
1379 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1381 reginsert(CURLYX,ret);
1382 if (!SIZE_ONLY && extralen)
1383 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1384 regtail(ret, reg_node(NOTHING));
1388 #ifdef REGALIGN_STRUCT
1393 *flagp = (WORST|HASWIDTH);
1394 if (max && max < min)
1395 FAIL("Can't do {n,m} with n > m");
1410 #if 0 /* Now runtime fix should be reliable. */
1411 if (!(flags&HASWIDTH) && op != '?')
1412 FAIL("regexp *+ operand could be empty");
1417 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1419 if (op == '*' && (flags&SIMPLE)) {
1420 reginsert(STAR, ret);
1421 #ifdef REGALIGN_STRUCT
1426 else if (op == '*') {
1429 } else if (op == '+' && (flags&SIMPLE)) {
1430 reginsert(PLUS, ret);
1431 #ifdef REGALIGN_STRUCT
1436 else if (op == '+') {
1439 } else if (op == '?') {
1444 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1445 warn("%.*s matches null string many times",
1446 regparse - origparse, origparse);
1449 if (*regparse == '?') {
1451 reginsert(MINMOD, ret);
1453 regtail(ret, ret + NODE_STEP_REGNODE);
1455 regtail(ret, ret + 3);
1458 if (ISMULT2(regparse))
1459 FAIL("nested *?+ in regexp");
1465 - regatom - the lowest level
1467 * Optimization: gobbles an entire sequence of ordinary characters so that
1468 * it can turn them into a single node, which is smaller to store and
1469 * faster to run. Backslashed characters are exceptions, each becoming a
1470 * separate node; the code is simpler that way and it's not worth fixing.
1472 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1477 register regnode *ret = 0;
1480 *flagp = WORST; /* Tentatively. */
1483 switch (*regparse) {
1487 if (regflags & PMf_MULTILINE)
1488 ret = reg_node(MBOL);
1489 else if (regflags & PMf_SINGLELINE)
1490 ret = reg_node(SBOL);
1492 ret = reg_node(BOL);
1498 if (regflags & PMf_MULTILINE)
1499 ret = reg_node(MEOL);
1500 else if (regflags & PMf_SINGLELINE)
1501 ret = reg_node(SEOL);
1503 ret = reg_node(EOL);
1507 if (regflags & PMf_SINGLELINE)
1508 ret = reg_node(SANY);
1510 ret = reg_node(ANY);
1512 *flagp |= HASWIDTH|SIMPLE;
1517 *flagp |= HASWIDTH|SIMPLE;
1521 ret = reg(1, &flags);
1523 if (flags & TRYAGAIN)
1527 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1531 if (flags & TRYAGAIN) {
1535 FAIL2("internal urp in regexp at /%s/", regparse);
1536 /* Supposed to be caught earlier. */
1539 if (!regcurly(regparse)) {
1547 FAIL("?+*{} follows nothing in regexp");
1550 switch (*++regparse) {
1553 ret = reg_node(SBOL);
1558 ret = reg_node(GPOS);
1559 regseen |= REG_SEEN_GPOS;
1564 ret = reg_node(SEOL);
1569 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1570 *flagp |= HASWIDTH|SIMPLE;
1574 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1575 *flagp |= HASWIDTH|SIMPLE;
1580 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1586 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1591 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1592 *flagp |= HASWIDTH|SIMPLE;
1596 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1597 *flagp |= HASWIDTH|SIMPLE;
1601 ret = reg_node(DIGIT);
1602 *flagp |= HASWIDTH|SIMPLE;
1606 ret = reg_node(NDIGIT);
1607 *flagp |= HASWIDTH|SIMPLE;
1620 case '1': case '2': case '3': case '4':
1621 case '5': case '6': case '7': case '8': case '9':
1623 I32 num = atoi(regparse);
1625 if (num > 9 && num >= regnpar)
1629 ret = reganode((regflags & PMf_FOLD)
1630 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1633 while (isDIGIT(*regparse))
1641 if (regparse >= regxend)
1642 FAIL("trailing \\ in regexp");
1650 if (regflags & PMf_EXTENDED) {
1651 while (regparse < regxend && *regparse != '\n') regparse++;
1652 if (regparse < regxend)
1667 ret = reg_node((regflags & PMf_FOLD)
1668 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1670 s = (char *) OPERAND(ret);
1671 regc(0, s++); /* save spot for len */
1672 for (len = 0, p = regparse - 1;
1673 len < 127 && p < regxend;
1678 if (regflags & PMf_EXTENDED)
1679 p = regwhite(p, regxend);
1729 ender = scan_hex(++p, 2, &numlen);
1734 ender = UCHARAT(p++);
1735 ender = toCTRL(ender);
1737 case '0': case '1': case '2': case '3':case '4':
1738 case '5': case '6': case '7': case '8':case '9':
1740 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1741 ender = scan_oct(p, 3, &numlen);
1751 FAIL("trailing \\ in regexp");
1762 if (regflags & PMf_EXTENDED)
1763 p = regwhite(p, regxend);
1764 if (ISMULT2(p)) { /* Back off on ?+*. */
1779 FAIL("internal disaster in regexp");
1785 *OPERAND(ret) = len;
1788 #ifdef REGALIGN_STRUCT
1789 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1792 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1802 regwhite(char *p, char *e)
1807 else if (*p == '#') {
1810 } while (p < e && *p != '\n');
1821 register char *opnd, *s;
1823 register I32 lastclass = 1234;
1824 register I32 range = 0;
1825 register regnode *ret;
1829 s = opnd = (char *) OPERAND(regcode);
1830 ret = reg_node(ANYOF);
1831 for (Class = 0; Class < 33; Class++)
1833 if (*regparse == '^') { /* Complement of range. */
1837 *opnd |= ANYOF_INVERT;
1840 regcode += ANY_SKIP;
1841 if (regflags & PMf_FOLD)
1842 *opnd |= ANYOF_FOLD;
1843 if (regflags & PMf_LOCALE)
1844 *opnd |= ANYOF_LOCALE;
1846 regsize += ANY_SKIP;
1848 if (*regparse == ']' || *regparse == '-')
1849 goto skipcond; /* allow 1st char to be ] or - */
1850 while (regparse < regxend && *regparse != ']') {
1852 Class = UCHARAT(regparse++);
1853 if (Class == '[' && regparse + 1 < regxend &&
1854 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1855 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1856 char posixccc = *regparse;
1857 char* posixccs = regparse++;
1859 while (regparse < regxend && *regparse != posixccc)
1861 if (regparse == regxend)
1862 /* Grandfather lone [:, [=, [. */
1863 regparse = posixccs;
1865 regparse++; /* skip over the posixccc */
1866 if (*regparse == ']') {
1867 /* Not Implemented Yet.
1868 * (POSIX Extended Character Classes, that is)
1869 * The text between e.g. [: and :] would start
1870 * at posixccs + 1 and stop at regparse - 2. */
1871 if (dowarn && !SIZE_ONLY)
1872 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1873 regparse++; /* skip over the ending ] */
1877 if (Class == '\\') {
1878 Class = UCHARAT(regparse++);
1882 if (regflags & PMf_LOCALE)
1883 *opnd |= ANYOF_ALNUML;
1885 for (Class = 0; Class < 256; Class++)
1887 ANYOF_SET(opnd, Class);
1894 if (regflags & PMf_LOCALE)
1895 *opnd |= ANYOF_NALNUML;
1897 for (Class = 0; Class < 256; Class++)
1898 if (!isALNUM(Class))
1899 ANYOF_SET(opnd, Class);
1906 if (regflags & PMf_LOCALE)
1907 *opnd |= ANYOF_SPACEL;
1909 for (Class = 0; Class < 256; Class++)
1911 ANYOF_SET(opnd, Class);
1918 if (regflags & PMf_LOCALE)
1919 *opnd |= ANYOF_NSPACEL;
1921 for (Class = 0; Class < 256; Class++)
1922 if (!isSPACE(Class))
1923 ANYOF_SET(opnd, Class);
1930 for (Class = '0'; Class <= '9'; Class++)
1931 ANYOF_SET(opnd, Class);
1937 for (Class = 0; Class < '0'; Class++)
1938 ANYOF_SET(opnd, Class);
1939 for (Class = '9' + 1; Class < 256; Class++)
1940 ANYOF_SET(opnd, Class);
1966 Class = scan_hex(regparse, 2, &numlen);
1970 Class = UCHARAT(regparse++);
1971 Class = toCTRL(Class);
1973 case '0': case '1': case '2': case '3': case '4':
1974 case '5': case '6': case '7': case '8': case '9':
1975 Class = scan_oct(--regparse, 3, &numlen);
1981 if (lastclass > Class)
1982 FAIL("invalid [] range in regexp");
1987 if (*regparse == '-' && regparse+1 < regxend &&
1988 regparse[1] != ']') {
1991 continue; /* do it next time */
1995 for ( ; lastclass <= Class; lastclass++)
1996 ANYOF_SET(opnd, lastclass);
2000 if (*regparse != ']')
2001 FAIL("unmatched [] in regexp");
2003 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2004 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2005 for (Class = 0; Class < 256; ++Class) {
2006 if (ANYOF_TEST(opnd, Class)) {
2007 I32 cf = fold[Class];
2008 ANYOF_SET(opnd, cf);
2011 *opnd &= ~ANYOF_FOLD;
2013 /* optimize inverted simple patterns (e.g. [^a-z]) */
2014 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2015 for (Class = 0; Class < 32; ++Class)
2016 opnd[1 + Class] ^= 0xFF;
2025 char* retval = regparse++;
2028 if (*regparse == '(' && regparse[1] == '?' &&
2029 regparse[2] == '#') {
2030 while (*regparse && *regparse != ')')
2035 if (regflags & PMf_EXTENDED) {
2036 if (isSPACE(*regparse)) {
2040 else if (*regparse == '#') {
2041 while (*regparse && *regparse != '\n')
2052 - reg_node - emit a node
2054 STATIC regnode * /* Location. */
2057 register regnode *ret;
2058 register regnode *ptr;
2062 SIZE_ALIGN(regsize);
2063 #ifdef REGALIGN_STRUCT
2071 NODE_ALIGN_FILL(ret);
2073 FILL_ADVANCE_NODE(ptr, op);
2080 - reganode - emit a node with an argument
2082 STATIC regnode * /* Location. */
2083 reganode(U8 op, U32 arg)
2085 register regnode *ret;
2086 register regnode *ptr;
2090 SIZE_ALIGN(regsize);
2099 NODE_ALIGN_FILL(ret);
2101 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2108 - regc - emit (if appropriate) a byte of code
2118 - reginsert - insert an operator in front of already-emitted operand
2120 * Means relocating the operand.
2123 reginsert(U8 op, regnode *opnd)
2125 register regnode *src;
2126 register regnode *dst;
2127 register regnode *place;
2128 register int offset = regarglen[(U8)op];
2130 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2133 regsize += NODE_STEP_REGNODE + offset;
2138 regcode += NODE_STEP_REGNODE + offset;
2141 StructCopy(--src, --dst, regnode);
2143 place = opnd; /* Op node, where operand used to be. */
2144 src = NEXTOPER(place);
2145 FILL_ADVANCE_NODE(place, op);
2146 Zero(src, offset, regnode);
2147 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2148 src[offset + 1] = '\177';
2153 - regtail - set the next-pointer at the end of a node chain of p to val.
2156 regtail(regnode *p, regnode *val)
2158 register regnode *scan;
2159 register regnode *temp;
2160 register I32 offset;
2165 /* Find last node. */
2168 temp = regnext(scan);
2175 # ifdef REGALIGN_STRUCT
2176 if (reg_off_by_arg[OP(scan)]) {
2177 ARG_SET(scan, val - scan);
2179 NEXT_OFF(scan) = val - scan;
2182 offset = val - scan;
2184 *(short*)(scan+1) = offset;
2188 if (OP(scan) == BACK)
2189 offset = scan - val;
2191 offset = val - scan;
2192 *(scan+1) = (offset>>8)&0377;
2193 *(scan+2) = offset&0377;
2198 - regoptail - regtail on operand of first argument; nop if operandless
2201 regoptail(regnode *p, regnode *val)
2203 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2204 if (p == NULL || SIZE_ONLY)
2206 if (regkind[(U8)OP(p)] == BRANCH) {
2207 regtail(NEXTOPER(p), val);
2208 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2209 regtail(NEXTOPER(NEXTOPER(p)), val);
2215 - regcurly - a little FSA that accepts {\d+,?\d*}
2218 regcurly(register char *s)
2238 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2240 register char op = EXACT; /* Arbitrary non-END op. */
2241 register regnode *next, *onode;
2243 while (op != END && (!last || node < last)) {
2244 /* While that wasn't END last time... */
2250 next = regnext(node);
2252 if (OP(node) == OPTIMIZED)
2255 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2256 2*l + 1, "", SvPVX(sv));
2257 if (next == NULL) /* Next ptr. */
2258 PerlIO_printf(Perl_debug_log, "(0)");
2260 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2261 (void)PerlIO_putc(Perl_debug_log, '\n');
2263 if (regkind[(U8)op] == BRANCHJ) {
2264 register regnode *nnode = (OP(next) == LONGJMP
2267 if (last && nnode > last)
2269 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2270 } else if (regkind[(U8)op] == BRANCH) {
2271 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2272 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2273 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2274 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2275 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2276 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2278 } else if ( op == PLUS || op == STAR) {
2279 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2280 } else if (op == ANYOF) {
2281 node = NEXTOPER(node);
2283 } else if (regkind[(U8)op] == EXACT) {
2284 /* Literal string, where present. */
2285 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2286 node = NEXTOPER(node);
2288 node = NEXTOPER(node);
2289 node += regarglen[(U8)op];
2291 if (op == CURLYX || op == OPEN)
2293 else if (op == WHILEM)
2300 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2305 SV *sv = sv_newmortal();
2307 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2309 /* Header fields of interest. */
2310 if (r->anchored_substr)
2311 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2313 SvPVX(r->anchored_substr),
2315 SvTAIL(r->anchored_substr) ? "$" : "",
2316 r->anchored_offset);
2317 if (r->float_substr)
2318 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2320 SvPVX(r->float_substr),
2322 SvTAIL(r->float_substr) ? "$" : "",
2323 r->float_min_offset, r->float_max_offset);
2324 if (r->check_substr)
2325 PerlIO_printf(Perl_debug_log,
2326 r->check_substr == r->float_substr
2327 ? "(checking floating" : "(checking anchored");
2328 if (r->reganch & ROPT_NOSCAN)
2329 PerlIO_printf(Perl_debug_log, " noscan");
2330 if (r->reganch & ROPT_CHECK_ALL)
2331 PerlIO_printf(Perl_debug_log, " isall");
2332 if (r->check_substr)
2333 PerlIO_printf(Perl_debug_log, ") ");
2335 if (r->regstclass) {
2336 regprop(sv, r->regstclass);
2337 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2339 if (r->reganch & ROPT_ANCH) {
2340 PerlIO_printf(Perl_debug_log, "anchored");
2341 if (r->reganch & ROPT_ANCH_BOL)
2342 PerlIO_printf(Perl_debug_log, "(BOL)");
2343 if (r->reganch & ROPT_ANCH_MBOL)
2344 PerlIO_printf(Perl_debug_log, "(MBOL)");
2345 if (r->reganch & ROPT_ANCH_GPOS)
2346 PerlIO_printf(Perl_debug_log, "(GPOS)");
2347 PerlIO_putc(Perl_debug_log, ' ');
2349 if (r->reganch & ROPT_GPOS_SEEN)
2350 PerlIO_printf(Perl_debug_log, "GPOS ");
2351 if (r->reganch & ROPT_SKIP)
2352 PerlIO_printf(Perl_debug_log, "plus ");
2353 if (r->reganch & ROPT_IMPLICIT)
2354 PerlIO_printf(Perl_debug_log, "implicit ");
2355 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2356 PerlIO_printf(Perl_debug_log, "\n");
2360 - regprop - printable representation of opcode
2363 regprop(SV *sv, regnode *o)
2365 register char *p = 0;
2400 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2403 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2406 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2433 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2436 #ifdef REGALIGN_STRUCT
2437 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2439 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2443 #ifdef REGALIGN_STRUCT
2444 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2446 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2450 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2453 sv_catpvf(sv, "REF%d", ARG(o));
2456 sv_catpvf(sv, "REFF%d", ARG(o));
2459 sv_catpvf(sv, "REFFL%d", ARG(o));
2462 sv_catpvf(sv, "OPEN%d", ARG(o));
2465 sv_catpvf(sv, "CLOSE%d", ARG(o));
2481 #ifdef REGALIGN_STRUCT
2482 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2488 #ifdef REGALIGN_STRUCT
2489 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2543 sv_catpvf(sv, "GROUPP%d", ARG(o));
2558 FAIL("corrupted regexp opcode");
2563 #endif /* DEBUGGING */
2566 pregfree(struct regexp *r)
2568 if (!r || (--r->refcnt > 0))
2571 Safefree(r->precomp);
2573 Safefree(r->subbase);
2575 if (r->anchored_substr)
2576 SvREFCNT_dec(r->anchored_substr);
2577 if (r->float_substr)
2578 SvREFCNT_dec(r->float_substr);
2579 Safefree(r->substrs);
2582 int n = r->data->count;
2584 switch (r->data->what[n]) {
2586 SvREFCNT_dec((SV*)r->data->data[n]);
2589 op_free((OP_4tree*)r->data->data[n]);
2594 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2597 Safefree(r->data->what);
2600 Safefree(r->startp);
2606 - regnext - dig the "next" pointer out of a node
2608 * [Note, when REGALIGN is defined there are two places in regmatch()
2609 * that bypass this code for speed.]
2612 regnext(register regnode *p)
2614 register I32 offset;
2619 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2635 re_croak2(const char* pat1,const char* pat2,...)
2639 re_croak2(const char* pat1,const char* pat2, va_alist)
2646 STRLEN l1 = strlen(pat1);
2647 STRLEN l2 = strlen(pat2);
2655 Copy(pat1, buf, l1 , char);
2656 Copy(pat2, buf + l1, l2 , char);
2657 buf[l1 + l2 + 1] = '\n';
2658 buf[l1 + l2 + 2] = '\0';
2660 va_start(args, pat2);
2664 message = mess(buf, &args);
2666 l1 = strlen(message);
2669 Copy(message, buf, l1 , char);
2670 buf[l1] = '\0'; /* Overwrite \n */