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)
208 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
209 Perl_croak(aTHX_ "%s at {#} mark in regex m/%.*s{#}%s/", m, \
210 strlen(PL_regprecomp)-(PL_regxend - PL_regcomp_parse), \
212 PL_regprecomp + strlen(PL_regprecomp)-(PL_regxend - PL_regcomp_parse));\
215 #define vFAIL2(pat,m) \
218 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
220 S_re_croak2(aTHX_ pat, " at {#} mark in regex m/%.*s{#}%s/: ", m, \
221 strlen(PL_regprecomp)-(PL_regxend - PL_regcomp_parse), \
223 PL_regprecomp + strlen(PL_regprecomp)-(PL_regxend - PL_regcomp_parse));\
228 /* Allow for side effects in s */
229 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END
231 static void clear_re(pTHXo_ void *r);
233 /* Mark that we cannot extend a found fixed substring at this point.
234 Updata the longest found anchored substring and the longest found
235 floating substrings if needed. */
238 S_scan_commit(pTHX_ scan_data_t *data)
241 STRLEN l = CHR_SVLEN(data->last_found);
242 STRLEN old_l = CHR_SVLEN(*data->longest);
244 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
245 sv_setsv(*data->longest, data->last_found);
246 if (*data->longest == data->longest_fixed) {
247 data->offset_fixed = l ? data->last_start_min : data->pos_min;
248 if (data->flags & SF_BEFORE_EOL)
250 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
252 data->flags &= ~SF_FIX_BEFORE_EOL;
255 data->offset_float_min = l ? data->last_start_min : data->pos_min;
256 data->offset_float_max = (l
257 ? data->last_start_max
258 : data->pos_min + data->pos_delta);
259 if (data->flags & SF_BEFORE_EOL)
261 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
263 data->flags &= ~SF_FL_BEFORE_EOL;
266 SvCUR_set(data->last_found, 0);
268 data->flags &= ~SF_BEFORE_EOL;
271 /* Can match anything (initialization) */
273 S_cl_anything(pTHX_ struct regnode_charclass_class *cl)
277 ANYOF_CLASS_ZERO(cl);
278 for (value = 0; value < 256; ++value)
279 ANYOF_BITMAP_SET(cl, value);
280 cl->flags = ANYOF_EOS;
282 cl->flags |= ANYOF_LOCALE;
285 /* Can match anything (initialization) */
287 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
291 for (value = 0; value < ANYOF_MAX; value += 2)
292 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
294 for (value = 0; value < 256; ++value)
295 if (!ANYOF_BITMAP_TEST(cl, value))
300 /* Can match anything (initialization) */
302 S_cl_init(pTHX_ struct regnode_charclass_class *cl)
304 Zero(cl, 1, struct regnode_charclass_class);
310 S_cl_init_zero(pTHX_ struct regnode_charclass_class *cl)
312 Zero(cl, 1, struct regnode_charclass_class);
316 cl->flags |= ANYOF_LOCALE;
319 /* 'And' a given class with another one. Can create false positives */
320 /* We assume that cl is not inverted */
322 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
323 struct regnode_charclass_class *and_with)
325 if (!(and_with->flags & ANYOF_CLASS)
326 && !(cl->flags & ANYOF_CLASS)
327 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
328 && !(and_with->flags & ANYOF_FOLD)
329 && !(cl->flags & ANYOF_FOLD)) {
332 if (and_with->flags & ANYOF_INVERT)
333 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
334 cl->bitmap[i] &= ~and_with->bitmap[i];
336 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
337 cl->bitmap[i] &= and_with->bitmap[i];
338 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
339 if (!(and_with->flags & ANYOF_EOS))
340 cl->flags &= ~ANYOF_EOS;
343 /* 'OR' a given class with another one. Can create false positives */
344 /* We assume that cl is not inverted */
346 S_cl_or(pTHX_ struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
348 if (or_with->flags & ANYOF_INVERT) {
350 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
351 * <= (B1 | !B2) | (CL1 | !CL2)
352 * which is wasteful if CL2 is small, but we ignore CL2:
353 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
354 * XXXX Can we handle case-fold? Unclear:
355 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
356 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
358 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
359 && !(or_with->flags & ANYOF_FOLD)
360 && !(cl->flags & ANYOF_FOLD) ) {
363 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
364 cl->bitmap[i] |= ~or_with->bitmap[i];
365 } /* XXXX: logic is complicated otherwise */
370 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
371 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
372 && (!(or_with->flags & ANYOF_FOLD)
373 || (cl->flags & ANYOF_FOLD)) ) {
376 /* OR char bitmap and class bitmap separately */
377 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
378 cl->bitmap[i] |= or_with->bitmap[i];
379 if (or_with->flags & ANYOF_CLASS) {
380 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
381 cl->classflags[i] |= or_with->classflags[i];
382 cl->flags |= ANYOF_CLASS;
385 else { /* XXXX: logic is complicated, leave it along for a moment. */
389 if (or_with->flags & ANYOF_EOS)
390 cl->flags |= ANYOF_EOS;
393 /* REx optimizer. Converts nodes into quickier variants "in place".
394 Finds fixed substrings. */
396 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
397 to the position after last scanned or to NULL. */
400 S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
401 /* scanp: Start here (read-write). */
402 /* deltap: Write maxlen-minlen here. */
403 /* last: Stop before this one. */
406 I32 min = 0, pars = 0, code;
407 regnode *scan = *scanp, *next;
409 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
410 int is_inf_internal = 0; /* The studied chunk is infinite */
411 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
412 scan_data_t data_fake;
413 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
415 while (scan && OP(scan) != END && scan < last) {
416 /* Peephole optimizer: */
418 if (PL_regkind[(U8)OP(scan)] == EXACT) {
419 /* Merge several consecutive EXACTish nodes into one. */
420 regnode *n = regnext(scan);
423 regnode *stop = scan;
426 next = scan + NODE_SZ_STR(scan);
427 /* Skip NOTHING, merge EXACT*. */
429 ( PL_regkind[(U8)OP(n)] == NOTHING ||
430 (stringok && (OP(n) == OP(scan))))
432 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
433 if (OP(n) == TAIL || n > next)
435 if (PL_regkind[(U8)OP(n)] == NOTHING) {
436 NEXT_OFF(scan) += NEXT_OFF(n);
437 next = n + NODE_STEP_REGNODE;
445 int oldl = STR_LEN(scan);
446 regnode *nnext = regnext(n);
448 if (oldl + STR_LEN(n) > U8_MAX)
450 NEXT_OFF(scan) += NEXT_OFF(n);
451 STR_LEN(scan) += STR_LEN(n);
452 next = n + NODE_SZ_STR(n);
453 /* Now we can overwrite *n : */
454 Move(STRING(n), STRING(scan) + oldl,
465 n = scan + NODE_SZ_STR(scan);
467 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
475 /* Follow the next-chain of the current node and optimize
476 away all the NOTHINGs from it. */
477 if (OP(scan) != CURLYX) {
478 int max = (reg_off_by_arg[OP(scan)]
480 /* I32 may be smaller than U16 on CRAYs! */
481 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
482 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
486 /* Skip NOTHING and LONGJMP. */
487 while ((n = regnext(n))
488 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
489 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
492 if (reg_off_by_arg[OP(scan)])
495 NEXT_OFF(scan) = off;
497 /* The principal pseudo-switch. Cannot be a switch, since we
498 look into several different things. */
499 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
500 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
501 next = regnext(scan);
504 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
505 I32 max1 = 0, min1 = I32_MAX, num = 0;
506 struct regnode_charclass_class accum;
508 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
509 scan_commit(data); /* Cannot merge strings after this. */
510 if (flags & SCF_DO_STCLASS)
511 cl_init_zero(&accum);
512 while (OP(scan) == code) {
513 I32 deltanext, minnext, f = 0;
514 struct regnode_charclass_class this_class;
519 data_fake.whilem_c = data->whilem_c;
520 next = regnext(scan);
521 scan = NEXTOPER(scan);
523 scan = NEXTOPER(scan);
524 if (flags & SCF_DO_STCLASS) {
525 cl_init(&this_class);
526 data_fake.start_class = &this_class;
527 f = SCF_DO_STCLASS_AND;
529 /* we suppose the run is continuous, last=next...*/
530 minnext = study_chunk(&scan, &deltanext, next,
534 if (max1 < minnext + deltanext)
535 max1 = minnext + deltanext;
536 if (deltanext == I32_MAX)
537 is_inf = is_inf_internal = 1;
539 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
541 if (data && (data_fake.flags & SF_HAS_EVAL))
542 data->flags |= SF_HAS_EVAL;
544 data->whilem_c = data_fake.whilem_c;
545 if (flags & SCF_DO_STCLASS)
546 cl_or(&accum, &this_class);
550 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
552 if (flags & SCF_DO_SUBSTR) {
553 data->pos_min += min1;
554 data->pos_delta += max1 - min1;
555 if (max1 != min1 || is_inf)
556 data->longest = &(data->longest_float);
559 delta += max1 - min1;
560 if (flags & SCF_DO_STCLASS_OR) {
561 cl_or(data->start_class, &accum);
563 cl_and(data->start_class, &and_with);
564 flags &= ~SCF_DO_STCLASS;
567 else if (flags & SCF_DO_STCLASS_AND) {
569 cl_and(data->start_class, &accum);
570 flags &= ~SCF_DO_STCLASS;
573 /* Switch to OR mode: cache the old value of
574 * data->start_class */
575 StructCopy(data->start_class, &and_with,
576 struct regnode_charclass_class);
577 flags &= ~SCF_DO_STCLASS_AND;
578 StructCopy(&accum, data->start_class,
579 struct regnode_charclass_class);
580 flags |= SCF_DO_STCLASS_OR;
581 data->start_class->flags |= ANYOF_EOS;
585 else if (code == BRANCHJ) /* single branch is optimized. */
586 scan = NEXTOPER(NEXTOPER(scan));
587 else /* single branch is optimized. */
588 scan = NEXTOPER(scan);
591 else if (OP(scan) == EXACT) {
592 I32 l = STR_LEN(scan);
594 unsigned char *s = (unsigned char *)STRING(scan);
595 unsigned char *e = s + l;
604 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
605 /* The code below prefers earlier match for fixed
606 offset, later match for variable offset. */
607 if (data->last_end == -1) { /* Update the start info. */
608 data->last_start_min = data->pos_min;
609 data->last_start_max = is_inf
610 ? I32_MAX : data->pos_min + data->pos_delta;
612 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
613 data->last_end = data->pos_min + l;
614 data->pos_min += l; /* As in the first entry. */
615 data->flags &= ~SF_BEFORE_EOL;
617 if (flags & SCF_DO_STCLASS_AND) {
618 /* Check whether it is compatible with what we know already! */
621 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
622 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
623 && (!(data->start_class->flags & ANYOF_FOLD)
624 || !ANYOF_BITMAP_TEST(data->start_class,
625 PL_fold[*(U8*)STRING(scan)])))
627 ANYOF_CLASS_ZERO(data->start_class);
628 ANYOF_BITMAP_ZERO(data->start_class);
630 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
631 data->start_class->flags &= ~ANYOF_EOS;
633 else if (flags & SCF_DO_STCLASS_OR) {
634 /* false positive possible if the class is case-folded */
635 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
636 data->start_class->flags &= ~ANYOF_EOS;
637 cl_and(data->start_class, &and_with);
639 flags &= ~SCF_DO_STCLASS;
641 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
642 I32 l = STR_LEN(scan);
644 /* Search for fixed substrings supports EXACT only. */
645 if (flags & SCF_DO_SUBSTR)
648 unsigned char *s = (unsigned char *)STRING(scan);
649 unsigned char *e = s + l;
658 if (data && (flags & SCF_DO_SUBSTR))
660 if (flags & SCF_DO_STCLASS_AND) {
661 /* Check whether it is compatible with what we know already! */
664 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
665 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
666 && !ANYOF_BITMAP_TEST(data->start_class,
667 PL_fold[*(U8*)STRING(scan)]))
669 ANYOF_CLASS_ZERO(data->start_class);
670 ANYOF_BITMAP_ZERO(data->start_class);
672 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
673 data->start_class->flags &= ~ANYOF_EOS;
674 data->start_class->flags |= ANYOF_FOLD;
675 if (OP(scan) == EXACTFL)
676 data->start_class->flags |= ANYOF_LOCALE;
679 else if (flags & SCF_DO_STCLASS_OR) {
680 if (data->start_class->flags & ANYOF_FOLD) {
681 /* false positive possible if the class is case-folded.
682 Assume that the locale settings are the same... */
683 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
684 data->start_class->flags &= ~ANYOF_EOS;
686 cl_and(data->start_class, &and_with);
688 flags &= ~SCF_DO_STCLASS;
690 else if (strchr((char*)PL_varies,OP(scan))) {
691 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
693 regnode *oscan = scan;
694 struct regnode_charclass_class this_class;
695 struct regnode_charclass_class *oclass = NULL;
697 switch (PL_regkind[(U8)OP(scan)]) {
698 case WHILEM: /* End of (?:...)* . */
699 scan = NEXTOPER(scan);
702 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
703 next = NEXTOPER(scan);
704 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
706 maxcount = REG_INFTY;
707 next = regnext(scan);
708 scan = NEXTOPER(scan);
712 if (flags & SCF_DO_SUBSTR)
717 if (flags & SCF_DO_STCLASS) {
719 maxcount = REG_INFTY;
720 next = regnext(scan);
721 scan = NEXTOPER(scan);
724 is_inf = is_inf_internal = 1;
725 scan = regnext(scan);
726 if (flags & SCF_DO_SUBSTR) {
727 scan_commit(data); /* Cannot extend fixed substrings */
728 data->longest = &(data->longest_float);
730 goto optimize_curly_tail;
732 mincount = ARG1(scan);
733 maxcount = ARG2(scan);
734 next = regnext(scan);
735 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
737 if (flags & SCF_DO_SUBSTR) {
738 if (mincount == 0) scan_commit(data); /* Cannot extend fixed substrings */
739 pos_before = data->pos_min;
743 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
745 data->flags |= SF_IS_INF;
747 if (flags & SCF_DO_STCLASS) {
748 cl_init(&this_class);
749 oclass = data->start_class;
750 data->start_class = &this_class;
751 f |= SCF_DO_STCLASS_AND;
752 f &= ~SCF_DO_STCLASS_OR;
755 /* This will finish on WHILEM, setting scan, or on NULL: */
756 minnext = study_chunk(&scan, &deltanext, last, data,
758 ? (f & ~SCF_DO_SUBSTR) : f);
760 if (flags & SCF_DO_STCLASS)
761 data->start_class = oclass;
762 if (mincount == 0 || minnext == 0) {
763 if (flags & SCF_DO_STCLASS_OR) {
764 cl_or(data->start_class, &this_class);
766 else if (flags & SCF_DO_STCLASS_AND) {
767 /* Switch to OR mode: cache the old value of
768 * data->start_class */
769 StructCopy(data->start_class, &and_with,
770 struct regnode_charclass_class);
771 flags &= ~SCF_DO_STCLASS_AND;
772 StructCopy(&this_class, data->start_class,
773 struct regnode_charclass_class);
774 flags |= SCF_DO_STCLASS_OR;
775 data->start_class->flags |= ANYOF_EOS;
777 } else { /* Non-zero len */
778 if (flags & SCF_DO_STCLASS_OR) {
779 cl_or(data->start_class, &this_class);
780 cl_and(data->start_class, &and_with);
782 else if (flags & SCF_DO_STCLASS_AND)
783 cl_and(data->start_class, &this_class);
784 flags &= ~SCF_DO_STCLASS;
786 if (!scan) /* It was not CURLYX, but CURLY. */
788 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
789 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
790 && maxcount <= REG_INFTY/3) /* Complement check for big count */
791 Perl_warner(aTHX_ WARN_REGEXP,
792 "Strange *+?{} on zero-length expression");
793 min += minnext * mincount;
794 is_inf_internal |= ((maxcount == REG_INFTY
795 && (minnext + deltanext) > 0)
796 || deltanext == I32_MAX);
797 is_inf |= is_inf_internal;
798 delta += (minnext + deltanext) * maxcount - minnext * mincount;
800 /* Try powerful optimization CURLYX => CURLYN. */
801 if ( OP(oscan) == CURLYX && data
802 && data->flags & SF_IN_PAR
803 && !(data->flags & SF_HAS_EVAL)
804 && !deltanext && minnext == 1 ) {
805 /* Try to optimize to CURLYN. */
806 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
807 regnode *nxt1 = nxt, *nxt2;
811 if (!strchr((char*)PL_simple,OP(nxt))
812 && !(PL_regkind[(U8)OP(nxt)] == EXACT
813 && STR_LEN(nxt) == 1))
817 if (OP(nxt) != CLOSE)
819 /* Now we know that nxt2 is the only contents: */
820 oscan->flags = ARG(nxt);
822 OP(nxt1) = NOTHING; /* was OPEN. */
824 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
825 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
826 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
827 OP(nxt) = OPTIMIZED; /* was CLOSE. */
828 OP(nxt + 1) = OPTIMIZED; /* was count. */
829 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
834 /* Try optimization CURLYX => CURLYM. */
835 if ( OP(oscan) == CURLYX && data
836 && !(data->flags & SF_HAS_PAR)
837 && !(data->flags & SF_HAS_EVAL)
839 /* XXXX How to optimize if data == 0? */
840 /* Optimize to a simpler form. */
841 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
845 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
846 && (OP(nxt2) != WHILEM))
848 OP(nxt2) = SUCCEED; /* Whas WHILEM */
849 /* Need to optimize away parenths. */
850 if (data->flags & SF_IN_PAR) {
851 /* Set the parenth number. */
852 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
854 if (OP(nxt) != CLOSE)
855 FAIL("panic opt close");
856 oscan->flags = ARG(nxt);
857 OP(nxt1) = OPTIMIZED; /* was OPEN. */
858 OP(nxt) = OPTIMIZED; /* was CLOSE. */
860 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
861 OP(nxt + 1) = OPTIMIZED; /* was count. */
862 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
863 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
866 while ( nxt1 && (OP(nxt1) != WHILEM)) {
867 regnode *nnxt = regnext(nxt1);
870 if (reg_off_by_arg[OP(nxt1)])
871 ARG_SET(nxt1, nxt2 - nxt1);
872 else if (nxt2 - nxt1 < U16_MAX)
873 NEXT_OFF(nxt1) = nxt2 - nxt1;
875 OP(nxt) = NOTHING; /* Cannot beautify */
880 /* Optimize again: */
881 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
886 else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) {
887 /* This stays as CURLYX, and can put the count/of pair. */
888 /* Find WHILEM (as in regexec.c) */
889 regnode *nxt = oscan + NEXT_OFF(oscan);
891 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
893 PREVOPER(nxt)->flags = data->whilem_c
894 | (PL_reg_whilem_seen << 4); /* On WHILEM */
896 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
898 if (flags & SCF_DO_SUBSTR) {
899 SV *last_str = Nullsv;
900 int counted = mincount != 0;
902 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
903 I32 b = pos_before >= data->last_start_min
904 ? pos_before : data->last_start_min;
906 char *s = SvPV(data->last_found, l);
907 I32 old = b - data->last_start_min;
910 old = utf8_hop((U8*)s, old) - (U8*)s;
913 /* Get the added string: */
914 last_str = newSVpvn(s + old, l);
915 if (deltanext == 0 && pos_before == b) {
916 /* What was added is a constant string */
918 SvGROW(last_str, (mincount * l) + 1);
919 repeatcpy(SvPVX(last_str) + l,
920 SvPVX(last_str), l, mincount - 1);
921 SvCUR(last_str) *= mincount;
922 /* Add additional parts. */
923 SvCUR_set(data->last_found,
924 SvCUR(data->last_found) - l);
925 sv_catsv(data->last_found, last_str);
926 data->last_end += l * (mincount - 1);
929 /* start offset must point into the last copy */
930 data->last_start_min += minnext * (mincount - 1);
931 data->last_start_max += is_inf ? 0 : (maxcount - 1)
932 * (minnext + data->pos_delta);
935 /* It is counted once already... */
936 data->pos_min += minnext * (mincount - counted);
937 data->pos_delta += - counted * deltanext +
938 (minnext + deltanext) * maxcount - minnext * mincount;
939 if (mincount != maxcount) {
940 /* Cannot extend fixed substrings found inside
943 if (mincount && last_str) {
944 sv_setsv(data->last_found, last_str);
945 data->last_end = data->pos_min;
946 data->last_start_min =
947 data->pos_min - CHR_SVLEN(last_str);
948 data->last_start_max = is_inf
950 : data->pos_min + data->pos_delta
951 - CHR_SVLEN(last_str);
953 data->longest = &(data->longest_float);
955 SvREFCNT_dec(last_str);
957 if (data && (fl & SF_HAS_EVAL))
958 data->flags |= SF_HAS_EVAL;
960 if (OP(oscan) != CURLYX) {
961 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
963 NEXT_OFF(oscan) += NEXT_OFF(next);
966 default: /* REF and CLUMP only? */
967 if (flags & SCF_DO_SUBSTR) {
968 scan_commit(data); /* Cannot expect anything... */
969 data->longest = &(data->longest_float);
971 is_inf = is_inf_internal = 1;
972 if (flags & SCF_DO_STCLASS_OR)
973 cl_anything(data->start_class);
974 flags &= ~SCF_DO_STCLASS;
978 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
981 if (flags & SCF_DO_SUBSTR) {
986 if (flags & SCF_DO_STCLASS) {
987 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
989 /* Some of the logic below assumes that switching
990 locale on will only add false positives. */
991 switch (PL_regkind[(U8)OP(scan)]) {
1008 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1009 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1010 cl_anything(data->start_class);
1013 if (OP(scan) == SANY)
1015 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1016 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1017 || (data->start_class->flags & ANYOF_CLASS));
1018 cl_anything(data->start_class);
1020 if (flags & SCF_DO_STCLASS_AND || !value)
1021 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1024 if (flags & SCF_DO_STCLASS_AND)
1025 cl_and(data->start_class,
1026 (struct regnode_charclass_class*)scan);
1028 cl_or(data->start_class,
1029 (struct regnode_charclass_class*)scan);
1032 if (flags & SCF_DO_STCLASS_AND) {
1033 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1034 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1035 for (value = 0; value < 256; value++)
1036 if (!isALNUM(value))
1037 ANYOF_BITMAP_CLEAR(data->start_class, value);
1041 if (data->start_class->flags & ANYOF_LOCALE)
1042 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1044 for (value = 0; value < 256; value++)
1046 ANYOF_BITMAP_SET(data->start_class, value);
1051 if (flags & SCF_DO_STCLASS_AND) {
1052 if (data->start_class->flags & ANYOF_LOCALE)
1053 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1056 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1057 data->start_class->flags |= ANYOF_LOCALE;
1061 if (flags & SCF_DO_STCLASS_AND) {
1062 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1063 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1064 for (value = 0; value < 256; value++)
1066 ANYOF_BITMAP_CLEAR(data->start_class, value);
1070 if (data->start_class->flags & ANYOF_LOCALE)
1071 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1073 for (value = 0; value < 256; value++)
1074 if (!isALNUM(value))
1075 ANYOF_BITMAP_SET(data->start_class, value);
1080 if (flags & SCF_DO_STCLASS_AND) {
1081 if (data->start_class->flags & ANYOF_LOCALE)
1082 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1085 data->start_class->flags |= ANYOF_LOCALE;
1086 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1090 if (flags & SCF_DO_STCLASS_AND) {
1091 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1092 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1093 for (value = 0; value < 256; value++)
1094 if (!isSPACE(value))
1095 ANYOF_BITMAP_CLEAR(data->start_class, value);
1099 if (data->start_class->flags & ANYOF_LOCALE)
1100 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1102 for (value = 0; value < 256; value++)
1104 ANYOF_BITMAP_SET(data->start_class, value);
1109 if (flags & SCF_DO_STCLASS_AND) {
1110 if (data->start_class->flags & ANYOF_LOCALE)
1111 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1114 data->start_class->flags |= ANYOF_LOCALE;
1115 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1119 if (flags & SCF_DO_STCLASS_AND) {
1120 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1121 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1122 for (value = 0; value < 256; value++)
1124 ANYOF_BITMAP_CLEAR(data->start_class, value);
1128 if (data->start_class->flags & ANYOF_LOCALE)
1129 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1131 for (value = 0; value < 256; value++)
1132 if (!isSPACE(value))
1133 ANYOF_BITMAP_SET(data->start_class, value);
1138 if (flags & SCF_DO_STCLASS_AND) {
1139 if (data->start_class->flags & ANYOF_LOCALE) {
1140 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1141 for (value = 0; value < 256; value++)
1142 if (!isSPACE(value))
1143 ANYOF_BITMAP_CLEAR(data->start_class, value);
1147 data->start_class->flags |= ANYOF_LOCALE;
1148 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1152 if (flags & SCF_DO_STCLASS_AND) {
1153 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1154 for (value = 0; value < 256; value++)
1155 if (!isDIGIT(value))
1156 ANYOF_BITMAP_CLEAR(data->start_class, value);
1159 if (data->start_class->flags & ANYOF_LOCALE)
1160 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1162 for (value = 0; value < 256; value++)
1164 ANYOF_BITMAP_SET(data->start_class, value);
1169 if (flags & SCF_DO_STCLASS_AND) {
1170 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1171 for (value = 0; value < 256; value++)
1173 ANYOF_BITMAP_CLEAR(data->start_class, value);
1176 if (data->start_class->flags & ANYOF_LOCALE)
1177 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1179 for (value = 0; value < 256; value++)
1180 if (!isDIGIT(value))
1181 ANYOF_BITMAP_SET(data->start_class, value);
1186 if (flags & SCF_DO_STCLASS_OR)
1187 cl_and(data->start_class, &and_with);
1188 flags &= ~SCF_DO_STCLASS;
1191 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1192 data->flags |= (OP(scan) == MEOL
1196 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1197 /* Lookbehind, or need to calculate parens/evals/stclass: */
1198 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1199 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1200 /* Lookahead/lookbehind */
1201 I32 deltanext, minnext;
1203 struct regnode_charclass_class intrnl;
1206 data_fake.flags = 0;
1208 data_fake.whilem_c = data->whilem_c;
1209 if ( flags & SCF_DO_STCLASS && !scan->flags
1210 && OP(scan) == IFMATCH ) { /* Lookahead */
1212 data_fake.start_class = &intrnl;
1213 f = SCF_DO_STCLASS_AND;
1215 next = regnext(scan);
1216 nscan = NEXTOPER(NEXTOPER(scan));
1217 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, f);
1220 vFAIL("Variable length lookbehind not implemented");
1222 else if (minnext > U8_MAX) {
1223 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1225 scan->flags = minnext;
1227 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1229 if (data && (data_fake.flags & SF_HAS_EVAL))
1230 data->flags |= SF_HAS_EVAL;
1232 data->whilem_c = data_fake.whilem_c;
1234 int was = (data->start_class->flags & ANYOF_EOS);
1236 cl_and(data->start_class, &intrnl);
1238 data->start_class->flags |= ANYOF_EOS;
1241 else if (OP(scan) == OPEN) {
1244 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
1245 next = regnext(scan);
1247 if ( next && (OP(next) != WHILEM) && next < last)
1248 is_par = 0; /* Disable optimization */
1250 else if (OP(scan) == EVAL) {
1252 data->flags |= SF_HAS_EVAL;
1254 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1255 if (flags & SCF_DO_SUBSTR) {
1257 data->longest = &(data->longest_float);
1259 is_inf = is_inf_internal = 1;
1260 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1261 cl_anything(data->start_class);
1262 flags &= ~SCF_DO_STCLASS;
1264 /* Else: zero-length, ignore. */
1265 scan = regnext(scan);
1270 *deltap = is_inf_internal ? I32_MAX : delta;
1271 if (flags & SCF_DO_SUBSTR && is_inf)
1272 data->pos_delta = I32_MAX - data->pos_min;
1273 if (is_par > U8_MAX)
1275 if (is_par && pars==1 && data) {
1276 data->flags |= SF_IN_PAR;
1277 data->flags &= ~SF_HAS_PAR;
1279 else if (pars && data) {
1280 data->flags |= SF_HAS_PAR;
1281 data->flags &= ~SF_IN_PAR;
1283 if (flags & SCF_DO_STCLASS_OR)
1284 cl_and(data->start_class, &and_with);
1289 S_add_data(pTHX_ I32 n, char *s)
1292 if (PL_regcomp_rx->data) {
1293 Renewc(PL_regcomp_rx->data,
1294 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
1295 char, struct reg_data);
1296 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
1297 PL_regcomp_rx->data->count += n;
1300 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
1301 char, struct reg_data);
1302 New(1208, PL_regcomp_rx->data->what, n, U8);
1303 PL_regcomp_rx->data->count = n;
1305 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
1306 return PL_regcomp_rx->data->count - n;
1310 Perl_reginitcolors(pTHX)
1314 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1317 PL_colors[0] = s = savepv(s);
1319 s = strchr(s, '\t');
1325 PL_colors[i] = s = "";
1329 PL_colors[i++] = "";
1336 - pregcomp - compile a regular expression into internal code
1338 * We can't allocate space until we know how big the compiled form will be,
1339 * but we can't compile it (and thus know how big it is) until we've got a
1340 * place to put the code. So we cheat: we compile it twice, once with code
1341 * generation turned off and size counting turned on, and once "for real".
1342 * This also means that we don't allocate space until we are sure that the
1343 * thing really will compile successfully, and we never have to move the
1344 * code and thus invalidate pointers into it. (Note that it has to be in
1345 * one piece because free() must be able to free it all.) [NB: not true in perl]
1347 * Beware that the optimization-preparation code in here knows about some
1348 * of the structure of the compiled regexp. [I'll say.]
1351 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1364 FAIL("NULL regexp argument");
1366 if (pm->op_pmdynflags & PMdf_UTF8) {
1367 PL_reg_flags |= RF_utf8;
1372 PL_regprecomp = savepvn(exp, xend - exp);
1373 DEBUG_r(if (!PL_colorset) reginitcolors());
1374 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1375 PL_colors[4],PL_colors[5],PL_colors[0],
1376 (int)(xend - exp), PL_regprecomp, PL_colors[1]));
1377 PL_regflags = pm->op_pmflags;
1381 PL_seen_zerolen = *exp == '^' ? -1 : 0;
1385 /* First pass: determine size, legality. */
1386 PL_regcomp_parse = exp;
1391 PL_regcode = &PL_regdummy;
1392 PL_reg_whilem_seen = 0;
1393 #if 0 /* REGC() is (currently) a NOP at the first pass.
1394 * Clever compilers notice this and complain. --jhi */
1395 REGC((U8)REG_MAGIC, (char*)PL_regcode);
1397 if (reg(0, &flags) == NULL) {
1398 Safefree(PL_regprecomp);
1399 PL_regprecomp = Nullch;
1402 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)PL_regsize));
1404 /* Small enough for pointer-storage convention?
1405 If extralen==0, this means that we will not need long jumps. */
1406 if (PL_regsize >= 0x10000L && PL_extralen)
1407 PL_regsize += PL_extralen;
1410 if (PL_reg_whilem_seen > 15)
1411 PL_reg_whilem_seen = 15;
1413 /* Allocate space and initialize. */
1414 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
1417 FAIL("regexp out of space");
1419 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1420 Zero(r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode), char);
1423 r->prelen = xend - exp;
1424 r->precomp = PL_regprecomp;
1426 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1427 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
1429 r->substrs = 0; /* Useful during FAIL. */
1430 r->startp = 0; /* Useful during FAIL. */
1431 r->endp = 0; /* Useful during FAIL. */
1435 /* Second pass: emit code. */
1436 PL_regcomp_parse = exp;
1440 PL_regcode = r->program;
1441 /* Store the count of eval-groups for security checks: */
1442 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
1443 REGC((U8)REG_MAGIC, (char*) PL_regcode++);
1445 if (reg(0, &flags) == NULL)
1448 /* Dig out information for optimizations. */
1449 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1450 pm->op_pmflags = PL_regflags;
1452 r->reganch |= ROPT_UTF8;
1453 r->regstclass = NULL;
1454 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
1455 r->reganch |= ROPT_NAUGHTY;
1456 scan = r->program + 1; /* First BRANCH. */
1458 /* XXXX To minimize changes to RE engine we always allocate
1459 3-units-long substrs field. */
1460 Newz(1004, r->substrs, 1, struct reg_substr_data);
1462 StructCopy(&zero_scan_data, &data, scan_data_t);
1463 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1464 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1466 STRLEN longest_float_length, longest_fixed_length;
1467 struct regnode_charclass_class ch_class;
1471 /* Skip introductions and multiplicators >= 1. */
1472 while ((OP(first) == OPEN && (sawopen = 1)) ||
1473 /* An OR of *one* alternative - should not happen now. */
1474 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1475 (OP(first) == PLUS) ||
1476 (OP(first) == MINMOD) ||
1477 /* An {n,m} with n>0 */
1478 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1479 if (OP(first) == PLUS)
1482 first += regarglen[(U8)OP(first)];
1483 first = NEXTOPER(first);
1486 /* Starting-point info. */
1488 if (PL_regkind[(U8)OP(first)] == EXACT) {
1489 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
1490 else if ((OP(first) == EXACTF || OP(first) == EXACTFL)
1492 r->regstclass = first;
1494 else if (strchr((char*)PL_simple,OP(first)))
1495 r->regstclass = first;
1496 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1497 PL_regkind[(U8)OP(first)] == NBOUND)
1498 r->regstclass = first;
1499 else if (PL_regkind[(U8)OP(first)] == BOL) {
1500 r->reganch |= (OP(first) == MBOL
1502 : (OP(first) == SBOL
1505 first = NEXTOPER(first);
1508 else if (OP(first) == GPOS) {
1509 r->reganch |= ROPT_ANCH_GPOS;
1510 first = NEXTOPER(first);
1513 else if ((OP(first) == STAR &&
1514 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1515 !(r->reganch & ROPT_ANCH) )
1517 /* turn .* into ^.* with an implied $*=1 */
1518 int type = OP(NEXTOPER(first));
1520 if (type == REG_ANY || type == ANYUTF8)
1521 type = ROPT_ANCH_MBOL;
1523 type = ROPT_ANCH_SBOL;
1525 r->reganch |= type | ROPT_IMPLICIT;
1526 first = NEXTOPER(first);
1529 if (sawplus && (!sawopen || !PL_regsawback)
1530 && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */
1531 /* x+ must match at the 1st pos of run of x's */
1532 r->reganch |= ROPT_SKIP;
1534 /* Scan is after the zeroth branch, first is atomic matcher. */
1535 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1536 (IV)(first - scan + 1)));
1538 * If there's something expensive in the r.e., find the
1539 * longest literal string that must appear and make it the
1540 * regmust. Resolve ties in favor of later strings, since
1541 * the regstart check works with the beginning of the r.e.
1542 * and avoiding duplication strengthens checking. Not a
1543 * strong reason, but sufficient in the absence of others.
1544 * [Now we resolve ties in favor of the earlier string if
1545 * it happens that c_offset_min has been invalidated, since the
1546 * earlier string may buy us something the later one won't.]
1550 data.longest_fixed = newSVpvn("",0);
1551 data.longest_float = newSVpvn("",0);
1552 data.last_found = newSVpvn("",0);
1553 data.longest = &(data.longest_fixed);
1555 if (!r->regstclass) {
1557 data.start_class = &ch_class;
1558 stclass_flag = SCF_DO_STCLASS_AND;
1559 } else /* XXXX Check for BOUND? */
1562 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
1563 &data, SCF_DO_SUBSTR | stclass_flag);
1564 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
1565 && data.last_start_min == 0 && data.last_end > 0
1567 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1568 r->reganch |= ROPT_CHECK_ALL;
1570 SvREFCNT_dec(data.last_found);
1572 longest_float_length = CHR_SVLEN(data.longest_float);
1573 if (longest_float_length
1574 || (data.flags & SF_FL_BEFORE_EOL
1575 && (!(data.flags & SF_FL_BEFORE_MEOL)
1576 || (PL_regflags & PMf_MULTILINE)))) {
1579 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1580 && data.offset_fixed == data.offset_float_min
1581 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1582 goto remove_float; /* As in (a)+. */
1584 r->float_substr = data.longest_float;
1585 r->float_min_offset = data.offset_float_min;
1586 r->float_max_offset = data.offset_float_max;
1587 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1588 && (!(data.flags & SF_FL_BEFORE_MEOL)
1589 || (PL_regflags & PMf_MULTILINE)));
1590 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1594 r->float_substr = Nullsv;
1595 SvREFCNT_dec(data.longest_float);
1596 longest_float_length = 0;
1599 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1600 if (longest_fixed_length
1601 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1602 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1603 || (PL_regflags & PMf_MULTILINE)))) {
1606 r->anchored_substr = data.longest_fixed;
1607 r->anchored_offset = data.offset_fixed;
1608 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1609 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1610 || (PL_regflags & PMf_MULTILINE)));
1611 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1614 r->anchored_substr = Nullsv;
1615 SvREFCNT_dec(data.longest_fixed);
1616 longest_fixed_length = 0;
1619 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8
1620 || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY))
1621 r->regstclass = NULL;
1622 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1623 && !(data.start_class->flags & ANYOF_EOS)
1624 && !cl_is_anything(data.start_class)) {
1626 I32 n = add_data(1, "f");
1628 New(1006, PL_regcomp_rx->data->data[n], 1,
1629 struct regnode_charclass_class);
1630 StructCopy(data.start_class,
1631 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1632 struct regnode_charclass_class);
1633 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1634 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1635 DEBUG_r((sv = sv_newmortal(),
1636 regprop(sv, (regnode*)data.start_class),
1637 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1641 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1642 if (longest_fixed_length > longest_float_length) {
1643 r->check_substr = r->anchored_substr;
1644 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1645 if (r->reganch & ROPT_ANCH_SINGLE)
1646 r->reganch |= ROPT_NOSCAN;
1649 r->check_substr = r->float_substr;
1650 r->check_offset_min = data.offset_float_min;
1651 r->check_offset_max = data.offset_float_max;
1653 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1654 This should be changed ASAP! */
1655 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1656 r->reganch |= RE_USE_INTUIT;
1657 if (SvTAIL(r->check_substr))
1658 r->reganch |= RE_INTUIT_TAIL;
1662 /* Several toplevels. Best we can is to set minlen. */
1664 struct regnode_charclass_class ch_class;
1666 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1667 scan = r->program + 1;
1669 data.start_class = &ch_class;
1670 minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, SCF_DO_STCLASS_AND);
1671 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1672 if (!(data.start_class->flags & ANYOF_EOS)
1673 && !cl_is_anything(data.start_class)) {
1675 I32 n = add_data(1, "f");
1677 New(1006, PL_regcomp_rx->data->data[n], 1,
1678 struct regnode_charclass_class);
1679 StructCopy(data.start_class,
1680 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1681 struct regnode_charclass_class);
1682 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1683 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1684 DEBUG_r((sv = sv_newmortal(),
1685 regprop(sv, (regnode*)data.start_class),
1686 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1692 if (PL_regseen & REG_SEEN_GPOS)
1693 r->reganch |= ROPT_GPOS_SEEN;
1694 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1695 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1696 if (PL_regseen & REG_SEEN_EVAL)
1697 r->reganch |= ROPT_EVAL_SEEN;
1698 Newz(1002, r->startp, PL_regnpar, I32);
1699 Newz(1002, r->endp, PL_regnpar, I32);
1700 DEBUG_r(regdump(r));
1705 - reg - regular expression, i.e. main body or parenthesized thing
1707 * Caller must absorb opening parenthesis.
1709 * Combining parenthesis handling with the base level of regular expression
1710 * is a trifle forced, but the need to tie the tails of the branches to what
1711 * follows makes it hard to avoid.
1714 S_reg(pTHX_ I32 paren, I32 *flagp)
1715 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1718 register regnode *ret; /* Will be the head of the group. */
1719 register regnode *br;
1720 register regnode *lastbr;
1721 register regnode *ender = 0;
1722 register I32 parno = 0;
1723 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1726 *flagp = 0; /* Tentatively. */
1728 /* Make an OPEN node, if parenthesized. */
1730 if (*PL_regcomp_parse == '?') {
1731 U16 posflags = 0, negflags = 0;
1732 U16 *flagsp = &posflags;
1736 paren = *PL_regcomp_parse++;
1737 ret = NULL; /* For look-ahead/behind. */
1740 PL_regseen |= REG_SEEN_LOOKBEHIND;
1741 if (*PL_regcomp_parse == '!')
1743 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1754 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
1757 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1759 if (*PL_regcomp_parse != ')')
1760 FAIL("Sequence (?#... not terminated");
1766 Perl_warner(aTHX_ WARN_REGEXP,
1767 "(?p{}) is deprecated - use (??{})");
1771 paren = *PL_regcomp_parse++;
1776 I32 count = 1, n = 0;
1778 char *s = PL_regcomp_parse;
1780 OP_4tree *sop, *rop;
1783 PL_regseen |= REG_SEEN_EVAL;
1784 while (count && (c = *PL_regcomp_parse)) {
1785 if (c == '\\' && PL_regcomp_parse[1])
1793 if (*PL_regcomp_parse != ')')
1794 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1798 if (PL_regcomp_parse - 1 - s)
1799 sv = newSVpvn(s, PL_regcomp_parse - 1 - s);
1801 sv = newSVpvn("", 0);
1803 rop = sv_compile_2op(sv, &sop, "re", &av);
1805 n = add_data(3, "nop");
1806 PL_regcomp_rx->data->data[n] = (void*)rop;
1807 PL_regcomp_rx->data->data[n+1] = (void*)sop;
1808 PL_regcomp_rx->data->data[n+2] = (void*)av;
1811 else { /* First pass */
1812 if (PL_reginterp_cnt < ++PL_seen_evals
1813 && PL_curcop != &PL_compiling)
1814 /* No compiled RE interpolated, has runtime
1815 components ===> unsafe. */
1816 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1818 FAIL("Eval-group in insecure regular expression");
1823 ret = reg_node(LOGICAL);
1826 regtail(ret, reganode(EVAL, n));
1829 return reganode(EVAL, n);
1833 if (PL_regcomp_parse[0] == '?') {
1834 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1835 || PL_regcomp_parse[1] == '<'
1836 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1839 ret = reg_node(LOGICAL);
1842 regtail(ret, reg(1, &flag));
1846 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1847 parno = atoi(PL_regcomp_parse++);
1849 while (isDIGIT(*PL_regcomp_parse))
1851 ret = reganode(GROUPP, parno);
1852 if ((c = *nextchar()) != ')')
1853 vFAIL2("Switch (?(number%c not recognized", c);
1855 regtail(ret, reganode(IFTHEN, 0));
1856 br = regbranch(&flags, 1);
1858 br = reganode(LONGJMP, 0);
1860 regtail(br, reganode(LONGJMP, 0));
1865 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1866 regbranch(&flags, 1);
1867 regtail(ret, lastbr);
1875 vFAIL("Switch (?(condition)... contains too many branches");
1876 ender = reg_node(TAIL);
1879 regtail(lastbr, ender);
1880 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1883 regtail(ret, ender);
1887 vFAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1891 vFAIL("Sequence (? incomplete");
1896 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1897 if (*PL_regcomp_parse != 'o')
1898 pmflag(flagsp, *PL_regcomp_parse);
1901 if (*PL_regcomp_parse == '-') {
1906 PL_regflags |= posflags;
1907 PL_regflags &= ~negflags;
1908 if (*PL_regcomp_parse == ':') {
1914 if (*PL_regcomp_parse != ')')
1915 vFAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1924 ret = reganode(OPEN, parno);
1931 /* Pick up the branches, linking them together. */
1932 br = regbranch(&flags, 1);
1935 if (*PL_regcomp_parse == '|') {
1936 if (!SIZE_ONLY && PL_extralen) {
1937 reginsert(BRANCHJ, br);
1940 reginsert(BRANCH, br);
1943 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1945 else if (paren == ':') {
1946 *flagp |= flags&SIMPLE;
1948 if (open) { /* Starts with OPEN. */
1949 regtail(ret, br); /* OPEN -> first. */
1951 else if (paren != '?') /* Not Conditional */
1955 *flagp |= flags&SPSTART;
1957 while (*PL_regcomp_parse == '|') {
1958 if (!SIZE_ONLY && PL_extralen) {
1959 ender = reganode(LONGJMP,0);
1960 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1963 PL_extralen += 2; /* Account for LONGJMP. */
1965 br = regbranch(&flags, 0);
1968 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1972 *flagp |= flags&SPSTART;
1975 if (have_branch || paren != ':') {
1976 /* Make a closing node, and hook it on the end. */
1979 ender = reg_node(TAIL);
1982 ender = reganode(CLOSE, parno);
1988 *flagp &= ~HASWIDTH;
1991 ender = reg_node(SUCCEED);
1994 ender = reg_node(END);
1997 regtail(lastbr, ender);
2000 /* Hook the tails of the branches to the closing node. */
2001 for (br = ret; br != NULL; br = regnext(br)) {
2002 regoptail(br, ender);
2009 static char parens[] = "=!<,>";
2011 if (paren && (p = strchr(parens, paren))) {
2012 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2013 int flag = (p - parens) > 1;
2016 node = SUSPEND, flag = 0;
2017 reginsert(node,ret);
2019 regtail(ret, reg_node(TAIL));
2023 /* Check for proper termination. */
2025 PL_regflags = oregflags;
2026 if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') {
2027 FAIL("unmatched () in regexp");
2030 else if (!paren && PL_regcomp_parse < PL_regxend) {
2031 if (*PL_regcomp_parse == ')') {
2032 FAIL("unmatched () in regexp");
2035 FAIL("junk on end of regexp"); /* "Can't happen". */
2043 - regbranch - one alternative of an | operator
2045 * Implements the concatenation operator.
2048 S_regbranch(pTHX_ I32 *flagp, I32 first)
2051 register regnode *ret;
2052 register regnode *chain = NULL;
2053 register regnode *latest;
2054 I32 flags = 0, c = 0;
2059 if (!SIZE_ONLY && PL_extralen)
2060 ret = reganode(BRANCHJ,0);
2062 ret = reg_node(BRANCH);
2065 if (!first && SIZE_ONLY)
2066 PL_extralen += 1; /* BRANCHJ */
2068 *flagp = WORST; /* Tentatively. */
2072 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
2074 latest = regpiece(&flags);
2075 if (latest == NULL) {
2076 if (flags & TRYAGAIN)
2080 else if (ret == NULL)
2082 *flagp |= flags&HASWIDTH;
2083 if (chain == NULL) /* First piece. */
2084 *flagp |= flags&SPSTART;
2087 regtail(chain, latest);
2092 if (chain == NULL) { /* Loop ran zero times. */
2093 chain = reg_node(NOTHING);
2098 *flagp |= flags&SIMPLE;
2105 - regpiece - something followed by possible [*+?]
2107 * Note that the branching code sequences used for ? and the general cases
2108 * of * and + are somewhat optimized: they use the same NOTHING node as
2109 * both the endmarker for their branch list and the body of the last branch.
2110 * It might seem that this node could be dispensed with entirely, but the
2111 * endmarker role is not redundant.
2114 S_regpiece(pTHX_ I32 *flagp)
2117 register regnode *ret;
2119 register char *next;
2121 char *origparse = PL_regcomp_parse;
2124 I32 max = REG_INFTY;
2126 ret = regatom(&flags);
2128 if (flags & TRYAGAIN)
2133 op = *PL_regcomp_parse;
2135 if (op == '{' && regcurly(PL_regcomp_parse)) {
2136 next = PL_regcomp_parse + 1;
2138 while (isDIGIT(*next) || *next == ',') {
2147 if (*next == '}') { /* got one */
2151 min = atoi(PL_regcomp_parse);
2155 maxpos = PL_regcomp_parse;
2157 if (!max && *maxpos != '0')
2158 max = REG_INFTY; /* meaning "infinity" */
2159 else if (max >= REG_INFTY)
2160 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2161 PL_regcomp_parse = next;
2165 if ((flags&SIMPLE)) {
2166 PL_regnaughty += 2 + PL_regnaughty / 2;
2167 reginsert(CURLY, ret);
2170 regnode *w = reg_node(WHILEM);
2174 if (!SIZE_ONLY && PL_extralen) {
2175 reginsert(LONGJMP,ret);
2176 reginsert(NOTHING,ret);
2177 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2179 reginsert(CURLYX,ret);
2180 if (!SIZE_ONLY && PL_extralen)
2181 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2182 regtail(ret, reg_node(NOTHING));
2184 PL_reg_whilem_seen++, PL_extralen += 3;
2185 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
2193 if (max && max < min)
2194 vFAIL("Can't do {n,m} with n > m");
2209 #if 0 /* Now runtime fix should be reliable. */
2210 if (!(flags&HASWIDTH) && op != '?')
2211 FAIL("regexp *+ operand could be empty");
2216 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2218 if (op == '*' && (flags&SIMPLE)) {
2219 reginsert(STAR, ret);
2223 else if (op == '*') {
2227 else if (op == '+' && (flags&SIMPLE)) {
2228 reginsert(PLUS, ret);
2232 else if (op == '+') {
2236 else if (op == '?') {
2241 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2242 Perl_warner(aTHX_ WARN_REGEXP, "%.*s matches null string many times",
2243 PL_regcomp_parse - origparse, origparse);
2246 if (*PL_regcomp_parse == '?') {
2248 reginsert(MINMOD, ret);
2249 regtail(ret, ret + NODE_STEP_REGNODE);
2251 if (ISMULT2(PL_regcomp_parse))
2252 vFAIL("Nested quantifiers in regexp");
2258 - regatom - the lowest level
2260 * Optimization: gobbles an entire sequence of ordinary characters so that
2261 * it can turn them into a single node, which is smaller to store and
2262 * faster to run. Backslashed characters are exceptions, each becoming a
2263 * separate node; the code is simpler that way and it's not worth fixing.
2265 * [Yes, it is worth fixing, some scripts can run twice the speed.]
2268 S_regatom(pTHX_ I32 *flagp)
2271 register regnode *ret = 0;
2274 *flagp = WORST; /* Tentatively. */
2277 switch (*PL_regcomp_parse) {
2281 if (PL_regflags & PMf_MULTILINE)
2282 ret = reg_node(MBOL);
2283 else if (PL_regflags & PMf_SINGLELINE)
2284 ret = reg_node(SBOL);
2286 ret = reg_node(BOL);
2289 if (PL_regcomp_parse[1])
2292 if (PL_regflags & PMf_MULTILINE)
2293 ret = reg_node(MEOL);
2294 else if (PL_regflags & PMf_SINGLELINE)
2295 ret = reg_node(SEOL);
2297 ret = reg_node(EOL);
2302 if (PL_regflags & PMf_SINGLELINE)
2303 ret = reg_node(SANYUTF8);
2305 ret = reg_node(ANYUTF8);
2309 if (PL_regflags & PMf_SINGLELINE)
2310 ret = reg_node(SANY);
2312 ret = reg_node(REG_ANY);
2313 *flagp |= HASWIDTH|SIMPLE;
2319 ret = (UTF ? regclassutf8() : regclass());
2320 if (*PL_regcomp_parse != ']')
2321 FAIL("unmatched [] in regexp");
2323 *flagp |= HASWIDTH|SIMPLE;
2327 ret = reg(1, &flags);
2329 if (flags & TRYAGAIN) {
2330 if (PL_regcomp_parse == PL_regxend) {
2331 /* Make parent create an empty node if needed. */
2339 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2343 if (flags & TRYAGAIN) {
2347 vFAIL("internal urp");
2348 /* Supposed to be caught earlier. */
2351 if (!regcurly(PL_regcomp_parse)) {
2359 vFAIL("Quantifier follows nothing in regexp");
2362 switch (*++PL_regcomp_parse) {
2365 ret = reg_node(SBOL);
2370 ret = reg_node(GPOS);
2371 PL_regseen |= REG_SEEN_GPOS;
2376 ret = reg_node(SEOL);
2381 ret = reg_node(EOS);
2383 PL_seen_zerolen++; /* Do not optimize RE away */
2387 ret = reg_node(SANY);
2388 *flagp |= HASWIDTH|SIMPLE;
2392 ret = reg_node(CLUMP);
2395 if (UTF && !PL_utf8_mark)
2396 is_utf8_mark((U8*)"~"); /* preload table */
2401 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
2402 : (LOC ? ALNUML : ALNUM));
2403 *flagp |= HASWIDTH|SIMPLE;
2405 if (UTF && !PL_utf8_alnum)
2406 is_utf8_alnum((U8*)"a"); /* preload table */
2411 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
2412 : (LOC ? NALNUML : NALNUM));
2413 *flagp |= HASWIDTH|SIMPLE;
2415 if (UTF && !PL_utf8_alnum)
2416 is_utf8_alnum((U8*)"a"); /* preload table */
2420 PL_regseen |= REG_SEEN_LOOKBEHIND;
2423 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
2424 : (LOC ? BOUNDL : BOUND));
2427 if (UTF && !PL_utf8_alnum)
2428 is_utf8_alnum((U8*)"a"); /* preload table */
2432 PL_regseen |= REG_SEEN_LOOKBEHIND;
2435 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
2436 : (LOC ? NBOUNDL : NBOUND));
2439 if (UTF && !PL_utf8_alnum)
2440 is_utf8_alnum((U8*)"a"); /* preload table */
2445 ? (LOC ? SPACELUTF8 : SPACEUTF8)
2446 : (LOC ? SPACEL : SPACE));
2447 *flagp |= HASWIDTH|SIMPLE;
2449 if (UTF && !PL_utf8_space)
2450 is_utf8_space((U8*)" "); /* preload table */
2455 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
2456 : (LOC ? NSPACEL : NSPACE));
2457 *flagp |= HASWIDTH|SIMPLE;
2459 if (UTF && !PL_utf8_space)
2460 is_utf8_space((U8*)" "); /* preload table */
2463 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
2464 *flagp |= HASWIDTH|SIMPLE;
2466 if (UTF && !PL_utf8_digit)
2467 is_utf8_digit((U8*)"1"); /* preload table */
2470 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
2471 *flagp |= HASWIDTH|SIMPLE;
2473 if (UTF && !PL_utf8_digit)
2474 is_utf8_digit((U8*)"1"); /* preload table */
2478 { /* a lovely hack--pretend we saw [\pX] instead */
2479 char* oldregxend = PL_regxend;
2481 if (PL_regcomp_parse[1] == '{') {
2482 PL_regxend = strchr(PL_regcomp_parse, '}');
2484 FAIL("Missing right brace on \\p{}");
2488 PL_regxend = PL_regcomp_parse + 2;
2491 ret = regclassutf8();
2493 PL_regxend = oldregxend;
2496 *flagp |= HASWIDTH|SIMPLE;
2509 case '1': case '2': case '3': case '4':
2510 case '5': case '6': case '7': case '8': case '9':
2512 I32 num = atoi(PL_regcomp_parse);
2514 if (num > 9 && num >= PL_regnpar)
2517 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
2518 vFAIL("Reference to nonexistent group");
2521 ? (LOC ? REFFL : REFF)
2524 while (isDIGIT(*PL_regcomp_parse))
2532 if (PL_regcomp_parse >= PL_regxend)
2533 FAIL("trailing \\ in regexp");
2536 /* Do not generate `unrecognized' warnings here, we fall
2537 back into the quick-grab loop below */
2543 if (PL_regflags & PMf_EXTENDED) {
2544 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
2545 if (PL_regcomp_parse < PL_regxend)
2561 ? (LOC ? EXACTFL : EXACTF)
2564 for (len = 0, p = PL_regcomp_parse - 1;
2565 len < 127 && p < PL_regxend;
2570 if (PL_regflags & PMf_EXTENDED)
2571 p = regwhite(p, PL_regxend);
2633 char* e = strchr(p, '}');
2636 FAIL("Missing right brace on \\x{}");
2638 numlen = 1; /* allow underscores */
2639 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2640 /* numlen is generous */
2641 if (numlen + len >= 127) {
2648 vFAIL("Can't use \\x{} without 'use utf8' declaration");
2651 numlen = 0; /* disallow underscores */
2652 ender = (UV)scan_hex(p, 2, &numlen);
2658 ender = UCHARAT(p++);
2659 ender = toCTRL(ender);
2661 case '0': case '1': case '2': case '3':case '4':
2662 case '5': case '6': case '7': case '8':case '9':
2664 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2665 numlen = 0; /* disallow underscores */
2666 ender = (UV)scan_oct(p, 3, &numlen);
2675 if (p >= PL_regxend)
2676 FAIL("trailing \\ in regexp");
2679 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2680 Perl_warner(aTHX_ WARN_REGEXP,
2681 "/%.127s/: Unrecognized escape \\%c passed through",
2684 goto normal_default;
2689 if ((*p & 0xc0) == 0xc0 && UTF) {
2690 ender = utf8_to_uv((U8*)p, &numlen);
2697 if (PL_regflags & PMf_EXTENDED)
2698 p = regwhite(p, PL_regxend);
2701 ender = toLOWER_LC_uni(ender);
2703 ender = toLOWER_uni(ender);
2705 if (ISMULT2(p)) { /* Back off on ?+*. */
2708 else if (ender >= 0x80 && UTF) {
2709 reguni(ender, s, &numlen);
2719 if (ender >= 0x80 && UTF) {
2720 reguni(ender, s, &numlen);
2728 PL_regcomp_parse = p - 1;
2731 vFAIL("internal disaster");
2739 PL_regsize += STR_SZ(len);
2741 PL_regcode += STR_SZ(len);
2750 S_regwhite(pTHX_ char *p, char *e)
2755 else if (*p == '#') {
2758 } while (p < e && *p != '\n');
2766 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
2767 Character classes ([:foo:]) can also be negated ([:^foo:]).
2768 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
2769 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
2770 but trigger warnings because they are currently unimplemented. */
2772 S_regpposixcc(pTHX_ I32 value)
2776 I32 namedclass = OOB_NAMEDCLASS;
2778 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2779 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2780 (*PL_regcomp_parse == ':' ||
2781 *PL_regcomp_parse == '=' ||
2782 *PL_regcomp_parse == '.')) {
2783 char c = *PL_regcomp_parse;
2784 char* s = PL_regcomp_parse++;
2786 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2788 if (PL_regcomp_parse == PL_regxend)
2789 /* Grandfather lone [:, [=, [. */
2790 PL_regcomp_parse = s;
2792 char* t = PL_regcomp_parse++; /* skip over the c */
2794 if (*PL_regcomp_parse == ']') {
2795 PL_regcomp_parse++; /* skip over the ending ] */
2798 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
2799 I32 skip = 5; /* the most common skip */
2803 if (strnEQ(posixcc, "alnum", 5))
2805 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
2806 else if (strnEQ(posixcc, "alpha", 5))
2808 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
2809 else if (strnEQ(posixcc, "ascii", 5))
2811 complement ? ANYOF_NASCII : ANYOF_ASCII;
2814 if (strnEQ(posixcc, "cntrl", 5))
2816 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
2819 if (strnEQ(posixcc, "digit", 5))
2821 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
2824 if (strnEQ(posixcc, "graph", 5))
2826 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
2829 if (strnEQ(posixcc, "lower", 5))
2831 complement ? ANYOF_NLOWER : ANYOF_LOWER;
2834 if (strnEQ(posixcc, "print", 5))
2836 complement ? ANYOF_NPRINT : ANYOF_PRINT;
2837 else if (strnEQ(posixcc, "punct", 5))
2839 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
2842 if (strnEQ(posixcc, "space", 5))
2844 complement ? ANYOF_NSPACE : ANYOF_SPACE;
2847 if (strnEQ(posixcc, "upper", 5))
2849 complement ? ANYOF_NUPPER : ANYOF_UPPER;
2851 case 'w': /* this is not POSIX, this is the Perl \w */
2852 if (strnEQ(posixcc, "word", 4)) {
2854 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
2859 if (strnEQ(posixcc, "xdigit", 6)) {
2861 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
2866 if (namedclass == OOB_NAMEDCLASS ||
2867 posixcc[skip] != ':' ||
2868 posixcc[skip+1] != ']')
2870 "Character class [:%.*s:] unknown",
2872 } else if (!SIZE_ONLY)
2873 /* [[=foo=]] and [[.foo.]] are still future. */
2875 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2877 /* Maternal grandfather:
2878 * "[:" ending in ":" but not in ":]" */
2879 PL_regcomp_parse = s;
2888 S_checkposixcc(pTHX)
2890 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
2891 (*PL_regcomp_parse == ':' ||
2892 *PL_regcomp_parse == '=' ||
2893 *PL_regcomp_parse == '.')) {
2894 char *s = PL_regcomp_parse;
2897 while(*s && isALNUM(*s))
2899 if (*s && c == *s && s[1] == ']') {
2900 Perl_warner(aTHX_ WARN_REGEXP,
2901 "Character class syntax [%c %c] belongs inside character classes", c, c);
2902 if (c == '=' || c == '.')
2904 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2914 register I32 lastvalue = OOB_CHAR8;
2915 register I32 range = 0;
2916 register regnode *ret;
2920 bool need_class = 0;
2922 ret = reg_node(ANYOF);
2924 PL_regsize += ANYOF_SKIP;
2927 ANYOF_BITMAP_ZERO(ret);
2928 PL_regcode += ANYOF_SKIP;
2930 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
2932 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
2934 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2938 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
2941 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
2944 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2945 goto skipcond; /* allow 1st char to be ] or - */
2946 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2948 namedclass = OOB_NAMEDCLASS;
2950 rangebegin = PL_regcomp_parse;
2951 value = UCHARAT(PL_regcomp_parse++);
2953 namedclass = regpposixcc(value);
2954 else if (value == '\\') {
2955 value = UCHARAT(PL_regcomp_parse++);
2956 /* Some compilers cannot handle switching on 64-bit integer
2957 * values, therefore value cannot be an UV. --jhi */
2959 case 'w': namedclass = ANYOF_ALNUM; break;
2960 case 'W': namedclass = ANYOF_NALNUM; break;
2961 case 's': namedclass = ANYOF_SPACE; break;
2962 case 'S': namedclass = ANYOF_NSPACE; break;
2963 case 'd': namedclass = ANYOF_DIGIT; break;
2964 case 'D': namedclass = ANYOF_NDIGIT; break;
2965 case 'n': value = '\n'; break;
2966 case 'r': value = '\r'; break;
2967 case 't': value = '\t'; break;
2968 case 'f': value = '\f'; break;
2969 case 'b': value = '\b'; break;
2971 case 'e': value = '\033'; break;
2972 case 'a': value = '\007'; break;
2974 case 'e': value = '\047'; break;
2975 case 'a': value = '\057'; break;
2978 numlen = 0; /* disallow underscores */
2979 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
2980 PL_regcomp_parse += numlen;
2983 value = UCHARAT(PL_regcomp_parse++);
2984 value = toCTRL(value);
2986 case '0': case '1': case '2': case '3': case '4':
2987 case '5': case '6': case '7': case '8': case '9':
2988 numlen = 0; /* disallow underscores */
2989 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
2990 PL_regcomp_parse += numlen;
2993 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
2994 Perl_warner(aTHX_ WARN_REGEXP,
2995 "/%.127s/: Unrecognized escape \\%c in character class passed through",
3001 if (namedclass > OOB_NAMEDCLASS) {
3002 if (!need_class && !SIZE_ONLY)
3003 ANYOF_CLASS_ZERO(ret);
3005 if (range) { /* a-\d, a-[:digit:] */
3007 if (ckWARN(WARN_REGEXP))
3008 Perl_warner(aTHX_ WARN_REGEXP,
3009 "/%.127s/: false [] range \"%*.*s\" in regexp",
3011 PL_regcomp_parse - rangebegin,
3012 PL_regcomp_parse - rangebegin,
3014 ANYOF_BITMAP_SET(ret, lastvalue);
3015 ANYOF_BITMAP_SET(ret, '-');
3017 range = 0; /* this is not a true range */
3020 switch (namedclass) {
3023 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3025 for (value = 0; value < 256; value++)
3027 ANYOF_BITMAP_SET(ret, value);
3032 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3034 for (value = 0; value < 256; value++)
3035 if (!isALNUM(value))
3036 ANYOF_BITMAP_SET(ret, value);
3041 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3043 for (value = 0; value < 256; value++)
3045 ANYOF_BITMAP_SET(ret, value);
3050 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3052 for (value = 0; value < 256; value++)
3053 if (!isSPACE(value))
3054 ANYOF_BITMAP_SET(ret, value);
3059 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3061 for (value = '0'; value <= '9'; value++)
3062 ANYOF_BITMAP_SET(ret, value);
3067 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3069 for (value = 0; value < '0'; value++)
3070 ANYOF_BITMAP_SET(ret, value);
3071 for (value = '9' + 1; value < 256; value++)
3072 ANYOF_BITMAP_SET(ret, value);
3077 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3079 for (value = 0; value < 256; value++)
3080 if (!isALNUMC(value))
3081 ANYOF_BITMAP_SET(ret, value);
3086 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3088 for (value = 0; value < 256; value++)
3089 if (isALNUMC(value))
3090 ANYOF_BITMAP_SET(ret, value);
3095 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3097 for (value = 0; value < 256; value++)
3099 ANYOF_BITMAP_SET(ret, value);
3104 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3106 for (value = 0; value < 256; value++)
3107 if (!isALPHA(value))
3108 ANYOF_BITMAP_SET(ret, value);
3113 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3116 for (value = 0; value < 128; value++)
3117 ANYOF_BITMAP_SET(ret, value);
3119 for (value = 0; value < 256; value++)
3121 ANYOF_BITMAP_SET(ret, value);
3127 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3130 for (value = 128; value < 256; value++)
3131 ANYOF_BITMAP_SET(ret, value);
3133 for (value = 0; value < 256; value++)
3134 if (!isASCII(value))
3135 ANYOF_BITMAP_SET(ret, value);
3141 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3143 for (value = 0; value < 256; value++)
3145 ANYOF_BITMAP_SET(ret, value);
3147 lastvalue = OOB_CHAR8;
3151 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3153 for (value = 0; value < 256; value++)
3154 if (!isCNTRL(value))
3155 ANYOF_BITMAP_SET(ret, value);
3160 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3162 for (value = 0; value < 256; value++)
3164 ANYOF_BITMAP_SET(ret, value);
3169 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3171 for (value = 0; value < 256; value++)
3172 if (!isGRAPH(value))
3173 ANYOF_BITMAP_SET(ret, value);
3178 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3180 for (value = 0; value < 256; value++)
3182 ANYOF_BITMAP_SET(ret, value);
3187 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3189 for (value = 0; value < 256; value++)
3190 if (!isLOWER(value))
3191 ANYOF_BITMAP_SET(ret, value);
3196 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3198 for (value = 0; value < 256; value++)
3200 ANYOF_BITMAP_SET(ret, value);
3205 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3207 for (value = 0; value < 256; value++)
3208 if (!isPRINT(value))
3209 ANYOF_BITMAP_SET(ret, value);
3214 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3216 for (value = 0; value < 256; value++)
3218 ANYOF_BITMAP_SET(ret, value);
3223 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3225 for (value = 0; value < 256; value++)
3226 if (!isPUNCT(value))
3227 ANYOF_BITMAP_SET(ret, value);
3232 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3234 for (value = 0; value < 256; value++)
3236 ANYOF_BITMAP_SET(ret, value);
3241 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3243 for (value = 0; value < 256; value++)
3244 if (!isUPPER(value))
3245 ANYOF_BITMAP_SET(ret, value);
3250 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3252 for (value = 0; value < 256; value++)
3253 if (isXDIGIT(value))
3254 ANYOF_BITMAP_SET(ret, value);
3259 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3261 for (value = 0; value < 256; value++)
3262 if (!isXDIGIT(value))
3263 ANYOF_BITMAP_SET(ret, value);
3267 vFAIL("invalid [::] class");
3271 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3276 if (lastvalue > value) /* b-a */ {
3278 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3280 PL_regcomp_parse - rangebegin,
3281 PL_regcomp_parse - rangebegin,
3288 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3289 PL_regcomp_parse[1] != ']') {
3291 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3292 if (ckWARN(WARN_REGEXP))
3293 Perl_warner(aTHX_ WARN_REGEXP,
3294 "/%.127s/: false [] range \"%*.*s\" in regexp",
3296 PL_regcomp_parse - rangebegin,
3297 PL_regcomp_parse - rangebegin,
3300 ANYOF_BITMAP_SET(ret, '-');
3303 continue; /* do it next time */
3306 /* now is the next time */
3308 #ifndef ASCIIish /* EBCDIC, for example. */
3309 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3310 (isUPPER(lastvalue) && isUPPER(value)))
3313 if (isLOWER(lastvalue)) {
3314 for (i = lastvalue; i <= value; i++)
3316 ANYOF_BITMAP_SET(ret, i);
3318 for (i = lastvalue; i <= value; i++)
3320 ANYOF_BITMAP_SET(ret, i);
3325 for ( ; lastvalue <= value; lastvalue++)
3326 ANYOF_BITMAP_SET(ret, lastvalue);
3332 PL_regsize += ANYOF_CLASS_ADD_SKIP;
3334 PL_regcode += ANYOF_CLASS_ADD_SKIP;
3336 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3338 (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
3339 for (value = 0; value < 256; ++value) {
3340 if (ANYOF_BITMAP_TEST(ret, value)) {
3341 I32 cf = PL_fold[value];
3342 ANYOF_BITMAP_SET(ret, cf);
3345 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3347 /* optimize inverted simple patterns (e.g. [^a-z]) */
3348 if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3349 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3350 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3351 ANYOF_FLAGS(ret) = 0;
3357 S_regclassutf8(pTHX)
3362 register U32 lastvalue = OOB_UTF8;
3363 register I32 range = 0;
3364 register regnode *ret;
3372 if (*PL_regcomp_parse == '^') { /* Complement of range. */
3376 flags |= ANYOF_INVERT;
3380 flags |= ANYOF_FOLD;
3382 flags |= ANYOF_LOCALE;
3383 listsv = newSVpvn("# comment\n",10);
3386 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3389 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
3390 goto skipcond; /* allow 1st char to be ] or - */
3392 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
3394 namedclass = OOB_NAMEDCLASS;
3396 rangebegin = PL_regcomp_parse;
3397 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3398 PL_regcomp_parse += numlen;
3400 namedclass = regpposixcc(value);
3401 else if (value == '\\') {
3402 value = (U32)utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
3403 PL_regcomp_parse += numlen;
3404 /* Some compilers cannot handle switching on 64-bit integer
3405 * values, therefore value cannot be an UV. Yes, this will
3406 * be a problem later if we want switch on Unicode. --jhi */
3408 case 'w': namedclass = ANYOF_ALNUM; break;
3409 case 'W': namedclass = ANYOF_NALNUM; break;
3410 case 's': namedclass = ANYOF_SPACE; break;
3411 case 'S': namedclass = ANYOF_NSPACE; break;
3412 case 'd': namedclass = ANYOF_DIGIT; break;
3413 case 'D': namedclass = ANYOF_NDIGIT; break;
3416 if (*PL_regcomp_parse == '{') {
3417 e = strchr(PL_regcomp_parse++, '}');
3419 FAIL("Missing right brace on \\p{}");
3420 n = e - PL_regcomp_parse;
3423 e = PL_regcomp_parse;
3428 Perl_sv_catpvf(aTHX_ listsv,
3429 "+utf8::%.*s\n", (int)n, PL_regcomp_parse);
3431 Perl_sv_catpvf(aTHX_ listsv,
3432 "!utf8::%.*s\n", (int)n, PL_regcomp_parse);
3434 PL_regcomp_parse = e + 1;
3435 lastvalue = OOB_UTF8;
3437 case 'n': value = '\n'; break;
3438 case 'r': value = '\r'; break;
3439 case 't': value = '\t'; break;
3440 case 'f': value = '\f'; break;
3441 case 'b': value = '\b'; break;
3443 case 'e': value = '\033'; break;
3444 case 'a': value = '\007'; break;
3446 case 'e': value = '\047'; break;
3447 case 'a': value = '\057'; break;
3450 if (*PL_regcomp_parse == '{') {
3451 e = strchr(PL_regcomp_parse++, '}');
3453 FAIL("Missing right brace on \\x{}");
3454 numlen = 1; /* allow underscores */
3455 value = (UV)scan_hex(PL_regcomp_parse,
3456 e - PL_regcomp_parse,
3458 PL_regcomp_parse = e + 1;
3461 numlen = 0; /* disallow underscores */
3462 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
3463 PL_regcomp_parse += numlen;
3467 value = UCHARAT(PL_regcomp_parse++);
3468 value = toCTRL(value);
3470 case '0': case '1': case '2': case '3': case '4':
3471 case '5': case '6': case '7': case '8': case '9':
3472 numlen = 0; /* disallow underscores */
3473 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
3474 PL_regcomp_parse += numlen;
3477 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3478 Perl_warner(aTHX_ WARN_REGEXP,
3479 "/%.127s/: Unrecognized escape \\%c in character class passed through",
3485 if (namedclass > OOB_NAMEDCLASS) {
3486 if (range) { /* a-\d, a-[:digit:] */
3488 if (ckWARN(WARN_REGEXP))
3489 Perl_warner(aTHX_ WARN_REGEXP,
3490 "/%.127s/: false [] range \"%*.*s\" in regexp",
3492 PL_regcomp_parse - rangebegin,
3493 PL_regcomp_parse - rangebegin,
3495 Perl_sv_catpvf(aTHX_ listsv,
3496 /* 0x002D is Unicode for '-' */
3497 "%04"UVxf"\n002D\n", (UV)lastvalue);
3502 switch (namedclass) {
3504 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
3506 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
3508 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
3510 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
3512 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
3514 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
3516 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
3518 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
3520 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
3522 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
3524 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
3526 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
3528 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
3530 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
3532 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
3534 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
3536 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
3538 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
3540 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
3542 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
3544 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
3546 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
3548 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
3550 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
3552 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
3554 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
3560 if (lastvalue > value) { /* b-a */
3562 "/%.127s/: invalid [] range \"%*.*s\" in regexp",
3564 PL_regcomp_parse - rangebegin,
3565 PL_regcomp_parse - rangebegin,
3572 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3573 PL_regcomp_parse[1] != ']') {
3575 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3576 if (ckWARN(WARN_REGEXP))
3577 Perl_warner(aTHX_ WARN_REGEXP,
3578 "/%.127s/: false [] range \"%*.*s\" in regexp",
3580 PL_regcomp_parse - rangebegin,
3581 PL_regcomp_parse - rangebegin,
3584 Perl_sv_catpvf(aTHX_ listsv,
3585 /* 0x002D is Unicode for '-' */
3589 continue; /* do it next time */
3592 /* now is the next time */
3594 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3595 (UV)lastvalue, (UV)value);
3599 ret = reganode(ANYOFUTF8, 0);
3602 SV *rv = swash_init("utf8", "", listsv, 1, 0);
3603 SvREFCNT_dec(listsv);
3604 n = add_data(1,"s");
3605 PL_regcomp_rx->data->data[n] = (void*)rv;
3606 ARG1_SET(ret, flags);
3617 char* retval = PL_regcomp_parse++;
3620 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
3621 PL_regcomp_parse[2] == '#') {
3622 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
3627 if (PL_regflags & PMf_EXTENDED) {
3628 if (isSPACE(*PL_regcomp_parse)) {
3632 else if (*PL_regcomp_parse == '#') {
3633 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
3644 - reg_node - emit a node
3646 STATIC regnode * /* Location. */
3647 S_reg_node(pTHX_ U8 op)
3650 register regnode *ret;
3651 register regnode *ptr;
3655 SIZE_ALIGN(PL_regsize);
3660 NODE_ALIGN_FILL(ret);
3662 FILL_ADVANCE_NODE(ptr, op);
3669 - reganode - emit a node with an argument
3671 STATIC regnode * /* Location. */
3672 S_reganode(pTHX_ U8 op, U32 arg)
3675 register regnode *ret;
3676 register regnode *ptr;
3680 SIZE_ALIGN(PL_regsize);
3685 NODE_ALIGN_FILL(ret);
3687 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3694 - reguni - emit (if appropriate) a Unicode character
3697 S_reguni(pTHX_ UV uv, char* s, I32* lenp)
3701 U8 tmpbuf[UTF8_MAXLEN];
3702 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
3705 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
3710 - reginsert - insert an operator in front of already-emitted operand
3712 * Means relocating the operand.
3715 S_reginsert(pTHX_ U8 op, regnode *opnd)
3718 register regnode *src;
3719 register regnode *dst;
3720 register regnode *place;
3721 register int offset = regarglen[(U8)op];
3723 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3726 PL_regsize += NODE_STEP_REGNODE + offset;
3731 PL_regcode += NODE_STEP_REGNODE + offset;
3734 StructCopy(--src, --dst, regnode);
3736 place = opnd; /* Op node, where operand used to be. */
3737 src = NEXTOPER(place);
3738 FILL_ADVANCE_NODE(place, op);
3739 Zero(src, offset, regnode);
3743 - regtail - set the next-pointer at the end of a node chain of p to val.
3746 S_regtail(pTHX_ regnode *p, regnode *val)
3749 register regnode *scan;
3750 register regnode *temp;
3755 /* Find last node. */
3758 temp = regnext(scan);
3764 if (reg_off_by_arg[OP(scan)]) {
3765 ARG_SET(scan, val - scan);
3768 NEXT_OFF(scan) = val - scan;
3773 - regoptail - regtail on operand of first argument; nop if operandless
3776 S_regoptail(pTHX_ regnode *p, regnode *val)
3779 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3780 if (p == NULL || SIZE_ONLY)
3782 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3783 regtail(NEXTOPER(p), val);
3785 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3786 regtail(NEXTOPER(NEXTOPER(p)), val);
3793 - regcurly - a little FSA that accepts {\d+,?\d*}
3796 S_regcurly(pTHX_ register char *s)
3815 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
3818 register U8 op = EXACT; /* Arbitrary non-END op. */
3819 register regnode *next;
3821 while (op != END && (!last || node < last)) {
3822 /* While that wasn't END last time... */
3828 next = regnext(node);
3830 if (OP(node) == OPTIMIZED)
3833 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
3834 (int)(2*l + 1), "", SvPVX(sv));
3835 if (next == NULL) /* Next ptr. */
3836 PerlIO_printf(Perl_debug_log, "(0)");
3838 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
3839 (void)PerlIO_putc(Perl_debug_log, '\n');
3841 if (PL_regkind[(U8)op] == BRANCHJ) {
3842 register regnode *nnode = (OP(next) == LONGJMP
3845 if (last && nnode > last)
3847 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
3849 else if (PL_regkind[(U8)op] == BRANCH) {
3850 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
3852 else if ( op == CURLY) { /* `next' might be very big: optimizer */
3853 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3854 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
3856 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
3857 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3860 else if ( op == PLUS || op == STAR) {
3861 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
3863 else if (op == ANYOF) {
3864 node = NEXTOPER(node);
3867 else if (PL_regkind[(U8)op] == EXACT) {
3868 /* Literal string, where present. */
3869 node += NODE_SZ_STR(node) - 1;
3870 node = NEXTOPER(node);
3873 node = NEXTOPER(node);
3874 node += regarglen[(U8)op];
3876 if (op == CURLYX || op == OPEN)
3878 else if (op == WHILEM)
3881 #endif /* DEBUGGING */
3886 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
3889 Perl_regdump(pTHX_ regexp *r)
3893 SV *sv = sv_newmortal();
3895 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
3897 /* Header fields of interest. */
3898 if (r->anchored_substr)
3899 PerlIO_printf(Perl_debug_log,
3900 "anchored `%s%.*s%s'%s at %"IVdf" ",
3902 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
3903 SvPVX(r->anchored_substr),
3905 SvTAIL(r->anchored_substr) ? "$" : "",
3906 (IV)r->anchored_offset);
3907 if (r->float_substr)
3908 PerlIO_printf(Perl_debug_log,
3909 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
3911 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
3912 SvPVX(r->float_substr),
3914 SvTAIL(r->float_substr) ? "$" : "",
3915 (IV)r->float_min_offset, (UV)r->float_max_offset);
3916 if (r->check_substr)
3917 PerlIO_printf(Perl_debug_log,
3918 r->check_substr == r->float_substr
3919 ? "(checking floating" : "(checking anchored");
3920 if (r->reganch & ROPT_NOSCAN)
3921 PerlIO_printf(Perl_debug_log, " noscan");
3922 if (r->reganch & ROPT_CHECK_ALL)
3923 PerlIO_printf(Perl_debug_log, " isall");
3924 if (r->check_substr)
3925 PerlIO_printf(Perl_debug_log, ") ");
3927 if (r->regstclass) {
3928 regprop(sv, r->regstclass);
3929 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
3931 if (r->reganch & ROPT_ANCH) {
3932 PerlIO_printf(Perl_debug_log, "anchored");
3933 if (r->reganch & ROPT_ANCH_BOL)
3934 PerlIO_printf(Perl_debug_log, "(BOL)");
3935 if (r->reganch & ROPT_ANCH_MBOL)
3936 PerlIO_printf(Perl_debug_log, "(MBOL)");
3937 if (r->reganch & ROPT_ANCH_SBOL)
3938 PerlIO_printf(Perl_debug_log, "(SBOL)");
3939 if (r->reganch & ROPT_ANCH_GPOS)
3940 PerlIO_printf(Perl_debug_log, "(GPOS)");
3941 PerlIO_putc(Perl_debug_log, ' ');
3943 if (r->reganch & ROPT_GPOS_SEEN)
3944 PerlIO_printf(Perl_debug_log, "GPOS ");
3945 if (r->reganch & ROPT_SKIP)
3946 PerlIO_printf(Perl_debug_log, "plus ");
3947 if (r->reganch & ROPT_IMPLICIT)
3948 PerlIO_printf(Perl_debug_log, "implicit ");
3949 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
3950 if (r->reganch & ROPT_EVAL_SEEN)
3951 PerlIO_printf(Perl_debug_log, "with eval ");
3952 PerlIO_printf(Perl_debug_log, "\n");
3953 #endif /* DEBUGGING */
3957 S_put_byte(pTHX_ SV *sv, int c)
3959 if (c <= ' ' || c == 127 || c == 255)
3960 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
3961 else if (c == '-' || c == ']' || c == '\\' || c == '^')
3962 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
3964 Perl_sv_catpvf(aTHX_ sv, "%c", c);
3968 - regprop - printable representation of opcode
3971 Perl_regprop(pTHX_ SV *sv, regnode *o)
3977 sv_setpvn(sv, "", 0);
3978 if (OP(o) >= reg_num) /* regnode.type is unsigned */
3979 FAIL("corrupted regexp opcode");
3980 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
3982 k = PL_regkind[(U8)OP(o)];
3985 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
3986 STR_LEN(o), STRING(o), PL_colors[1]);
3987 else if (k == CURLY) {
3988 if (OP(o) == CURLYM || OP(o) == CURLYN)
3989 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
3990 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
3992 else if (k == WHILEM && o->flags) /* Ordinal/of */
3993 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
3994 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
3995 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
3996 else if (k == LOGICAL)
3997 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
3998 else if (k == ANYOF) {
3999 int i, rangestart = -1;
4000 const char * const out[] = { /* Should be syncronized with
4001 a table in regcomp.h */
4030 if (o->flags & ANYOF_LOCALE)
4031 sv_catpv(sv, "{loc}");
4032 if (o->flags & ANYOF_FOLD)
4033 sv_catpv(sv, "{i}");
4034 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4035 if (o->flags & ANYOF_INVERT)
4037 for (i = 0; i <= 256; i++) {
4038 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4039 if (rangestart == -1)
4041 } else if (rangestart != -1) {
4042 if (i <= rangestart + 3)
4043 for (; rangestart < i; rangestart++)
4044 put_byte(sv, rangestart);
4046 put_byte(sv, rangestart);
4048 put_byte(sv, i - 1);
4053 if (o->flags & ANYOF_CLASS)
4054 for (i = 0; i < sizeof(out)/sizeof(char*); i++)
4055 if (ANYOF_CLASS_TEST(o,i))
4056 sv_catpv(sv, out[i]);
4057 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4059 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4060 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4061 #endif /* DEBUGGING */
4065 Perl_re_intuit_string(pTHX_ regexp *prog)
4066 { /* Assume that RE_INTUIT is set */
4069 char *s = SvPV(prog->check_substr,n_a);
4071 if (!PL_colorset) reginitcolors();
4072 PerlIO_printf(Perl_debug_log,
4073 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4074 PL_colors[4],PL_colors[5],PL_colors[0],
4077 (strlen(s) > 60 ? "..." : ""));
4080 return prog->check_substr;
4084 Perl_pregfree(pTHX_ struct regexp *r)
4087 DEBUG_r(if (!PL_colorset) reginitcolors());
4089 if (!r || (--r->refcnt > 0))
4091 DEBUG_r(PerlIO_printf(Perl_debug_log,
4092 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4093 PL_colors[4],PL_colors[5],PL_colors[0],
4096 (strlen(r->precomp) > 60 ? "..." : "")));
4099 Safefree(r->precomp);
4100 if (RX_MATCH_COPIED(r))
4101 Safefree(r->subbeg);
4103 if (r->anchored_substr)
4104 SvREFCNT_dec(r->anchored_substr);
4105 if (r->float_substr)
4106 SvREFCNT_dec(r->float_substr);
4107 Safefree(r->substrs);
4110 int n = r->data->count;
4111 AV* new_comppad = NULL;
4116 switch (r->data->what[n]) {
4118 SvREFCNT_dec((SV*)r->data->data[n]);
4121 Safefree(r->data->data[n]);
4124 new_comppad = (AV*)r->data->data[n];
4127 if (new_comppad == NULL)
4128 Perl_croak(aTHX_ "panic: pregfree comppad");
4129 old_comppad = PL_comppad;
4130 old_curpad = PL_curpad;
4131 PL_comppad = new_comppad;
4132 PL_curpad = AvARRAY(new_comppad);
4133 op_free((OP_4tree*)r->data->data[n]);
4134 PL_comppad = old_comppad;
4135 PL_curpad = old_curpad;
4136 SvREFCNT_dec((SV*)new_comppad);
4142 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
4145 Safefree(r->data->what);
4148 Safefree(r->startp);
4154 - regnext - dig the "next" pointer out of a node
4156 * [Note, when REGALIGN is defined there are two places in regmatch()
4157 * that bypass this code for speed.]
4160 Perl_regnext(pTHX_ register regnode *p)
4163 register I32 offset;
4165 if (p == &PL_regdummy)
4168 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4176 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4179 STRLEN l1 = strlen(pat1);
4180 STRLEN l2 = strlen(pat2);
4189 Copy(pat1, buf, l1 , char);
4190 Copy(pat2, buf + l1, l2 , char);
4191 buf[l1 + l2] = '\n';
4192 buf[l1 + l2 + 1] = '\0';
4194 /* ANSI variant takes additional second argument */
4195 va_start(args, pat2);
4199 msv = vmess(buf, &args);
4201 message = SvPV(msv,l1);
4204 Copy(message, buf, l1 , char);
4205 buf[l1] = '\0'; /* Overwrite \n */
4206 Perl_croak(aTHX_ "%s", buf);
4209 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4212 Perl_save_re_context(pTHX)
4216 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
4217 SAVEI32(PL_regnpar); /* () count. */
4218 SAVEI32(PL_regsize); /* Code size. */
4219 SAVEI16(PL_regflags); /* are we folding, multilining? */
4220 SAVEPPTR(PL_reginput); /* String-input pointer. */
4221 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4222 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4223 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4224 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4225 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4226 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4227 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4228 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4229 PL_reg_start_tmp = 0;
4230 SAVEFREEPV(PL_reg_start_tmp);
4231 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4232 PL_reg_start_tmpl = 0;
4233 SAVEVPTR(PL_regdata);
4234 SAVEI32(PL_reg_flags); /* from regexec.c */
4235 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4236 SAVEI32(PL_regnarrate); /* from regexec.c */
4237 SAVEVPTR(PL_regprogram); /* from regexec.c */
4238 SAVEINT(PL_regindent); /* from regexec.c */
4239 SAVEVPTR(PL_regcc); /* from regexec.c */
4240 SAVEVPTR(PL_curcop);
4241 SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */
4242 SAVEI32(PL_regseen); /* from regcomp.c */
4243 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
4244 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
4245 SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
4246 SAVEPPTR(PL_regxend); /* End of input for compile */
4247 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
4248 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4249 SAVEVPTR(PL_reg_re); /* from regexec.c */
4250 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4251 SAVESPTR(PL_reg_sv); /* from regexec.c */
4252 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4253 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4254 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4255 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4257 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4268 clear_re(pTHXo_ void *r)
4270 ReREFCNT_dec((regexp *)r);