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 typedef struct RExC_state_t {
115 U16 flags16; /* are we folding, multilining? */
116 char *precomp; /* uncompiled string. */
118 char *end; /* End of input for compile */
119 char *parse; /* Input-scan pointer. */
120 I32 whilem_seen; /* number of WHILEM in this expr */
121 regnode *emit; /* Code-emit pointer; ®dummy = don't */
122 I32 naughty; /* How bad is this pattern? */
123 I32 sawback; /* Did we see \1, ...? */
125 I32 size; /* Code size. */
126 I32 npar; /* () count. */
131 char *starttry; /* -Dr: where regtry was called. */
132 #define RExC_starttry (pRExC_state->starttry)
136 #define RExC_flags16 (pRExC_state->flags16)
137 #define RExC_precomp (pRExC_state->precomp)
138 #define RExC_rx (pRExC_state->rx)
139 #define RExC_end (pRExC_state->end)
140 #define RExC_parse (pRExC_state->parse)
141 #define RExC_whilem_seen (pRExC_state->whilem_seen)
142 #define RExC_emit (pRExC_state->emit)
143 #define RExC_naughty (pRExC_state->naughty)
144 #define RExC_sawback (pRExC_state->sawback)
145 #define RExC_seen (pRExC_state->seen)
146 #define RExC_size (pRExC_state->size)
147 #define RExC_npar (pRExC_state->npar)
148 #define RExC_extralen (pRExC_state->extralen)
149 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
150 #define RExC_seen_evals (pRExC_state->seen_evals)
152 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
153 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
154 ((*s) == '{' && regcurly(s)))
156 #define PERL_META "^$.[()|?+*\\"
158 #define META "^$.[()|?+*\\"
162 #undef SPSTART /* dratted cpp namespace... */
165 * Flags to be passed up and down.
167 #define WORST 0 /* Worst case. */
168 #define HASWIDTH 0x1 /* Known to match non-null strings. */
169 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
170 #define SPSTART 0x4 /* Starts with * or +. */
171 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
173 /* Length of a variant. */
175 typedef struct scan_data_t {
181 I32 last_end; /* min value, <0 unless valid. */
184 SV **longest; /* Either &l_fixed, or &l_float. */
188 I32 offset_float_min;
189 I32 offset_float_max;
193 struct regnode_charclass_class *start_class;
197 * Forward declarations for pregcomp()'s friends.
200 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
203 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
204 #define SF_BEFORE_SEOL 0x1
205 #define SF_BEFORE_MEOL 0x2
206 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
207 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
210 # define SF_FIX_SHIFT_EOL (0+2)
211 # define SF_FL_SHIFT_EOL (0+4)
213 # define SF_FIX_SHIFT_EOL (+2)
214 # define SF_FL_SHIFT_EOL (+4)
217 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
218 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
220 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
221 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
222 #define SF_IS_INF 0x40
223 #define SF_HAS_PAR 0x80
224 #define SF_IN_PAR 0x100
225 #define SF_HAS_EVAL 0x200
226 #define SCF_DO_SUBSTR 0x400
227 #define SCF_DO_STCLASS_AND 0x0800
228 #define SCF_DO_STCLASS_OR 0x1000
229 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
230 #define SCF_WHILEM_VISITED_POS 0x2000
233 #define UTF (PL_reg_flags & RF_utf8)
234 #define LOC (RExC_flags16 & PMf_LOCALE)
235 #define FOLD (RExC_flags16 & PMf_FOLD)
237 #define OOB_CHAR8 1234
238 #define OOB_UTF8 123456
239 #define OOB_NAMEDCLASS -1
241 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
242 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
245 /* length of regex to show in messages that don't mark a position within */
246 #define RegexLengthToShowInErrorMessages 127
249 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
250 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
251 * op/pragma/warn/regcomp.
253 #define MARKER1 "HERE" /* marker as it appears in the description */
254 #define MARKER2 " << HERE " /* marker as it appears within the regex */
256 #define REPORT_LOCATION " before " MARKER1 " mark in regex m/%.*s" MARKER2 "%s/"
259 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
260 * arg. Show regex, up to a maximum length. If it's too long, chop and add
265 char *ellipses = ""; \
266 unsigned len = strlen(RExC_precomp); \
269 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
271 if (len > RegexLengthToShowInErrorMessages) { \
272 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
273 len = RegexLengthToShowInErrorMessages - 10; \
276 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
277 msg, (int)len, RExC_precomp, ellipses); \
281 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
282 * args. Show regex, up to a maximum length. If it's too long, chop and add
285 #define FAIL2(pat,msg) \
287 char *ellipses = ""; \
288 unsigned len = strlen(RExC_precomp); \
291 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
293 if (len > RegexLengthToShowInErrorMessages) { \
294 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
295 len = RegexLengthToShowInErrorMessages - 10; \
298 S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \
299 msg, (int)len, RExC_precomp, ellipses); \
304 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
306 #define Simple_vFAIL(m) \
308 unsigned offset = strlen(RExC_precomp)-(RExC_end-RExC_parse); \
310 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
311 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
315 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
320 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
325 * Like Simple_vFAIL(), but accepts two arguments.
327 #define Simple_vFAIL2(m,a1) \
329 unsigned offset = strlen(RExC_precomp)-(RExC_end-RExC_parse); \
331 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
332 (int)offset, RExC_precomp, RExC_precomp + offset); \
336 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
338 #define vFAIL2(m,a1) \
341 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
342 Simple_vFAIL2(m, a1); \
347 * Like Simple_vFAIL(), but accepts three arguments.
349 #define Simple_vFAIL3(m, a1, a2) \
351 unsigned offset = strlen(RExC_precomp)-(RExC_end-RExC_parse); \
353 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
354 (int)offset, RExC_precomp, RExC_precomp + offset); \
358 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
360 #define vFAIL3(m,a1,a2) \
363 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
364 Simple_vFAIL3(m, a1, a2); \
368 * Like Simple_vFAIL(), but accepts four arguments.
370 #define Simple_vFAIL4(m, a1, a2, a3) \
372 unsigned offset = strlen(RExC_precomp)-(RExC_end-RExC_parse); \
374 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3,\
375 (int)offset, RExC_precomp, RExC_precomp + offset); \
379 * Like Simple_vFAIL(), but accepts five arguments.
381 #define Simple_vFAIL5(m, a1, a2, a3, a4) \
383 unsigned offset = strlen(RExC_precomp)-(RExC_end-RExC_parse); \
384 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, a4,\
385 (int)offset, RExC_precomp, RExC_precomp + offset); \
389 #define vWARN(loc,m) \
391 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
392 Perl_warner(aTHX_ WARN_REGEXP, "%s" REPORT_LOCATION,\
393 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
397 #define vWARN2(loc, m, a1) \
399 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
400 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
402 (int)offset, RExC_precomp, RExC_precomp + offset); \
405 #define vWARN3(loc, m, a1, a2) \
407 unsigned offset = strlen(RExC_precomp) - (RExC_end - (loc)); \
408 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
410 (int)offset, RExC_precomp, RExC_precomp + offset); \
413 #define vWARN4(loc, m, a1, a2, a3) \
415 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
416 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
418 (int)offset, RExC_precomp, RExC_precomp + offset); \
422 /* Allow for side effects in s */
423 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END
425 static void clear_re(pTHXo_ void *r);
427 /* Mark that we cannot extend a found fixed substring at this point.
428 Updata the longest found anchored substring and the longest found
429 floating substrings if needed. */
432 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
435 STRLEN l = CHR_SVLEN(data->last_found);
436 STRLEN old_l = CHR_SVLEN(*data->longest);
438 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
439 sv_setsv(*data->longest, data->last_found);
440 if (*data->longest == data->longest_fixed) {
441 data->offset_fixed = l ? data->last_start_min : data->pos_min;
442 if (data->flags & SF_BEFORE_EOL)
444 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
446 data->flags &= ~SF_FIX_BEFORE_EOL;
449 data->offset_float_min = l ? data->last_start_min : data->pos_min;
450 data->offset_float_max = (l
451 ? data->last_start_max
452 : data->pos_min + data->pos_delta);
453 if (data->flags & SF_BEFORE_EOL)
455 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
457 data->flags &= ~SF_FL_BEFORE_EOL;
460 SvCUR_set(data->last_found, 0);
462 data->flags &= ~SF_BEFORE_EOL;
465 /* Can match anything (initialization) */
467 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
471 ANYOF_CLASS_ZERO(cl);
472 for (value = 0; value < 256; ++value)
473 ANYOF_BITMAP_SET(cl, value);
474 cl->flags = ANYOF_EOS;
476 cl->flags |= ANYOF_LOCALE;
479 /* Can match anything (initialization) */
481 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
485 for (value = 0; value <= ANYOF_MAX; value += 2)
486 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
488 for (value = 0; value < 256; ++value)
489 if (!ANYOF_BITMAP_TEST(cl, value))
494 /* Can match anything (initialization) */
496 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
498 Zero(cl, 1, struct regnode_charclass_class);
500 cl_anything(pRExC_state, cl);
504 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
506 Zero(cl, 1, struct regnode_charclass_class);
508 cl_anything(pRExC_state, cl);
510 cl->flags |= ANYOF_LOCALE;
513 /* 'And' a given class with another one. Can create false positives */
514 /* We assume that cl is not inverted */
516 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
517 struct regnode_charclass_class *and_with)
519 if (!(and_with->flags & ANYOF_CLASS)
520 && !(cl->flags & ANYOF_CLASS)
521 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
522 && !(and_with->flags & ANYOF_FOLD)
523 && !(cl->flags & ANYOF_FOLD)) {
526 if (and_with->flags & ANYOF_INVERT)
527 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
528 cl->bitmap[i] &= ~and_with->bitmap[i];
530 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
531 cl->bitmap[i] &= and_with->bitmap[i];
532 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
533 if (!(and_with->flags & ANYOF_EOS))
534 cl->flags &= ~ANYOF_EOS;
537 /* 'OR' a given class with another one. Can create false positives */
538 /* We assume that cl is not inverted */
540 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
542 if (or_with->flags & ANYOF_INVERT) {
544 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
545 * <= (B1 | !B2) | (CL1 | !CL2)
546 * which is wasteful if CL2 is small, but we ignore CL2:
547 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
548 * XXXX Can we handle case-fold? Unclear:
549 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
550 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
552 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
553 && !(or_with->flags & ANYOF_FOLD)
554 && !(cl->flags & ANYOF_FOLD) ) {
557 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
558 cl->bitmap[i] |= ~or_with->bitmap[i];
559 } /* XXXX: logic is complicated otherwise */
561 cl_anything(pRExC_state, cl);
564 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
565 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
566 && (!(or_with->flags & ANYOF_FOLD)
567 || (cl->flags & ANYOF_FOLD)) ) {
570 /* OR char bitmap and class bitmap separately */
571 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
572 cl->bitmap[i] |= or_with->bitmap[i];
573 if (or_with->flags & ANYOF_CLASS) {
574 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
575 cl->classflags[i] |= or_with->classflags[i];
576 cl->flags |= ANYOF_CLASS;
579 else { /* XXXX: logic is complicated, leave it along for a moment. */
580 cl_anything(pRExC_state, cl);
583 if (or_with->flags & ANYOF_EOS)
584 cl->flags |= ANYOF_EOS;
587 /* REx optimizer. Converts nodes into quickier variants "in place".
588 Finds fixed substrings. */
590 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
591 to the position after last scanned or to NULL. */
594 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
595 /* scanp: Start here (read-write). */
596 /* deltap: Write maxlen-minlen here. */
597 /* last: Stop before this one. */
600 I32 min = 0, pars = 0, code;
601 regnode *scan = *scanp, *next;
603 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
604 int is_inf_internal = 0; /* The studied chunk is infinite */
605 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
606 scan_data_t data_fake;
607 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
609 while (scan && OP(scan) != END && scan < last) {
610 /* Peephole optimizer: */
612 if (PL_regkind[(U8)OP(scan)] == EXACT) {
613 /* Merge several consecutive EXACTish nodes into one. */
614 regnode *n = regnext(scan);
617 regnode *stop = scan;
620 next = scan + NODE_SZ_STR(scan);
621 /* Skip NOTHING, merge EXACT*. */
623 ( PL_regkind[(U8)OP(n)] == NOTHING ||
624 (stringok && (OP(n) == OP(scan))))
626 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
627 if (OP(n) == TAIL || n > next)
629 if (PL_regkind[(U8)OP(n)] == NOTHING) {
630 NEXT_OFF(scan) += NEXT_OFF(n);
631 next = n + NODE_STEP_REGNODE;
639 int oldl = STR_LEN(scan);
640 regnode *nnext = regnext(n);
642 if (oldl + STR_LEN(n) > U8_MAX)
644 NEXT_OFF(scan) += NEXT_OFF(n);
645 STR_LEN(scan) += STR_LEN(n);
646 next = n + NODE_SZ_STR(n);
647 /* Now we can overwrite *n : */
648 Move(STRING(n), STRING(scan) + oldl,
659 n = scan + NODE_SZ_STR(scan);
661 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
669 /* Follow the next-chain of the current node and optimize
670 away all the NOTHINGs from it. */
671 if (OP(scan) != CURLYX) {
672 int max = (reg_off_by_arg[OP(scan)]
674 /* I32 may be smaller than U16 on CRAYs! */
675 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
676 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
680 /* Skip NOTHING and LONGJMP. */
681 while ((n = regnext(n))
682 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
683 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
686 if (reg_off_by_arg[OP(scan)])
689 NEXT_OFF(scan) = off;
691 /* The principal pseudo-switch. Cannot be a switch, since we
692 look into several different things. */
693 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
694 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
695 next = regnext(scan);
698 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
699 I32 max1 = 0, min1 = I32_MAX, num = 0;
700 struct regnode_charclass_class accum;
702 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
703 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
704 if (flags & SCF_DO_STCLASS)
705 cl_init_zero(pRExC_state, &accum);
706 while (OP(scan) == code) {
707 I32 deltanext, minnext, f = 0, fake;
708 struct regnode_charclass_class this_class;
713 data_fake.whilem_c = data->whilem_c;
714 data_fake.last_closep = data->last_closep;
717 data_fake.last_closep = &fake;
718 next = regnext(scan);
719 scan = NEXTOPER(scan);
721 scan = NEXTOPER(scan);
722 if (flags & SCF_DO_STCLASS) {
723 cl_init(pRExC_state, &this_class);
724 data_fake.start_class = &this_class;
725 f = SCF_DO_STCLASS_AND;
727 if (flags & SCF_WHILEM_VISITED_POS)
728 f |= SCF_WHILEM_VISITED_POS;
729 /* we suppose the run is continuous, last=next...*/
730 minnext = study_chunk(pRExC_state, &scan, &deltanext,
731 next, &data_fake, f);
734 if (max1 < minnext + deltanext)
735 max1 = minnext + deltanext;
736 if (deltanext == I32_MAX)
737 is_inf = is_inf_internal = 1;
739 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
741 if (data && (data_fake.flags & SF_HAS_EVAL))
742 data->flags |= SF_HAS_EVAL;
744 data->whilem_c = data_fake.whilem_c;
745 if (flags & SCF_DO_STCLASS)
746 cl_or(pRExC_state, &accum, &this_class);
750 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
752 if (flags & SCF_DO_SUBSTR) {
753 data->pos_min += min1;
754 data->pos_delta += max1 - min1;
755 if (max1 != min1 || is_inf)
756 data->longest = &(data->longest_float);
759 delta += max1 - min1;
760 if (flags & SCF_DO_STCLASS_OR) {
761 cl_or(pRExC_state, data->start_class, &accum);
763 cl_and(data->start_class, &and_with);
764 flags &= ~SCF_DO_STCLASS;
767 else if (flags & SCF_DO_STCLASS_AND) {
769 cl_and(data->start_class, &accum);
770 flags &= ~SCF_DO_STCLASS;
773 /* Switch to OR mode: cache the old value of
774 * data->start_class */
775 StructCopy(data->start_class, &and_with,
776 struct regnode_charclass_class);
777 flags &= ~SCF_DO_STCLASS_AND;
778 StructCopy(&accum, data->start_class,
779 struct regnode_charclass_class);
780 flags |= SCF_DO_STCLASS_OR;
781 data->start_class->flags |= ANYOF_EOS;
785 else if (code == BRANCHJ) /* single branch is optimized. */
786 scan = NEXTOPER(NEXTOPER(scan));
787 else /* single branch is optimized. */
788 scan = NEXTOPER(scan);
791 else if (OP(scan) == EXACT) {
792 I32 l = STR_LEN(scan);
794 unsigned char *s = (unsigned char *)STRING(scan);
795 unsigned char *e = s + l;
804 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
805 /* The code below prefers earlier match for fixed
806 offset, later match for variable offset. */
807 if (data->last_end == -1) { /* Update the start info. */
808 data->last_start_min = data->pos_min;
809 data->last_start_max = is_inf
810 ? I32_MAX : data->pos_min + data->pos_delta;
812 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
813 data->last_end = data->pos_min + l;
814 data->pos_min += l; /* As in the first entry. */
815 data->flags &= ~SF_BEFORE_EOL;
817 if (flags & SCF_DO_STCLASS_AND) {
818 /* Check whether it is compatible with what we know already! */
821 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
822 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
823 && (!(data->start_class->flags & ANYOF_FOLD)
824 || !ANYOF_BITMAP_TEST(data->start_class,
825 PL_fold[*(U8*)STRING(scan)])))
827 ANYOF_CLASS_ZERO(data->start_class);
828 ANYOF_BITMAP_ZERO(data->start_class);
830 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
831 data->start_class->flags &= ~ANYOF_EOS;
833 else if (flags & SCF_DO_STCLASS_OR) {
834 /* false positive possible if the class is case-folded */
835 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
836 data->start_class->flags &= ~ANYOF_EOS;
837 cl_and(data->start_class, &and_with);
839 flags &= ~SCF_DO_STCLASS;
841 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
842 I32 l = STR_LEN(scan);
844 /* Search for fixed substrings supports EXACT only. */
845 if (flags & SCF_DO_SUBSTR)
846 scan_commit(pRExC_state, data);
848 unsigned char *s = (unsigned char *)STRING(scan);
849 unsigned char *e = s + l;
858 if (data && (flags & SCF_DO_SUBSTR))
860 if (flags & SCF_DO_STCLASS_AND) {
861 /* Check whether it is compatible with what we know already! */
864 if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
865 && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan))
866 && !ANYOF_BITMAP_TEST(data->start_class,
867 PL_fold[*(U8*)STRING(scan)]))
869 ANYOF_CLASS_ZERO(data->start_class);
870 ANYOF_BITMAP_ZERO(data->start_class);
872 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
873 data->start_class->flags &= ~ANYOF_EOS;
874 data->start_class->flags |= ANYOF_FOLD;
875 if (OP(scan) == EXACTFL)
876 data->start_class->flags |= ANYOF_LOCALE;
879 else if (flags & SCF_DO_STCLASS_OR) {
880 if (data->start_class->flags & ANYOF_FOLD) {
881 /* false positive possible if the class is case-folded.
882 Assume that the locale settings are the same... */
883 ANYOF_BITMAP_SET(data->start_class, *STRING(scan));
884 data->start_class->flags &= ~ANYOF_EOS;
886 cl_and(data->start_class, &and_with);
888 flags &= ~SCF_DO_STCLASS;
890 else if (strchr((char*)PL_varies,OP(scan))) {
891 I32 mincount, maxcount, minnext, deltanext, fl;
892 I32 f = flags, pos_before = 0;
893 regnode *oscan = scan;
894 struct regnode_charclass_class this_class;
895 struct regnode_charclass_class *oclass = NULL;
897 switch (PL_regkind[(U8)OP(scan)]) {
898 case WHILEM: /* End of (?:...)* . */
899 scan = NEXTOPER(scan);
902 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
903 next = NEXTOPER(scan);
904 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
906 maxcount = REG_INFTY;
907 next = regnext(scan);
908 scan = NEXTOPER(scan);
912 if (flags & SCF_DO_SUBSTR)
917 if (flags & SCF_DO_STCLASS) {
919 maxcount = REG_INFTY;
920 next = regnext(scan);
921 scan = NEXTOPER(scan);
924 is_inf = is_inf_internal = 1;
925 scan = regnext(scan);
926 if (flags & SCF_DO_SUBSTR) {
927 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
928 data->longest = &(data->longest_float);
930 goto optimize_curly_tail;
932 mincount = ARG1(scan);
933 maxcount = ARG2(scan);
934 next = regnext(scan);
935 if (OP(scan) == CURLYX) {
936 I32 lp = (data ? *(data->last_closep) : 0);
938 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
940 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
942 if (flags & SCF_DO_SUBSTR) {
943 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
944 pos_before = data->pos_min;
948 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
950 data->flags |= SF_IS_INF;
952 if (flags & SCF_DO_STCLASS) {
953 cl_init(pRExC_state, &this_class);
954 oclass = data->start_class;
955 data->start_class = &this_class;
956 f |= SCF_DO_STCLASS_AND;
957 f &= ~SCF_DO_STCLASS_OR;
959 /* These are the cases when once a subexpression
960 fails at a particular position, it cannot succeed
961 even after backtracking at the enclosing scope.
963 XXXX what if minimal match and we are at the
964 initial run of {n,m}? */
965 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
966 f &= ~SCF_WHILEM_VISITED_POS;
968 /* This will finish on WHILEM, setting scan, or on NULL: */
969 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
971 ? (f & ~SCF_DO_SUBSTR) : f);
973 if (flags & SCF_DO_STCLASS)
974 data->start_class = oclass;
975 if (mincount == 0 || minnext == 0) {
976 if (flags & SCF_DO_STCLASS_OR) {
977 cl_or(pRExC_state, data->start_class, &this_class);
979 else if (flags & SCF_DO_STCLASS_AND) {
980 /* Switch to OR mode: cache the old value of
981 * data->start_class */
982 StructCopy(data->start_class, &and_with,
983 struct regnode_charclass_class);
984 flags &= ~SCF_DO_STCLASS_AND;
985 StructCopy(&this_class, data->start_class,
986 struct regnode_charclass_class);
987 flags |= SCF_DO_STCLASS_OR;
988 data->start_class->flags |= ANYOF_EOS;
990 } else { /* Non-zero len */
991 if (flags & SCF_DO_STCLASS_OR) {
992 cl_or(pRExC_state, data->start_class, &this_class);
993 cl_and(data->start_class, &and_with);
995 else if (flags & SCF_DO_STCLASS_AND)
996 cl_and(data->start_class, &this_class);
997 flags &= ~SCF_DO_STCLASS;
999 if (!scan) /* It was not CURLYX, but CURLY. */
1001 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
1002 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1003 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1006 "Quantifier unexpected on zero-length expression");
1009 min += minnext * mincount;
1010 is_inf_internal |= ((maxcount == REG_INFTY
1011 && (minnext + deltanext) > 0)
1012 || deltanext == I32_MAX);
1013 is_inf |= is_inf_internal;
1014 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1016 /* Try powerful optimization CURLYX => CURLYN. */
1017 if ( OP(oscan) == CURLYX && data
1018 && data->flags & SF_IN_PAR
1019 && !(data->flags & SF_HAS_EVAL)
1020 && !deltanext && minnext == 1 ) {
1021 /* Try to optimize to CURLYN. */
1022 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1023 regnode *nxt1 = nxt, *nxt2;
1027 if (!strchr((char*)PL_simple,OP(nxt))
1028 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1029 && STR_LEN(nxt) == 1))
1033 if (OP(nxt) != CLOSE)
1035 /* Now we know that nxt2 is the only contents: */
1036 oscan->flags = ARG(nxt);
1038 OP(nxt1) = NOTHING; /* was OPEN. */
1040 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1041 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1042 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1043 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1044 OP(nxt + 1) = OPTIMIZED; /* was count. */
1045 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1050 /* Try optimization CURLYX => CURLYM. */
1051 if ( OP(oscan) == CURLYX && data
1052 && !(data->flags & SF_HAS_PAR)
1053 && !(data->flags & SF_HAS_EVAL)
1055 /* XXXX How to optimize if data == 0? */
1056 /* Optimize to a simpler form. */
1057 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1061 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1062 && (OP(nxt2) != WHILEM))
1064 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1065 /* Need to optimize away parenths. */
1066 if (data->flags & SF_IN_PAR) {
1067 /* Set the parenth number. */
1068 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1070 if (OP(nxt) != CLOSE)
1071 FAIL("Panic opt close");
1072 oscan->flags = ARG(nxt);
1073 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1074 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1076 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1077 OP(nxt + 1) = OPTIMIZED; /* was count. */
1078 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1079 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1082 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1083 regnode *nnxt = regnext(nxt1);
1086 if (reg_off_by_arg[OP(nxt1)])
1087 ARG_SET(nxt1, nxt2 - nxt1);
1088 else if (nxt2 - nxt1 < U16_MAX)
1089 NEXT_OFF(nxt1) = nxt2 - nxt1;
1091 OP(nxt) = NOTHING; /* Cannot beautify */
1096 /* Optimize again: */
1097 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1103 else if ((OP(oscan) == CURLYX)
1104 && (flags & SCF_WHILEM_VISITED_POS)
1105 /* See the comment on a similar expression above.
1106 However, this time it not a subexpression
1107 we care about, but the expression itself. */
1108 && (maxcount == REG_INFTY)
1109 && data && ++data->whilem_c < 16) {
1110 /* This stays as CURLYX, we can put the count/of pair. */
1111 /* Find WHILEM (as in regexec.c) */
1112 regnode *nxt = oscan + NEXT_OFF(oscan);
1114 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1116 PREVOPER(nxt)->flags = data->whilem_c
1117 | (RExC_whilem_seen << 4); /* On WHILEM */
1119 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1121 if (flags & SCF_DO_SUBSTR) {
1122 SV *last_str = Nullsv;
1123 int counted = mincount != 0;
1125 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1126 I32 b = pos_before >= data->last_start_min
1127 ? pos_before : data->last_start_min;
1129 char *s = SvPV(data->last_found, l);
1130 I32 old = b - data->last_start_min;
1133 old = utf8_hop((U8*)s, old) - (U8*)s;
1136 /* Get the added string: */
1137 last_str = newSVpvn(s + old, l);
1138 if (deltanext == 0 && pos_before == b) {
1139 /* What was added is a constant string */
1141 SvGROW(last_str, (mincount * l) + 1);
1142 repeatcpy(SvPVX(last_str) + l,
1143 SvPVX(last_str), l, mincount - 1);
1144 SvCUR(last_str) *= mincount;
1145 /* Add additional parts. */
1146 SvCUR_set(data->last_found,
1147 SvCUR(data->last_found) - l);
1148 sv_catsv(data->last_found, last_str);
1149 data->last_end += l * (mincount - 1);
1152 /* start offset must point into the last copy */
1153 data->last_start_min += minnext * (mincount - 1);
1154 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1155 * (minnext + data->pos_delta);
1158 /* It is counted once already... */
1159 data->pos_min += minnext * (mincount - counted);
1160 data->pos_delta += - counted * deltanext +
1161 (minnext + deltanext) * maxcount - minnext * mincount;
1162 if (mincount != maxcount) {
1163 /* Cannot extend fixed substrings found inside
1165 scan_commit(pRExC_state,data);
1166 if (mincount && last_str) {
1167 sv_setsv(data->last_found, last_str);
1168 data->last_end = data->pos_min;
1169 data->last_start_min =
1170 data->pos_min - CHR_SVLEN(last_str);
1171 data->last_start_max = is_inf
1173 : data->pos_min + data->pos_delta
1174 - CHR_SVLEN(last_str);
1176 data->longest = &(data->longest_float);
1178 SvREFCNT_dec(last_str);
1180 if (data && (fl & SF_HAS_EVAL))
1181 data->flags |= SF_HAS_EVAL;
1182 optimize_curly_tail:
1183 if (OP(oscan) != CURLYX) {
1184 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1186 NEXT_OFF(oscan) += NEXT_OFF(next);
1189 default: /* REF and CLUMP only? */
1190 if (flags & SCF_DO_SUBSTR) {
1191 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1192 data->longest = &(data->longest_float);
1194 is_inf = is_inf_internal = 1;
1195 if (flags & SCF_DO_STCLASS_OR)
1196 cl_anything(pRExC_state, data->start_class);
1197 flags &= ~SCF_DO_STCLASS;
1201 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
1204 if (flags & SCF_DO_SUBSTR) {
1205 scan_commit(pRExC_state,data);
1209 if (flags & SCF_DO_STCLASS) {
1210 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1212 /* Some of the logic below assumes that switching
1213 locale on will only add false positives. */
1214 switch (PL_regkind[(U8)OP(scan)]) {
1231 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1232 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1233 cl_anything(pRExC_state, data->start_class);
1236 if (OP(scan) == SANY)
1238 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1239 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1240 || (data->start_class->flags & ANYOF_CLASS));
1241 cl_anything(pRExC_state, data->start_class);
1243 if (flags & SCF_DO_STCLASS_AND || !value)
1244 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1247 if (flags & SCF_DO_STCLASS_AND)
1248 cl_and(data->start_class,
1249 (struct regnode_charclass_class*)scan);
1251 cl_or(pRExC_state, data->start_class,
1252 (struct regnode_charclass_class*)scan);
1255 if (flags & SCF_DO_STCLASS_AND) {
1256 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1257 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1258 for (value = 0; value < 256; value++)
1259 if (!isALNUM(value))
1260 ANYOF_BITMAP_CLEAR(data->start_class, value);
1264 if (data->start_class->flags & ANYOF_LOCALE)
1265 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1267 for (value = 0; value < 256; value++)
1269 ANYOF_BITMAP_SET(data->start_class, value);
1274 if (flags & SCF_DO_STCLASS_AND) {
1275 if (data->start_class->flags & ANYOF_LOCALE)
1276 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1279 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1280 data->start_class->flags |= ANYOF_LOCALE;
1284 if (flags & SCF_DO_STCLASS_AND) {
1285 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1286 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1287 for (value = 0; value < 256; value++)
1289 ANYOF_BITMAP_CLEAR(data->start_class, value);
1293 if (data->start_class->flags & ANYOF_LOCALE)
1294 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1296 for (value = 0; value < 256; value++)
1297 if (!isALNUM(value))
1298 ANYOF_BITMAP_SET(data->start_class, value);
1303 if (flags & SCF_DO_STCLASS_AND) {
1304 if (data->start_class->flags & ANYOF_LOCALE)
1305 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1308 data->start_class->flags |= ANYOF_LOCALE;
1309 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1313 if (flags & SCF_DO_STCLASS_AND) {
1314 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1315 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1316 for (value = 0; value < 256; value++)
1317 if (!isSPACE(value))
1318 ANYOF_BITMAP_CLEAR(data->start_class, value);
1322 if (data->start_class->flags & ANYOF_LOCALE)
1323 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1325 for (value = 0; value < 256; value++)
1327 ANYOF_BITMAP_SET(data->start_class, value);
1332 if (flags & SCF_DO_STCLASS_AND) {
1333 if (data->start_class->flags & ANYOF_LOCALE)
1334 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1337 data->start_class->flags |= ANYOF_LOCALE;
1338 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1342 if (flags & SCF_DO_STCLASS_AND) {
1343 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1344 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1345 for (value = 0; value < 256; value++)
1347 ANYOF_BITMAP_CLEAR(data->start_class, value);
1351 if (data->start_class->flags & ANYOF_LOCALE)
1352 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1354 for (value = 0; value < 256; value++)
1355 if (!isSPACE(value))
1356 ANYOF_BITMAP_SET(data->start_class, value);
1361 if (flags & SCF_DO_STCLASS_AND) {
1362 if (data->start_class->flags & ANYOF_LOCALE) {
1363 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1364 for (value = 0; value < 256; value++)
1365 if (!isSPACE(value))
1366 ANYOF_BITMAP_CLEAR(data->start_class, value);
1370 data->start_class->flags |= ANYOF_LOCALE;
1371 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1375 if (flags & SCF_DO_STCLASS_AND) {
1376 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1377 for (value = 0; value < 256; value++)
1378 if (!isDIGIT(value))
1379 ANYOF_BITMAP_CLEAR(data->start_class, value);
1382 if (data->start_class->flags & ANYOF_LOCALE)
1383 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1385 for (value = 0; value < 256; value++)
1387 ANYOF_BITMAP_SET(data->start_class, value);
1392 if (flags & SCF_DO_STCLASS_AND) {
1393 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1394 for (value = 0; value < 256; value++)
1396 ANYOF_BITMAP_CLEAR(data->start_class, value);
1399 if (data->start_class->flags & ANYOF_LOCALE)
1400 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1402 for (value = 0; value < 256; value++)
1403 if (!isDIGIT(value))
1404 ANYOF_BITMAP_SET(data->start_class, value);
1409 if (flags & SCF_DO_STCLASS_OR)
1410 cl_and(data->start_class, &and_with);
1411 flags &= ~SCF_DO_STCLASS;
1414 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1415 data->flags |= (OP(scan) == MEOL
1419 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1420 /* Lookbehind, or need to calculate parens/evals/stclass: */
1421 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1422 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1423 /* Lookahead/lookbehind */
1424 I32 deltanext, minnext, fake = 0;
1426 struct regnode_charclass_class intrnl;
1429 data_fake.flags = 0;
1431 data_fake.whilem_c = data->whilem_c;
1432 data_fake.last_closep = data->last_closep;
1435 data_fake.last_closep = &fake;
1436 if ( flags & SCF_DO_STCLASS && !scan->flags
1437 && OP(scan) == IFMATCH ) { /* Lookahead */
1438 cl_init(pRExC_state, &intrnl);
1439 data_fake.start_class = &intrnl;
1440 f |= SCF_DO_STCLASS_AND;
1442 if (flags & SCF_WHILEM_VISITED_POS)
1443 f |= SCF_WHILEM_VISITED_POS;
1444 next = regnext(scan);
1445 nscan = NEXTOPER(NEXTOPER(scan));
1446 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1449 vFAIL("Variable length lookbehind not implemented");
1451 else if (minnext > U8_MAX) {
1452 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1454 scan->flags = minnext;
1456 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1458 if (data && (data_fake.flags & SF_HAS_EVAL))
1459 data->flags |= SF_HAS_EVAL;
1461 data->whilem_c = data_fake.whilem_c;
1462 if (f & SCF_DO_STCLASS_AND) {
1463 int was = (data->start_class->flags & ANYOF_EOS);
1465 cl_and(data->start_class, &intrnl);
1467 data->start_class->flags |= ANYOF_EOS;
1470 else if (OP(scan) == OPEN) {
1473 else if (OP(scan) == CLOSE) {
1474 if (ARG(scan) == is_par) {
1475 next = regnext(scan);
1477 if ( next && (OP(next) != WHILEM) && next < last)
1478 is_par = 0; /* Disable optimization */
1481 *(data->last_closep) = ARG(scan);
1483 else if (OP(scan) == EVAL) {
1485 data->flags |= SF_HAS_EVAL;
1487 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1488 if (flags & SCF_DO_SUBSTR) {
1489 scan_commit(pRExC_state,data);
1490 data->longest = &(data->longest_float);
1492 is_inf = is_inf_internal = 1;
1493 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1494 cl_anything(pRExC_state, data->start_class);
1495 flags &= ~SCF_DO_STCLASS;
1497 /* Else: zero-length, ignore. */
1498 scan = regnext(scan);
1503 *deltap = is_inf_internal ? I32_MAX : delta;
1504 if (flags & SCF_DO_SUBSTR && is_inf)
1505 data->pos_delta = I32_MAX - data->pos_min;
1506 if (is_par > U8_MAX)
1508 if (is_par && pars==1 && data) {
1509 data->flags |= SF_IN_PAR;
1510 data->flags &= ~SF_HAS_PAR;
1512 else if (pars && data) {
1513 data->flags |= SF_HAS_PAR;
1514 data->flags &= ~SF_IN_PAR;
1516 if (flags & SCF_DO_STCLASS_OR)
1517 cl_and(data->start_class, &and_with);
1522 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1525 if (RExC_rx->data) {
1526 Renewc(RExC_rx->data,
1527 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1528 char, struct reg_data);
1529 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1530 RExC_rx->data->count += n;
1533 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1534 char, struct reg_data);
1535 New(1208, RExC_rx->data->what, n, U8);
1536 RExC_rx->data->count = n;
1538 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1539 return RExC_rx->data->count - n;
1543 Perl_reginitcolors(pTHX)
1547 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1550 PL_colors[0] = s = savepv(s);
1552 s = strchr(s, '\t');
1558 PL_colors[i] = s = "";
1562 PL_colors[i++] = "";
1569 - pregcomp - compile a regular expression into internal code
1571 * We can't allocate space until we know how big the compiled form will be,
1572 * but we can't compile it (and thus know how big it is) until we've got a
1573 * place to put the code. So we cheat: we compile it twice, once with code
1574 * generation turned off and size counting turned on, and once "for real".
1575 * This also means that we don't allocate space until we are sure that the
1576 * thing really will compile successfully, and we never have to move the
1577 * code and thus invalidate pointers into it. (Note that it has to be in
1578 * one piece because free() must be able to free it all.) [NB: not true in perl]
1580 * Beware that the optimization-preparation code in here knows about some
1581 * of the structure of the compiled regexp. [I'll say.]
1584 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1595 RExC_state_t RExC_state;
1596 RExC_state_t *pRExC_state = &RExC_state;
1599 FAIL("NULL regexp argument");
1601 /* XXXX This looks very suspicious... */
1602 if (pm->op_pmdynflags & PMdf_UTF8) {
1603 PL_reg_flags |= RF_utf8;
1608 RExC_precomp = savepvn(exp, xend - exp);
1609 DEBUG_r(if (!PL_colorset) reginitcolors());
1610 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1611 PL_colors[4],PL_colors[5],PL_colors[0],
1612 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1613 RExC_flags16 = pm->op_pmflags;
1617 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1618 RExC_seen_evals = 0;
1621 /* First pass: determine size, legality. */
1627 RExC_emit = &PL_regdummy;
1628 RExC_whilem_seen = 0;
1629 #if 0 /* REGC() is (currently) a NOP at the first pass.
1630 * Clever compilers notice this and complain. --jhi */
1631 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1633 if (reg(pRExC_state, 0, &flags) == NULL) {
1634 Safefree(RExC_precomp);
1635 RExC_precomp = Nullch;
1638 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1640 /* Small enough for pointer-storage convention?
1641 If extralen==0, this means that we will not need long jumps. */
1642 if (RExC_size >= 0x10000L && RExC_extralen)
1643 RExC_size += RExC_extralen;
1646 if (RExC_whilem_seen > 15)
1647 RExC_whilem_seen = 15;
1649 /* Allocate space and initialize. */
1650 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1653 FAIL("Regexp out of space");
1656 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1657 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1660 r->prelen = xend - exp;
1661 r->precomp = RExC_precomp;
1663 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1664 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1666 r->substrs = 0; /* Useful during FAIL. */
1667 r->startp = 0; /* Useful during FAIL. */
1668 r->endp = 0; /* Useful during FAIL. */
1672 /* Second pass: emit code. */
1677 RExC_emit = r->program;
1678 /* Store the count of eval-groups for security checks: */
1679 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1680 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1682 if (reg(pRExC_state, 0, &flags) == NULL)
1685 /* Dig out information for optimizations. */
1686 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1687 pm->op_pmflags = RExC_flags16;
1689 r->reganch |= ROPT_UTF8;
1690 r->regstclass = NULL;
1691 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1692 r->reganch |= ROPT_NAUGHTY;
1693 scan = r->program + 1; /* First BRANCH. */
1695 /* XXXX To minimize changes to RE engine we always allocate
1696 3-units-long substrs field. */
1697 Newz(1004, r->substrs, 1, struct reg_substr_data);
1699 StructCopy(&zero_scan_data, &data, scan_data_t);
1700 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1701 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1703 STRLEN longest_float_length, longest_fixed_length;
1704 struct regnode_charclass_class ch_class;
1709 /* Skip introductions and multiplicators >= 1. */
1710 while ((OP(first) == OPEN && (sawopen = 1)) ||
1711 /* An OR of *one* alternative - should not happen now. */
1712 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1713 (OP(first) == PLUS) ||
1714 (OP(first) == MINMOD) ||
1715 /* An {n,m} with n>0 */
1716 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1717 if (OP(first) == PLUS)
1720 first += regarglen[(U8)OP(first)];
1721 first = NEXTOPER(first);
1724 /* Starting-point info. */
1726 if (PL_regkind[(U8)OP(first)] == EXACT) {
1727 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
1728 else if ((OP(first) == EXACTF || OP(first) == EXACTFL)
1730 r->regstclass = first;
1732 else if (strchr((char*)PL_simple,OP(first)))
1733 r->regstclass = first;
1734 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1735 PL_regkind[(U8)OP(first)] == NBOUND)
1736 r->regstclass = first;
1737 else if (PL_regkind[(U8)OP(first)] == BOL) {
1738 r->reganch |= (OP(first) == MBOL
1740 : (OP(first) == SBOL
1743 first = NEXTOPER(first);
1746 else if (OP(first) == GPOS) {
1747 r->reganch |= ROPT_ANCH_GPOS;
1748 first = NEXTOPER(first);
1751 else if ((OP(first) == STAR &&
1752 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1753 !(r->reganch & ROPT_ANCH) )
1755 /* turn .* into ^.* with an implied $*=1 */
1756 int type = OP(NEXTOPER(first));
1758 if (type == REG_ANY || type == ANYUTF8)
1759 type = ROPT_ANCH_MBOL;
1761 type = ROPT_ANCH_SBOL;
1763 r->reganch |= type | ROPT_IMPLICIT;
1764 first = NEXTOPER(first);
1767 if (sawplus && (!sawopen || !RExC_sawback)
1768 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1769 /* x+ must match at the 1st pos of run of x's */
1770 r->reganch |= ROPT_SKIP;
1772 /* Scan is after the zeroth branch, first is atomic matcher. */
1773 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1774 (IV)(first - scan + 1)));
1776 * If there's something expensive in the r.e., find the
1777 * longest literal string that must appear and make it the
1778 * regmust. Resolve ties in favor of later strings, since
1779 * the regstart check works with the beginning of the r.e.
1780 * and avoiding duplication strengthens checking. Not a
1781 * strong reason, but sufficient in the absence of others.
1782 * [Now we resolve ties in favor of the earlier string if
1783 * it happens that c_offset_min has been invalidated, since the
1784 * earlier string may buy us something the later one won't.]
1788 data.longest_fixed = newSVpvn("",0);
1789 data.longest_float = newSVpvn("",0);
1790 data.last_found = newSVpvn("",0);
1791 data.longest = &(data.longest_fixed);
1793 if (!r->regstclass) {
1794 cl_init(pRExC_state, &ch_class);
1795 data.start_class = &ch_class;
1796 stclass_flag = SCF_DO_STCLASS_AND;
1797 } else /* XXXX Check for BOUND? */
1799 data.last_closep = &last_close;
1801 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1802 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1803 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1804 && data.last_start_min == 0 && data.last_end > 0
1805 && !RExC_seen_zerolen
1806 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1807 r->reganch |= ROPT_CHECK_ALL;
1808 scan_commit(pRExC_state, &data);
1809 SvREFCNT_dec(data.last_found);
1811 longest_float_length = CHR_SVLEN(data.longest_float);
1812 if (longest_float_length
1813 || (data.flags & SF_FL_BEFORE_EOL
1814 && (!(data.flags & SF_FL_BEFORE_MEOL)
1815 || (RExC_flags16 & PMf_MULTILINE)))) {
1818 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1819 && data.offset_fixed == data.offset_float_min
1820 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1821 goto remove_float; /* As in (a)+. */
1823 r->float_substr = data.longest_float;
1824 r->float_min_offset = data.offset_float_min;
1825 r->float_max_offset = data.offset_float_max;
1826 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1827 && (!(data.flags & SF_FL_BEFORE_MEOL)
1828 || (RExC_flags16 & PMf_MULTILINE)));
1829 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1833 r->float_substr = Nullsv;
1834 SvREFCNT_dec(data.longest_float);
1835 longest_float_length = 0;
1838 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1839 if (longest_fixed_length
1840 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1841 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1842 || (RExC_flags16 & PMf_MULTILINE)))) {
1845 r->anchored_substr = data.longest_fixed;
1846 r->anchored_offset = data.offset_fixed;
1847 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1848 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1849 || (RExC_flags16 & PMf_MULTILINE)));
1850 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1853 r->anchored_substr = Nullsv;
1854 SvREFCNT_dec(data.longest_fixed);
1855 longest_fixed_length = 0;
1858 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8
1859 || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY))
1860 r->regstclass = NULL;
1861 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1862 && !(data.start_class->flags & ANYOF_EOS)
1863 && !cl_is_anything(data.start_class)) {
1865 I32 n = add_data(pRExC_state, 1, "f");
1867 New(1006, RExC_rx->data->data[n], 1,
1868 struct regnode_charclass_class);
1869 StructCopy(data.start_class,
1870 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1871 struct regnode_charclass_class);
1872 r->regstclass = (regnode*)RExC_rx->data->data[n];
1873 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1874 DEBUG_r((sv = sv_newmortal(),
1875 regprop(sv, (regnode*)data.start_class),
1876 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1880 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1881 if (longest_fixed_length > longest_float_length) {
1882 r->check_substr = r->anchored_substr;
1883 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1884 if (r->reganch & ROPT_ANCH_SINGLE)
1885 r->reganch |= ROPT_NOSCAN;
1888 r->check_substr = r->float_substr;
1889 r->check_offset_min = data.offset_float_min;
1890 r->check_offset_max = data.offset_float_max;
1892 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1893 This should be changed ASAP! */
1894 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1895 r->reganch |= RE_USE_INTUIT;
1896 if (SvTAIL(r->check_substr))
1897 r->reganch |= RE_INTUIT_TAIL;
1901 /* Several toplevels. Best we can is to set minlen. */
1903 struct regnode_charclass_class ch_class;
1906 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1907 scan = r->program + 1;
1908 cl_init(pRExC_state, &ch_class);
1909 data.start_class = &ch_class;
1910 data.last_closep = &last_close;
1911 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1912 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1913 if (!(data.start_class->flags & ANYOF_EOS)
1914 && !cl_is_anything(data.start_class)) {
1916 I32 n = add_data(pRExC_state, 1, "f");
1918 New(1006, RExC_rx->data->data[n], 1,
1919 struct regnode_charclass_class);
1920 StructCopy(data.start_class,
1921 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1922 struct regnode_charclass_class);
1923 r->regstclass = (regnode*)RExC_rx->data->data[n];
1924 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1925 DEBUG_r((sv = sv_newmortal(),
1926 regprop(sv, (regnode*)data.start_class),
1927 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1933 if (RExC_seen & REG_SEEN_GPOS)
1934 r->reganch |= ROPT_GPOS_SEEN;
1935 if (RExC_seen & REG_SEEN_LOOKBEHIND)
1936 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1937 if (RExC_seen & REG_SEEN_EVAL)
1938 r->reganch |= ROPT_EVAL_SEEN;
1939 Newz(1002, r->startp, RExC_npar, I32);
1940 Newz(1002, r->endp, RExC_npar, I32);
1941 DEBUG_r(regdump(r));
1946 - reg - regular expression, i.e. main body or parenthesized thing
1948 * Caller must absorb opening parenthesis.
1950 * Combining parenthesis handling with the base level of regular expression
1951 * is a trifle forced, but the need to tie the tails of the branches to what
1952 * follows makes it hard to avoid.
1955 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
1956 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1959 register regnode *ret; /* Will be the head of the group. */
1960 register regnode *br;
1961 register regnode *lastbr;
1962 register regnode *ender = 0;
1963 register I32 parno = 0;
1964 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
1965 char *oregcomp_parse = RExC_parse;
1968 *flagp = 0; /* Tentatively. */
1970 /* Make an OPEN node, if parenthesized. */
1972 if (*RExC_parse == '?') {
1973 U16 posflags = 0, negflags = 0;
1974 U16 *flagsp = &posflags;
1976 char *seqstart = RExC_parse;
1979 paren = *RExC_parse++;
1980 ret = NULL; /* For look-ahead/behind. */
1983 RExC_seen |= REG_SEEN_LOOKBEHIND;
1984 if (*RExC_parse == '!')
1986 if (*RExC_parse != '=' && *RExC_parse != '!')
1991 RExC_seen_zerolen++;
1997 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2000 while (*RExC_parse && *RExC_parse != ')')
2002 if (*RExC_parse != ')')
2003 FAIL("Sequence (?#... not terminated");
2004 nextchar(pRExC_state);
2009 vWARN(RExC_parse, "(?p{}) is deprecated - use (??{})");
2013 paren = *RExC_parse++;
2018 I32 count = 1, n = 0;
2020 char *s = RExC_parse;
2022 OP_4tree *sop, *rop;
2024 RExC_seen_zerolen++;
2025 RExC_seen |= REG_SEEN_EVAL;
2026 while (count && (c = *RExC_parse)) {
2027 if (c == '\\' && RExC_parse[1])
2035 if (*RExC_parse != ')')
2038 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2043 if (RExC_parse - 1 - s)
2044 sv = newSVpvn(s, RExC_parse - 1 - s);
2046 sv = newSVpvn("", 0);
2049 Perl_save_re_context(aTHX);
2050 rop = sv_compile_2op(sv, &sop, "re", &av);
2053 n = add_data(pRExC_state, 3, "nop");
2054 RExC_rx->data->data[n] = (void*)rop;
2055 RExC_rx->data->data[n+1] = (void*)sop;
2056 RExC_rx->data->data[n+2] = (void*)av;
2059 else { /* First pass */
2060 if (PL_reginterp_cnt < ++RExC_seen_evals
2061 && PL_curcop != &PL_compiling)
2062 /* No compiled RE interpolated, has runtime
2063 components ===> unsafe. */
2064 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2066 FAIL("Eval-group in insecure regular expression");
2069 nextchar(pRExC_state);
2071 ret = reg_node(pRExC_state, LOGICAL);
2074 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2077 return reganode(pRExC_state, EVAL, n);
2081 if (RExC_parse[0] == '?') {
2082 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2083 || RExC_parse[1] == '<'
2084 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2087 ret = reg_node(pRExC_state, LOGICAL);
2090 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2094 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2095 parno = atoi(RExC_parse++);
2097 while (isDIGIT(*RExC_parse))
2099 ret = reganode(pRExC_state, GROUPP, parno);
2100 if ((c = *nextchar(pRExC_state)) != ')')
2101 vFAIL("Switch condition not recognized");
2103 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2104 br = regbranch(pRExC_state, &flags, 1);
2106 br = reganode(pRExC_state, LONGJMP, 0);
2108 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2109 c = *nextchar(pRExC_state);
2113 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2114 regbranch(pRExC_state, &flags, 1);
2115 regtail(pRExC_state, ret, lastbr);
2118 c = *nextchar(pRExC_state);
2123 vFAIL("Switch (?(condition)... contains too many branches");
2124 ender = reg_node(pRExC_state, TAIL);
2125 regtail(pRExC_state, br, ender);
2127 regtail(pRExC_state, lastbr, ender);
2128 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2131 regtail(pRExC_state, ret, ender);
2135 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2139 RExC_parse--; /* for vFAIL to print correctly */
2140 vFAIL("Sequence (? incomplete");
2145 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2146 if (*RExC_parse != 'o')
2147 pmflag(flagsp, *RExC_parse);
2150 if (*RExC_parse == '-') {
2155 RExC_flags16 |= posflags;
2156 RExC_flags16 &= ~negflags;
2157 if (*RExC_parse == ':') {
2163 if (*RExC_parse != ')') {
2165 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2167 nextchar(pRExC_state);
2175 ret = reganode(pRExC_state, OPEN, parno);
2182 /* Pick up the branches, linking them together. */
2183 br = regbranch(pRExC_state, &flags, 1);
2186 if (*RExC_parse == '|') {
2187 if (!SIZE_ONLY && RExC_extralen) {
2188 reginsert(pRExC_state, BRANCHJ, br);
2191 reginsert(pRExC_state, BRANCH, br);
2194 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2196 else if (paren == ':') {
2197 *flagp |= flags&SIMPLE;
2199 if (open) { /* Starts with OPEN. */
2200 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2202 else if (paren != '?') /* Not Conditional */
2206 *flagp |= flags&SPSTART;
2208 while (*RExC_parse == '|') {
2209 if (!SIZE_ONLY && RExC_extralen) {
2210 ender = reganode(pRExC_state, LONGJMP,0);
2211 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2214 RExC_extralen += 2; /* Account for LONGJMP. */
2215 nextchar(pRExC_state);
2216 br = regbranch(pRExC_state, &flags, 0);
2219 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2223 *flagp |= flags&SPSTART;
2226 if (have_branch || paren != ':') {
2227 /* Make a closing node, and hook it on the end. */
2230 ender = reg_node(pRExC_state, TAIL);
2233 ender = reganode(pRExC_state, CLOSE, parno);
2239 *flagp &= ~HASWIDTH;
2242 ender = reg_node(pRExC_state, SUCCEED);
2245 ender = reg_node(pRExC_state, END);
2248 regtail(pRExC_state, lastbr, ender);
2251 /* Hook the tails of the branches to the closing node. */
2252 for (br = ret; br != NULL; br = regnext(br)) {
2253 regoptail(pRExC_state, br, ender);
2260 static char parens[] = "=!<,>";
2262 if (paren && (p = strchr(parens, paren))) {
2263 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2264 int flag = (p - parens) > 1;
2267 node = SUSPEND, flag = 0;
2268 reginsert(pRExC_state, node,ret);
2270 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2274 /* Check for proper termination. */
2276 RExC_flags16 = oregflags;
2277 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2278 RExC_parse = oregcomp_parse;
2279 vFAIL("Unmatched (");
2282 else if (!paren && RExC_parse < RExC_end) {
2283 if (*RExC_parse == ')') {
2285 vFAIL("Unmatched )");
2288 FAIL("Junk on end of regexp"); /* "Can't happen". */
2296 - regbranch - one alternative of an | operator
2298 * Implements the concatenation operator.
2301 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2304 register regnode *ret;
2305 register regnode *chain = NULL;
2306 register regnode *latest;
2307 I32 flags = 0, c = 0;
2312 if (!SIZE_ONLY && RExC_extralen)
2313 ret = reganode(pRExC_state, BRANCHJ,0);
2315 ret = reg_node(pRExC_state, BRANCH);
2318 if (!first && SIZE_ONLY)
2319 RExC_extralen += 1; /* BRANCHJ */
2321 *flagp = WORST; /* Tentatively. */
2324 nextchar(pRExC_state);
2325 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2327 latest = regpiece(pRExC_state, &flags);
2328 if (latest == NULL) {
2329 if (flags & TRYAGAIN)
2333 else if (ret == NULL)
2335 *flagp |= flags&HASWIDTH;
2336 if (chain == NULL) /* First piece. */
2337 *flagp |= flags&SPSTART;
2340 regtail(pRExC_state, chain, latest);
2345 if (chain == NULL) { /* Loop ran zero times. */
2346 chain = reg_node(pRExC_state, NOTHING);
2351 *flagp |= flags&SIMPLE;
2358 - regpiece - something followed by possible [*+?]
2360 * Note that the branching code sequences used for ? and the general cases
2361 * of * and + are somewhat optimized: they use the same NOTHING node as
2362 * both the endmarker for their branch list and the body of the last branch.
2363 * It might seem that this node could be dispensed with entirely, but the
2364 * endmarker role is not redundant.
2367 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2370 register regnode *ret;
2372 register char *next;
2374 char *origparse = RExC_parse;
2377 I32 max = REG_INFTY;
2379 ret = regatom(pRExC_state, &flags);
2381 if (flags & TRYAGAIN)
2388 if (op == '{' && regcurly(RExC_parse)) {
2389 next = RExC_parse + 1;
2391 while (isDIGIT(*next) || *next == ',') {
2400 if (*next == '}') { /* got one */
2404 min = atoi(RExC_parse);
2408 maxpos = RExC_parse;
2410 if (!max && *maxpos != '0')
2411 max = REG_INFTY; /* meaning "infinity" */
2412 else if (max >= REG_INFTY)
2413 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2415 nextchar(pRExC_state);
2418 if ((flags&SIMPLE)) {
2419 RExC_naughty += 2 + RExC_naughty / 2;
2420 reginsert(pRExC_state, CURLY, ret);
2423 regnode *w = reg_node(pRExC_state, WHILEM);
2426 regtail(pRExC_state, ret, w);
2427 if (!SIZE_ONLY && RExC_extralen) {
2428 reginsert(pRExC_state, LONGJMP,ret);
2429 reginsert(pRExC_state, NOTHING,ret);
2430 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2432 reginsert(pRExC_state, CURLYX,ret);
2433 if (!SIZE_ONLY && RExC_extralen)
2434 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2435 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2437 RExC_whilem_seen++, RExC_extralen += 3;
2438 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2446 if (max && max < min)
2447 vFAIL("Can't do {n,m} with n > m");
2462 #if 0 /* Now runtime fix should be reliable. */
2464 /* if this is reinstated, don't forget to put this back into perldiag:
2466 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2468 (F) The part of the regexp subject to either the * or + quantifier
2469 could match an empty string. The {#} shows in the regular
2470 expression about where the problem was discovered.
2474 if (!(flags&HASWIDTH) && op != '?')
2475 vFAIL("Regexp *+ operand could be empty");
2478 nextchar(pRExC_state);
2480 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2482 if (op == '*' && (flags&SIMPLE)) {
2483 reginsert(pRExC_state, STAR, ret);
2487 else if (op == '*') {
2491 else if (op == '+' && (flags&SIMPLE)) {
2492 reginsert(pRExC_state, PLUS, ret);
2496 else if (op == '+') {
2500 else if (op == '?') {
2505 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2507 "%.*s matches null string many times",
2508 RExC_parse - origparse,
2512 if (*RExC_parse == '?') {
2513 nextchar(pRExC_state);
2514 reginsert(pRExC_state, MINMOD, ret);
2515 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2517 if (ISMULT2(RExC_parse)) {
2519 vFAIL("Nested quantifiers");
2526 - regatom - the lowest level
2528 * Optimization: gobbles an entire sequence of ordinary characters so that
2529 * it can turn them into a single node, which is smaller to store and
2530 * faster to run. Backslashed characters are exceptions, each becoming a
2531 * separate node; the code is simpler that way and it's not worth fixing.
2533 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2535 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2538 register regnode *ret = 0;
2541 *flagp = WORST; /* Tentatively. */
2544 switch (*RExC_parse) {
2546 RExC_seen_zerolen++;
2547 nextchar(pRExC_state);
2548 if (RExC_flags16 & PMf_MULTILINE)
2549 ret = reg_node(pRExC_state, MBOL);
2550 else if (RExC_flags16 & PMf_SINGLELINE)
2551 ret = reg_node(pRExC_state, SBOL);
2553 ret = reg_node(pRExC_state, BOL);
2556 nextchar(pRExC_state);
2558 RExC_seen_zerolen++;
2559 if (RExC_flags16 & PMf_MULTILINE)
2560 ret = reg_node(pRExC_state, MEOL);
2561 else if (RExC_flags16 & PMf_SINGLELINE)
2562 ret = reg_node(pRExC_state, SEOL);
2564 ret = reg_node(pRExC_state, EOL);
2567 nextchar(pRExC_state);
2569 if (RExC_flags16 & PMf_SINGLELINE)
2570 ret = reg_node(pRExC_state, SANYUTF8);
2572 ret = reg_node(pRExC_state, ANYUTF8);
2576 if (RExC_flags16 & PMf_SINGLELINE)
2577 ret = reg_node(pRExC_state, SANY);
2579 ret = reg_node(pRExC_state, REG_ANY);
2580 *flagp |= HASWIDTH|SIMPLE;
2586 char *oregcomp_parse = ++RExC_parse;
2587 ret = (UTF ? regclassutf8(pRExC_state) : regclass(pRExC_state));
2588 if (*RExC_parse != ']') {
2589 RExC_parse = oregcomp_parse;
2590 vFAIL("Unmatched [");
2592 nextchar(pRExC_state);
2593 *flagp |= HASWIDTH|SIMPLE;
2597 nextchar(pRExC_state);
2598 ret = reg(pRExC_state, 1, &flags);
2600 if (flags & TRYAGAIN) {
2601 if (RExC_parse == RExC_end) {
2602 /* Make parent create an empty node if needed. */
2610 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2614 if (flags & TRYAGAIN) {
2618 vFAIL("Internal urp");
2619 /* Supposed to be caught earlier. */
2622 if (!regcurly(RExC_parse)) {
2631 vFAIL("Quantifier follows nothing");
2634 switch (*++RExC_parse) {
2636 RExC_seen_zerolen++;
2637 ret = reg_node(pRExC_state, SBOL);
2639 nextchar(pRExC_state);
2642 ret = reg_node(pRExC_state, GPOS);
2643 RExC_seen |= REG_SEEN_GPOS;
2645 nextchar(pRExC_state);
2648 ret = reg_node(pRExC_state, SEOL);
2650 nextchar(pRExC_state);
2653 ret = reg_node(pRExC_state, EOS);
2655 RExC_seen_zerolen++; /* Do not optimize RE away */
2656 nextchar(pRExC_state);
2659 ret = reg_node(pRExC_state, SANY);
2660 *flagp |= HASWIDTH|SIMPLE;
2661 nextchar(pRExC_state);
2664 ret = reg_node(pRExC_state, CLUMP);
2666 nextchar(pRExC_state);
2667 if (UTF && !PL_utf8_mark)
2668 is_utf8_mark((U8*)"~"); /* preload table */
2671 ret = reg_node(pRExC_state,
2673 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
2674 : (LOC ? ALNUML : ALNUM));
2675 *flagp |= HASWIDTH|SIMPLE;
2676 nextchar(pRExC_state);
2677 if (UTF && !PL_utf8_alnum)
2678 is_utf8_alnum((U8*)"a"); /* preload table */
2681 ret = reg_node(pRExC_state,
2683 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
2684 : (LOC ? NALNUML : NALNUM));
2685 *flagp |= HASWIDTH|SIMPLE;
2686 nextchar(pRExC_state);
2687 if (UTF && !PL_utf8_alnum)
2688 is_utf8_alnum((U8*)"a"); /* preload table */
2691 RExC_seen_zerolen++;
2692 RExC_seen |= REG_SEEN_LOOKBEHIND;
2693 ret = reg_node(pRExC_state,
2695 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
2696 : (LOC ? BOUNDL : BOUND));
2698 nextchar(pRExC_state);
2699 if (UTF && !PL_utf8_alnum)
2700 is_utf8_alnum((U8*)"a"); /* preload table */
2703 RExC_seen_zerolen++;
2704 RExC_seen |= REG_SEEN_LOOKBEHIND;
2705 ret = reg_node(pRExC_state,
2707 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
2708 : (LOC ? NBOUNDL : NBOUND));
2710 nextchar(pRExC_state);
2711 if (UTF && !PL_utf8_alnum)
2712 is_utf8_alnum((U8*)"a"); /* preload table */
2715 ret = reg_node(pRExC_state,
2717 ? (LOC ? SPACELUTF8 : SPACEUTF8)
2718 : (LOC ? SPACEL : SPACE));
2719 *flagp |= HASWIDTH|SIMPLE;
2720 nextchar(pRExC_state);
2721 if (UTF && !PL_utf8_space)
2722 is_utf8_space((U8*)" "); /* preload table */
2725 ret = reg_node(pRExC_state,
2727 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
2728 : (LOC ? NSPACEL : NSPACE));
2729 *flagp |= HASWIDTH|SIMPLE;
2730 nextchar(pRExC_state);
2731 if (UTF && !PL_utf8_space)
2732 is_utf8_space((U8*)" "); /* preload table */
2735 ret = reg_node(pRExC_state, UTF ? DIGITUTF8 : DIGIT);
2736 *flagp |= HASWIDTH|SIMPLE;
2737 nextchar(pRExC_state);
2738 if (UTF && !PL_utf8_digit)
2739 is_utf8_digit((U8*)"1"); /* preload table */
2742 ret = reg_node(pRExC_state, UTF ? NDIGITUTF8 : NDIGIT);
2743 *flagp |= HASWIDTH|SIMPLE;
2744 nextchar(pRExC_state);
2745 if (UTF && !PL_utf8_digit)
2746 is_utf8_digit((U8*)"1"); /* preload table */
2750 { /* a lovely hack--pretend we saw [\pX] instead */
2751 char* oldregxend = RExC_end;
2753 if (RExC_parse[1] == '{') {
2754 RExC_end = strchr(RExC_parse, '}');
2757 RExC_end = oldregxend;
2758 vFAIL("Missing right brace on \\p{}");
2763 RExC_end = RExC_parse + 2;
2766 ret = regclassutf8(pRExC_state);
2768 RExC_end = oldregxend;
2770 nextchar(pRExC_state);
2771 *flagp |= HASWIDTH|SIMPLE;
2784 case '1': case '2': case '3': case '4':
2785 case '5': case '6': case '7': case '8': case '9':
2787 I32 num = atoi(RExC_parse);
2789 if (num > 9 && num >= RExC_npar)
2792 while (isDIGIT(*RExC_parse))
2795 if (!SIZE_ONLY && num > RExC_rx->nparens)
2796 vFAIL("Reference to nonexistent group");
2798 ret = reganode(pRExC_state, FOLD
2799 ? (LOC ? REFFL : REFF)
2803 nextchar(pRExC_state);
2808 if (RExC_parse >= RExC_end)
2809 FAIL("Trailing \\");
2812 /* Do not generate `unrecognized' warnings here, we fall
2813 back into the quick-grab loop below */
2819 if (RExC_flags16 & PMf_EXTENDED) {
2820 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2821 if (RExC_parse < RExC_end)
2827 register STRLEN len;
2836 ret = reg_node(pRExC_state, FOLD
2837 ? (LOC ? EXACTFL : EXACTF)
2840 for (len = 0, p = RExC_parse - 1;
2841 len < 127 && p < RExC_end;
2846 if (RExC_flags16 & PMf_EXTENDED)
2847 p = regwhite(p, RExC_end);
2909 char* e = strchr(p, '}');
2913 vFAIL("Missing right brace on \\x{}");
2916 numlen = 1; /* allow underscores */
2917 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2918 /* numlen is generous */
2919 if (numlen + len >= 127) {
2928 vFAIL("Can't use \\x{} without 'use utf8' declaration");
2933 numlen = 0; /* disallow underscores */
2934 ender = (UV)scan_hex(p, 2, &numlen);
2940 ender = UCHARAT(p++);
2941 ender = toCTRL(ender);
2943 case '0': case '1': case '2': case '3':case '4':
2944 case '5': case '6': case '7': case '8':case '9':
2946 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
2947 numlen = 0; /* disallow underscores */
2948 ender = (UV)scan_oct(p, 3, &numlen);
2958 FAIL("Trailing \\");
2961 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2962 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
2963 goto normal_default;
2968 if ((*p & 0xc0) == 0xc0 && UTF) {
2969 ender = utf8_to_uv((U8*)p, RExC_end - p,
2977 if (RExC_flags16 & PMf_EXTENDED)
2978 p = regwhite(p, RExC_end);
2981 ender = toLOWER_LC_uni(ender);
2983 ender = toLOWER_uni(ender);
2985 if (ISMULT2(p)) { /* Back off on ?+*. */
2988 else if (ender >= 0x80 && UTF) {
2989 reguni(pRExC_state, ender, s, &numlen);
2999 if (ender >= 0x80 && UTF) {
3000 reguni(pRExC_state, ender, s, &numlen);
3009 nextchar(pRExC_state);
3011 /* len is STRLEN which is unsigned, need to copy to signed */
3014 vFAIL("Internal disaster");
3023 RExC_size += STR_SZ(len);
3025 RExC_emit += STR_SZ(len);
3034 S_regwhite(pTHX_ char *p, char *e)
3039 else if (*p == '#') {
3042 } while (p < e && *p != '\n');
3050 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3051 Character classes ([:foo:]) can also be negated ([:^foo:]).
3052 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3053 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3054 but trigger warnings because they are currently unimplemented. */
3056 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3060 I32 namedclass = OOB_NAMEDCLASS;
3062 if (value == '[' && RExC_parse + 1 < RExC_end &&
3063 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3064 (*RExC_parse == ':' ||
3065 *RExC_parse == '=' ||
3066 *RExC_parse == '.')) {
3067 char c = *RExC_parse;
3068 char* s = RExC_parse++;
3070 while (RExC_parse < RExC_end && *RExC_parse != c)
3072 if (RExC_parse == RExC_end)
3073 /* Grandfather lone [:, [=, [. */
3076 char* t = RExC_parse++; /* skip over the c */
3078 if (*RExC_parse == ']') {
3079 RExC_parse++; /* skip over the ending ] */
3082 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3083 I32 skip = 5; /* the most common skip */
3087 if (strnEQ(posixcc, "alnum", 5))
3089 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3090 else if (strnEQ(posixcc, "alpha", 5))
3092 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3093 else if (strnEQ(posixcc, "ascii", 5))
3095 complement ? ANYOF_NASCII : ANYOF_ASCII;
3098 if (strnEQ(posixcc, "blank", 5))
3100 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3103 if (strnEQ(posixcc, "cntrl", 5))
3105 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3108 if (strnEQ(posixcc, "digit", 5))
3110 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3113 if (strnEQ(posixcc, "graph", 5))
3115 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3118 if (strnEQ(posixcc, "lower", 5))
3120 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3123 if (strnEQ(posixcc, "print", 5))
3125 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3126 else if (strnEQ(posixcc, "punct", 5))
3128 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3131 if (strnEQ(posixcc, "space", 5))
3133 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3136 if (strnEQ(posixcc, "upper", 5))
3138 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3140 case 'w': /* this is not POSIX, this is the Perl \w */
3141 if (strnEQ(posixcc, "word", 4)) {
3143 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3148 if (strnEQ(posixcc, "xdigit", 6)) {
3150 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3155 if (namedclass == OOB_NAMEDCLASS ||
3156 posixcc[skip] != ':' ||
3157 posixcc[skip+1] != ']')
3159 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3162 } else if (!SIZE_ONLY) {
3163 /* [[=foo=]] and [[.foo.]] are still future. */
3165 /* adjust RExC_parse so the warning shows after
3167 while (*RExC_parse && *RExC_parse != ']')
3169 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3172 /* Maternal grandfather:
3173 * "[:" ending in ":" but not in ":]" */
3183 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3185 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3186 (*RExC_parse == ':' ||
3187 *RExC_parse == '=' ||
3188 *RExC_parse == '.')) {
3189 char *s = RExC_parse;
3192 while(*s && isALNUM(*s))
3194 if (*s && c == *s && s[1] == ']') {
3195 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3197 /* [[=foo=]] and [[.foo.]] are still future. */
3198 if (c == '=' || c == '.')
3200 /* adjust RExC_parse so the error shows after
3202 while (*RExC_parse && *RExC_parse++ != ']')
3204 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3211 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3215 register I32 lastvalue = OOB_CHAR8;
3216 register I32 range = 0;
3217 register regnode *ret;
3221 bool need_class = 0;
3223 ret = reg_node(pRExC_state, ANYOF);
3225 RExC_size += ANYOF_SKIP;
3228 ANYOF_BITMAP_ZERO(ret);
3229 RExC_emit += ANYOF_SKIP;
3231 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3233 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3235 if (*RExC_parse == '^') { /* Complement of range. */
3239 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3242 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3243 checkposixcc(pRExC_state);
3245 if (*RExC_parse == ']' || *RExC_parse == '-')
3246 goto skipcond; /* allow 1st char to be ] or - */
3247 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3249 namedclass = OOB_NAMEDCLASS;
3251 rangebegin = RExC_parse;
3252 value = UCHARAT(RExC_parse++);
3254 namedclass = regpposixcc(pRExC_state, value);
3255 else if (value == '\\') {
3256 value = UCHARAT(RExC_parse++);
3257 /* Some compilers cannot handle switching on 64-bit integer
3258 * values, therefore the 'value' cannot be an UV. --jhi */
3260 case 'w': namedclass = ANYOF_ALNUM; break;
3261 case 'W': namedclass = ANYOF_NALNUM; break;
3262 case 's': namedclass = ANYOF_SPACE; break;
3263 case 'S': namedclass = ANYOF_NSPACE; break;
3264 case 'd': namedclass = ANYOF_DIGIT; break;
3265 case 'D': namedclass = ANYOF_NDIGIT; break;
3266 case 'n': value = '\n'; break;
3267 case 'r': value = '\r'; break;
3268 case 't': value = '\t'; break;
3269 case 'f': value = '\f'; break;
3270 case 'b': value = '\b'; break;
3272 case 'e': value = '\033'; break;
3273 case 'a': value = '\007'; break;
3275 case 'e': value = '\047'; break;
3276 case 'a': value = '\057'; break;
3279 numlen = 0; /* disallow underscores */
3280 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3281 RExC_parse += numlen;
3284 value = UCHARAT(RExC_parse++);
3285 value = toCTRL(value);
3287 case '0': case '1': case '2': case '3': case '4':
3288 case '5': case '6': case '7': case '8': case '9':
3289 numlen = 0; /* disallow underscores */
3290 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3291 RExC_parse += numlen;
3294 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3296 vWARN2(RExC_parse, "Unrecognized escape \\%c in character class passed through", (int)value);
3300 if (namedclass > OOB_NAMEDCLASS) {
3301 if (!need_class && !SIZE_ONLY)
3302 ANYOF_CLASS_ZERO(ret);
3304 if (range) { /* a-\d, a-[:digit:] */
3306 if (ckWARN(WARN_REGEXP))
3308 "False [] range \"%*.*s\"",
3309 RExC_parse - rangebegin,
3310 RExC_parse - rangebegin,
3312 ANYOF_BITMAP_SET(ret, lastvalue);
3313 ANYOF_BITMAP_SET(ret, '-');
3315 range = 0; /* this is not a true range */
3318 switch (namedclass) {
3321 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3323 for (value = 0; value < 256; value++)
3325 ANYOF_BITMAP_SET(ret, value);
3330 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3332 for (value = 0; value < 256; value++)
3333 if (!isALNUM(value))
3334 ANYOF_BITMAP_SET(ret, value);
3339 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3341 for (value = 0; value < 256; value++)
3343 ANYOF_BITMAP_SET(ret, value);
3348 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3350 for (value = 0; value < 256; value++)
3351 if (!isSPACE(value))
3352 ANYOF_BITMAP_SET(ret, value);
3357 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3359 for (value = '0'; value <= '9'; value++)
3360 ANYOF_BITMAP_SET(ret, value);
3365 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3367 for (value = 0; value < '0'; value++)
3368 ANYOF_BITMAP_SET(ret, value);
3369 for (value = '9' + 1; value < 256; value++)
3370 ANYOF_BITMAP_SET(ret, value);
3375 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3377 for (value = 0; value < 256; value++)
3378 if (!isALNUMC(value))
3379 ANYOF_BITMAP_SET(ret, value);
3384 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3386 for (value = 0; value < 256; value++)
3387 if (isALNUMC(value))
3388 ANYOF_BITMAP_SET(ret, value);
3393 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3395 for (value = 0; value < 256; value++)
3397 ANYOF_BITMAP_SET(ret, value);
3402 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3404 for (value = 0; value < 256; value++)
3405 if (!isALPHA(value))
3406 ANYOF_BITMAP_SET(ret, value);
3411 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3414 for (value = 0; value < 128; value++)
3415 ANYOF_BITMAP_SET(ret, value);
3417 for (value = 0; value < 256; value++)
3419 ANYOF_BITMAP_SET(ret, value);
3425 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3428 for (value = 128; value < 256; value++)
3429 ANYOF_BITMAP_SET(ret, value);
3431 for (value = 0; value < 256; value++)
3432 if (!isASCII(value))
3433 ANYOF_BITMAP_SET(ret, value);
3439 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3441 for (value = 0; value < 256; value++)
3443 ANYOF_BITMAP_SET(ret, value);
3448 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3450 for (value = 0; value < 256; value++)
3451 if (!isBLANK(value))
3452 ANYOF_BITMAP_SET(ret, value);
3457 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3459 for (value = 0; value < 256; value++)
3461 ANYOF_BITMAP_SET(ret, value);
3463 lastvalue = OOB_CHAR8;
3467 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3469 for (value = 0; value < 256; value++)
3470 if (!isCNTRL(value))
3471 ANYOF_BITMAP_SET(ret, value);
3476 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3478 for (value = 0; value < 256; value++)
3480 ANYOF_BITMAP_SET(ret, value);
3485 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3487 for (value = 0; value < 256; value++)
3488 if (!isGRAPH(value))
3489 ANYOF_BITMAP_SET(ret, value);
3494 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3496 for (value = 0; value < 256; value++)
3498 ANYOF_BITMAP_SET(ret, value);
3503 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3505 for (value = 0; value < 256; value++)
3506 if (!isLOWER(value))
3507 ANYOF_BITMAP_SET(ret, value);
3512 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3514 for (value = 0; value < 256; value++)
3516 ANYOF_BITMAP_SET(ret, value);
3521 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3523 for (value = 0; value < 256; value++)
3524 if (!isPRINT(value))
3525 ANYOF_BITMAP_SET(ret, value);
3530 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3532 for (value = 0; value < 256; value++)
3533 if (isPSXSPC(value))
3534 ANYOF_BITMAP_SET(ret, value);
3539 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3541 for (value = 0; value < 256; value++)
3542 if (!isPSXSPC(value))
3543 ANYOF_BITMAP_SET(ret, value);
3548 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3550 for (value = 0; value < 256; value++)
3552 ANYOF_BITMAP_SET(ret, value);
3557 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3559 for (value = 0; value < 256; value++)
3560 if (!isPUNCT(value))
3561 ANYOF_BITMAP_SET(ret, value);
3566 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3568 for (value = 0; value < 256; value++)
3570 ANYOF_BITMAP_SET(ret, value);
3575 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3577 for (value = 0; value < 256; value++)
3578 if (!isUPPER(value))
3579 ANYOF_BITMAP_SET(ret, value);
3584 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3586 for (value = 0; value < 256; value++)
3587 if (isXDIGIT(value))
3588 ANYOF_BITMAP_SET(ret, value);
3593 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3595 for (value = 0; value < 256; value++)
3596 if (!isXDIGIT(value))
3597 ANYOF_BITMAP_SET(ret, value);
3601 vFAIL("Invalid [::] class");
3605 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3610 if (lastvalue > value) /* b-a */ {
3611 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3612 RExC_parse - rangebegin,
3613 RExC_parse - rangebegin,
3620 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3621 RExC_parse[1] != ']') {
3623 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3624 if (ckWARN(WARN_REGEXP))
3626 "False [] range \"%*.*s\"",
3627 RExC_parse - rangebegin,
3628 RExC_parse - rangebegin,
3631 ANYOF_BITMAP_SET(ret, '-');
3634 continue; /* do it next time */
3637 /* now is the next time */
3639 #ifndef ASCIIish /* EBCDIC, for example. */
3640 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3641 (isUPPER(lastvalue) && isUPPER(value)))
3644 if (isLOWER(lastvalue)) {
3645 for (i = lastvalue; i <= value; i++)
3647 ANYOF_BITMAP_SET(ret, i);
3649 for (i = lastvalue; i <= value; i++)
3651 ANYOF_BITMAP_SET(ret, i);
3656 for ( ; lastvalue <= value; lastvalue++)
3657 ANYOF_BITMAP_SET(ret, lastvalue);
3663 RExC_size += ANYOF_CLASS_ADD_SKIP;
3665 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3667 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3669 (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
3670 for (value = 0; value < 256; ++value) {
3671 if (ANYOF_BITMAP_TEST(ret, value)) {
3672 I32 cf = PL_fold[value];
3673 ANYOF_BITMAP_SET(ret, cf);
3676 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3678 /* optimize inverted simple patterns (e.g. [^a-z]) */
3679 if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3680 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3681 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3682 ANYOF_FLAGS(ret) = 0;
3688 S_regclassutf8(pTHX_ RExC_state_t *pRExC_state)
3693 register U32 lastvalue = OOB_UTF8;
3694 register I32 range = 0;
3695 register regnode *ret;
3703 if (*RExC_parse == '^') { /* Complement of range. */
3707 flags |= ANYOF_INVERT;
3711 flags |= ANYOF_FOLD;
3713 flags |= ANYOF_LOCALE;
3714 listsv = newSVpvn("# comment\n",10);
3717 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3718 checkposixcc(pRExC_state);
3720 if (*RExC_parse == ']' || *RExC_parse == '-')
3721 goto skipcond; /* allow 1st char to be ] or - */
3723 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3725 namedclass = OOB_NAMEDCLASS;
3727 rangebegin = RExC_parse;
3728 value = utf8_to_uv((U8*)RExC_parse,
3729 RExC_end - RExC_parse,
3731 RExC_parse += numlen;
3733 namedclass = regpposixcc(pRExC_state, value);
3734 else if (value == '\\') {
3735 value = (U32)utf8_to_uv((U8*)RExC_parse,
3736 RExC_end - RExC_parse,
3738 RExC_parse += numlen;
3739 /* Some compilers cannot handle switching on 64-bit integer
3740 * values, therefore value cannot be an UV. Yes, this will
3741 * be a problem later if we want switch on Unicode. --jhi */
3743 case 'w': namedclass = ANYOF_ALNUM; break;
3744 case 'W': namedclass = ANYOF_NALNUM; break;
3745 case 's': namedclass = ANYOF_SPACE; break;
3746 case 'S': namedclass = ANYOF_NSPACE; break;
3747 case 'd': namedclass = ANYOF_DIGIT; break;
3748 case 'D': namedclass = ANYOF_NDIGIT; break;
3751 if (*RExC_parse == '{') {
3752 e = strchr(RExC_parse++, '}');
3754 vFAIL("Missing right brace on \\p{}");
3763 Perl_sv_catpvf(aTHX_ listsv,
3764 "+utf8::%.*s\n", (int)n, RExC_parse);
3766 Perl_sv_catpvf(aTHX_ listsv,
3767 "!utf8::%.*s\n", (int)n, RExC_parse);
3770 lastvalue = OOB_UTF8;
3772 case 'n': value = '\n'; break;
3773 case 'r': value = '\r'; break;
3774 case 't': value = '\t'; break;
3775 case 'f': value = '\f'; break;
3776 case 'b': value = '\b'; break;
3778 case 'e': value = '\033'; break;
3779 case 'a': value = '\007'; break;
3781 case 'e': value = '\047'; break;
3782 case 'a': value = '\057'; break;
3785 if (*RExC_parse == '{') {
3786 e = strchr(RExC_parse++, '}');
3788 vFAIL("Missing right brace on \\x{}");
3789 numlen = 1; /* allow underscores */
3790 value = (UV)scan_hex(RExC_parse,
3796 numlen = 0; /* disallow underscores */
3797 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3798 RExC_parse += numlen;
3802 value = UCHARAT(RExC_parse++);
3803 value = toCTRL(value);
3805 case '0': case '1': case '2': case '3': case '4':
3806 case '5': case '6': case '7': case '8': case '9':
3807 numlen = 0; /* disallow underscores */
3808 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3809 RExC_parse += numlen;
3812 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3814 "Unrecognized escape \\%c in character class passed through",
3819 if (namedclass > OOB_NAMEDCLASS) {
3820 if (range) { /* a-\d, a-[:digit:] */
3822 if (ckWARN(WARN_REGEXP))
3824 "False [] range \"%*.*s\"",
3825 RExC_parse - rangebegin,
3826 RExC_parse - rangebegin,
3828 Perl_sv_catpvf(aTHX_ listsv,
3829 /* 0x002D is Unicode for '-' */
3830 "%04"UVxf"\n002D\n", (UV)lastvalue);
3835 switch (namedclass) {
3837 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
3839 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
3841 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
3843 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
3845 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
3847 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
3849 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
3851 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
3853 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
3855 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
3857 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
3859 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
3861 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
3863 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
3865 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
3867 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
3869 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
3871 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
3873 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
3875 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
3879 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
3883 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
3885 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
3887 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
3889 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
3891 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
3897 if (lastvalue > value) { /* b-a */
3898 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3899 RExC_parse - rangebegin,
3900 RExC_parse - rangebegin,
3907 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3908 RExC_parse[1] != ']') {
3910 if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */
3911 if (ckWARN(WARN_REGEXP))
3913 "False [] range \"%*.*s\"",
3914 RExC_parse - rangebegin,
3915 RExC_parse - rangebegin,
3918 Perl_sv_catpvf(aTHX_ listsv,
3919 /* 0x002D is Unicode for '-' */
3923 continue; /* do it next time */
3926 /* now is the next time */
3928 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3929 (UV)lastvalue, (UV)value);
3933 ret = reganode(pRExC_state, ANYOFUTF8, 0);
3936 SV *rv = swash_init("utf8", "", listsv, 1, 0);
3937 SvREFCNT_dec(listsv);
3938 n = add_data(pRExC_state, 1,"s");
3939 RExC_rx->data->data[n] = (void*)rv;
3940 ARG1_SET(ret, flags);
3948 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3951 char* retval = RExC_parse++;
3954 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3955 RExC_parse[2] == '#') {
3956 while (*RExC_parse && *RExC_parse != ')')
3961 if (RExC_flags16 & PMf_EXTENDED) {
3962 if (isSPACE(*RExC_parse)) {
3966 else if (*RExC_parse == '#') {
3967 while (*RExC_parse && *RExC_parse != '\n')
3978 - reg_node - emit a node
3980 STATIC regnode * /* Location. */
3981 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3984 register regnode *ret;
3985 register regnode *ptr;
3989 SIZE_ALIGN(RExC_size);
3994 NODE_ALIGN_FILL(ret);
3996 FILL_ADVANCE_NODE(ptr, op);
4003 - reganode - emit a node with an argument
4005 STATIC regnode * /* Location. */
4006 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4009 register regnode *ret;
4010 register regnode *ptr;
4014 SIZE_ALIGN(RExC_size);
4019 NODE_ALIGN_FILL(ret);
4021 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
4028 - reguni - emit (if appropriate) a Unicode character
4031 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
4035 U8 tmpbuf[UTF8_MAXLEN];
4036 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
4039 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
4044 - reginsert - insert an operator in front of already-emitted operand
4046 * Means relocating the operand.
4049 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4052 register regnode *src;
4053 register regnode *dst;
4054 register regnode *place;
4055 register int offset = regarglen[(U8)op];
4057 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4060 RExC_size += NODE_STEP_REGNODE + offset;
4065 RExC_emit += NODE_STEP_REGNODE + offset;
4068 StructCopy(--src, --dst, regnode);
4070 place = opnd; /* Op node, where operand used to be. */
4071 src = NEXTOPER(place);
4072 FILL_ADVANCE_NODE(place, op);
4073 Zero(src, offset, regnode);
4077 - regtail - set the next-pointer at the end of a node chain of p to val.
4080 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4083 register regnode *scan;
4084 register regnode *temp;
4089 /* Find last node. */
4092 temp = regnext(scan);
4098 if (reg_off_by_arg[OP(scan)]) {
4099 ARG_SET(scan, val - scan);
4102 NEXT_OFF(scan) = val - scan;
4107 - regoptail - regtail on operand of first argument; nop if operandless
4110 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4113 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4114 if (p == NULL || SIZE_ONLY)
4116 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4117 regtail(pRExC_state, NEXTOPER(p), val);
4119 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4120 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4127 - regcurly - a little FSA that accepts {\d+,?\d*}
4130 S_regcurly(pTHX_ register char *s)
4149 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4152 register U8 op = EXACT; /* Arbitrary non-END op. */
4153 register regnode *next;
4155 while (op != END && (!last || node < last)) {
4156 /* While that wasn't END last time... */
4162 next = regnext(node);
4164 if (OP(node) == OPTIMIZED)
4167 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4168 (int)(2*l + 1), "", SvPVX(sv));
4169 if (next == NULL) /* Next ptr. */
4170 PerlIO_printf(Perl_debug_log, "(0)");
4172 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4173 (void)PerlIO_putc(Perl_debug_log, '\n');
4175 if (PL_regkind[(U8)op] == BRANCHJ) {
4176 register regnode *nnode = (OP(next) == LONGJMP
4179 if (last && nnode > last)
4181 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4183 else if (PL_regkind[(U8)op] == BRANCH) {
4184 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4186 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4187 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4188 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4190 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4191 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4194 else if ( op == PLUS || op == STAR) {
4195 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4197 else if (op == ANYOF) {
4198 node = NEXTOPER(node);
4201 else if (PL_regkind[(U8)op] == EXACT) {
4202 /* Literal string, where present. */
4203 node += NODE_SZ_STR(node) - 1;
4204 node = NEXTOPER(node);
4207 node = NEXTOPER(node);
4208 node += regarglen[(U8)op];
4210 if (op == CURLYX || op == OPEN)
4212 else if (op == WHILEM)
4215 #endif /* DEBUGGING */
4220 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4223 Perl_regdump(pTHX_ regexp *r)
4227 SV *sv = sv_newmortal();
4229 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4231 /* Header fields of interest. */
4232 if (r->anchored_substr)
4233 PerlIO_printf(Perl_debug_log,
4234 "anchored `%s%.*s%s'%s at %"IVdf" ",
4236 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4237 SvPVX(r->anchored_substr),
4239 SvTAIL(r->anchored_substr) ? "$" : "",
4240 (IV)r->anchored_offset);
4241 if (r->float_substr)
4242 PerlIO_printf(Perl_debug_log,
4243 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4245 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4246 SvPVX(r->float_substr),
4248 SvTAIL(r->float_substr) ? "$" : "",
4249 (IV)r->float_min_offset, (UV)r->float_max_offset);
4250 if (r->check_substr)
4251 PerlIO_printf(Perl_debug_log,
4252 r->check_substr == r->float_substr
4253 ? "(checking floating" : "(checking anchored");
4254 if (r->reganch & ROPT_NOSCAN)
4255 PerlIO_printf(Perl_debug_log, " noscan");
4256 if (r->reganch & ROPT_CHECK_ALL)
4257 PerlIO_printf(Perl_debug_log, " isall");
4258 if (r->check_substr)
4259 PerlIO_printf(Perl_debug_log, ") ");
4261 if (r->regstclass) {
4262 regprop(sv, r->regstclass);
4263 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4265 if (r->reganch & ROPT_ANCH) {
4266 PerlIO_printf(Perl_debug_log, "anchored");
4267 if (r->reganch & ROPT_ANCH_BOL)
4268 PerlIO_printf(Perl_debug_log, "(BOL)");
4269 if (r->reganch & ROPT_ANCH_MBOL)
4270 PerlIO_printf(Perl_debug_log, "(MBOL)");
4271 if (r->reganch & ROPT_ANCH_SBOL)
4272 PerlIO_printf(Perl_debug_log, "(SBOL)");
4273 if (r->reganch & ROPT_ANCH_GPOS)
4274 PerlIO_printf(Perl_debug_log, "(GPOS)");
4275 PerlIO_putc(Perl_debug_log, ' ');
4277 if (r->reganch & ROPT_GPOS_SEEN)
4278 PerlIO_printf(Perl_debug_log, "GPOS ");
4279 if (r->reganch & ROPT_SKIP)
4280 PerlIO_printf(Perl_debug_log, "plus ");
4281 if (r->reganch & ROPT_IMPLICIT)
4282 PerlIO_printf(Perl_debug_log, "implicit ");
4283 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4284 if (r->reganch & ROPT_EVAL_SEEN)
4285 PerlIO_printf(Perl_debug_log, "with eval ");
4286 PerlIO_printf(Perl_debug_log, "\n");
4287 #endif /* DEBUGGING */
4291 S_put_byte(pTHX_ SV *sv, int c)
4293 if (c <= ' ' || c == 127 || c == 255)
4294 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4295 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4296 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4298 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4302 - regprop - printable representation of opcode
4305 Perl_regprop(pTHX_ SV *sv, regnode *o)
4311 sv_setpvn(sv, "", 0);
4312 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4313 /* It would be nice to FAIL() here, but this may be called from
4314 regexec.c, and it would be hard to supply pRExC_state. */
4315 Perl_croak(aTHX_ "Corrupted regexp opcode");
4316 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4318 k = PL_regkind[(U8)OP(o)];
4321 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4322 STR_LEN(o), STRING(o), PL_colors[1]);
4323 else if (k == CURLY) {
4324 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4325 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4326 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4328 else if (k == WHILEM && o->flags) /* Ordinal/of */
4329 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4330 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4331 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4332 else if (k == LOGICAL)
4333 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4334 else if (k == ANYOF) {
4335 int i, rangestart = -1;
4336 const char * const out[] = { /* Should be syncronized with
4337 ANYOF_ #xdefines in regcomp.h */
4370 if (o->flags & ANYOF_LOCALE)
4371 sv_catpv(sv, "{loc}");
4372 if (o->flags & ANYOF_FOLD)
4373 sv_catpv(sv, "{i}");
4374 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4375 if (o->flags & ANYOF_INVERT)
4377 for (i = 0; i <= 256; i++) {
4378 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4379 if (rangestart == -1)
4381 } else if (rangestart != -1) {
4382 if (i <= rangestart + 3)
4383 for (; rangestart < i; rangestart++)
4384 put_byte(sv, rangestart);
4386 put_byte(sv, rangestart);
4388 put_byte(sv, i - 1);
4393 if (o->flags & ANYOF_CLASS)
4394 for (i = 0; i < sizeof(out)/sizeof(char*); i++)
4395 if (ANYOF_CLASS_TEST(o,i))
4396 sv_catpv(sv, out[i]);
4397 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4399 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4400 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4401 #endif /* DEBUGGING */
4405 Perl_re_intuit_string(pTHX_ regexp *prog)
4406 { /* Assume that RE_INTUIT is set */
4409 char *s = SvPV(prog->check_substr,n_a);
4411 if (!PL_colorset) reginitcolors();
4412 PerlIO_printf(Perl_debug_log,
4413 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4414 PL_colors[4],PL_colors[5],PL_colors[0],
4417 (strlen(s) > 60 ? "..." : ""));
4420 return prog->check_substr;
4424 Perl_pregfree(pTHX_ struct regexp *r)
4427 DEBUG_r(if (!PL_colorset) reginitcolors());
4429 if (!r || (--r->refcnt > 0))
4431 DEBUG_r(PerlIO_printf(Perl_debug_log,
4432 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4433 PL_colors[4],PL_colors[5],PL_colors[0],
4436 (strlen(r->precomp) > 60 ? "..." : "")));
4439 Safefree(r->precomp);
4440 if (RX_MATCH_COPIED(r))
4441 Safefree(r->subbeg);
4443 if (r->anchored_substr)
4444 SvREFCNT_dec(r->anchored_substr);
4445 if (r->float_substr)
4446 SvREFCNT_dec(r->float_substr);
4447 Safefree(r->substrs);
4450 int n = r->data->count;
4451 AV* new_comppad = NULL;
4456 switch (r->data->what[n]) {
4458 SvREFCNT_dec((SV*)r->data->data[n]);
4461 Safefree(r->data->data[n]);
4464 new_comppad = (AV*)r->data->data[n];
4467 if (new_comppad == NULL)
4468 Perl_croak(aTHX_ "panic: pregfree comppad");
4469 old_comppad = PL_comppad;
4470 old_curpad = PL_curpad;
4471 /* Watch out for global destruction's random ordering. */
4472 if (SvTYPE(new_comppad) == SVt_PVAV) {
4473 PL_comppad = new_comppad;
4474 PL_curpad = AvARRAY(new_comppad);
4478 op_free((OP_4tree*)r->data->data[n]);
4479 PL_comppad = old_comppad;
4480 PL_curpad = old_curpad;
4481 SvREFCNT_dec((SV*)new_comppad);
4487 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4490 Safefree(r->data->what);
4493 Safefree(r->startp);
4499 - regnext - dig the "next" pointer out of a node
4501 * [Note, when REGALIGN is defined there are two places in regmatch()
4502 * that bypass this code for speed.]
4505 Perl_regnext(pTHX_ register regnode *p)
4508 register I32 offset;
4510 if (p == &PL_regdummy)
4513 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4521 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4524 STRLEN l1 = strlen(pat1);
4525 STRLEN l2 = strlen(pat2);
4534 Copy(pat1, buf, l1 , char);
4535 Copy(pat2, buf + l1, l2 , char);
4536 buf[l1 + l2] = '\n';
4537 buf[l1 + l2 + 1] = '\0';
4539 /* ANSI variant takes additional second argument */
4540 va_start(args, pat2);
4544 msv = vmess(buf, &args);
4546 message = SvPV(msv,l1);
4549 Copy(message, buf, l1 , char);
4550 buf[l1] = '\0'; /* Overwrite \n */
4551 Perl_croak(aTHX_ "%s", buf);
4554 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4557 Perl_save_re_context(pTHX)
4562 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4563 SAVEI32(RExC_npar); /* () count. */
4564 SAVEI32(RExC_size); /* Code size. */
4565 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4566 SAVEVPTR(RExC_rx); /* from regcomp.c */
4567 SAVEI32(RExC_seen); /* from regcomp.c */
4568 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4569 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4570 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4571 SAVEPPTR(RExC_end); /* End of input for compile */
4572 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4575 SAVEI32(PL_reg_flags); /* from regexec.c */
4577 SAVEPPTR(PL_reginput); /* String-input pointer. */
4578 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4579 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4580 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4581 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4582 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4583 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4584 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4585 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4586 PL_reg_start_tmp = 0;
4587 SAVEFREEPV(PL_reg_start_tmp);
4588 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4589 PL_reg_start_tmpl = 0;
4590 SAVEVPTR(PL_regdata);
4591 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4592 SAVEI32(PL_regnarrate); /* from regexec.c */
4593 SAVEVPTR(PL_regprogram); /* from regexec.c */
4594 SAVEINT(PL_regindent); /* from regexec.c */
4595 SAVEVPTR(PL_regcc); /* from regexec.c */
4596 SAVEVPTR(PL_curcop);
4597 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4598 SAVEVPTR(PL_reg_re); /* from regexec.c */
4599 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4600 SAVESPTR(PL_reg_sv); /* from regexec.c */
4601 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4602 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4603 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4604 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4606 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4617 clear_re(pTHXo_ void *r)
4619 ReREFCNT_dec((regexp *)r);