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-2001, 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 = compiling */
122 I32 naughty; /* How bad is this pattern? */
123 I32 sawback; /* Did we see \1, ...? */
125 I32 size; /* Code size. */
126 I32 npar; /* () count. */
132 char *starttry; /* -Dr: where regtry was called. */
133 #define RExC_starttry (pRExC_state->starttry)
137 #define RExC_flags16 (pRExC_state->flags16)
138 #define RExC_precomp (pRExC_state->precomp)
139 #define RExC_rx (pRExC_state->rx)
140 #define RExC_end (pRExC_state->end)
141 #define RExC_parse (pRExC_state->parse)
142 #define RExC_whilem_seen (pRExC_state->whilem_seen)
143 #define RExC_emit (pRExC_state->emit)
144 #define RExC_naughty (pRExC_state->naughty)
145 #define RExC_sawback (pRExC_state->sawback)
146 #define RExC_seen (pRExC_state->seen)
147 #define RExC_size (pRExC_state->size)
148 #define RExC_npar (pRExC_state->npar)
149 #define RExC_extralen (pRExC_state->extralen)
150 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
151 #define RExC_seen_evals (pRExC_state->seen_evals)
152 #define RExC_utf8 (pRExC_state->utf8)
154 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
155 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
156 ((*s) == '{' && regcurly(s)))
158 #define PERL_META "^$.[()|?+*\\"
160 #define META "^$.[()|?+*\\"
164 #undef SPSTART /* dratted cpp namespace... */
167 * Flags to be passed up and down.
169 #define WORST 0 /* Worst case. */
170 #define HASWIDTH 0x1 /* Known to match non-null strings. */
171 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
172 #define SPSTART 0x4 /* Starts with * or +. */
173 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
175 /* Length of a variant. */
177 typedef struct scan_data_t {
183 I32 last_end; /* min value, <0 unless valid. */
186 SV **longest; /* Either &l_fixed, or &l_float. */
190 I32 offset_float_min;
191 I32 offset_float_max;
195 struct regnode_charclass_class *start_class;
199 * Forward declarations for pregcomp()'s friends.
202 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
205 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
206 #define SF_BEFORE_SEOL 0x1
207 #define SF_BEFORE_MEOL 0x2
208 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
209 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
212 # define SF_FIX_SHIFT_EOL (0+2)
213 # define SF_FL_SHIFT_EOL (0+4)
215 # define SF_FIX_SHIFT_EOL (+2)
216 # define SF_FL_SHIFT_EOL (+4)
219 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
220 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
222 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
223 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
224 #define SF_IS_INF 0x40
225 #define SF_HAS_PAR 0x80
226 #define SF_IN_PAR 0x100
227 #define SF_HAS_EVAL 0x200
228 #define SCF_DO_SUBSTR 0x400
229 #define SCF_DO_STCLASS_AND 0x0800
230 #define SCF_DO_STCLASS_OR 0x1000
231 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
232 #define SCF_WHILEM_VISITED_POS 0x2000
234 #define UTF RExC_utf8
235 #define LOC (RExC_flags16 & PMf_LOCALE)
236 #define FOLD (RExC_flags16 & PMf_FOLD)
238 #define OOB_UNICODE 12345678
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)
434 STRLEN l = CHR_SVLEN(data->last_found);
435 STRLEN old_l = CHR_SVLEN(*data->longest);
437 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
438 sv_setsv(*data->longest, data->last_found);
439 if (*data->longest == data->longest_fixed) {
440 data->offset_fixed = l ? data->last_start_min : data->pos_min;
441 if (data->flags & SF_BEFORE_EOL)
443 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
445 data->flags &= ~SF_FIX_BEFORE_EOL;
448 data->offset_float_min = l ? data->last_start_min : data->pos_min;
449 data->offset_float_max = (l
450 ? data->last_start_max
451 : data->pos_min + data->pos_delta);
452 if (data->flags & SF_BEFORE_EOL)
454 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
456 data->flags &= ~SF_FL_BEFORE_EOL;
459 SvCUR_set(data->last_found, 0);
461 data->flags &= ~SF_BEFORE_EOL;
464 /* Can match anything (initialization) */
466 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
470 ANYOF_CLASS_ZERO(cl);
471 for (value = 0; value < 256; ++value)
472 ANYOF_BITMAP_SET(cl, value);
473 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
475 cl->flags |= ANYOF_LOCALE;
478 /* Can match anything (initialization) */
480 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
484 for (value = 0; value <= ANYOF_MAX; value += 2)
485 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
487 if (!(cl->flags & ANYOF_UNICODE_ALL))
489 for (value = 0; value < 256; ++value)
490 if (!ANYOF_BITMAP_TEST(cl, value))
495 /* Can match anything (initialization) */
497 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
499 Zero(cl, 1, struct regnode_charclass_class);
501 cl_anything(pRExC_state, cl);
505 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
507 Zero(cl, 1, struct regnode_charclass_class);
509 cl_anything(pRExC_state, cl);
511 cl->flags |= ANYOF_LOCALE;
514 /* 'And' a given class with another one. Can create false positives */
515 /* We assume that cl is not inverted */
517 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
518 struct regnode_charclass_class *and_with)
520 if (!(and_with->flags & ANYOF_CLASS)
521 && !(cl->flags & ANYOF_CLASS)
522 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
523 && !(and_with->flags & ANYOF_FOLD)
524 && !(cl->flags & ANYOF_FOLD)) {
527 if (and_with->flags & ANYOF_INVERT)
528 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
529 cl->bitmap[i] &= ~and_with->bitmap[i];
531 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
532 cl->bitmap[i] &= and_with->bitmap[i];
533 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
534 if (!(and_with->flags & ANYOF_EOS))
535 cl->flags &= ~ANYOF_EOS;
537 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE) {
538 cl->flags &= ~ANYOF_UNICODE_ALL;
539 cl->flags |= ANYOF_UNICODE;
540 ARG_SET(cl, ARG(and_with));
542 if (!(and_with->flags & ANYOF_UNICODE_ALL))
543 cl->flags &= ~ANYOF_UNICODE_ALL;
544 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)))
545 cl->flags &= ~ANYOF_UNICODE;
548 /* 'OR' a given class with another one. Can create false positives */
549 /* We assume that cl is not inverted */
551 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
553 if (or_with->flags & ANYOF_INVERT) {
555 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
556 * <= (B1 | !B2) | (CL1 | !CL2)
557 * which is wasteful if CL2 is small, but we ignore CL2:
558 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
559 * XXXX Can we handle case-fold? Unclear:
560 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
561 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
563 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
564 && !(or_with->flags & ANYOF_FOLD)
565 && !(cl->flags & ANYOF_FOLD) ) {
568 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
569 cl->bitmap[i] |= ~or_with->bitmap[i];
570 } /* XXXX: logic is complicated otherwise */
572 cl_anything(pRExC_state, cl);
575 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
576 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
577 && (!(or_with->flags & ANYOF_FOLD)
578 || (cl->flags & ANYOF_FOLD)) ) {
581 /* OR char bitmap and class bitmap separately */
582 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
583 cl->bitmap[i] |= or_with->bitmap[i];
584 if (or_with->flags & ANYOF_CLASS) {
585 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
586 cl->classflags[i] |= or_with->classflags[i];
587 cl->flags |= ANYOF_CLASS;
590 else { /* XXXX: logic is complicated, leave it along for a moment. */
591 cl_anything(pRExC_state, cl);
594 if (or_with->flags & ANYOF_EOS)
595 cl->flags |= ANYOF_EOS;
597 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
598 ARG(cl) != ARG(or_with)) {
599 cl->flags |= ANYOF_UNICODE_ALL;
600 cl->flags &= ~ANYOF_UNICODE;
602 if (or_with->flags & ANYOF_UNICODE_ALL) {
603 cl->flags |= ANYOF_UNICODE_ALL;
604 cl->flags &= ~ANYOF_UNICODE;
608 /* REx optimizer. Converts nodes into quickier variants "in place".
609 Finds fixed substrings. */
611 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
612 to the position after last scanned or to NULL. */
615 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
616 /* scanp: Start here (read-write). */
617 /* deltap: Write maxlen-minlen here. */
618 /* last: Stop before this one. */
620 I32 min = 0, pars = 0, code;
621 regnode *scan = *scanp, *next;
623 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
624 int is_inf_internal = 0; /* The studied chunk is infinite */
625 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
626 scan_data_t data_fake;
627 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
629 while (scan && OP(scan) != END && scan < last) {
630 /* Peephole optimizer: */
632 if (PL_regkind[(U8)OP(scan)] == EXACT) {
633 /* Merge several consecutive EXACTish nodes into one. */
634 regnode *n = regnext(scan);
637 regnode *stop = scan;
640 next = scan + NODE_SZ_STR(scan);
641 /* Skip NOTHING, merge EXACT*. */
643 ( PL_regkind[(U8)OP(n)] == NOTHING ||
644 (stringok && (OP(n) == OP(scan))))
646 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
647 if (OP(n) == TAIL || n > next)
649 if (PL_regkind[(U8)OP(n)] == NOTHING) {
650 NEXT_OFF(scan) += NEXT_OFF(n);
651 next = n + NODE_STEP_REGNODE;
659 int oldl = STR_LEN(scan);
660 regnode *nnext = regnext(n);
662 if (oldl + STR_LEN(n) > U8_MAX)
664 NEXT_OFF(scan) += NEXT_OFF(n);
665 STR_LEN(scan) += STR_LEN(n);
666 next = n + NODE_SZ_STR(n);
667 /* Now we can overwrite *n : */
668 Move(STRING(n), STRING(scan) + oldl,
679 n = scan + NODE_SZ_STR(scan);
681 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
689 /* Follow the next-chain of the current node and optimize
690 away all the NOTHINGs from it. */
691 if (OP(scan) != CURLYX) {
692 int max = (reg_off_by_arg[OP(scan)]
694 /* I32 may be smaller than U16 on CRAYs! */
695 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
696 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
700 /* Skip NOTHING and LONGJMP. */
701 while ((n = regnext(n))
702 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
703 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
706 if (reg_off_by_arg[OP(scan)])
709 NEXT_OFF(scan) = off;
711 /* The principal pseudo-switch. Cannot be a switch, since we
712 look into several different things. */
713 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
714 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
715 next = regnext(scan);
718 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
719 I32 max1 = 0, min1 = I32_MAX, num = 0;
720 struct regnode_charclass_class accum;
722 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
723 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
724 if (flags & SCF_DO_STCLASS)
725 cl_init_zero(pRExC_state, &accum);
726 while (OP(scan) == code) {
727 I32 deltanext, minnext, f = 0, fake;
728 struct regnode_charclass_class this_class;
733 data_fake.whilem_c = data->whilem_c;
734 data_fake.last_closep = data->last_closep;
737 data_fake.last_closep = &fake;
738 next = regnext(scan);
739 scan = NEXTOPER(scan);
741 scan = NEXTOPER(scan);
742 if (flags & SCF_DO_STCLASS) {
743 cl_init(pRExC_state, &this_class);
744 data_fake.start_class = &this_class;
745 f = SCF_DO_STCLASS_AND;
747 if (flags & SCF_WHILEM_VISITED_POS)
748 f |= SCF_WHILEM_VISITED_POS;
749 /* we suppose the run is continuous, last=next...*/
750 minnext = study_chunk(pRExC_state, &scan, &deltanext,
751 next, &data_fake, f);
754 if (max1 < minnext + deltanext)
755 max1 = minnext + deltanext;
756 if (deltanext == I32_MAX)
757 is_inf = is_inf_internal = 1;
759 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
761 if (data && (data_fake.flags & SF_HAS_EVAL))
762 data->flags |= SF_HAS_EVAL;
764 data->whilem_c = data_fake.whilem_c;
765 if (flags & SCF_DO_STCLASS)
766 cl_or(pRExC_state, &accum, &this_class);
770 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
772 if (flags & SCF_DO_SUBSTR) {
773 data->pos_min += min1;
774 data->pos_delta += max1 - min1;
775 if (max1 != min1 || is_inf)
776 data->longest = &(data->longest_float);
779 delta += max1 - min1;
780 if (flags & SCF_DO_STCLASS_OR) {
781 cl_or(pRExC_state, data->start_class, &accum);
783 cl_and(data->start_class, &and_with);
784 flags &= ~SCF_DO_STCLASS;
787 else if (flags & SCF_DO_STCLASS_AND) {
789 cl_and(data->start_class, &accum);
790 flags &= ~SCF_DO_STCLASS;
793 /* Switch to OR mode: cache the old value of
794 * data->start_class */
795 StructCopy(data->start_class, &and_with,
796 struct regnode_charclass_class);
797 flags &= ~SCF_DO_STCLASS_AND;
798 StructCopy(&accum, data->start_class,
799 struct regnode_charclass_class);
800 flags |= SCF_DO_STCLASS_OR;
801 data->start_class->flags |= ANYOF_EOS;
805 else if (code == BRANCHJ) /* single branch is optimized. */
806 scan = NEXTOPER(NEXTOPER(scan));
807 else /* single branch is optimized. */
808 scan = NEXTOPER(scan);
811 else if (OP(scan) == EXACT) {
812 I32 l = STR_LEN(scan);
813 UV uc = *((U8*)STRING(scan));
815 U8 *s = (U8*)STRING(scan);
816 l = utf8_length(s, s + l);
817 uc = utf8_to_uv_simple(s, NULL);
820 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
821 /* The code below prefers earlier match for fixed
822 offset, later match for variable offset. */
823 if (data->last_end == -1) { /* Update the start info. */
824 data->last_start_min = data->pos_min;
825 data->last_start_max = is_inf
826 ? I32_MAX : data->pos_min + data->pos_delta;
828 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
829 data->last_end = data->pos_min + l;
830 data->pos_min += l; /* As in the first entry. */
831 data->flags &= ~SF_BEFORE_EOL;
833 if (flags & SCF_DO_STCLASS_AND) {
834 /* Check whether it is compatible with what we know already! */
838 !(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
839 && !ANYOF_BITMAP_TEST(data->start_class, uc)
840 && (!(data->start_class->flags & ANYOF_FOLD)
841 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
843 ANYOF_CLASS_ZERO(data->start_class);
844 ANYOF_BITMAP_ZERO(data->start_class);
846 ANYOF_BITMAP_SET(data->start_class, uc);
847 data->start_class->flags &= ~ANYOF_EOS;
849 else if (flags & SCF_DO_STCLASS_OR) {
850 /* false positive possible if the class is case-folded */
852 ANYOF_BITMAP_SET(data->start_class, uc);
853 data->start_class->flags &= ~ANYOF_EOS;
854 cl_and(data->start_class, &and_with);
856 flags &= ~SCF_DO_STCLASS;
858 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
859 I32 l = STR_LEN(scan);
860 UV uc = *((U8*)STRING(scan));
862 /* Search for fixed substrings supports EXACT only. */
863 if (flags & SCF_DO_SUBSTR)
864 scan_commit(pRExC_state, data);
866 U8 *s = (U8 *)STRING(scan);
867 l = utf8_length(s, s + l);
868 uc = utf8_to_uv_simple(s, NULL);
871 if (data && (flags & SCF_DO_SUBSTR))
873 if (flags & SCF_DO_STCLASS_AND) {
874 /* Check whether it is compatible with what we know already! */
878 !(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
879 && !ANYOF_BITMAP_TEST(data->start_class, uc)
880 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc]))
882 ANYOF_CLASS_ZERO(data->start_class);
883 ANYOF_BITMAP_ZERO(data->start_class);
885 ANYOF_BITMAP_SET(data->start_class, uc);
886 data->start_class->flags &= ~ANYOF_EOS;
887 data->start_class->flags |= ANYOF_FOLD;
888 if (OP(scan) == EXACTFL)
889 data->start_class->flags |= ANYOF_LOCALE;
892 else if (flags & SCF_DO_STCLASS_OR) {
893 if (data->start_class->flags & ANYOF_FOLD) {
894 /* false positive possible if the class is case-folded.
895 Assume that the locale settings are the same... */
897 ANYOF_BITMAP_SET(data->start_class, uc);
898 data->start_class->flags &= ~ANYOF_EOS;
900 cl_and(data->start_class, &and_with);
902 flags &= ~SCF_DO_STCLASS;
904 else if (strchr((char*)PL_varies,OP(scan))) {
905 I32 mincount, maxcount, minnext, deltanext, fl;
906 I32 f = flags, pos_before = 0;
907 regnode *oscan = scan;
908 struct regnode_charclass_class this_class;
909 struct regnode_charclass_class *oclass = NULL;
911 switch (PL_regkind[(U8)OP(scan)]) {
912 case WHILEM: /* End of (?:...)* . */
913 scan = NEXTOPER(scan);
916 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
917 next = NEXTOPER(scan);
918 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
920 maxcount = REG_INFTY;
921 next = regnext(scan);
922 scan = NEXTOPER(scan);
926 if (flags & SCF_DO_SUBSTR)
931 if (flags & SCF_DO_STCLASS) {
933 maxcount = REG_INFTY;
934 next = regnext(scan);
935 scan = NEXTOPER(scan);
938 is_inf = is_inf_internal = 1;
939 scan = regnext(scan);
940 if (flags & SCF_DO_SUBSTR) {
941 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
942 data->longest = &(data->longest_float);
944 goto optimize_curly_tail;
946 mincount = ARG1(scan);
947 maxcount = ARG2(scan);
948 next = regnext(scan);
949 if (OP(scan) == CURLYX) {
950 I32 lp = (data ? *(data->last_closep) : 0);
952 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
954 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
956 if (flags & SCF_DO_SUBSTR) {
957 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
958 pos_before = data->pos_min;
962 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
964 data->flags |= SF_IS_INF;
966 if (flags & SCF_DO_STCLASS) {
967 cl_init(pRExC_state, &this_class);
968 oclass = data->start_class;
969 data->start_class = &this_class;
970 f |= SCF_DO_STCLASS_AND;
971 f &= ~SCF_DO_STCLASS_OR;
973 /* These are the cases when once a subexpression
974 fails at a particular position, it cannot succeed
975 even after backtracking at the enclosing scope.
977 XXXX what if minimal match and we are at the
978 initial run of {n,m}? */
979 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
980 f &= ~SCF_WHILEM_VISITED_POS;
982 /* This will finish on WHILEM, setting scan, or on NULL: */
983 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
985 ? (f & ~SCF_DO_SUBSTR) : f);
987 if (flags & SCF_DO_STCLASS)
988 data->start_class = oclass;
989 if (mincount == 0 || minnext == 0) {
990 if (flags & SCF_DO_STCLASS_OR) {
991 cl_or(pRExC_state, data->start_class, &this_class);
993 else if (flags & SCF_DO_STCLASS_AND) {
994 /* Switch to OR mode: cache the old value of
995 * data->start_class */
996 StructCopy(data->start_class, &and_with,
997 struct regnode_charclass_class);
998 flags &= ~SCF_DO_STCLASS_AND;
999 StructCopy(&this_class, data->start_class,
1000 struct regnode_charclass_class);
1001 flags |= SCF_DO_STCLASS_OR;
1002 data->start_class->flags |= ANYOF_EOS;
1004 } else { /* Non-zero len */
1005 if (flags & SCF_DO_STCLASS_OR) {
1006 cl_or(pRExC_state, data->start_class, &this_class);
1007 cl_and(data->start_class, &and_with);
1009 else if (flags & SCF_DO_STCLASS_AND)
1010 cl_and(data->start_class, &this_class);
1011 flags &= ~SCF_DO_STCLASS;
1013 if (!scan) /* It was not CURLYX, but CURLY. */
1015 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
1016 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1017 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1020 "Quantifier unexpected on zero-length expression");
1023 min += minnext * mincount;
1024 is_inf_internal |= ((maxcount == REG_INFTY
1025 && (minnext + deltanext) > 0)
1026 || deltanext == I32_MAX);
1027 is_inf |= is_inf_internal;
1028 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1030 /* Try powerful optimization CURLYX => CURLYN. */
1031 if ( OP(oscan) == CURLYX && data
1032 && data->flags & SF_IN_PAR
1033 && !(data->flags & SF_HAS_EVAL)
1034 && !deltanext && minnext == 1 ) {
1035 /* Try to optimize to CURLYN. */
1036 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1037 regnode *nxt1 = nxt, *nxt2;
1041 if (!strchr((char*)PL_simple,OP(nxt))
1042 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1043 && STR_LEN(nxt) == 1))
1047 if (OP(nxt) != CLOSE)
1049 /* Now we know that nxt2 is the only contents: */
1050 oscan->flags = ARG(nxt);
1052 OP(nxt1) = NOTHING; /* was OPEN. */
1054 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1055 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1056 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1057 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1058 OP(nxt + 1) = OPTIMIZED; /* was count. */
1059 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1064 /* Try optimization CURLYX => CURLYM. */
1065 if ( OP(oscan) == CURLYX && data
1066 && !(data->flags & SF_HAS_PAR)
1067 && !(data->flags & SF_HAS_EVAL)
1069 /* XXXX How to optimize if data == 0? */
1070 /* Optimize to a simpler form. */
1071 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1075 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1076 && (OP(nxt2) != WHILEM))
1078 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1079 /* Need to optimize away parenths. */
1080 if (data->flags & SF_IN_PAR) {
1081 /* Set the parenth number. */
1082 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1084 if (OP(nxt) != CLOSE)
1085 FAIL("Panic opt close");
1086 oscan->flags = ARG(nxt);
1087 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1088 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1090 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1091 OP(nxt + 1) = OPTIMIZED; /* was count. */
1092 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1093 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1096 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1097 regnode *nnxt = regnext(nxt1);
1100 if (reg_off_by_arg[OP(nxt1)])
1101 ARG_SET(nxt1, nxt2 - nxt1);
1102 else if (nxt2 - nxt1 < U16_MAX)
1103 NEXT_OFF(nxt1) = nxt2 - nxt1;
1105 OP(nxt) = NOTHING; /* Cannot beautify */
1110 /* Optimize again: */
1111 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1117 else if ((OP(oscan) == CURLYX)
1118 && (flags & SCF_WHILEM_VISITED_POS)
1119 /* See the comment on a similar expression above.
1120 However, this time it not a subexpression
1121 we care about, but the expression itself. */
1122 && (maxcount == REG_INFTY)
1123 && data && ++data->whilem_c < 16) {
1124 /* This stays as CURLYX, we can put the count/of pair. */
1125 /* Find WHILEM (as in regexec.c) */
1126 regnode *nxt = oscan + NEXT_OFF(oscan);
1128 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1130 PREVOPER(nxt)->flags = data->whilem_c
1131 | (RExC_whilem_seen << 4); /* On WHILEM */
1133 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1135 if (flags & SCF_DO_SUBSTR) {
1136 SV *last_str = Nullsv;
1137 int counted = mincount != 0;
1139 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1140 I32 b = pos_before >= data->last_start_min
1141 ? pos_before : data->last_start_min;
1143 char *s = SvPV(data->last_found, l);
1144 I32 old = b - data->last_start_min;
1147 old = utf8_hop((U8*)s, old) - (U8*)s;
1150 /* Get the added string: */
1151 last_str = newSVpvn(s + old, l);
1152 if (deltanext == 0 && pos_before == b) {
1153 /* What was added is a constant string */
1155 SvGROW(last_str, (mincount * l) + 1);
1156 repeatcpy(SvPVX(last_str) + l,
1157 SvPVX(last_str), l, mincount - 1);
1158 SvCUR(last_str) *= mincount;
1159 /* Add additional parts. */
1160 SvCUR_set(data->last_found,
1161 SvCUR(data->last_found) - l);
1162 sv_catsv(data->last_found, last_str);
1163 data->last_end += l * (mincount - 1);
1166 /* start offset must point into the last copy */
1167 data->last_start_min += minnext * (mincount - 1);
1168 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1169 * (minnext + data->pos_delta);
1172 /* It is counted once already... */
1173 data->pos_min += minnext * (mincount - counted);
1174 data->pos_delta += - counted * deltanext +
1175 (minnext + deltanext) * maxcount - minnext * mincount;
1176 if (mincount != maxcount) {
1177 /* Cannot extend fixed substrings found inside
1179 scan_commit(pRExC_state,data);
1180 if (mincount && last_str) {
1181 sv_setsv(data->last_found, last_str);
1182 data->last_end = data->pos_min;
1183 data->last_start_min =
1184 data->pos_min - CHR_SVLEN(last_str);
1185 data->last_start_max = is_inf
1187 : data->pos_min + data->pos_delta
1188 - CHR_SVLEN(last_str);
1190 data->longest = &(data->longest_float);
1192 SvREFCNT_dec(last_str);
1194 if (data && (fl & SF_HAS_EVAL))
1195 data->flags |= SF_HAS_EVAL;
1196 optimize_curly_tail:
1197 if (OP(oscan) != CURLYX) {
1198 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1200 NEXT_OFF(oscan) += NEXT_OFF(next);
1203 default: /* REF and CLUMP only? */
1204 if (flags & SCF_DO_SUBSTR) {
1205 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1206 data->longest = &(data->longest_float);
1208 is_inf = is_inf_internal = 1;
1209 if (flags & SCF_DO_STCLASS_OR)
1210 cl_anything(pRExC_state, data->start_class);
1211 flags &= ~SCF_DO_STCLASS;
1215 else if (strchr((char*)PL_simple,OP(scan))) {
1218 if (flags & SCF_DO_SUBSTR) {
1219 scan_commit(pRExC_state,data);
1223 if (flags & SCF_DO_STCLASS) {
1224 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1226 /* Some of the logic below assumes that switching
1227 locale on will only add false positives. */
1228 switch (PL_regkind[(U8)OP(scan)]) {
1232 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1233 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1234 cl_anything(pRExC_state, data->start_class);
1237 if (OP(scan) == SANY)
1239 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1240 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1241 || (data->start_class->flags & ANYOF_CLASS));
1242 cl_anything(pRExC_state, data->start_class);
1244 if (flags & SCF_DO_STCLASS_AND || !value)
1245 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1248 if (flags & SCF_DO_STCLASS_AND)
1249 cl_and(data->start_class,
1250 (struct regnode_charclass_class*)scan);
1252 cl_or(pRExC_state, data->start_class,
1253 (struct regnode_charclass_class*)scan);
1256 if (flags & SCF_DO_STCLASS_AND) {
1257 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1258 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1259 for (value = 0; value < 256; value++)
1260 if (!isALNUM(value))
1261 ANYOF_BITMAP_CLEAR(data->start_class, value);
1265 if (data->start_class->flags & ANYOF_LOCALE)
1266 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1268 for (value = 0; value < 256; value++)
1270 ANYOF_BITMAP_SET(data->start_class, value);
1275 if (flags & SCF_DO_STCLASS_AND) {
1276 if (data->start_class->flags & ANYOF_LOCALE)
1277 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1280 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1281 data->start_class->flags |= ANYOF_LOCALE;
1285 if (flags & SCF_DO_STCLASS_AND) {
1286 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1287 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1288 for (value = 0; value < 256; value++)
1290 ANYOF_BITMAP_CLEAR(data->start_class, value);
1294 if (data->start_class->flags & ANYOF_LOCALE)
1295 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1297 for (value = 0; value < 256; value++)
1298 if (!isALNUM(value))
1299 ANYOF_BITMAP_SET(data->start_class, value);
1304 if (flags & SCF_DO_STCLASS_AND) {
1305 if (data->start_class->flags & ANYOF_LOCALE)
1306 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1309 data->start_class->flags |= ANYOF_LOCALE;
1310 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1314 if (flags & SCF_DO_STCLASS_AND) {
1315 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1316 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1317 for (value = 0; value < 256; value++)
1318 if (!isSPACE(value))
1319 ANYOF_BITMAP_CLEAR(data->start_class, value);
1323 if (data->start_class->flags & ANYOF_LOCALE)
1324 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1326 for (value = 0; value < 256; value++)
1328 ANYOF_BITMAP_SET(data->start_class, value);
1333 if (flags & SCF_DO_STCLASS_AND) {
1334 if (data->start_class->flags & ANYOF_LOCALE)
1335 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1338 data->start_class->flags |= ANYOF_LOCALE;
1339 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1343 if (flags & SCF_DO_STCLASS_AND) {
1344 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1345 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1346 for (value = 0; value < 256; value++)
1348 ANYOF_BITMAP_CLEAR(data->start_class, value);
1352 if (data->start_class->flags & ANYOF_LOCALE)
1353 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1355 for (value = 0; value < 256; value++)
1356 if (!isSPACE(value))
1357 ANYOF_BITMAP_SET(data->start_class, value);
1362 if (flags & SCF_DO_STCLASS_AND) {
1363 if (data->start_class->flags & ANYOF_LOCALE) {
1364 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1365 for (value = 0; value < 256; value++)
1366 if (!isSPACE(value))
1367 ANYOF_BITMAP_CLEAR(data->start_class, value);
1371 data->start_class->flags |= ANYOF_LOCALE;
1372 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1376 if (flags & SCF_DO_STCLASS_AND) {
1377 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1378 for (value = 0; value < 256; value++)
1379 if (!isDIGIT(value))
1380 ANYOF_BITMAP_CLEAR(data->start_class, value);
1383 if (data->start_class->flags & ANYOF_LOCALE)
1384 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1386 for (value = 0; value < 256; value++)
1388 ANYOF_BITMAP_SET(data->start_class, value);
1393 if (flags & SCF_DO_STCLASS_AND) {
1394 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1395 for (value = 0; value < 256; value++)
1397 ANYOF_BITMAP_CLEAR(data->start_class, value);
1400 if (data->start_class->flags & ANYOF_LOCALE)
1401 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1403 for (value = 0; value < 256; value++)
1404 if (!isDIGIT(value))
1405 ANYOF_BITMAP_SET(data->start_class, value);
1410 if (flags & SCF_DO_STCLASS_OR)
1411 cl_and(data->start_class, &and_with);
1412 flags &= ~SCF_DO_STCLASS;
1415 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1416 data->flags |= (OP(scan) == MEOL
1420 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1421 /* Lookbehind, or need to calculate parens/evals/stclass: */
1422 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1423 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1424 /* Lookahead/lookbehind */
1425 I32 deltanext, minnext, fake = 0;
1427 struct regnode_charclass_class intrnl;
1430 data_fake.flags = 0;
1432 data_fake.whilem_c = data->whilem_c;
1433 data_fake.last_closep = data->last_closep;
1436 data_fake.last_closep = &fake;
1437 if ( flags & SCF_DO_STCLASS && !scan->flags
1438 && OP(scan) == IFMATCH ) { /* Lookahead */
1439 cl_init(pRExC_state, &intrnl);
1440 data_fake.start_class = &intrnl;
1441 f |= SCF_DO_STCLASS_AND;
1443 if (flags & SCF_WHILEM_VISITED_POS)
1444 f |= SCF_WHILEM_VISITED_POS;
1445 next = regnext(scan);
1446 nscan = NEXTOPER(NEXTOPER(scan));
1447 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1450 vFAIL("Variable length lookbehind not implemented");
1452 else if (minnext > U8_MAX) {
1453 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1455 scan->flags = minnext;
1457 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1459 if (data && (data_fake.flags & SF_HAS_EVAL))
1460 data->flags |= SF_HAS_EVAL;
1462 data->whilem_c = data_fake.whilem_c;
1463 if (f & SCF_DO_STCLASS_AND) {
1464 int was = (data->start_class->flags & ANYOF_EOS);
1466 cl_and(data->start_class, &intrnl);
1468 data->start_class->flags |= ANYOF_EOS;
1471 else if (OP(scan) == OPEN) {
1474 else if (OP(scan) == CLOSE) {
1475 if (ARG(scan) == is_par) {
1476 next = regnext(scan);
1478 if ( next && (OP(next) != WHILEM) && next < last)
1479 is_par = 0; /* Disable optimization */
1482 *(data->last_closep) = ARG(scan);
1484 else if (OP(scan) == EVAL) {
1486 data->flags |= SF_HAS_EVAL;
1488 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1489 if (flags & SCF_DO_SUBSTR) {
1490 scan_commit(pRExC_state,data);
1491 data->longest = &(data->longest_float);
1493 is_inf = is_inf_internal = 1;
1494 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1495 cl_anything(pRExC_state, data->start_class);
1496 flags &= ~SCF_DO_STCLASS;
1498 /* Else: zero-length, ignore. */
1499 scan = regnext(scan);
1504 *deltap = is_inf_internal ? I32_MAX : delta;
1505 if (flags & SCF_DO_SUBSTR && is_inf)
1506 data->pos_delta = I32_MAX - data->pos_min;
1507 if (is_par > U8_MAX)
1509 if (is_par && pars==1 && data) {
1510 data->flags |= SF_IN_PAR;
1511 data->flags &= ~SF_HAS_PAR;
1513 else if (pars && data) {
1514 data->flags |= SF_HAS_PAR;
1515 data->flags &= ~SF_IN_PAR;
1517 if (flags & SCF_DO_STCLASS_OR)
1518 cl_and(data->start_class, &and_with);
1523 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)
1546 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1549 PL_colors[0] = s = savepv(s);
1551 s = strchr(s, '\t');
1557 PL_colors[i] = s = "";
1561 PL_colors[i++] = "";
1568 - pregcomp - compile a regular expression into internal code
1570 * We can't allocate space until we know how big the compiled form will be,
1571 * but we can't compile it (and thus know how big it is) until we've got a
1572 * place to put the code. So we cheat: we compile it twice, once with code
1573 * generation turned off and size counting turned on, and once "for real".
1574 * This also means that we don't allocate space until we are sure that the
1575 * thing really will compile successfully, and we never have to move the
1576 * code and thus invalidate pointers into it. (Note that it has to be in
1577 * one piece because free() must be able to free it all.) [NB: not true in perl]
1579 * Beware that the optimization-preparation code in here knows about some
1580 * of the structure of the compiled regexp. [I'll say.]
1583 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1593 RExC_state_t RExC_state;
1594 RExC_state_t *pRExC_state = &RExC_state;
1597 FAIL("NULL regexp argument");
1599 /* XXXX This looks very suspicious... */
1600 if (pm->op_pmdynflags & PMdf_CMP_UTF8)
1605 RExC_precomp = savepvn(exp, xend - exp);
1606 DEBUG_r(if (!PL_colorset) reginitcolors());
1607 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1608 PL_colors[4],PL_colors[5],PL_colors[0],
1609 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1610 RExC_flags16 = pm->op_pmflags;
1614 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1615 RExC_seen_evals = 0;
1618 /* First pass: determine size, legality. */
1624 RExC_emit = &PL_regdummy;
1625 RExC_whilem_seen = 0;
1626 #if 0 /* REGC() is (currently) a NOP at the first pass.
1627 * Clever compilers notice this and complain. --jhi */
1628 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1630 if (reg(pRExC_state, 0, &flags) == NULL) {
1631 Safefree(RExC_precomp);
1632 RExC_precomp = Nullch;
1635 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1637 /* Small enough for pointer-storage convention?
1638 If extralen==0, this means that we will not need long jumps. */
1639 if (RExC_size >= 0x10000L && RExC_extralen)
1640 RExC_size += RExC_extralen;
1643 if (RExC_whilem_seen > 15)
1644 RExC_whilem_seen = 15;
1646 /* Allocate space and initialize. */
1647 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1650 FAIL("Regexp out of space");
1653 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1654 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1657 r->prelen = xend - exp;
1658 r->precomp = RExC_precomp;
1660 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1661 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1663 r->substrs = 0; /* Useful during FAIL. */
1664 r->startp = 0; /* Useful during FAIL. */
1665 r->endp = 0; /* Useful during FAIL. */
1669 /* Second pass: emit code. */
1674 RExC_emit = r->program;
1675 /* Store the count of eval-groups for security checks: */
1676 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1677 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1679 if (reg(pRExC_state, 0, &flags) == NULL)
1682 /* Dig out information for optimizations. */
1683 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1684 pm->op_pmflags = RExC_flags16;
1686 r->reganch |= ROPT_UTF8;
1687 r->regstclass = NULL;
1688 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1689 r->reganch |= ROPT_NAUGHTY;
1690 scan = r->program + 1; /* First BRANCH. */
1692 /* XXXX To minimize changes to RE engine we always allocate
1693 3-units-long substrs field. */
1694 Newz(1004, r->substrs, 1, struct reg_substr_data);
1696 StructCopy(&zero_scan_data, &data, scan_data_t);
1697 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1698 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1700 STRLEN longest_float_length, longest_fixed_length;
1701 struct regnode_charclass_class ch_class;
1706 /* Skip introductions and multiplicators >= 1. */
1707 while ((OP(first) == OPEN && (sawopen = 1)) ||
1708 /* An OR of *one* alternative - should not happen now. */
1709 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1710 (OP(first) == PLUS) ||
1711 (OP(first) == MINMOD) ||
1712 /* An {n,m} with n>0 */
1713 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1714 if (OP(first) == PLUS)
1717 first += regarglen[(U8)OP(first)];
1718 first = NEXTOPER(first);
1721 /* Starting-point info. */
1723 if (PL_regkind[(U8)OP(first)] == EXACT) {
1724 if (OP(first) == EXACT)
1725 ; /* Empty, get anchored substr later. */
1726 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1727 r->regstclass = first;
1729 else if (strchr((char*)PL_simple,OP(first)))
1730 r->regstclass = first;
1731 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1732 PL_regkind[(U8)OP(first)] == NBOUND)
1733 r->regstclass = first;
1734 else if (PL_regkind[(U8)OP(first)] == BOL) {
1735 r->reganch |= (OP(first) == MBOL
1737 : (OP(first) == SBOL
1740 first = NEXTOPER(first);
1743 else if (OP(first) == GPOS) {
1744 r->reganch |= ROPT_ANCH_GPOS;
1745 first = NEXTOPER(first);
1748 else if ((OP(first) == STAR &&
1749 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1750 !(r->reganch & ROPT_ANCH) )
1752 /* turn .* into ^.* with an implied $*=1 */
1753 int type = OP(NEXTOPER(first));
1755 if (type == REG_ANY)
1756 type = ROPT_ANCH_MBOL;
1758 type = ROPT_ANCH_SBOL;
1760 r->reganch |= type | ROPT_IMPLICIT;
1761 first = NEXTOPER(first);
1764 if (sawplus && (!sawopen || !RExC_sawback)
1765 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1766 /* x+ must match at the 1st pos of run of x's */
1767 r->reganch |= ROPT_SKIP;
1769 /* Scan is after the zeroth branch, first is atomic matcher. */
1770 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1771 (IV)(first - scan + 1)));
1773 * If there's something expensive in the r.e., find the
1774 * longest literal string that must appear and make it the
1775 * regmust. Resolve ties in favor of later strings, since
1776 * the regstart check works with the beginning of the r.e.
1777 * and avoiding duplication strengthens checking. Not a
1778 * strong reason, but sufficient in the absence of others.
1779 * [Now we resolve ties in favor of the earlier string if
1780 * it happens that c_offset_min has been invalidated, since the
1781 * earlier string may buy us something the later one won't.]
1785 data.longest_fixed = newSVpvn("",0);
1786 data.longest_float = newSVpvn("",0);
1787 data.last_found = newSVpvn("",0);
1788 data.longest = &(data.longest_fixed);
1790 if (!r->regstclass) {
1791 cl_init(pRExC_state, &ch_class);
1792 data.start_class = &ch_class;
1793 stclass_flag = SCF_DO_STCLASS_AND;
1794 } else /* XXXX Check for BOUND? */
1796 data.last_closep = &last_close;
1798 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1799 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1800 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1801 && data.last_start_min == 0 && data.last_end > 0
1802 && !RExC_seen_zerolen
1803 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1804 r->reganch |= ROPT_CHECK_ALL;
1805 scan_commit(pRExC_state, &data);
1806 SvREFCNT_dec(data.last_found);
1808 longest_float_length = CHR_SVLEN(data.longest_float);
1809 if (longest_float_length
1810 || (data.flags & SF_FL_BEFORE_EOL
1811 && (!(data.flags & SF_FL_BEFORE_MEOL)
1812 || (RExC_flags16 & PMf_MULTILINE)))) {
1815 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1816 && data.offset_fixed == data.offset_float_min
1817 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1818 goto remove_float; /* As in (a)+. */
1820 r->float_substr = data.longest_float;
1821 r->float_min_offset = data.offset_float_min;
1822 r->float_max_offset = data.offset_float_max;
1823 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1824 && (!(data.flags & SF_FL_BEFORE_MEOL)
1825 || (RExC_flags16 & PMf_MULTILINE)));
1826 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1830 r->float_substr = Nullsv;
1831 SvREFCNT_dec(data.longest_float);
1832 longest_float_length = 0;
1835 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1836 if (longest_fixed_length
1837 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1838 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1839 || (RExC_flags16 & PMf_MULTILINE)))) {
1842 r->anchored_substr = data.longest_fixed;
1843 r->anchored_offset = data.offset_fixed;
1844 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1845 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1846 || (RExC_flags16 & PMf_MULTILINE)));
1847 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1850 r->anchored_substr = Nullsv;
1851 SvREFCNT_dec(data.longest_fixed);
1852 longest_fixed_length = 0;
1855 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1856 r->regstclass = NULL;
1857 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1858 && !(data.start_class->flags & ANYOF_EOS)
1859 && !cl_is_anything(data.start_class)) {
1861 I32 n = add_data(pRExC_state, 1, "f");
1863 New(1006, RExC_rx->data->data[n], 1,
1864 struct regnode_charclass_class);
1865 StructCopy(data.start_class,
1866 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1867 struct regnode_charclass_class);
1868 r->regstclass = (regnode*)RExC_rx->data->data[n];
1869 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1870 PL_regdata = r->data; /* for regprop() */
1871 DEBUG_r((sv = sv_newmortal(),
1872 regprop(sv, (regnode*)data.start_class),
1873 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1877 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1878 if (longest_fixed_length > longest_float_length) {
1879 r->check_substr = r->anchored_substr;
1880 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1881 if (r->reganch & ROPT_ANCH_SINGLE)
1882 r->reganch |= ROPT_NOSCAN;
1885 r->check_substr = r->float_substr;
1886 r->check_offset_min = data.offset_float_min;
1887 r->check_offset_max = data.offset_float_max;
1889 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1890 This should be changed ASAP! */
1891 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1892 r->reganch |= RE_USE_INTUIT;
1893 if (SvTAIL(r->check_substr))
1894 r->reganch |= RE_INTUIT_TAIL;
1898 /* Several toplevels. Best we can is to set minlen. */
1900 struct regnode_charclass_class ch_class;
1903 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1904 scan = r->program + 1;
1905 cl_init(pRExC_state, &ch_class);
1906 data.start_class = &ch_class;
1907 data.last_closep = &last_close;
1908 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1909 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1910 if (!(data.start_class->flags & ANYOF_EOS)
1911 && !cl_is_anything(data.start_class)) {
1913 I32 n = add_data(pRExC_state, 1, "f");
1915 New(1006, RExC_rx->data->data[n], 1,
1916 struct regnode_charclass_class);
1917 StructCopy(data.start_class,
1918 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1919 struct regnode_charclass_class);
1920 r->regstclass = (regnode*)RExC_rx->data->data[n];
1921 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1922 DEBUG_r((sv = sv_newmortal(),
1923 regprop(sv, (regnode*)data.start_class),
1924 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1930 if (RExC_seen & REG_SEEN_GPOS)
1931 r->reganch |= ROPT_GPOS_SEEN;
1932 if (RExC_seen & REG_SEEN_LOOKBEHIND)
1933 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1934 if (RExC_seen & REG_SEEN_EVAL)
1935 r->reganch |= ROPT_EVAL_SEEN;
1936 Newz(1002, r->startp, RExC_npar, I32);
1937 Newz(1002, r->endp, RExC_npar, I32);
1938 PL_regdata = r->data; /* for regprop() */
1939 DEBUG_r(regdump(r));
1944 - reg - regular expression, i.e. main body or parenthesized thing
1946 * Caller must absorb opening parenthesis.
1948 * Combining parenthesis handling with the base level of regular expression
1949 * is a trifle forced, but the need to tie the tails of the branches to what
1950 * follows makes it hard to avoid.
1953 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
1954 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1956 register regnode *ret; /* Will be the head of the group. */
1957 register regnode *br;
1958 register regnode *lastbr;
1959 register regnode *ender = 0;
1960 register I32 parno = 0;
1961 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
1962 char *oregcomp_parse = RExC_parse;
1965 *flagp = 0; /* Tentatively. */
1967 /* Make an OPEN node, if parenthesized. */
1969 if (*RExC_parse == '?') {
1970 U16 posflags = 0, negflags = 0;
1971 U16 *flagsp = &posflags;
1973 char *seqstart = RExC_parse;
1976 paren = *RExC_parse++;
1977 ret = NULL; /* For look-ahead/behind. */
1980 RExC_seen |= REG_SEEN_LOOKBEHIND;
1981 if (*RExC_parse == '!')
1983 if (*RExC_parse != '=' && *RExC_parse != '!')
1988 RExC_seen_zerolen++;
1994 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
1997 while (*RExC_parse && *RExC_parse != ')')
1999 if (*RExC_parse != ')')
2000 FAIL("Sequence (?#... not terminated");
2001 nextchar(pRExC_state);
2006 vWARN(RExC_parse, "(?p{}) is deprecated - use (??{})");
2010 paren = *RExC_parse++;
2014 I32 count = 1, n = 0;
2016 char *s = RExC_parse;
2018 OP_4tree *sop, *rop;
2020 RExC_seen_zerolen++;
2021 RExC_seen |= REG_SEEN_EVAL;
2022 while (count && (c = *RExC_parse)) {
2023 if (c == '\\' && RExC_parse[1])
2031 if (*RExC_parse != ')')
2034 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2039 if (RExC_parse - 1 - s)
2040 sv = newSVpvn(s, RExC_parse - 1 - s);
2042 sv = newSVpvn("", 0);
2045 Perl_save_re_context(aTHX);
2046 rop = sv_compile_2op(sv, &sop, "re", &av);
2049 n = add_data(pRExC_state, 3, "nop");
2050 RExC_rx->data->data[n] = (void*)rop;
2051 RExC_rx->data->data[n+1] = (void*)sop;
2052 RExC_rx->data->data[n+2] = (void*)av;
2055 else { /* First pass */
2056 if (PL_reginterp_cnt < ++RExC_seen_evals
2057 && PL_curcop != &PL_compiling)
2058 /* No compiled RE interpolated, has runtime
2059 components ===> unsafe. */
2060 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2062 FAIL("Eval-group in insecure regular expression");
2065 nextchar(pRExC_state);
2067 ret = reg_node(pRExC_state, LOGICAL);
2070 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2073 return reganode(pRExC_state, EVAL, n);
2077 if (RExC_parse[0] == '?') {
2078 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2079 || RExC_parse[1] == '<'
2080 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2083 ret = reg_node(pRExC_state, LOGICAL);
2086 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2090 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2091 parno = atoi(RExC_parse++);
2093 while (isDIGIT(*RExC_parse))
2095 ret = reganode(pRExC_state, GROUPP, parno);
2096 if ((c = *nextchar(pRExC_state)) != ')')
2097 vFAIL("Switch condition not recognized");
2099 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2100 br = regbranch(pRExC_state, &flags, 1);
2102 br = reganode(pRExC_state, LONGJMP, 0);
2104 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2105 c = *nextchar(pRExC_state);
2109 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2110 regbranch(pRExC_state, &flags, 1);
2111 regtail(pRExC_state, ret, lastbr);
2114 c = *nextchar(pRExC_state);
2119 vFAIL("Switch (?(condition)... contains too many branches");
2120 ender = reg_node(pRExC_state, TAIL);
2121 regtail(pRExC_state, br, ender);
2123 regtail(pRExC_state, lastbr, ender);
2124 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2127 regtail(pRExC_state, ret, ender);
2131 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2135 RExC_parse--; /* for vFAIL to print correctly */
2136 vFAIL("Sequence (? incomplete");
2141 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2142 if (*RExC_parse != 'o')
2143 pmflag(flagsp, *RExC_parse);
2146 if (*RExC_parse == '-') {
2151 RExC_flags16 |= posflags;
2152 RExC_flags16 &= ~negflags;
2153 if (*RExC_parse == ':') {
2159 if (*RExC_parse != ')') {
2161 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2163 nextchar(pRExC_state);
2171 ret = reganode(pRExC_state, OPEN, parno);
2178 /* Pick up the branches, linking them together. */
2179 br = regbranch(pRExC_state, &flags, 1);
2182 if (*RExC_parse == '|') {
2183 if (!SIZE_ONLY && RExC_extralen) {
2184 reginsert(pRExC_state, BRANCHJ, br);
2187 reginsert(pRExC_state, BRANCH, br);
2190 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2192 else if (paren == ':') {
2193 *flagp |= flags&SIMPLE;
2195 if (open) { /* Starts with OPEN. */
2196 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2198 else if (paren != '?') /* Not Conditional */
2202 *flagp |= flags&SPSTART;
2204 while (*RExC_parse == '|') {
2205 if (!SIZE_ONLY && RExC_extralen) {
2206 ender = reganode(pRExC_state, LONGJMP,0);
2207 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2210 RExC_extralen += 2; /* Account for LONGJMP. */
2211 nextchar(pRExC_state);
2212 br = regbranch(pRExC_state, &flags, 0);
2215 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2219 *flagp |= flags&SPSTART;
2222 if (have_branch || paren != ':') {
2223 /* Make a closing node, and hook it on the end. */
2226 ender = reg_node(pRExC_state, TAIL);
2229 ender = reganode(pRExC_state, CLOSE, parno);
2235 *flagp &= ~HASWIDTH;
2238 ender = reg_node(pRExC_state, SUCCEED);
2241 ender = reg_node(pRExC_state, END);
2244 regtail(pRExC_state, lastbr, ender);
2247 /* Hook the tails of the branches to the closing node. */
2248 for (br = ret; br != NULL; br = regnext(br)) {
2249 regoptail(pRExC_state, br, ender);
2256 static char parens[] = "=!<,>";
2258 if (paren && (p = strchr(parens, paren))) {
2259 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2260 int flag = (p - parens) > 1;
2263 node = SUSPEND, flag = 0;
2264 reginsert(pRExC_state, node,ret);
2266 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2270 /* Check for proper termination. */
2272 RExC_flags16 = oregflags;
2273 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2274 RExC_parse = oregcomp_parse;
2275 vFAIL("Unmatched (");
2278 else if (!paren && RExC_parse < RExC_end) {
2279 if (*RExC_parse == ')') {
2281 vFAIL("Unmatched )");
2284 FAIL("Junk on end of regexp"); /* "Can't happen". */
2292 - regbranch - one alternative of an | operator
2294 * Implements the concatenation operator.
2297 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2299 register regnode *ret;
2300 register regnode *chain = NULL;
2301 register regnode *latest;
2302 I32 flags = 0, c = 0;
2307 if (!SIZE_ONLY && RExC_extralen)
2308 ret = reganode(pRExC_state, BRANCHJ,0);
2310 ret = reg_node(pRExC_state, BRANCH);
2313 if (!first && SIZE_ONLY)
2314 RExC_extralen += 1; /* BRANCHJ */
2316 *flagp = WORST; /* Tentatively. */
2319 nextchar(pRExC_state);
2320 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2322 latest = regpiece(pRExC_state, &flags);
2323 if (latest == NULL) {
2324 if (flags & TRYAGAIN)
2328 else if (ret == NULL)
2330 *flagp |= flags&HASWIDTH;
2331 if (chain == NULL) /* First piece. */
2332 *flagp |= flags&SPSTART;
2335 regtail(pRExC_state, chain, latest);
2340 if (chain == NULL) { /* Loop ran zero times. */
2341 chain = reg_node(pRExC_state, NOTHING);
2346 *flagp |= flags&SIMPLE;
2353 - regpiece - something followed by possible [*+?]
2355 * Note that the branching code sequences used for ? and the general cases
2356 * of * and + are somewhat optimized: they use the same NOTHING node as
2357 * both the endmarker for their branch list and the body of the last branch.
2358 * It might seem that this node could be dispensed with entirely, but the
2359 * endmarker role is not redundant.
2362 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2364 register regnode *ret;
2366 register char *next;
2368 char *origparse = RExC_parse;
2371 I32 max = REG_INFTY;
2373 ret = regatom(pRExC_state, &flags);
2375 if (flags & TRYAGAIN)
2382 if (op == '{' && regcurly(RExC_parse)) {
2383 next = RExC_parse + 1;
2385 while (isDIGIT(*next) || *next == ',') {
2394 if (*next == '}') { /* got one */
2398 min = atoi(RExC_parse);
2402 maxpos = RExC_parse;
2404 if (!max && *maxpos != '0')
2405 max = REG_INFTY; /* meaning "infinity" */
2406 else if (max >= REG_INFTY)
2407 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2409 nextchar(pRExC_state);
2412 if ((flags&SIMPLE)) {
2413 RExC_naughty += 2 + RExC_naughty / 2;
2414 reginsert(pRExC_state, CURLY, ret);
2417 regnode *w = reg_node(pRExC_state, WHILEM);
2420 regtail(pRExC_state, ret, w);
2421 if (!SIZE_ONLY && RExC_extralen) {
2422 reginsert(pRExC_state, LONGJMP,ret);
2423 reginsert(pRExC_state, NOTHING,ret);
2424 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2426 reginsert(pRExC_state, CURLYX,ret);
2427 if (!SIZE_ONLY && RExC_extralen)
2428 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2429 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2431 RExC_whilem_seen++, RExC_extralen += 3;
2432 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2440 if (max && max < min)
2441 vFAIL("Can't do {n,m} with n > m");
2456 #if 0 /* Now runtime fix should be reliable. */
2458 /* if this is reinstated, don't forget to put this back into perldiag:
2460 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2462 (F) The part of the regexp subject to either the * or + quantifier
2463 could match an empty string. The {#} shows in the regular
2464 expression about where the problem was discovered.
2468 if (!(flags&HASWIDTH) && op != '?')
2469 vFAIL("Regexp *+ operand could be empty");
2472 nextchar(pRExC_state);
2474 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2476 if (op == '*' && (flags&SIMPLE)) {
2477 reginsert(pRExC_state, STAR, ret);
2481 else if (op == '*') {
2485 else if (op == '+' && (flags&SIMPLE)) {
2486 reginsert(pRExC_state, PLUS, ret);
2490 else if (op == '+') {
2494 else if (op == '?') {
2499 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2501 "%.*s matches null string many times",
2502 RExC_parse - origparse,
2506 if (*RExC_parse == '?') {
2507 nextchar(pRExC_state);
2508 reginsert(pRExC_state, MINMOD, ret);
2509 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2511 if (ISMULT2(RExC_parse)) {
2513 vFAIL("Nested quantifiers");
2520 - regatom - the lowest level
2522 * Optimization: gobbles an entire sequence of ordinary characters so that
2523 * it can turn them into a single node, which is smaller to store and
2524 * faster to run. Backslashed characters are exceptions, each becoming a
2525 * separate node; the code is simpler that way and it's not worth fixing.
2527 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2529 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2531 register regnode *ret = 0;
2534 *flagp = WORST; /* Tentatively. */
2537 switch (*RExC_parse) {
2539 RExC_seen_zerolen++;
2540 nextchar(pRExC_state);
2541 if (RExC_flags16 & PMf_MULTILINE)
2542 ret = reg_node(pRExC_state, MBOL);
2543 else if (RExC_flags16 & PMf_SINGLELINE)
2544 ret = reg_node(pRExC_state, SBOL);
2546 ret = reg_node(pRExC_state, BOL);
2549 nextchar(pRExC_state);
2551 RExC_seen_zerolen++;
2552 if (RExC_flags16 & PMf_MULTILINE)
2553 ret = reg_node(pRExC_state, MEOL);
2554 else if (RExC_flags16 & PMf_SINGLELINE)
2555 ret = reg_node(pRExC_state, SEOL);
2557 ret = reg_node(pRExC_state, EOL);
2560 nextchar(pRExC_state);
2561 if (RExC_flags16 & PMf_SINGLELINE)
2562 ret = reg_node(pRExC_state, SANY);
2564 ret = reg_node(pRExC_state, REG_ANY);
2565 *flagp |= HASWIDTH|SIMPLE;
2570 char *oregcomp_parse = ++RExC_parse;
2571 ret = regclass(pRExC_state);
2572 if (*RExC_parse != ']') {
2573 RExC_parse = oregcomp_parse;
2574 vFAIL("Unmatched [");
2576 nextchar(pRExC_state);
2577 *flagp |= HASWIDTH|SIMPLE;
2581 nextchar(pRExC_state);
2582 ret = reg(pRExC_state, 1, &flags);
2584 if (flags & TRYAGAIN) {
2585 if (RExC_parse == RExC_end) {
2586 /* Make parent create an empty node if needed. */
2594 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2598 if (flags & TRYAGAIN) {
2602 vFAIL("Internal urp");
2603 /* Supposed to be caught earlier. */
2606 if (!regcurly(RExC_parse)) {
2615 vFAIL("Quantifier follows nothing");
2618 switch (*++RExC_parse) {
2620 RExC_seen_zerolen++;
2621 ret = reg_node(pRExC_state, SBOL);
2623 nextchar(pRExC_state);
2626 ret = reg_node(pRExC_state, GPOS);
2627 RExC_seen |= REG_SEEN_GPOS;
2629 nextchar(pRExC_state);
2632 ret = reg_node(pRExC_state, SEOL);
2634 nextchar(pRExC_state);
2637 ret = reg_node(pRExC_state, EOS);
2639 RExC_seen_zerolen++; /* Do not optimize RE away */
2640 nextchar(pRExC_state);
2643 ret = reg_node(pRExC_state, SANY);
2644 *flagp |= HASWIDTH|SIMPLE;
2645 nextchar(pRExC_state);
2648 ret = reg_node(pRExC_state, CLUMP);
2650 nextchar(pRExC_state);
2651 if (UTF && !PL_utf8_mark)
2652 is_utf8_mark((U8*)"~"); /* preload table */
2655 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2656 *flagp |= HASWIDTH|SIMPLE;
2657 nextchar(pRExC_state);
2658 if (UTF && !PL_utf8_alnum)
2659 is_utf8_alnum((U8*)"a"); /* preload table */
2662 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2663 *flagp |= HASWIDTH|SIMPLE;
2664 nextchar(pRExC_state);
2665 if (UTF && !PL_utf8_alnum)
2666 is_utf8_alnum((U8*)"a"); /* preload table */
2669 RExC_seen_zerolen++;
2670 RExC_seen |= REG_SEEN_LOOKBEHIND;
2671 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2673 nextchar(pRExC_state);
2674 if (UTF && !PL_utf8_alnum)
2675 is_utf8_alnum((U8*)"a"); /* preload table */
2678 RExC_seen_zerolen++;
2679 RExC_seen |= REG_SEEN_LOOKBEHIND;
2680 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2682 nextchar(pRExC_state);
2683 if (UTF && !PL_utf8_alnum)
2684 is_utf8_alnum((U8*)"a"); /* preload table */
2687 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2688 *flagp |= HASWIDTH|SIMPLE;
2689 nextchar(pRExC_state);
2690 if (UTF && !PL_utf8_space)
2691 is_utf8_space((U8*)" "); /* preload table */
2694 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2695 *flagp |= HASWIDTH|SIMPLE;
2696 nextchar(pRExC_state);
2697 if (UTF && !PL_utf8_space)
2698 is_utf8_space((U8*)" "); /* preload table */
2701 ret = reg_node(pRExC_state, DIGIT);
2702 *flagp |= HASWIDTH|SIMPLE;
2703 nextchar(pRExC_state);
2704 if (UTF && !PL_utf8_digit)
2705 is_utf8_digit((U8*)"1"); /* preload table */
2708 ret = reg_node(pRExC_state, NDIGIT);
2709 *flagp |= HASWIDTH|SIMPLE;
2710 nextchar(pRExC_state);
2711 if (UTF && !PL_utf8_digit)
2712 is_utf8_digit((U8*)"1"); /* preload table */
2716 { /* a lovely hack--pretend we saw [\pX] instead */
2717 char* oldregxend = RExC_end;
2719 if (RExC_parse[1] == '{') {
2720 RExC_end = strchr(RExC_parse, '}');
2723 RExC_end = oldregxend;
2724 vFAIL("Missing right brace on \\p{}");
2729 RExC_end = RExC_parse + 2;
2732 ret = regclass(pRExC_state);
2734 RExC_end = oldregxend;
2736 nextchar(pRExC_state);
2737 *flagp |= HASWIDTH|SIMPLE;
2750 case '1': case '2': case '3': case '4':
2751 case '5': case '6': case '7': case '8': case '9':
2753 I32 num = atoi(RExC_parse);
2755 if (num > 9 && num >= RExC_npar)
2758 while (isDIGIT(*RExC_parse))
2761 if (!SIZE_ONLY && num > RExC_rx->nparens)
2762 vFAIL("Reference to nonexistent group");
2764 ret = reganode(pRExC_state, FOLD
2765 ? (LOC ? REFFL : REFF)
2769 nextchar(pRExC_state);
2774 if (RExC_parse >= RExC_end)
2775 FAIL("Trailing \\");
2778 /* Do not generate `unrecognized' warnings here, we fall
2779 back into the quick-grab loop below */
2785 if (RExC_flags16 & PMf_EXTENDED) {
2786 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2787 if (RExC_parse < RExC_end)
2793 register STRLEN len;
2802 ret = reg_node(pRExC_state, FOLD
2803 ? (LOC ? EXACTFL : EXACTF)
2806 for (len = 0, p = RExC_parse - 1;
2807 len < 127 && p < RExC_end;
2812 if (RExC_flags16 & PMf_EXTENDED)
2813 p = regwhite(p, RExC_end);
2875 char* e = strchr(p, '}');
2879 vFAIL("Missing right brace on \\x{}");
2882 numlen = 1; /* allow underscores */
2883 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2884 /* numlen is generous */
2885 if (numlen + len >= 127) {
2893 numlen = 0; /* disallow underscores */
2894 ender = (UV)scan_hex(p, 2, &numlen);
2900 ender = UCHARAT(p++);
2901 ender = toCTRL(ender);
2903 case '0': case '1': case '2': case '3':case '4':
2904 case '5': case '6': case '7': case '8':case '9':
2906 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
2907 numlen = 0; /* disallow underscores */
2908 ender = (UV)scan_oct(p, 3, &numlen);
2918 FAIL("Trailing \\");
2921 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2922 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
2923 goto normal_default;
2928 if (UTF8_IS_START(*p) && UTF) {
2929 ender = utf8_to_uv((U8*)p, RExC_end - p,
2937 if (RExC_flags16 & PMf_EXTENDED)
2938 p = regwhite(p, RExC_end);
2941 ender = toLOWER_LC_uni(ender);
2943 ender = toLOWER_uni(ender);
2945 if (ISMULT2(p)) { /* Back off on ?+*. */
2948 /* ender is a Unicode value so it can be > 0xff --
2949 * in other words, do not use UTF8_IS_CONTINUED(). */
2950 else if (ender >= 0x80 && UTF) {
2951 reguni(pRExC_state, ender, s, &numlen);
2961 /* ender is a Unicode value so it can be > 0xff --
2962 * in other words, do not use UTF8_IS_CONTINUED(). */
2963 if (ender >= 0x80 && UTF) {
2964 reguni(pRExC_state, ender, s, &numlen);
2973 nextchar(pRExC_state);
2975 /* len is STRLEN which is unsigned, need to copy to signed */
2978 vFAIL("Internal disaster");
2987 RExC_size += STR_SZ(len);
2989 RExC_emit += STR_SZ(len);
2998 S_regwhite(pTHX_ char *p, char *e)
3003 else if (*p == '#') {
3006 } while (p < e && *p != '\n');
3014 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3015 Character classes ([:foo:]) can also be negated ([:^foo:]).
3016 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3017 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3018 but trigger warnings because they are currently unimplemented. */
3020 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3023 I32 namedclass = OOB_NAMEDCLASS;
3025 if (value == '[' && RExC_parse + 1 < RExC_end &&
3026 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3027 (*RExC_parse == ':' ||
3028 *RExC_parse == '=' ||
3029 *RExC_parse == '.')) {
3030 char c = *RExC_parse;
3031 char* s = RExC_parse++;
3033 while (RExC_parse < RExC_end && *RExC_parse != c)
3035 if (RExC_parse == RExC_end)
3036 /* Grandfather lone [:, [=, [. */
3039 char* t = RExC_parse++; /* skip over the c */
3041 if (*RExC_parse == ']') {
3042 RExC_parse++; /* skip over the ending ] */
3045 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3046 I32 skip = 5; /* the most common skip */
3050 if (strnEQ(posixcc, "alnum", 5))
3052 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3053 else if (strnEQ(posixcc, "alpha", 5))
3055 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3056 else if (strnEQ(posixcc, "ascii", 5))
3058 complement ? ANYOF_NASCII : ANYOF_ASCII;
3061 if (strnEQ(posixcc, "blank", 5))
3063 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3066 if (strnEQ(posixcc, "cntrl", 5))
3068 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3071 if (strnEQ(posixcc, "digit", 5))
3073 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3076 if (strnEQ(posixcc, "graph", 5))
3078 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3081 if (strnEQ(posixcc, "lower", 5))
3083 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3086 if (strnEQ(posixcc, "print", 5))
3088 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3089 else if (strnEQ(posixcc, "punct", 5))
3091 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3094 if (strnEQ(posixcc, "space", 5))
3096 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3099 if (strnEQ(posixcc, "upper", 5))
3101 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3103 case 'w': /* this is not POSIX, this is the Perl \w */
3104 if (strnEQ(posixcc, "word", 4)) {
3106 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3111 if (strnEQ(posixcc, "xdigit", 6)) {
3113 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3118 if (namedclass == OOB_NAMEDCLASS ||
3119 posixcc[skip] != ':' ||
3120 posixcc[skip+1] != ']')
3122 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3125 } else if (!SIZE_ONLY) {
3126 /* [[=foo=]] and [[.foo.]] are still future. */
3128 /* adjust RExC_parse so the warning shows after
3130 while (*RExC_parse && *RExC_parse != ']')
3132 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3135 /* Maternal grandfather:
3136 * "[:" ending in ":" but not in ":]" */
3146 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3148 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3149 (*RExC_parse == ':' ||
3150 *RExC_parse == '=' ||
3151 *RExC_parse == '.')) {
3152 char *s = RExC_parse;
3155 while(*s && isALNUM(*s))
3157 if (*s && c == *s && s[1] == ']') {
3158 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3160 /* [[=foo=]] and [[.foo.]] are still future. */
3161 if (c == '=' || c == '.')
3163 /* adjust RExC_parse so the error shows after
3165 while (*RExC_parse && *RExC_parse++ != ']')
3167 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3174 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3177 register IV lastvalue = OOB_UNICODE;
3178 register IV range = 0;
3179 register regnode *ret;
3183 bool need_class = 0;
3187 bool dont_optimize_invert = FALSE;
3189 ret = reganode(pRExC_state, ANYOF, 0);
3192 ANYOF_FLAGS(ret) = 0;
3194 if (*RExC_parse == '^') { /* Complement of range. */
3198 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3202 RExC_size += ANYOF_SKIP;
3204 RExC_emit += ANYOF_SKIP;
3206 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3208 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3209 ANYOF_BITMAP_ZERO(ret);
3210 listsv = newSVpvn("# comment\n", 10);
3213 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3214 checkposixcc(pRExC_state);
3216 if (*RExC_parse == ']' || *RExC_parse == '-')
3217 goto charclassloop; /* allow 1st char to be ] or - */
3219 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3223 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3226 rangebegin = RExC_parse;
3228 value = utf8_to_uv((U8*)RExC_parse,
3229 RExC_end - RExC_parse,
3231 RExC_parse += numlen;
3234 value = UCHARAT(RExC_parse++);
3236 namedclass = regpposixcc(pRExC_state, value);
3237 else if (value == '\\') {
3239 value = utf8_to_uv((U8*)RExC_parse,
3240 RExC_end - RExC_parse,
3242 RExC_parse += numlen;
3245 value = UCHARAT(RExC_parse++);
3246 /* Some compilers cannot handle switching on 64-bit integer
3247 * values, therefore value cannot be an UV. Yes, this will
3248 * be a problem later if we want switch on Unicode.
3249 * A similar issue a little bit later when switching on
3250 * namedclass. --jhi */
3251 switch ((I32)value) {
3252 case 'w': namedclass = ANYOF_ALNUM; break;
3253 case 'W': namedclass = ANYOF_NALNUM; break;
3254 case 's': namedclass = ANYOF_SPACE; break;
3255 case 'S': namedclass = ANYOF_NSPACE; break;
3256 case 'd': namedclass = ANYOF_DIGIT; break;
3257 case 'D': namedclass = ANYOF_NDIGIT; break;
3260 if (*RExC_parse == '{') {
3261 e = strchr(RExC_parse++, '}');
3263 vFAIL("Missing right brace on \\p{}");
3272 Perl_sv_catpvf(aTHX_ listsv,
3273 "+utf8::%.*s\n", (int)n, RExC_parse);
3275 Perl_sv_catpvf(aTHX_ listsv,
3276 "!utf8::%.*s\n", (int)n, RExC_parse);
3279 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3281 case 'n': value = '\n'; break;
3282 case 'r': value = '\r'; break;
3283 case 't': value = '\t'; break;
3284 case 'f': value = '\f'; break;
3285 case 'b': value = '\b'; break;
3287 case 'e': value = '\033'; break;
3288 case 'a': value = '\007'; break;
3290 case 'e': value = '\047'; break;
3291 case 'a': value = '\057'; break;
3294 if (*RExC_parse == '{') {
3295 e = strchr(RExC_parse++, '}');
3297 vFAIL("Missing right brace on \\x{}");
3298 numlen = 1; /* allow underscores */
3299 value = (UV)scan_hex(RExC_parse,
3305 numlen = 0; /* disallow underscores */
3306 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3307 RExC_parse += numlen;
3311 value = UCHARAT(RExC_parse++);
3312 value = toCTRL(value);
3314 case '0': case '1': case '2': case '3': case '4':
3315 case '5': case '6': case '7': case '8': case '9':
3316 numlen = 0; /* disallow underscores */
3317 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3318 RExC_parse += numlen;
3321 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3323 "Unrecognized escape \\%c in character class passed through",
3327 } /* end of \blah */
3329 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3331 if (!SIZE_ONLY && !need_class)
3332 ANYOF_CLASS_ZERO(ret);
3336 /* a bad range like a-\d, a-[:digit:] ? */
3339 if (ckWARN(WARN_REGEXP))
3341 "False [] range \"%*.*s\"",
3342 RExC_parse - rangebegin,
3343 RExC_parse - rangebegin,
3345 if (lastvalue < 256) {
3346 ANYOF_BITMAP_SET(ret, lastvalue);
3347 ANYOF_BITMAP_SET(ret, '-');
3350 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3351 Perl_sv_catpvf(aTHX_ listsv,
3352 /* 0x002D is Unicode for '-' */
3353 "%04"UVxf"\n002D\n", (UV)lastvalue);
3357 range = 0; /* this was not a true range */
3361 /* Possible truncation here but in some 64-bit environments
3362 * the compiler gets heartburn about switch on 64-bit values.
3363 * A similar issue a little earlier when switching on value.
3365 switch ((I32)namedclass) {
3368 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3370 for (value = 0; value < 256; value++)
3372 ANYOF_BITMAP_SET(ret, value);
3374 dont_optimize_invert = TRUE;
3375 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3379 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3381 for (value = 0; value < 256; value++)
3382 if (!isALNUM(value))
3383 ANYOF_BITMAP_SET(ret, value);
3385 dont_optimize_invert = TRUE;
3386 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3390 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3392 for (value = 0; value < 256; value++)
3393 if (isALNUMC(value))
3394 ANYOF_BITMAP_SET(ret, value);
3396 dont_optimize_invert = TRUE;
3397 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3401 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3403 for (value = 0; value < 256; value++)
3404 if (!isALNUMC(value))
3405 ANYOF_BITMAP_SET(ret, value);
3407 dont_optimize_invert = TRUE;
3408 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3412 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3414 for (value = 0; value < 256; value++)
3416 ANYOF_BITMAP_SET(ret, value);
3418 dont_optimize_invert = TRUE;
3419 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3423 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3425 for (value = 0; value < 256; value++)
3426 if (!isALPHA(value))
3427 ANYOF_BITMAP_SET(ret, value);
3429 dont_optimize_invert = TRUE;
3430 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3434 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3437 for (value = 0; value < 128; value++)
3438 ANYOF_BITMAP_SET(ret, value);
3440 for (value = 0; value < 256; value++)
3442 ANYOF_BITMAP_SET(ret, value);
3445 dont_optimize_invert = TRUE;
3446 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3450 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3453 for (value = 128; value < 256; value++)
3454 ANYOF_BITMAP_SET(ret, value);
3456 for (value = 0; value < 256; value++)
3457 if (!isASCII(value))
3458 ANYOF_BITMAP_SET(ret, value);
3461 dont_optimize_invert = TRUE;
3462 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3466 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3468 for (value = 0; value < 256; value++)
3470 ANYOF_BITMAP_SET(ret, value);
3472 dont_optimize_invert = TRUE;
3473 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3477 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3479 for (value = 0; value < 256; value++)
3480 if (!isBLANK(value))
3481 ANYOF_BITMAP_SET(ret, value);
3483 dont_optimize_invert = TRUE;
3484 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3488 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3490 for (value = 0; value < 256; value++)
3492 ANYOF_BITMAP_SET(ret, value);
3494 dont_optimize_invert = TRUE;
3495 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3499 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3501 for (value = 0; value < 256; value++)
3502 if (!isCNTRL(value))
3503 ANYOF_BITMAP_SET(ret, value);
3505 dont_optimize_invert = TRUE;
3506 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3510 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3512 /* consecutive digits assumed */
3513 for (value = '0'; value <= '9'; value++)
3514 ANYOF_BITMAP_SET(ret, value);
3516 dont_optimize_invert = TRUE;
3517 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3521 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3523 /* consecutive digits assumed */
3524 for (value = 0; value < '0'; value++)
3525 ANYOF_BITMAP_SET(ret, value);
3526 for (value = '9' + 1; value < 256; value++)
3527 ANYOF_BITMAP_SET(ret, value);
3529 dont_optimize_invert = TRUE;
3530 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3534 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3536 for (value = 0; value < 256; value++)
3538 ANYOF_BITMAP_SET(ret, value);
3540 dont_optimize_invert = TRUE;
3541 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3545 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3547 for (value = 0; value < 256; value++)
3548 if (!isGRAPH(value))
3549 ANYOF_BITMAP_SET(ret, value);
3551 dont_optimize_invert = TRUE;
3552 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3556 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3558 for (value = 0; value < 256; value++)
3560 ANYOF_BITMAP_SET(ret, value);
3562 dont_optimize_invert = TRUE;
3563 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3567 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3569 for (value = 0; value < 256; value++)
3570 if (!isLOWER(value))
3571 ANYOF_BITMAP_SET(ret, value);
3573 dont_optimize_invert = TRUE;
3574 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3578 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3580 for (value = 0; value < 256; value++)
3582 ANYOF_BITMAP_SET(ret, value);
3584 dont_optimize_invert = TRUE;
3585 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3589 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3591 for (value = 0; value < 256; value++)
3592 if (!isPRINT(value))
3593 ANYOF_BITMAP_SET(ret, value);
3595 dont_optimize_invert = TRUE;
3596 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3600 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3602 for (value = 0; value < 256; value++)
3603 if (isPSXSPC(value))
3604 ANYOF_BITMAP_SET(ret, value);
3606 dont_optimize_invert = TRUE;
3607 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3611 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3613 for (value = 0; value < 256; value++)
3614 if (!isPSXSPC(value))
3615 ANYOF_BITMAP_SET(ret, value);
3617 dont_optimize_invert = TRUE;
3618 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3622 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3624 for (value = 0; value < 256; value++)
3626 ANYOF_BITMAP_SET(ret, value);
3628 dont_optimize_invert = TRUE;
3629 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3633 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3635 for (value = 0; value < 256; value++)
3636 if (!isPUNCT(value))
3637 ANYOF_BITMAP_SET(ret, value);
3639 dont_optimize_invert = TRUE;
3640 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3644 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3646 for (value = 0; value < 256; value++)
3648 ANYOF_BITMAP_SET(ret, value);
3650 dont_optimize_invert = TRUE;
3651 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3655 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3657 for (value = 0; value < 256; value++)
3658 if (!isSPACE(value))
3659 ANYOF_BITMAP_SET(ret, value);
3661 dont_optimize_invert = TRUE;
3662 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3666 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3668 for (value = 0; value < 256; value++)
3670 ANYOF_BITMAP_SET(ret, value);
3672 dont_optimize_invert = TRUE;
3673 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3677 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3679 for (value = 0; value < 256; value++)
3680 if (!isUPPER(value))
3681 ANYOF_BITMAP_SET(ret, value);
3683 dont_optimize_invert = TRUE;
3684 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3688 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3690 for (value = 0; value < 256; value++)
3691 if (isXDIGIT(value))
3692 ANYOF_BITMAP_SET(ret, value);
3694 dont_optimize_invert = TRUE;
3695 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3699 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3701 for (value = 0; value < 256; value++)
3702 if (!isXDIGIT(value))
3703 ANYOF_BITMAP_SET(ret, value);
3705 dont_optimize_invert = TRUE;
3706 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3709 vFAIL("Invalid [::] class");
3713 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3716 } /* end of namedclass \blah */
3719 if (lastvalue > value) /* b-a */ {
3720 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3721 RExC_parse - rangebegin,
3722 RExC_parse - rangebegin,
3725 range = 0; /* not a true range */
3728 lastvalue = value; /* save the beginning of the range */
3729 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3730 RExC_parse[1] != ']') {
3733 /* a bad range like \w-, [:word:]- ? */
3734 if (namedclass > OOB_NAMEDCLASS) {
3735 if (ckWARN(WARN_REGEXP))
3737 "False [] range \"%*.*s\"",
3738 RExC_parse - rangebegin,
3739 RExC_parse - rangebegin,
3742 ANYOF_BITMAP_SET(ret, '-');
3744 range = 1; /* yeah, it's a range! */
3745 continue; /* but do it the next time */
3749 /* now is the next time */
3751 if (lastvalue < 256 && value < 256) {
3752 #ifndef ASCIIish /* EBCDIC, for example. */
3753 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3754 (isUPPER(lastvalue) && isUPPER(value)))
3757 if (isLOWER(lastvalue)) {
3758 for (i = lastvalue; i <= value; i++)
3760 ANYOF_BITMAP_SET(ret, i);
3762 for (i = lastvalue; i <= value; i++)
3764 ANYOF_BITMAP_SET(ret, i);
3769 for ( ; lastvalue <= value; lastvalue++)
3770 ANYOF_BITMAP_SET(ret, lastvalue);
3772 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3773 if (lastvalue < value)
3774 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3775 (UV)lastvalue, (UV)value);
3777 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3782 range = 0; /* this range (if it was one) is done now */
3787 RExC_size += ANYOF_CLASS_ADD_SKIP;
3789 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3792 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3795 /* If the only flag is folding (plus possibly inversion). */
3796 (ANYOF_FLAGS_ALL ^ ANYOF_INVERT) == ANYOF_FOLD)) {
3797 for (value = 0; value < 256; ++value) {
3798 if (ANYOF_BITMAP_TEST(ret, value)) {
3799 IV fold = PL_fold[value];
3802 ANYOF_BITMAP_SET(ret, fold);
3805 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3808 /* optimize inverted simple patterns (e.g. [^a-z]) */
3809 if (!SIZE_ONLY && !dont_optimize_invert &&
3810 /* If the only flag is inversion. */
3811 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3812 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3813 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3814 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
3821 av_store(av, 0, listsv);
3822 av_store(av, 1, NULL);
3823 rv = newRV_noinc((SV*)av);
3824 n = add_data(pRExC_state, 1, "s");
3825 RExC_rx->data->data[n] = (void*)rv;
3833 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3835 char* retval = RExC_parse++;
3838 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3839 RExC_parse[2] == '#') {
3840 while (*RExC_parse && *RExC_parse != ')')
3845 if (RExC_flags16 & PMf_EXTENDED) {
3846 if (isSPACE(*RExC_parse)) {
3850 else if (*RExC_parse == '#') {
3851 while (*RExC_parse && *RExC_parse != '\n')
3862 - reg_node - emit a node
3864 STATIC regnode * /* Location. */
3865 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3867 register regnode *ret;
3868 register regnode *ptr;
3872 SIZE_ALIGN(RExC_size);
3877 NODE_ALIGN_FILL(ret);
3879 FILL_ADVANCE_NODE(ptr, op);
3886 - reganode - emit a node with an argument
3888 STATIC regnode * /* Location. */
3889 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
3891 register regnode *ret;
3892 register regnode *ptr;
3896 SIZE_ALIGN(RExC_size);
3901 NODE_ALIGN_FILL(ret);
3903 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3910 - reguni - emit (if appropriate) a Unicode character
3913 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
3915 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uv_to_utf8((U8*)s, uv) - (U8*)s);
3919 - reginsert - insert an operator in front of already-emitted operand
3921 * Means relocating the operand.
3924 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
3926 register regnode *src;
3927 register regnode *dst;
3928 register regnode *place;
3929 register int offset = regarglen[(U8)op];
3931 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3934 RExC_size += NODE_STEP_REGNODE + offset;
3939 RExC_emit += NODE_STEP_REGNODE + offset;
3942 StructCopy(--src, --dst, regnode);
3944 place = opnd; /* Op node, where operand used to be. */
3945 src = NEXTOPER(place);
3946 FILL_ADVANCE_NODE(place, op);
3947 Zero(src, offset, regnode);
3951 - regtail - set the next-pointer at the end of a node chain of p to val.
3954 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
3956 register regnode *scan;
3957 register regnode *temp;
3962 /* Find last node. */
3965 temp = regnext(scan);
3971 if (reg_off_by_arg[OP(scan)]) {
3972 ARG_SET(scan, val - scan);
3975 NEXT_OFF(scan) = val - scan;
3980 - regoptail - regtail on operand of first argument; nop if operandless
3983 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
3985 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3986 if (p == NULL || SIZE_ONLY)
3988 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3989 regtail(pRExC_state, NEXTOPER(p), val);
3991 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3992 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
3999 - regcurly - a little FSA that accepts {\d+,?\d*}
4002 S_regcurly(pTHX_ register char *s)
4021 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4024 register U8 op = EXACT; /* Arbitrary non-END op. */
4025 register regnode *next;
4027 while (op != END && (!last || node < last)) {
4028 /* While that wasn't END last time... */
4034 next = regnext(node);
4036 if (OP(node) == OPTIMIZED)
4039 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4040 (int)(2*l + 1), "", SvPVX(sv));
4041 if (next == NULL) /* Next ptr. */
4042 PerlIO_printf(Perl_debug_log, "(0)");
4044 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4045 (void)PerlIO_putc(Perl_debug_log, '\n');
4047 if (PL_regkind[(U8)op] == BRANCHJ) {
4048 register regnode *nnode = (OP(next) == LONGJMP
4051 if (last && nnode > last)
4053 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4055 else if (PL_regkind[(U8)op] == BRANCH) {
4056 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4058 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4059 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4060 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4062 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4063 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4066 else if ( op == PLUS || op == STAR) {
4067 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4069 else if (op == ANYOF) {
4070 node = NEXTOPER(node);
4073 else if (PL_regkind[(U8)op] == EXACT) {
4074 /* Literal string, where present. */
4075 node += NODE_SZ_STR(node) - 1;
4076 node = NEXTOPER(node);
4079 node = NEXTOPER(node);
4080 node += regarglen[(U8)op];
4082 if (op == CURLYX || op == OPEN)
4084 else if (op == WHILEM)
4087 #endif /* DEBUGGING */
4092 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4095 Perl_regdump(pTHX_ regexp *r)
4098 SV *sv = sv_newmortal();
4100 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4102 /* Header fields of interest. */
4103 if (r->anchored_substr)
4104 PerlIO_printf(Perl_debug_log,
4105 "anchored `%s%.*s%s'%s at %"IVdf" ",
4107 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4108 SvPVX(r->anchored_substr),
4110 SvTAIL(r->anchored_substr) ? "$" : "",
4111 (IV)r->anchored_offset);
4112 if (r->float_substr)
4113 PerlIO_printf(Perl_debug_log,
4114 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4116 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4117 SvPVX(r->float_substr),
4119 SvTAIL(r->float_substr) ? "$" : "",
4120 (IV)r->float_min_offset, (UV)r->float_max_offset);
4121 if (r->check_substr)
4122 PerlIO_printf(Perl_debug_log,
4123 r->check_substr == r->float_substr
4124 ? "(checking floating" : "(checking anchored");
4125 if (r->reganch & ROPT_NOSCAN)
4126 PerlIO_printf(Perl_debug_log, " noscan");
4127 if (r->reganch & ROPT_CHECK_ALL)
4128 PerlIO_printf(Perl_debug_log, " isall");
4129 if (r->check_substr)
4130 PerlIO_printf(Perl_debug_log, ") ");
4132 if (r->regstclass) {
4133 regprop(sv, r->regstclass);
4134 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4136 if (r->reganch & ROPT_ANCH) {
4137 PerlIO_printf(Perl_debug_log, "anchored");
4138 if (r->reganch & ROPT_ANCH_BOL)
4139 PerlIO_printf(Perl_debug_log, "(BOL)");
4140 if (r->reganch & ROPT_ANCH_MBOL)
4141 PerlIO_printf(Perl_debug_log, "(MBOL)");
4142 if (r->reganch & ROPT_ANCH_SBOL)
4143 PerlIO_printf(Perl_debug_log, "(SBOL)");
4144 if (r->reganch & ROPT_ANCH_GPOS)
4145 PerlIO_printf(Perl_debug_log, "(GPOS)");
4146 PerlIO_putc(Perl_debug_log, ' ');
4148 if (r->reganch & ROPT_GPOS_SEEN)
4149 PerlIO_printf(Perl_debug_log, "GPOS ");
4150 if (r->reganch & ROPT_SKIP)
4151 PerlIO_printf(Perl_debug_log, "plus ");
4152 if (r->reganch & ROPT_IMPLICIT)
4153 PerlIO_printf(Perl_debug_log, "implicit ");
4154 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4155 if (r->reganch & ROPT_EVAL_SEEN)
4156 PerlIO_printf(Perl_debug_log, "with eval ");
4157 PerlIO_printf(Perl_debug_log, "\n");
4158 #endif /* DEBUGGING */
4162 S_put_byte(pTHX_ SV *sv, int c)
4164 if (isCNTRL(c) || c == 127 || c == 255 || !isPRINT(c))
4165 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4166 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4167 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4169 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4173 - regprop - printable representation of opcode
4176 Perl_regprop(pTHX_ SV *sv, regnode *o)
4181 sv_setpvn(sv, "", 0);
4182 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4183 /* It would be nice to FAIL() here, but this may be called from
4184 regexec.c, and it would be hard to supply pRExC_state. */
4185 Perl_croak(aTHX_ "Corrupted regexp opcode");
4186 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4188 k = PL_regkind[(U8)OP(o)];
4191 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4192 STR_LEN(o), STRING(o), PL_colors[1]);
4193 else if (k == CURLY) {
4194 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4195 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4196 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4198 else if (k == WHILEM && o->flags) /* Ordinal/of */
4199 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4200 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4201 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4202 else if (k == LOGICAL)
4203 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4204 else if (k == ANYOF) {
4205 int i, rangestart = -1;
4206 U8 flags = ANYOF_FLAGS(o);
4207 const char * const anyofs[] = { /* Should be syncronized with
4208 * ANYOF_ #xdefines in regcomp.h */
4241 if (flags & ANYOF_LOCALE)
4242 sv_catpv(sv, "{loc}");
4243 if (flags & ANYOF_FOLD)
4244 sv_catpv(sv, "{i}");
4245 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4246 if (flags & ANYOF_INVERT)
4248 for (i = 0; i <= 256; i++) {
4249 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4250 if (rangestart == -1)
4252 } else if (rangestart != -1) {
4253 if (i <= rangestart + 3)
4254 for (; rangestart < i; rangestart++)
4255 put_byte(sv, rangestart);
4257 put_byte(sv, rangestart);
4259 put_byte(sv, i - 1);
4265 if (o->flags & ANYOF_CLASS)
4266 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4267 if (ANYOF_CLASS_TEST(o,i))
4268 sv_catpv(sv, anyofs[i]);
4270 if (flags & ANYOF_UNICODE)
4271 sv_catpv(sv, "{unicode}");
4272 else if (flags & ANYOF_UNICODE_ALL)
4273 sv_catpv(sv, "{all-unicode}");
4277 SV *sw = regclass_swash(o, FALSE, &lv);
4282 U8 s[UTF8_MAXLEN+1];
4284 for (i = 0; i <= 256; i++) { /* just the first 256 */
4285 U8 *e = uv_to_utf8(s, i);
4287 if (i < 256 && swash_fetch(sw, s)) {
4288 if (rangestart == -1)
4290 } else if (rangestart != -1) {
4293 if (i <= rangestart + 3)
4294 for (; rangestart < i; rangestart++) {
4295 for(e = uv_to_utf8(s, rangestart), p = s; p < e; p++)
4299 for (e = uv_to_utf8(s, rangestart), p = s; p < e; p++)
4302 for (e = uv_to_utf8(s, i - 1), p = s; p < e; p++)
4309 sv_catpv(sv, "..."); /* et cetera */
4313 char *s = savepv(SvPVX(lv));
4316 while(*s && *s != '\n') s++;
4337 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4339 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4340 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4341 #endif /* DEBUGGING */
4345 Perl_re_intuit_string(pTHX_ regexp *prog)
4346 { /* Assume that RE_INTUIT is set */
4349 char *s = SvPV(prog->check_substr,n_a);
4351 if (!PL_colorset) reginitcolors();
4352 PerlIO_printf(Perl_debug_log,
4353 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4354 PL_colors[4],PL_colors[5],PL_colors[0],
4357 (strlen(s) > 60 ? "..." : ""));
4360 return prog->check_substr;
4364 Perl_pregfree(pTHX_ struct regexp *r)
4366 DEBUG_r(if (!PL_colorset) reginitcolors());
4368 if (!r || (--r->refcnt > 0))
4370 DEBUG_r(PerlIO_printf(Perl_debug_log,
4371 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4372 PL_colors[4],PL_colors[5],PL_colors[0],
4375 (strlen(r->precomp) > 60 ? "..." : "")));
4378 Safefree(r->precomp);
4379 if (RX_MATCH_COPIED(r))
4380 Safefree(r->subbeg);
4382 if (r->anchored_substr)
4383 SvREFCNT_dec(r->anchored_substr);
4384 if (r->float_substr)
4385 SvREFCNT_dec(r->float_substr);
4386 Safefree(r->substrs);
4389 int n = r->data->count;
4390 AV* new_comppad = NULL;
4395 switch (r->data->what[n]) {
4397 SvREFCNT_dec((SV*)r->data->data[n]);
4400 Safefree(r->data->data[n]);
4403 new_comppad = (AV*)r->data->data[n];
4406 if (new_comppad == NULL)
4407 Perl_croak(aTHX_ "panic: pregfree comppad");
4408 old_comppad = PL_comppad;
4409 old_curpad = PL_curpad;
4410 /* Watch out for global destruction's random ordering. */
4411 if (SvTYPE(new_comppad) == SVt_PVAV) {
4412 PL_comppad = new_comppad;
4413 PL_curpad = AvARRAY(new_comppad);
4417 op_free((OP_4tree*)r->data->data[n]);
4418 PL_comppad = old_comppad;
4419 PL_curpad = old_curpad;
4420 SvREFCNT_dec((SV*)new_comppad);
4426 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4429 Safefree(r->data->what);
4432 Safefree(r->startp);
4438 - regnext - dig the "next" pointer out of a node
4440 * [Note, when REGALIGN is defined there are two places in regmatch()
4441 * that bypass this code for speed.]
4444 Perl_regnext(pTHX_ register regnode *p)
4446 register I32 offset;
4448 if (p == &PL_regdummy)
4451 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4459 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4462 STRLEN l1 = strlen(pat1);
4463 STRLEN l2 = strlen(pat2);
4472 Copy(pat1, buf, l1 , char);
4473 Copy(pat2, buf + l1, l2 , char);
4474 buf[l1 + l2] = '\n';
4475 buf[l1 + l2 + 1] = '\0';
4477 /* ANSI variant takes additional second argument */
4478 va_start(args, pat2);
4482 msv = vmess(buf, &args);
4484 message = SvPV(msv,l1);
4487 Copy(message, buf, l1 , char);
4488 buf[l1] = '\0'; /* Overwrite \n */
4489 Perl_croak(aTHX_ "%s", buf);
4492 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4495 Perl_save_re_context(pTHX)
4498 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4499 SAVEI32(RExC_npar); /* () count. */
4500 SAVEI32(RExC_size); /* Code size. */
4501 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4502 SAVEVPTR(RExC_rx); /* from regcomp.c */
4503 SAVEI32(RExC_seen); /* from regcomp.c */
4504 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4505 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4506 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4507 SAVEPPTR(RExC_end); /* End of input for compile */
4508 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4511 SAVEI32(PL_reg_flags); /* from regexec.c */
4513 SAVEPPTR(PL_reginput); /* String-input pointer. */
4514 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4515 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4516 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4517 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4518 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4519 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4520 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4521 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4522 PL_reg_start_tmp = 0;
4523 SAVEFREEPV(PL_reg_start_tmp);
4524 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4525 PL_reg_start_tmpl = 0;
4526 SAVEVPTR(PL_regdata);
4527 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4528 SAVEI32(PL_regnarrate); /* from regexec.c */
4529 SAVEVPTR(PL_regprogram); /* from regexec.c */
4530 SAVEINT(PL_regindent); /* from regexec.c */
4531 SAVEVPTR(PL_regcc); /* from regexec.c */
4532 SAVEVPTR(PL_curcop);
4533 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4534 SAVEVPTR(PL_reg_re); /* from regexec.c */
4535 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4536 SAVESPTR(PL_reg_sv); /* from regexec.c */
4537 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4538 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4539 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4540 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4541 SAVEI32(PL_regnpar); /* () count. */
4543 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4554 clear_re(pTHXo_ void *r)
4556 ReREFCNT_dec((regexp *)r);
projects / p5sagit/p5-mst-13.2.git / blob