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.
22 #ifdef PERL_EXT_RE_BUILD
23 /* need to replace pregcomp et al, so enable that */
24 # ifndef PERL_IN_XSUB_RE
25 # define PERL_IN_XSUB_RE
27 /* need access to debugger hooks */
28 # if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING)
33 #ifdef PERL_IN_XSUB_RE
34 /* We *really* need to overwrite these symbols: */
35 # define Perl_pregcomp my_regcomp
36 # define Perl_regdump my_regdump
37 # define Perl_regprop my_regprop
38 # define Perl_pregfree my_regfree
39 # define Perl_re_intuit_string my_re_intuit_string
40 /* *These* symbols are masked to allow static link. */
41 # define Perl_regnext my_regnext
42 # define Perl_save_re_context my_save_re_context
43 # define Perl_reginitcolors my_reginitcolors
45 # define PERL_NO_GET_CONTEXT
50 * pregcomp and pregexec -- regsub and regerror are not used in perl
52 * Copyright (c) 1986 by University of Toronto.
53 * Written by Henry Spencer. Not derived from licensed software.
55 * Permission is granted to anyone to use this software for any
56 * purpose on any computer system, and to redistribute it freely,
57 * subject to the following restrictions:
59 * 1. The author is not responsible for the consequences of use of
60 * this software, no matter how awful, even if they arise
63 * 2. The origin of this software must not be misrepresented, either
64 * by explicit claim or by omission.
66 * 3. Altered versions must be plainly marked as such, and must not
67 * be misrepresented as being the original software.
70 **** Alterations to Henry's code are...
72 **** Copyright (c) 1991-1999, Larry Wall
74 **** You may distribute under the terms of either the GNU General Public
75 **** License or the Artistic License, as specified in the README file.
78 * Beware that some of this code is subtly aware of the way operator
79 * precedence is structured in regular expressions. Serious changes in
80 * regular-expression syntax might require a total rethink.
83 #define PERL_IN_REGCOMP_C
86 #ifdef PERL_IN_XSUB_RE
87 # if defined(PERL_CAPI) || defined(PERL_OBJECT)
102 # if defined(BUGGY_MSC6)
103 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
104 # pragma optimize("a",off)
105 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
106 # pragma optimize("w",on )
107 # endif /* BUGGY_MSC6 */
111 #define STATIC static
114 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
115 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
116 ((*s) == '{' && regcurly(s)))
118 #define PERL_META "^$.[()|?+*\\"
120 #define META "^$.[()|?+*\\"
124 #undef SPSTART /* dratted cpp namespace... */
127 * Flags to be passed up and down.
129 #define WORST 0 /* Worst case. */
130 #define HASWIDTH 0x1 /* Known to match non-null strings. */
131 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
132 #define SPSTART 0x4 /* Starts with * or +. */
133 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
135 /* Length of a variant. */
137 typedef struct scan_data_t {
143 I32 last_end; /* min value, <0 unless valid. */
146 SV **longest; /* Either &l_fixed, or &l_float. */
150 I32 offset_float_min;
151 I32 offset_float_max;
154 struct regnode_charclass_class *start_class;
158 * Forward declarations for pregcomp()'s friends.
161 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
164 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
165 #define SF_BEFORE_SEOL 0x1
166 #define SF_BEFORE_MEOL 0x2
167 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
168 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
171 # define SF_FIX_SHIFT_EOL (0+2)
172 # define SF_FL_SHIFT_EOL (0+4)
174 # define SF_FIX_SHIFT_EOL (+2)
175 # define SF_FL_SHIFT_EOL (+4)
178 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
179 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
181 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
182 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
183 #define SF_IS_INF 0x40
184 #define SF_HAS_PAR 0x80
185 #define SF_IN_PAR 0x100
186 #define SF_HAS_EVAL 0x200
187 #define SCF_DO_SUBSTR 0x400
188 #define SCF_DO_STCLASS_AND 0x0800
189 #define SCF_DO_STCLASS_OR 0x1000
190 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
193 #define UTF (PL_reg_flags & RF_utf8)
194 #define LOC (PL_regflags & PMf_LOCALE)
195 #define FOLD (PL_regflags & PMf_FOLD)
197 #define OOB_CHAR8 1234
198 #define OOB_UTF8 123456
199 #define OOB_NAMEDCLASS -1
201 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
202 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
204 /* Allow for side effects in s */
205 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END
207 static void clear_re(pTHXo_ void *r);
209 /* Mark that we cannot extend a found fixed substring at this point.
210 Updata the longest found anchored substring and the longest found
211 floating substrings if needed. */
214 S_scan_commit(pTHX_ scan_data_t *data)
217 STRLEN l = CHR_SVLEN(data->last_found);
218 STRLEN old_l = CHR_SVLEN(*data->longest);
220 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
221 sv_setsv(*data->longest, data->last_found);
222 if (*data->longest == data->longest_fixed) {
223 data->offset_fixed = l ? data->last_start_min : data->pos_min;
224 if (data->flags & SF_BEFORE_EOL)
226 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
228 data->flags &= ~SF_FIX_BEFORE_EOL;
231 data->offset_float_min = l ? data->last_start_min : data->pos_min;
232 data->offset_float_max = (l
233 ? data->last_start_max
234 : data->pos_min + data->pos_delta);
235 if (data->flags & SF_BEFORE_EOL)
237 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
239 data->flags &= ~SF_FL_BEFORE_EOL;
242 SvCUR_set(data->last_found, 0);
244 data->flags &= ~SF_BEFORE_EOL;
247 /* Can match anything (initialization) */
249 S_cl_anything(pTHX_ struct regnode_charclass_class *cl)
253 ANYOF_CLASS_ZERO(cl);
254 for (value = 0; value < 256; ++value)
255 ANYOF_BITMAP_SET(cl, value);
256 cl->flags = ANYOF_EOS;
258 cl->flags |= ANYOF_LOCALE;
261 /* Can match anything (initialization) */
263 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
267 for (value = 0; value < ANYOF_MAX; value += 2)
268 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
270 for (value = 0; value < 256; ++value)
271 if (!ANYOF_BITMAP_TEST(cl, value))
276 /* Can match anything (initialization) */
278 S_cl_init(pTHX_ struct regnode_charclass_class *cl)
285 S_cl_init_zero(pTHX_ struct regnode_charclass_class *cl)
289 ANYOF_CLASS_ZERO(cl);
290 ANYOF_BITMAP_ZERO(cl);
292 cl->flags |= ANYOF_LOCALE;
295 /* 'And' a given class with another one. Can create false positives */
296 /* We assume that cl is not inverted */
298 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
299 struct regnode_charclass_class *and_with)
303 if (!(and_with->flags & ANYOF_CLASS)
304 && !(cl->flags & ANYOF_CLASS)
305 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
306 && !(and_with->flags & ANYOF_FOLD)
307 && !(cl->flags & ANYOF_FOLD)) {
310 if (and_with->flags & ANYOF_INVERT)
311 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
312 cl->bitmap[i] &= ~and_with->bitmap[i];
314 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
315 cl->bitmap[i] &= and_with->bitmap[i];
316 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
317 if (!(and_with->flags & ANYOF_EOS))
318 cl->flags &= ~ANYOF_EOS;
321 /* 'OR' a given class with another one. Can create false positives */
322 /* We assume that cl is not inverted */
324 S_cl_or(pTHX_ struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
328 if (or_with->flags & ANYOF_INVERT) {
330 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
331 * <= (B1 | !B2) | (CL1 | !CL2)
332 * which is wasteful if CL2 is small, but we ignore CL2:
333 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
334 * XXXX Can we handle case-fold? Unclear:
335 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
336 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
338 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
339 && !(or_with->flags & ANYOF_FOLD)
340 && !(cl->flags & ANYOF_FOLD) ) {
343 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
344 cl->bitmap[i] |= ~or_with->bitmap[i];
345 } /* XXXX: logic is complicated otherwise */
350 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
351 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
352 && (!(or_with->flags & ANYOF_FOLD)
353 || (cl->flags & ANYOF_FOLD)) ) {
356 /* OR char bitmap and class bitmap separately */
357 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
358 cl->bitmap[i] |= or_with->bitmap[i];
359 if (or_with->flags & ANYOF_CLASS) {
360 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
361 cl->classflags[i] |= or_with->classflags[i];
362 cl->flags |= ANYOF_CLASS;
365 else { /* XXXX: logic is complicated, leave it along for a moment. */
369 if (or_with->flags & ANYOF_EOS)
370 cl->flags |= ANYOF_EOS;
373 /* REx optimizer. Converts nodes into quickier variants "in place".
374 Finds fixed substrings. */
376 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
377 to the position after last scanned or to NULL. */
380 S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
381 /* scanp: Start here (read-write). */
382 /* deltap: Write maxlen-minlen here. */
383 /* last: Stop before this one. */
386 I32 min = 0, pars = 0, code;
387 regnode *scan = *scanp, *next;
389 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
390 int is_inf_internal = 0; /* The studied chunk is infinite */
391 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
392 scan_data_t data_fake;
393 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
395 while (scan && OP(scan) != END && scan < last) {
396 /* Peephole optimizer: */
398 if (PL_regkind[(U8)OP(scan)] == EXACT) {
399 /* Merge several consecutive EXACTish nodes into one. */
400 regnode *n = regnext(scan);
403 regnode *stop = scan;
406 next = scan + NODE_SZ_STR(scan);
407 /* Skip NOTHING, merge EXACT*. */
409 ( PL_regkind[(U8)OP(n)] == NOTHING ||
410 (stringok && (OP(n) == OP(scan))))
412 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
413 if (OP(n) == TAIL || n > next)
415 if (PL_regkind[(U8)OP(n)] == NOTHING) {
416 NEXT_OFF(scan) += NEXT_OFF(n);
417 next = n + NODE_STEP_REGNODE;
425 int oldl = STR_LEN(scan);
426 regnode *nnext = regnext(n);
428 if (oldl + STR_LEN(n) > U8_MAX)
430 NEXT_OFF(scan) += NEXT_OFF(n);
431 STR_LEN(scan) += STR_LEN(n);
432 next = n + NODE_SZ_STR(n);
433 /* Now we can overwrite *n : */
434 Move(STRING(n), STRING(scan) + oldl,
445 n = scan + NODE_SZ_STR(scan);
447 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
455 /* Follow the next-chain of the current node and optimize
456 away all the NOTHINGs from it. */
457 if (OP(scan) != CURLYX) {
458 int max = (reg_off_by_arg[OP(scan)]
460 /* I32 may be smaller than U16 on CRAYs! */
461 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
462 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
466 /* Skip NOTHING and LONGJMP. */
467 while ((n = regnext(n))
468 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
469 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
472 if (reg_off_by_arg[OP(scan)])
475 NEXT_OFF(scan) = off;
477 /* The principal pseudo-switch. Cannot be a switch, since we
478 look into several different things. */
479 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
480 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
481 next = regnext(scan);
484 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
485 I32 max1 = 0, min1 = I32_MAX, num = 0;
486 struct regnode_charclass_class accum;
488 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
489 scan_commit(data); /* Cannot merge strings after this. */
490 if (flags & SCF_DO_STCLASS)
491 cl_init_zero(&accum);
492 while (OP(scan) == code) {
493 I32 deltanext, minnext, f = 0;
494 struct regnode_charclass_class this_class;
499 data_fake.whilem_c = data->whilem_c;
500 next = regnext(scan);
501 scan = NEXTOPER(scan);
503 scan = NEXTOPER(scan);
504 if (flags & SCF_DO_STCLASS) {
505 cl_init(&this_class);
506 data_fake.start_class = &this_class;
507 f = SCF_DO_STCLASS_AND;
509 /* we suppose the run is continuous, last=next...*/
510 minnext = study_chunk(&scan, &deltanext, next,
514 if (max1 < minnext + deltanext)
515 max1 = minnext + deltanext;
516 if (deltanext == I32_MAX)
517 is_inf = is_inf_internal = 1;
519 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
521 if (data && (data_fake.flags & SF_HAS_EVAL))
522 data->flags |= SF_HAS_EVAL;
524 data->whilem_c = data_fake.whilem_c;
525 if (flags & SCF_DO_STCLASS)
526 cl_or(&accum, &this_class);
530 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
532 if (flags & SCF_DO_SUBSTR) {
533 data->pos_min += min1;
534 data->pos_delta += max1 - min1;
535 if (max1 != min1 || is_inf)
536 data->longest = &(data->longest_float);
539 delta += max1 - min1;
540 if (flags & SCF_DO_STCLASS_OR) {
541 cl_or(data->start_class, &accum);
543 cl_and(data->start_class, &and_with);
544 flags &= ~SCF_DO_STCLASS;
547 else if (flags & SCF_DO_STCLASS_AND) {
549 cl_and(data->start_class, &accum);
550 flags &= ~SCF_DO_STCLASS;
553 /* Switch to OR mode: cache the old value of
554 * data->start_class */
555 StructCopy(data->start_class, &and_with,
556 struct regnode_charclass_class);
557 flags &= ~SCF_DO_STCLASS_AND;
558 StructCopy(&accum, data->start_class,
559 struct regnode_charclass_class);
560 flags |= SCF_DO_STCLASS_OR;
561 data->start_class->flags |= ANYOF_EOS;
565 else if (code == BRANCHJ) /* single branch is optimized. */
566 scan = NEXTOPER(NEXTOPER(scan));
567 else /* single branch is optimized. */
568 scan = NEXTOPER(scan);
571 else if (OP(scan) == EXACT) {
572 I32 l = STR_LEN(scan);
574 unsigned char *s = (unsigned char *)STRING(scan);
575 unsigned char *e = s + l;
584 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
585 /* The code below prefers earlier match for fixed
586 offset, later match for variable offset. */
587 if (data->last_end == -1) { /* Update the start info. */
588 data->last_start_min = data->pos_min;
589 data->last_start_max = is_inf
590 ? I32_MAX : data->pos_min + data->pos_delta;
592 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
593 data->last_end = data->pos_min + l;
594 data->pos_min += l; /* As in the first entry. */
595 data->flags &= ~SF_BEFORE_EOL;
597 if (flags & SCF_DO_STCLASS_AND) {
598 /* Check whether it is compatible with what we know already! */
601 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
602 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
603 && (!(data->start_class->flags & ANYOF_FOLD)
604 || !ANYOF_BITMAP_TEST(data->start_class,
605 PL_fold[*STRING(scan)])))
607 ANYOF_CLASS_ZERO(data->start_class);
608 ANYOF_BITMAP_ZERO(data->start_class);
610 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
611 data->start_class->flags &= ~ANYOF_EOS;
613 else if (flags & SCF_DO_STCLASS_OR) {
614 /* false positive possible if the class is case-folded */
615 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
616 data->start_class->flags &= ~ANYOF_EOS;
617 cl_and(data->start_class, &and_with);
619 flags &= ~SCF_DO_STCLASS;
621 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
622 I32 l = STR_LEN(scan);
624 /* Search for fixed substrings supports EXACT only. */
625 if (flags & SCF_DO_SUBSTR)
628 unsigned char *s = (unsigned char *)STRING(scan);
629 unsigned char *e = s + l;
638 if (data && (flags & SCF_DO_SUBSTR))
640 if (flags & SCF_DO_STCLASS_AND) {
641 /* Check whether it is compatible with what we know already! */
644 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
645 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
646 && !ANYOF_BITMAP_TEST(data->start_class,
647 PL_fold[*STRING(scan)]))
649 ANYOF_CLASS_ZERO(data->start_class);
650 ANYOF_BITMAP_ZERO(data->start_class);
652 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
653 data->start_class->flags &= ~ANYOF_EOS;
654 data->start_class->flags |= ANYOF_FOLD;
655 if (OP(scan) == EXACTFL)
656 data->start_class->flags |= ANYOF_LOCALE;
659 else if (flags & SCF_DO_STCLASS_OR) {
660 if (data->start_class->flags & ANYOF_FOLD) {
661 /* false positive possible if the class is case-folded.
662 Assume that the locale settings are the same... */
663 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
664 data->start_class->flags &= ~ANYOF_EOS;
666 cl_and(data->start_class, &and_with);
668 flags &= ~SCF_DO_STCLASS;
670 else if (strchr((char*)PL_varies,OP(scan))) {
671 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
673 regnode *oscan = scan;
674 struct regnode_charclass_class this_class;
675 struct regnode_charclass_class *oclass = NULL;
677 switch (PL_regkind[(U8)OP(scan)]) {
678 case WHILEM: /* End of (?:...)* . */
679 scan = NEXTOPER(scan);
682 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
683 next = NEXTOPER(scan);
684 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
686 maxcount = REG_INFTY;
687 next = regnext(scan);
688 scan = NEXTOPER(scan);
692 if (flags & SCF_DO_SUBSTR)
697 if (flags & SCF_DO_STCLASS) {
699 maxcount = REG_INFTY;
700 next = regnext(scan);
701 scan = NEXTOPER(scan);
704 is_inf = is_inf_internal = 1;
705 scan = regnext(scan);
706 if (flags & SCF_DO_SUBSTR) {
707 scan_commit(data); /* Cannot extend fixed substrings */
708 data->longest = &(data->longest_float);
710 goto optimize_curly_tail;
712 mincount = ARG1(scan);
713 maxcount = ARG2(scan);
714 next = regnext(scan);
715 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
717 if (flags & SCF_DO_SUBSTR) {
718 if (mincount == 0) scan_commit(data); /* Cannot extend fixed substrings */
719 pos_before = data->pos_min;
723 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
725 data->flags |= SF_IS_INF;
727 if (flags & SCF_DO_STCLASS) {
728 cl_init(&this_class);
729 oclass = data->start_class;
730 data->start_class = &this_class;
731 f |= SCF_DO_STCLASS_AND;
732 f &= ~SCF_DO_STCLASS_OR;
735 /* This will finish on WHILEM, setting scan, or on NULL: */
736 minnext = study_chunk(&scan, &deltanext, last, data,
738 ? (f & ~SCF_DO_SUBSTR) : f);
740 if (flags & SCF_DO_STCLASS)
741 data->start_class = oclass;
742 if (mincount == 0 || minnext == 0) {
743 if (flags & SCF_DO_STCLASS_OR) {
744 cl_or(data->start_class, &this_class);
746 else if (flags & SCF_DO_STCLASS_AND) {
747 /* Switch to OR mode: cache the old value of
748 * data->start_class */
749 StructCopy(data->start_class, &and_with,
750 struct regnode_charclass_class);
751 flags &= ~SCF_DO_STCLASS_AND;
752 StructCopy(&this_class, data->start_class,
753 struct regnode_charclass_class);
754 flags |= SCF_DO_STCLASS_OR;
755 data->start_class->flags |= ANYOF_EOS;
757 } else { /* Non-zero len */
758 if (flags & SCF_DO_STCLASS_OR) {
759 cl_or(data->start_class, &this_class);
760 cl_and(data->start_class, &and_with);
762 else if (flags & SCF_DO_STCLASS_AND)
763 cl_and(data->start_class, &this_class);
764 flags &= ~SCF_DO_STCLASS;
766 if (!scan) /* It was not CURLYX, but CURLY. */
768 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
769 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
770 && maxcount <= REG_INFTY/3) /* Complement check for big count */
771 Perl_warner(aTHX_ WARN_UNSAFE,
772 "Strange *+?{} on zero-length expression");
773 min += minnext * mincount;
774 is_inf_internal |= (maxcount == REG_INFTY
775 && (minnext + deltanext) > 0
776 || deltanext == I32_MAX);
777 is_inf |= is_inf_internal;
778 delta += (minnext + deltanext) * maxcount - minnext * mincount;
780 /* Try powerful optimization CURLYX => CURLYN. */
781 if ( OP(oscan) == CURLYX && data
782 && data->flags & SF_IN_PAR
783 && !(data->flags & SF_HAS_EVAL)
784 && !deltanext && minnext == 1 ) {
785 /* Try to optimize to CURLYN. */
786 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
787 regnode *nxt1 = nxt, *nxt2;
791 if (!strchr((char*)PL_simple,OP(nxt))
792 && !(PL_regkind[(U8)OP(nxt)] == EXACT
793 && STR_LEN(nxt) == 1))
797 if (OP(nxt) != CLOSE)
799 /* Now we know that nxt2 is the only contents: */
800 oscan->flags = ARG(nxt);
802 OP(nxt1) = NOTHING; /* was OPEN. */
804 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
805 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
806 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
807 OP(nxt) = OPTIMIZED; /* was CLOSE. */
808 OP(nxt + 1) = OPTIMIZED; /* was count. */
809 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
814 /* Try optimization CURLYX => CURLYM. */
815 if ( OP(oscan) == CURLYX && data
816 && !(data->flags & SF_HAS_PAR)
817 && !(data->flags & SF_HAS_EVAL)
819 /* XXXX How to optimize if data == 0? */
820 /* Optimize to a simpler form. */
821 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
825 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
826 && (OP(nxt2) != WHILEM))
828 OP(nxt2) = SUCCEED; /* Whas WHILEM */
829 /* Need to optimize away parenths. */
830 if (data->flags & SF_IN_PAR) {
831 /* Set the parenth number. */
832 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
834 if (OP(nxt) != CLOSE)
835 FAIL("panic opt close");
836 oscan->flags = ARG(nxt);
837 OP(nxt1) = OPTIMIZED; /* was OPEN. */
838 OP(nxt) = OPTIMIZED; /* was CLOSE. */
840 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
841 OP(nxt + 1) = OPTIMIZED; /* was count. */
842 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
843 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
846 while ( nxt1 && (OP(nxt1) != WHILEM)) {
847 regnode *nnxt = regnext(nxt1);
850 if (reg_off_by_arg[OP(nxt1)])
851 ARG_SET(nxt1, nxt2 - nxt1);
852 else if (nxt2 - nxt1 < U16_MAX)
853 NEXT_OFF(nxt1) = nxt2 - nxt1;
855 OP(nxt) = NOTHING; /* Cannot beautify */
860 /* Optimize again: */
861 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
866 else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) {
867 /* This stays as CURLYX, and can put the count/of pair. */
868 /* Find WHILEM (as in regexec.c) */
869 regnode *nxt = oscan + NEXT_OFF(oscan);
871 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
873 PREVOPER(nxt)->flags = data->whilem_c
874 | (PL_reg_whilem_seen << 4); /* On WHILEM */
876 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
878 if (flags & SCF_DO_SUBSTR) {
879 SV *last_str = Nullsv;
880 int counted = mincount != 0;
882 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
883 I32 b = pos_before >= data->last_start_min
884 ? pos_before : data->last_start_min;
886 char *s = SvPV(data->last_found, l);
887 I32 old = b - data->last_start_min;
890 old = utf8_hop((U8*)s, old) - (U8*)s;
893 /* Get the added string: */
894 last_str = newSVpvn(s + old, l);
895 if (deltanext == 0 && pos_before == b) {
896 /* What was added is a constant string */
898 SvGROW(last_str, (mincount * l) + 1);
899 repeatcpy(SvPVX(last_str) + l,
900 SvPVX(last_str), l, mincount - 1);
901 SvCUR(last_str) *= mincount;
902 /* Add additional parts. */
903 SvCUR_set(data->last_found,
904 SvCUR(data->last_found) - l);
905 sv_catsv(data->last_found, last_str);
906 data->last_end += l * (mincount - 1);
910 /* It is counted once already... */
911 data->pos_min += minnext * (mincount - counted);
912 data->pos_delta += - counted * deltanext +
913 (minnext + deltanext) * maxcount - minnext * mincount;
914 if (mincount != maxcount) {
915 /* Cannot extend fixed substrings found inside
918 if (mincount && last_str) {
919 sv_setsv(data->last_found, last_str);
920 data->last_end = data->pos_min;
921 data->last_start_min =
922 data->pos_min - CHR_SVLEN(last_str);
923 data->last_start_max = is_inf
925 : data->pos_min + data->pos_delta
926 - CHR_SVLEN(last_str);
928 data->longest = &(data->longest_float);
930 SvREFCNT_dec(last_str);
932 if (data && (fl & SF_HAS_EVAL))
933 data->flags |= SF_HAS_EVAL;
935 if (OP(oscan) != CURLYX) {
936 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
938 NEXT_OFF(oscan) += NEXT_OFF(next);
941 default: /* REF and CLUMP only? */
942 if (flags & SCF_DO_SUBSTR) {
943 scan_commit(data); /* Cannot expect anything... */
944 data->longest = &(data->longest_float);
946 is_inf = is_inf_internal = 1;
947 if (flags & SCF_DO_STCLASS_OR)
948 cl_anything(data->start_class);
949 flags &= ~SCF_DO_STCLASS;
953 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
956 if (flags & SCF_DO_SUBSTR) {
961 if (flags & SCF_DO_STCLASS) {
962 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
964 /* Some of the logic below assumes that switching
965 locale on will only add false positives. */
966 switch (PL_regkind[(U8)OP(scan)]) {
983 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
984 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
985 cl_anything(data->start_class);
988 if (OP(scan) == SANY)
990 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
991 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
992 || (data->start_class->flags & ANYOF_CLASS));
993 cl_anything(data->start_class);
995 if (flags & SCF_DO_STCLASS_AND || !value)
996 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
999 if (flags & SCF_DO_STCLASS_AND)
1000 cl_and(data->start_class,
1001 (struct regnode_charclass_class*)scan);
1003 cl_or(data->start_class,
1004 (struct regnode_charclass_class*)scan);
1007 if (flags & SCF_DO_STCLASS_AND) {
1008 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1009 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1010 for (value = 0; value < 256; value++)
1011 if (!isALNUM(value))
1012 ANYOF_BITMAP_CLEAR(data->start_class, value);
1016 if (data->start_class->flags & ANYOF_LOCALE)
1017 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1019 for (value = 0; value < 256; value++)
1021 ANYOF_BITMAP_SET(data->start_class, value);
1026 if (flags & SCF_DO_STCLASS_AND) {
1027 if (data->start_class->flags & ANYOF_LOCALE)
1028 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1031 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1032 data->start_class->flags |= ANYOF_LOCALE;
1036 if (flags & SCF_DO_STCLASS_AND) {
1037 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1038 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1039 for (value = 0; value < 256; value++)
1041 ANYOF_BITMAP_CLEAR(data->start_class, value);
1045 if (data->start_class->flags & ANYOF_LOCALE)
1046 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1048 for (value = 0; value < 256; value++)
1049 if (!isALNUM(value))
1050 ANYOF_BITMAP_SET(data->start_class, value);
1055 if (flags & SCF_DO_STCLASS_AND) {
1056 if (data->start_class->flags & ANYOF_LOCALE)
1057 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1060 data->start_class->flags |= ANYOF_LOCALE;
1061 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1065 if (flags & SCF_DO_STCLASS_AND) {
1066 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1067 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1068 for (value = 0; value < 256; value++)
1069 if (!isSPACE(value))
1070 ANYOF_BITMAP_CLEAR(data->start_class, value);
1074 if (data->start_class->flags & ANYOF_LOCALE)
1075 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1077 for (value = 0; value < 256; value++)
1079 ANYOF_BITMAP_SET(data->start_class, value);
1084 if (flags & SCF_DO_STCLASS_AND) {
1085 if (data->start_class->flags & ANYOF_LOCALE)
1086 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1089 data->start_class->flags |= ANYOF_LOCALE;
1090 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1094 if (flags & SCF_DO_STCLASS_AND) {
1095 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1096 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1097 for (value = 0; value < 256; value++)
1099 ANYOF_BITMAP_CLEAR(data->start_class, value);
1103 if (data->start_class->flags & ANYOF_LOCALE)
1104 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1106 for (value = 0; value < 256; value++)
1107 if (!isSPACE(value))
1108 ANYOF_BITMAP_SET(data->start_class, value);
1113 if (flags & SCF_DO_STCLASS_AND) {
1114 if (data->start_class->flags & ANYOF_LOCALE) {
1115 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1116 for (value = 0; value < 256; value++)
1117 if (!isSPACE(value))
1118 ANYOF_BITMAP_CLEAR(data->start_class, value);
1122 data->start_class->flags |= ANYOF_LOCALE;
1123 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1127 if (flags & SCF_DO_STCLASS_AND) {
1128 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1129 for (value = 0; value < 256; value++)
1130 if (!isDIGIT(value))
1131 ANYOF_BITMAP_CLEAR(data->start_class, value);
1134 if (data->start_class->flags & ANYOF_LOCALE)
1135 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1137 for (value = 0; value < 256; value++)
1139 ANYOF_BITMAP_SET(data->start_class, value);
1144 if (flags & SCF_DO_STCLASS_AND) {
1145 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1146 for (value = 0; value < 256; value++)
1148 ANYOF_BITMAP_CLEAR(data->start_class, value);
1151 if (data->start_class->flags & ANYOF_LOCALE)
1152 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1154 for (value = 0; value < 256; value++)
1155 if (!isDIGIT(value))
1156 ANYOF_BITMAP_SET(data->start_class, value);
1161 if (flags & SCF_DO_STCLASS_OR)
1162 cl_and(data->start_class, &and_with);
1163 flags &= ~SCF_DO_STCLASS;
1166 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1167 data->flags |= (OP(scan) == MEOL
1171 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1172 /* Lookbehind, or need to calculate parens/evals/stclass: */
1173 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1174 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1175 /* Lookahead/lookbehind */
1176 I32 deltanext, minnext;
1178 struct regnode_charclass_class intrnl;
1181 data_fake.flags = 0;
1183 data_fake.whilem_c = data->whilem_c;
1184 if ( flags & SCF_DO_STCLASS && !scan->flags
1185 && OP(scan) == IFMATCH ) { /* Lookahead */
1187 data_fake.start_class = &intrnl;
1188 f = SCF_DO_STCLASS_AND;
1190 next = regnext(scan);
1191 nscan = NEXTOPER(NEXTOPER(scan));
1192 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, f);
1195 FAIL("variable length lookbehind not implemented");
1197 else if (minnext > U8_MAX) {
1198 FAIL2("lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1200 scan->flags = minnext;
1202 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1204 if (data && (data_fake.flags & SF_HAS_EVAL))
1205 data->flags |= SF_HAS_EVAL;
1207 data->whilem_c = data_fake.whilem_c;
1209 int was = (data->start_class->flags & ANYOF_EOS);
1211 cl_and(data->start_class, &intrnl);
1213 data->start_class->flags |= ANYOF_EOS;
1216 else if (OP(scan) == OPEN) {
1219 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
1220 next = regnext(scan);
1222 if ( next && (OP(next) != WHILEM) && next < last)
1223 is_par = 0; /* Disable optimization */
1225 else if (OP(scan) == EVAL) {
1227 data->flags |= SF_HAS_EVAL;
1229 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
1230 if (flags & SCF_DO_SUBSTR) {
1232 data->longest = &(data->longest_float);
1234 is_inf = is_inf_internal = 1;
1235 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1236 cl_anything(data->start_class);
1238 /* Else: zero-length, ignore. */
1239 scan = regnext(scan);
1244 *deltap = is_inf_internal ? I32_MAX : delta;
1245 if (flags & SCF_DO_SUBSTR && is_inf)
1246 data->pos_delta = I32_MAX - data->pos_min;
1247 if (is_par > U8_MAX)
1249 if (is_par && pars==1 && data) {
1250 data->flags |= SF_IN_PAR;
1251 data->flags &= ~SF_HAS_PAR;
1253 else if (pars && data) {
1254 data->flags |= SF_HAS_PAR;
1255 data->flags &= ~SF_IN_PAR;
1257 if (flags & SCF_DO_STCLASS_OR)
1258 cl_and(data->start_class, &and_with);
1263 S_add_data(pTHX_ I32 n, char *s)
1266 if (PL_regcomp_rx->data) {
1267 Renewc(PL_regcomp_rx->data,
1268 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
1269 char, struct reg_data);
1270 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
1271 PL_regcomp_rx->data->count += n;
1274 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
1275 char, struct reg_data);
1276 New(1208, PL_regcomp_rx->data->what, n, U8);
1277 PL_regcomp_rx->data->count = n;
1279 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
1280 return PL_regcomp_rx->data->count - n;
1284 Perl_reginitcolors(pTHX)
1288 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1291 PL_colors[0] = s = savepv(s);
1293 s = strchr(s, '\t');
1299 PL_colors[i] = s = "";
1303 PL_colors[i++] = "";
1309 - pregcomp - compile a regular expression into internal code
1311 * We can't allocate space until we know how big the compiled form will be,
1312 * but we can't compile it (and thus know how big it is) until we've got a
1313 * place to put the code. So we cheat: we compile it twice, once with code
1314 * generation turned off and size counting turned on, and once "for real".
1315 * This also means that we don't allocate space until we are sure that the
1316 * thing really will compile successfully, and we never have to move the
1317 * code and thus invalidate pointers into it. (Note that it has to be in
1318 * one piece because free() must be able to free it all.) [NB: not true in perl]
1320 * Beware that the optimization-preparation code in here knows about some
1321 * of the structure of the compiled regexp. [I'll say.]
1324 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1340 FAIL("NULL regexp argument");
1342 if (pm->op_pmdynflags & PMdf_UTF8) {
1343 PL_reg_flags |= RF_utf8;
1348 PL_regprecomp = savepvn(exp, xend - exp);
1349 DEBUG_r(if (!PL_colorset) reginitcolors());
1350 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1351 PL_colors[4],PL_colors[5],PL_colors[0],
1352 (int)(xend - exp), PL_regprecomp, PL_colors[1]));
1353 PL_regflags = pm->op_pmflags;
1357 PL_seen_zerolen = *exp == '^' ? -1 : 0;
1361 /* First pass: determine size, legality. */
1362 PL_regcomp_parse = exp;
1367 PL_regcode = &PL_regdummy;
1368 PL_reg_whilem_seen = 0;
1369 REGC((U8)REG_MAGIC, (char*)PL_regcode);
1370 if (reg(0, &flags) == NULL) {
1371 Safefree(PL_regprecomp);
1372 PL_regprecomp = Nullch;
1375 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)PL_regsize));
1377 /* Small enough for pointer-storage convention?
1378 If extralen==0, this means that we will not need long jumps. */
1379 if (PL_regsize >= 0x10000L && PL_extralen)
1380 PL_regsize += PL_extralen;
1383 if (PL_reg_whilem_seen > 15)
1384 PL_reg_whilem_seen = 15;
1386 /* Allocate space and initialize. */
1387 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
1390 FAIL("regexp out of space");
1392 r->prelen = xend - exp;
1393 r->precomp = PL_regprecomp;
1395 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1396 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
1398 r->substrs = 0; /* Useful during FAIL. */
1399 r->startp = 0; /* Useful during FAIL. */
1400 r->endp = 0; /* Useful during FAIL. */
1404 /* Second pass: emit code. */
1405 PL_regcomp_parse = exp;
1409 PL_regcode = r->program;
1410 /* Store the count of eval-groups for security checks: */
1411 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
1412 REGC((U8)REG_MAGIC, (char*) PL_regcode++);
1414 if (reg(0, &flags) == NULL)
1417 /* Dig out information for optimizations. */
1418 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1419 pm->op_pmflags = PL_regflags;
1421 r->reganch |= ROPT_UTF8;
1422 r->regstclass = NULL;
1423 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
1424 r->reganch |= ROPT_NAUGHTY;
1425 scan = r->program + 1; /* First BRANCH. */
1427 /* XXXX To minimize changes to RE engine we always allocate
1428 3-units-long substrs field. */
1429 Newz(1004, r->substrs, 1, struct reg_substr_data);
1431 StructCopy(&zero_scan_data, &data, scan_data_t);
1432 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1433 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1435 STRLEN longest_float_length, longest_fixed_length;
1436 struct regnode_charclass_class ch_class;
1440 /* Skip introductions and multiplicators >= 1. */
1441 while ((OP(first) == OPEN && (sawopen = 1)) ||
1442 /* An OR of *one* alternative - should not happen now. */
1443 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1444 (OP(first) == PLUS) ||
1445 (OP(first) == MINMOD) ||
1446 /* An {n,m} with n>0 */
1447 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1448 if (OP(first) == PLUS)
1451 first += regarglen[(U8)OP(first)];
1452 first = NEXTOPER(first);
1455 /* Starting-point info. */
1457 if (PL_regkind[(U8)OP(first)] == EXACT) {
1458 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
1459 else if ((OP(first) == EXACTF || OP(first) == EXACTFL)
1461 r->regstclass = first;
1463 else if (strchr((char*)PL_simple,OP(first)))
1464 r->regstclass = first;
1465 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1466 PL_regkind[(U8)OP(first)] == NBOUND)
1467 r->regstclass = first;
1468 else if (PL_regkind[(U8)OP(first)] == BOL) {
1469 r->reganch |= (OP(first) == MBOL
1471 : (OP(first) == SBOL
1474 first = NEXTOPER(first);
1477 else if (OP(first) == GPOS) {
1478 r->reganch |= ROPT_ANCH_GPOS;
1479 first = NEXTOPER(first);
1482 else if ((OP(first) == STAR &&
1483 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1484 !(r->reganch & ROPT_ANCH) )
1486 /* turn .* into ^.* with an implied $*=1 */
1487 int type = OP(NEXTOPER(first));
1489 if (type == REG_ANY || type == ANYUTF8)
1490 type = ROPT_ANCH_MBOL;
1492 type = ROPT_ANCH_SBOL;
1494 r->reganch |= type | ROPT_IMPLICIT;
1495 first = NEXTOPER(first);
1498 if (sawplus && (!sawopen || !PL_regsawback)
1499 && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */
1500 /* x+ must match at the 1st pos of run of x's */
1501 r->reganch |= ROPT_SKIP;
1503 /* Scan is after the zeroth branch, first is atomic matcher. */
1504 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1505 (IV)(first - scan + 1)));
1507 * If there's something expensive in the r.e., find the
1508 * longest literal string that must appear and make it the
1509 * regmust. Resolve ties in favor of later strings, since
1510 * the regstart check works with the beginning of the r.e.
1511 * and avoiding duplication strengthens checking. Not a
1512 * strong reason, but sufficient in the absence of others.
1513 * [Now we resolve ties in favor of the earlier string if
1514 * it happens that c_offset_min has been invalidated, since the
1515 * earlier string may buy us something the later one won't.]
1519 data.longest_fixed = newSVpvn("",0);
1520 data.longest_float = newSVpvn("",0);
1521 data.last_found = newSVpvn("",0);
1522 data.longest = &(data.longest_fixed);
1524 if (!r->regstclass) {
1526 data.start_class = &ch_class;
1527 stclass_flag = SCF_DO_STCLASS_AND;
1528 } else /* XXXX Check for BOUND? */
1531 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
1532 &data, SCF_DO_SUBSTR | stclass_flag);
1533 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
1534 && data.last_start_min == 0 && data.last_end > 0
1536 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1537 r->reganch |= ROPT_CHECK_ALL;
1539 SvREFCNT_dec(data.last_found);
1541 longest_float_length = CHR_SVLEN(data.longest_float);
1542 if (longest_float_length
1543 || (data.flags & SF_FL_BEFORE_EOL
1544 && (!(data.flags & SF_FL_BEFORE_MEOL)
1545 || (PL_regflags & PMf_MULTILINE)))) {
1548 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1549 && data.offset_fixed == data.offset_float_min
1550 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1551 goto remove_float; /* As in (a)+. */
1553 r->float_substr = data.longest_float;
1554 r->float_min_offset = data.offset_float_min;
1555 r->float_max_offset = data.offset_float_max;
1556 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1557 && (!(data.flags & SF_FL_BEFORE_MEOL)
1558 || (PL_regflags & PMf_MULTILINE)));
1559 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1563 r->float_substr = Nullsv;
1564 SvREFCNT_dec(data.longest_float);
1565 longest_float_length = 0;
1568 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1569 if (longest_fixed_length
1570 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1571 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1572 || (PL_regflags & PMf_MULTILINE)))) {
1575 r->anchored_substr = data.longest_fixed;
1576 r->anchored_offset = data.offset_fixed;
1577 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1578 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1579 || (PL_regflags & PMf_MULTILINE)));
1580 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1583 r->anchored_substr = Nullsv;
1584 SvREFCNT_dec(data.longest_fixed);
1585 longest_fixed_length = 0;
1588 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8
1589 || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY))
1590 r->regstclass = NULL;
1591 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1592 && !(data.start_class->flags & ANYOF_EOS)
1593 && !cl_is_anything(data.start_class)) {
1595 I32 n = add_data(1, "f");
1597 New(1006, PL_regcomp_rx->data->data[n], 1,
1598 struct regnode_charclass_class);
1599 StructCopy(data.start_class,
1600 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1601 struct regnode_charclass_class);
1602 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1603 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1604 DEBUG_r((sv = sv_newmortal(),
1605 regprop(sv, (regnode*)data.start_class),
1606 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1610 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1611 if (longest_fixed_length > longest_float_length) {
1612 r->check_substr = r->anchored_substr;
1613 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1614 if (r->reganch & ROPT_ANCH_SINGLE)
1615 r->reganch |= ROPT_NOSCAN;
1618 r->check_substr = r->float_substr;
1619 r->check_offset_min = data.offset_float_min;
1620 r->check_offset_max = data.offset_float_max;
1622 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1623 This should be changed ASAP! */
1624 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1625 r->reganch |= RE_USE_INTUIT;
1626 if (SvTAIL(r->check_substr))
1627 r->reganch |= RE_INTUIT_TAIL;
1631 /* Several toplevels. Best we can is to set minlen. */
1633 struct regnode_charclass_class ch_class;
1635 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1636 scan = r->program + 1;
1638 data.start_class = &ch_class;
1639 minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, SCF_DO_STCLASS_AND);
1640 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1641 if (!(data.start_class->flags & ANYOF_EOS)
1642 && !cl_is_anything(data.start_class)) {
1644 I32 n = add_data(1, "f");
1646 New(1006, PL_regcomp_rx->data->data[n], 1,
1647 struct regnode_charclass_class);
1648 StructCopy(data.start_class,
1649 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1650 struct regnode_charclass_class);
1651 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1652 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1653 DEBUG_r((sv = sv_newmortal(),
1654 regprop(sv, (regnode*)data.start_class),
1655 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1661 if (PL_regseen & REG_SEEN_GPOS)
1662 r->reganch |= ROPT_GPOS_SEEN;
1663 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1664 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1665 if (PL_regseen & REG_SEEN_EVAL)
1666 r->reganch |= ROPT_EVAL_SEEN;
1667 Newz(1002, r->startp, PL_regnpar, I32);
1668 Newz(1002, r->endp, PL_regnpar, I32);
1669 DEBUG_r(regdump(r));
1674 - reg - regular expression, i.e. main body or parenthesized thing
1676 * Caller must absorb opening parenthesis.
1678 * Combining parenthesis handling with the base level of regular expression
1679 * is a trifle forced, but the need to tie the tails of the branches to what
1680 * follows makes it hard to avoid.
1683 S_reg(pTHX_ I32 paren, I32 *flagp)
1684 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1687 register regnode *ret; /* Will be the head of the group. */
1688 register regnode *br;
1689 register regnode *lastbr;
1690 register regnode *ender = 0;
1691 register I32 parno = 0;
1692 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1695 *flagp = 0; /* Tentatively. */
1697 /* Make an OPEN node, if parenthesized. */
1699 if (*PL_regcomp_parse == '?') {
1700 U16 posflags = 0, negflags = 0;
1701 U16 *flagsp = &posflags;
1705 paren = *PL_regcomp_parse++;
1706 ret = NULL; /* For look-ahead/behind. */
1709 PL_regseen |= REG_SEEN_LOOKBEHIND;
1710 if (*PL_regcomp_parse == '!')
1712 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1723 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1726 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1728 if (*PL_regcomp_parse != ')')
1729 FAIL("Sequence (?#... not terminated");
1735 paren = *PL_regcomp_parse++;
1740 I32 count = 1, n = 0;
1742 char *s = PL_regcomp_parse;
1744 OP_4tree *sop, *rop;
1747 PL_regseen |= REG_SEEN_EVAL;
1748 while (count && (c = *PL_regcomp_parse)) {
1749 if (c == '\\' && PL_regcomp_parse[1])
1757 if (*PL_regcomp_parse != ')')
1758 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1762 if (PL_regcomp_parse - 1 - s)
1763 sv = newSVpvn(s, PL_regcomp_parse - 1 - s);
1765 sv = newSVpvn("", 0);
1767 rop = sv_compile_2op(sv, &sop, "re", &av);
1769 n = add_data(3, "nop");
1770 PL_regcomp_rx->data->data[n] = (void*)rop;
1771 PL_regcomp_rx->data->data[n+1] = (void*)sop;
1772 PL_regcomp_rx->data->data[n+2] = (void*)av;
1775 else { /* First pass */
1776 if (PL_reginterp_cnt < ++PL_seen_evals
1777 && PL_curcop != &PL_compiling)
1778 /* No compiled RE interpolated, has runtime
1779 components ===> unsafe. */
1780 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1782 FAIL("Eval-group in insecure regular expression");
1787 ret = reg_node(LOGICAL);
1790 regtail(ret, reganode(EVAL, n));
1793 return reganode(EVAL, n);
1797 if (PL_regcomp_parse[0] == '?') {
1798 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1799 || PL_regcomp_parse[1] == '<'
1800 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1803 ret = reg_node(LOGICAL);
1806 regtail(ret, reg(1, &flag));
1810 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1811 parno = atoi(PL_regcomp_parse++);
1813 while (isDIGIT(*PL_regcomp_parse))
1815 ret = reganode(GROUPP, parno);
1816 if ((c = *nextchar()) != ')')
1817 FAIL2("Switch (?(number%c not recognized", c);
1819 regtail(ret, reganode(IFTHEN, 0));
1820 br = regbranch(&flags, 1);
1822 br = reganode(LONGJMP, 0);
1824 regtail(br, reganode(LONGJMP, 0));
1829 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1830 regbranch(&flags, 1);
1831 regtail(ret, lastbr);
1839 FAIL("Switch (?(condition)... contains too many branches");
1840 ender = reg_node(TAIL);
1843 regtail(lastbr, ender);
1844 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1847 regtail(ret, ender);
1851 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1855 FAIL("Sequence (? incomplete");
1860 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1861 if (*PL_regcomp_parse != 'o')
1862 pmflag(flagsp, *PL_regcomp_parse);
1865 if (*PL_regcomp_parse == '-') {
1870 PL_regflags |= posflags;
1871 PL_regflags &= ~negflags;
1872 if (*PL_regcomp_parse == ':') {
1878 if (*PL_regcomp_parse != ')')
1879 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1888 ret = reganode(OPEN, parno);
1895 /* Pick up the branches, linking them together. */
1896 br = regbranch(&flags, 1);
1899 if (*PL_regcomp_parse == '|') {
1900 if (!SIZE_ONLY && PL_extralen) {
1901 reginsert(BRANCHJ, br);
1904 reginsert(BRANCH, br);
1907 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1909 else if (paren == ':') {
1910 *flagp |= flags&SIMPLE;
1912 if (open) { /* Starts with OPEN. */
1913 regtail(ret, br); /* OPEN -> first. */
1915 else if (paren != '?') /* Not Conditional */
1919 *flagp |= flags&SPSTART;
1921 while (*PL_regcomp_parse == '|') {
1922 if (!SIZE_ONLY && PL_extralen) {
1923 ender = reganode(LONGJMP,0);
1924 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1927 PL_extralen += 2; /* Account for LONGJMP. */
1929 br = regbranch(&flags, 0);
1932 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1936 *flagp |= flags&SPSTART;
1939 if (have_branch || paren != ':') {
1940 /* Make a closing node, and hook it on the end. */
1943 ender = reg_node(TAIL);
1946 ender = reganode(CLOSE, parno);
1952 *flagp &= ~HASWIDTH;
1955 ender = reg_node(SUCCEED);
1958 ender = reg_node(END);
1961 regtail(lastbr, ender);
1964 /* Hook the tails of the branches to the closing node. */
1965 for (br = ret; br != NULL; br = regnext(br)) {
1966 regoptail(br, ender);
1973 static char parens[] = "=!<,>";
1975 if (paren && (p = strchr(parens, paren))) {
1976 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1977 int flag = (p - parens) > 1;
1980 node = SUSPEND, flag = 0;
1981 reginsert(node,ret);
1983 regtail(ret, reg_node(TAIL));
1987 /* Check for proper termination. */
1989 PL_regflags = oregflags;
1990 if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') {
1991 FAIL("unmatched () in regexp");
1994 else if (!paren && PL_regcomp_parse < PL_regxend) {
1995 if (*PL_regcomp_parse == ')') {
1996 FAIL("unmatched () in regexp");
1999 FAIL("junk on end of regexp"); /* "Can't happen". */
2007 - regbranch - one alternative of an | operator
2009 * Implements the concatenation operator.
2012 S_regbranch(pTHX_ I32 *flagp, I32 first)
2015 register regnode *ret;
2016 register regnode *chain = NULL;
2017 register regnode *latest;
2018 I32 flags = 0, c = 0;
2023 if (!SIZE_ONLY && PL_extralen)
2024 ret = reganode(BRANCHJ,0);
2026 ret = reg_node(BRANCH);
2029 if (!first && SIZE_ONLY)
2030 PL_extralen += 1; /* BRANCHJ */
2032 *flagp = WORST; /* Tentatively. */
2036 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
2038 latest = regpiece(&flags);
2039 if (latest == NULL) {
2040 if (flags & TRYAGAIN)
2044 else if (ret == NULL)
2046 *flagp |= flags&HASWIDTH;
2047 if (chain == NULL) /* First piece. */
2048 *flagp |= flags&SPSTART;
2051 regtail(chain, latest);
2056 if (chain == NULL) { /* Loop ran zero times. */
2057 chain = reg_node(NOTHING);
2062 *flagp |= flags&SIMPLE;
2069 - regpiece - something followed by possible [*+?]
2071 * Note that the branching code sequences used for ? and the general cases
2072 * of * and + are somewhat optimized: they use the same NOTHING node as
2073 * both the endmarker for their branch list and the body of the last branch.
2074 * It might seem that this node could be dispensed with entirely, but the
2075 * endmarker role is not redundant.
2078 S_regpiece(pTHX_ I32 *flagp)
2081 register regnode *ret;
2083 register char *next;
2085 char *origparse = PL_regcomp_parse;
2088 I32 max = REG_INFTY;
2090 ret = regatom(&flags);
2092 if (flags & TRYAGAIN)
2097 op = *PL_regcomp_parse;
2099 if (op == '{' && regcurly(PL_regcomp_parse)) {
2100 next = PL_regcomp_parse + 1;
2102 while (isDIGIT(*next) || *next == ',') {
2111 if (*next == '}') { /* got one */
2115 min = atoi(PL_regcomp_parse);
2119 maxpos = PL_regcomp_parse;
2121 if (!max && *maxpos != '0')
2122 max = REG_INFTY; /* meaning "infinity" */
2123 else if (max >= REG_INFTY)
2124 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2125 PL_regcomp_parse = next;
2129 if ((flags&SIMPLE)) {
2130 PL_regnaughty += 2 + PL_regnaughty / 2;
2131 reginsert(CURLY, ret);
2134 regnode *w = reg_node(WHILEM);
2138 if (!SIZE_ONLY && PL_extralen) {
2139 reginsert(LONGJMP,ret);
2140 reginsert(NOTHING,ret);
2141 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2143 reginsert(CURLYX,ret);
2144 if (!SIZE_ONLY && PL_extralen)
2145 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2146 regtail(ret, reg_node(NOTHING));
2148 PL_reg_whilem_seen++, PL_extralen += 3;
2149 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
2157 if (max && max < min)
2158 FAIL("Can't do {n,m} with n > m");
2173 #if 0 /* Now runtime fix should be reliable. */
2174 if (!(flags&HASWIDTH) && op != '?')
2175 FAIL("regexp *+ operand could be empty");
2180 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2182 if (op == '*' && (flags&SIMPLE)) {
2183 reginsert(STAR, ret);
2187 else if (op == '*') {
2191 else if (op == '+' && (flags&SIMPLE)) {
2192 reginsert(PLUS, ret);
2196 else if (op == '+') {
2200 else if (op == '?') {
2205 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2206 Perl_warner(aTHX_ WARN_UNSAFE, "%.*s matches null string many times",
2207 PL_regcomp_parse - origparse, origparse);
2210 if (*PL_regcomp_parse == '?') {
2212 reginsert(MINMOD, ret);
2213 regtail(ret, ret + NODE_STEP_REGNODE);
2215 if (ISMULT2(PL_regcomp_parse))
2216 FAIL("nested *?+ in regexp");
2222 - regatom - the lowest level
2224 * Optimization: gobbles an entire sequence of ordinary characters so that
2225 * it can turn them into a single node, which is smaller to store and
2226 * faster to run. Backslashed characters are exceptions, each becoming a
2227 * separate node; the code is simpler that way and it's not worth fixing.
2229 * [Yes, it is worth fixing, some scripts can run twice the speed.]
2232 S_regatom(pTHX_ I32 *flagp)
2235 register regnode *ret = 0;
2238 *flagp = WORST; /* Tentatively. */
2241 switch (*PL_regcomp_parse) {
2245 if (PL_regflags & PMf_MULTILINE)
2246 ret = reg_node(MBOL);
2247 else if (PL_regflags & PMf_SINGLELINE)
2248 ret = reg_node(SBOL);
2250 ret = reg_node(BOL);
2253 if (PL_regcomp_parse[1])
2256 if (PL_regflags & PMf_MULTILINE)
2257 ret = reg_node(MEOL);
2258 else if (PL_regflags & PMf_SINGLELINE)
2259 ret = reg_node(SEOL);
2261 ret = reg_node(EOL);
2266 if (PL_regflags & PMf_SINGLELINE)
2267 ret = reg_node(SANYUTF8);
2269 ret = reg_node(ANYUTF8);
2273 if (PL_regflags & PMf_SINGLELINE)
2274 ret = reg_node(SANY);
2276 ret = reg_node(REG_ANY);
2277 *flagp |= HASWIDTH|SIMPLE;
2283 ret = (UTF ? regclassutf8() : regclass());
2284 if (*PL_regcomp_parse != ']')
2285 FAIL("unmatched [] in regexp");
2287 *flagp |= HASWIDTH|SIMPLE;
2291 ret = reg(1, &flags);
2293 if (flags & TRYAGAIN)
2297 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2301 if (flags & TRYAGAIN) {
2305 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
2306 /* Supposed to be caught earlier. */
2309 if (!regcurly(PL_regcomp_parse)) {
2317 FAIL("?+*{} follows nothing in regexp");
2320 switch (*++PL_regcomp_parse) {
2323 ret = reg_node(SBOL);
2328 ret = reg_node(GPOS);
2329 PL_regseen |= REG_SEEN_GPOS;
2334 ret = reg_node(SEOL);
2339 ret = reg_node(EOS);
2341 PL_seen_zerolen++; /* Do not optimize RE away */
2345 ret = reg_node(SANY);
2346 *flagp |= HASWIDTH|SIMPLE;
2350 ret = reg_node(CLUMP);
2353 if (UTF && !PL_utf8_mark)
2354 is_utf8_mark((U8*)"~"); /* preload table */
2359 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
2360 : (LOC ? ALNUML : ALNUM));
2361 *flagp |= HASWIDTH|SIMPLE;
2363 if (UTF && !PL_utf8_alnum)
2364 is_utf8_alnum((U8*)"a"); /* preload table */
2369 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
2370 : (LOC ? NALNUML : NALNUM));
2371 *flagp |= HASWIDTH|SIMPLE;
2373 if (UTF && !PL_utf8_alnum)
2374 is_utf8_alnum((U8*)"a"); /* preload table */
2378 PL_regseen |= REG_SEEN_LOOKBEHIND;
2381 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
2382 : (LOC ? BOUNDL : BOUND));
2385 if (UTF && !PL_utf8_alnum)
2386 is_utf8_alnum((U8*)"a"); /* preload table */
2390 PL_regseen |= REG_SEEN_LOOKBEHIND;
2393 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
2394 : (LOC ? NBOUNDL : NBOUND));
2397 if (UTF && !PL_utf8_alnum)
2398 is_utf8_alnum((U8*)"a"); /* preload table */
2403 ? (LOC ? SPACELUTF8 : SPACEUTF8)
2404 : (LOC ? SPACEL : SPACE));
2405 *flagp |= HASWIDTH|SIMPLE;
2407 if (UTF && !PL_utf8_space)
2408 is_utf8_space((U8*)" "); /* preload table */
2413 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
2414 : (LOC ? NSPACEL : NSPACE));
2415 *flagp |= HASWIDTH|SIMPLE;
2417 if (UTF && !PL_utf8_space)
2418 is_utf8_space((U8*)" "); /* preload table */
2421 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
2422 *flagp |= HASWIDTH|SIMPLE;
2424 if (UTF && !PL_utf8_digit)
2425 is_utf8_digit((U8*)"1"); /* preload table */
2428 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
2429 *flagp |= HASWIDTH|SIMPLE;
2431 if (UTF && !PL_utf8_digit)
2432 is_utf8_digit((U8*)"1"); /* preload table */
2436 { /* a lovely hack--pretend we saw [\pX] instead */
2437 char* oldregxend = PL_regxend;
2439 if (PL_regcomp_parse[1] == '{') {
2440 PL_regxend = strchr(PL_regcomp_parse, '}');
2442 FAIL("Missing right brace on \\p{}");
2446 PL_regxend = PL_regcomp_parse + 2;
2449 ret = regclassutf8();
2451 PL_regxend = oldregxend;
2454 *flagp |= HASWIDTH|SIMPLE;
2467 case '1': case '2': case '3': case '4':
2468 case '5': case '6': case '7': case '8': case '9':
2470 I32 num = atoi(PL_regcomp_parse);
2472 if (num > 9 && num >= PL_regnpar)
2475 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
2476 FAIL("reference to nonexistent group");
2479 ? (LOC ? REFFL : REFF)
2482 while (isDIGIT(*PL_regcomp_parse))
2490 if (PL_regcomp_parse >= PL_regxend)
2491 FAIL("trailing \\ in regexp");
2494 /* Do not generate `unrecognized' warnings here, we fall
2495 back into the quick-grab loop below */
2501 if (PL_regflags & PMf_EXTENDED) {
2502 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
2503 if (PL_regcomp_parse < PL_regxend)
2519 ? (LOC ? EXACTFL : EXACTF)
2522 for (len = 0, p = PL_regcomp_parse - 1;
2523 len < 127 && p < PL_regxend;
2528 if (PL_regflags & PMf_EXTENDED)
2529 p = regwhite(p, PL_regxend);
2591 char* e = strchr(p, '}');
2594 FAIL("Missing right brace on \\x{}");
2596 ender = (UV)scan_hex(p + 1, e - p, &numlen);
2597 if (numlen + len >= 127) { /* numlen is generous */
2604 FAIL("Can't use \\x{} without 'use utf8' declaration");
2607 ender = (UV)scan_hex(p, 2, &numlen);
2613 ender = UCHARAT(p++);
2614 ender = toCTRL(ender);
2616 case '0': case '1': case '2': case '3':case '4':
2617 case '5': case '6': case '7': case '8':case '9':
2619 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2620 ender = (UV)scan_oct(p, 3, &numlen);
2629 if (p >= PL_regxend)
2630 FAIL("trailing \\ in regexp");
2633 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(*p))
2634 Perl_warner(aTHX_ WARN_UNSAFE,
2635 "/%.127s/: Unrecognized escape \\%c passed through",
2638 goto normal_default;
2643 if ((*p & 0xc0) == 0xc0 && UTF) {
2644 ender = utf8_to_uv((U8*)p, &numlen);
2651 if (PL_regflags & PMf_EXTENDED)
2652 p = regwhite(p, PL_regxend);
2655 ender = toLOWER_LC_uni(ender);
2657 ender = toLOWER_uni(ender);
2659 if (ISMULT2(p)) { /* Back off on ?+*. */
2662 else if (ender >= 0x80 && UTF) {
2663 reguni(ender, s, &numlen);
2673 if (ender >= 0x80 && UTF) {
2674 reguni(ender, s, &numlen);
2682 PL_regcomp_parse = p - 1;
2685 FAIL("internal disaster in regexp");
2693 PL_regsize += STR_SZ(len);
2695 PL_regcode += STR_SZ(len);
2704 S_regwhite(pTHX_ char *p, char *e)
2709 else if (*p == '#') {
2712 } while (p < e && *p != '\n');
2720 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
2721 Character classes ([:foo:]) can also be negated ([:^foo:]).
2722 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
2723 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
2724 but trigger warnings because they are currently unimplemented. */
2726 S_regpposixcc(pTHX_ I32 value)
2730 I32 namedclass = OOB_NAMEDCLASS;
2732 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2733 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2734 (*PL_regcomp_parse == ':' ||
2735 *PL_regcomp_parse == '=' ||
2736 *PL_regcomp_parse == '.')) {
2737 char c = *PL_regcomp_parse;
2738 char* s = PL_regcomp_parse++;
2740 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2742 if (PL_regcomp_parse == PL_regxend)
2743 /* Grandfather lone [:, [=, [. */
2744 PL_regcomp_parse = s;
2746 char* t = PL_regcomp_parse++; /* skip over the c */
2748 if (*PL_regcomp_parse == ']') {
2749 PL_regcomp_parse++; /* skip over the ending ] */
2752 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
2753 I32 skip = 5; /* the most common skip */
2757 if (strnEQ(posixcc, "alnum", 5))
2759 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
2760 else if (strnEQ(posixcc, "alpha", 5))
2762 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
2763 else if (strnEQ(posixcc, "ascii", 5))
2765 complement ? ANYOF_NASCII : ANYOF_ASCII;
2768 if (strnEQ(posixcc, "cntrl", 5))
2770 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
2773 if (strnEQ(posixcc, "digit", 5))
2775 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
2778 if (strnEQ(posixcc, "graph", 5))
2780 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
2783 if (strnEQ(posixcc, "lower", 5))
2785 complement ? ANYOF_NLOWER : ANYOF_LOWER;
2788 if (strnEQ(posixcc, "print", 5))
2790 complement ? ANYOF_NPRINT : ANYOF_PRINT;
2791 else if (strnEQ(posixcc, "punct", 5))
2793 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
2796 if (strnEQ(posixcc, "space", 5))
2798 complement ? ANYOF_NSPACE : ANYOF_SPACE;
2800 if (strnEQ(posixcc, "upper", 5))
2802 complement ? ANYOF_NUPPER : ANYOF_UPPER;
2804 case 'w': /* this is not POSIX, this is the Perl \w */
2805 if (strnEQ(posixcc, "word", 4)) {
2807 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
2812 if (strnEQ(posixcc, "xdigit", 6)) {
2814 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
2819 if ((namedclass == OOB_NAMEDCLASS ||
2820 !(posixcc + skip + 2 < PL_regxend &&
2821 (posixcc[skip] == ':' &&
2822 posixcc[skip + 1] == ']'))))
2823 Perl_croak(aTHX_ "Character class [:%.*s:] unknown",
2825 } else if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2826 /* [[=foo=]] and [[.foo.]] are still future. */
2827 Perl_warner(aTHX_ WARN_UNSAFE,
2828 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2830 /* Maternal grandfather:
2831 * "[:" ending in ":" but not in ":]" */
2832 PL_regcomp_parse = s;
2841 S_checkposixcc(pTHX)
2843 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) &&
2844 (*PL_regcomp_parse == ':' ||
2845 *PL_regcomp_parse == '=' ||
2846 *PL_regcomp_parse == '.')) {
2847 char *s = PL_regcomp_parse;
2850 while(*s && isALNUM(*s))
2852 if (*s && c == *s && s[1] == ']') {
2853 Perl_warner(aTHX_ WARN_UNSAFE,
2854 "Character class syntax [%c %c] belongs inside character classes", c, c);
2855 if (c == '=' || c == '.')
2856 Perl_warner(aTHX_ WARN_UNSAFE,
2857 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2867 register I32 lastvalue = OOB_CHAR8;
2868 register I32 range = 0;
2869 register regnode *ret;
2874 bool need_class = 0;
2876 ret = reg_node(ANYOF);
2878 PL_regsize += ANYOF_SKIP;
2881 ANYOF_BITMAP_ZERO(ret);
2882 PL_regcode += ANYOF_SKIP;
2884 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
2886 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
2888 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2892 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
2895 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE))
2898 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2899 goto skipcond; /* allow 1st char to be ] or - */
2900 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2902 namedclass = OOB_NAMEDCLASS;
2904 rangebegin = PL_regcomp_parse;
2905 value = UCHARAT(PL_regcomp_parse++);
2907 namedclass = regpposixcc(value);
2908 else if (value == '\\') {
2909 value = UCHARAT(PL_regcomp_parse++);
2911 case 'w': namedclass = ANYOF_ALNUM; break;
2912 case 'W': namedclass = ANYOF_NALNUM; break;
2913 case 's': namedclass = ANYOF_SPACE; break;
2914 case 'S': namedclass = ANYOF_NSPACE; break;
2915 case 'd': namedclass = ANYOF_DIGIT; break;
2916 case 'D': namedclass = ANYOF_NDIGIT; break;
2917 case 'n': value = '\n'; break;
2918 case 'r': value = '\r'; break;
2919 case 't': value = '\t'; break;
2920 case 'f': value = '\f'; break;
2921 case 'b': value = '\b'; break;
2923 case 'e': value = '\033'; break;
2924 case 'a': value = '\007'; break;
2926 case 'e': value = '\047'; break;
2927 case 'a': value = '\057'; break;
2930 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
2931 PL_regcomp_parse += numlen;
2934 value = UCHARAT(PL_regcomp_parse++);
2935 value = toCTRL(value);
2937 case '0': case '1': case '2': case '3': case '4':
2938 case '5': case '6': case '7': case '8': case '9':
2939 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
2940 PL_regcomp_parse += numlen;
2943 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(value))
2944 Perl_warner(aTHX_ WARN_UNSAFE,
2945 "/%.127s/: Unrecognized escape \\%c in character class passed through",
2951 if (namedclass > OOB_NAMEDCLASS) {
2952 if (!need_class && !SIZE_ONLY)
2953 ANYOF_CLASS_ZERO(ret);
2955 if (range) { /* a-\d, a-[:digit:] */
2957 if (ckWARN(WARN_UNSAFE))
2958 Perl_warner(aTHX_ WARN_UNSAFE,
2959 "/%.127s/: false [] range \"%*.*s\" in regexp",
2961 PL_regcomp_parse - rangebegin,
2962 PL_regcomp_parse - rangebegin,
2964 ANYOF_BITMAP_SET(ret, lastvalue);
2965 ANYOF_BITMAP_SET(ret, '-');
2967 range = 0; /* this is not a true range */
2970 switch (namedclass) {
2973 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
2975 for (value = 0; value < 256; value++)
2977 ANYOF_BITMAP_SET(ret, value);
2982 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
2984 for (value = 0; value < 256; value++)
2985 if (!isALNUM(value))
2986 ANYOF_BITMAP_SET(ret, value);
2991 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
2993 for (value = 0; value < 256; value++)
2995 ANYOF_BITMAP_SET(ret, value);
3000 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3002 for (value = 0; value < 256; value++)
3003 if (!isSPACE(value))
3004 ANYOF_BITMAP_SET(ret, value);
3009 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3011 for (value = '0'; value <= '9'; value++)
3012 ANYOF_BITMAP_SET(ret, value);
3017 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3019 for (value = 0; value < '0'; value++)
3020 ANYOF_BITMAP_SET(ret, value);
3021 for (value = '9' + 1; value < 256; value++)
3022 ANYOF_BITMAP_SET(ret, value);
3027 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3029 for (value = 0; value < 256; value++)
3030 if (!isALNUMC(value))
3031 ANYOF_BITMAP_SET(ret, value);
3036 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3038 for (value = 0; value < 256; value++)
3039 if (isALNUMC(value))
3040 ANYOF_BITMAP_SET(ret, value);
3045 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3047 for (value = 0; value < 256; value++)
3049 ANYOF_BITMAP_SET(ret, value);
3054 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3056 for (value = 0; value < 256; value++)
3057 if (!isALPHA(value))
3058 ANYOF_BITMAP_SET(ret, value);
3063 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3066 for (value = 0; value < 128; value++)
3067 ANYOF_BITMAP_SET(ret, value);
3069 for (value = 0; value < 256; value++)
3071 ANYOF_BITMAP_SET(ret, value);
3077 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3080 for (value = 128; value < 256; value++)
3081 ANYOF_BITMAP_SET(ret, value);
3083 for (value = 0; value < 256; value++)
3084 if (!isASCII(value))
3085 ANYOF_BITMAP_SET(ret, value);
3091 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3093 for (value = 0; value < 256; value++)
3095 ANYOF_BITMAP_SET(ret, value);
3097 lastvalue = OOB_CHAR8;
3101 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3103 for (value = 0; value < 256; value++)
3104 if (!isCNTRL(value))
3105 ANYOF_BITMAP_SET(ret, value);
3110 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3112 for (value = 0; value < 256; value++)
3114 ANYOF_BITMAP_SET(ret, value);
3119 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3121 for (value = 0; value < 256; value++)
3122 if (!isGRAPH(value))
3123 ANYOF_BITMAP_SET(ret, value);
3128 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3130 for (value = 0; value < 256; value++)
3132 ANYOF_BITMAP_SET(ret, value);
3137 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3139 for (value = 0; value < 256; value++)
3140 if (!isLOWER(value))
3141 ANYOF_BITMAP_SET(ret, value);
3146 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3148 for (value = 0; value < 256; value++)
3150 ANYOF_BITMAP_SET(ret, value);
3155 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3157 for (value = 0; value < 256; value++)
3158 if (!isPRINT(value))
3159 ANYOF_BITMAP_SET(ret, value);
3164 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3166 for (value = 0; value < 256; value++)
3168 ANYOF_BITMAP_SET(ret, value);
3173 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3175 for (value = 0; value < 256; value++)
3176 if (!isPUNCT(value))
3177 ANYOF_BITMAP_SET(ret, value);
3182 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3184 for (value = 0; value < 256; value++)
3186 ANYOF_BITMAP_SET(ret, value);
3191 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3193 for (value = 0; value < 256; value++)
3194 if (!isUPPER(value))
3195 ANYOF_BITMAP_SET(ret, value);
3200 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3202 for (value = 0; value < 256; value++)
3203 if (isXDIGIT(value))
3204 ANYOF_BITMAP_SET(ret, value);
3209 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3211 for (value = 0; value < 256; value++)
3212 if (!isXDIGIT(value))
3213 ANYOF_BITMAP_SET(ret, value);
3217 FAIL("invalid [::] class in regexp");
3221 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3226 if (lastvalue > value) /* b-a */ {
3228 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3230 PL_regcomp_parse - rangebegin,
3231 PL_regcomp_parse - rangebegin,
3238 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3239 PL_regcomp_parse[1] != ']') {
3241 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3242 if (ckWARN(WARN_UNSAFE))
3243 Perl_warner(aTHX_ WARN_UNSAFE,
3244 "/%.127s/: false [] range \"%*.*s\" in regexp",
3246 PL_regcomp_parse - rangebegin,
3247 PL_regcomp_parse - rangebegin,
3250 ANYOF_BITMAP_SET(ret, '-');
3253 continue; /* do it next time */
3256 /* now is the next time */
3258 #ifndef ASCIIish /* EBCDIC, for example. */
3259 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3260 (isUPPER(lastvalue) && isUPPER(value)))
3263 if (isLOWER(lastvalue)) {
3264 for (i = lastvalue; i <= value; i++)
3266 ANYOF_BITMAP_SET(ret, i);
3268 for (i = lastvalue; i <= value; i++)
3270 ANYOF_BITMAP_SET(ret, i);
3275 for ( ; lastvalue <= value; lastvalue++)
3276 ANYOF_BITMAP_SET(ret, lastvalue);
3282 PL_regsize += ANYOF_CLASS_ADD_SKIP;
3284 PL_regcode += ANYOF_CLASS_ADD_SKIP;
3286 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3288 (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
3289 for (value = 0; value < 256; ++value) {
3290 if (ANYOF_BITMAP_TEST(ret, value)) {
3291 I32 cf = PL_fold[value];
3292 ANYOF_BITMAP_SET(ret, cf);
3295 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3297 /* optimize inverted simple patterns (e.g. [^a-z]) */
3298 if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3299 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3300 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3301 ANYOF_FLAGS(ret) = 0;
3307 S_regclassutf8(pTHX)
3312 register U32 lastvalue = OOB_UTF8;
3313 register I32 range = 0;
3314 register regnode *ret;
3322 if (*PL_regcomp_parse == '^') { /* Complement of range. */
3326 flags |= ANYOF_INVERT;
3330 flags |= ANYOF_FOLD;
3332 flags |= ANYOF_LOCALE;
3333 listsv = newSVpvn("# comment\n",10);
3336 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE))
3339 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
3340 goto skipcond; /* allow 1st char to be ] or - */
3342 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
3344 namedclass = OOB_NAMEDCLASS;
3346 rangebegin = PL_regcomp_parse;
3347 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3348 PL_regcomp_parse += numlen;
3350 namedclass = regpposixcc(value);
3351 else if (value == '\\') {
3352 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3353 PL_regcomp_parse += numlen;
3355 case 'w': namedclass = ANYOF_ALNUM; break;
3356 case 'W': namedclass = ANYOF_NALNUM; break;
3357 case 's': namedclass = ANYOF_SPACE; break;
3358 case 'S': namedclass = ANYOF_NSPACE; break;
3359 case 'd': namedclass = ANYOF_DIGIT; break;
3360 case 'D': namedclass = ANYOF_NDIGIT; break;
3363 if (*PL_regcomp_parse == '{') {
3364 e = strchr(PL_regcomp_parse++, '}');
3366 FAIL("Missing right brace on \\p{}");
3367 n = e - PL_regcomp_parse;
3370 e = PL_regcomp_parse;
3375 Perl_sv_catpvf(aTHX_ listsv,
3376 "+utf8::%.*s\n", (int)n, PL_regcomp_parse);
3378 Perl_sv_catpvf(aTHX_ listsv,
3379 "!utf8::%.*s\n", (int)n, PL_regcomp_parse);
3381 PL_regcomp_parse = e + 1;
3382 lastvalue = OOB_UTF8;
3384 case 'n': value = '\n'; break;
3385 case 'r': value = '\r'; break;
3386 case 't': value = '\t'; break;
3387 case 'f': value = '\f'; break;
3388 case 'b': value = '\b'; break;
3390 case 'e': value = '\033'; break;
3391 case 'a': value = '\007'; break;
3393 case 'e': value = '\047'; break;
3394 case 'a': value = '\057'; break;
3397 if (*PL_regcomp_parse == '{') {
3398 e = strchr(PL_regcomp_parse++, '}');
3400 FAIL("Missing right brace on \\x{}");
3401 value = (UV)scan_hex(PL_regcomp_parse,
3402 e - PL_regcomp_parse,
3404 PL_regcomp_parse = e + 1;
3407 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
3408 PL_regcomp_parse += numlen;
3412 value = UCHARAT(PL_regcomp_parse++);
3413 value = toCTRL(value);
3415 case '0': case '1': case '2': case '3': case '4':
3416 case '5': case '6': case '7': case '8': case '9':
3417 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
3418 PL_regcomp_parse += numlen;
3421 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(value))
3422 Perl_warner(aTHX_ WARN_UNSAFE,
3423 "/%.127s/: Unrecognized escape \\%c in character class passed through",
3429 if (namedclass > OOB_NAMEDCLASS) {
3430 if (range) { /* a-\d, a-[:digit:] */
3432 if (ckWARN(WARN_UNSAFE))
3433 Perl_warner(aTHX_ WARN_UNSAFE,
3434 "/%.127s/: false [] range \"%*.*s\" in regexp",
3436 PL_regcomp_parse - rangebegin,
3437 PL_regcomp_parse - rangebegin,
3439 Perl_sv_catpvf(aTHX_ listsv,
3440 /* 0x002D is Unicode for '-' */
3441 "%04"UVxf"\n002D\n", (UV)lastvalue);
3446 switch (namedclass) {
3448 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
3450 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
3452 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
3454 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
3456 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
3458 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
3460 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
3462 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
3464 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
3466 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
3468 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
3470 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
3472 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
3474 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
3476 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
3478 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
3480 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
3482 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
3484 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
3486 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
3488 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
3490 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
3492 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
3494 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
3496 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
3498 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
3504 if (lastvalue > value) { /* b-a */
3506 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3508 PL_regcomp_parse - rangebegin,
3509 PL_regcomp_parse - rangebegin,
3516 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3517 PL_regcomp_parse[1] != ']') {
3519 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3520 if (ckWARN(WARN_UNSAFE))
3521 Perl_warner(aTHX_ WARN_UNSAFE,
3522 "/%.127s/: false [] range \"%*.*s\" in regexp",
3524 PL_regcomp_parse - rangebegin,
3525 PL_regcomp_parse - rangebegin,
3528 Perl_sv_catpvf(aTHX_ listsv,
3529 /* 0x002D is Unicode for '-' */
3533 continue; /* do it next time */
3536 /* now is the next time */
3538 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3539 (UV)lastvalue, (UV)value);
3543 ret = reganode(ANYOFUTF8, 0);
3546 SV *rv = swash_init("utf8", "", listsv, 1, 0);
3547 SvREFCNT_dec(listsv);
3548 n = add_data(1,"s");
3549 PL_regcomp_rx->data->data[n] = (void*)rv;
3550 ARG1_SET(ret, flags);
3561 char* retval = PL_regcomp_parse++;
3564 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
3565 PL_regcomp_parse[2] == '#') {
3566 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
3571 if (PL_regflags & PMf_EXTENDED) {
3572 if (isSPACE(*PL_regcomp_parse)) {
3576 else if (*PL_regcomp_parse == '#') {
3577 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
3588 - reg_node - emit a node
3590 STATIC regnode * /* Location. */
3591 S_reg_node(pTHX_ U8 op)
3594 register regnode *ret;
3595 register regnode *ptr;
3599 SIZE_ALIGN(PL_regsize);
3604 NODE_ALIGN_FILL(ret);
3606 FILL_ADVANCE_NODE(ptr, op);
3613 - reganode - emit a node with an argument
3615 STATIC regnode * /* Location. */
3616 S_reganode(pTHX_ U8 op, U32 arg)
3619 register regnode *ret;
3620 register regnode *ptr;
3624 SIZE_ALIGN(PL_regsize);
3629 NODE_ALIGN_FILL(ret);
3631 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3638 - reguni - emit (if appropriate) a Unicode character
3641 S_reguni(pTHX_ UV uv, char* s, I32* lenp)
3646 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
3649 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
3654 - reginsert - insert an operator in front of already-emitted operand
3656 * Means relocating the operand.
3659 S_reginsert(pTHX_ U8 op, regnode *opnd)
3662 register regnode *src;
3663 register regnode *dst;
3664 register regnode *place;
3665 register int offset = regarglen[(U8)op];
3667 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3670 PL_regsize += NODE_STEP_REGNODE + offset;
3675 PL_regcode += NODE_STEP_REGNODE + offset;
3678 StructCopy(--src, --dst, regnode);
3680 place = opnd; /* Op node, where operand used to be. */
3681 src = NEXTOPER(place);
3682 FILL_ADVANCE_NODE(place, op);
3683 Zero(src, offset, regnode);
3687 - regtail - set the next-pointer at the end of a node chain of p to val.
3690 S_regtail(pTHX_ regnode *p, regnode *val)
3693 register regnode *scan;
3694 register regnode *temp;
3695 register I32 offset;
3700 /* Find last node. */
3703 temp = regnext(scan);
3709 if (reg_off_by_arg[OP(scan)]) {
3710 ARG_SET(scan, val - scan);
3713 NEXT_OFF(scan) = val - scan;
3718 - regoptail - regtail on operand of first argument; nop if operandless
3721 S_regoptail(pTHX_ regnode *p, regnode *val)
3724 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3725 if (p == NULL || SIZE_ONLY)
3727 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3728 regtail(NEXTOPER(p), val);
3730 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3731 regtail(NEXTOPER(NEXTOPER(p)), val);
3738 - regcurly - a little FSA that accepts {\d+,?\d*}
3741 S_regcurly(pTHX_ register char *s)
3760 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
3763 register U8 op = EXACT; /* Arbitrary non-END op. */
3764 register regnode *next, *onode;
3766 while (op != END && (!last || node < last)) {
3767 /* While that wasn't END last time... */
3773 next = regnext(node);
3775 if (OP(node) == OPTIMIZED)
3778 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
3779 (int)(2*l + 1), "", SvPVX(sv));
3780 if (next == NULL) /* Next ptr. */
3781 PerlIO_printf(Perl_debug_log, "(0)");
3783 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
3784 (void)PerlIO_putc(Perl_debug_log, '\n');
3786 if (PL_regkind[(U8)op] == BRANCHJ) {
3787 register regnode *nnode = (OP(next) == LONGJMP
3790 if (last && nnode > last)
3792 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
3794 else if (PL_regkind[(U8)op] == BRANCH) {
3795 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
3797 else if ( op == CURLY) { /* `next' might be very big: optimizer */
3798 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3799 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
3801 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
3802 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3805 else if ( op == PLUS || op == STAR) {
3806 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
3808 else if (op == ANYOF) {
3809 node = NEXTOPER(node);
3812 else if (PL_regkind[(U8)op] == EXACT) {
3813 /* Literal string, where present. */
3814 node += NODE_SZ_STR(node) - 1;
3815 node = NEXTOPER(node);
3818 node = NEXTOPER(node);
3819 node += regarglen[(U8)op];
3821 if (op == CURLYX || op == OPEN)
3823 else if (op == WHILEM)
3826 #endif /* DEBUGGING */
3831 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
3834 Perl_regdump(pTHX_ regexp *r)
3838 SV *sv = sv_newmortal();
3840 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
3842 /* Header fields of interest. */
3843 if (r->anchored_substr)
3844 PerlIO_printf(Perl_debug_log,
3845 "anchored `%s%.*s%s'%s at %"IVdf" ",
3847 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
3848 SvPVX(r->anchored_substr),
3850 SvTAIL(r->anchored_substr) ? "$" : "",
3851 (IV)r->anchored_offset);
3852 if (r->float_substr)
3853 PerlIO_printf(Perl_debug_log,
3854 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
3856 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
3857 SvPVX(r->float_substr),
3859 SvTAIL(r->float_substr) ? "$" : "",
3860 (IV)r->float_min_offset, (UV)r->float_max_offset);
3861 if (r->check_substr)
3862 PerlIO_printf(Perl_debug_log,
3863 r->check_substr == r->float_substr
3864 ? "(checking floating" : "(checking anchored");
3865 if (r->reganch & ROPT_NOSCAN)
3866 PerlIO_printf(Perl_debug_log, " noscan");
3867 if (r->reganch & ROPT_CHECK_ALL)
3868 PerlIO_printf(Perl_debug_log, " isall");
3869 if (r->check_substr)
3870 PerlIO_printf(Perl_debug_log, ") ");
3872 if (r->regstclass) {
3873 regprop(sv, r->regstclass);
3874 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
3876 if (r->reganch & ROPT_ANCH) {
3877 PerlIO_printf(Perl_debug_log, "anchored");
3878 if (r->reganch & ROPT_ANCH_BOL)
3879 PerlIO_printf(Perl_debug_log, "(BOL)");
3880 if (r->reganch & ROPT_ANCH_MBOL)
3881 PerlIO_printf(Perl_debug_log, "(MBOL)");
3882 if (r->reganch & ROPT_ANCH_SBOL)
3883 PerlIO_printf(Perl_debug_log, "(SBOL)");
3884 if (r->reganch & ROPT_ANCH_GPOS)
3885 PerlIO_printf(Perl_debug_log, "(GPOS)");
3886 PerlIO_putc(Perl_debug_log, ' ');
3888 if (r->reganch & ROPT_GPOS_SEEN)
3889 PerlIO_printf(Perl_debug_log, "GPOS ");
3890 if (r->reganch & ROPT_SKIP)
3891 PerlIO_printf(Perl_debug_log, "plus ");
3892 if (r->reganch & ROPT_IMPLICIT)
3893 PerlIO_printf(Perl_debug_log, "implicit ");
3894 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
3895 if (r->reganch & ROPT_EVAL_SEEN)
3896 PerlIO_printf(Perl_debug_log, "with eval ");
3897 PerlIO_printf(Perl_debug_log, "\n");
3898 #endif /* DEBUGGING */
3902 S_put_byte(pTHX_ SV *sv, int c)
3904 if (c <= ' ' || c == 127 || c == 255)
3905 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
3906 else if (c == '-' || c == ']' || c == '\\' || c == '^')
3907 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
3909 Perl_sv_catpvf(aTHX_ sv, "%c", c);
3913 - regprop - printable representation of opcode
3916 Perl_regprop(pTHX_ SV *sv, regnode *o)
3922 sv_setpvn(sv, "", 0);
3923 if (OP(o) >= reg_num) /* regnode.type is unsigned */
3924 FAIL("corrupted regexp opcode");
3925 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
3927 k = PL_regkind[(U8)OP(o)];
3930 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
3931 STR_LEN(o), STRING(o), PL_colors[1]);
3932 else if (k == CURLY) {
3933 if (OP(o) == CURLYM || OP(o) == CURLYN)
3934 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
3935 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
3937 else if (k == WHILEM && o->flags) /* Ordinal/of */
3938 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
3939 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
3940 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
3941 else if (k == LOGICAL)
3942 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
3943 else if (k == ANYOF) {
3944 int i, rangestart = -1;
3945 const char * const out[] = { /* Should be syncronized with
3946 a table in regcomp.h */
3975 if (o->flags & ANYOF_LOCALE)
3976 sv_catpv(sv, "{loc}");
3977 if (o->flags & ANYOF_FOLD)
3978 sv_catpv(sv, "{i}");
3979 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
3980 if (o->flags & ANYOF_INVERT)
3982 for (i = 0; i <= 256; i++) {
3983 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
3984 if (rangestart == -1)
3986 } else if (rangestart != -1) {
3987 if (i <= rangestart + 3)
3988 for (; rangestart < i; rangestart++)
3989 put_byte(sv, rangestart);
3991 put_byte(sv, rangestart);
3993 put_byte(sv, i - 1);
3998 if (o->flags & ANYOF_CLASS)
3999 for (i = 0; i < sizeof(out)/sizeof(char*); i++)
4000 if (ANYOF_CLASS_TEST(o,i))
4001 sv_catpv(sv, out[i]);
4002 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4004 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4005 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4006 #endif /* DEBUGGING */
4010 Perl_re_intuit_string(pTHX_ regexp *prog)
4011 { /* Assume that RE_INTUIT is set */
4014 char *s = SvPV(prog->check_substr,n_a);
4016 if (!PL_colorset) reginitcolors();
4017 PerlIO_printf(Perl_debug_log,
4018 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4019 PL_colors[4],PL_colors[5],PL_colors[0],
4022 (strlen(s) > 60 ? "..." : ""));
4025 return prog->check_substr;
4029 Perl_pregfree(pTHX_ struct regexp *r)
4032 DEBUG_r(if (!PL_colorset) reginitcolors());
4034 if (!r || (--r->refcnt > 0))
4036 DEBUG_r(PerlIO_printf(Perl_debug_log,
4037 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4038 PL_colors[4],PL_colors[5],PL_colors[0],
4041 (strlen(r->precomp) > 60 ? "..." : "")));
4044 Safefree(r->precomp);
4045 if (RX_MATCH_COPIED(r))
4046 Safefree(r->subbeg);
4048 if (r->anchored_substr)
4049 SvREFCNT_dec(r->anchored_substr);
4050 if (r->float_substr)
4051 SvREFCNT_dec(r->float_substr);
4052 Safefree(r->substrs);
4055 int n = r->data->count;
4056 AV* new_comppad = NULL;
4061 switch (r->data->what[n]) {
4063 SvREFCNT_dec((SV*)r->data->data[n]);
4066 Safefree(r->data->data[n]);
4069 new_comppad = (AV*)r->data->data[n];
4072 if (new_comppad == NULL)
4073 Perl_croak(aTHX_ "panic: pregfree comppad");
4074 old_comppad = PL_comppad;
4075 old_curpad = PL_curpad;
4076 PL_comppad = new_comppad;
4077 PL_curpad = AvARRAY(new_comppad);
4078 op_free((OP_4tree*)r->data->data[n]);
4079 PL_comppad = old_comppad;
4080 PL_curpad = old_curpad;
4081 SvREFCNT_dec((SV*)new_comppad);
4087 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
4090 Safefree(r->data->what);
4093 Safefree(r->startp);
4099 - regnext - dig the "next" pointer out of a node
4101 * [Note, when REGALIGN is defined there are two places in regmatch()
4102 * that bypass this code for speed.]
4105 Perl_regnext(pTHX_ register regnode *p)
4108 register I32 offset;
4110 if (p == &PL_regdummy)
4113 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4121 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4124 STRLEN l1 = strlen(pat1);
4125 STRLEN l2 = strlen(pat2);
4134 Copy(pat1, buf, l1 , char);
4135 Copy(pat2, buf + l1, l2 , char);
4136 buf[l1 + l2] = '\n';
4137 buf[l1 + l2 + 1] = '\0';
4139 /* ANSI variant takes additional second argument */
4140 va_start(args, pat2);
4144 msv = vmess(buf, &args);
4146 message = SvPV(msv,l1);
4149 Copy(message, buf, l1 , char);
4150 buf[l1] = '\0'; /* Overwrite \n */
4151 Perl_croak(aTHX_ "%s", buf);
4154 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4157 Perl_save_re_context(pTHX)
4161 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
4162 SAVEI32(PL_regnpar); /* () count. */
4163 SAVEI32(PL_regsize); /* Code size. */
4164 SAVEI16(PL_regflags); /* are we folding, multilining? */
4165 SAVEPPTR(PL_reginput); /* String-input pointer. */
4166 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4167 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4168 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4169 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4170 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4171 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4172 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4173 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4174 PL_reg_start_tmp = 0;
4175 SAVEFREEPV(PL_reg_start_tmp);
4176 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4177 PL_reg_start_tmpl = 0;
4178 SAVEVPTR(PL_regdata);
4179 SAVEI32(PL_reg_flags); /* from regexec.c */
4180 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4181 SAVEI32(PL_regnarrate); /* from regexec.c */
4182 SAVEVPTR(PL_regprogram); /* from regexec.c */
4183 SAVEINT(PL_regindent); /* from regexec.c */
4184 SAVEVPTR(PL_regcc); /* from regexec.c */
4185 SAVEVPTR(PL_curcop);
4186 SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */
4187 SAVEI32(PL_regseen); /* from regcomp.c */
4188 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
4189 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
4190 SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
4191 SAVEPPTR(PL_regxend); /* End of input for compile */
4192 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
4193 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4194 SAVEVPTR(PL_reg_re); /* from regexec.c */
4195 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4196 SAVESPTR(PL_reg_sv); /* from regexec.c */
4197 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4198 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4199 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4200 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4202 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4213 clear_re(pTHXo_ void *r)
4215 ReREFCNT_dec((regexp *)r);