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 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
851 else if (flags & SCF_DO_STCLASS_OR) {
852 /* false positive possible if the class is case-folded */
854 ANYOF_BITMAP_SET(data->start_class, uc);
856 data->start_class->flags |= ANYOF_UNICODE_ALL;
857 data->start_class->flags &= ~ANYOF_EOS;
858 cl_and(data->start_class, &and_with);
860 flags &= ~SCF_DO_STCLASS;
862 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
863 I32 l = STR_LEN(scan);
864 UV uc = *((U8*)STRING(scan));
866 /* Search for fixed substrings supports EXACT only. */
867 if (flags & SCF_DO_SUBSTR)
868 scan_commit(pRExC_state, data);
870 U8 *s = (U8 *)STRING(scan);
871 l = utf8_length(s, s + l);
872 uc = utf8_to_uv_simple(s, NULL);
875 if (data && (flags & SCF_DO_SUBSTR))
877 if (flags & SCF_DO_STCLASS_AND) {
878 /* Check whether it is compatible with what we know already! */
882 !(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
883 && !ANYOF_BITMAP_TEST(data->start_class, uc)
884 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc]))
886 ANYOF_CLASS_ZERO(data->start_class);
887 ANYOF_BITMAP_ZERO(data->start_class);
889 ANYOF_BITMAP_SET(data->start_class, uc);
890 data->start_class->flags &= ~ANYOF_EOS;
891 data->start_class->flags |= ANYOF_FOLD;
892 if (OP(scan) == EXACTFL)
893 data->start_class->flags |= ANYOF_LOCALE;
896 else if (flags & SCF_DO_STCLASS_OR) {
897 if (data->start_class->flags & ANYOF_FOLD) {
898 /* false positive possible if the class is case-folded.
899 Assume that the locale settings are the same... */
901 ANYOF_BITMAP_SET(data->start_class, uc);
902 data->start_class->flags &= ~ANYOF_EOS;
904 cl_and(data->start_class, &and_with);
906 flags &= ~SCF_DO_STCLASS;
908 else if (strchr((char*)PL_varies,OP(scan))) {
909 I32 mincount, maxcount, minnext, deltanext, fl;
910 I32 f = flags, pos_before = 0;
911 regnode *oscan = scan;
912 struct regnode_charclass_class this_class;
913 struct regnode_charclass_class *oclass = NULL;
915 switch (PL_regkind[(U8)OP(scan)]) {
916 case WHILEM: /* End of (?:...)* . */
917 scan = NEXTOPER(scan);
920 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
921 next = NEXTOPER(scan);
922 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
924 maxcount = REG_INFTY;
925 next = regnext(scan);
926 scan = NEXTOPER(scan);
930 if (flags & SCF_DO_SUBSTR)
935 if (flags & SCF_DO_STCLASS) {
937 maxcount = REG_INFTY;
938 next = regnext(scan);
939 scan = NEXTOPER(scan);
942 is_inf = is_inf_internal = 1;
943 scan = regnext(scan);
944 if (flags & SCF_DO_SUBSTR) {
945 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
946 data->longest = &(data->longest_float);
948 goto optimize_curly_tail;
950 mincount = ARG1(scan);
951 maxcount = ARG2(scan);
952 next = regnext(scan);
953 if (OP(scan) == CURLYX) {
954 I32 lp = (data ? *(data->last_closep) : 0);
956 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
958 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
960 if (flags & SCF_DO_SUBSTR) {
961 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
962 pos_before = data->pos_min;
966 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
968 data->flags |= SF_IS_INF;
970 if (flags & SCF_DO_STCLASS) {
971 cl_init(pRExC_state, &this_class);
972 oclass = data->start_class;
973 data->start_class = &this_class;
974 f |= SCF_DO_STCLASS_AND;
975 f &= ~SCF_DO_STCLASS_OR;
977 /* These are the cases when once a subexpression
978 fails at a particular position, it cannot succeed
979 even after backtracking at the enclosing scope.
981 XXXX what if minimal match and we are at the
982 initial run of {n,m}? */
983 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
984 f &= ~SCF_WHILEM_VISITED_POS;
986 /* This will finish on WHILEM, setting scan, or on NULL: */
987 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
989 ? (f & ~SCF_DO_SUBSTR) : f);
991 if (flags & SCF_DO_STCLASS)
992 data->start_class = oclass;
993 if (mincount == 0 || minnext == 0) {
994 if (flags & SCF_DO_STCLASS_OR) {
995 cl_or(pRExC_state, data->start_class, &this_class);
997 else if (flags & SCF_DO_STCLASS_AND) {
998 /* Switch to OR mode: cache the old value of
999 * data->start_class */
1000 StructCopy(data->start_class, &and_with,
1001 struct regnode_charclass_class);
1002 flags &= ~SCF_DO_STCLASS_AND;
1003 StructCopy(&this_class, data->start_class,
1004 struct regnode_charclass_class);
1005 flags |= SCF_DO_STCLASS_OR;
1006 data->start_class->flags |= ANYOF_EOS;
1008 } else { /* Non-zero len */
1009 if (flags & SCF_DO_STCLASS_OR) {
1010 cl_or(pRExC_state, data->start_class, &this_class);
1011 cl_and(data->start_class, &and_with);
1013 else if (flags & SCF_DO_STCLASS_AND)
1014 cl_and(data->start_class, &this_class);
1015 flags &= ~SCF_DO_STCLASS;
1017 if (!scan) /* It was not CURLYX, but CURLY. */
1019 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
1020 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1021 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1024 "Quantifier unexpected on zero-length expression");
1027 min += minnext * mincount;
1028 is_inf_internal |= ((maxcount == REG_INFTY
1029 && (minnext + deltanext) > 0)
1030 || deltanext == I32_MAX);
1031 is_inf |= is_inf_internal;
1032 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1034 /* Try powerful optimization CURLYX => CURLYN. */
1035 if ( OP(oscan) == CURLYX && data
1036 && data->flags & SF_IN_PAR
1037 && !(data->flags & SF_HAS_EVAL)
1038 && !deltanext && minnext == 1 ) {
1039 /* Try to optimize to CURLYN. */
1040 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1041 regnode *nxt1 = nxt, *nxt2;
1045 if (!strchr((char*)PL_simple,OP(nxt))
1046 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1047 && STR_LEN(nxt) == 1))
1051 if (OP(nxt) != CLOSE)
1053 /* Now we know that nxt2 is the only contents: */
1054 oscan->flags = ARG(nxt);
1056 OP(nxt1) = NOTHING; /* was OPEN. */
1058 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1059 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1060 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1061 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1062 OP(nxt + 1) = OPTIMIZED; /* was count. */
1063 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1068 /* Try optimization CURLYX => CURLYM. */
1069 if ( OP(oscan) == CURLYX && data
1070 && !(data->flags & SF_HAS_PAR)
1071 && !(data->flags & SF_HAS_EVAL)
1073 /* XXXX How to optimize if data == 0? */
1074 /* Optimize to a simpler form. */
1075 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1079 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1080 && (OP(nxt2) != WHILEM))
1082 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1083 /* Need to optimize away parenths. */
1084 if (data->flags & SF_IN_PAR) {
1085 /* Set the parenth number. */
1086 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1088 if (OP(nxt) != CLOSE)
1089 FAIL("Panic opt close");
1090 oscan->flags = ARG(nxt);
1091 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1092 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1094 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1095 OP(nxt + 1) = OPTIMIZED; /* was count. */
1096 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1097 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1100 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1101 regnode *nnxt = regnext(nxt1);
1104 if (reg_off_by_arg[OP(nxt1)])
1105 ARG_SET(nxt1, nxt2 - nxt1);
1106 else if (nxt2 - nxt1 < U16_MAX)
1107 NEXT_OFF(nxt1) = nxt2 - nxt1;
1109 OP(nxt) = NOTHING; /* Cannot beautify */
1114 /* Optimize again: */
1115 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1121 else if ((OP(oscan) == CURLYX)
1122 && (flags & SCF_WHILEM_VISITED_POS)
1123 /* See the comment on a similar expression above.
1124 However, this time it not a subexpression
1125 we care about, but the expression itself. */
1126 && (maxcount == REG_INFTY)
1127 && data && ++data->whilem_c < 16) {
1128 /* This stays as CURLYX, we can put the count/of pair. */
1129 /* Find WHILEM (as in regexec.c) */
1130 regnode *nxt = oscan + NEXT_OFF(oscan);
1132 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1134 PREVOPER(nxt)->flags = data->whilem_c
1135 | (RExC_whilem_seen << 4); /* On WHILEM */
1137 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1139 if (flags & SCF_DO_SUBSTR) {
1140 SV *last_str = Nullsv;
1141 int counted = mincount != 0;
1143 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1144 I32 b = pos_before >= data->last_start_min
1145 ? pos_before : data->last_start_min;
1147 char *s = SvPV(data->last_found, l);
1148 I32 old = b - data->last_start_min;
1151 old = utf8_hop((U8*)s, old) - (U8*)s;
1154 /* Get the added string: */
1155 last_str = newSVpvn(s + old, l);
1156 if (deltanext == 0 && pos_before == b) {
1157 /* What was added is a constant string */
1159 SvGROW(last_str, (mincount * l) + 1);
1160 repeatcpy(SvPVX(last_str) + l,
1161 SvPVX(last_str), l, mincount - 1);
1162 SvCUR(last_str) *= mincount;
1163 /* Add additional parts. */
1164 SvCUR_set(data->last_found,
1165 SvCUR(data->last_found) - l);
1166 sv_catsv(data->last_found, last_str);
1167 data->last_end += l * (mincount - 1);
1170 /* start offset must point into the last copy */
1171 data->last_start_min += minnext * (mincount - 1);
1172 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1173 * (minnext + data->pos_delta);
1176 /* It is counted once already... */
1177 data->pos_min += minnext * (mincount - counted);
1178 data->pos_delta += - counted * deltanext +
1179 (minnext + deltanext) * maxcount - minnext * mincount;
1180 if (mincount != maxcount) {
1181 /* Cannot extend fixed substrings found inside
1183 scan_commit(pRExC_state,data);
1184 if (mincount && last_str) {
1185 sv_setsv(data->last_found, last_str);
1186 data->last_end = data->pos_min;
1187 data->last_start_min =
1188 data->pos_min - CHR_SVLEN(last_str);
1189 data->last_start_max = is_inf
1191 : data->pos_min + data->pos_delta
1192 - CHR_SVLEN(last_str);
1194 data->longest = &(data->longest_float);
1196 SvREFCNT_dec(last_str);
1198 if (data && (fl & SF_HAS_EVAL))
1199 data->flags |= SF_HAS_EVAL;
1200 optimize_curly_tail:
1201 if (OP(oscan) != CURLYX) {
1202 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1204 NEXT_OFF(oscan) += NEXT_OFF(next);
1207 default: /* REF and CLUMP only? */
1208 if (flags & SCF_DO_SUBSTR) {
1209 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1210 data->longest = &(data->longest_float);
1212 is_inf = is_inf_internal = 1;
1213 if (flags & SCF_DO_STCLASS_OR)
1214 cl_anything(pRExC_state, data->start_class);
1215 flags &= ~SCF_DO_STCLASS;
1219 else if (strchr((char*)PL_simple,OP(scan))) {
1222 if (flags & SCF_DO_SUBSTR) {
1223 scan_commit(pRExC_state,data);
1227 if (flags & SCF_DO_STCLASS) {
1228 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1230 /* Some of the logic below assumes that switching
1231 locale on will only add false positives. */
1232 switch (PL_regkind[(U8)OP(scan)]) {
1236 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1237 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1238 cl_anything(pRExC_state, data->start_class);
1241 if (OP(scan) == SANY)
1243 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1244 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1245 || (data->start_class->flags & ANYOF_CLASS));
1246 cl_anything(pRExC_state, data->start_class);
1248 if (flags & SCF_DO_STCLASS_AND || !value)
1249 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1252 if (flags & SCF_DO_STCLASS_AND)
1253 cl_and(data->start_class,
1254 (struct regnode_charclass_class*)scan);
1256 cl_or(pRExC_state, data->start_class,
1257 (struct regnode_charclass_class*)scan);
1260 if (flags & SCF_DO_STCLASS_AND) {
1261 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1262 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1263 for (value = 0; value < 256; value++)
1264 if (!isALNUM(value))
1265 ANYOF_BITMAP_CLEAR(data->start_class, value);
1269 if (data->start_class->flags & ANYOF_LOCALE)
1270 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1272 for (value = 0; value < 256; value++)
1274 ANYOF_BITMAP_SET(data->start_class, value);
1279 if (flags & SCF_DO_STCLASS_AND) {
1280 if (data->start_class->flags & ANYOF_LOCALE)
1281 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1284 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1285 data->start_class->flags |= ANYOF_LOCALE;
1289 if (flags & SCF_DO_STCLASS_AND) {
1290 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1291 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1292 for (value = 0; value < 256; value++)
1294 ANYOF_BITMAP_CLEAR(data->start_class, value);
1298 if (data->start_class->flags & ANYOF_LOCALE)
1299 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1301 for (value = 0; value < 256; value++)
1302 if (!isALNUM(value))
1303 ANYOF_BITMAP_SET(data->start_class, value);
1308 if (flags & SCF_DO_STCLASS_AND) {
1309 if (data->start_class->flags & ANYOF_LOCALE)
1310 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1313 data->start_class->flags |= ANYOF_LOCALE;
1314 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1318 if (flags & SCF_DO_STCLASS_AND) {
1319 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1320 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1321 for (value = 0; value < 256; value++)
1322 if (!isSPACE(value))
1323 ANYOF_BITMAP_CLEAR(data->start_class, value);
1327 if (data->start_class->flags & ANYOF_LOCALE)
1328 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1330 for (value = 0; value < 256; value++)
1332 ANYOF_BITMAP_SET(data->start_class, value);
1337 if (flags & SCF_DO_STCLASS_AND) {
1338 if (data->start_class->flags & ANYOF_LOCALE)
1339 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1342 data->start_class->flags |= ANYOF_LOCALE;
1343 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1347 if (flags & SCF_DO_STCLASS_AND) {
1348 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1349 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1350 for (value = 0; value < 256; value++)
1352 ANYOF_BITMAP_CLEAR(data->start_class, value);
1356 if (data->start_class->flags & ANYOF_LOCALE)
1357 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1359 for (value = 0; value < 256; value++)
1360 if (!isSPACE(value))
1361 ANYOF_BITMAP_SET(data->start_class, value);
1366 if (flags & SCF_DO_STCLASS_AND) {
1367 if (data->start_class->flags & ANYOF_LOCALE) {
1368 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1369 for (value = 0; value < 256; value++)
1370 if (!isSPACE(value))
1371 ANYOF_BITMAP_CLEAR(data->start_class, value);
1375 data->start_class->flags |= ANYOF_LOCALE;
1376 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1380 if (flags & SCF_DO_STCLASS_AND) {
1381 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1382 for (value = 0; value < 256; value++)
1383 if (!isDIGIT(value))
1384 ANYOF_BITMAP_CLEAR(data->start_class, value);
1387 if (data->start_class->flags & ANYOF_LOCALE)
1388 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1390 for (value = 0; value < 256; value++)
1392 ANYOF_BITMAP_SET(data->start_class, value);
1397 if (flags & SCF_DO_STCLASS_AND) {
1398 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1399 for (value = 0; value < 256; value++)
1401 ANYOF_BITMAP_CLEAR(data->start_class, value);
1404 if (data->start_class->flags & ANYOF_LOCALE)
1405 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1407 for (value = 0; value < 256; value++)
1408 if (!isDIGIT(value))
1409 ANYOF_BITMAP_SET(data->start_class, value);
1414 if (flags & SCF_DO_STCLASS_OR)
1415 cl_and(data->start_class, &and_with);
1416 flags &= ~SCF_DO_STCLASS;
1419 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1420 data->flags |= (OP(scan) == MEOL
1424 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1425 /* Lookbehind, or need to calculate parens/evals/stclass: */
1426 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1427 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1428 /* Lookahead/lookbehind */
1429 I32 deltanext, minnext, fake = 0;
1431 struct regnode_charclass_class intrnl;
1434 data_fake.flags = 0;
1436 data_fake.whilem_c = data->whilem_c;
1437 data_fake.last_closep = data->last_closep;
1440 data_fake.last_closep = &fake;
1441 if ( flags & SCF_DO_STCLASS && !scan->flags
1442 && OP(scan) == IFMATCH ) { /* Lookahead */
1443 cl_init(pRExC_state, &intrnl);
1444 data_fake.start_class = &intrnl;
1445 f |= SCF_DO_STCLASS_AND;
1447 if (flags & SCF_WHILEM_VISITED_POS)
1448 f |= SCF_WHILEM_VISITED_POS;
1449 next = regnext(scan);
1450 nscan = NEXTOPER(NEXTOPER(scan));
1451 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1454 vFAIL("Variable length lookbehind not implemented");
1456 else if (minnext > U8_MAX) {
1457 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1459 scan->flags = minnext;
1461 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1463 if (data && (data_fake.flags & SF_HAS_EVAL))
1464 data->flags |= SF_HAS_EVAL;
1466 data->whilem_c = data_fake.whilem_c;
1467 if (f & SCF_DO_STCLASS_AND) {
1468 int was = (data->start_class->flags & ANYOF_EOS);
1470 cl_and(data->start_class, &intrnl);
1472 data->start_class->flags |= ANYOF_EOS;
1475 else if (OP(scan) == OPEN) {
1478 else if (OP(scan) == CLOSE) {
1479 if (ARG(scan) == is_par) {
1480 next = regnext(scan);
1482 if ( next && (OP(next) != WHILEM) && next < last)
1483 is_par = 0; /* Disable optimization */
1486 *(data->last_closep) = ARG(scan);
1488 else if (OP(scan) == EVAL) {
1490 data->flags |= SF_HAS_EVAL;
1492 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1493 if (flags & SCF_DO_SUBSTR) {
1494 scan_commit(pRExC_state,data);
1495 data->longest = &(data->longest_float);
1497 is_inf = is_inf_internal = 1;
1498 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1499 cl_anything(pRExC_state, data->start_class);
1500 flags &= ~SCF_DO_STCLASS;
1502 /* Else: zero-length, ignore. */
1503 scan = regnext(scan);
1508 *deltap = is_inf_internal ? I32_MAX : delta;
1509 if (flags & SCF_DO_SUBSTR && is_inf)
1510 data->pos_delta = I32_MAX - data->pos_min;
1511 if (is_par > U8_MAX)
1513 if (is_par && pars==1 && data) {
1514 data->flags |= SF_IN_PAR;
1515 data->flags &= ~SF_HAS_PAR;
1517 else if (pars && data) {
1518 data->flags |= SF_HAS_PAR;
1519 data->flags &= ~SF_IN_PAR;
1521 if (flags & SCF_DO_STCLASS_OR)
1522 cl_and(data->start_class, &and_with);
1527 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1529 if (RExC_rx->data) {
1530 Renewc(RExC_rx->data,
1531 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1532 char, struct reg_data);
1533 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1534 RExC_rx->data->count += n;
1537 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1538 char, struct reg_data);
1539 New(1208, RExC_rx->data->what, n, U8);
1540 RExC_rx->data->count = n;
1542 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1543 return RExC_rx->data->count - n;
1547 Perl_reginitcolors(pTHX)
1550 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1553 PL_colors[0] = s = savepv(s);
1555 s = strchr(s, '\t');
1561 PL_colors[i] = s = "";
1565 PL_colors[i++] = "";
1572 - pregcomp - compile a regular expression into internal code
1574 * We can't allocate space until we know how big the compiled form will be,
1575 * but we can't compile it (and thus know how big it is) until we've got a
1576 * place to put the code. So we cheat: we compile it twice, once with code
1577 * generation turned off and size counting turned on, and once "for real".
1578 * This also means that we don't allocate space until we are sure that the
1579 * thing really will compile successfully, and we never have to move the
1580 * code and thus invalidate pointers into it. (Note that it has to be in
1581 * one piece because free() must be able to free it all.) [NB: not true in perl]
1583 * Beware that the optimization-preparation code in here knows about some
1584 * of the structure of the compiled regexp. [I'll say.]
1587 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1597 RExC_state_t RExC_state;
1598 RExC_state_t *pRExC_state = &RExC_state;
1601 FAIL("NULL regexp argument");
1603 /* XXXX This looks very suspicious... */
1604 if (pm->op_pmdynflags & PMdf_CMP_UTF8)
1609 RExC_precomp = savepvn(exp, xend - exp);
1610 DEBUG_r(if (!PL_colorset) reginitcolors());
1611 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1612 PL_colors[4],PL_colors[5],PL_colors[0],
1613 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1614 RExC_flags16 = pm->op_pmflags;
1618 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1619 RExC_seen_evals = 0;
1622 /* First pass: determine size, legality. */
1628 RExC_emit = &PL_regdummy;
1629 RExC_whilem_seen = 0;
1630 #if 0 /* REGC() is (currently) a NOP at the first pass.
1631 * Clever compilers notice this and complain. --jhi */
1632 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1634 if (reg(pRExC_state, 0, &flags) == NULL) {
1635 Safefree(RExC_precomp);
1636 RExC_precomp = Nullch;
1639 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1641 /* Small enough for pointer-storage convention?
1642 If extralen==0, this means that we will not need long jumps. */
1643 if (RExC_size >= 0x10000L && RExC_extralen)
1644 RExC_size += RExC_extralen;
1647 if (RExC_whilem_seen > 15)
1648 RExC_whilem_seen = 15;
1650 /* Allocate space and initialize. */
1651 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1654 FAIL("Regexp out of space");
1657 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1658 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1661 r->prelen = xend - exp;
1662 r->precomp = RExC_precomp;
1664 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1665 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1667 r->substrs = 0; /* Useful during FAIL. */
1668 r->startp = 0; /* Useful during FAIL. */
1669 r->endp = 0; /* Useful during FAIL. */
1673 /* Second pass: emit code. */
1678 RExC_emit = r->program;
1679 /* Store the count of eval-groups for security checks: */
1680 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1681 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1683 if (reg(pRExC_state, 0, &flags) == NULL)
1686 /* Dig out information for optimizations. */
1687 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1688 pm->op_pmflags = RExC_flags16;
1690 r->reganch |= ROPT_UTF8;
1691 r->regstclass = NULL;
1692 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1693 r->reganch |= ROPT_NAUGHTY;
1694 scan = r->program + 1; /* First BRANCH. */
1696 /* XXXX To minimize changes to RE engine we always allocate
1697 3-units-long substrs field. */
1698 Newz(1004, r->substrs, 1, struct reg_substr_data);
1700 StructCopy(&zero_scan_data, &data, scan_data_t);
1701 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1702 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1704 STRLEN longest_float_length, longest_fixed_length;
1705 struct regnode_charclass_class ch_class;
1710 /* Skip introductions and multiplicators >= 1. */
1711 while ((OP(first) == OPEN && (sawopen = 1)) ||
1712 /* An OR of *one* alternative - should not happen now. */
1713 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1714 (OP(first) == PLUS) ||
1715 (OP(first) == MINMOD) ||
1716 /* An {n,m} with n>0 */
1717 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1718 if (OP(first) == PLUS)
1721 first += regarglen[(U8)OP(first)];
1722 first = NEXTOPER(first);
1725 /* Starting-point info. */
1727 if (PL_regkind[(U8)OP(first)] == EXACT) {
1728 if (OP(first) == EXACT)
1729 ; /* Empty, get anchored substr later. */
1730 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1731 r->regstclass = first;
1733 else if (strchr((char*)PL_simple,OP(first)))
1734 r->regstclass = first;
1735 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1736 PL_regkind[(U8)OP(first)] == NBOUND)
1737 r->regstclass = first;
1738 else if (PL_regkind[(U8)OP(first)] == BOL) {
1739 r->reganch |= (OP(first) == MBOL
1741 : (OP(first) == SBOL
1744 first = NEXTOPER(first);
1747 else if (OP(first) == GPOS) {
1748 r->reganch |= ROPT_ANCH_GPOS;
1749 first = NEXTOPER(first);
1752 else if ((OP(first) == STAR &&
1753 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1754 !(r->reganch & ROPT_ANCH) )
1756 /* turn .* into ^.* with an implied $*=1 */
1757 int type = OP(NEXTOPER(first));
1759 if (type == REG_ANY)
1760 type = ROPT_ANCH_MBOL;
1762 type = ROPT_ANCH_SBOL;
1764 r->reganch |= type | ROPT_IMPLICIT;
1765 first = NEXTOPER(first);
1768 if (sawplus && (!sawopen || !RExC_sawback)
1769 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1770 /* x+ must match at the 1st pos of run of x's */
1771 r->reganch |= ROPT_SKIP;
1773 /* Scan is after the zeroth branch, first is atomic matcher. */
1774 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1775 (IV)(first - scan + 1)));
1777 * If there's something expensive in the r.e., find the
1778 * longest literal string that must appear and make it the
1779 * regmust. Resolve ties in favor of later strings, since
1780 * the regstart check works with the beginning of the r.e.
1781 * and avoiding duplication strengthens checking. Not a
1782 * strong reason, but sufficient in the absence of others.
1783 * [Now we resolve ties in favor of the earlier string if
1784 * it happens that c_offset_min has been invalidated, since the
1785 * earlier string may buy us something the later one won't.]
1789 data.longest_fixed = newSVpvn("",0);
1790 data.longest_float = newSVpvn("",0);
1791 data.last_found = newSVpvn("",0);
1792 data.longest = &(data.longest_fixed);
1794 if (!r->regstclass) {
1795 cl_init(pRExC_state, &ch_class);
1796 data.start_class = &ch_class;
1797 stclass_flag = SCF_DO_STCLASS_AND;
1798 } else /* XXXX Check for BOUND? */
1800 data.last_closep = &last_close;
1802 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1803 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1804 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1805 && data.last_start_min == 0 && data.last_end > 0
1806 && !RExC_seen_zerolen
1807 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1808 r->reganch |= ROPT_CHECK_ALL;
1809 scan_commit(pRExC_state, &data);
1810 SvREFCNT_dec(data.last_found);
1812 longest_float_length = CHR_SVLEN(data.longest_float);
1813 if (longest_float_length
1814 || (data.flags & SF_FL_BEFORE_EOL
1815 && (!(data.flags & SF_FL_BEFORE_MEOL)
1816 || (RExC_flags16 & PMf_MULTILINE)))) {
1819 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1820 && data.offset_fixed == data.offset_float_min
1821 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1822 goto remove_float; /* As in (a)+. */
1824 r->float_substr = data.longest_float;
1825 r->float_min_offset = data.offset_float_min;
1826 r->float_max_offset = data.offset_float_max;
1827 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1828 && (!(data.flags & SF_FL_BEFORE_MEOL)
1829 || (RExC_flags16 & PMf_MULTILINE)));
1830 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1834 r->float_substr = Nullsv;
1835 SvREFCNT_dec(data.longest_float);
1836 longest_float_length = 0;
1839 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1840 if (longest_fixed_length
1841 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1842 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1843 || (RExC_flags16 & PMf_MULTILINE)))) {
1846 r->anchored_substr = data.longest_fixed;
1847 r->anchored_offset = data.offset_fixed;
1848 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1849 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1850 || (RExC_flags16 & PMf_MULTILINE)));
1851 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1854 r->anchored_substr = Nullsv;
1855 SvREFCNT_dec(data.longest_fixed);
1856 longest_fixed_length = 0;
1859 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1860 r->regstclass = NULL;
1861 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1862 && !(data.start_class->flags & ANYOF_EOS)
1863 && !cl_is_anything(data.start_class)) {
1865 I32 n = add_data(pRExC_state, 1, "f");
1867 New(1006, RExC_rx->data->data[n], 1,
1868 struct regnode_charclass_class);
1869 StructCopy(data.start_class,
1870 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1871 struct regnode_charclass_class);
1872 r->regstclass = (regnode*)RExC_rx->data->data[n];
1873 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1874 PL_regdata = r->data; /* for regprop() */
1875 DEBUG_r((sv = sv_newmortal(),
1876 regprop(sv, (regnode*)data.start_class),
1877 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1881 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1882 if (longest_fixed_length > longest_float_length) {
1883 r->check_substr = r->anchored_substr;
1884 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1885 if (r->reganch & ROPT_ANCH_SINGLE)
1886 r->reganch |= ROPT_NOSCAN;
1889 r->check_substr = r->float_substr;
1890 r->check_offset_min = data.offset_float_min;
1891 r->check_offset_max = data.offset_float_max;
1893 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1894 This should be changed ASAP! */
1895 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1896 r->reganch |= RE_USE_INTUIT;
1897 if (SvTAIL(r->check_substr))
1898 r->reganch |= RE_INTUIT_TAIL;
1902 /* Several toplevels. Best we can is to set minlen. */
1904 struct regnode_charclass_class ch_class;
1907 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1908 scan = r->program + 1;
1909 cl_init(pRExC_state, &ch_class);
1910 data.start_class = &ch_class;
1911 data.last_closep = &last_close;
1912 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1913 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1914 if (!(data.start_class->flags & ANYOF_EOS)
1915 && !cl_is_anything(data.start_class)) {
1917 I32 n = add_data(pRExC_state, 1, "f");
1919 New(1006, RExC_rx->data->data[n], 1,
1920 struct regnode_charclass_class);
1921 StructCopy(data.start_class,
1922 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1923 struct regnode_charclass_class);
1924 r->regstclass = (regnode*)RExC_rx->data->data[n];
1925 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1926 DEBUG_r((sv = sv_newmortal(),
1927 regprop(sv, (regnode*)data.start_class),
1928 PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n",
1934 if (RExC_seen & REG_SEEN_GPOS)
1935 r->reganch |= ROPT_GPOS_SEEN;
1936 if (RExC_seen & REG_SEEN_LOOKBEHIND)
1937 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1938 if (RExC_seen & REG_SEEN_EVAL)
1939 r->reganch |= ROPT_EVAL_SEEN;
1940 Newz(1002, r->startp, RExC_npar, I32);
1941 Newz(1002, r->endp, RExC_npar, I32);
1942 PL_regdata = r->data; /* for regprop() */
1943 DEBUG_r(regdump(r));
1948 - reg - regular expression, i.e. main body or parenthesized thing
1950 * Caller must absorb opening parenthesis.
1952 * Combining parenthesis handling with the base level of regular expression
1953 * is a trifle forced, but the need to tie the tails of the branches to what
1954 * follows makes it hard to avoid.
1957 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
1958 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1960 register regnode *ret; /* Will be the head of the group. */
1961 register regnode *br;
1962 register regnode *lastbr;
1963 register regnode *ender = 0;
1964 register I32 parno = 0;
1965 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
1966 char *oregcomp_parse = RExC_parse;
1969 *flagp = 0; /* Tentatively. */
1971 /* Make an OPEN node, if parenthesized. */
1973 if (*RExC_parse == '?') {
1974 U16 posflags = 0, negflags = 0;
1975 U16 *flagsp = &posflags;
1977 char *seqstart = RExC_parse;
1980 paren = *RExC_parse++;
1981 ret = NULL; /* For look-ahead/behind. */
1984 RExC_seen |= REG_SEEN_LOOKBEHIND;
1985 if (*RExC_parse == '!')
1987 if (*RExC_parse != '=' && *RExC_parse != '!')
1992 RExC_seen_zerolen++;
1998 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2001 while (*RExC_parse && *RExC_parse != ')')
2003 if (*RExC_parse != ')')
2004 FAIL("Sequence (?#... not terminated");
2005 nextchar(pRExC_state);
2010 vWARN(RExC_parse, "(?p{}) is deprecated - use (??{})");
2014 paren = *RExC_parse++;
2018 I32 count = 1, n = 0;
2020 char *s = RExC_parse;
2022 OP_4tree *sop, *rop;
2024 RExC_seen_zerolen++;
2025 RExC_seen |= REG_SEEN_EVAL;
2026 while (count && (c = *RExC_parse)) {
2027 if (c == '\\' && RExC_parse[1])
2035 if (*RExC_parse != ')')
2038 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2043 if (RExC_parse - 1 - s)
2044 sv = newSVpvn(s, RExC_parse - 1 - s);
2046 sv = newSVpvn("", 0);
2049 Perl_save_re_context(aTHX);
2050 rop = sv_compile_2op(sv, &sop, "re", &av);
2053 n = add_data(pRExC_state, 3, "nop");
2054 RExC_rx->data->data[n] = (void*)rop;
2055 RExC_rx->data->data[n+1] = (void*)sop;
2056 RExC_rx->data->data[n+2] = (void*)av;
2059 else { /* First pass */
2060 if (PL_reginterp_cnt < ++RExC_seen_evals
2061 && PL_curcop != &PL_compiling)
2062 /* No compiled RE interpolated, has runtime
2063 components ===> unsafe. */
2064 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2066 FAIL("Eval-group in insecure regular expression");
2069 nextchar(pRExC_state);
2071 ret = reg_node(pRExC_state, LOGICAL);
2074 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2077 return reganode(pRExC_state, EVAL, n);
2081 if (RExC_parse[0] == '?') {
2082 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2083 || RExC_parse[1] == '<'
2084 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2087 ret = reg_node(pRExC_state, LOGICAL);
2090 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2094 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2095 parno = atoi(RExC_parse++);
2097 while (isDIGIT(*RExC_parse))
2099 ret = reganode(pRExC_state, GROUPP, parno);
2100 if ((c = *nextchar(pRExC_state)) != ')')
2101 vFAIL("Switch condition not recognized");
2103 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2104 br = regbranch(pRExC_state, &flags, 1);
2106 br = reganode(pRExC_state, LONGJMP, 0);
2108 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2109 c = *nextchar(pRExC_state);
2113 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2114 regbranch(pRExC_state, &flags, 1);
2115 regtail(pRExC_state, ret, lastbr);
2118 c = *nextchar(pRExC_state);
2123 vFAIL("Switch (?(condition)... contains too many branches");
2124 ender = reg_node(pRExC_state, TAIL);
2125 regtail(pRExC_state, br, ender);
2127 regtail(pRExC_state, lastbr, ender);
2128 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2131 regtail(pRExC_state, ret, ender);
2135 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2139 RExC_parse--; /* for vFAIL to print correctly */
2140 vFAIL("Sequence (? incomplete");
2145 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2146 if (*RExC_parse != 'o')
2147 pmflag(flagsp, *RExC_parse);
2150 if (*RExC_parse == '-') {
2155 RExC_flags16 |= posflags;
2156 RExC_flags16 &= ~negflags;
2157 if (*RExC_parse == ':') {
2163 if (*RExC_parse != ')') {
2165 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2167 nextchar(pRExC_state);
2175 ret = reganode(pRExC_state, OPEN, parno);
2182 /* Pick up the branches, linking them together. */
2183 br = regbranch(pRExC_state, &flags, 1);
2186 if (*RExC_parse == '|') {
2187 if (!SIZE_ONLY && RExC_extralen) {
2188 reginsert(pRExC_state, BRANCHJ, br);
2191 reginsert(pRExC_state, BRANCH, br);
2194 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2196 else if (paren == ':') {
2197 *flagp |= flags&SIMPLE;
2199 if (open) { /* Starts with OPEN. */
2200 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2202 else if (paren != '?') /* Not Conditional */
2206 *flagp |= flags&SPSTART;
2208 while (*RExC_parse == '|') {
2209 if (!SIZE_ONLY && RExC_extralen) {
2210 ender = reganode(pRExC_state, LONGJMP,0);
2211 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2214 RExC_extralen += 2; /* Account for LONGJMP. */
2215 nextchar(pRExC_state);
2216 br = regbranch(pRExC_state, &flags, 0);
2219 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2223 *flagp |= flags&SPSTART;
2226 if (have_branch || paren != ':') {
2227 /* Make a closing node, and hook it on the end. */
2230 ender = reg_node(pRExC_state, TAIL);
2233 ender = reganode(pRExC_state, CLOSE, parno);
2239 *flagp &= ~HASWIDTH;
2242 ender = reg_node(pRExC_state, SUCCEED);
2245 ender = reg_node(pRExC_state, END);
2248 regtail(pRExC_state, lastbr, ender);
2251 /* Hook the tails of the branches to the closing node. */
2252 for (br = ret; br != NULL; br = regnext(br)) {
2253 regoptail(pRExC_state, br, ender);
2260 static char parens[] = "=!<,>";
2262 if (paren && (p = strchr(parens, paren))) {
2263 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2264 int flag = (p - parens) > 1;
2267 node = SUSPEND, flag = 0;
2268 reginsert(pRExC_state, node,ret);
2270 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2274 /* Check for proper termination. */
2276 RExC_flags16 = oregflags;
2277 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2278 RExC_parse = oregcomp_parse;
2279 vFAIL("Unmatched (");
2282 else if (!paren && RExC_parse < RExC_end) {
2283 if (*RExC_parse == ')') {
2285 vFAIL("Unmatched )");
2288 FAIL("Junk on end of regexp"); /* "Can't happen". */
2296 - regbranch - one alternative of an | operator
2298 * Implements the concatenation operator.
2301 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2303 register regnode *ret;
2304 register regnode *chain = NULL;
2305 register regnode *latest;
2306 I32 flags = 0, c = 0;
2311 if (!SIZE_ONLY && RExC_extralen)
2312 ret = reganode(pRExC_state, BRANCHJ,0);
2314 ret = reg_node(pRExC_state, BRANCH);
2317 if (!first && SIZE_ONLY)
2318 RExC_extralen += 1; /* BRANCHJ */
2320 *flagp = WORST; /* Tentatively. */
2323 nextchar(pRExC_state);
2324 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2326 latest = regpiece(pRExC_state, &flags);
2327 if (latest == NULL) {
2328 if (flags & TRYAGAIN)
2332 else if (ret == NULL)
2334 *flagp |= flags&HASWIDTH;
2335 if (chain == NULL) /* First piece. */
2336 *flagp |= flags&SPSTART;
2339 regtail(pRExC_state, chain, latest);
2344 if (chain == NULL) { /* Loop ran zero times. */
2345 chain = reg_node(pRExC_state, NOTHING);
2350 *flagp |= flags&SIMPLE;
2357 - regpiece - something followed by possible [*+?]
2359 * Note that the branching code sequences used for ? and the general cases
2360 * of * and + are somewhat optimized: they use the same NOTHING node as
2361 * both the endmarker for their branch list and the body of the last branch.
2362 * It might seem that this node could be dispensed with entirely, but the
2363 * endmarker role is not redundant.
2366 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2368 register regnode *ret;
2370 register char *next;
2372 char *origparse = RExC_parse;
2375 I32 max = REG_INFTY;
2377 ret = regatom(pRExC_state, &flags);
2379 if (flags & TRYAGAIN)
2386 if (op == '{' && regcurly(RExC_parse)) {
2387 next = RExC_parse + 1;
2389 while (isDIGIT(*next) || *next == ',') {
2398 if (*next == '}') { /* got one */
2402 min = atoi(RExC_parse);
2406 maxpos = RExC_parse;
2408 if (!max && *maxpos != '0')
2409 max = REG_INFTY; /* meaning "infinity" */
2410 else if (max >= REG_INFTY)
2411 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2413 nextchar(pRExC_state);
2416 if ((flags&SIMPLE)) {
2417 RExC_naughty += 2 + RExC_naughty / 2;
2418 reginsert(pRExC_state, CURLY, ret);
2421 regnode *w = reg_node(pRExC_state, WHILEM);
2424 regtail(pRExC_state, ret, w);
2425 if (!SIZE_ONLY && RExC_extralen) {
2426 reginsert(pRExC_state, LONGJMP,ret);
2427 reginsert(pRExC_state, NOTHING,ret);
2428 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2430 reginsert(pRExC_state, CURLYX,ret);
2431 if (!SIZE_ONLY && RExC_extralen)
2432 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2433 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2435 RExC_whilem_seen++, RExC_extralen += 3;
2436 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2444 if (max && max < min)
2445 vFAIL("Can't do {n,m} with n > m");
2460 #if 0 /* Now runtime fix should be reliable. */
2462 /* if this is reinstated, don't forget to put this back into perldiag:
2464 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2466 (F) The part of the regexp subject to either the * or + quantifier
2467 could match an empty string. The {#} shows in the regular
2468 expression about where the problem was discovered.
2472 if (!(flags&HASWIDTH) && op != '?')
2473 vFAIL("Regexp *+ operand could be empty");
2476 nextchar(pRExC_state);
2478 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2480 if (op == '*' && (flags&SIMPLE)) {
2481 reginsert(pRExC_state, STAR, ret);
2485 else if (op == '*') {
2489 else if (op == '+' && (flags&SIMPLE)) {
2490 reginsert(pRExC_state, PLUS, ret);
2494 else if (op == '+') {
2498 else if (op == '?') {
2503 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2505 "%.*s matches null string many times",
2506 RExC_parse - origparse,
2510 if (*RExC_parse == '?') {
2511 nextchar(pRExC_state);
2512 reginsert(pRExC_state, MINMOD, ret);
2513 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2515 if (ISMULT2(RExC_parse)) {
2517 vFAIL("Nested quantifiers");
2524 - regatom - the lowest level
2526 * Optimization: gobbles an entire sequence of ordinary characters so that
2527 * it can turn them into a single node, which is smaller to store and
2528 * faster to run. Backslashed characters are exceptions, each becoming a
2529 * separate node; the code is simpler that way and it's not worth fixing.
2531 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2533 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2535 register regnode *ret = 0;
2538 *flagp = WORST; /* Tentatively. */
2541 switch (*RExC_parse) {
2543 RExC_seen_zerolen++;
2544 nextchar(pRExC_state);
2545 if (RExC_flags16 & PMf_MULTILINE)
2546 ret = reg_node(pRExC_state, MBOL);
2547 else if (RExC_flags16 & PMf_SINGLELINE)
2548 ret = reg_node(pRExC_state, SBOL);
2550 ret = reg_node(pRExC_state, BOL);
2553 nextchar(pRExC_state);
2555 RExC_seen_zerolen++;
2556 if (RExC_flags16 & PMf_MULTILINE)
2557 ret = reg_node(pRExC_state, MEOL);
2558 else if (RExC_flags16 & PMf_SINGLELINE)
2559 ret = reg_node(pRExC_state, SEOL);
2561 ret = reg_node(pRExC_state, EOL);
2564 nextchar(pRExC_state);
2565 if (RExC_flags16 & PMf_SINGLELINE)
2566 ret = reg_node(pRExC_state, SANY);
2568 ret = reg_node(pRExC_state, REG_ANY);
2569 *flagp |= HASWIDTH|SIMPLE;
2574 char *oregcomp_parse = ++RExC_parse;
2575 ret = regclass(pRExC_state);
2576 if (*RExC_parse != ']') {
2577 RExC_parse = oregcomp_parse;
2578 vFAIL("Unmatched [");
2580 nextchar(pRExC_state);
2581 *flagp |= HASWIDTH|SIMPLE;
2585 nextchar(pRExC_state);
2586 ret = reg(pRExC_state, 1, &flags);
2588 if (flags & TRYAGAIN) {
2589 if (RExC_parse == RExC_end) {
2590 /* Make parent create an empty node if needed. */
2598 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2602 if (flags & TRYAGAIN) {
2606 vFAIL("Internal urp");
2607 /* Supposed to be caught earlier. */
2610 if (!regcurly(RExC_parse)) {
2619 vFAIL("Quantifier follows nothing");
2622 switch (*++RExC_parse) {
2624 RExC_seen_zerolen++;
2625 ret = reg_node(pRExC_state, SBOL);
2627 nextchar(pRExC_state);
2630 ret = reg_node(pRExC_state, GPOS);
2631 RExC_seen |= REG_SEEN_GPOS;
2633 nextchar(pRExC_state);
2636 ret = reg_node(pRExC_state, SEOL);
2638 nextchar(pRExC_state);
2641 ret = reg_node(pRExC_state, EOS);
2643 RExC_seen_zerolen++; /* Do not optimize RE away */
2644 nextchar(pRExC_state);
2647 ret = reg_node(pRExC_state, SANY);
2648 *flagp |= HASWIDTH|SIMPLE;
2649 nextchar(pRExC_state);
2652 ret = reg_node(pRExC_state, CLUMP);
2654 nextchar(pRExC_state);
2655 if (UTF && !PL_utf8_mark)
2656 is_utf8_mark((U8*)"~"); /* preload table */
2659 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2660 *flagp |= HASWIDTH|SIMPLE;
2661 nextchar(pRExC_state);
2662 if (UTF && !PL_utf8_alnum)
2663 is_utf8_alnum((U8*)"a"); /* preload table */
2666 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2667 *flagp |= HASWIDTH|SIMPLE;
2668 nextchar(pRExC_state);
2669 if (UTF && !PL_utf8_alnum)
2670 is_utf8_alnum((U8*)"a"); /* preload table */
2673 RExC_seen_zerolen++;
2674 RExC_seen |= REG_SEEN_LOOKBEHIND;
2675 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2677 nextchar(pRExC_state);
2678 if (UTF && !PL_utf8_alnum)
2679 is_utf8_alnum((U8*)"a"); /* preload table */
2682 RExC_seen_zerolen++;
2683 RExC_seen |= REG_SEEN_LOOKBEHIND;
2684 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2686 nextchar(pRExC_state);
2687 if (UTF && !PL_utf8_alnum)
2688 is_utf8_alnum((U8*)"a"); /* preload table */
2691 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2692 *flagp |= HASWIDTH|SIMPLE;
2693 nextchar(pRExC_state);
2694 if (UTF && !PL_utf8_space)
2695 is_utf8_space((U8*)" "); /* preload table */
2698 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2699 *flagp |= HASWIDTH|SIMPLE;
2700 nextchar(pRExC_state);
2701 if (UTF && !PL_utf8_space)
2702 is_utf8_space((U8*)" "); /* preload table */
2705 ret = reg_node(pRExC_state, DIGIT);
2706 *flagp |= HASWIDTH|SIMPLE;
2707 nextchar(pRExC_state);
2708 if (UTF && !PL_utf8_digit)
2709 is_utf8_digit((U8*)"1"); /* preload table */
2712 ret = reg_node(pRExC_state, NDIGIT);
2713 *flagp |= HASWIDTH|SIMPLE;
2714 nextchar(pRExC_state);
2715 if (UTF && !PL_utf8_digit)
2716 is_utf8_digit((U8*)"1"); /* preload table */
2720 { /* a lovely hack--pretend we saw [\pX] instead */
2721 char* oldregxend = RExC_end;
2723 if (RExC_parse[1] == '{') {
2724 RExC_end = strchr(RExC_parse, '}');
2727 RExC_end = oldregxend;
2728 vFAIL("Missing right brace on \\p{}");
2733 RExC_end = RExC_parse + 2;
2736 ret = regclass(pRExC_state);
2738 RExC_end = oldregxend;
2740 nextchar(pRExC_state);
2741 *flagp |= HASWIDTH|SIMPLE;
2754 case '1': case '2': case '3': case '4':
2755 case '5': case '6': case '7': case '8': case '9':
2757 I32 num = atoi(RExC_parse);
2759 if (num > 9 && num >= RExC_npar)
2762 while (isDIGIT(*RExC_parse))
2765 if (!SIZE_ONLY && num > RExC_rx->nparens)
2766 vFAIL("Reference to nonexistent group");
2768 ret = reganode(pRExC_state, FOLD
2769 ? (LOC ? REFFL : REFF)
2773 nextchar(pRExC_state);
2778 if (RExC_parse >= RExC_end)
2779 FAIL("Trailing \\");
2782 /* Do not generate `unrecognized' warnings here, we fall
2783 back into the quick-grab loop below */
2789 if (RExC_flags16 & PMf_EXTENDED) {
2790 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2791 if (RExC_parse < RExC_end)
2797 register STRLEN len;
2806 ret = reg_node(pRExC_state, FOLD
2807 ? (LOC ? EXACTFL : EXACTF)
2810 for (len = 0, p = RExC_parse - 1;
2811 len < 127 && p < RExC_end;
2816 if (RExC_flags16 & PMf_EXTENDED)
2817 p = regwhite(p, RExC_end);
2879 char* e = strchr(p, '}');
2883 vFAIL("Missing right brace on \\x{}");
2886 numlen = 1; /* allow underscores */
2887 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2888 /* numlen is generous */
2889 if (numlen + len >= 127) {
2897 numlen = 0; /* disallow underscores */
2898 ender = (UV)scan_hex(p, 2, &numlen);
2904 ender = UCHARAT(p++);
2905 ender = toCTRL(ender);
2907 case '0': case '1': case '2': case '3':case '4':
2908 case '5': case '6': case '7': case '8':case '9':
2910 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
2911 numlen = 0; /* disallow underscores */
2912 ender = (UV)scan_oct(p, 3, &numlen);
2922 FAIL("Trailing \\");
2925 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
2926 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
2927 goto normal_default;
2932 if (UTF8_IS_START(*p) && UTF) {
2933 ender = utf8_to_uv((U8*)p, RExC_end - p,
2941 if (RExC_flags16 & PMf_EXTENDED)
2942 p = regwhite(p, RExC_end);
2945 ender = toLOWER_LC_uni(ender);
2947 ender = toLOWER_uni(ender);
2949 if (ISMULT2(p)) { /* Back off on ?+*. */
2952 /* ender is a Unicode value so it can be > 0xff --
2953 * in other words, do not use UTF8_IS_CONTINUED(). */
2954 else if (ender >= 0x80 && UTF) {
2955 reguni(pRExC_state, ender, s, &numlen);
2965 /* ender is a Unicode value so it can be > 0xff --
2966 * in other words, do not use UTF8_IS_CONTINUED(). */
2967 if (ender >= 0x80 && UTF) {
2968 reguni(pRExC_state, ender, s, &numlen);
2977 nextchar(pRExC_state);
2979 /* len is STRLEN which is unsigned, need to copy to signed */
2982 vFAIL("Internal disaster");
2991 RExC_size += STR_SZ(len);
2993 RExC_emit += STR_SZ(len);
3002 S_regwhite(pTHX_ char *p, char *e)
3007 else if (*p == '#') {
3010 } while (p < e && *p != '\n');
3018 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3019 Character classes ([:foo:]) can also be negated ([:^foo:]).
3020 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3021 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3022 but trigger warnings because they are currently unimplemented. */
3024 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3027 I32 namedclass = OOB_NAMEDCLASS;
3029 if (value == '[' && RExC_parse + 1 < RExC_end &&
3030 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3031 (*RExC_parse == ':' ||
3032 *RExC_parse == '=' ||
3033 *RExC_parse == '.')) {
3034 char c = *RExC_parse;
3035 char* s = RExC_parse++;
3037 while (RExC_parse < RExC_end && *RExC_parse != c)
3039 if (RExC_parse == RExC_end)
3040 /* Grandfather lone [:, [=, [. */
3043 char* t = RExC_parse++; /* skip over the c */
3045 if (*RExC_parse == ']') {
3046 RExC_parse++; /* skip over the ending ] */
3049 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3050 I32 skip = 5; /* the most common skip */
3054 if (strnEQ(posixcc, "alnum", 5))
3056 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3057 else if (strnEQ(posixcc, "alpha", 5))
3059 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3060 else if (strnEQ(posixcc, "ascii", 5))
3062 complement ? ANYOF_NASCII : ANYOF_ASCII;
3065 if (strnEQ(posixcc, "blank", 5))
3067 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3070 if (strnEQ(posixcc, "cntrl", 5))
3072 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3075 if (strnEQ(posixcc, "digit", 5))
3077 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3080 if (strnEQ(posixcc, "graph", 5))
3082 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3085 if (strnEQ(posixcc, "lower", 5))
3087 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3090 if (strnEQ(posixcc, "print", 5))
3092 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3093 else if (strnEQ(posixcc, "punct", 5))
3095 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3098 if (strnEQ(posixcc, "space", 5))
3100 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3103 if (strnEQ(posixcc, "upper", 5))
3105 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3107 case 'w': /* this is not POSIX, this is the Perl \w */
3108 if (strnEQ(posixcc, "word", 4)) {
3110 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3115 if (strnEQ(posixcc, "xdigit", 6)) {
3117 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3122 if (namedclass == OOB_NAMEDCLASS ||
3123 posixcc[skip] != ':' ||
3124 posixcc[skip+1] != ']')
3126 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3129 } else if (!SIZE_ONLY) {
3130 /* [[=foo=]] and [[.foo.]] are still future. */
3132 /* adjust RExC_parse so the warning shows after
3134 while (*RExC_parse && *RExC_parse != ']')
3136 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3139 /* Maternal grandfather:
3140 * "[:" ending in ":" but not in ":]" */
3150 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3152 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3153 (*RExC_parse == ':' ||
3154 *RExC_parse == '=' ||
3155 *RExC_parse == '.')) {
3156 char *s = RExC_parse;
3159 while(*s && isALNUM(*s))
3161 if (*s && c == *s && s[1] == ']') {
3162 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3164 /* [[=foo=]] and [[.foo.]] are still future. */
3165 if (c == '=' || c == '.')
3167 /* adjust RExC_parse so the error shows after
3169 while (*RExC_parse && *RExC_parse++ != ']')
3171 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3178 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3181 register IV lastvalue = OOB_UNICODE;
3182 register IV range = 0;
3183 register regnode *ret;
3187 bool need_class = 0;
3191 bool dont_optimize_invert = FALSE;
3193 ret = reganode(pRExC_state, ANYOF, 0);
3196 ANYOF_FLAGS(ret) = 0;
3198 if (*RExC_parse == '^') { /* Complement of range. */
3202 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3206 RExC_size += ANYOF_SKIP;
3208 RExC_emit += ANYOF_SKIP;
3210 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3212 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3213 ANYOF_BITMAP_ZERO(ret);
3214 listsv = newSVpvn("# comment\n", 10);
3217 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3218 checkposixcc(pRExC_state);
3220 if (*RExC_parse == ']' || *RExC_parse == '-')
3221 goto charclassloop; /* allow 1st char to be ] or - */
3223 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3227 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3230 rangebegin = RExC_parse;
3232 value = utf8_to_uv((U8*)RExC_parse,
3233 RExC_end - RExC_parse,
3235 RExC_parse += numlen;
3238 value = UCHARAT(RExC_parse++);
3240 namedclass = regpposixcc(pRExC_state, value);
3241 else if (value == '\\') {
3243 value = utf8_to_uv((U8*)RExC_parse,
3244 RExC_end - RExC_parse,
3246 RExC_parse += numlen;
3249 value = UCHARAT(RExC_parse++);
3250 /* Some compilers cannot handle switching on 64-bit integer
3251 * values, therefore value cannot be an UV. Yes, this will
3252 * be a problem later if we want switch on Unicode.
3253 * A similar issue a little bit later when switching on
3254 * namedclass. --jhi */
3255 switch ((I32)value) {
3256 case 'w': namedclass = ANYOF_ALNUM; break;
3257 case 'W': namedclass = ANYOF_NALNUM; break;
3258 case 's': namedclass = ANYOF_SPACE; break;
3259 case 'S': namedclass = ANYOF_NSPACE; break;
3260 case 'd': namedclass = ANYOF_DIGIT; break;
3261 case 'D': namedclass = ANYOF_NDIGIT; break;
3264 if (*RExC_parse == '{') {
3265 e = strchr(RExC_parse++, '}');
3267 vFAIL("Missing right brace on \\p{}");
3276 Perl_sv_catpvf(aTHX_ listsv,
3277 "+utf8::%.*s\n", (int)n, RExC_parse);
3279 Perl_sv_catpvf(aTHX_ listsv,
3280 "!utf8::%.*s\n", (int)n, RExC_parse);
3283 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3285 case 'n': value = '\n'; break;
3286 case 'r': value = '\r'; break;
3287 case 't': value = '\t'; break;
3288 case 'f': value = '\f'; break;
3289 case 'b': value = '\b'; break;
3291 case 'e': value = '\033'; break;
3292 case 'a': value = '\007'; break;
3294 case 'e': value = '\047'; break;
3295 case 'a': value = '\057'; break;
3298 if (*RExC_parse == '{') {
3299 e = strchr(RExC_parse++, '}');
3301 vFAIL("Missing right brace on \\x{}");
3302 numlen = 1; /* allow underscores */
3303 value = (UV)scan_hex(RExC_parse,
3309 numlen = 0; /* disallow underscores */
3310 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3311 RExC_parse += numlen;
3315 value = UCHARAT(RExC_parse++);
3316 value = toCTRL(value);
3318 case '0': case '1': case '2': case '3': case '4':
3319 case '5': case '6': case '7': case '8': case '9':
3320 numlen = 0; /* disallow underscores */
3321 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3322 RExC_parse += numlen;
3325 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3327 "Unrecognized escape \\%c in character class passed through",
3331 } /* end of \blah */
3333 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3335 if (!SIZE_ONLY && !need_class)
3336 ANYOF_CLASS_ZERO(ret);
3340 /* a bad range like a-\d, a-[:digit:] ? */
3343 if (ckWARN(WARN_REGEXP))
3345 "False [] range \"%*.*s\"",
3346 RExC_parse - rangebegin,
3347 RExC_parse - rangebegin,
3349 if (lastvalue < 256) {
3350 ANYOF_BITMAP_SET(ret, lastvalue);
3351 ANYOF_BITMAP_SET(ret, '-');
3354 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3355 Perl_sv_catpvf(aTHX_ listsv,
3356 /* 0x002D is Unicode for '-' */
3357 "%04"UVxf"\n002D\n", (UV)lastvalue);
3361 range = 0; /* this was not a true range */
3365 /* Possible truncation here but in some 64-bit environments
3366 * the compiler gets heartburn about switch on 64-bit values.
3367 * A similar issue a little earlier when switching on value.
3369 switch ((I32)namedclass) {
3372 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3374 for (value = 0; value < 256; value++)
3376 ANYOF_BITMAP_SET(ret, value);
3378 dont_optimize_invert = TRUE;
3379 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3383 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3385 for (value = 0; value < 256; value++)
3386 if (!isALNUM(value))
3387 ANYOF_BITMAP_SET(ret, value);
3389 dont_optimize_invert = TRUE;
3390 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3394 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3396 for (value = 0; value < 256; value++)
3397 if (isALNUMC(value))
3398 ANYOF_BITMAP_SET(ret, value);
3400 dont_optimize_invert = TRUE;
3401 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3405 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3407 for (value = 0; value < 256; value++)
3408 if (!isALNUMC(value))
3409 ANYOF_BITMAP_SET(ret, value);
3411 dont_optimize_invert = TRUE;
3412 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3416 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3418 for (value = 0; value < 256; value++)
3420 ANYOF_BITMAP_SET(ret, value);
3422 dont_optimize_invert = TRUE;
3423 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3427 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3429 for (value = 0; value < 256; value++)
3430 if (!isALPHA(value))
3431 ANYOF_BITMAP_SET(ret, value);
3433 dont_optimize_invert = TRUE;
3434 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3438 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3441 for (value = 0; value < 128; value++)
3442 ANYOF_BITMAP_SET(ret, value);
3444 for (value = 0; value < 256; value++)
3446 ANYOF_BITMAP_SET(ret, value);
3449 dont_optimize_invert = TRUE;
3450 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3454 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3457 for (value = 128; value < 256; value++)
3458 ANYOF_BITMAP_SET(ret, value);
3460 for (value = 0; value < 256; value++)
3461 if (!isASCII(value))
3462 ANYOF_BITMAP_SET(ret, value);
3465 dont_optimize_invert = TRUE;
3466 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3470 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3472 for (value = 0; value < 256; value++)
3474 ANYOF_BITMAP_SET(ret, value);
3476 dont_optimize_invert = TRUE;
3477 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3481 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3483 for (value = 0; value < 256; value++)
3484 if (!isBLANK(value))
3485 ANYOF_BITMAP_SET(ret, value);
3487 dont_optimize_invert = TRUE;
3488 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3492 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3494 for (value = 0; value < 256; value++)
3496 ANYOF_BITMAP_SET(ret, value);
3498 dont_optimize_invert = TRUE;
3499 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3503 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3505 for (value = 0; value < 256; value++)
3506 if (!isCNTRL(value))
3507 ANYOF_BITMAP_SET(ret, value);
3509 dont_optimize_invert = TRUE;
3510 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3514 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3516 /* consecutive digits assumed */
3517 for (value = '0'; value <= '9'; value++)
3518 ANYOF_BITMAP_SET(ret, value);
3520 dont_optimize_invert = TRUE;
3521 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3525 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3527 /* consecutive digits assumed */
3528 for (value = 0; value < '0'; value++)
3529 ANYOF_BITMAP_SET(ret, value);
3530 for (value = '9' + 1; value < 256; value++)
3531 ANYOF_BITMAP_SET(ret, value);
3533 dont_optimize_invert = TRUE;
3534 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3538 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3540 for (value = 0; value < 256; value++)
3542 ANYOF_BITMAP_SET(ret, value);
3544 dont_optimize_invert = TRUE;
3545 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3549 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3551 for (value = 0; value < 256; value++)
3552 if (!isGRAPH(value))
3553 ANYOF_BITMAP_SET(ret, value);
3555 dont_optimize_invert = TRUE;
3556 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3560 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3562 for (value = 0; value < 256; value++)
3564 ANYOF_BITMAP_SET(ret, value);
3566 dont_optimize_invert = TRUE;
3567 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3571 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3573 for (value = 0; value < 256; value++)
3574 if (!isLOWER(value))
3575 ANYOF_BITMAP_SET(ret, value);
3577 dont_optimize_invert = TRUE;
3578 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3582 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3584 for (value = 0; value < 256; value++)
3586 ANYOF_BITMAP_SET(ret, value);
3588 dont_optimize_invert = TRUE;
3589 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3593 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3595 for (value = 0; value < 256; value++)
3596 if (!isPRINT(value))
3597 ANYOF_BITMAP_SET(ret, value);
3599 dont_optimize_invert = TRUE;
3600 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3604 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3606 for (value = 0; value < 256; value++)
3607 if (isPSXSPC(value))
3608 ANYOF_BITMAP_SET(ret, value);
3610 dont_optimize_invert = TRUE;
3611 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3615 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3617 for (value = 0; value < 256; value++)
3618 if (!isPSXSPC(value))
3619 ANYOF_BITMAP_SET(ret, value);
3621 dont_optimize_invert = TRUE;
3622 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3626 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3628 for (value = 0; value < 256; value++)
3630 ANYOF_BITMAP_SET(ret, value);
3632 dont_optimize_invert = TRUE;
3633 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3637 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3639 for (value = 0; value < 256; value++)
3640 if (!isPUNCT(value))
3641 ANYOF_BITMAP_SET(ret, value);
3643 dont_optimize_invert = TRUE;
3644 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3648 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3650 for (value = 0; value < 256; value++)
3652 ANYOF_BITMAP_SET(ret, value);
3654 dont_optimize_invert = TRUE;
3655 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3659 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3661 for (value = 0; value < 256; value++)
3662 if (!isSPACE(value))
3663 ANYOF_BITMAP_SET(ret, value);
3665 dont_optimize_invert = TRUE;
3666 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3670 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3672 for (value = 0; value < 256; value++)
3674 ANYOF_BITMAP_SET(ret, value);
3676 dont_optimize_invert = TRUE;
3677 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3681 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3683 for (value = 0; value < 256; value++)
3684 if (!isUPPER(value))
3685 ANYOF_BITMAP_SET(ret, value);
3687 dont_optimize_invert = TRUE;
3688 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3692 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3694 for (value = 0; value < 256; value++)
3695 if (isXDIGIT(value))
3696 ANYOF_BITMAP_SET(ret, value);
3698 dont_optimize_invert = TRUE;
3699 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3703 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3705 for (value = 0; value < 256; value++)
3706 if (!isXDIGIT(value))
3707 ANYOF_BITMAP_SET(ret, value);
3709 dont_optimize_invert = TRUE;
3710 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3713 vFAIL("Invalid [::] class");
3717 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3720 } /* end of namedclass \blah */
3723 if (lastvalue > value) /* b-a */ {
3724 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3725 RExC_parse - rangebegin,
3726 RExC_parse - rangebegin,
3729 range = 0; /* not a true range */
3732 lastvalue = value; /* save the beginning of the range */
3733 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3734 RExC_parse[1] != ']') {
3737 /* a bad range like \w-, [:word:]- ? */
3738 if (namedclass > OOB_NAMEDCLASS) {
3739 if (ckWARN(WARN_REGEXP))
3741 "False [] range \"%*.*s\"",
3742 RExC_parse - rangebegin,
3743 RExC_parse - rangebegin,
3746 ANYOF_BITMAP_SET(ret, '-');
3748 range = 1; /* yeah, it's a range! */
3749 continue; /* but do it the next time */
3753 /* now is the next time */
3755 if (lastvalue < 256 && value < 256) {
3756 #ifndef ASCIIish /* EBCDIC, for example. */
3757 if ((isLOWER(lastvalue) && isLOWER(value)) ||
3758 (isUPPER(lastvalue) && isUPPER(value)))
3761 if (isLOWER(lastvalue)) {
3762 for (i = lastvalue; i <= value; i++)
3764 ANYOF_BITMAP_SET(ret, i);
3766 for (i = lastvalue; i <= value; i++)
3768 ANYOF_BITMAP_SET(ret, i);
3773 for ( ; lastvalue <= value; lastvalue++)
3774 ANYOF_BITMAP_SET(ret, lastvalue);
3776 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3777 if (lastvalue < value)
3778 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3779 (UV)lastvalue, (UV)value);
3781 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3786 range = 0; /* this range (if it was one) is done now */
3791 RExC_size += ANYOF_CLASS_ADD_SKIP;
3793 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3796 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3799 /* If the only flag is folding (plus possibly inversion). */
3800 (ANYOF_FLAGS_ALL ^ ANYOF_INVERT) == ANYOF_FOLD)) {
3801 for (value = 0; value < 256; ++value) {
3802 if (ANYOF_BITMAP_TEST(ret, value)) {
3803 IV fold = PL_fold[value];
3806 ANYOF_BITMAP_SET(ret, fold);
3809 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3812 /* optimize inverted simple patterns (e.g. [^a-z]) */
3813 if (!SIZE_ONLY && !dont_optimize_invert &&
3814 /* If the only flag is inversion. */
3815 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3816 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3817 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3818 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
3825 av_store(av, 0, listsv);
3826 av_store(av, 1, NULL);
3827 rv = newRV_noinc((SV*)av);
3828 n = add_data(pRExC_state, 1, "s");
3829 RExC_rx->data->data[n] = (void*)rv;
3837 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3839 char* retval = RExC_parse++;
3842 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3843 RExC_parse[2] == '#') {
3844 while (*RExC_parse && *RExC_parse != ')')
3849 if (RExC_flags16 & PMf_EXTENDED) {
3850 if (isSPACE(*RExC_parse)) {
3854 else if (*RExC_parse == '#') {
3855 while (*RExC_parse && *RExC_parse != '\n')
3866 - reg_node - emit a node
3868 STATIC regnode * /* Location. */
3869 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3871 register regnode *ret;
3872 register regnode *ptr;
3876 SIZE_ALIGN(RExC_size);
3881 NODE_ALIGN_FILL(ret);
3883 FILL_ADVANCE_NODE(ptr, op);
3890 - reganode - emit a node with an argument
3892 STATIC regnode * /* Location. */
3893 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
3895 register regnode *ret;
3896 register regnode *ptr;
3900 SIZE_ALIGN(RExC_size);
3905 NODE_ALIGN_FILL(ret);
3907 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3914 - reguni - emit (if appropriate) a Unicode character
3917 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
3919 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uv_to_utf8((U8*)s, uv) - (U8*)s);
3923 - reginsert - insert an operator in front of already-emitted operand
3925 * Means relocating the operand.
3928 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
3930 register regnode *src;
3931 register regnode *dst;
3932 register regnode *place;
3933 register int offset = regarglen[(U8)op];
3935 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3938 RExC_size += NODE_STEP_REGNODE + offset;
3943 RExC_emit += NODE_STEP_REGNODE + offset;
3946 StructCopy(--src, --dst, regnode);
3948 place = opnd; /* Op node, where operand used to be. */
3949 src = NEXTOPER(place);
3950 FILL_ADVANCE_NODE(place, op);
3951 Zero(src, offset, regnode);
3955 - regtail - set the next-pointer at the end of a node chain of p to val.
3958 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
3960 register regnode *scan;
3961 register regnode *temp;
3966 /* Find last node. */
3969 temp = regnext(scan);
3975 if (reg_off_by_arg[OP(scan)]) {
3976 ARG_SET(scan, val - scan);
3979 NEXT_OFF(scan) = val - scan;
3984 - regoptail - regtail on operand of first argument; nop if operandless
3987 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
3989 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3990 if (p == NULL || SIZE_ONLY)
3992 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3993 regtail(pRExC_state, NEXTOPER(p), val);
3995 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3996 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4003 - regcurly - a little FSA that accepts {\d+,?\d*}
4006 S_regcurly(pTHX_ register char *s)
4025 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4028 register U8 op = EXACT; /* Arbitrary non-END op. */
4029 register regnode *next;
4031 while (op != END && (!last || node < last)) {
4032 /* While that wasn't END last time... */
4038 next = regnext(node);
4040 if (OP(node) == OPTIMIZED)
4043 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4044 (int)(2*l + 1), "", SvPVX(sv));
4045 if (next == NULL) /* Next ptr. */
4046 PerlIO_printf(Perl_debug_log, "(0)");
4048 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4049 (void)PerlIO_putc(Perl_debug_log, '\n');
4051 if (PL_regkind[(U8)op] == BRANCHJ) {
4052 register regnode *nnode = (OP(next) == LONGJMP
4055 if (last && nnode > last)
4057 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4059 else if (PL_regkind[(U8)op] == BRANCH) {
4060 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4062 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4063 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4064 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4066 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4067 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4070 else if ( op == PLUS || op == STAR) {
4071 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4073 else if (op == ANYOF) {
4074 node = NEXTOPER(node);
4077 else if (PL_regkind[(U8)op] == EXACT) {
4078 /* Literal string, where present. */
4079 node += NODE_SZ_STR(node) - 1;
4080 node = NEXTOPER(node);
4083 node = NEXTOPER(node);
4084 node += regarglen[(U8)op];
4086 if (op == CURLYX || op == OPEN)
4088 else if (op == WHILEM)
4091 #endif /* DEBUGGING */
4096 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4099 Perl_regdump(pTHX_ regexp *r)
4102 SV *sv = sv_newmortal();
4104 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4106 /* Header fields of interest. */
4107 if (r->anchored_substr)
4108 PerlIO_printf(Perl_debug_log,
4109 "anchored `%s%.*s%s'%s at %"IVdf" ",
4111 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4112 SvPVX(r->anchored_substr),
4114 SvTAIL(r->anchored_substr) ? "$" : "",
4115 (IV)r->anchored_offset);
4116 if (r->float_substr)
4117 PerlIO_printf(Perl_debug_log,
4118 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4120 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4121 SvPVX(r->float_substr),
4123 SvTAIL(r->float_substr) ? "$" : "",
4124 (IV)r->float_min_offset, (UV)r->float_max_offset);
4125 if (r->check_substr)
4126 PerlIO_printf(Perl_debug_log,
4127 r->check_substr == r->float_substr
4128 ? "(checking floating" : "(checking anchored");
4129 if (r->reganch & ROPT_NOSCAN)
4130 PerlIO_printf(Perl_debug_log, " noscan");
4131 if (r->reganch & ROPT_CHECK_ALL)
4132 PerlIO_printf(Perl_debug_log, " isall");
4133 if (r->check_substr)
4134 PerlIO_printf(Perl_debug_log, ") ");
4136 if (r->regstclass) {
4137 regprop(sv, r->regstclass);
4138 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4140 if (r->reganch & ROPT_ANCH) {
4141 PerlIO_printf(Perl_debug_log, "anchored");
4142 if (r->reganch & ROPT_ANCH_BOL)
4143 PerlIO_printf(Perl_debug_log, "(BOL)");
4144 if (r->reganch & ROPT_ANCH_MBOL)
4145 PerlIO_printf(Perl_debug_log, "(MBOL)");
4146 if (r->reganch & ROPT_ANCH_SBOL)
4147 PerlIO_printf(Perl_debug_log, "(SBOL)");
4148 if (r->reganch & ROPT_ANCH_GPOS)
4149 PerlIO_printf(Perl_debug_log, "(GPOS)");
4150 PerlIO_putc(Perl_debug_log, ' ');
4152 if (r->reganch & ROPT_GPOS_SEEN)
4153 PerlIO_printf(Perl_debug_log, "GPOS ");
4154 if (r->reganch & ROPT_SKIP)
4155 PerlIO_printf(Perl_debug_log, "plus ");
4156 if (r->reganch & ROPT_IMPLICIT)
4157 PerlIO_printf(Perl_debug_log, "implicit ");
4158 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4159 if (r->reganch & ROPT_EVAL_SEEN)
4160 PerlIO_printf(Perl_debug_log, "with eval ");
4161 PerlIO_printf(Perl_debug_log, "\n");
4162 #endif /* DEBUGGING */
4166 S_put_byte(pTHX_ SV *sv, int c)
4168 if (isCNTRL(c) || c == 127 || c == 255 || !isPRINT(c))
4169 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4170 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4171 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4173 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4177 - regprop - printable representation of opcode
4180 Perl_regprop(pTHX_ SV *sv, regnode *o)
4185 sv_setpvn(sv, "", 0);
4186 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4187 /* It would be nice to FAIL() here, but this may be called from
4188 regexec.c, and it would be hard to supply pRExC_state. */
4189 Perl_croak(aTHX_ "Corrupted regexp opcode");
4190 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4192 k = PL_regkind[(U8)OP(o)];
4195 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4196 STR_LEN(o), STRING(o), PL_colors[1]);
4197 else if (k == CURLY) {
4198 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4199 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4200 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4202 else if (k == WHILEM && o->flags) /* Ordinal/of */
4203 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4204 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4205 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4206 else if (k == LOGICAL)
4207 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4208 else if (k == ANYOF) {
4209 int i, rangestart = -1;
4210 U8 flags = ANYOF_FLAGS(o);
4211 const char * const anyofs[] = { /* Should be syncronized with
4212 * ANYOF_ #xdefines in regcomp.h */
4245 if (flags & ANYOF_LOCALE)
4246 sv_catpv(sv, "{loc}");
4247 if (flags & ANYOF_FOLD)
4248 sv_catpv(sv, "{i}");
4249 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4250 if (flags & ANYOF_INVERT)
4252 for (i = 0; i <= 256; i++) {
4253 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4254 if (rangestart == -1)
4256 } else if (rangestart != -1) {
4257 if (i <= rangestart + 3)
4258 for (; rangestart < i; rangestart++)
4259 put_byte(sv, rangestart);
4261 put_byte(sv, rangestart);
4263 put_byte(sv, i - 1);
4269 if (o->flags & ANYOF_CLASS)
4270 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4271 if (ANYOF_CLASS_TEST(o,i))
4272 sv_catpv(sv, anyofs[i]);
4274 if (flags & ANYOF_UNICODE)
4275 sv_catpv(sv, "{unicode}");
4276 else if (flags & ANYOF_UNICODE_ALL)
4277 sv_catpv(sv, "{all-unicode}");
4281 SV *sw = regclass_swash(o, FALSE, &lv);
4286 U8 s[UTF8_MAXLEN+1];
4288 for (i = 0; i <= 256; i++) { /* just the first 256 */
4289 U8 *e = uv_to_utf8(s, i);
4291 if (i < 256 && swash_fetch(sw, s)) {
4292 if (rangestart == -1)
4294 } else if (rangestart != -1) {
4297 if (i <= rangestart + 3)
4298 for (; rangestart < i; rangestart++) {
4299 for(e = uv_to_utf8(s, rangestart), p = s; p < e; p++)
4303 for (e = uv_to_utf8(s, rangestart), p = s; p < e; p++)
4306 for (e = uv_to_utf8(s, i - 1), p = s; p < e; p++)
4313 sv_catpv(sv, "..."); /* et cetera */
4317 char *s = savepv(SvPVX(lv));
4320 while(*s && *s != '\n') s++;
4341 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4343 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4344 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4345 #endif /* DEBUGGING */
4349 Perl_re_intuit_string(pTHX_ regexp *prog)
4350 { /* Assume that RE_INTUIT is set */
4353 char *s = SvPV(prog->check_substr,n_a);
4355 if (!PL_colorset) reginitcolors();
4356 PerlIO_printf(Perl_debug_log,
4357 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4358 PL_colors[4],PL_colors[5],PL_colors[0],
4361 (strlen(s) > 60 ? "..." : ""));
4364 return prog->check_substr;
4368 Perl_pregfree(pTHX_ struct regexp *r)
4370 DEBUG_r(if (!PL_colorset) reginitcolors());
4372 if (!r || (--r->refcnt > 0))
4374 DEBUG_r(PerlIO_printf(Perl_debug_log,
4375 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4376 PL_colors[4],PL_colors[5],PL_colors[0],
4379 (strlen(r->precomp) > 60 ? "..." : "")));
4382 Safefree(r->precomp);
4383 if (RX_MATCH_COPIED(r))
4384 Safefree(r->subbeg);
4386 if (r->anchored_substr)
4387 SvREFCNT_dec(r->anchored_substr);
4388 if (r->float_substr)
4389 SvREFCNT_dec(r->float_substr);
4390 Safefree(r->substrs);
4393 int n = r->data->count;
4394 AV* new_comppad = NULL;
4399 switch (r->data->what[n]) {
4401 SvREFCNT_dec((SV*)r->data->data[n]);
4404 Safefree(r->data->data[n]);
4407 new_comppad = (AV*)r->data->data[n];
4410 if (new_comppad == NULL)
4411 Perl_croak(aTHX_ "panic: pregfree comppad");
4412 old_comppad = PL_comppad;
4413 old_curpad = PL_curpad;
4414 /* Watch out for global destruction's random ordering. */
4415 if (SvTYPE(new_comppad) == SVt_PVAV) {
4416 PL_comppad = new_comppad;
4417 PL_curpad = AvARRAY(new_comppad);
4421 op_free((OP_4tree*)r->data->data[n]);
4422 PL_comppad = old_comppad;
4423 PL_curpad = old_curpad;
4424 SvREFCNT_dec((SV*)new_comppad);
4430 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4433 Safefree(r->data->what);
4436 Safefree(r->startp);
4442 - regnext - dig the "next" pointer out of a node
4444 * [Note, when REGALIGN is defined there are two places in regmatch()
4445 * that bypass this code for speed.]
4448 Perl_regnext(pTHX_ register regnode *p)
4450 register I32 offset;
4452 if (p == &PL_regdummy)
4455 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4463 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4466 STRLEN l1 = strlen(pat1);
4467 STRLEN l2 = strlen(pat2);
4476 Copy(pat1, buf, l1 , char);
4477 Copy(pat2, buf + l1, l2 , char);
4478 buf[l1 + l2] = '\n';
4479 buf[l1 + l2 + 1] = '\0';
4481 /* ANSI variant takes additional second argument */
4482 va_start(args, pat2);
4486 msv = vmess(buf, &args);
4488 message = SvPV(msv,l1);
4491 Copy(message, buf, l1 , char);
4492 buf[l1] = '\0'; /* Overwrite \n */
4493 Perl_croak(aTHX_ "%s", buf);
4496 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4499 Perl_save_re_context(pTHX)
4502 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4503 SAVEI32(RExC_npar); /* () count. */
4504 SAVEI32(RExC_size); /* Code size. */
4505 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4506 SAVEVPTR(RExC_rx); /* from regcomp.c */
4507 SAVEI32(RExC_seen); /* from regcomp.c */
4508 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4509 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4510 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4511 SAVEPPTR(RExC_end); /* End of input for compile */
4512 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4515 SAVEI32(PL_reg_flags); /* from regexec.c */
4517 SAVEPPTR(PL_reginput); /* String-input pointer. */
4518 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4519 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4520 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4521 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4522 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4523 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4524 SAVEI8(PL_regprev); /* char before regbol, \n if none */
4525 SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */
4526 PL_reg_start_tmp = 0;
4527 SAVEFREEPV(PL_reg_start_tmp);
4528 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4529 PL_reg_start_tmpl = 0;
4530 SAVEVPTR(PL_regdata);
4531 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4532 SAVEI32(PL_regnarrate); /* from regexec.c */
4533 SAVEVPTR(PL_regprogram); /* from regexec.c */
4534 SAVEINT(PL_regindent); /* from regexec.c */
4535 SAVEVPTR(PL_regcc); /* from regexec.c */
4536 SAVEVPTR(PL_curcop);
4537 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4538 SAVEVPTR(PL_reg_re); /* from regexec.c */
4539 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4540 SAVESPTR(PL_reg_sv); /* from regexec.c */
4541 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4542 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4543 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4544 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4545 SAVEI32(PL_regnpar); /* () count. */
4547 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4558 clear_re(pTHXo_ void *r)
4560 ReREFCNT_dec((regexp *)r);
projects / p5sagit/p5-mst-13.2.git / blob