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-2000, 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)
280 Zero(cl, 1, struct regnode_charclass_class);
286 S_cl_init_zero(pTHX_ struct regnode_charclass_class *cl)
288 Zero(cl, 1, struct regnode_charclass_class);
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)
301 if (!(and_with->flags & ANYOF_CLASS)
302 && !(cl->flags & ANYOF_CLASS)
303 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
304 && !(and_with->flags & ANYOF_FOLD)
305 && !(cl->flags & ANYOF_FOLD)) {
308 if (and_with->flags & ANYOF_INVERT)
309 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
310 cl->bitmap[i] &= ~and_with->bitmap[i];
312 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
313 cl->bitmap[i] &= and_with->bitmap[i];
314 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
315 if (!(and_with->flags & ANYOF_EOS))
316 cl->flags &= ~ANYOF_EOS;
319 /* 'OR' a given class with another one. Can create false positives */
320 /* We assume that cl is not inverted */
322 S_cl_or(pTHX_ struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
324 if (or_with->flags & ANYOF_INVERT) {
326 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
327 * <= (B1 | !B2) | (CL1 | !CL2)
328 * which is wasteful if CL2 is small, but we ignore CL2:
329 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
330 * XXXX Can we handle case-fold? Unclear:
331 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
332 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
334 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
335 && !(or_with->flags & ANYOF_FOLD)
336 && !(cl->flags & ANYOF_FOLD) ) {
339 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
340 cl->bitmap[i] |= ~or_with->bitmap[i];
341 } /* XXXX: logic is complicated otherwise */
346 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
347 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
348 && (!(or_with->flags & ANYOF_FOLD)
349 || (cl->flags & ANYOF_FOLD)) ) {
352 /* OR char bitmap and class bitmap separately */
353 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
354 cl->bitmap[i] |= or_with->bitmap[i];
355 if (or_with->flags & ANYOF_CLASS) {
356 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
357 cl->classflags[i] |= or_with->classflags[i];
358 cl->flags |= ANYOF_CLASS;
361 else { /* XXXX: logic is complicated, leave it along for a moment. */
365 if (or_with->flags & ANYOF_EOS)
366 cl->flags |= ANYOF_EOS;
369 /* REx optimizer. Converts nodes into quickier variants "in place".
370 Finds fixed substrings. */
372 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
373 to the position after last scanned or to NULL. */
376 S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
377 /* scanp: Start here (read-write). */
378 /* deltap: Write maxlen-minlen here. */
379 /* last: Stop before this one. */
382 I32 min = 0, pars = 0, code;
383 regnode *scan = *scanp, *next;
385 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
386 int is_inf_internal = 0; /* The studied chunk is infinite */
387 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
388 scan_data_t data_fake;
389 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
391 while (scan && OP(scan) != END && scan < last) {
392 /* Peephole optimizer: */
394 if (PL_regkind[(U8)OP(scan)] == EXACT) {
395 /* Merge several consecutive EXACTish nodes into one. */
396 regnode *n = regnext(scan);
399 regnode *stop = scan;
402 next = scan + NODE_SZ_STR(scan);
403 /* Skip NOTHING, merge EXACT*. */
405 ( PL_regkind[(U8)OP(n)] == NOTHING ||
406 (stringok && (OP(n) == OP(scan))))
408 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
409 if (OP(n) == TAIL || n > next)
411 if (PL_regkind[(U8)OP(n)] == NOTHING) {
412 NEXT_OFF(scan) += NEXT_OFF(n);
413 next = n + NODE_STEP_REGNODE;
421 int oldl = STR_LEN(scan);
422 regnode *nnext = regnext(n);
424 if (oldl + STR_LEN(n) > U8_MAX)
426 NEXT_OFF(scan) += NEXT_OFF(n);
427 STR_LEN(scan) += STR_LEN(n);
428 next = n + NODE_SZ_STR(n);
429 /* Now we can overwrite *n : */
430 Move(STRING(n), STRING(scan) + oldl,
441 n = scan + NODE_SZ_STR(scan);
443 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
451 /* Follow the next-chain of the current node and optimize
452 away all the NOTHINGs from it. */
453 if (OP(scan) != CURLYX) {
454 int max = (reg_off_by_arg[OP(scan)]
456 /* I32 may be smaller than U16 on CRAYs! */
457 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
458 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
462 /* Skip NOTHING and LONGJMP. */
463 while ((n = regnext(n))
464 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
465 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
468 if (reg_off_by_arg[OP(scan)])
471 NEXT_OFF(scan) = off;
473 /* The principal pseudo-switch. Cannot be a switch, since we
474 look into several different things. */
475 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
476 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
477 next = regnext(scan);
480 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
481 I32 max1 = 0, min1 = I32_MAX, num = 0;
482 struct regnode_charclass_class accum;
484 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
485 scan_commit(data); /* Cannot merge strings after this. */
486 if (flags & SCF_DO_STCLASS)
487 cl_init_zero(&accum);
488 while (OP(scan) == code) {
489 I32 deltanext, minnext, f = 0;
490 struct regnode_charclass_class this_class;
495 data_fake.whilem_c = data->whilem_c;
496 next = regnext(scan);
497 scan = NEXTOPER(scan);
499 scan = NEXTOPER(scan);
500 if (flags & SCF_DO_STCLASS) {
501 cl_init(&this_class);
502 data_fake.start_class = &this_class;
503 f = SCF_DO_STCLASS_AND;
505 /* we suppose the run is continuous, last=next...*/
506 minnext = study_chunk(&scan, &deltanext, next,
510 if (max1 < minnext + deltanext)
511 max1 = minnext + deltanext;
512 if (deltanext == I32_MAX)
513 is_inf = is_inf_internal = 1;
515 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
517 if (data && (data_fake.flags & SF_HAS_EVAL))
518 data->flags |= SF_HAS_EVAL;
520 data->whilem_c = data_fake.whilem_c;
521 if (flags & SCF_DO_STCLASS)
522 cl_or(&accum, &this_class);
526 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
528 if (flags & SCF_DO_SUBSTR) {
529 data->pos_min += min1;
530 data->pos_delta += max1 - min1;
531 if (max1 != min1 || is_inf)
532 data->longest = &(data->longest_float);
535 delta += max1 - min1;
536 if (flags & SCF_DO_STCLASS_OR) {
537 cl_or(data->start_class, &accum);
539 cl_and(data->start_class, &and_with);
540 flags &= ~SCF_DO_STCLASS;
543 else if (flags & SCF_DO_STCLASS_AND) {
545 cl_and(data->start_class, &accum);
546 flags &= ~SCF_DO_STCLASS;
549 /* Switch to OR mode: cache the old value of
550 * data->start_class */
551 StructCopy(data->start_class, &and_with,
552 struct regnode_charclass_class);
553 flags &= ~SCF_DO_STCLASS_AND;
554 StructCopy(&accum, data->start_class,
555 struct regnode_charclass_class);
556 flags |= SCF_DO_STCLASS_OR;
557 data->start_class->flags |= ANYOF_EOS;
561 else if (code == BRANCHJ) /* single branch is optimized. */
562 scan = NEXTOPER(NEXTOPER(scan));
563 else /* single branch is optimized. */
564 scan = NEXTOPER(scan);
567 else if (OP(scan) == EXACT) {
568 I32 l = STR_LEN(scan);
570 unsigned char *s = (unsigned char *)STRING(scan);
571 unsigned char *e = s + l;
580 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
581 /* The code below prefers earlier match for fixed
582 offset, later match for variable offset. */
583 if (data->last_end == -1) { /* Update the start info. */
584 data->last_start_min = data->pos_min;
585 data->last_start_max = is_inf
586 ? I32_MAX : data->pos_min + data->pos_delta;
588 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
589 data->last_end = data->pos_min + l;
590 data->pos_min += l; /* As in the first entry. */
591 data->flags &= ~SF_BEFORE_EOL;
593 if (flags & SCF_DO_STCLASS_AND) {
594 /* Check whether it is compatible with what we know already! */
597 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
598 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
599 && (!(data->start_class->flags & ANYOF_FOLD)
600 || !ANYOF_BITMAP_TEST(data->start_class,
601 PL_fold[*(U8*)STRING(scan)])))
603 ANYOF_CLASS_ZERO(data->start_class);
604 ANYOF_BITMAP_ZERO(data->start_class);
606 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
607 data->start_class->flags &= ~ANYOF_EOS;
609 else if (flags & SCF_DO_STCLASS_OR) {
610 /* false positive possible if the class is case-folded */
611 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
612 data->start_class->flags &= ~ANYOF_EOS;
613 cl_and(data->start_class, &and_with);
615 flags &= ~SCF_DO_STCLASS;
617 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
618 I32 l = STR_LEN(scan);
620 /* Search for fixed substrings supports EXACT only. */
621 if (flags & SCF_DO_SUBSTR)
624 unsigned char *s = (unsigned char *)STRING(scan);
625 unsigned char *e = s + l;
634 if (data && (flags & SCF_DO_SUBSTR))
636 if (flags & SCF_DO_STCLASS_AND) {
637 /* Check whether it is compatible with what we know already! */
640 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
641 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
642 && !ANYOF_BITMAP_TEST(data->start_class,
643 PL_fold[*(U8*)STRING(scan)]))
645 ANYOF_CLASS_ZERO(data->start_class);
646 ANYOF_BITMAP_ZERO(data->start_class);
648 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
649 data->start_class->flags &= ~ANYOF_EOS;
650 data->start_class->flags |= ANYOF_FOLD;
651 if (OP(scan) == EXACTFL)
652 data->start_class->flags |= ANYOF_LOCALE;
655 else if (flags & SCF_DO_STCLASS_OR) {
656 if (data->start_class->flags & ANYOF_FOLD) {
657 /* false positive possible if the class is case-folded.
658 Assume that the locale settings are the same... */
659 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
660 data->start_class->flags &= ~ANYOF_EOS;
662 cl_and(data->start_class, &and_with);
664 flags &= ~SCF_DO_STCLASS;
666 else if (strchr((char*)PL_varies,OP(scan))) {
667 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
669 regnode *oscan = scan;
670 struct regnode_charclass_class this_class;
671 struct regnode_charclass_class *oclass = NULL;
673 switch (PL_regkind[(U8)OP(scan)]) {
674 case WHILEM: /* End of (?:...)* . */
675 scan = NEXTOPER(scan);
678 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
679 next = NEXTOPER(scan);
680 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
682 maxcount = REG_INFTY;
683 next = regnext(scan);
684 scan = NEXTOPER(scan);
688 if (flags & SCF_DO_SUBSTR)
693 if (flags & SCF_DO_STCLASS) {
695 maxcount = REG_INFTY;
696 next = regnext(scan);
697 scan = NEXTOPER(scan);
700 is_inf = is_inf_internal = 1;
701 scan = regnext(scan);
702 if (flags & SCF_DO_SUBSTR) {
703 scan_commit(data); /* Cannot extend fixed substrings */
704 data->longest = &(data->longest_float);
706 goto optimize_curly_tail;
708 mincount = ARG1(scan);
709 maxcount = ARG2(scan);
710 next = regnext(scan);
711 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
713 if (flags & SCF_DO_SUBSTR) {
714 if (mincount == 0) scan_commit(data); /* Cannot extend fixed substrings */
715 pos_before = data->pos_min;
719 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
721 data->flags |= SF_IS_INF;
723 if (flags & SCF_DO_STCLASS) {
724 cl_init(&this_class);
725 oclass = data->start_class;
726 data->start_class = &this_class;
727 f |= SCF_DO_STCLASS_AND;
728 f &= ~SCF_DO_STCLASS_OR;
731 /* This will finish on WHILEM, setting scan, or on NULL: */
732 minnext = study_chunk(&scan, &deltanext, last, data,
734 ? (f & ~SCF_DO_SUBSTR) : f);
736 if (flags & SCF_DO_STCLASS)
737 data->start_class = oclass;
738 if (mincount == 0 || minnext == 0) {
739 if (flags & SCF_DO_STCLASS_OR) {
740 cl_or(data->start_class, &this_class);
742 else if (flags & SCF_DO_STCLASS_AND) {
743 /* Switch to OR mode: cache the old value of
744 * data->start_class */
745 StructCopy(data->start_class, &and_with,
746 struct regnode_charclass_class);
747 flags &= ~SCF_DO_STCLASS_AND;
748 StructCopy(&this_class, data->start_class,
749 struct regnode_charclass_class);
750 flags |= SCF_DO_STCLASS_OR;
751 data->start_class->flags |= ANYOF_EOS;
753 } else { /* Non-zero len */
754 if (flags & SCF_DO_STCLASS_OR) {
755 cl_or(data->start_class, &this_class);
756 cl_and(data->start_class, &and_with);
758 else if (flags & SCF_DO_STCLASS_AND)
759 cl_and(data->start_class, &this_class);
760 flags &= ~SCF_DO_STCLASS;
762 if (!scan) /* It was not CURLYX, but CURLY. */
764 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
765 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
766 && maxcount <= REG_INFTY/3) /* Complement check for big count */
767 Perl_warner(aTHX_ WARN_REGEXP,
768 "Strange *+?{} on zero-length expression");
769 min += minnext * mincount;
770 is_inf_internal |= ((maxcount == REG_INFTY
771 && (minnext + deltanext) > 0)
772 || deltanext == I32_MAX);
773 is_inf |= is_inf_internal;
774 delta += (minnext + deltanext) * maxcount - minnext * mincount;
776 /* Try powerful optimization CURLYX => CURLYN. */
777 if ( OP(oscan) == CURLYX && data
778 && data->flags & SF_IN_PAR
779 && !(data->flags & SF_HAS_EVAL)
780 && !deltanext && minnext == 1 ) {
781 /* Try to optimize to CURLYN. */
782 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
783 regnode *nxt1 = nxt, *nxt2;
787 if (!strchr((char*)PL_simple,OP(nxt))
788 && !(PL_regkind[(U8)OP(nxt)] == EXACT
789 && STR_LEN(nxt) == 1))
793 if (OP(nxt) != CLOSE)
795 /* Now we know that nxt2 is the only contents: */
796 oscan->flags = ARG(nxt);
798 OP(nxt1) = NOTHING; /* was OPEN. */
800 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
801 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
802 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
803 OP(nxt) = OPTIMIZED; /* was CLOSE. */
804 OP(nxt + 1) = OPTIMIZED; /* was count. */
805 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
810 /* Try optimization CURLYX => CURLYM. */
811 if ( OP(oscan) == CURLYX && data
812 && !(data->flags & SF_HAS_PAR)
813 && !(data->flags & SF_HAS_EVAL)
815 /* XXXX How to optimize if data == 0? */
816 /* Optimize to a simpler form. */
817 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
821 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
822 && (OP(nxt2) != WHILEM))
824 OP(nxt2) = SUCCEED; /* Whas WHILEM */
825 /* Need to optimize away parenths. */
826 if (data->flags & SF_IN_PAR) {
827 /* Set the parenth number. */
828 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
830 if (OP(nxt) != CLOSE)
831 FAIL("panic opt close");
832 oscan->flags = ARG(nxt);
833 OP(nxt1) = OPTIMIZED; /* was OPEN. */
834 OP(nxt) = OPTIMIZED; /* was CLOSE. */
836 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
837 OP(nxt + 1) = OPTIMIZED; /* was count. */
838 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
839 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
842 while ( nxt1 && (OP(nxt1) != WHILEM)) {
843 regnode *nnxt = regnext(nxt1);
846 if (reg_off_by_arg[OP(nxt1)])
847 ARG_SET(nxt1, nxt2 - nxt1);
848 else if (nxt2 - nxt1 < U16_MAX)
849 NEXT_OFF(nxt1) = nxt2 - nxt1;
851 OP(nxt) = NOTHING; /* Cannot beautify */
856 /* Optimize again: */
857 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
862 else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) {
863 /* This stays as CURLYX, and can put the count/of pair. */
864 /* Find WHILEM (as in regexec.c) */
865 regnode *nxt = oscan + NEXT_OFF(oscan);
867 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
869 PREVOPER(nxt)->flags = data->whilem_c
870 | (PL_reg_whilem_seen << 4); /* On WHILEM */
872 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
874 if (flags & SCF_DO_SUBSTR) {
875 SV *last_str = Nullsv;
876 int counted = mincount != 0;
878 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
879 I32 b = pos_before >= data->last_start_min
880 ? pos_before : data->last_start_min;
882 char *s = SvPV(data->last_found, l);
883 I32 old = b - data->last_start_min;
886 old = utf8_hop((U8*)s, old) - (U8*)s;
889 /* Get the added string: */
890 last_str = newSVpvn(s + old, l);
891 if (deltanext == 0 && pos_before == b) {
892 /* What was added is a constant string */
894 SvGROW(last_str, (mincount * l) + 1);
895 repeatcpy(SvPVX(last_str) + l,
896 SvPVX(last_str), l, mincount - 1);
897 SvCUR(last_str) *= mincount;
898 /* Add additional parts. */
899 SvCUR_set(data->last_found,
900 SvCUR(data->last_found) - l);
901 sv_catsv(data->last_found, last_str);
902 data->last_end += l * (mincount - 1);
905 /* start offset must point into the last copy */
906 data->last_start_min += minnext * (mincount - 1);
909 /* It is counted once already... */
910 data->pos_min += minnext * (mincount - counted);
911 data->pos_delta += - counted * deltanext +
912 (minnext + deltanext) * maxcount - minnext * mincount;
913 if (mincount != maxcount) {
914 /* Cannot extend fixed substrings found inside
917 if (mincount && last_str) {
918 sv_setsv(data->last_found, last_str);
919 data->last_end = data->pos_min;
920 data->last_start_min =
921 data->pos_min - CHR_SVLEN(last_str);
922 data->last_start_max = is_inf
924 : data->pos_min + data->pos_delta
925 - CHR_SVLEN(last_str);
927 data->longest = &(data->longest_float);
929 SvREFCNT_dec(last_str);
931 if (data && (fl & SF_HAS_EVAL))
932 data->flags |= SF_HAS_EVAL;
934 if (OP(oscan) != CURLYX) {
935 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
937 NEXT_OFF(oscan) += NEXT_OFF(next);
940 default: /* REF and CLUMP only? */
941 if (flags & SCF_DO_SUBSTR) {
942 scan_commit(data); /* Cannot expect anything... */
943 data->longest = &(data->longest_float);
945 is_inf = is_inf_internal = 1;
946 if (flags & SCF_DO_STCLASS_OR)
947 cl_anything(data->start_class);
948 flags &= ~SCF_DO_STCLASS;
952 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
955 if (flags & SCF_DO_SUBSTR) {
960 if (flags & SCF_DO_STCLASS) {
961 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
963 /* Some of the logic below assumes that switching
964 locale on will only add false positives. */
965 switch (PL_regkind[(U8)OP(scan)]) {
982 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
983 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
984 cl_anything(data->start_class);
987 if (OP(scan) == SANY)
989 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
990 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
991 || (data->start_class->flags & ANYOF_CLASS));
992 cl_anything(data->start_class);
994 if (flags & SCF_DO_STCLASS_AND || !value)
995 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
998 if (flags & SCF_DO_STCLASS_AND)
999 cl_and(data->start_class,
1000 (struct regnode_charclass_class*)scan);
1002 cl_or(data->start_class,
1003 (struct regnode_charclass_class*)scan);
1006 if (flags & SCF_DO_STCLASS_AND) {
1007 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1008 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1009 for (value = 0; value < 256; value++)
1010 if (!isALNUM(value))
1011 ANYOF_BITMAP_CLEAR(data->start_class, value);
1015 if (data->start_class->flags & ANYOF_LOCALE)
1016 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1018 for (value = 0; value < 256; value++)
1020 ANYOF_BITMAP_SET(data->start_class, value);
1025 if (flags & SCF_DO_STCLASS_AND) {
1026 if (data->start_class->flags & ANYOF_LOCALE)
1027 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1030 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1031 data->start_class->flags |= ANYOF_LOCALE;
1035 if (flags & SCF_DO_STCLASS_AND) {
1036 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1037 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1038 for (value = 0; value < 256; value++)
1040 ANYOF_BITMAP_CLEAR(data->start_class, value);
1044 if (data->start_class->flags & ANYOF_LOCALE)
1045 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1047 for (value = 0; value < 256; value++)
1048 if (!isALNUM(value))
1049 ANYOF_BITMAP_SET(data->start_class, value);
1054 if (flags & SCF_DO_STCLASS_AND) {
1055 if (data->start_class->flags & ANYOF_LOCALE)
1056 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1059 data->start_class->flags |= ANYOF_LOCALE;
1060 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1064 if (flags & SCF_DO_STCLASS_AND) {
1065 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1066 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1067 for (value = 0; value < 256; value++)
1068 if (!isSPACE(value))
1069 ANYOF_BITMAP_CLEAR(data->start_class, value);
1073 if (data->start_class->flags & ANYOF_LOCALE)
1074 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1076 for (value = 0; value < 256; value++)
1078 ANYOF_BITMAP_SET(data->start_class, value);
1083 if (flags & SCF_DO_STCLASS_AND) {
1084 if (data->start_class->flags & ANYOF_LOCALE)
1085 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1088 data->start_class->flags |= ANYOF_LOCALE;
1089 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1093 if (flags & SCF_DO_STCLASS_AND) {
1094 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1095 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1096 for (value = 0; value < 256; value++)
1098 ANYOF_BITMAP_CLEAR(data->start_class, value);
1102 if (data->start_class->flags & ANYOF_LOCALE)
1103 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1105 for (value = 0; value < 256; value++)
1106 if (!isSPACE(value))
1107 ANYOF_BITMAP_SET(data->start_class, value);
1112 if (flags & SCF_DO_STCLASS_AND) {
1113 if (data->start_class->flags & ANYOF_LOCALE) {
1114 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1115 for (value = 0; value < 256; value++)
1116 if (!isSPACE(value))
1117 ANYOF_BITMAP_CLEAR(data->start_class, value);
1121 data->start_class->flags |= ANYOF_LOCALE;
1122 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1126 if (flags & SCF_DO_STCLASS_AND) {
1127 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1128 for (value = 0; value < 256; value++)
1129 if (!isDIGIT(value))
1130 ANYOF_BITMAP_CLEAR(data->start_class, value);
1133 if (data->start_class->flags & ANYOF_LOCALE)
1134 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1136 for (value = 0; value < 256; value++)
1138 ANYOF_BITMAP_SET(data->start_class, value);
1143 if (flags & SCF_DO_STCLASS_AND) {
1144 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1145 for (value = 0; value < 256; value++)
1147 ANYOF_BITMAP_CLEAR(data->start_class, value);
1150 if (data->start_class->flags & ANYOF_LOCALE)
1151 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1153 for (value = 0; value < 256; value++)
1154 if (!isDIGIT(value))
1155 ANYOF_BITMAP_SET(data->start_class, value);
1160 if (flags & SCF_DO_STCLASS_OR)
1161 cl_and(data->start_class, &and_with);
1162 flags &= ~SCF_DO_STCLASS;
1165 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1166 data->flags |= (OP(scan) == MEOL
1170 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1171 /* Lookbehind, or need to calculate parens/evals/stclass: */
1172 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1173 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1174 /* Lookahead/lookbehind */
1175 I32 deltanext, minnext;
1177 struct regnode_charclass_class intrnl;
1180 data_fake.flags = 0;
1182 data_fake.whilem_c = data->whilem_c;
1183 if ( flags & SCF_DO_STCLASS && !scan->flags
1184 && OP(scan) == IFMATCH ) { /* Lookahead */
1186 data_fake.start_class = &intrnl;
1187 f = SCF_DO_STCLASS_AND;
1189 next = regnext(scan);
1190 nscan = NEXTOPER(NEXTOPER(scan));
1191 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, f);
1194 FAIL("variable length lookbehind not implemented");
1196 else if (minnext > U8_MAX) {
1197 FAIL2("lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1199 scan->flags = minnext;
1201 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1203 if (data && (data_fake.flags & SF_HAS_EVAL))
1204 data->flags |= SF_HAS_EVAL;
1206 data->whilem_c = data_fake.whilem_c;
1208 int was = (data->start_class->flags & ANYOF_EOS);
1210 cl_and(data->start_class, &intrnl);
1212 data->start_class->flags |= ANYOF_EOS;
1215 else if (OP(scan) == OPEN) {
1218 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
1219 next = regnext(scan);
1221 if ( next && (OP(next) != WHILEM) && next < last)
1222 is_par = 0; /* Disable optimization */
1224 else if (OP(scan) == EVAL) {
1226 data->flags |= SF_HAS_EVAL;
1228 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1229 if (flags & SCF_DO_SUBSTR) {
1231 data->longest = &(data->longest_float);
1233 is_inf = is_inf_internal = 1;
1234 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1235 cl_anything(data->start_class);
1236 flags &= ~SCF_DO_STCLASS;
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)
1337 FAIL("NULL regexp argument");
1339 if (pm->op_pmdynflags & PMdf_UTF8) {
1340 PL_reg_flags |= RF_utf8;
1345 PL_regprecomp = savepvn(exp, xend - exp);
1346 DEBUG_r(if (!PL_colorset) reginitcolors());
1347 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1348 PL_colors[4],PL_colors[5],PL_colors[0],
1349 (int)(xend - exp), PL_regprecomp, PL_colors[1]));
1350 PL_regflags = pm->op_pmflags;
1354 PL_seen_zerolen = *exp == '^' ? -1 : 0;
1358 /* First pass: determine size, legality. */
1359 PL_regcomp_parse = exp;
1364 PL_regcode = &PL_regdummy;
1365 PL_reg_whilem_seen = 0;
1366 #if 0 /* REGC() is (currently) a NOP at the first pass.
1367 * Clever compilers notice this and complain. --jhi */
1368 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 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1393 Zero(r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode), char);
1396 r->prelen = xend - exp;
1397 r->precomp = PL_regprecomp;
1399 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1400 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
1402 r->substrs = 0; /* Useful during FAIL. */
1403 r->startp = 0; /* Useful during FAIL. */
1404 r->endp = 0; /* Useful during FAIL. */
1408 /* Second pass: emit code. */
1409 PL_regcomp_parse = exp;
1413 PL_regcode = r->program;
1414 /* Store the count of eval-groups for security checks: */
1415 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
1416 REGC((U8)REG_MAGIC, (char*) PL_regcode++);
1418 if (reg(0, &flags) == NULL)
1421 /* Dig out information for optimizations. */
1422 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1423 pm->op_pmflags = PL_regflags;
1425 r->reganch |= ROPT_UTF8;
1426 r->regstclass = NULL;
1427 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
1428 r->reganch |= ROPT_NAUGHTY;
1429 scan = r->program + 1; /* First BRANCH. */
1431 /* XXXX To minimize changes to RE engine we always allocate
1432 3-units-long substrs field. */
1433 Newz(1004, r->substrs, 1, struct reg_substr_data);
1435 StructCopy(&zero_scan_data, &data, scan_data_t);
1436 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1437 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1439 STRLEN longest_float_length, longest_fixed_length;
1440 struct regnode_charclass_class ch_class;
1444 /* Skip introductions and multiplicators >= 1. */
1445 while ((OP(first) == OPEN && (sawopen = 1)) ||
1446 /* An OR of *one* alternative - should not happen now. */
1447 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1448 (OP(first) == PLUS) ||
1449 (OP(first) == MINMOD) ||
1450 /* An {n,m} with n>0 */
1451 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1452 if (OP(first) == PLUS)
1455 first += regarglen[(U8)OP(first)];
1456 first = NEXTOPER(first);
1459 /* Starting-point info. */
1461 if (PL_regkind[(U8)OP(first)] == EXACT) {
1462 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
1463 else if ((OP(first) == EXACTF || OP(first) == EXACTFL)
1465 r->regstclass = first;
1467 else if (strchr((char*)PL_simple,OP(first)))
1468 r->regstclass = first;
1469 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1470 PL_regkind[(U8)OP(first)] == NBOUND)
1471 r->regstclass = first;
1472 else if (PL_regkind[(U8)OP(first)] == BOL) {
1473 r->reganch |= (OP(first) == MBOL
1475 : (OP(first) == SBOL
1478 first = NEXTOPER(first);
1481 else if (OP(first) == GPOS) {
1482 r->reganch |= ROPT_ANCH_GPOS;
1483 first = NEXTOPER(first);
1486 else if ((OP(first) == STAR &&
1487 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1488 !(r->reganch & ROPT_ANCH) )
1490 /* turn .* into ^.* with an implied $*=1 */
1491 int type = OP(NEXTOPER(first));
1493 if (type == REG_ANY || type == ANYUTF8)
1494 type = ROPT_ANCH_MBOL;
1496 type = ROPT_ANCH_SBOL;
1498 r->reganch |= type | ROPT_IMPLICIT;
1499 first = NEXTOPER(first);
1502 if (sawplus && (!sawopen || !PL_regsawback)
1503 && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */
1504 /* x+ must match at the 1st pos of run of x's */
1505 r->reganch |= ROPT_SKIP;
1507 /* Scan is after the zeroth branch, first is atomic matcher. */
1508 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1509 (IV)(first - scan + 1)));
1511 * If there's something expensive in the r.e., find the
1512 * longest literal string that must appear and make it the
1513 * regmust. Resolve ties in favor of later strings, since
1514 * the regstart check works with the beginning of the r.e.
1515 * and avoiding duplication strengthens checking. Not a
1516 * strong reason, but sufficient in the absence of others.
1517 * [Now we resolve ties in favor of the earlier string if
1518 * it happens that c_offset_min has been invalidated, since the
1519 * earlier string may buy us something the later one won't.]
1523 data.longest_fixed = newSVpvn("",0);
1524 data.longest_float = newSVpvn("",0);
1525 data.last_found = newSVpvn("",0);
1526 data.longest = &(data.longest_fixed);
1528 if (!r->regstclass) {
1530 data.start_class = &ch_class;
1531 stclass_flag = SCF_DO_STCLASS_AND;
1532 } else /* XXXX Check for BOUND? */
1535 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
1536 &data, SCF_DO_SUBSTR | stclass_flag);
1537 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
1538 && data.last_start_min == 0 && data.last_end > 0
1540 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1541 r->reganch |= ROPT_CHECK_ALL;
1543 SvREFCNT_dec(data.last_found);
1545 longest_float_length = CHR_SVLEN(data.longest_float);
1546 if (longest_float_length
1547 || (data.flags & SF_FL_BEFORE_EOL
1548 && (!(data.flags & SF_FL_BEFORE_MEOL)
1549 || (PL_regflags & PMf_MULTILINE)))) {
1552 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1553 && data.offset_fixed == data.offset_float_min
1554 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1555 goto remove_float; /* As in (a)+. */
1557 r->float_substr = data.longest_float;
1558 r->float_min_offset = data.offset_float_min;
1559 r->float_max_offset = data.offset_float_max;
1560 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1561 && (!(data.flags & SF_FL_BEFORE_MEOL)
1562 || (PL_regflags & PMf_MULTILINE)));
1563 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1567 r->float_substr = Nullsv;
1568 SvREFCNT_dec(data.longest_float);
1569 longest_float_length = 0;
1572 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1573 if (longest_fixed_length
1574 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1575 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1576 || (PL_regflags & PMf_MULTILINE)))) {
1579 r->anchored_substr = data.longest_fixed;
1580 r->anchored_offset = data.offset_fixed;
1581 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1582 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1583 || (PL_regflags & PMf_MULTILINE)));
1584 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1587 r->anchored_substr = Nullsv;
1588 SvREFCNT_dec(data.longest_fixed);
1589 longest_fixed_length = 0;
1592 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8
1593 || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY))
1594 r->regstclass = NULL;
1595 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1596 && !(data.start_class->flags & ANYOF_EOS)
1597 && !cl_is_anything(data.start_class)) {
1599 I32 n = add_data(1, "f");
1601 New(1006, PL_regcomp_rx->data->data[n], 1,
1602 struct regnode_charclass_class);
1603 StructCopy(data.start_class,
1604 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1605 struct regnode_charclass_class);
1606 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1607 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1608 DEBUG_r((sv = sv_newmortal(),
1609 regprop(sv, (regnode*)data.start_class),
1610 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1614 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1615 if (longest_fixed_length > longest_float_length) {
1616 r->check_substr = r->anchored_substr;
1617 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1618 if (r->reganch & ROPT_ANCH_SINGLE)
1619 r->reganch |= ROPT_NOSCAN;
1622 r->check_substr = r->float_substr;
1623 r->check_offset_min = data.offset_float_min;
1624 r->check_offset_max = data.offset_float_max;
1626 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1627 This should be changed ASAP! */
1628 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1629 r->reganch |= RE_USE_INTUIT;
1630 if (SvTAIL(r->check_substr))
1631 r->reganch |= RE_INTUIT_TAIL;
1635 /* Several toplevels. Best we can is to set minlen. */
1637 struct regnode_charclass_class ch_class;
1639 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1640 scan = r->program + 1;
1642 data.start_class = &ch_class;
1643 minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, SCF_DO_STCLASS_AND);
1644 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1645 if (!(data.start_class->flags & ANYOF_EOS)
1646 && !cl_is_anything(data.start_class)) {
1648 I32 n = add_data(1, "f");
1650 New(1006, PL_regcomp_rx->data->data[n], 1,
1651 struct regnode_charclass_class);
1652 StructCopy(data.start_class,
1653 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1654 struct regnode_charclass_class);
1655 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1656 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1657 DEBUG_r((sv = sv_newmortal(),
1658 regprop(sv, (regnode*)data.start_class),
1659 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1665 if (PL_regseen & REG_SEEN_GPOS)
1666 r->reganch |= ROPT_GPOS_SEEN;
1667 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1668 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1669 if (PL_regseen & REG_SEEN_EVAL)
1670 r->reganch |= ROPT_EVAL_SEEN;
1671 Newz(1002, r->startp, PL_regnpar, I32);
1672 Newz(1002, r->endp, PL_regnpar, I32);
1673 DEBUG_r(regdump(r));
1678 - reg - regular expression, i.e. main body or parenthesized thing
1680 * Caller must absorb opening parenthesis.
1682 * Combining parenthesis handling with the base level of regular expression
1683 * is a trifle forced, but the need to tie the tails of the branches to what
1684 * follows makes it hard to avoid.
1687 S_reg(pTHX_ I32 paren, I32 *flagp)
1688 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1691 register regnode *ret; /* Will be the head of the group. */
1692 register regnode *br;
1693 register regnode *lastbr;
1694 register regnode *ender = 0;
1695 register I32 parno = 0;
1696 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1699 *flagp = 0; /* Tentatively. */
1701 /* Make an OPEN node, if parenthesized. */
1703 if (*PL_regcomp_parse == '?') {
1704 U16 posflags = 0, negflags = 0;
1705 U16 *flagsp = &posflags;
1709 paren = *PL_regcomp_parse++;
1710 ret = NULL; /* For look-ahead/behind. */
1713 PL_regseen |= REG_SEEN_LOOKBEHIND;
1714 if (*PL_regcomp_parse == '!')
1716 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1727 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1730 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1732 if (*PL_regcomp_parse != ')')
1733 FAIL("Sequence (?#... not terminated");
1739 Perl_warner(aTHX_ WARN_REGEXP,
1740 "(?p{}) is deprecated - use (??{})");
1744 paren = *PL_regcomp_parse++;
1749 I32 count = 1, n = 0;
1751 char *s = PL_regcomp_parse;
1753 OP_4tree *sop, *rop;
1756 PL_regseen |= REG_SEEN_EVAL;
1757 while (count && (c = *PL_regcomp_parse)) {
1758 if (c == '\\' && PL_regcomp_parse[1])
1766 if (*PL_regcomp_parse != ')')
1767 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1771 if (PL_regcomp_parse - 1 - s)
1772 sv = newSVpvn(s, PL_regcomp_parse - 1 - s);
1774 sv = newSVpvn("", 0);
1776 rop = sv_compile_2op(sv, &sop, "re", &av);
1778 n = add_data(3, "nop");
1779 PL_regcomp_rx->data->data[n] = (void*)rop;
1780 PL_regcomp_rx->data->data[n+1] = (void*)sop;
1781 PL_regcomp_rx->data->data[n+2] = (void*)av;
1784 else { /* First pass */
1785 if (PL_reginterp_cnt < ++PL_seen_evals
1786 && PL_curcop != &PL_compiling)
1787 /* No compiled RE interpolated, has runtime
1788 components ===> unsafe. */
1789 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1791 FAIL("Eval-group in insecure regular expression");
1796 ret = reg_node(LOGICAL);
1799 regtail(ret, reganode(EVAL, n));
1802 return reganode(EVAL, n);
1806 if (PL_regcomp_parse[0] == '?') {
1807 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1808 || PL_regcomp_parse[1] == '<'
1809 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1812 ret = reg_node(LOGICAL);
1815 regtail(ret, reg(1, &flag));
1819 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1820 parno = atoi(PL_regcomp_parse++);
1822 while (isDIGIT(*PL_regcomp_parse))
1824 ret = reganode(GROUPP, parno);
1825 if ((c = *nextchar()) != ')')
1826 FAIL2("Switch (?(number%c not recognized", c);
1828 regtail(ret, reganode(IFTHEN, 0));
1829 br = regbranch(&flags, 1);
1831 br = reganode(LONGJMP, 0);
1833 regtail(br, reganode(LONGJMP, 0));
1838 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1839 regbranch(&flags, 1);
1840 regtail(ret, lastbr);
1848 FAIL("Switch (?(condition)... contains too many branches");
1849 ender = reg_node(TAIL);
1852 regtail(lastbr, ender);
1853 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1856 regtail(ret, ender);
1860 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1864 FAIL("Sequence (? incomplete");
1869 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1870 if (*PL_regcomp_parse != 'o')
1871 pmflag(flagsp, *PL_regcomp_parse);
1874 if (*PL_regcomp_parse == '-') {
1879 PL_regflags |= posflags;
1880 PL_regflags &= ~negflags;
1881 if (*PL_regcomp_parse == ':') {
1887 if (*PL_regcomp_parse != ')')
1888 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1897 ret = reganode(OPEN, parno);
1904 /* Pick up the branches, linking them together. */
1905 br = regbranch(&flags, 1);
1908 if (*PL_regcomp_parse == '|') {
1909 if (!SIZE_ONLY && PL_extralen) {
1910 reginsert(BRANCHJ, br);
1913 reginsert(BRANCH, br);
1916 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1918 else if (paren == ':') {
1919 *flagp |= flags&SIMPLE;
1921 if (open) { /* Starts with OPEN. */
1922 regtail(ret, br); /* OPEN -> first. */
1924 else if (paren != '?') /* Not Conditional */
1928 *flagp |= flags&SPSTART;
1930 while (*PL_regcomp_parse == '|') {
1931 if (!SIZE_ONLY && PL_extralen) {
1932 ender = reganode(LONGJMP,0);
1933 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1936 PL_extralen += 2; /* Account for LONGJMP. */
1938 br = regbranch(&flags, 0);
1941 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1945 *flagp |= flags&SPSTART;
1948 if (have_branch || paren != ':') {
1949 /* Make a closing node, and hook it on the end. */
1952 ender = reg_node(TAIL);
1955 ender = reganode(CLOSE, parno);
1961 *flagp &= ~HASWIDTH;
1964 ender = reg_node(SUCCEED);
1967 ender = reg_node(END);
1970 regtail(lastbr, ender);
1973 /* Hook the tails of the branches to the closing node. */
1974 for (br = ret; br != NULL; br = regnext(br)) {
1975 regoptail(br, ender);
1982 static char parens[] = "=!<,>";
1984 if (paren && (p = strchr(parens, paren))) {
1985 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1986 int flag = (p - parens) > 1;
1989 node = SUSPEND, flag = 0;
1990 reginsert(node,ret);
1992 regtail(ret, reg_node(TAIL));
1996 /* Check for proper termination. */
1998 PL_regflags = oregflags;
1999 if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') {
2000 FAIL("unmatched () in regexp");
2003 else if (!paren && PL_regcomp_parse < PL_regxend) {
2004 if (*PL_regcomp_parse == ')') {
2005 FAIL("unmatched () in regexp");
2008 FAIL("junk on end of regexp"); /* "Can't happen". */
2016 - regbranch - one alternative of an | operator
2018 * Implements the concatenation operator.
2021 S_regbranch(pTHX_ I32 *flagp, I32 first)
2024 register regnode *ret;
2025 register regnode *chain = NULL;
2026 register regnode *latest;
2027 I32 flags = 0, c = 0;
2032 if (!SIZE_ONLY && PL_extralen)
2033 ret = reganode(BRANCHJ,0);
2035 ret = reg_node(BRANCH);
2038 if (!first && SIZE_ONLY)
2039 PL_extralen += 1; /* BRANCHJ */
2041 *flagp = WORST; /* Tentatively. */
2045 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
2047 latest = regpiece(&flags);
2048 if (latest == NULL) {
2049 if (flags & TRYAGAIN)
2053 else if (ret == NULL)
2055 *flagp |= flags&HASWIDTH;
2056 if (chain == NULL) /* First piece. */
2057 *flagp |= flags&SPSTART;
2060 regtail(chain, latest);
2065 if (chain == NULL) { /* Loop ran zero times. */
2066 chain = reg_node(NOTHING);
2071 *flagp |= flags&SIMPLE;
2078 - regpiece - something followed by possible [*+?]
2080 * Note that the branching code sequences used for ? and the general cases
2081 * of * and + are somewhat optimized: they use the same NOTHING node as
2082 * both the endmarker for their branch list and the body of the last branch.
2083 * It might seem that this node could be dispensed with entirely, but the
2084 * endmarker role is not redundant.
2087 S_regpiece(pTHX_ I32 *flagp)
2090 register regnode *ret;
2092 register char *next;
2094 char *origparse = PL_regcomp_parse;
2097 I32 max = REG_INFTY;
2099 ret = regatom(&flags);
2101 if (flags & TRYAGAIN)
2106 op = *PL_regcomp_parse;
2108 if (op == '{' && regcurly(PL_regcomp_parse)) {
2109 next = PL_regcomp_parse + 1;
2111 while (isDIGIT(*next) || *next == ',') {
2120 if (*next == '}') { /* got one */
2124 min = atoi(PL_regcomp_parse);
2128 maxpos = PL_regcomp_parse;
2130 if (!max && *maxpos != '0')
2131 max = REG_INFTY; /* meaning "infinity" */
2132 else if (max >= REG_INFTY)
2133 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2134 PL_regcomp_parse = next;
2138 if ((flags&SIMPLE)) {
2139 PL_regnaughty += 2 + PL_regnaughty / 2;
2140 reginsert(CURLY, ret);
2143 regnode *w = reg_node(WHILEM);
2147 if (!SIZE_ONLY && PL_extralen) {
2148 reginsert(LONGJMP,ret);
2149 reginsert(NOTHING,ret);
2150 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2152 reginsert(CURLYX,ret);
2153 if (!SIZE_ONLY && PL_extralen)
2154 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2155 regtail(ret, reg_node(NOTHING));
2157 PL_reg_whilem_seen++, PL_extralen += 3;
2158 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
2166 if (max && max < min)
2167 FAIL("Can't do {n,m} with n > m");
2182 #if 0 /* Now runtime fix should be reliable. */
2183 if (!(flags&HASWIDTH) && op != '?')
2184 FAIL("regexp *+ operand could be empty");
2189 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2191 if (op == '*' && (flags&SIMPLE)) {
2192 reginsert(STAR, ret);
2196 else if (op == '*') {
2200 else if (op == '+' && (flags&SIMPLE)) {
2201 reginsert(PLUS, ret);
2205 else if (op == '+') {
2209 else if (op == '?') {
2214 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2215 Perl_warner(aTHX_ WARN_REGEXP, "%.*s matches null string many times",
2216 PL_regcomp_parse - origparse, origparse);
2219 if (*PL_regcomp_parse == '?') {
2221 reginsert(MINMOD, ret);
2222 regtail(ret, ret + NODE_STEP_REGNODE);
2224 if (ISMULT2(PL_regcomp_parse))
2225 FAIL("nested *?+ in regexp");
2231 - regatom - the lowest level
2233 * Optimization: gobbles an entire sequence of ordinary characters so that
2234 * it can turn them into a single node, which is smaller to store and
2235 * faster to run. Backslashed characters are exceptions, each becoming a
2236 * separate node; the code is simpler that way and it's not worth fixing.
2238 * [Yes, it is worth fixing, some scripts can run twice the speed.]
2241 S_regatom(pTHX_ I32 *flagp)
2244 register regnode *ret = 0;
2247 *flagp = WORST; /* Tentatively. */
2250 switch (*PL_regcomp_parse) {
2254 if (PL_regflags & PMf_MULTILINE)
2255 ret = reg_node(MBOL);
2256 else if (PL_regflags & PMf_SINGLELINE)
2257 ret = reg_node(SBOL);
2259 ret = reg_node(BOL);
2262 if (PL_regcomp_parse[1])
2265 if (PL_regflags & PMf_MULTILINE)
2266 ret = reg_node(MEOL);
2267 else if (PL_regflags & PMf_SINGLELINE)
2268 ret = reg_node(SEOL);
2270 ret = reg_node(EOL);
2275 if (PL_regflags & PMf_SINGLELINE)
2276 ret = reg_node(SANYUTF8);
2278 ret = reg_node(ANYUTF8);
2282 if (PL_regflags & PMf_SINGLELINE)
2283 ret = reg_node(SANY);
2285 ret = reg_node(REG_ANY);
2286 *flagp |= HASWIDTH|SIMPLE;
2292 ret = (UTF ? regclassutf8() : regclass());
2293 if (*PL_regcomp_parse != ']')
2294 FAIL("unmatched [] in regexp");
2296 *flagp |= HASWIDTH|SIMPLE;
2300 ret = reg(1, &flags);
2302 if (flags & TRYAGAIN) {
2303 if (PL_regcomp_parse == PL_regxend) {
2304 /* Make parent create an empty node if needed. */
2312 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2316 if (flags & TRYAGAIN) {
2320 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
2321 /* Supposed to be caught earlier. */
2324 if (!regcurly(PL_regcomp_parse)) {
2332 FAIL("?+*{} follows nothing in regexp");
2335 switch (*++PL_regcomp_parse) {
2338 ret = reg_node(SBOL);
2343 ret = reg_node(GPOS);
2344 PL_regseen |= REG_SEEN_GPOS;
2349 ret = reg_node(SEOL);
2354 ret = reg_node(EOS);
2356 PL_seen_zerolen++; /* Do not optimize RE away */
2360 ret = reg_node(SANY);
2361 *flagp |= HASWIDTH|SIMPLE;
2365 ret = reg_node(CLUMP);
2368 if (UTF && !PL_utf8_mark)
2369 is_utf8_mark((U8*)"~"); /* preload table */
2374 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
2375 : (LOC ? ALNUML : ALNUM));
2376 *flagp |= HASWIDTH|SIMPLE;
2378 if (UTF && !PL_utf8_alnum)
2379 is_utf8_alnum((U8*)"a"); /* preload table */
2384 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
2385 : (LOC ? NALNUML : NALNUM));
2386 *flagp |= HASWIDTH|SIMPLE;
2388 if (UTF && !PL_utf8_alnum)
2389 is_utf8_alnum((U8*)"a"); /* preload table */
2393 PL_regseen |= REG_SEEN_LOOKBEHIND;
2396 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
2397 : (LOC ? BOUNDL : BOUND));
2400 if (UTF && !PL_utf8_alnum)
2401 is_utf8_alnum((U8*)"a"); /* preload table */
2405 PL_regseen |= REG_SEEN_LOOKBEHIND;
2408 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
2409 : (LOC ? NBOUNDL : NBOUND));
2412 if (UTF && !PL_utf8_alnum)
2413 is_utf8_alnum((U8*)"a"); /* preload table */
2418 ? (LOC ? SPACELUTF8 : SPACEUTF8)
2419 : (LOC ? SPACEL : SPACE));
2420 *flagp |= HASWIDTH|SIMPLE;
2422 if (UTF && !PL_utf8_space)
2423 is_utf8_space((U8*)" "); /* preload table */
2428 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
2429 : (LOC ? NSPACEL : NSPACE));
2430 *flagp |= HASWIDTH|SIMPLE;
2432 if (UTF && !PL_utf8_space)
2433 is_utf8_space((U8*)" "); /* preload table */
2436 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
2437 *flagp |= HASWIDTH|SIMPLE;
2439 if (UTF && !PL_utf8_digit)
2440 is_utf8_digit((U8*)"1"); /* preload table */
2443 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
2444 *flagp |= HASWIDTH|SIMPLE;
2446 if (UTF && !PL_utf8_digit)
2447 is_utf8_digit((U8*)"1"); /* preload table */
2451 { /* a lovely hack--pretend we saw [\pX] instead */
2452 char* oldregxend = PL_regxend;
2454 if (PL_regcomp_parse[1] == '{') {
2455 PL_regxend = strchr(PL_regcomp_parse, '}');
2457 FAIL("Missing right brace on \\p{}");
2461 PL_regxend = PL_regcomp_parse + 2;
2464 ret = regclassutf8();
2466 PL_regxend = oldregxend;
2469 *flagp |= HASWIDTH|SIMPLE;
2482 case '1': case '2': case '3': case '4':
2483 case '5': case '6': case '7': case '8': case '9':
2485 I32 num = atoi(PL_regcomp_parse);
2487 if (num > 9 && num >= PL_regnpar)
2490 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
2491 FAIL("reference to nonexistent group");
2494 ? (LOC ? REFFL : REFF)
2497 while (isDIGIT(*PL_regcomp_parse))
2505 if (PL_regcomp_parse >= PL_regxend)
2506 FAIL("trailing \\ in regexp");
2509 /* Do not generate `unrecognized' warnings here, we fall
2510 back into the quick-grab loop below */
2516 if (PL_regflags & PMf_EXTENDED) {
2517 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
2518 if (PL_regcomp_parse < PL_regxend)
2534 ? (LOC ? EXACTFL : EXACTF)
2537 for (len = 0, p = PL_regcomp_parse - 1;
2538 len < 127 && p < PL_regxend;
2543 if (PL_regflags & PMf_EXTENDED)
2544 p = regwhite(p, PL_regxend);
2606 char* e = strchr(p, '}');
2609 FAIL("Missing right brace on \\x{}");
2611 numlen = 1; /* allow underscores */
2612 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2613 /* numlen is generous */
2614 if (numlen + len >= 127) {
2621 FAIL("Can't use \\x{} without 'use utf8' declaration");
2624 numlen = 0; /* disallow underscores */
2625 ender = (UV)scan_hex(p, 2, &numlen);
2631 ender = UCHARAT(p++);
2632 ender = toCTRL(ender);
2634 case '0': case '1': case '2': case '3':case '4':
2635 case '5': case '6': case '7': case '8':case '9':
2637 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2638 numlen = 0; /* disallow underscores */
2639 ender = (UV)scan_oct(p, 3, &numlen);
2648 if (p >= PL_regxend)
2649 FAIL("trailing \\ in regexp");
2652 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2653 Perl_warner(aTHX_ WARN_REGEXP,
2654 "/%.127s/: Unrecognized escape \\%c passed through",
2657 goto normal_default;
2662 if ((*p & 0xc0) == 0xc0 && UTF) {
2663 ender = utf8_to_uv((U8*)p, &numlen);
2670 if (PL_regflags & PMf_EXTENDED)
2671 p = regwhite(p, PL_regxend);
2674 ender = toLOWER_LC_uni(ender);
2676 ender = toLOWER_uni(ender);
2678 if (ISMULT2(p)) { /* Back off on ?+*. */
2681 else if (ender >= 0x80 && UTF) {
2682 reguni(ender, s, &numlen);
2692 if (ender >= 0x80 && UTF) {
2693 reguni(ender, s, &numlen);
2701 PL_regcomp_parse = p - 1;
2704 FAIL("internal disaster in regexp");
2712 PL_regsize += STR_SZ(len);
2714 PL_regcode += STR_SZ(len);
2723 S_regwhite(pTHX_ char *p, char *e)
2728 else if (*p == '#') {
2731 } while (p < e && *p != '\n');
2739 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
2740 Character classes ([:foo:]) can also be negated ([:^foo:]).
2741 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
2742 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
2743 but trigger warnings because they are currently unimplemented. */
2745 S_regpposixcc(pTHX_ I32 value)
2749 I32 namedclass = OOB_NAMEDCLASS;
2751 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2752 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2753 (*PL_regcomp_parse == ':' ||
2754 *PL_regcomp_parse == '=' ||
2755 *PL_regcomp_parse == '.')) {
2756 char c = *PL_regcomp_parse;
2757 char* s = PL_regcomp_parse++;
2759 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2761 if (PL_regcomp_parse == PL_regxend)
2762 /* Grandfather lone [:, [=, [. */
2763 PL_regcomp_parse = s;
2765 char* t = PL_regcomp_parse++; /* skip over the c */
2767 if (*PL_regcomp_parse == ']') {
2768 PL_regcomp_parse++; /* skip over the ending ] */
2771 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
2772 I32 skip = 5; /* the most common skip */
2776 if (strnEQ(posixcc, "alnum", 5))
2778 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
2779 else if (strnEQ(posixcc, "alpha", 5))
2781 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
2782 else if (strnEQ(posixcc, "ascii", 5))
2784 complement ? ANYOF_NASCII : ANYOF_ASCII;
2787 if (strnEQ(posixcc, "cntrl", 5))
2789 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
2792 if (strnEQ(posixcc, "digit", 5))
2794 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
2797 if (strnEQ(posixcc, "graph", 5))
2799 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
2802 if (strnEQ(posixcc, "lower", 5))
2804 complement ? ANYOF_NLOWER : ANYOF_LOWER;
2807 if (strnEQ(posixcc, "print", 5))
2809 complement ? ANYOF_NPRINT : ANYOF_PRINT;
2810 else if (strnEQ(posixcc, "punct", 5))
2812 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
2815 if (strnEQ(posixcc, "space", 5))
2817 complement ? ANYOF_NSPACE : ANYOF_SPACE;
2820 if (strnEQ(posixcc, "upper", 5))
2822 complement ? ANYOF_NUPPER : ANYOF_UPPER;
2824 case 'w': /* this is not POSIX, this is the Perl \w */
2825 if (strnEQ(posixcc, "word", 4)) {
2827 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
2832 if (strnEQ(posixcc, "xdigit", 6)) {
2834 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
2839 if (namedclass == OOB_NAMEDCLASS ||
2840 posixcc[skip] != ':' ||
2841 posixcc[skip+1] != ']')
2843 "Character class [:%.*s:] unknown",
2845 } else if (!SIZE_ONLY)
2846 /* [[=foo=]] and [[.foo.]] are still future. */
2848 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2850 /* Maternal grandfather:
2851 * "[:" ending in ":" but not in ":]" */
2852 PL_regcomp_parse = s;
2861 S_checkposixcc(pTHX)
2863 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
2864 (*PL_regcomp_parse == ':' ||
2865 *PL_regcomp_parse == '=' ||
2866 *PL_regcomp_parse == '.')) {
2867 char *s = PL_regcomp_parse;
2870 while(*s && isALNUM(*s))
2872 if (*s && c == *s && s[1] == ']') {
2873 Perl_warner(aTHX_ WARN_REGEXP,
2874 "Character class syntax [%c %c] belongs inside character classes", c, c);
2875 if (c == '=' || c == '.')
2877 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2887 register I32 lastvalue = OOB_CHAR8;
2888 register I32 range = 0;
2889 register regnode *ret;
2893 bool need_class = 0;
2895 ret = reg_node(ANYOF);
2897 PL_regsize += ANYOF_SKIP;
2900 ANYOF_BITMAP_ZERO(ret);
2901 PL_regcode += ANYOF_SKIP;
2903 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
2905 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
2907 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2911 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
2914 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
2917 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2918 goto skipcond; /* allow 1st char to be ] or - */
2919 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2921 namedclass = OOB_NAMEDCLASS;
2923 rangebegin = PL_regcomp_parse;
2924 value = UCHARAT(PL_regcomp_parse++);
2926 namedclass = regpposixcc(value);
2927 else if (value == '\\') {
2928 value = UCHARAT(PL_regcomp_parse++);
2929 /* Some compilers cannot handle switching on 64-bit integer
2930 * values, therefore value cannot be an UV. --jhi */
2932 case 'w': namedclass = ANYOF_ALNUM; break;
2933 case 'W': namedclass = ANYOF_NALNUM; break;
2934 case 's': namedclass = ANYOF_SPACE; break;
2935 case 'S': namedclass = ANYOF_NSPACE; break;
2936 case 'd': namedclass = ANYOF_DIGIT; break;
2937 case 'D': namedclass = ANYOF_NDIGIT; break;
2938 case 'n': value = '\n'; break;
2939 case 'r': value = '\r'; break;
2940 case 't': value = '\t'; break;
2941 case 'f': value = '\f'; break;
2942 case 'b': value = '\b'; break;
2944 case 'e': value = '\033'; break;
2945 case 'a': value = '\007'; break;
2947 case 'e': value = '\047'; break;
2948 case 'a': value = '\057'; break;
2951 numlen = 0; /* disallow underscores */
2952 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
2953 PL_regcomp_parse += numlen;
2956 value = UCHARAT(PL_regcomp_parse++);
2957 value = toCTRL(value);
2959 case '0': case '1': case '2': case '3': case '4':
2960 case '5': case '6': case '7': case '8': case '9':
2961 numlen = 0; /* disallow underscores */
2962 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
2963 PL_regcomp_parse += numlen;
2966 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
2967 Perl_warner(aTHX_ WARN_REGEXP,
2968 "/%.127s/: Unrecognized escape \\%c in character class passed through",
2974 if (namedclass > OOB_NAMEDCLASS) {
2975 if (!need_class && !SIZE_ONLY)
2976 ANYOF_CLASS_ZERO(ret);
2978 if (range) { /* a-\d, a-[:digit:] */
2980 if (ckWARN(WARN_REGEXP))
2981 Perl_warner(aTHX_ WARN_REGEXP,
2982 "/%.127s/: false [] range \"%*.*s\" in regexp",
2984 PL_regcomp_parse - rangebegin,
2985 PL_regcomp_parse - rangebegin,
2987 ANYOF_BITMAP_SET(ret, lastvalue);
2988 ANYOF_BITMAP_SET(ret, '-');
2990 range = 0; /* this is not a true range */
2993 switch (namedclass) {
2996 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
2998 for (value = 0; value < 256; value++)
3000 ANYOF_BITMAP_SET(ret, value);
3005 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3007 for (value = 0; value < 256; value++)
3008 if (!isALNUM(value))
3009 ANYOF_BITMAP_SET(ret, value);
3014 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3016 for (value = 0; value < 256; value++)
3018 ANYOF_BITMAP_SET(ret, value);
3023 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3025 for (value = 0; value < 256; value++)
3026 if (!isSPACE(value))
3027 ANYOF_BITMAP_SET(ret, value);
3032 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3034 for (value = '0'; value <= '9'; value++)
3035 ANYOF_BITMAP_SET(ret, value);
3040 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3042 for (value = 0; value < '0'; value++)
3043 ANYOF_BITMAP_SET(ret, value);
3044 for (value = '9' + 1; value < 256; value++)
3045 ANYOF_BITMAP_SET(ret, value);
3050 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3052 for (value = 0; value < 256; value++)
3053 if (!isALNUMC(value))
3054 ANYOF_BITMAP_SET(ret, value);
3059 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3061 for (value = 0; value < 256; value++)
3062 if (isALNUMC(value))
3063 ANYOF_BITMAP_SET(ret, value);
3068 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3070 for (value = 0; value < 256; value++)
3072 ANYOF_BITMAP_SET(ret, value);
3077 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3079 for (value = 0; value < 256; value++)
3080 if (!isALPHA(value))
3081 ANYOF_BITMAP_SET(ret, value);
3086 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3089 for (value = 0; value < 128; value++)
3090 ANYOF_BITMAP_SET(ret, value);
3092 for (value = 0; value < 256; value++)
3094 ANYOF_BITMAP_SET(ret, value);
3100 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3103 for (value = 128; value < 256; value++)
3104 ANYOF_BITMAP_SET(ret, value);
3106 for (value = 0; value < 256; value++)
3107 if (!isASCII(value))
3108 ANYOF_BITMAP_SET(ret, value);
3114 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3116 for (value = 0; value < 256; value++)
3118 ANYOF_BITMAP_SET(ret, value);
3120 lastvalue = OOB_CHAR8;
3124 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3126 for (value = 0; value < 256; value++)
3127 if (!isCNTRL(value))
3128 ANYOF_BITMAP_SET(ret, value);
3133 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3135 for (value = 0; value < 256; value++)
3137 ANYOF_BITMAP_SET(ret, value);
3142 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3144 for (value = 0; value < 256; value++)
3145 if (!isGRAPH(value))
3146 ANYOF_BITMAP_SET(ret, value);
3151 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3153 for (value = 0; value < 256; value++)
3155 ANYOF_BITMAP_SET(ret, value);
3160 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3162 for (value = 0; value < 256; value++)
3163 if (!isLOWER(value))
3164 ANYOF_BITMAP_SET(ret, value);
3169 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3171 for (value = 0; value < 256; value++)
3173 ANYOF_BITMAP_SET(ret, value);
3178 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3180 for (value = 0; value < 256; value++)
3181 if (!isPRINT(value))
3182 ANYOF_BITMAP_SET(ret, value);
3187 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3189 for (value = 0; value < 256; value++)
3191 ANYOF_BITMAP_SET(ret, value);
3196 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3198 for (value = 0; value < 256; value++)
3199 if (!isPUNCT(value))
3200 ANYOF_BITMAP_SET(ret, value);
3205 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3207 for (value = 0; value < 256; value++)
3209 ANYOF_BITMAP_SET(ret, value);
3214 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3216 for (value = 0; value < 256; value++)
3217 if (!isUPPER(value))
3218 ANYOF_BITMAP_SET(ret, value);
3223 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3225 for (value = 0; value < 256; value++)
3226 if (isXDIGIT(value))
3227 ANYOF_BITMAP_SET(ret, value);
3232 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3234 for (value = 0; value < 256; value++)
3235 if (!isXDIGIT(value))
3236 ANYOF_BITMAP_SET(ret, value);
3240 FAIL("invalid [::] class in regexp");
3244 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3249 if (lastvalue > value) /* b-a */ {
3251 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3253 PL_regcomp_parse - rangebegin,
3254 PL_regcomp_parse - rangebegin,
3261 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3262 PL_regcomp_parse[1] != ']') {
3264 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3265 if (ckWARN(WARN_REGEXP))
3266 Perl_warner(aTHX_ WARN_REGEXP,
3267 "/%.127s/: false [] range \"%*.*s\" in regexp",
3269 PL_regcomp_parse - rangebegin,
3270 PL_regcomp_parse - rangebegin,
3273 ANYOF_BITMAP_SET(ret, '-');
3276 continue; /* do it next time */
3279 /* now is the next time */
3281 #ifndef ASCIIish /* EBCDIC, for example. */
3282 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3283 (isUPPER(lastvalue) && isUPPER(value)))
3286 if (isLOWER(lastvalue)) {
3287 for (i = lastvalue; i <= value; i++)
3289 ANYOF_BITMAP_SET(ret, i);
3291 for (i = lastvalue; i <= value; i++)
3293 ANYOF_BITMAP_SET(ret, i);
3298 for ( ; lastvalue <= value; lastvalue++)
3299 ANYOF_BITMAP_SET(ret, lastvalue);
3305 PL_regsize += ANYOF_CLASS_ADD_SKIP;
3307 PL_regcode += ANYOF_CLASS_ADD_SKIP;
3309 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3311 (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
3312 for (value = 0; value < 256; ++value) {
3313 if (ANYOF_BITMAP_TEST(ret, value)) {
3314 I32 cf = PL_fold[value];
3315 ANYOF_BITMAP_SET(ret, cf);
3318 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3320 /* optimize inverted simple patterns (e.g. [^a-z]) */
3321 if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3322 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3323 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3324 ANYOF_FLAGS(ret) = 0;
3330 S_regclassutf8(pTHX)
3335 register U32 lastvalue = OOB_UTF8;
3336 register I32 range = 0;
3337 register regnode *ret;
3345 if (*PL_regcomp_parse == '^') { /* Complement of range. */
3349 flags |= ANYOF_INVERT;
3353 flags |= ANYOF_FOLD;
3355 flags |= ANYOF_LOCALE;
3356 listsv = newSVpvn("# comment\n",10);
3359 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3362 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
3363 goto skipcond; /* allow 1st char to be ] or - */
3365 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
3367 namedclass = OOB_NAMEDCLASS;
3369 rangebegin = PL_regcomp_parse;
3370 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3371 PL_regcomp_parse += numlen;
3373 namedclass = regpposixcc(value);
3374 else if (value == '\\') {
3375 value = (U32)utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3376 PL_regcomp_parse += numlen;
3377 /* Some compilers cannot handle switching on 64-bit integer
3378 * values, therefore value cannot be an UV. Yes, this will
3379 * be a problem later if we want switch on Unicode. --jhi */
3381 case 'w': namedclass = ANYOF_ALNUM; break;
3382 case 'W': namedclass = ANYOF_NALNUM; break;
3383 case 's': namedclass = ANYOF_SPACE; break;
3384 case 'S': namedclass = ANYOF_NSPACE; break;
3385 case 'd': namedclass = ANYOF_DIGIT; break;
3386 case 'D': namedclass = ANYOF_NDIGIT; break;
3389 if (*PL_regcomp_parse == '{') {
3390 e = strchr(PL_regcomp_parse++, '}');
3392 FAIL("Missing right brace on \\p{}");
3393 n = e - PL_regcomp_parse;
3396 e = PL_regcomp_parse;
3401 Perl_sv_catpvf(aTHX_ listsv,
3402 "+utf8::%.*s\n", (int)n, PL_regcomp_parse);
3404 Perl_sv_catpvf(aTHX_ listsv,
3405 "!utf8::%.*s\n", (int)n, PL_regcomp_parse);
3407 PL_regcomp_parse = e + 1;
3408 lastvalue = OOB_UTF8;
3410 case 'n': value = '\n'; break;
3411 case 'r': value = '\r'; break;
3412 case 't': value = '\t'; break;
3413 case 'f': value = '\f'; break;
3414 case 'b': value = '\b'; break;
3416 case 'e': value = '\033'; break;
3417 case 'a': value = '\007'; break;
3419 case 'e': value = '\047'; break;
3420 case 'a': value = '\057'; break;
3423 if (*PL_regcomp_parse == '{') {
3424 e = strchr(PL_regcomp_parse++, '}');
3426 FAIL("Missing right brace on \\x{}");
3427 numlen = 1; /* allow underscores */
3428 value = (UV)scan_hex(PL_regcomp_parse,
3429 e - PL_regcomp_parse,
3431 PL_regcomp_parse = e + 1;
3434 numlen = 0; /* disallow underscores */
3435 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
3436 PL_regcomp_parse += numlen;
3440 value = UCHARAT(PL_regcomp_parse++);
3441 value = toCTRL(value);
3443 case '0': case '1': case '2': case '3': case '4':
3444 case '5': case '6': case '7': case '8': case '9':
3445 numlen = 0; /* disallow underscores */
3446 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
3447 PL_regcomp_parse += numlen;
3450 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3451 Perl_warner(aTHX_ WARN_REGEXP,
3452 "/%.127s/: Unrecognized escape \\%c in character class passed through",
3458 if (namedclass > OOB_NAMEDCLASS) {
3459 if (range) { /* a-\d, a-[:digit:] */
3461 if (ckWARN(WARN_REGEXP))
3462 Perl_warner(aTHX_ WARN_REGEXP,
3463 "/%.127s/: false [] range \"%*.*s\" in regexp",
3465 PL_regcomp_parse - rangebegin,
3466 PL_regcomp_parse - rangebegin,
3468 Perl_sv_catpvf(aTHX_ listsv,
3469 /* 0x002D is Unicode for '-' */
3470 "%04"UVxf"\n002D\n", (UV)lastvalue);
3475 switch (namedclass) {
3477 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
3479 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
3481 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
3483 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
3485 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
3487 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
3489 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
3491 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
3493 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
3495 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
3497 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
3499 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
3501 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
3503 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
3505 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
3507 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
3509 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
3511 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
3513 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
3515 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
3517 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
3519 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
3521 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
3523 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
3525 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
3527 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
3533 if (lastvalue > value) { /* b-a */
3535 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3537 PL_regcomp_parse - rangebegin,
3538 PL_regcomp_parse - rangebegin,
3545 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3546 PL_regcomp_parse[1] != ']') {
3548 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3549 if (ckWARN(WARN_REGEXP))
3550 Perl_warner(aTHX_ WARN_REGEXP,
3551 "/%.127s/: false [] range \"%*.*s\" in regexp",
3553 PL_regcomp_parse - rangebegin,
3554 PL_regcomp_parse - rangebegin,
3557 Perl_sv_catpvf(aTHX_ listsv,
3558 /* 0x002D is Unicode for '-' */
3562 continue; /* do it next time */
3565 /* now is the next time */
3567 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3568 (UV)lastvalue, (UV)value);
3572 ret = reganode(ANYOFUTF8, 0);
3575 SV *rv = swash_init("utf8", "", listsv, 1, 0);
3576 SvREFCNT_dec(listsv);
3577 n = add_data(1,"s");
3578 PL_regcomp_rx->data->data[n] = (void*)rv;
3579 ARG1_SET(ret, flags);
3590 char* retval = PL_regcomp_parse++;
3593 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
3594 PL_regcomp_parse[2] == '#') {
3595 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
3600 if (PL_regflags & PMf_EXTENDED) {
3601 if (isSPACE(*PL_regcomp_parse)) {
3605 else if (*PL_regcomp_parse == '#') {
3606 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
3617 - reg_node - emit a node
3619 STATIC regnode * /* Location. */
3620 S_reg_node(pTHX_ U8 op)
3623 register regnode *ret;
3624 register regnode *ptr;
3628 SIZE_ALIGN(PL_regsize);
3633 NODE_ALIGN_FILL(ret);
3635 FILL_ADVANCE_NODE(ptr, op);
3642 - reganode - emit a node with an argument
3644 STATIC regnode * /* Location. */
3645 S_reganode(pTHX_ U8 op, U32 arg)
3648 register regnode *ret;
3649 register regnode *ptr;
3653 SIZE_ALIGN(PL_regsize);
3658 NODE_ALIGN_FILL(ret);
3660 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3667 - reguni - emit (if appropriate) a Unicode character
3670 S_reguni(pTHX_ UV uv, char* s, I32* lenp)
3674 U8 tmpbuf[UTF8_MAXLEN];
3675 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
3678 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
3683 - reginsert - insert an operator in front of already-emitted operand
3685 * Means relocating the operand.
3688 S_reginsert(pTHX_ U8 op, regnode *opnd)
3691 register regnode *src;
3692 register regnode *dst;
3693 register regnode *place;
3694 register int offset = regarglen[(U8)op];
3696 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3699 PL_regsize += NODE_STEP_REGNODE + offset;
3704 PL_regcode += NODE_STEP_REGNODE + offset;
3707 StructCopy(--src, --dst, regnode);
3709 place = opnd; /* Op node, where operand used to be. */
3710 src = NEXTOPER(place);
3711 FILL_ADVANCE_NODE(place, op);
3712 Zero(src, offset, regnode);
3716 - regtail - set the next-pointer at the end of a node chain of p to val.
3719 S_regtail(pTHX_ regnode *p, regnode *val)
3722 register regnode *scan;
3723 register regnode *temp;
3728 /* Find last node. */
3731 temp = regnext(scan);
3737 if (reg_off_by_arg[OP(scan)]) {
3738 ARG_SET(scan, val - scan);
3741 NEXT_OFF(scan) = val - scan;
3746 - regoptail - regtail on operand of first argument; nop if operandless
3749 S_regoptail(pTHX_ regnode *p, regnode *val)
3752 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3753 if (p == NULL || SIZE_ONLY)
3755 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3756 regtail(NEXTOPER(p), val);
3758 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3759 regtail(NEXTOPER(NEXTOPER(p)), val);
3766 - regcurly - a little FSA that accepts {\d+,?\d*}
3769 S_regcurly(pTHX_ register char *s)
3788 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
3791 register U8 op = EXACT; /* Arbitrary non-END op. */
3792 register regnode *next;
3794 while (op != END && (!last || node < last)) {
3795 /* While that wasn't END last time... */
3801 next = regnext(node);
3803 if (OP(node) == OPTIMIZED)
3806 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
3807 (int)(2*l + 1), "", SvPVX(sv));
3808 if (next == NULL) /* Next ptr. */
3809 PerlIO_printf(Perl_debug_log, "(0)");
3811 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
3812 (void)PerlIO_putc(Perl_debug_log, '\n');
3814 if (PL_regkind[(U8)op] == BRANCHJ) {
3815 register regnode *nnode = (OP(next) == LONGJMP
3818 if (last && nnode > last)
3820 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
3822 else if (PL_regkind[(U8)op] == BRANCH) {
3823 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
3825 else if ( op == CURLY) { /* `next' might be very big: optimizer */
3826 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3827 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
3829 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
3830 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3833 else if ( op == PLUS || op == STAR) {
3834 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
3836 else if (op == ANYOF) {
3837 node = NEXTOPER(node);
3840 else if (PL_regkind[(U8)op] == EXACT) {
3841 /* Literal string, where present. */
3842 node += NODE_SZ_STR(node) - 1;
3843 node = NEXTOPER(node);
3846 node = NEXTOPER(node);
3847 node += regarglen[(U8)op];
3849 if (op == CURLYX || op == OPEN)
3851 else if (op == WHILEM)
3854 #endif /* DEBUGGING */
3859 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
3862 Perl_regdump(pTHX_ regexp *r)
3866 SV *sv = sv_newmortal();
3868 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
3870 /* Header fields of interest. */
3871 if (r->anchored_substr)
3872 PerlIO_printf(Perl_debug_log,
3873 "anchored `%s%.*s%s'%s at %"IVdf" ",
3875 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
3876 SvPVX(r->anchored_substr),
3878 SvTAIL(r->anchored_substr) ? "$" : "",
3879 (IV)r->anchored_offset);
3880 if (r->float_substr)
3881 PerlIO_printf(Perl_debug_log,
3882 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
3884 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
3885 SvPVX(r->float_substr),
3887 SvTAIL(r->float_substr) ? "$" : "",
3888 (IV)r->float_min_offset, (UV)r->float_max_offset);
3889 if (r->check_substr)
3890 PerlIO_printf(Perl_debug_log,
3891 r->check_substr == r->float_substr
3892 ? "(checking floating" : "(checking anchored");
3893 if (r->reganch & ROPT_NOSCAN)
3894 PerlIO_printf(Perl_debug_log, " noscan");
3895 if (r->reganch & ROPT_CHECK_ALL)
3896 PerlIO_printf(Perl_debug_log, " isall");
3897 if (r->check_substr)
3898 PerlIO_printf(Perl_debug_log, ") ");
3900 if (r->regstclass) {
3901 regprop(sv, r->regstclass);
3902 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
3904 if (r->reganch & ROPT_ANCH) {
3905 PerlIO_printf(Perl_debug_log, "anchored");
3906 if (r->reganch & ROPT_ANCH_BOL)
3907 PerlIO_printf(Perl_debug_log, "(BOL)");
3908 if (r->reganch & ROPT_ANCH_MBOL)
3909 PerlIO_printf(Perl_debug_log, "(MBOL)");
3910 if (r->reganch & ROPT_ANCH_SBOL)
3911 PerlIO_printf(Perl_debug_log, "(SBOL)");
3912 if (r->reganch & ROPT_ANCH_GPOS)
3913 PerlIO_printf(Perl_debug_log, "(GPOS)");
3914 PerlIO_putc(Perl_debug_log, ' ');
3916 if (r->reganch & ROPT_GPOS_SEEN)
3917 PerlIO_printf(Perl_debug_log, "GPOS ");
3918 if (r->reganch & ROPT_SKIP)
3919 PerlIO_printf(Perl_debug_log, "plus ");
3920 if (r->reganch & ROPT_IMPLICIT)
3921 PerlIO_printf(Perl_debug_log, "implicit ");
3922 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
3923 if (r->reganch & ROPT_EVAL_SEEN)
3924 PerlIO_printf(Perl_debug_log, "with eval ");
3925 PerlIO_printf(Perl_debug_log, "\n");
3926 #endif /* DEBUGGING */
3930 S_put_byte(pTHX_ SV *sv, int c)
3932 if (c <= ' ' || c == 127 || c == 255)
3933 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
3934 else if (c == '-' || c == ']' || c == '\\' || c == '^')
3935 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
3937 Perl_sv_catpvf(aTHX_ sv, "%c", c);
3941 - regprop - printable representation of opcode
3944 Perl_regprop(pTHX_ SV *sv, regnode *o)
3950 sv_setpvn(sv, "", 0);
3951 if (OP(o) >= reg_num) /* regnode.type is unsigned */
3952 FAIL("corrupted regexp opcode");
3953 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
3955 k = PL_regkind[(U8)OP(o)];
3958 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
3959 STR_LEN(o), STRING(o), PL_colors[1]);
3960 else if (k == CURLY) {
3961 if (OP(o) == CURLYM || OP(o) == CURLYN)
3962 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
3963 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
3965 else if (k == WHILEM && o->flags) /* Ordinal/of */
3966 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
3967 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
3968 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
3969 else if (k == LOGICAL)
3970 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
3971 else if (k == ANYOF) {
3972 int i, rangestart = -1;
3973 const char * const out[] = { /* Should be syncronized with
3974 a table in regcomp.h */
4003 if (o->flags & ANYOF_LOCALE)
4004 sv_catpv(sv, "{loc}");
4005 if (o->flags & ANYOF_FOLD)
4006 sv_catpv(sv, "{i}");
4007 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4008 if (o->flags & ANYOF_INVERT)
4010 for (i = 0; i <= 256; i++) {
4011 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4012 if (rangestart == -1)
4014 } else if (rangestart != -1) {
4015 if (i <= rangestart + 3)
4016 for (; rangestart < i; rangestart++)
4017 put_byte(sv, rangestart);
4019 put_byte(sv, rangestart);
4021 put_byte(sv, i - 1);
4026 if (o->flags & ANYOF_CLASS)
4027 for (i = 0; i < sizeof(out)/sizeof(char*); i++)
4028 if (ANYOF_CLASS_TEST(o,i))
4029 sv_catpv(sv, out[i]);
4030 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4032 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4033 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4034 #endif /* DEBUGGING */
4038 Perl_re_intuit_string(pTHX_ regexp *prog)
4039 { /* Assume that RE_INTUIT is set */
4042 char *s = SvPV(prog->check_substr,n_a);
4044 if (!PL_colorset) reginitcolors();
4045 PerlIO_printf(Perl_debug_log,
4046 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4047 PL_colors[4],PL_colors[5],PL_colors[0],
4050 (strlen(s) > 60 ? "..." : ""));
4053 return prog->check_substr;
4057 Perl_pregfree(pTHX_ struct regexp *r)
4060 DEBUG_r(if (!PL_colorset) reginitcolors());
4062 if (!r || (--r->refcnt > 0))
4064 DEBUG_r(PerlIO_printf(Perl_debug_log,
4065 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4066 PL_colors[4],PL_colors[5],PL_colors[0],
4069 (strlen(r->precomp) > 60 ? "..." : "")));
4072 Safefree(r->precomp);
4073 if (RX_MATCH_COPIED(r))
4074 Safefree(r->subbeg);
4076 if (r->anchored_substr)
4077 SvREFCNT_dec(r->anchored_substr);
4078 if (r->float_substr)
4079 SvREFCNT_dec(r->float_substr);
4080 Safefree(r->substrs);
4083 int n = r->data->count;
4084 AV* new_comppad = NULL;
4089 switch (r->data->what[n]) {
4091 SvREFCNT_dec((SV*)r->data->data[n]);
4094 Safefree(r->data->data[n]);
4097 new_comppad = (AV*)r->data->data[n];
4100 if (new_comppad == NULL)
4101 Perl_croak(aTHX_ "panic: pregfree comppad");
4102 old_comppad = PL_comppad;
4103 old_curpad = PL_curpad;
4104 PL_comppad = new_comppad;
4105 PL_curpad = AvARRAY(new_comppad);
4106 op_free((OP_4tree*)r->data->data[n]);
4107 PL_comppad = old_comppad;
4108 PL_curpad = old_curpad;
4109 SvREFCNT_dec((SV*)new_comppad);
4115 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
4118 Safefree(r->data->what);
4121 Safefree(r->startp);
4127 - regnext - dig the "next" pointer out of a node
4129 * [Note, when REGALIGN is defined there are two places in regmatch()
4130 * that bypass this code for speed.]
4133 Perl_regnext(pTHX_ register regnode *p)
4136 register I32 offset;
4138 if (p == &PL_regdummy)
4141 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4149 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4152 STRLEN l1 = strlen(pat1);
4153 STRLEN l2 = strlen(pat2);
4162 Copy(pat1, buf, l1 , char);
4163 Copy(pat2, buf + l1, l2 , char);
4164 buf[l1 + l2] = '\n';
4165 buf[l1 + l2 + 1] = '\0';
4167 /* ANSI variant takes additional second argument */
4168 va_start(args, pat2);
4172 msv = vmess(buf, &args);
4174 message = SvPV(msv,l1);
4177 Copy(message, buf, l1 , char);
4178 buf[l1] = '\0'; /* Overwrite \n */
4179 Perl_croak(aTHX_ "%s", buf);
4182 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4185 Perl_save_re_context(pTHX)
4189 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
4190 SAVEI32(PL_regnpar); /* () count. */
4191 SAVEI32(PL_regsize); /* Code size. */
4192 SAVEI16(PL_regflags); /* are we folding, multilining? */
4193 SAVEPPTR(PL_reginput); /* String-input pointer. */
4194 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4195 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4196 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4197 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4198 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4199 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4200 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4201 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4202 PL_reg_start_tmp = 0;
4203 SAVEFREEPV(PL_reg_start_tmp);
4204 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4205 PL_reg_start_tmpl = 0;
4206 SAVEVPTR(PL_regdata);
4207 SAVEI32(PL_reg_flags); /* from regexec.c */
4208 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4209 SAVEI32(PL_regnarrate); /* from regexec.c */
4210 SAVEVPTR(PL_regprogram); /* from regexec.c */
4211 SAVEINT(PL_regindent); /* from regexec.c */
4212 SAVEVPTR(PL_regcc); /* from regexec.c */
4213 SAVEVPTR(PL_curcop);
4214 SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */
4215 SAVEI32(PL_regseen); /* from regcomp.c */
4216 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
4217 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
4218 SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
4219 SAVEPPTR(PL_regxend); /* End of input for compile */
4220 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
4221 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4222 SAVEVPTR(PL_reg_re); /* from regexec.c */
4223 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4224 SAVESPTR(PL_reg_sv); /* from regexec.c */
4225 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4226 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4227 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4228 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4230 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4241 clear_re(pTHXo_ void *r)
4243 ReREFCNT_dec((regexp *)r);