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;
155 struct regnode_charclass_class *start_class;
159 * Forward declarations for pregcomp()'s friends.
162 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
165 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
166 #define SF_BEFORE_SEOL 0x1
167 #define SF_BEFORE_MEOL 0x2
168 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
169 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
172 # define SF_FIX_SHIFT_EOL (0+2)
173 # define SF_FL_SHIFT_EOL (0+4)
175 # define SF_FIX_SHIFT_EOL (+2)
176 # define SF_FL_SHIFT_EOL (+4)
179 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
180 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
182 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
183 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
184 #define SF_IS_INF 0x40
185 #define SF_HAS_PAR 0x80
186 #define SF_IN_PAR 0x100
187 #define SF_HAS_EVAL 0x200
188 #define SCF_DO_SUBSTR 0x400
189 #define SCF_DO_STCLASS_AND 0x0800
190 #define SCF_DO_STCLASS_OR 0x1000
191 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
194 #define UTF (PL_reg_flags & RF_utf8)
195 #define LOC (PL_regflags & PMf_LOCALE)
196 #define FOLD (PL_regflags & PMf_FOLD)
198 #define OOB_CHAR8 1234
199 #define OOB_UTF8 123456
200 #define OOB_NAMEDCLASS -1
202 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
203 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
206 /* length of regex to show in messages that don't mark a position within */
207 #define RegexLengthToShowInErrorMessages 127
210 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
211 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
212 * op/pragma/warn/regcomp.
214 #define MARKER1 "HERE" /* marker as it appears in the description */
215 #define MARKER2 " << HERE " /* marker as it appears within the regex */
217 #define REPORT_LOCATION " before " MARKER1 " mark in regex m/%.*s" MARKER2 "%s/"
220 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
221 * arg. Show regex, up to a maximum length. If it's too long, chop and add
226 char *ellipses = ""; \
227 unsigned len = strlen(PL_regprecomp); \
230 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
232 if (len > RegexLengthToShowInErrorMessages) { \
233 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
234 len = RegexLengthToShowInErrorMessages - 10; \
237 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
238 msg, (int)len, PL_regprecomp, ellipses); \
242 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
243 * args. Show regex, up to a maximum length. If it's too long, chop and add
246 #define FAIL2(pat,msg) \
248 char *ellipses = ""; \
249 unsigned len = strlen(PL_regprecomp); \
252 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
254 if (len > RegexLengthToShowInErrorMessages) { \
255 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
256 len = RegexLengthToShowInErrorMessages - 10; \
259 S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \
260 msg, (int)len, PL_regprecomp, ellipses); \
265 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
267 #define Simple_vFAIL(m) \
269 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \
271 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
272 m, (int)offset, PL_regprecomp, PL_regprecomp + offset); \
276 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
281 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
286 * Like Simple_vFAIL(), but accepts two arguments.
288 #define Simple_vFAIL2(m,a1) \
290 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \
292 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
293 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
297 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
299 #define vFAIL2(m,a1) \
302 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
303 Simple_vFAIL2(m, a1); \
308 * Like Simple_vFAIL(), but accepts three arguments.
310 #define Simple_vFAIL3(m, a1, a2) \
312 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \
314 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
315 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
319 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
321 #define vFAIL3(m,a1,a2) \
324 SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \
325 Simple_vFAIL3(m, a1, a2); \
329 * Like Simple_vFAIL(), but accepts four arguments.
331 #define Simple_vFAIL4(m, a1, a2, a3) \
333 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \
335 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3,\
336 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
340 * Like Simple_vFAIL(), but accepts five arguments.
342 #define Simple_vFAIL5(m, a1, a2, a3, a4) \
344 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \
345 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, a4,\
346 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
350 #define vWARN(loc,m) \
352 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \
353 Perl_warner(aTHX_ WARN_REGEXP, "%s" REPORT_LOCATION,\
354 m, (int)offset, PL_regprecomp, PL_regprecomp + offset); \
358 #define vWARN2(loc, m, a1) \
360 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \
361 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
363 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
366 #define vWARN3(loc, m, a1, a2) \
368 unsigned offset = strlen(PL_regprecomp) - (PL_regxend - (loc)); \
369 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
371 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
374 #define vWARN4(loc, m, a1, a2, a3) \
376 unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \
377 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
379 (int)offset, PL_regprecomp, PL_regprecomp + offset); \
384 /* Allow for side effects in s */
385 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END
387 static void clear_re(pTHXo_ void *r);
389 /* Mark that we cannot extend a found fixed substring at this point.
390 Updata the longest found anchored substring and the longest found
391 floating substrings if needed. */
394 S_scan_commit(pTHX_ scan_data_t *data)
397 STRLEN l = CHR_SVLEN(data->last_found);
398 STRLEN old_l = CHR_SVLEN(*data->longest);
400 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
401 sv_setsv(*data->longest, data->last_found);
402 if (*data->longest == data->longest_fixed) {
403 data->offset_fixed = l ? data->last_start_min : data->pos_min;
404 if (data->flags & SF_BEFORE_EOL)
406 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
408 data->flags &= ~SF_FIX_BEFORE_EOL;
411 data->offset_float_min = l ? data->last_start_min : data->pos_min;
412 data->offset_float_max = (l
413 ? data->last_start_max
414 : data->pos_min + data->pos_delta);
415 if (data->flags & SF_BEFORE_EOL)
417 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
419 data->flags &= ~SF_FL_BEFORE_EOL;
422 SvCUR_set(data->last_found, 0);
424 data->flags &= ~SF_BEFORE_EOL;
427 /* Can match anything (initialization) */
429 S_cl_anything(pTHX_ struct regnode_charclass_class *cl)
433 ANYOF_CLASS_ZERO(cl);
434 for (value = 0; value < 256; ++value)
435 ANYOF_BITMAP_SET(cl, value);
436 cl->flags = ANYOF_EOS;
438 cl->flags |= ANYOF_LOCALE;
441 /* Can match anything (initialization) */
443 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
447 for (value = 0; value <= ANYOF_MAX; value += 2)
448 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
450 for (value = 0; value < 256; ++value)
451 if (!ANYOF_BITMAP_TEST(cl, value))
456 /* Can match anything (initialization) */
458 S_cl_init(pTHX_ struct regnode_charclass_class *cl)
460 Zero(cl, 1, struct regnode_charclass_class);
466 S_cl_init_zero(pTHX_ struct regnode_charclass_class *cl)
468 Zero(cl, 1, struct regnode_charclass_class);
472 cl->flags |= ANYOF_LOCALE;
475 /* 'And' a given class with another one. Can create false positives */
476 /* We assume that cl is not inverted */
478 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
479 struct regnode_charclass_class *and_with)
481 if (!(and_with->flags & ANYOF_CLASS)
482 && !(cl->flags & ANYOF_CLASS)
483 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
484 && !(and_with->flags & ANYOF_FOLD)
485 && !(cl->flags & ANYOF_FOLD)) {
488 if (and_with->flags & ANYOF_INVERT)
489 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
490 cl->bitmap[i] &= ~and_with->bitmap[i];
492 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
493 cl->bitmap[i] &= and_with->bitmap[i];
494 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
495 if (!(and_with->flags & ANYOF_EOS))
496 cl->flags &= ~ANYOF_EOS;
499 /* 'OR' a given class with another one. Can create false positives */
500 /* We assume that cl is not inverted */
502 S_cl_or(pTHX_ struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
504 if (or_with->flags & ANYOF_INVERT) {
506 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
507 * <= (B1 | !B2) | (CL1 | !CL2)
508 * which is wasteful if CL2 is small, but we ignore CL2:
509 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
510 * XXXX Can we handle case-fold? Unclear:
511 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
512 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
514 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
515 && !(or_with->flags & ANYOF_FOLD)
516 && !(cl->flags & ANYOF_FOLD) ) {
519 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
520 cl->bitmap[i] |= ~or_with->bitmap[i];
521 } /* XXXX: logic is complicated otherwise */
526 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
527 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
528 && (!(or_with->flags & ANYOF_FOLD)
529 || (cl->flags & ANYOF_FOLD)) ) {
532 /* OR char bitmap and class bitmap separately */
533 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
534 cl->bitmap[i] |= or_with->bitmap[i];
535 if (or_with->flags & ANYOF_CLASS) {
536 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
537 cl->classflags[i] |= or_with->classflags[i];
538 cl->flags |= ANYOF_CLASS;
541 else { /* XXXX: logic is complicated, leave it along for a moment. */
545 if (or_with->flags & ANYOF_EOS)
546 cl->flags |= ANYOF_EOS;
549 /* REx optimizer. Converts nodes into quickier variants "in place".
550 Finds fixed substrings. */
552 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
553 to the position after last scanned or to NULL. */
556 S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
557 /* scanp: Start here (read-write). */
558 /* deltap: Write maxlen-minlen here. */
559 /* last: Stop before this one. */
562 I32 min = 0, pars = 0, code;
563 regnode *scan = *scanp, *next;
565 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
566 int is_inf_internal = 0; /* The studied chunk is infinite */
567 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
568 scan_data_t data_fake;
569 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
571 while (scan && OP(scan) != END && scan < last) {
572 /* Peephole optimizer: */
574 if (PL_regkind[(U8)OP(scan)] == EXACT) {
575 /* Merge several consecutive EXACTish nodes into one. */
576 regnode *n = regnext(scan);
579 regnode *stop = scan;
582 next = scan + NODE_SZ_STR(scan);
583 /* Skip NOTHING, merge EXACT*. */
585 ( PL_regkind[(U8)OP(n)] == NOTHING ||
586 (stringok && (OP(n) == OP(scan))))
588 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
589 if (OP(n) == TAIL || n > next)
591 if (PL_regkind[(U8)OP(n)] == NOTHING) {
592 NEXT_OFF(scan) += NEXT_OFF(n);
593 next = n + NODE_STEP_REGNODE;
601 int oldl = STR_LEN(scan);
602 regnode *nnext = regnext(n);
604 if (oldl + STR_LEN(n) > U8_MAX)
606 NEXT_OFF(scan) += NEXT_OFF(n);
607 STR_LEN(scan) += STR_LEN(n);
608 next = n + NODE_SZ_STR(n);
609 /* Now we can overwrite *n : */
610 Move(STRING(n), STRING(scan) + oldl,
621 n = scan + NODE_SZ_STR(scan);
623 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
631 /* Follow the next-chain of the current node and optimize
632 away all the NOTHINGs from it. */
633 if (OP(scan) != CURLYX) {
634 int max = (reg_off_by_arg[OP(scan)]
636 /* I32 may be smaller than U16 on CRAYs! */
637 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
638 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
642 /* Skip NOTHING and LONGJMP. */
643 while ((n = regnext(n))
644 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
645 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
648 if (reg_off_by_arg[OP(scan)])
651 NEXT_OFF(scan) = off;
653 /* The principal pseudo-switch. Cannot be a switch, since we
654 look into several different things. */
655 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
656 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
657 next = regnext(scan);
660 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
661 I32 max1 = 0, min1 = I32_MAX, num = 0;
662 struct regnode_charclass_class accum;
664 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
665 scan_commit(data); /* Cannot merge strings after this. */
666 if (flags & SCF_DO_STCLASS)
667 cl_init_zero(&accum);
668 while (OP(scan) == code) {
669 I32 deltanext, minnext, f = 0, fake = 0;
670 struct regnode_charclass_class this_class;
675 data_fake.whilem_c = data->whilem_c;
676 data_fake.last_closep = data->last_closep;
679 data_fake.last_closep = &fake;
680 next = regnext(scan);
681 scan = NEXTOPER(scan);
683 scan = NEXTOPER(scan);
684 if (flags & SCF_DO_STCLASS) {
685 cl_init(&this_class);
686 data_fake.start_class = &this_class;
687 f = SCF_DO_STCLASS_AND;
689 /* we suppose the run is continuous, last=next...*/
690 minnext = study_chunk(&scan, &deltanext, next,
694 if (max1 < minnext + deltanext)
695 max1 = minnext + deltanext;
696 if (deltanext == I32_MAX)
697 is_inf = is_inf_internal = 1;
699 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
701 if (data && (data_fake.flags & SF_HAS_EVAL))
702 data->flags |= SF_HAS_EVAL;
704 data->whilem_c = data_fake.whilem_c;
705 if (flags & SCF_DO_STCLASS)
706 cl_or(&accum, &this_class);
710 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
712 if (flags & SCF_DO_SUBSTR) {
713 data->pos_min += min1;
714 data->pos_delta += max1 - min1;
715 if (max1 != min1 || is_inf)
716 data->longest = &(data->longest_float);
719 delta += max1 - min1;
720 if (flags & SCF_DO_STCLASS_OR) {
721 cl_or(data->start_class, &accum);
723 cl_and(data->start_class, &and_with);
724 flags &= ~SCF_DO_STCLASS;
727 else if (flags & SCF_DO_STCLASS_AND) {
729 cl_and(data->start_class, &accum);
730 flags &= ~SCF_DO_STCLASS;
733 /* Switch to OR mode: cache the old value of
734 * data->start_class */
735 StructCopy(data->start_class, &and_with,
736 struct regnode_charclass_class);
737 flags &= ~SCF_DO_STCLASS_AND;
738 StructCopy(&accum, data->start_class,
739 struct regnode_charclass_class);
740 flags |= SCF_DO_STCLASS_OR;
741 data->start_class->flags |= ANYOF_EOS;
745 else if (code == BRANCHJ) /* single branch is optimized. */
746 scan = NEXTOPER(NEXTOPER(scan));
747 else /* single branch is optimized. */
748 scan = NEXTOPER(scan);
751 else if (OP(scan) == EXACT) {
752 I32 l = STR_LEN(scan);
754 unsigned char *s = (unsigned char *)STRING(scan);
755 unsigned char *e = s + l;
764 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
765 /* The code below prefers earlier match for fixed
766 offset, later match for variable offset. */
767 if (data->last_end == -1) { /* Update the start info. */
768 data->last_start_min = data->pos_min;
769 data->last_start_max = is_inf
770 ? I32_MAX : data->pos_min + data->pos_delta;
772 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
773 data->last_end = data->pos_min + l;
774 data->pos_min += l; /* As in the first entry. */
775 data->flags &= ~SF_BEFORE_EOL;
777 if (flags & SCF_DO_STCLASS_AND) {
778 /* Check whether it is compatible with what we know already! */
781 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
782 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
783 && (!(data->start_class->flags & ANYOF_FOLD)
784 || !ANYOF_BITMAP_TEST(data->start_class,
785 PL_fold[*(U8*)STRING(scan)])))
787 ANYOF_CLASS_ZERO(data->start_class);
788 ANYOF_BITMAP_ZERO(data->start_class);
790 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
791 data->start_class->flags &= ~ANYOF_EOS;
793 else if (flags & SCF_DO_STCLASS_OR) {
794 /* false positive possible if the class is case-folded */
795 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
796 data->start_class->flags &= ~ANYOF_EOS;
797 cl_and(data->start_class, &and_with);
799 flags &= ~SCF_DO_STCLASS;
801 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
802 I32 l = STR_LEN(scan);
804 /* Search for fixed substrings supports EXACT only. */
805 if (flags & SCF_DO_SUBSTR)
808 unsigned char *s = (unsigned char *)STRING(scan);
809 unsigned char *e = s + l;
818 if (data && (flags & SCF_DO_SUBSTR))
820 if (flags & SCF_DO_STCLASS_AND) {
821 /* Check whether it is compatible with what we know already! */
824 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
825 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
826 && !ANYOF_BITMAP_TEST(data->start_class,
827 PL_fold[*(U8*)STRING(scan)]))
829 ANYOF_CLASS_ZERO(data->start_class);
830 ANYOF_BITMAP_ZERO(data->start_class);
832 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
833 data->start_class->flags &= ~ANYOF_EOS;
834 data->start_class->flags |= ANYOF_FOLD;
835 if (OP(scan) == EXACTFL)
836 data->start_class->flags |= ANYOF_LOCALE;
839 else if (flags & SCF_DO_STCLASS_OR) {
840 if (data->start_class->flags & ANYOF_FOLD) {
841 /* false positive possible if the class is case-folded.
842 Assume that the locale settings are the same... */
843 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
844 data->start_class->flags &= ~ANYOF_EOS;
846 cl_and(data->start_class, &and_with);
848 flags &= ~SCF_DO_STCLASS;
850 else if (strchr((char*)PL_varies,OP(scan))) {
851 I32 mincount, maxcount, minnext, deltanext, fl;
852 I32 f = flags, pos_before = 0;
853 regnode *oscan = scan;
854 struct regnode_charclass_class this_class;
855 struct regnode_charclass_class *oclass = NULL;
857 switch (PL_regkind[(U8)OP(scan)]) {
858 case WHILEM: /* End of (?:...)* . */
859 scan = NEXTOPER(scan);
862 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
863 next = NEXTOPER(scan);
864 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
866 maxcount = REG_INFTY;
867 next = regnext(scan);
868 scan = NEXTOPER(scan);
872 if (flags & SCF_DO_SUBSTR)
877 if (flags & SCF_DO_STCLASS) {
879 maxcount = REG_INFTY;
880 next = regnext(scan);
881 scan = NEXTOPER(scan);
884 is_inf = is_inf_internal = 1;
885 scan = regnext(scan);
886 if (flags & SCF_DO_SUBSTR) {
887 scan_commit(data); /* Cannot extend fixed substrings */
888 data->longest = &(data->longest_float);
890 goto optimize_curly_tail;
892 mincount = ARG1(scan);
893 maxcount = ARG2(scan);
894 next = regnext(scan);
895 if (OP(scan) == CURLYX) {
896 I32 lp = (data ? *(data->last_closep) : 0);
898 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
900 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
902 if (flags & SCF_DO_SUBSTR) {
903 if (mincount == 0) scan_commit(data); /* Cannot extend fixed substrings */
904 pos_before = data->pos_min;
908 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
910 data->flags |= SF_IS_INF;
912 if (flags & SCF_DO_STCLASS) {
913 cl_init(&this_class);
914 oclass = data->start_class;
915 data->start_class = &this_class;
916 f |= SCF_DO_STCLASS_AND;
917 f &= ~SCF_DO_STCLASS_OR;
920 /* This will finish on WHILEM, setting scan, or on NULL: */
921 minnext = study_chunk(&scan, &deltanext, last, data,
923 ? (f & ~SCF_DO_SUBSTR) : f);
925 if (flags & SCF_DO_STCLASS)
926 data->start_class = oclass;
927 if (mincount == 0 || minnext == 0) {
928 if (flags & SCF_DO_STCLASS_OR) {
929 cl_or(data->start_class, &this_class);
931 else if (flags & SCF_DO_STCLASS_AND) {
932 /* Switch to OR mode: cache the old value of
933 * data->start_class */
934 StructCopy(data->start_class, &and_with,
935 struct regnode_charclass_class);
936 flags &= ~SCF_DO_STCLASS_AND;
937 StructCopy(&this_class, data->start_class,
938 struct regnode_charclass_class);
939 flags |= SCF_DO_STCLASS_OR;
940 data->start_class->flags |= ANYOF_EOS;
942 } else { /* Non-zero len */
943 if (flags & SCF_DO_STCLASS_OR) {
944 cl_or(data->start_class, &this_class);
945 cl_and(data->start_class, &and_with);
947 else if (flags & SCF_DO_STCLASS_AND)
948 cl_and(data->start_class, &this_class);
949 flags &= ~SCF_DO_STCLASS;
951 if (!scan) /* It was not CURLYX, but CURLY. */
953 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
954 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
955 && maxcount <= REG_INFTY/3) /* Complement check for big count */
957 vWARN(PL_regcomp_parse,
958 "Quantifier unexpected on zero-length expression");
961 min += minnext * mincount;
962 is_inf_internal |= ((maxcount == REG_INFTY
963 && (minnext + deltanext) > 0)
964 || deltanext == I32_MAX);
965 is_inf |= is_inf_internal;
966 delta += (minnext + deltanext) * maxcount - minnext * mincount;
968 /* Try powerful optimization CURLYX => CURLYN. */
969 if ( OP(oscan) == CURLYX && data
970 && data->flags & SF_IN_PAR
971 && !(data->flags & SF_HAS_EVAL)
972 && !deltanext && minnext == 1 ) {
973 /* Try to optimize to CURLYN. */
974 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
975 regnode *nxt1 = nxt, *nxt2;
979 if (!strchr((char*)PL_simple,OP(nxt))
980 && !(PL_regkind[(U8)OP(nxt)] == EXACT
981 && STR_LEN(nxt) == 1))
985 if (OP(nxt) != CLOSE)
987 /* Now we know that nxt2 is the only contents: */
988 oscan->flags = ARG(nxt);
990 OP(nxt1) = NOTHING; /* was OPEN. */
992 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
993 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
994 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
995 OP(nxt) = OPTIMIZED; /* was CLOSE. */
996 OP(nxt + 1) = OPTIMIZED; /* was count. */
997 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1002 /* Try optimization CURLYX => CURLYM. */
1003 if ( OP(oscan) == CURLYX && data
1004 && !(data->flags & SF_HAS_PAR)
1005 && !(data->flags & SF_HAS_EVAL)
1007 /* XXXX How to optimize if data == 0? */
1008 /* Optimize to a simpler form. */
1009 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1013 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1014 && (OP(nxt2) != WHILEM))
1016 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1017 /* Need to optimize away parenths. */
1018 if (data->flags & SF_IN_PAR) {
1019 /* Set the parenth number. */
1020 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1022 if (OP(nxt) != CLOSE)
1023 FAIL("Panic opt close");
1024 oscan->flags = ARG(nxt);
1025 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1026 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1028 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1029 OP(nxt + 1) = OPTIMIZED; /* was count. */
1030 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1031 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1034 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1035 regnode *nnxt = regnext(nxt1);
1038 if (reg_off_by_arg[OP(nxt1)])
1039 ARG_SET(nxt1, nxt2 - nxt1);
1040 else if (nxt2 - nxt1 < U16_MAX)
1041 NEXT_OFF(nxt1) = nxt2 - nxt1;
1043 OP(nxt) = NOTHING; /* Cannot beautify */
1048 /* Optimize again: */
1049 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
1054 else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) {
1055 /* This stays as CURLYX, and can put the count/of pair. */
1056 /* Find WHILEM (as in regexec.c) */
1057 regnode *nxt = oscan + NEXT_OFF(oscan);
1059 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1061 PREVOPER(nxt)->flags = data->whilem_c
1062 | (PL_reg_whilem_seen << 4); /* On WHILEM */
1064 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1066 if (flags & SCF_DO_SUBSTR) {
1067 SV *last_str = Nullsv;
1068 int counted = mincount != 0;
1070 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1071 I32 b = pos_before >= data->last_start_min
1072 ? pos_before : data->last_start_min;
1074 char *s = SvPV(data->last_found, l);
1075 I32 old = b - data->last_start_min;
1078 old = utf8_hop((U8*)s, old) - (U8*)s;
1081 /* Get the added string: */
1082 last_str = newSVpvn(s + old, l);
1083 if (deltanext == 0 && pos_before == b) {
1084 /* What was added is a constant string */
1086 SvGROW(last_str, (mincount * l) + 1);
1087 repeatcpy(SvPVX(last_str) + l,
1088 SvPVX(last_str), l, mincount - 1);
1089 SvCUR(last_str) *= mincount;
1090 /* Add additional parts. */
1091 SvCUR_set(data->last_found,
1092 SvCUR(data->last_found) - l);
1093 sv_catsv(data->last_found, last_str);
1094 data->last_end += l * (mincount - 1);
1097 /* start offset must point into the last copy */
1098 data->last_start_min += minnext * (mincount - 1);
1099 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1100 * (minnext + data->pos_delta);
1103 /* It is counted once already... */
1104 data->pos_min += minnext * (mincount - counted);
1105 data->pos_delta += - counted * deltanext +
1106 (minnext + deltanext) * maxcount - minnext * mincount;
1107 if (mincount != maxcount) {
1108 /* Cannot extend fixed substrings found inside
1111 if (mincount && last_str) {
1112 sv_setsv(data->last_found, last_str);
1113 data->last_end = data->pos_min;
1114 data->last_start_min =
1115 data->pos_min - CHR_SVLEN(last_str);
1116 data->last_start_max = is_inf
1118 : data->pos_min + data->pos_delta
1119 - CHR_SVLEN(last_str);
1121 data->longest = &(data->longest_float);
1123 SvREFCNT_dec(last_str);
1125 if (data && (fl & SF_HAS_EVAL))
1126 data->flags |= SF_HAS_EVAL;
1127 optimize_curly_tail:
1128 if (OP(oscan) != CURLYX) {
1129 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1131 NEXT_OFF(oscan) += NEXT_OFF(next);
1134 default: /* REF and CLUMP only? */
1135 if (flags & SCF_DO_SUBSTR) {
1136 scan_commit(data); /* Cannot expect anything... */
1137 data->longest = &(data->longest_float);
1139 is_inf = is_inf_internal = 1;
1140 if (flags & SCF_DO_STCLASS_OR)
1141 cl_anything(data->start_class);
1142 flags &= ~SCF_DO_STCLASS;
1146 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
1149 if (flags & SCF_DO_SUBSTR) {
1154 if (flags & SCF_DO_STCLASS) {
1155 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1157 /* Some of the logic below assumes that switching
1158 locale on will only add false positives. */
1159 switch (PL_regkind[(U8)OP(scan)]) {
1176 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1177 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1178 cl_anything(data->start_class);
1181 if (OP(scan) == SANY)
1183 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1184 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1185 || (data->start_class->flags & ANYOF_CLASS));
1186 cl_anything(data->start_class);
1188 if (flags & SCF_DO_STCLASS_AND || !value)
1189 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1192 if (flags & SCF_DO_STCLASS_AND)
1193 cl_and(data->start_class,
1194 (struct regnode_charclass_class*)scan);
1196 cl_or(data->start_class,
1197 (struct regnode_charclass_class*)scan);
1200 if (flags & SCF_DO_STCLASS_AND) {
1201 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1202 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1203 for (value = 0; value < 256; value++)
1204 if (!isALNUM(value))
1205 ANYOF_BITMAP_CLEAR(data->start_class, value);
1209 if (data->start_class->flags & ANYOF_LOCALE)
1210 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1212 for (value = 0; value < 256; value++)
1214 ANYOF_BITMAP_SET(data->start_class, value);
1219 if (flags & SCF_DO_STCLASS_AND) {
1220 if (data->start_class->flags & ANYOF_LOCALE)
1221 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1224 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1225 data->start_class->flags |= ANYOF_LOCALE;
1229 if (flags & SCF_DO_STCLASS_AND) {
1230 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1231 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1232 for (value = 0; value < 256; value++)
1234 ANYOF_BITMAP_CLEAR(data->start_class, value);
1238 if (data->start_class->flags & ANYOF_LOCALE)
1239 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1241 for (value = 0; value < 256; value++)
1242 if (!isALNUM(value))
1243 ANYOF_BITMAP_SET(data->start_class, value);
1248 if (flags & SCF_DO_STCLASS_AND) {
1249 if (data->start_class->flags & ANYOF_LOCALE)
1250 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1253 data->start_class->flags |= ANYOF_LOCALE;
1254 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1258 if (flags & SCF_DO_STCLASS_AND) {
1259 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1260 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1261 for (value = 0; value < 256; value++)
1262 if (!isSPACE(value))
1263 ANYOF_BITMAP_CLEAR(data->start_class, value);
1267 if (data->start_class->flags & ANYOF_LOCALE)
1268 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1270 for (value = 0; value < 256; value++)
1272 ANYOF_BITMAP_SET(data->start_class, value);
1277 if (flags & SCF_DO_STCLASS_AND) {
1278 if (data->start_class->flags & ANYOF_LOCALE)
1279 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1282 data->start_class->flags |= ANYOF_LOCALE;
1283 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1287 if (flags & SCF_DO_STCLASS_AND) {
1288 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1289 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1290 for (value = 0; value < 256; value++)
1292 ANYOF_BITMAP_CLEAR(data->start_class, value);
1296 if (data->start_class->flags & ANYOF_LOCALE)
1297 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1299 for (value = 0; value < 256; value++)
1300 if (!isSPACE(value))
1301 ANYOF_BITMAP_SET(data->start_class, value);
1306 if (flags & SCF_DO_STCLASS_AND) {
1307 if (data->start_class->flags & ANYOF_LOCALE) {
1308 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1309 for (value = 0; value < 256; value++)
1310 if (!isSPACE(value))
1311 ANYOF_BITMAP_CLEAR(data->start_class, value);
1315 data->start_class->flags |= ANYOF_LOCALE;
1316 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1320 if (flags & SCF_DO_STCLASS_AND) {
1321 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1322 for (value = 0; value < 256; value++)
1323 if (!isDIGIT(value))
1324 ANYOF_BITMAP_CLEAR(data->start_class, value);
1327 if (data->start_class->flags & ANYOF_LOCALE)
1328 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1330 for (value = 0; value < 256; value++)
1332 ANYOF_BITMAP_SET(data->start_class, value);
1337 if (flags & SCF_DO_STCLASS_AND) {
1338 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1339 for (value = 0; value < 256; value++)
1341 ANYOF_BITMAP_CLEAR(data->start_class, value);
1344 if (data->start_class->flags & ANYOF_LOCALE)
1345 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1347 for (value = 0; value < 256; value++)
1348 if (!isDIGIT(value))
1349 ANYOF_BITMAP_SET(data->start_class, value);
1354 if (flags & SCF_DO_STCLASS_OR)
1355 cl_and(data->start_class, &and_with);
1356 flags &= ~SCF_DO_STCLASS;
1359 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1360 data->flags |= (OP(scan) == MEOL
1364 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1365 /* Lookbehind, or need to calculate parens/evals/stclass: */
1366 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1367 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1368 /* Lookahead/lookbehind */
1369 I32 deltanext, minnext, fake = 0;
1371 struct regnode_charclass_class intrnl;
1374 data_fake.flags = 0;
1376 data_fake.whilem_c = data->whilem_c;
1377 data_fake.last_closep = data->last_closep;
1380 data_fake.last_closep = &fake;
1381 if ( flags & SCF_DO_STCLASS && !scan->flags
1382 && OP(scan) == IFMATCH ) { /* Lookahead */
1384 data_fake.start_class = &intrnl;
1385 f = SCF_DO_STCLASS_AND;
1387 next = regnext(scan);
1388 nscan = NEXTOPER(NEXTOPER(scan));
1389 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, f);
1392 vFAIL("Variable length lookbehind not implemented");
1394 else if (minnext > U8_MAX) {
1395 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1397 scan->flags = minnext;
1399 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1401 if (data && (data_fake.flags & SF_HAS_EVAL))
1402 data->flags |= SF_HAS_EVAL;
1404 data->whilem_c = data_fake.whilem_c;
1406 int was = (data->start_class->flags & ANYOF_EOS);
1408 cl_and(data->start_class, &intrnl);
1410 data->start_class->flags |= ANYOF_EOS;
1413 else if (OP(scan) == OPEN) {
1416 else if (OP(scan) == CLOSE) {
1417 if (ARG(scan) == is_par) {
1418 next = regnext(scan);
1420 if ( next && (OP(next) != WHILEM) && next < last)
1421 is_par = 0; /* Disable optimization */
1424 *(data->last_closep) = ARG(scan);
1426 else if (OP(scan) == EVAL) {
1428 data->flags |= SF_HAS_EVAL;
1430 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1431 if (flags & SCF_DO_SUBSTR) {
1433 data->longest = &(data->longest_float);
1435 is_inf = is_inf_internal = 1;
1436 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1437 cl_anything(data->start_class);
1438 flags &= ~SCF_DO_STCLASS;
1440 /* Else: zero-length, ignore. */
1441 scan = regnext(scan);
1446 *deltap = is_inf_internal ? I32_MAX : delta;
1447 if (flags & SCF_DO_SUBSTR && is_inf)
1448 data->pos_delta = I32_MAX - data->pos_min;
1449 if (is_par > U8_MAX)
1451 if (is_par && pars==1 && data) {
1452 data->flags |= SF_IN_PAR;
1453 data->flags &= ~SF_HAS_PAR;
1455 else if (pars && data) {
1456 data->flags |= SF_HAS_PAR;
1457 data->flags &= ~SF_IN_PAR;
1459 if (flags & SCF_DO_STCLASS_OR)
1460 cl_and(data->start_class, &and_with);
1465 S_add_data(pTHX_ I32 n, char *s)
1468 if (PL_regcomp_rx->data) {
1469 Renewc(PL_regcomp_rx->data,
1470 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
1471 char, struct reg_data);
1472 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
1473 PL_regcomp_rx->data->count += n;
1476 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
1477 char, struct reg_data);
1478 New(1208, PL_regcomp_rx->data->what, n, U8);
1479 PL_regcomp_rx->data->count = n;
1481 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
1482 return PL_regcomp_rx->data->count - n;
1486 Perl_reginitcolors(pTHX)
1490 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1493 PL_colors[0] = s = savepv(s);
1495 s = strchr(s, '\t');
1501 PL_colors[i] = s = "";
1505 PL_colors[i++] = "";
1512 - pregcomp - compile a regular expression into internal code
1514 * We can't allocate space until we know how big the compiled form will be,
1515 * but we can't compile it (and thus know how big it is) until we've got a
1516 * place to put the code. So we cheat: we compile it twice, once with code
1517 * generation turned off and size counting turned on, and once "for real".
1518 * This also means that we don't allocate space until we are sure that the
1519 * thing really will compile successfully, and we never have to move the
1520 * code and thus invalidate pointers into it. (Note that it has to be in
1521 * one piece because free() must be able to free it all.) [NB: not true in perl]
1523 * Beware that the optimization-preparation code in here knows about some
1524 * of the structure of the compiled regexp. [I'll say.]
1527 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1540 FAIL("NULL regexp argument");
1542 if (pm->op_pmdynflags & PMdf_UTF8) {
1543 PL_reg_flags |= RF_utf8;
1548 PL_regprecomp = savepvn(exp, xend - exp);
1549 DEBUG_r(if (!PL_colorset) reginitcolors());
1550 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1551 PL_colors[4],PL_colors[5],PL_colors[0],
1552 (int)(xend - exp), PL_regprecomp, PL_colors[1]));
1553 PL_regflags = pm->op_pmflags;
1557 PL_seen_zerolen = *exp == '^' ? -1 : 0;
1561 /* First pass: determine size, legality. */
1562 PL_regcomp_parse = exp;
1567 PL_regcode = &PL_regdummy;
1568 PL_reg_whilem_seen = 0;
1569 #if 0 /* REGC() is (currently) a NOP at the first pass.
1570 * Clever compilers notice this and complain. --jhi */
1571 REGC((U8)REG_MAGIC, (char*)PL_regcode);
1573 if (reg(0, &flags) == NULL) {
1574 Safefree(PL_regprecomp);
1575 PL_regprecomp = Nullch;
1578 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)PL_regsize));
1580 /* Small enough for pointer-storage convention?
1581 If extralen==0, this means that we will not need long jumps. */
1582 if (PL_regsize >= 0x10000L && PL_extralen)
1583 PL_regsize += PL_extralen;
1586 if (PL_reg_whilem_seen > 15)
1587 PL_reg_whilem_seen = 15;
1589 /* Allocate space and initialize. */
1590 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
1593 FAIL("Regexp out of space");
1596 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1597 Zero(r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode), char);
1600 r->prelen = xend - exp;
1601 r->precomp = PL_regprecomp;
1603 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1604 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
1606 r->substrs = 0; /* Useful during FAIL. */
1607 r->startp = 0; /* Useful during FAIL. */
1608 r->endp = 0; /* Useful during FAIL. */
1612 /* Second pass: emit code. */
1613 PL_regcomp_parse = exp;
1617 PL_regcode = r->program;
1618 /* Store the count of eval-groups for security checks: */
1619 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
1620 REGC((U8)REG_MAGIC, (char*) PL_regcode++);
1622 if (reg(0, &flags) == NULL)
1625 /* Dig out information for optimizations. */
1626 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1627 pm->op_pmflags = PL_regflags;
1629 r->reganch |= ROPT_UTF8;
1630 r->regstclass = NULL;
1631 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
1632 r->reganch |= ROPT_NAUGHTY;
1633 scan = r->program + 1; /* First BRANCH. */
1635 /* XXXX To minimize changes to RE engine we always allocate
1636 3-units-long substrs field. */
1637 Newz(1004, r->substrs, 1, struct reg_substr_data);
1639 StructCopy(&zero_scan_data, &data, scan_data_t);
1640 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1641 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1643 STRLEN longest_float_length, longest_fixed_length;
1644 struct regnode_charclass_class ch_class;
1649 /* Skip introductions and multiplicators >= 1. */
1650 while ((OP(first) == OPEN && (sawopen = 1)) ||
1651 /* An OR of *one* alternative - should not happen now. */
1652 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1653 (OP(first) == PLUS) ||
1654 (OP(first) == MINMOD) ||
1655 /* An {n,m} with n>0 */
1656 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1657 if (OP(first) == PLUS)
1660 first += regarglen[(U8)OP(first)];
1661 first = NEXTOPER(first);
1664 /* Starting-point info. */
1666 if (PL_regkind[(U8)OP(first)] == EXACT) {
1667 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
1668 else if ((OP(first) == EXACTF || OP(first) == EXACTFL)
1670 r->regstclass = first;
1672 else if (strchr((char*)PL_simple,OP(first)))
1673 r->regstclass = first;
1674 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1675 PL_regkind[(U8)OP(first)] == NBOUND)
1676 r->regstclass = first;
1677 else if (PL_regkind[(U8)OP(first)] == BOL) {
1678 r->reganch |= (OP(first) == MBOL
1680 : (OP(first) == SBOL
1683 first = NEXTOPER(first);
1686 else if (OP(first) == GPOS) {
1687 r->reganch |= ROPT_ANCH_GPOS;
1688 first = NEXTOPER(first);
1691 else if ((OP(first) == STAR &&
1692 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1693 !(r->reganch & ROPT_ANCH) )
1695 /* turn .* into ^.* with an implied $*=1 */
1696 int type = OP(NEXTOPER(first));
1698 if (type == REG_ANY || type == ANYUTF8)
1699 type = ROPT_ANCH_MBOL;
1701 type = ROPT_ANCH_SBOL;
1703 r->reganch |= type | ROPT_IMPLICIT;
1704 first = NEXTOPER(first);
1707 if (sawplus && (!sawopen || !PL_regsawback)
1708 && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */
1709 /* x+ must match at the 1st pos of run of x's */
1710 r->reganch |= ROPT_SKIP;
1712 /* Scan is after the zeroth branch, first is atomic matcher. */
1713 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1714 (IV)(first - scan + 1)));
1716 * If there's something expensive in the r.e., find the
1717 * longest literal string that must appear and make it the
1718 * regmust. Resolve ties in favor of later strings, since
1719 * the regstart check works with the beginning of the r.e.
1720 * and avoiding duplication strengthens checking. Not a
1721 * strong reason, but sufficient in the absence of others.
1722 * [Now we resolve ties in favor of the earlier string if
1723 * it happens that c_offset_min has been invalidated, since the
1724 * earlier string may buy us something the later one won't.]
1728 data.longest_fixed = newSVpvn("",0);
1729 data.longest_float = newSVpvn("",0);
1730 data.last_found = newSVpvn("",0);
1731 data.longest = &(data.longest_fixed);
1733 if (!r->regstclass) {
1735 data.start_class = &ch_class;
1736 stclass_flag = SCF_DO_STCLASS_AND;
1737 } else /* XXXX Check for BOUND? */
1739 data.last_closep = &last_close;
1741 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
1742 &data, SCF_DO_SUBSTR | stclass_flag);
1743 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
1744 && data.last_start_min == 0 && data.last_end > 0
1746 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1747 r->reganch |= ROPT_CHECK_ALL;
1749 SvREFCNT_dec(data.last_found);
1751 longest_float_length = CHR_SVLEN(data.longest_float);
1752 if (longest_float_length
1753 || (data.flags & SF_FL_BEFORE_EOL
1754 && (!(data.flags & SF_FL_BEFORE_MEOL)
1755 || (PL_regflags & PMf_MULTILINE)))) {
1758 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1759 && data.offset_fixed == data.offset_float_min
1760 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1761 goto remove_float; /* As in (a)+. */
1763 r->float_substr = data.longest_float;
1764 r->float_min_offset = data.offset_float_min;
1765 r->float_max_offset = data.offset_float_max;
1766 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1767 && (!(data.flags & SF_FL_BEFORE_MEOL)
1768 || (PL_regflags & PMf_MULTILINE)));
1769 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1773 r->float_substr = Nullsv;
1774 SvREFCNT_dec(data.longest_float);
1775 longest_float_length = 0;
1778 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1779 if (longest_fixed_length
1780 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1781 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1782 || (PL_regflags & PMf_MULTILINE)))) {
1785 r->anchored_substr = data.longest_fixed;
1786 r->anchored_offset = data.offset_fixed;
1787 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1788 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1789 || (PL_regflags & PMf_MULTILINE)));
1790 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1793 r->anchored_substr = Nullsv;
1794 SvREFCNT_dec(data.longest_fixed);
1795 longest_fixed_length = 0;
1798 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8
1799 || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY))
1800 r->regstclass = NULL;
1801 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1802 && !(data.start_class->flags & ANYOF_EOS)
1803 && !cl_is_anything(data.start_class)) {
1805 I32 n = add_data(1, "f");
1807 New(1006, PL_regcomp_rx->data->data[n], 1,
1808 struct regnode_charclass_class);
1809 StructCopy(data.start_class,
1810 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1811 struct regnode_charclass_class);
1812 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1813 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1814 DEBUG_r((sv = sv_newmortal(),
1815 regprop(sv, (regnode*)data.start_class),
1816 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1820 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1821 if (longest_fixed_length > longest_float_length) {
1822 r->check_substr = r->anchored_substr;
1823 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1824 if (r->reganch & ROPT_ANCH_SINGLE)
1825 r->reganch |= ROPT_NOSCAN;
1828 r->check_substr = r->float_substr;
1829 r->check_offset_min = data.offset_float_min;
1830 r->check_offset_max = data.offset_float_max;
1832 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1833 This should be changed ASAP! */
1834 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1835 r->reganch |= RE_USE_INTUIT;
1836 if (SvTAIL(r->check_substr))
1837 r->reganch |= RE_INTUIT_TAIL;
1841 /* Several toplevels. Best we can is to set minlen. */
1843 struct regnode_charclass_class ch_class;
1846 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1847 scan = r->program + 1;
1849 data.start_class = &ch_class;
1850 data.last_closep = &last_close;
1851 minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, SCF_DO_STCLASS_AND);
1852 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1853 if (!(data.start_class->flags & ANYOF_EOS)
1854 && !cl_is_anything(data.start_class)) {
1856 I32 n = add_data(1, "f");
1858 New(1006, PL_regcomp_rx->data->data[n], 1,
1859 struct regnode_charclass_class);
1860 StructCopy(data.start_class,
1861 (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n],
1862 struct regnode_charclass_class);
1863 r->regstclass = (regnode*)PL_regcomp_rx->data->data[n];
1864 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1865 DEBUG_r((sv = sv_newmortal(),
1866 regprop(sv, (regnode*)data.start_class),
1867 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1873 if (PL_regseen & REG_SEEN_GPOS)
1874 r->reganch |= ROPT_GPOS_SEEN;
1875 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1876 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1877 if (PL_regseen & REG_SEEN_EVAL)
1878 r->reganch |= ROPT_EVAL_SEEN;
1879 Newz(1002, r->startp, PL_regnpar, I32);
1880 Newz(1002, r->endp, PL_regnpar, I32);
1881 DEBUG_r(regdump(r));
1886 - reg - regular expression, i.e. main body or parenthesized thing
1888 * Caller must absorb opening parenthesis.
1890 * Combining parenthesis handling with the base level of regular expression
1891 * is a trifle forced, but the need to tie the tails of the branches to what
1892 * follows makes it hard to avoid.
1895 S_reg(pTHX_ I32 paren, I32 *flagp)
1896 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1899 register regnode *ret; /* Will be the head of the group. */
1900 register regnode *br;
1901 register regnode *lastbr;
1902 register regnode *ender = 0;
1903 register I32 parno = 0;
1904 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1905 char *oregcomp_parse = PL_regcomp_parse;
1908 *flagp = 0; /* Tentatively. */
1910 /* Make an OPEN node, if parenthesized. */
1912 if (*PL_regcomp_parse == '?') {
1913 U16 posflags = 0, negflags = 0;
1914 U16 *flagsp = &posflags;
1916 char *seqstart = PL_regcomp_parse;
1919 paren = *PL_regcomp_parse++;
1920 ret = NULL; /* For look-ahead/behind. */
1923 PL_regseen |= REG_SEEN_LOOKBEHIND;
1924 if (*PL_regcomp_parse == '!')
1926 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1937 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
1940 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1942 if (*PL_regcomp_parse != ')')
1943 FAIL("Sequence (?#... not terminated");
1949 vWARN(PL_regcomp_parse, "(?p{}) is deprecated - use (??{})");
1953 paren = *PL_regcomp_parse++;
1958 I32 count = 1, n = 0;
1960 char *s = PL_regcomp_parse;
1962 OP_4tree *sop, *rop;
1965 PL_regseen |= REG_SEEN_EVAL;
1966 while (count && (c = *PL_regcomp_parse)) {
1967 if (c == '\\' && PL_regcomp_parse[1])
1975 if (*PL_regcomp_parse != ')')
1977 PL_regcomp_parse = s;
1978 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
1983 if (PL_regcomp_parse - 1 - s)
1984 sv = newSVpvn(s, PL_regcomp_parse - 1 - s);
1986 sv = newSVpvn("", 0);
1989 Perl_save_re_context(aTHX);
1990 rop = sv_compile_2op(sv, &sop, "re", &av);
1993 n = add_data(3, "nop");
1994 PL_regcomp_rx->data->data[n] = (void*)rop;
1995 PL_regcomp_rx->data->data[n+1] = (void*)sop;
1996 PL_regcomp_rx->data->data[n+2] = (void*)av;
1999 else { /* First pass */
2000 if (PL_reginterp_cnt < ++PL_seen_evals
2001 && PL_curcop != &PL_compiling)
2002 /* No compiled RE interpolated, has runtime
2003 components ===> unsafe. */
2004 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2006 FAIL("Eval-group in insecure regular expression");
2011 ret = reg_node(LOGICAL);
2014 regtail(ret, reganode(EVAL, n));
2017 return reganode(EVAL, n);
2021 if (PL_regcomp_parse[0] == '?') {
2022 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
2023 || PL_regcomp_parse[1] == '<'
2024 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
2027 ret = reg_node(LOGICAL);
2030 regtail(ret, reg(1, &flag));
2034 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
2035 parno = atoi(PL_regcomp_parse++);
2037 while (isDIGIT(*PL_regcomp_parse))
2039 ret = reganode(GROUPP, parno);
2040 if ((c = *nextchar()) != ')')
2041 vFAIL("Switch condition not recognized");
2043 regtail(ret, reganode(IFTHEN, 0));
2044 br = regbranch(&flags, 1);
2046 br = reganode(LONGJMP, 0);
2048 regtail(br, reganode(LONGJMP, 0));
2053 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
2054 regbranch(&flags, 1);
2055 regtail(ret, lastbr);
2063 vFAIL("Switch (?(condition)... contains too many branches");
2064 ender = reg_node(TAIL);
2067 regtail(lastbr, ender);
2068 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
2071 regtail(ret, ender);
2075 vFAIL2("Unknown switch condition (?(%.2s", PL_regcomp_parse);
2079 PL_regcomp_parse--; /* for vFAIL to print correctly */
2080 vFAIL("Sequence (? incomplete");
2085 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
2086 if (*PL_regcomp_parse != 'o')
2087 pmflag(flagsp, *PL_regcomp_parse);
2090 if (*PL_regcomp_parse == '-') {
2095 PL_regflags |= posflags;
2096 PL_regflags &= ~negflags;
2097 if (*PL_regcomp_parse == ':') {
2103 if (*PL_regcomp_parse != ')') {
2105 vFAIL3("Sequence (%.*s...) not recognized", PL_regcomp_parse-seqstart, seqstart);
2115 ret = reganode(OPEN, parno);
2122 /* Pick up the branches, linking them together. */
2123 br = regbranch(&flags, 1);
2126 if (*PL_regcomp_parse == '|') {
2127 if (!SIZE_ONLY && PL_extralen) {
2128 reginsert(BRANCHJ, br);
2131 reginsert(BRANCH, br);
2134 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
2136 else if (paren == ':') {
2137 *flagp |= flags&SIMPLE;
2139 if (open) { /* Starts with OPEN. */
2140 regtail(ret, br); /* OPEN -> first. */
2142 else if (paren != '?') /* Not Conditional */
2146 *flagp |= flags&SPSTART;
2148 while (*PL_regcomp_parse == '|') {
2149 if (!SIZE_ONLY && PL_extralen) {
2150 ender = reganode(LONGJMP,0);
2151 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2154 PL_extralen += 2; /* Account for LONGJMP. */
2156 br = regbranch(&flags, 0);
2159 regtail(lastbr, br); /* BRANCH -> BRANCH. */
2163 *flagp |= flags&SPSTART;
2166 if (have_branch || paren != ':') {
2167 /* Make a closing node, and hook it on the end. */
2170 ender = reg_node(TAIL);
2173 ender = reganode(CLOSE, parno);
2179 *flagp &= ~HASWIDTH;
2182 ender = reg_node(SUCCEED);
2185 ender = reg_node(END);
2188 regtail(lastbr, ender);
2191 /* Hook the tails of the branches to the closing node. */
2192 for (br = ret; br != NULL; br = regnext(br)) {
2193 regoptail(br, ender);
2200 static char parens[] = "=!<,>";
2202 if (paren && (p = strchr(parens, paren))) {
2203 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2204 int flag = (p - parens) > 1;
2207 node = SUSPEND, flag = 0;
2208 reginsert(node,ret);
2210 regtail(ret, reg_node(TAIL));
2214 /* Check for proper termination. */
2216 PL_regflags = oregflags;
2217 if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') {
2218 PL_regcomp_parse = oregcomp_parse;
2219 vFAIL("Unmatched (");
2222 else if (!paren && PL_regcomp_parse < PL_regxend) {
2223 if (*PL_regcomp_parse == ')') {
2225 vFAIL("Unmatched )");
2228 FAIL("Junk on end of regexp"); /* "Can't happen". */
2236 - regbranch - one alternative of an | operator
2238 * Implements the concatenation operator.
2241 S_regbranch(pTHX_ I32 *flagp, I32 first)
2244 register regnode *ret;
2245 register regnode *chain = NULL;
2246 register regnode *latest;
2247 I32 flags = 0, c = 0;
2252 if (!SIZE_ONLY && PL_extralen)
2253 ret = reganode(BRANCHJ,0);
2255 ret = reg_node(BRANCH);
2258 if (!first && SIZE_ONLY)
2259 PL_extralen += 1; /* BRANCHJ */
2261 *flagp = WORST; /* Tentatively. */
2265 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
2267 latest = regpiece(&flags);
2268 if (latest == NULL) {
2269 if (flags & TRYAGAIN)
2273 else if (ret == NULL)
2275 *flagp |= flags&HASWIDTH;
2276 if (chain == NULL) /* First piece. */
2277 *flagp |= flags&SPSTART;
2280 regtail(chain, latest);
2285 if (chain == NULL) { /* Loop ran zero times. */
2286 chain = reg_node(NOTHING);
2291 *flagp |= flags&SIMPLE;
2298 - regpiece - something followed by possible [*+?]
2300 * Note that the branching code sequences used for ? and the general cases
2301 * of * and + are somewhat optimized: they use the same NOTHING node as
2302 * both the endmarker for their branch list and the body of the last branch.
2303 * It might seem that this node could be dispensed with entirely, but the
2304 * endmarker role is not redundant.
2307 S_regpiece(pTHX_ I32 *flagp)
2310 register regnode *ret;
2312 register char *next;
2314 char *origparse = PL_regcomp_parse;
2317 I32 max = REG_INFTY;
2319 ret = regatom(&flags);
2321 if (flags & TRYAGAIN)
2326 op = *PL_regcomp_parse;
2328 if (op == '{' && regcurly(PL_regcomp_parse)) {
2329 next = PL_regcomp_parse + 1;
2331 while (isDIGIT(*next) || *next == ',') {
2340 if (*next == '}') { /* got one */
2344 min = atoi(PL_regcomp_parse);
2348 maxpos = PL_regcomp_parse;
2350 if (!max && *maxpos != '0')
2351 max = REG_INFTY; /* meaning "infinity" */
2352 else if (max >= REG_INFTY)
2353 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2354 PL_regcomp_parse = next;
2358 if ((flags&SIMPLE)) {
2359 PL_regnaughty += 2 + PL_regnaughty / 2;
2360 reginsert(CURLY, ret);
2363 regnode *w = reg_node(WHILEM);
2367 if (!SIZE_ONLY && PL_extralen) {
2368 reginsert(LONGJMP,ret);
2369 reginsert(NOTHING,ret);
2370 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2372 reginsert(CURLYX,ret);
2373 if (!SIZE_ONLY && PL_extralen)
2374 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2375 regtail(ret, reg_node(NOTHING));
2377 PL_reg_whilem_seen++, PL_extralen += 3;
2378 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
2386 if (max && max < min)
2387 vFAIL("Can't do {n,m} with n > m");
2402 #if 0 /* Now runtime fix should be reliable. */
2404 /* if this is reinstated, don't forget to put this back into perldiag:
2406 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2408 (F) The part of the regexp subject to either the * or + quantifier
2409 could match an empty string. The {#} shows in the regular
2410 expression about where the problem was discovered.
2414 if (!(flags&HASWIDTH) && op != '?')
2415 vFAIL("Regexp *+ operand could be empty");
2420 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2422 if (op == '*' && (flags&SIMPLE)) {
2423 reginsert(STAR, ret);
2427 else if (op == '*') {
2431 else if (op == '+' && (flags&SIMPLE)) {
2432 reginsert(PLUS, ret);
2436 else if (op == '+') {
2440 else if (op == '?') {
2445 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2446 vWARN3(PL_regcomp_parse,
2447 "%.*s matches null string many times",
2448 PL_regcomp_parse - origparse,
2452 if (*PL_regcomp_parse == '?') {
2454 reginsert(MINMOD, ret);
2455 regtail(ret, ret + NODE_STEP_REGNODE);
2457 if (ISMULT2(PL_regcomp_parse)) {
2459 vFAIL("Nested quantifiers");
2466 - regatom - the lowest level
2468 * Optimization: gobbles an entire sequence of ordinary characters so that
2469 * it can turn them into a single node, which is smaller to store and
2470 * faster to run. Backslashed characters are exceptions, each becoming a
2471 * separate node; the code is simpler that way and it's not worth fixing.
2473 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2475 S_regatom(pTHX_ I32 *flagp)
2478 register regnode *ret = 0;
2481 *flagp = WORST; /* Tentatively. */
2484 switch (*PL_regcomp_parse) {
2488 if (PL_regflags & PMf_MULTILINE)
2489 ret = reg_node(MBOL);
2490 else if (PL_regflags & PMf_SINGLELINE)
2491 ret = reg_node(SBOL);
2493 ret = reg_node(BOL);
2497 if (*PL_regcomp_parse)
2499 if (PL_regflags & PMf_MULTILINE)
2500 ret = reg_node(MEOL);
2501 else if (PL_regflags & PMf_SINGLELINE)
2502 ret = reg_node(SEOL);
2504 ret = reg_node(EOL);
2509 if (PL_regflags & PMf_SINGLELINE)
2510 ret = reg_node(SANYUTF8);
2512 ret = reg_node(ANYUTF8);
2516 if (PL_regflags & PMf_SINGLELINE)
2517 ret = reg_node(SANY);
2519 ret = reg_node(REG_ANY);
2520 *flagp |= HASWIDTH|SIMPLE;
2526 char *oregcomp_parse = ++PL_regcomp_parse;
2527 ret = (UTF ? regclassutf8() : regclass());
2528 if (*PL_regcomp_parse != ']') {
2529 PL_regcomp_parse = oregcomp_parse;
2530 vFAIL("Unmatched [");
2533 *flagp |= HASWIDTH|SIMPLE;
2538 ret = reg(1, &flags);
2540 if (flags & TRYAGAIN) {
2541 if (PL_regcomp_parse == PL_regxend) {
2542 /* Make parent create an empty node if needed. */
2550 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2554 if (flags & TRYAGAIN) {
2558 vFAIL("Internal urp");
2559 /* Supposed to be caught earlier. */
2562 if (!regcurly(PL_regcomp_parse)) {
2571 vFAIL("Quantifier follows nothing");
2574 switch (*++PL_regcomp_parse) {
2577 ret = reg_node(SBOL);
2582 ret = reg_node(GPOS);
2583 PL_regseen |= REG_SEEN_GPOS;
2588 ret = reg_node(SEOL);
2593 ret = reg_node(EOS);
2595 PL_seen_zerolen++; /* Do not optimize RE away */
2599 ret = reg_node(SANY);
2600 *flagp |= HASWIDTH|SIMPLE;
2604 ret = reg_node(CLUMP);
2607 if (UTF && !PL_utf8_mark)
2608 is_utf8_mark((U8*)"~"); /* preload table */
2613 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
2614 : (LOC ? ALNUML : ALNUM));
2615 *flagp |= HASWIDTH|SIMPLE;
2617 if (UTF && !PL_utf8_alnum)
2618 is_utf8_alnum((U8*)"a"); /* preload table */
2623 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
2624 : (LOC ? NALNUML : NALNUM));
2625 *flagp |= HASWIDTH|SIMPLE;
2627 if (UTF && !PL_utf8_alnum)
2628 is_utf8_alnum((U8*)"a"); /* preload table */
2632 PL_regseen |= REG_SEEN_LOOKBEHIND;
2635 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
2636 : (LOC ? BOUNDL : BOUND));
2639 if (UTF && !PL_utf8_alnum)
2640 is_utf8_alnum((U8*)"a"); /* preload table */
2644 PL_regseen |= REG_SEEN_LOOKBEHIND;
2647 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
2648 : (LOC ? NBOUNDL : NBOUND));
2651 if (UTF && !PL_utf8_alnum)
2652 is_utf8_alnum((U8*)"a"); /* preload table */
2657 ? (LOC ? SPACELUTF8 : SPACEUTF8)
2658 : (LOC ? SPACEL : SPACE));
2659 *flagp |= HASWIDTH|SIMPLE;
2661 if (UTF && !PL_utf8_space)
2662 is_utf8_space((U8*)" "); /* preload table */
2667 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
2668 : (LOC ? NSPACEL : NSPACE));
2669 *flagp |= HASWIDTH|SIMPLE;
2671 if (UTF && !PL_utf8_space)
2672 is_utf8_space((U8*)" "); /* preload table */
2675 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
2676 *flagp |= HASWIDTH|SIMPLE;
2678 if (UTF && !PL_utf8_digit)
2679 is_utf8_digit((U8*)"1"); /* preload table */
2682 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
2683 *flagp |= HASWIDTH|SIMPLE;
2685 if (UTF && !PL_utf8_digit)
2686 is_utf8_digit((U8*)"1"); /* preload table */
2690 { /* a lovely hack--pretend we saw [\pX] instead */
2691 char* oldregxend = PL_regxend;
2693 if (PL_regcomp_parse[1] == '{') {
2694 PL_regxend = strchr(PL_regcomp_parse, '}');
2696 PL_regcomp_parse += 2;
2697 PL_regxend = oldregxend;
2698 vFAIL("Missing right brace on \\p{}");
2703 PL_regxend = PL_regcomp_parse + 2;
2706 ret = regclassutf8();
2708 PL_regxend = oldregxend;
2711 *flagp |= HASWIDTH|SIMPLE;
2724 case '1': case '2': case '3': case '4':
2725 case '5': case '6': case '7': case '8': case '9':
2727 I32 num = atoi(PL_regcomp_parse);
2729 if (num > 9 && num >= PL_regnpar)
2732 while (isDIGIT(*PL_regcomp_parse))
2735 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
2736 vFAIL("Reference to nonexistent group");
2739 ? (LOC ? REFFL : REFF)
2748 if (PL_regcomp_parse >= PL_regxend)
2749 FAIL("Trailing \\");
2752 /* Do not generate `unrecognized' warnings here, we fall
2753 back into the quick-grab loop below */
2759 if (PL_regflags & PMf_EXTENDED) {
2760 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
2761 if (PL_regcomp_parse < PL_regxend)
2767 register STRLEN len;
2777 ? (LOC ? EXACTFL : EXACTF)
2780 for (len = 0, p = PL_regcomp_parse - 1;
2781 len < 127 && p < PL_regxend;
2786 if (PL_regflags & PMf_EXTENDED)
2787 p = regwhite(p, PL_regxend);
2849 char* e = strchr(p, '}');
2852 PL_regcomp_parse = p + 1;
2853 vFAIL("Missing right brace on \\x{}");
2856 numlen = 1; /* allow underscores */
2857 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2858 /* numlen is generous */
2859 if (numlen + len >= 127) {
2867 PL_regcomp_parse = e + 1;
2868 vFAIL("Can't use \\x{} without 'use utf8' declaration");
2873 numlen = 0; /* disallow underscores */
2874 ender = (UV)scan_hex(p, 2, &numlen);
2880 ender = UCHARAT(p++);
2881 ender = toCTRL(ender);
2883 case '0': case '1': case '2': case '3':case '4':
2884 case '5': case '6': case '7': case '8':case '9':
2886 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2887 numlen = 0; /* disallow underscores */
2888 ender = (UV)scan_oct(p, 3, &numlen);
2897 if (p >= PL_regxend)
2898 FAIL("Trailing \\");
2901 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2902 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
2903 goto normal_default;
2908 if ((*p & 0xc0) == 0xc0 && UTF) {
2909 ender = utf8_to_uv((U8*)p, PL_regxend - p,
2917 if (PL_regflags & PMf_EXTENDED)
2918 p = regwhite(p, PL_regxend);
2921 ender = toLOWER_LC_uni(ender);
2923 ender = toLOWER_uni(ender);
2925 if (ISMULT2(p)) { /* Back off on ?+*. */
2928 else if (ender >= 0x80 && UTF) {
2929 reguni(ender, s, &numlen);
2939 if (ender >= 0x80 && UTF) {
2940 reguni(ender, s, &numlen);
2948 PL_regcomp_parse = p - 1;
2951 vFAIL("Internal disaster");
2959 PL_regsize += STR_SZ(len);
2961 PL_regcode += STR_SZ(len);
2970 S_regwhite(pTHX_ char *p, char *e)
2975 else if (*p == '#') {
2978 } while (p < e && *p != '\n');
2986 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
2987 Character classes ([:foo:]) can also be negated ([:^foo:]).
2988 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
2989 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
2990 but trigger warnings because they are currently unimplemented. */
2992 S_regpposixcc(pTHX_ I32 value)
2996 I32 namedclass = OOB_NAMEDCLASS;
2998 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2999 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3000 (*PL_regcomp_parse == ':' ||
3001 *PL_regcomp_parse == '=' ||
3002 *PL_regcomp_parse == '.')) {
3003 char c = *PL_regcomp_parse;
3004 char* s = PL_regcomp_parse++;
3006 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
3008 if (PL_regcomp_parse == PL_regxend)
3009 /* Grandfather lone [:, [=, [. */
3010 PL_regcomp_parse = s;
3012 char* t = PL_regcomp_parse++; /* skip over the c */
3014 if (*PL_regcomp_parse == ']') {
3015 PL_regcomp_parse++; /* skip over the ending ] */
3018 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3019 I32 skip = 5; /* the most common skip */
3023 if (strnEQ(posixcc, "alnum", 5))
3025 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3026 else if (strnEQ(posixcc, "alpha", 5))
3028 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3029 else if (strnEQ(posixcc, "ascii", 5))
3031 complement ? ANYOF_NASCII : ANYOF_ASCII;
3034 if (strnEQ(posixcc, "blank", 5))
3036 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3039 if (strnEQ(posixcc, "cntrl", 5))
3041 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3044 if (strnEQ(posixcc, "digit", 5))
3046 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3049 if (strnEQ(posixcc, "graph", 5))
3051 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3054 if (strnEQ(posixcc, "lower", 5))
3056 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3059 if (strnEQ(posixcc, "print", 5))
3061 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3062 else if (strnEQ(posixcc, "punct", 5))
3064 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3067 if (strnEQ(posixcc, "space", 5))
3069 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3072 if (strnEQ(posixcc, "upper", 5))
3074 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3076 case 'w': /* this is not POSIX, this is the Perl \w */
3077 if (strnEQ(posixcc, "word", 4)) {
3079 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3084 if (strnEQ(posixcc, "xdigit", 6)) {
3086 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3091 if (namedclass == OOB_NAMEDCLASS ||
3092 posixcc[skip] != ':' ||
3093 posixcc[skip+1] != ']')
3095 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3098 } else if (!SIZE_ONLY) {
3099 /* [[=foo=]] and [[.foo.]] are still future. */
3101 /* adjust PL_regcomp_parse so the warning shows after
3103 while (*PL_regcomp_parse && *PL_regcomp_parse != ']')
3105 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3108 /* Maternal grandfather:
3109 * "[:" ending in ":" but not in ":]" */
3110 PL_regcomp_parse = s;
3119 S_checkposixcc(pTHX)
3121 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3122 (*PL_regcomp_parse == ':' ||
3123 *PL_regcomp_parse == '=' ||
3124 *PL_regcomp_parse == '.')) {
3125 char *s = PL_regcomp_parse;
3128 while(*s && isALNUM(*s))
3130 if (*s && c == *s && s[1] == ']') {
3131 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3133 /* [[=foo=]] and [[.foo.]] are still future. */
3134 if (c == '=' || c == '.')
3136 /* adjust PL_regcomp_parse so the error shows after
3138 while (*PL_regcomp_parse && *PL_regcomp_parse++ != ']')
3140 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3151 register I32 lastvalue = OOB_CHAR8;
3152 register I32 range = 0;
3153 register regnode *ret;
3157 bool need_class = 0;
3159 ret = reg_node(ANYOF);
3161 PL_regsize += ANYOF_SKIP;
3164 ANYOF_BITMAP_ZERO(ret);
3165 PL_regcode += ANYOF_SKIP;
3167 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3169 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3171 if (*PL_regcomp_parse == '^') { /* Complement of range. */
3175 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3178 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3181 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
3182 goto skipcond; /* allow 1st char to be ] or - */
3183 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
3185 namedclass = OOB_NAMEDCLASS;
3187 rangebegin = PL_regcomp_parse;
3188 value = UCHARAT(PL_regcomp_parse++);
3190 namedclass = regpposixcc(value);
3191 else if (value == '\\') {
3192 value = UCHARAT(PL_regcomp_parse++);
3193 /* Some compilers cannot handle switching on 64-bit integer
3194 * values, therefore the 'value' cannot be an UV. --jhi */
3196 case 'w': namedclass = ANYOF_ALNUM; break;
3197 case 'W': namedclass = ANYOF_NALNUM; break;
3198 case 's': namedclass = ANYOF_SPACE; break;
3199 case 'S': namedclass = ANYOF_NSPACE; break;
3200 case 'd': namedclass = ANYOF_DIGIT; break;
3201 case 'D': namedclass = ANYOF_NDIGIT; break;
3202 case 'n': value = '\n'; break;
3203 case 'r': value = '\r'; break;
3204 case 't': value = '\t'; break;
3205 case 'f': value = '\f'; break;
3206 case 'b': value = '\b'; break;
3208 case 'e': value = '\033'; break;
3209 case 'a': value = '\007'; break;
3211 case 'e': value = '\047'; break;
3212 case 'a': value = '\057'; break;
3215 numlen = 0; /* disallow underscores */
3216 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
3217 PL_regcomp_parse += numlen;
3220 value = UCHARAT(PL_regcomp_parse++);
3221 value = toCTRL(value);
3223 case '0': case '1': case '2': case '3': case '4':
3224 case '5': case '6': case '7': case '8': case '9':
3225 numlen = 0; /* disallow underscores */
3226 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
3227 PL_regcomp_parse += numlen;
3230 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3232 vWARN2(PL_regcomp_parse, "Unrecognized escape \\%c in character class passed through", (int)value);
3236 if (namedclass > OOB_NAMEDCLASS) {
3237 if (!need_class && !SIZE_ONLY)
3238 ANYOF_CLASS_ZERO(ret);
3240 if (range) { /* a-\d, a-[:digit:] */
3242 if (ckWARN(WARN_REGEXP))
3243 vWARN4(PL_regcomp_parse,
3244 "False [] range \"%*.*s\"",
3245 PL_regcomp_parse - rangebegin,
3246 PL_regcomp_parse - rangebegin,
3248 ANYOF_BITMAP_SET(ret, lastvalue);
3249 ANYOF_BITMAP_SET(ret, '-');
3251 range = 0; /* this is not a true range */
3254 switch (namedclass) {
3257 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3259 for (value = 0; value < 256; value++)
3261 ANYOF_BITMAP_SET(ret, value);
3266 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3268 for (value = 0; value < 256; value++)
3269 if (!isALNUM(value))
3270 ANYOF_BITMAP_SET(ret, value);
3275 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3277 for (value = 0; value < 256; value++)
3279 ANYOF_BITMAP_SET(ret, value);
3284 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3286 for (value = 0; value < 256; value++)
3287 if (!isSPACE(value))
3288 ANYOF_BITMAP_SET(ret, value);
3293 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3295 for (value = '0'; value <= '9'; value++)
3296 ANYOF_BITMAP_SET(ret, value);
3301 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3303 for (value = 0; value < '0'; value++)
3304 ANYOF_BITMAP_SET(ret, value);
3305 for (value = '9' + 1; value < 256; value++)
3306 ANYOF_BITMAP_SET(ret, value);
3311 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3313 for (value = 0; value < 256; value++)
3314 if (!isALNUMC(value))
3315 ANYOF_BITMAP_SET(ret, value);
3320 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3322 for (value = 0; value < 256; value++)
3323 if (isALNUMC(value))
3324 ANYOF_BITMAP_SET(ret, value);
3329 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3331 for (value = 0; value < 256; value++)
3333 ANYOF_BITMAP_SET(ret, value);
3338 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3340 for (value = 0; value < 256; value++)
3341 if (!isALPHA(value))
3342 ANYOF_BITMAP_SET(ret, value);
3347 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3350 for (value = 0; value < 128; value++)
3351 ANYOF_BITMAP_SET(ret, value);
3353 for (value = 0; value < 256; value++)
3355 ANYOF_BITMAP_SET(ret, value);
3361 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3364 for (value = 128; value < 256; value++)
3365 ANYOF_BITMAP_SET(ret, value);
3367 for (value = 0; value < 256; value++)
3368 if (!isASCII(value))
3369 ANYOF_BITMAP_SET(ret, value);
3375 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3377 for (value = 0; value < 256; value++)
3379 ANYOF_BITMAP_SET(ret, value);
3384 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3386 for (value = 0; value < 256; value++)
3387 if (!isBLANK(value))
3388 ANYOF_BITMAP_SET(ret, value);
3393 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3395 for (value = 0; value < 256; value++)
3397 ANYOF_BITMAP_SET(ret, value);
3399 lastvalue = OOB_CHAR8;
3403 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3405 for (value = 0; value < 256; value++)
3406 if (!isCNTRL(value))
3407 ANYOF_BITMAP_SET(ret, value);
3412 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3414 for (value = 0; value < 256; value++)
3416 ANYOF_BITMAP_SET(ret, value);
3421 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3423 for (value = 0; value < 256; value++)
3424 if (!isGRAPH(value))
3425 ANYOF_BITMAP_SET(ret, value);
3430 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3432 for (value = 0; value < 256; value++)
3434 ANYOF_BITMAP_SET(ret, value);
3439 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3441 for (value = 0; value < 256; value++)
3442 if (!isLOWER(value))
3443 ANYOF_BITMAP_SET(ret, value);
3448 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3450 for (value = 0; value < 256; value++)
3452 ANYOF_BITMAP_SET(ret, value);
3457 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3459 for (value = 0; value < 256; value++)
3460 if (!isPRINT(value))
3461 ANYOF_BITMAP_SET(ret, value);
3466 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3468 for (value = 0; value < 256; value++)
3469 if (isPSXSPC(value))
3470 ANYOF_BITMAP_SET(ret, value);
3475 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3477 for (value = 0; value < 256; value++)
3478 if (!isPSXSPC(value))
3479 ANYOF_BITMAP_SET(ret, value);
3484 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3486 for (value = 0; value < 256; value++)
3488 ANYOF_BITMAP_SET(ret, value);
3493 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3495 for (value = 0; value < 256; value++)
3496 if (!isPUNCT(value))
3497 ANYOF_BITMAP_SET(ret, value);
3502 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3504 for (value = 0; value < 256; value++)
3506 ANYOF_BITMAP_SET(ret, value);
3511 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3513 for (value = 0; value < 256; value++)
3514 if (!isUPPER(value))
3515 ANYOF_BITMAP_SET(ret, value);
3520 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3522 for (value = 0; value < 256; value++)
3523 if (isXDIGIT(value))
3524 ANYOF_BITMAP_SET(ret, value);
3529 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3531 for (value = 0; value < 256; value++)
3532 if (!isXDIGIT(value))
3533 ANYOF_BITMAP_SET(ret, value);
3537 vFAIL("Invalid [::] class");
3541 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3546 if (lastvalue > value) /* b-a */ {
3547 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3548 PL_regcomp_parse - rangebegin,
3549 PL_regcomp_parse - rangebegin,
3556 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3557 PL_regcomp_parse[1] != ']') {
3559 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3560 if (ckWARN(WARN_REGEXP))
3561 vWARN4(PL_regcomp_parse,
3562 "False [] range \"%*.*s\"",
3563 PL_regcomp_parse - rangebegin,
3564 PL_regcomp_parse - rangebegin,
3567 ANYOF_BITMAP_SET(ret, '-');
3570 continue; /* do it next time */
3573 /* now is the next time */
3575 #ifndef ASCIIish /* EBCDIC, for example. */
3576 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3577 (isUPPER(lastvalue) && isUPPER(value)))
3580 if (isLOWER(lastvalue)) {
3581 for (i = lastvalue; i <= value; i++)
3583 ANYOF_BITMAP_SET(ret, i);
3585 for (i = lastvalue; i <= value; i++)
3587 ANYOF_BITMAP_SET(ret, i);
3592 for ( ; lastvalue <= value; lastvalue++)
3593 ANYOF_BITMAP_SET(ret, lastvalue);
3599 PL_regsize += ANYOF_CLASS_ADD_SKIP;
3601 PL_regcode += ANYOF_CLASS_ADD_SKIP;
3603 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3605 (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
3606 for (value = 0; value < 256; ++value) {
3607 if (ANYOF_BITMAP_TEST(ret, value)) {
3608 I32 cf = PL_fold[value];
3609 ANYOF_BITMAP_SET(ret, cf);
3612 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3614 /* optimize inverted simple patterns (e.g. [^a-z]) */
3615 if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3616 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3617 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3618 ANYOF_FLAGS(ret) = 0;
3624 S_regclassutf8(pTHX)
3629 register U32 lastvalue = OOB_UTF8;
3630 register I32 range = 0;
3631 register regnode *ret;
3639 if (*PL_regcomp_parse == '^') { /* Complement of range. */
3643 flags |= ANYOF_INVERT;
3647 flags |= ANYOF_FOLD;
3649 flags |= ANYOF_LOCALE;
3650 listsv = newSVpvn("# comment\n",10);
3653 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3656 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
3657 goto skipcond; /* allow 1st char to be ] or - */
3659 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
3661 namedclass = OOB_NAMEDCLASS;
3663 rangebegin = PL_regcomp_parse;
3664 value = utf8_to_uv((U8*)PL_regcomp_parse,
3665 PL_regxend - PL_regcomp_parse,
3667 PL_regcomp_parse += numlen;
3669 namedclass = regpposixcc(value);
3670 else if (value == '\\') {
3671 value = (U32)utf8_to_uv((U8*)PL_regcomp_parse,
3672 PL_regxend - PL_regcomp_parse,
3674 PL_regcomp_parse += numlen;
3675 /* Some compilers cannot handle switching on 64-bit integer
3676 * values, therefore value cannot be an UV. Yes, this will
3677 * be a problem later if we want switch on Unicode. --jhi */
3679 case 'w': namedclass = ANYOF_ALNUM; break;
3680 case 'W': namedclass = ANYOF_NALNUM; break;
3681 case 's': namedclass = ANYOF_SPACE; break;
3682 case 'S': namedclass = ANYOF_NSPACE; break;
3683 case 'd': namedclass = ANYOF_DIGIT; break;
3684 case 'D': namedclass = ANYOF_NDIGIT; break;
3687 if (*PL_regcomp_parse == '{') {
3688 e = strchr(PL_regcomp_parse++, '}');
3690 vFAIL("Missing right brace on \\p{}");
3691 n = e - PL_regcomp_parse;
3694 e = PL_regcomp_parse;
3699 Perl_sv_catpvf(aTHX_ listsv,
3700 "+utf8::%.*s\n", (int)n, PL_regcomp_parse);
3702 Perl_sv_catpvf(aTHX_ listsv,
3703 "!utf8::%.*s\n", (int)n, PL_regcomp_parse);
3705 PL_regcomp_parse = e + 1;
3706 lastvalue = OOB_UTF8;
3708 case 'n': value = '\n'; break;
3709 case 'r': value = '\r'; break;
3710 case 't': value = '\t'; break;
3711 case 'f': value = '\f'; break;
3712 case 'b': value = '\b'; break;
3714 case 'e': value = '\033'; break;
3715 case 'a': value = '\007'; break;
3717 case 'e': value = '\047'; break;
3718 case 'a': value = '\057'; break;
3721 if (*PL_regcomp_parse == '{') {
3722 e = strchr(PL_regcomp_parse++, '}');
3724 vFAIL("Missing right brace on \\x{}");
3725 numlen = 1; /* allow underscores */
3726 value = (UV)scan_hex(PL_regcomp_parse,
3727 e - PL_regcomp_parse,
3729 PL_regcomp_parse = e + 1;
3732 numlen = 0; /* disallow underscores */
3733 value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen);
3734 PL_regcomp_parse += numlen;
3738 value = UCHARAT(PL_regcomp_parse++);
3739 value = toCTRL(value);
3741 case '0': case '1': case '2': case '3': case '4':
3742 case '5': case '6': case '7': case '8': case '9':
3743 numlen = 0; /* disallow underscores */
3744 value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen);
3745 PL_regcomp_parse += numlen;
3748 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3749 vWARN2(PL_regcomp_parse,
3750 "Unrecognized escape \\%c in character class passed through",
3755 if (namedclass > OOB_NAMEDCLASS) {
3756 if (range) { /* a-\d, a-[:digit:] */
3758 if (ckWARN(WARN_REGEXP))
3759 vWARN4(PL_regcomp_parse,
3760 "False [] range \"%*.*s\"",
3761 PL_regcomp_parse - rangebegin,
3762 PL_regcomp_parse - rangebegin,
3764 Perl_sv_catpvf(aTHX_ listsv,
3765 /* 0x002D is Unicode for '-' */
3766 "%04"UVxf"\n002D\n", (UV)lastvalue);
3771 switch (namedclass) {
3773 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
3775 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
3777 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
3779 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
3781 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
3783 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
3785 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
3787 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
3789 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
3791 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
3793 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
3795 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
3797 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
3799 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
3801 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
3803 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
3805 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
3807 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
3809 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
3811 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
3815 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
3819 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
3821 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
3823 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
3825 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
3827 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
3833 if (lastvalue > value) { /* b-a */
3834 Simple_vFAIL4("invalid [] range \"%*.*s\"",
3835 PL_regcomp_parse - rangebegin,
3836 PL_regcomp_parse - rangebegin,
3843 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
3844 PL_regcomp_parse[1] != ']') {
3846 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3847 if (ckWARN(WARN_REGEXP))
3848 vWARN4(PL_regcomp_parse,
3849 "False [] range \"%*.*s\"",
3850 PL_regcomp_parse - rangebegin,
3851 PL_regcomp_parse - rangebegin,
3854 Perl_sv_catpvf(aTHX_ listsv,
3855 /* 0x002D is Unicode for '-' */
3859 continue; /* do it next time */
3862 /* now is the next time */
3864 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3865 (UV)lastvalue, (UV)value);
3869 ret = reganode(ANYOFUTF8, 0);
3872 SV *rv = swash_init("utf8", "", listsv, 1, 0);
3873 SvREFCNT_dec(listsv);
3874 n = add_data(1,"s");
3875 PL_regcomp_rx->data->data[n] = (void*)rv;
3876 ARG1_SET(ret, flags);
3887 char* retval = PL_regcomp_parse++;
3890 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
3891 PL_regcomp_parse[2] == '#') {
3892 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
3897 if (PL_regflags & PMf_EXTENDED) {
3898 if (isSPACE(*PL_regcomp_parse)) {
3902 else if (*PL_regcomp_parse == '#') {
3903 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
3914 - reg_node - emit a node
3916 STATIC regnode * /* Location. */
3917 S_reg_node(pTHX_ U8 op)
3920 register regnode *ret;
3921 register regnode *ptr;
3925 SIZE_ALIGN(PL_regsize);
3930 NODE_ALIGN_FILL(ret);
3932 FILL_ADVANCE_NODE(ptr, op);
3939 - reganode - emit a node with an argument
3941 STATIC regnode * /* Location. */
3942 S_reganode(pTHX_ U8 op, U32 arg)
3945 register regnode *ret;
3946 register regnode *ptr;
3950 SIZE_ALIGN(PL_regsize);
3955 NODE_ALIGN_FILL(ret);
3957 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3964 - reguni - emit (if appropriate) a Unicode character
3967 S_reguni(pTHX_ UV uv, char* s, STRLEN* lenp)
3971 U8 tmpbuf[UTF8_MAXLEN];
3972 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
3975 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
3980 - reginsert - insert an operator in front of already-emitted operand
3982 * Means relocating the operand.
3985 S_reginsert(pTHX_ U8 op, regnode *opnd)
3988 register regnode *src;
3989 register regnode *dst;
3990 register regnode *place;
3991 register int offset = regarglen[(U8)op];
3993 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3996 PL_regsize += NODE_STEP_REGNODE + offset;
4001 PL_regcode += NODE_STEP_REGNODE + offset;
4004 StructCopy(--src, --dst, regnode);
4006 place = opnd; /* Op node, where operand used to be. */
4007 src = NEXTOPER(place);
4008 FILL_ADVANCE_NODE(place, op);
4009 Zero(src, offset, regnode);
4013 - regtail - set the next-pointer at the end of a node chain of p to val.
4016 S_regtail(pTHX_ regnode *p, regnode *val)
4019 register regnode *scan;
4020 register regnode *temp;
4025 /* Find last node. */
4028 temp = regnext(scan);
4034 if (reg_off_by_arg[OP(scan)]) {
4035 ARG_SET(scan, val - scan);
4038 NEXT_OFF(scan) = val - scan;
4043 - regoptail - regtail on operand of first argument; nop if operandless
4046 S_regoptail(pTHX_ regnode *p, regnode *val)
4049 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4050 if (p == NULL || SIZE_ONLY)
4052 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4053 regtail(NEXTOPER(p), val);
4055 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4056 regtail(NEXTOPER(NEXTOPER(p)), val);
4063 - regcurly - a little FSA that accepts {\d+,?\d*}
4066 S_regcurly(pTHX_ register char *s)
4085 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4088 register U8 op = EXACT; /* Arbitrary non-END op. */
4089 register regnode *next;
4091 while (op != END && (!last || node < last)) {
4092 /* While that wasn't END last time... */
4098 next = regnext(node);
4100 if (OP(node) == OPTIMIZED)
4103 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4104 (int)(2*l + 1), "", SvPVX(sv));
4105 if (next == NULL) /* Next ptr. */
4106 PerlIO_printf(Perl_debug_log, "(0)");
4108 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4109 (void)PerlIO_putc(Perl_debug_log, '\n');
4111 if (PL_regkind[(U8)op] == BRANCHJ) {
4112 register regnode *nnode = (OP(next) == LONGJMP
4115 if (last && nnode > last)
4117 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4119 else if (PL_regkind[(U8)op] == BRANCH) {
4120 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4122 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4123 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4124 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4126 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4127 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4130 else if ( op == PLUS || op == STAR) {
4131 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4133 else if (op == ANYOF) {
4134 node = NEXTOPER(node);
4137 else if (PL_regkind[(U8)op] == EXACT) {
4138 /* Literal string, where present. */
4139 node += NODE_SZ_STR(node) - 1;
4140 node = NEXTOPER(node);
4143 node = NEXTOPER(node);
4144 node += regarglen[(U8)op];
4146 if (op == CURLYX || op == OPEN)
4148 else if (op == WHILEM)
4151 #endif /* DEBUGGING */
4156 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4159 Perl_regdump(pTHX_ regexp *r)
4163 SV *sv = sv_newmortal();
4165 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4167 /* Header fields of interest. */
4168 if (r->anchored_substr)
4169 PerlIO_printf(Perl_debug_log,
4170 "anchored `%s%.*s%s'%s at %"IVdf" ",
4172 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4173 SvPVX(r->anchored_substr),
4175 SvTAIL(r->anchored_substr) ? "$" : "",
4176 (IV)r->anchored_offset);
4177 if (r->float_substr)
4178 PerlIO_printf(Perl_debug_log,
4179 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4181 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4182 SvPVX(r->float_substr),
4184 SvTAIL(r->float_substr) ? "$" : "",
4185 (IV)r->float_min_offset, (UV)r->float_max_offset);
4186 if (r->check_substr)
4187 PerlIO_printf(Perl_debug_log,
4188 r->check_substr == r->float_substr
4189 ? "(checking floating" : "(checking anchored");
4190 if (r->reganch & ROPT_NOSCAN)
4191 PerlIO_printf(Perl_debug_log, " noscan");
4192 if (r->reganch & ROPT_CHECK_ALL)
4193 PerlIO_printf(Perl_debug_log, " isall");
4194 if (r->check_substr)
4195 PerlIO_printf(Perl_debug_log, ") ");
4197 if (r->regstclass) {
4198 regprop(sv, r->regstclass);
4199 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4201 if (r->reganch & ROPT_ANCH) {
4202 PerlIO_printf(Perl_debug_log, "anchored");
4203 if (r->reganch & ROPT_ANCH_BOL)
4204 PerlIO_printf(Perl_debug_log, "(BOL)");
4205 if (r->reganch & ROPT_ANCH_MBOL)
4206 PerlIO_printf(Perl_debug_log, "(MBOL)");
4207 if (r->reganch & ROPT_ANCH_SBOL)
4208 PerlIO_printf(Perl_debug_log, "(SBOL)");
4209 if (r->reganch & ROPT_ANCH_GPOS)
4210 PerlIO_printf(Perl_debug_log, "(GPOS)");
4211 PerlIO_putc(Perl_debug_log, ' ');
4213 if (r->reganch & ROPT_GPOS_SEEN)
4214 PerlIO_printf(Perl_debug_log, "GPOS ");
4215 if (r->reganch & ROPT_SKIP)
4216 PerlIO_printf(Perl_debug_log, "plus ");
4217 if (r->reganch & ROPT_IMPLICIT)
4218 PerlIO_printf(Perl_debug_log, "implicit ");
4219 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4220 if (r->reganch & ROPT_EVAL_SEEN)
4221 PerlIO_printf(Perl_debug_log, "with eval ");
4222 PerlIO_printf(Perl_debug_log, "\n");
4223 #endif /* DEBUGGING */
4227 S_put_byte(pTHX_ SV *sv, int c)
4229 if (c <= ' ' || c == 127 || c == 255)
4230 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4231 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4232 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4234 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4238 - regprop - printable representation of opcode
4241 Perl_regprop(pTHX_ SV *sv, regnode *o)
4247 sv_setpvn(sv, "", 0);
4248 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4249 FAIL("Corrupted regexp opcode");
4250 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4252 k = PL_regkind[(U8)OP(o)];
4255 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4256 STR_LEN(o), STRING(o), PL_colors[1]);
4257 else if (k == CURLY) {
4258 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4259 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4260 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4262 else if (k == WHILEM && o->flags) /* Ordinal/of */
4263 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4264 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4265 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4266 else if (k == LOGICAL)
4267 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4268 else if (k == ANYOF) {
4269 int i, rangestart = -1;
4270 const char * const out[] = { /* Should be syncronized with
4271 ANYOF_ #xdefines in regcomp.h */
4304 if (o->flags & ANYOF_LOCALE)
4305 sv_catpv(sv, "{loc}");
4306 if (o->flags & ANYOF_FOLD)
4307 sv_catpv(sv, "{i}");
4308 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4309 if (o->flags & ANYOF_INVERT)
4311 for (i = 0; i <= 256; i++) {
4312 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4313 if (rangestart == -1)
4315 } else if (rangestart != -1) {
4316 if (i <= rangestart + 3)
4317 for (; rangestart < i; rangestart++)
4318 put_byte(sv, rangestart);
4320 put_byte(sv, rangestart);
4322 put_byte(sv, i - 1);
4327 if (o->flags & ANYOF_CLASS)
4328 for (i = 0; i < sizeof(out)/sizeof(char*); i++)
4329 if (ANYOF_CLASS_TEST(o,i))
4330 sv_catpv(sv, out[i]);
4331 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4333 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4334 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4335 #endif /* DEBUGGING */
4339 Perl_re_intuit_string(pTHX_ regexp *prog)
4340 { /* Assume that RE_INTUIT is set */
4343 char *s = SvPV(prog->check_substr,n_a);
4345 if (!PL_colorset) reginitcolors();
4346 PerlIO_printf(Perl_debug_log,
4347 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4348 PL_colors[4],PL_colors[5],PL_colors[0],
4351 (strlen(s) > 60 ? "..." : ""));
4354 return prog->check_substr;
4358 Perl_pregfree(pTHX_ struct regexp *r)
4361 DEBUG_r(if (!PL_colorset) reginitcolors());
4363 if (!r || (--r->refcnt > 0))
4365 DEBUG_r(PerlIO_printf(Perl_debug_log,
4366 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4367 PL_colors[4],PL_colors[5],PL_colors[0],
4370 (strlen(r->precomp) > 60 ? "..." : "")));
4373 Safefree(r->precomp);
4374 if (RX_MATCH_COPIED(r))
4375 Safefree(r->subbeg);
4377 if (r->anchored_substr)
4378 SvREFCNT_dec(r->anchored_substr);
4379 if (r->float_substr)
4380 SvREFCNT_dec(r->float_substr);
4381 Safefree(r->substrs);
4384 int n = r->data->count;
4385 AV* new_comppad = NULL;
4390 switch (r->data->what[n]) {
4392 SvREFCNT_dec((SV*)r->data->data[n]);
4395 Safefree(r->data->data[n]);
4398 new_comppad = (AV*)r->data->data[n];
4401 if (new_comppad == NULL)
4402 Perl_croak(aTHX_ "panic: pregfree comppad");
4403 old_comppad = PL_comppad;
4404 old_curpad = PL_curpad;
4405 /* Watch out for global destruction's random ordering. */
4406 if (SvTYPE(new_comppad) == SVt_PVAV) {
4407 PL_comppad = new_comppad;
4408 PL_curpad = AvARRAY(new_comppad);
4412 op_free((OP_4tree*)r->data->data[n]);
4413 PL_comppad = old_comppad;
4414 PL_curpad = old_curpad;
4415 SvREFCNT_dec((SV*)new_comppad);
4421 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
4424 Safefree(r->data->what);
4427 Safefree(r->startp);
4433 - regnext - dig the "next" pointer out of a node
4435 * [Note, when REGALIGN is defined there are two places in regmatch()
4436 * that bypass this code for speed.]
4439 Perl_regnext(pTHX_ register regnode *p)
4442 register I32 offset;
4444 if (p == &PL_regdummy)
4447 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4455 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4458 STRLEN l1 = strlen(pat1);
4459 STRLEN l2 = strlen(pat2);
4468 Copy(pat1, buf, l1 , char);
4469 Copy(pat2, buf + l1, l2 , char);
4470 buf[l1 + l2] = '\n';
4471 buf[l1 + l2 + 1] = '\0';
4473 /* ANSI variant takes additional second argument */
4474 va_start(args, pat2);
4478 msv = vmess(buf, &args);
4480 message = SvPV(msv,l1);
4483 Copy(message, buf, l1 , char);
4484 buf[l1] = '\0'; /* Overwrite \n */
4485 Perl_croak(aTHX_ "%s", buf);
4488 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4491 Perl_save_re_context(pTHX)
4495 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
4496 SAVEI32(PL_regnpar); /* () count. */
4497 SAVEI32(PL_regsize); /* Code size. */
4498 SAVEI16(PL_regflags); /* are we folding, multilining? */
4499 SAVEPPTR(PL_reginput); /* String-input pointer. */
4500 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4501 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4502 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4503 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4504 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4505 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4506 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4507 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4508 PL_reg_start_tmp = 0;
4509 SAVEFREEPV(PL_reg_start_tmp);
4510 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4511 PL_reg_start_tmpl = 0;
4512 SAVEVPTR(PL_regdata);
4513 SAVEI32(PL_reg_flags); /* from regexec.c */
4514 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4515 SAVEI32(PL_regnarrate); /* from regexec.c */
4516 SAVEVPTR(PL_regprogram); /* from regexec.c */
4517 SAVEINT(PL_regindent); /* from regexec.c */
4518 SAVEVPTR(PL_regcc); /* from regexec.c */
4519 SAVEVPTR(PL_curcop);
4520 SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */
4521 SAVEI32(PL_regseen); /* from regcomp.c */
4522 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
4523 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
4524 SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
4525 SAVEPPTR(PL_regxend); /* End of input for compile */
4526 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
4527 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4528 SAVEVPTR(PL_reg_re); /* from regexec.c */
4529 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4530 SAVESPTR(PL_reg_sv); /* from regexec.c */
4531 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4532 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4533 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4534 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4536 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4547 clear_re(pTHXo_ void *r)
4549 ReREFCNT_dec((regexp *)r);