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 *start; /* Start of input for compile */
119 char *end; /* End of input for compile */
120 char *parse; /* Input-scan pointer. */
121 I32 whilem_seen; /* number of WHILEM in this expr */
122 regnode *emit_start; /* Start of emitted-code area */
123 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
124 I32 naughty; /* How bad is this pattern? */
125 I32 sawback; /* Did we see \1, ...? */
127 I32 size; /* Code size. */
128 I32 npar; /* () count. */
134 char *starttry; /* -Dr: where regtry was called. */
135 #define RExC_starttry (pRExC_state->starttry)
139 #define RExC_flags16 (pRExC_state->flags16)
140 #define RExC_precomp (pRExC_state->precomp)
141 #define RExC_rx (pRExC_state->rx)
142 #define RExC_start (pRExC_state->start)
143 #define RExC_end (pRExC_state->end)
144 #define RExC_parse (pRExC_state->parse)
145 #define RExC_whilem_seen (pRExC_state->whilem_seen)
146 #define RExC_offsets (pRExC_state->rx->offsets) /* I am not like the others */
147 #define RExC_emit (pRExC_state->emit)
148 #define RExC_emit_start (pRExC_state->emit_start)
149 #define RExC_naughty (pRExC_state->naughty)
150 #define RExC_sawback (pRExC_state->sawback)
151 #define RExC_seen (pRExC_state->seen)
152 #define RExC_size (pRExC_state->size)
153 #define RExC_npar (pRExC_state->npar)
154 #define RExC_extralen (pRExC_state->extralen)
155 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
156 #define RExC_seen_evals (pRExC_state->seen_evals)
157 #define RExC_utf8 (pRExC_state->utf8)
159 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
160 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
161 ((*s) == '{' && regcurly(s)))
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 " in regex; marked by " MARKER1 " in 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 /* Macros for recording node offsets. 20001227 mjd@plover.com
426 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
427 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
428 * Element 0 holds the number n.
431 #define MJD_OFFSET_DEBUG(x)
432 /* #define MJD_OFFSET_DEBUG(x) fprintf x */
435 # define Set_Node_Offset_To_R(node,byte) \
439 Perl_croak(aTHX_ "value of node is %d in Offset macro", node); \
441 RExC_offsets[2*(node)-1] = (byte); \
446 # define Set_Node_Offset(node,byte) Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
447 # define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
449 # define Set_Node_Length_To_R(node,len) \
452 MJD_OFFSET_DEBUG((stderr, "** (%d) size of node %d is %d.\n", __LINE__, (node), (len))); \
454 Perl_croak(aTHX_ "value of node is %d in Length macro", node); \
456 RExC_offsets[2*(node)] = (len); \
461 # define Set_Node_Length(node,len) Set_Node_Length_To_R((node)-RExC_emit_start, len)
462 # define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
463 # define Set_Node_Cur_Length(node) Set_Node_Length(node, RExC_parse - parse_start)
465 /* Get offsets and lengths */
466 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
467 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
469 static void clear_re(pTHXo_ void *r);
471 /* Mark that we cannot extend a found fixed substring at this point.
472 Updata the longest found anchored substring and the longest found
473 floating substrings if needed. */
476 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
478 STRLEN l = CHR_SVLEN(data->last_found);
479 STRLEN old_l = CHR_SVLEN(*data->longest);
481 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
482 sv_setsv(*data->longest, data->last_found);
483 if (*data->longest == data->longest_fixed) {
484 data->offset_fixed = l ? data->last_start_min : data->pos_min;
485 if (data->flags & SF_BEFORE_EOL)
487 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
489 data->flags &= ~SF_FIX_BEFORE_EOL;
492 data->offset_float_min = l ? data->last_start_min : data->pos_min;
493 data->offset_float_max = (l
494 ? data->last_start_max
495 : data->pos_min + data->pos_delta);
496 if (data->flags & SF_BEFORE_EOL)
498 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
500 data->flags &= ~SF_FL_BEFORE_EOL;
503 SvCUR_set(data->last_found, 0);
505 data->flags &= ~SF_BEFORE_EOL;
508 /* Can match anything (initialization) */
510 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
514 ANYOF_CLASS_ZERO(cl);
515 for (value = 0; value < 256; ++value)
516 ANYOF_BITMAP_SET(cl, value);
517 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
519 cl->flags |= ANYOF_LOCALE;
522 /* Can match anything (initialization) */
524 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
528 for (value = 0; value <= ANYOF_MAX; value += 2)
529 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
531 if (!(cl->flags & ANYOF_UNICODE_ALL))
533 for (value = 0; value < 256; ++value)
534 if (!ANYOF_BITMAP_TEST(cl, value))
539 /* Can match anything (initialization) */
541 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
543 Zero(cl, 1, struct regnode_charclass_class);
545 cl_anything(pRExC_state, cl);
549 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
551 Zero(cl, 1, struct regnode_charclass_class);
553 cl_anything(pRExC_state, cl);
555 cl->flags |= ANYOF_LOCALE;
558 /* 'And' a given class with another one. Can create false positives */
559 /* We assume that cl is not inverted */
561 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
562 struct regnode_charclass_class *and_with)
564 if (!(and_with->flags & ANYOF_CLASS)
565 && !(cl->flags & ANYOF_CLASS)
566 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
567 && !(and_with->flags & ANYOF_FOLD)
568 && !(cl->flags & ANYOF_FOLD)) {
571 if (and_with->flags & ANYOF_INVERT)
572 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
573 cl->bitmap[i] &= ~and_with->bitmap[i];
575 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
576 cl->bitmap[i] &= and_with->bitmap[i];
577 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
578 if (!(and_with->flags & ANYOF_EOS))
579 cl->flags &= ~ANYOF_EOS;
581 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE) {
582 cl->flags &= ~ANYOF_UNICODE_ALL;
583 cl->flags |= ANYOF_UNICODE;
584 ARG_SET(cl, ARG(and_with));
586 if (!(and_with->flags & ANYOF_UNICODE_ALL))
587 cl->flags &= ~ANYOF_UNICODE_ALL;
588 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)))
589 cl->flags &= ~ANYOF_UNICODE;
592 /* 'OR' a given class with another one. Can create false positives */
593 /* We assume that cl is not inverted */
595 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
597 if (or_with->flags & ANYOF_INVERT) {
599 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
600 * <= (B1 | !B2) | (CL1 | !CL2)
601 * which is wasteful if CL2 is small, but we ignore CL2:
602 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
603 * XXXX Can we handle case-fold? Unclear:
604 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
605 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
607 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
608 && !(or_with->flags & ANYOF_FOLD)
609 && !(cl->flags & ANYOF_FOLD) ) {
612 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
613 cl->bitmap[i] |= ~or_with->bitmap[i];
614 } /* XXXX: logic is complicated otherwise */
616 cl_anything(pRExC_state, cl);
619 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
620 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
621 && (!(or_with->flags & ANYOF_FOLD)
622 || (cl->flags & ANYOF_FOLD)) ) {
625 /* OR char bitmap and class bitmap separately */
626 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
627 cl->bitmap[i] |= or_with->bitmap[i];
628 if (or_with->flags & ANYOF_CLASS) {
629 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
630 cl->classflags[i] |= or_with->classflags[i];
631 cl->flags |= ANYOF_CLASS;
634 else { /* XXXX: logic is complicated, leave it along for a moment. */
635 cl_anything(pRExC_state, cl);
638 if (or_with->flags & ANYOF_EOS)
639 cl->flags |= ANYOF_EOS;
641 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
642 ARG(cl) != ARG(or_with)) {
643 cl->flags |= ANYOF_UNICODE_ALL;
644 cl->flags &= ~ANYOF_UNICODE;
646 if (or_with->flags & ANYOF_UNICODE_ALL) {
647 cl->flags |= ANYOF_UNICODE_ALL;
648 cl->flags &= ~ANYOF_UNICODE;
652 /* REx optimizer. Converts nodes into quickier variants "in place".
653 Finds fixed substrings. */
655 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
656 to the position after last scanned or to NULL. */
659 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
660 /* scanp: Start here (read-write). */
661 /* deltap: Write maxlen-minlen here. */
662 /* last: Stop before this one. */
664 I32 min = 0, pars = 0, code;
665 regnode *scan = *scanp, *next;
667 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
668 int is_inf_internal = 0; /* The studied chunk is infinite */
669 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
670 scan_data_t data_fake;
671 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
673 while (scan && OP(scan) != END && scan < last) {
674 /* Peephole optimizer: */
676 if (PL_regkind[(U8)OP(scan)] == EXACT) {
677 /* Merge several consecutive EXACTish nodes into one. */
678 regnode *n = regnext(scan);
681 regnode *stop = scan;
684 next = scan + NODE_SZ_STR(scan);
685 /* Skip NOTHING, merge EXACT*. */
687 ( PL_regkind[(U8)OP(n)] == NOTHING ||
688 (stringok && (OP(n) == OP(scan))))
690 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
691 if (OP(n) == TAIL || n > next)
693 if (PL_regkind[(U8)OP(n)] == NOTHING) {
694 NEXT_OFF(scan) += NEXT_OFF(n);
695 next = n + NODE_STEP_REGNODE;
703 int oldl = STR_LEN(scan);
704 regnode *nnext = regnext(n);
706 if (oldl + STR_LEN(n) > U8_MAX)
708 NEXT_OFF(scan) += NEXT_OFF(n);
709 STR_LEN(scan) += STR_LEN(n);
710 next = n + NODE_SZ_STR(n);
711 /* Now we can overwrite *n : */
712 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
721 n = scan + NODE_SZ_STR(scan);
723 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
731 /* Follow the next-chain of the current node and optimize
732 away all the NOTHINGs from it. */
733 if (OP(scan) != CURLYX) {
734 int max = (reg_off_by_arg[OP(scan)]
736 /* I32 may be smaller than U16 on CRAYs! */
737 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
738 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
742 /* Skip NOTHING and LONGJMP. */
743 while ((n = regnext(n))
744 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
745 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
748 if (reg_off_by_arg[OP(scan)])
751 NEXT_OFF(scan) = off;
753 /* The principal pseudo-switch. Cannot be a switch, since we
754 look into several different things. */
755 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
756 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
757 next = regnext(scan);
760 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
761 I32 max1 = 0, min1 = I32_MAX, num = 0;
762 struct regnode_charclass_class accum;
764 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
765 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
766 if (flags & SCF_DO_STCLASS)
767 cl_init_zero(pRExC_state, &accum);
768 while (OP(scan) == code) {
769 I32 deltanext, minnext, f = 0, fake;
770 struct regnode_charclass_class this_class;
775 data_fake.whilem_c = data->whilem_c;
776 data_fake.last_closep = data->last_closep;
779 data_fake.last_closep = &fake;
780 next = regnext(scan);
781 scan = NEXTOPER(scan);
783 scan = NEXTOPER(scan);
784 if (flags & SCF_DO_STCLASS) {
785 cl_init(pRExC_state, &this_class);
786 data_fake.start_class = &this_class;
787 f = SCF_DO_STCLASS_AND;
789 if (flags & SCF_WHILEM_VISITED_POS)
790 f |= SCF_WHILEM_VISITED_POS;
791 /* we suppose the run is continuous, last=next...*/
792 minnext = study_chunk(pRExC_state, &scan, &deltanext,
793 next, &data_fake, f);
796 if (max1 < minnext + deltanext)
797 max1 = minnext + deltanext;
798 if (deltanext == I32_MAX)
799 is_inf = is_inf_internal = 1;
801 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
803 if (data && (data_fake.flags & SF_HAS_EVAL))
804 data->flags |= SF_HAS_EVAL;
806 data->whilem_c = data_fake.whilem_c;
807 if (flags & SCF_DO_STCLASS)
808 cl_or(pRExC_state, &accum, &this_class);
812 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
814 if (flags & SCF_DO_SUBSTR) {
815 data->pos_min += min1;
816 data->pos_delta += max1 - min1;
817 if (max1 != min1 || is_inf)
818 data->longest = &(data->longest_float);
821 delta += max1 - min1;
822 if (flags & SCF_DO_STCLASS_OR) {
823 cl_or(pRExC_state, data->start_class, &accum);
825 cl_and(data->start_class, &and_with);
826 flags &= ~SCF_DO_STCLASS;
829 else if (flags & SCF_DO_STCLASS_AND) {
831 cl_and(data->start_class, &accum);
832 flags &= ~SCF_DO_STCLASS;
835 /* Switch to OR mode: cache the old value of
836 * data->start_class */
837 StructCopy(data->start_class, &and_with,
838 struct regnode_charclass_class);
839 flags &= ~SCF_DO_STCLASS_AND;
840 StructCopy(&accum, data->start_class,
841 struct regnode_charclass_class);
842 flags |= SCF_DO_STCLASS_OR;
843 data->start_class->flags |= ANYOF_EOS;
847 else if (code == BRANCHJ) /* single branch is optimized. */
848 scan = NEXTOPER(NEXTOPER(scan));
849 else /* single branch is optimized. */
850 scan = NEXTOPER(scan);
853 else if (OP(scan) == EXACT) {
854 I32 l = STR_LEN(scan);
855 UV uc = *((U8*)STRING(scan));
857 U8 *s = (U8*)STRING(scan);
858 l = utf8_length(s, s + l);
859 uc = utf8_to_uvchr(s, NULL);
862 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
863 /* The code below prefers earlier match for fixed
864 offset, later match for variable offset. */
865 if (data->last_end == -1) { /* Update the start info. */
866 data->last_start_min = data->pos_min;
867 data->last_start_max = is_inf
868 ? I32_MAX : data->pos_min + data->pos_delta;
870 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
871 data->last_end = data->pos_min + l;
872 data->pos_min += l; /* As in the first entry. */
873 data->flags &= ~SF_BEFORE_EOL;
875 if (flags & SCF_DO_STCLASS_AND) {
876 /* Check whether it is compatible with what we know already! */
880 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
881 && !ANYOF_BITMAP_TEST(data->start_class, uc)
882 && (!(data->start_class->flags & ANYOF_FOLD)
883 || !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;
892 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
894 else if (flags & SCF_DO_STCLASS_OR) {
895 /* false positive possible if the class is case-folded */
897 ANYOF_BITMAP_SET(data->start_class, uc);
899 data->start_class->flags |= ANYOF_UNICODE_ALL;
900 data->start_class->flags &= ~ANYOF_EOS;
901 cl_and(data->start_class, &and_with);
903 flags &= ~SCF_DO_STCLASS;
905 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
906 I32 l = STR_LEN(scan);
907 UV uc = *((U8*)STRING(scan));
909 /* Search for fixed substrings supports EXACT only. */
910 if (flags & SCF_DO_SUBSTR)
911 scan_commit(pRExC_state, data);
913 U8 *s = (U8 *)STRING(scan);
914 l = utf8_length(s, s + l);
915 uc = utf8_to_uvchr(s, NULL);
918 if (data && (flags & SCF_DO_SUBSTR))
920 if (flags & SCF_DO_STCLASS_AND) {
921 /* Check whether it is compatible with what we know already! */
925 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
926 && !ANYOF_BITMAP_TEST(data->start_class, uc)
927 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
929 ANYOF_CLASS_ZERO(data->start_class);
930 ANYOF_BITMAP_ZERO(data->start_class);
932 ANYOF_BITMAP_SET(data->start_class, uc);
933 data->start_class->flags &= ~ANYOF_EOS;
934 data->start_class->flags |= ANYOF_FOLD;
935 if (OP(scan) == EXACTFL)
936 data->start_class->flags |= ANYOF_LOCALE;
939 else if (flags & SCF_DO_STCLASS_OR) {
940 if (data->start_class->flags & ANYOF_FOLD) {
941 /* false positive possible if the class is case-folded.
942 Assume that the locale settings are the same... */
944 ANYOF_BITMAP_SET(data->start_class, uc);
945 data->start_class->flags &= ~ANYOF_EOS;
947 cl_and(data->start_class, &and_with);
949 flags &= ~SCF_DO_STCLASS;
951 else if (strchr((char*)PL_varies,OP(scan))) {
952 I32 mincount, maxcount, minnext, deltanext, fl = 0;
953 I32 f = flags, pos_before = 0;
954 regnode *oscan = scan;
955 struct regnode_charclass_class this_class;
956 struct regnode_charclass_class *oclass = NULL;
958 switch (PL_regkind[(U8)OP(scan)]) {
959 case WHILEM: /* End of (?:...)* . */
960 scan = NEXTOPER(scan);
963 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
964 next = NEXTOPER(scan);
965 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
967 maxcount = REG_INFTY;
968 next = regnext(scan);
969 scan = NEXTOPER(scan);
973 if (flags & SCF_DO_SUBSTR)
978 if (flags & SCF_DO_STCLASS) {
980 maxcount = REG_INFTY;
981 next = regnext(scan);
982 scan = NEXTOPER(scan);
985 is_inf = is_inf_internal = 1;
986 scan = regnext(scan);
987 if (flags & SCF_DO_SUBSTR) {
988 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
989 data->longest = &(data->longest_float);
991 goto optimize_curly_tail;
993 mincount = ARG1(scan);
994 maxcount = ARG2(scan);
995 next = regnext(scan);
996 if (OP(scan) == CURLYX) {
997 I32 lp = (data ? *(data->last_closep) : 0);
999 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
1001 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
1003 if (flags & SCF_DO_SUBSTR) {
1004 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
1005 pos_before = data->pos_min;
1009 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
1011 data->flags |= SF_IS_INF;
1013 if (flags & SCF_DO_STCLASS) {
1014 cl_init(pRExC_state, &this_class);
1015 oclass = data->start_class;
1016 data->start_class = &this_class;
1017 f |= SCF_DO_STCLASS_AND;
1018 f &= ~SCF_DO_STCLASS_OR;
1020 /* These are the cases when once a subexpression
1021 fails at a particular position, it cannot succeed
1022 even after backtracking at the enclosing scope.
1024 XXXX what if minimal match and we are at the
1025 initial run of {n,m}? */
1026 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
1027 f &= ~SCF_WHILEM_VISITED_POS;
1029 /* This will finish on WHILEM, setting scan, or on NULL: */
1030 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
1032 ? (f & ~SCF_DO_SUBSTR) : f);
1034 if (flags & SCF_DO_STCLASS)
1035 data->start_class = oclass;
1036 if (mincount == 0 || minnext == 0) {
1037 if (flags & SCF_DO_STCLASS_OR) {
1038 cl_or(pRExC_state, data->start_class, &this_class);
1040 else if (flags & SCF_DO_STCLASS_AND) {
1041 /* Switch to OR mode: cache the old value of
1042 * data->start_class */
1043 StructCopy(data->start_class, &and_with,
1044 struct regnode_charclass_class);
1045 flags &= ~SCF_DO_STCLASS_AND;
1046 StructCopy(&this_class, data->start_class,
1047 struct regnode_charclass_class);
1048 flags |= SCF_DO_STCLASS_OR;
1049 data->start_class->flags |= ANYOF_EOS;
1051 } else { /* Non-zero len */
1052 if (flags & SCF_DO_STCLASS_OR) {
1053 cl_or(pRExC_state, data->start_class, &this_class);
1054 cl_and(data->start_class, &and_with);
1056 else if (flags & SCF_DO_STCLASS_AND)
1057 cl_and(data->start_class, &this_class);
1058 flags &= ~SCF_DO_STCLASS;
1060 if (!scan) /* It was not CURLYX, but CURLY. */
1062 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
1063 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1064 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1067 "Quantifier unexpected on zero-length expression");
1070 min += minnext * mincount;
1071 is_inf_internal |= ((maxcount == REG_INFTY
1072 && (minnext + deltanext) > 0)
1073 || deltanext == I32_MAX);
1074 is_inf |= is_inf_internal;
1075 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1077 /* Try powerful optimization CURLYX => CURLYN. */
1078 if ( OP(oscan) == CURLYX && data
1079 && data->flags & SF_IN_PAR
1080 && !(data->flags & SF_HAS_EVAL)
1081 && !deltanext && minnext == 1 ) {
1082 /* Try to optimize to CURLYN. */
1083 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1084 regnode *nxt1 = nxt, *nxt2;
1088 if (!strchr((char*)PL_simple,OP(nxt))
1089 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1090 && STR_LEN(nxt) == 1))
1094 if (OP(nxt) != CLOSE)
1096 /* Now we know that nxt2 is the only contents: */
1097 oscan->flags = ARG(nxt);
1099 OP(nxt1) = NOTHING; /* was OPEN. */
1101 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1102 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1103 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1104 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1105 OP(nxt + 1) = OPTIMIZED; /* was count. */
1106 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1111 /* Try optimization CURLYX => CURLYM. */
1112 if ( OP(oscan) == CURLYX && data
1113 && !(data->flags & SF_HAS_PAR)
1114 && !(data->flags & SF_HAS_EVAL)
1116 /* XXXX How to optimize if data == 0? */
1117 /* Optimize to a simpler form. */
1118 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1122 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1123 && (OP(nxt2) != WHILEM))
1125 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1126 /* Need to optimize away parenths. */
1127 if (data->flags & SF_IN_PAR) {
1128 /* Set the parenth number. */
1129 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1131 if (OP(nxt) != CLOSE)
1132 FAIL("Panic opt close");
1133 oscan->flags = ARG(nxt);
1134 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1135 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1137 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1138 OP(nxt + 1) = OPTIMIZED; /* was count. */
1139 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1140 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1143 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1144 regnode *nnxt = regnext(nxt1);
1147 if (reg_off_by_arg[OP(nxt1)])
1148 ARG_SET(nxt1, nxt2 - nxt1);
1149 else if (nxt2 - nxt1 < U16_MAX)
1150 NEXT_OFF(nxt1) = nxt2 - nxt1;
1152 OP(nxt) = NOTHING; /* Cannot beautify */
1157 /* Optimize again: */
1158 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1164 else if ((OP(oscan) == CURLYX)
1165 && (flags & SCF_WHILEM_VISITED_POS)
1166 /* See the comment on a similar expression above.
1167 However, this time it not a subexpression
1168 we care about, but the expression itself. */
1169 && (maxcount == REG_INFTY)
1170 && data && ++data->whilem_c < 16) {
1171 /* This stays as CURLYX, we can put the count/of pair. */
1172 /* Find WHILEM (as in regexec.c) */
1173 regnode *nxt = oscan + NEXT_OFF(oscan);
1175 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1177 PREVOPER(nxt)->flags = data->whilem_c
1178 | (RExC_whilem_seen << 4); /* On WHILEM */
1180 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1182 if (flags & SCF_DO_SUBSTR) {
1183 SV *last_str = Nullsv;
1184 int counted = mincount != 0;
1186 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1187 I32 b = pos_before >= data->last_start_min
1188 ? pos_before : data->last_start_min;
1190 char *s = SvPV(data->last_found, l);
1191 I32 old = b - data->last_start_min;
1194 old = utf8_hop((U8*)s, old) - (U8*)s;
1197 /* Get the added string: */
1198 last_str = newSVpvn(s + old, l);
1199 if (deltanext == 0 && pos_before == b) {
1200 /* What was added is a constant string */
1202 SvGROW(last_str, (mincount * l) + 1);
1203 repeatcpy(SvPVX(last_str) + l,
1204 SvPVX(last_str), l, mincount - 1);
1205 SvCUR(last_str) *= mincount;
1206 /* Add additional parts. */
1207 SvCUR_set(data->last_found,
1208 SvCUR(data->last_found) - l);
1209 sv_catsv(data->last_found, last_str);
1210 data->last_end += l * (mincount - 1);
1213 /* start offset must point into the last copy */
1214 data->last_start_min += minnext * (mincount - 1);
1215 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1216 * (minnext + data->pos_delta);
1219 /* It is counted once already... */
1220 data->pos_min += minnext * (mincount - counted);
1221 data->pos_delta += - counted * deltanext +
1222 (minnext + deltanext) * maxcount - minnext * mincount;
1223 if (mincount != maxcount) {
1224 /* Cannot extend fixed substrings found inside
1226 scan_commit(pRExC_state,data);
1227 if (mincount && last_str) {
1228 sv_setsv(data->last_found, last_str);
1229 data->last_end = data->pos_min;
1230 data->last_start_min =
1231 data->pos_min - CHR_SVLEN(last_str);
1232 data->last_start_max = is_inf
1234 : data->pos_min + data->pos_delta
1235 - CHR_SVLEN(last_str);
1237 data->longest = &(data->longest_float);
1239 SvREFCNT_dec(last_str);
1241 if (data && (fl & SF_HAS_EVAL))
1242 data->flags |= SF_HAS_EVAL;
1243 optimize_curly_tail:
1244 if (OP(oscan) != CURLYX) {
1245 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1247 NEXT_OFF(oscan) += NEXT_OFF(next);
1250 default: /* REF and CLUMP only? */
1251 if (flags & SCF_DO_SUBSTR) {
1252 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1253 data->longest = &(data->longest_float);
1255 is_inf = is_inf_internal = 1;
1256 if (flags & SCF_DO_STCLASS_OR)
1257 cl_anything(pRExC_state, data->start_class);
1258 flags &= ~SCF_DO_STCLASS;
1262 else if (strchr((char*)PL_simple,OP(scan))) {
1265 if (flags & SCF_DO_SUBSTR) {
1266 scan_commit(pRExC_state,data);
1270 if (flags & SCF_DO_STCLASS) {
1271 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1273 /* Some of the logic below assumes that switching
1274 locale on will only add false positives. */
1275 switch (PL_regkind[(U8)OP(scan)]) {
1279 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1280 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1281 cl_anything(pRExC_state, data->start_class);
1284 if (OP(scan) == SANY)
1286 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1287 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1288 || (data->start_class->flags & ANYOF_CLASS));
1289 cl_anything(pRExC_state, data->start_class);
1291 if (flags & SCF_DO_STCLASS_AND || !value)
1292 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1295 if (flags & SCF_DO_STCLASS_AND)
1296 cl_and(data->start_class,
1297 (struct regnode_charclass_class*)scan);
1299 cl_or(pRExC_state, data->start_class,
1300 (struct regnode_charclass_class*)scan);
1303 if (flags & SCF_DO_STCLASS_AND) {
1304 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1305 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1306 for (value = 0; value < 256; value++)
1307 if (!isALNUM(value))
1308 ANYOF_BITMAP_CLEAR(data->start_class, value);
1312 if (data->start_class->flags & ANYOF_LOCALE)
1313 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1315 for (value = 0; value < 256; value++)
1317 ANYOF_BITMAP_SET(data->start_class, value);
1322 if (flags & SCF_DO_STCLASS_AND) {
1323 if (data->start_class->flags & ANYOF_LOCALE)
1324 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1327 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1328 data->start_class->flags |= ANYOF_LOCALE;
1332 if (flags & SCF_DO_STCLASS_AND) {
1333 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1334 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1335 for (value = 0; value < 256; value++)
1337 ANYOF_BITMAP_CLEAR(data->start_class, value);
1341 if (data->start_class->flags & ANYOF_LOCALE)
1342 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1344 for (value = 0; value < 256; value++)
1345 if (!isALNUM(value))
1346 ANYOF_BITMAP_SET(data->start_class, value);
1351 if (flags & SCF_DO_STCLASS_AND) {
1352 if (data->start_class->flags & ANYOF_LOCALE)
1353 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1356 data->start_class->flags |= ANYOF_LOCALE;
1357 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1361 if (flags & SCF_DO_STCLASS_AND) {
1362 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1363 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1364 for (value = 0; value < 256; value++)
1365 if (!isSPACE(value))
1366 ANYOF_BITMAP_CLEAR(data->start_class, value);
1370 if (data->start_class->flags & ANYOF_LOCALE)
1371 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1373 for (value = 0; value < 256; value++)
1375 ANYOF_BITMAP_SET(data->start_class, value);
1380 if (flags & SCF_DO_STCLASS_AND) {
1381 if (data->start_class->flags & ANYOF_LOCALE)
1382 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1385 data->start_class->flags |= ANYOF_LOCALE;
1386 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1390 if (flags & SCF_DO_STCLASS_AND) {
1391 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1392 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1393 for (value = 0; value < 256; value++)
1395 ANYOF_BITMAP_CLEAR(data->start_class, value);
1399 if (data->start_class->flags & ANYOF_LOCALE)
1400 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1402 for (value = 0; value < 256; value++)
1403 if (!isSPACE(value))
1404 ANYOF_BITMAP_SET(data->start_class, value);
1409 if (flags & SCF_DO_STCLASS_AND) {
1410 if (data->start_class->flags & ANYOF_LOCALE) {
1411 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1412 for (value = 0; value < 256; value++)
1413 if (!isSPACE(value))
1414 ANYOF_BITMAP_CLEAR(data->start_class, value);
1418 data->start_class->flags |= ANYOF_LOCALE;
1419 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1423 if (flags & SCF_DO_STCLASS_AND) {
1424 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1425 for (value = 0; value < 256; value++)
1426 if (!isDIGIT(value))
1427 ANYOF_BITMAP_CLEAR(data->start_class, value);
1430 if (data->start_class->flags & ANYOF_LOCALE)
1431 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1433 for (value = 0; value < 256; value++)
1435 ANYOF_BITMAP_SET(data->start_class, value);
1440 if (flags & SCF_DO_STCLASS_AND) {
1441 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1442 for (value = 0; value < 256; value++)
1444 ANYOF_BITMAP_CLEAR(data->start_class, value);
1447 if (data->start_class->flags & ANYOF_LOCALE)
1448 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1450 for (value = 0; value < 256; value++)
1451 if (!isDIGIT(value))
1452 ANYOF_BITMAP_SET(data->start_class, value);
1457 if (flags & SCF_DO_STCLASS_OR)
1458 cl_and(data->start_class, &and_with);
1459 flags &= ~SCF_DO_STCLASS;
1462 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1463 data->flags |= (OP(scan) == MEOL
1467 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1468 /* Lookbehind, or need to calculate parens/evals/stclass: */
1469 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1470 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1471 /* Lookahead/lookbehind */
1472 I32 deltanext, minnext, fake = 0;
1474 struct regnode_charclass_class intrnl;
1477 data_fake.flags = 0;
1479 data_fake.whilem_c = data->whilem_c;
1480 data_fake.last_closep = data->last_closep;
1483 data_fake.last_closep = &fake;
1484 if ( flags & SCF_DO_STCLASS && !scan->flags
1485 && OP(scan) == IFMATCH ) { /* Lookahead */
1486 cl_init(pRExC_state, &intrnl);
1487 data_fake.start_class = &intrnl;
1488 f |= SCF_DO_STCLASS_AND;
1490 if (flags & SCF_WHILEM_VISITED_POS)
1491 f |= SCF_WHILEM_VISITED_POS;
1492 next = regnext(scan);
1493 nscan = NEXTOPER(NEXTOPER(scan));
1494 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1497 vFAIL("Variable length lookbehind not implemented");
1499 else if (minnext > U8_MAX) {
1500 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1502 scan->flags = minnext;
1504 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1506 if (data && (data_fake.flags & SF_HAS_EVAL))
1507 data->flags |= SF_HAS_EVAL;
1509 data->whilem_c = data_fake.whilem_c;
1510 if (f & SCF_DO_STCLASS_AND) {
1511 int was = (data->start_class->flags & ANYOF_EOS);
1513 cl_and(data->start_class, &intrnl);
1515 data->start_class->flags |= ANYOF_EOS;
1518 else if (OP(scan) == OPEN) {
1521 else if (OP(scan) == CLOSE) {
1522 if (ARG(scan) == is_par) {
1523 next = regnext(scan);
1525 if ( next && (OP(next) != WHILEM) && next < last)
1526 is_par = 0; /* Disable optimization */
1529 *(data->last_closep) = ARG(scan);
1531 else if (OP(scan) == EVAL) {
1533 data->flags |= SF_HAS_EVAL;
1535 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1536 if (flags & SCF_DO_SUBSTR) {
1537 scan_commit(pRExC_state,data);
1538 data->longest = &(data->longest_float);
1540 is_inf = is_inf_internal = 1;
1541 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1542 cl_anything(pRExC_state, data->start_class);
1543 flags &= ~SCF_DO_STCLASS;
1545 /* Else: zero-length, ignore. */
1546 scan = regnext(scan);
1551 *deltap = is_inf_internal ? I32_MAX : delta;
1552 if (flags & SCF_DO_SUBSTR && is_inf)
1553 data->pos_delta = I32_MAX - data->pos_min;
1554 if (is_par > U8_MAX)
1556 if (is_par && pars==1 && data) {
1557 data->flags |= SF_IN_PAR;
1558 data->flags &= ~SF_HAS_PAR;
1560 else if (pars && data) {
1561 data->flags |= SF_HAS_PAR;
1562 data->flags &= ~SF_IN_PAR;
1564 if (flags & SCF_DO_STCLASS_OR)
1565 cl_and(data->start_class, &and_with);
1570 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1572 if (RExC_rx->data) {
1573 Renewc(RExC_rx->data,
1574 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1575 char, struct reg_data);
1576 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1577 RExC_rx->data->count += n;
1580 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1581 char, struct reg_data);
1582 New(1208, RExC_rx->data->what, n, U8);
1583 RExC_rx->data->count = n;
1585 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1586 return RExC_rx->data->count - n;
1590 Perl_reginitcolors(pTHX)
1593 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1596 PL_colors[0] = s = savepv(s);
1598 s = strchr(s, '\t');
1604 PL_colors[i] = s = "";
1608 PL_colors[i++] = "";
1615 - pregcomp - compile a regular expression into internal code
1617 * We can't allocate space until we know how big the compiled form will be,
1618 * but we can't compile it (and thus know how big it is) until we've got a
1619 * place to put the code. So we cheat: we compile it twice, once with code
1620 * generation turned off and size counting turned on, and once "for real".
1621 * This also means that we don't allocate space until we are sure that the
1622 * thing really will compile successfully, and we never have to move the
1623 * code and thus invalidate pointers into it. (Note that it has to be in
1624 * one piece because free() must be able to free it all.) [NB: not true in perl]
1626 * Beware that the optimization-preparation code in here knows about some
1627 * of the structure of the compiled regexp. [I'll say.]
1630 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1640 RExC_state_t RExC_state;
1641 RExC_state_t *pRExC_state = &RExC_state;
1644 FAIL("NULL regexp argument");
1646 /* XXXX This looks very suspicious... */
1647 if (pm->op_pmdynflags & PMdf_CMP_UTF8)
1653 DEBUG_r(if (!PL_colorset) reginitcolors());
1654 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1655 PL_colors[4],PL_colors[5],PL_colors[0],
1656 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1657 RExC_flags16 = pm->op_pmflags;
1661 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1662 RExC_seen_evals = 0;
1665 /* First pass: determine size, legality. */
1672 RExC_emit = &PL_regdummy;
1673 RExC_whilem_seen = 0;
1674 #if 0 /* REGC() is (currently) a NOP at the first pass.
1675 * Clever compilers notice this and complain. --jhi */
1676 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1678 if (reg(pRExC_state, 0, &flags) == NULL) {
1679 RExC_precomp = Nullch;
1682 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1684 /* Small enough for pointer-storage convention?
1685 If extralen==0, this means that we will not need long jumps. */
1686 if (RExC_size >= 0x10000L && RExC_extralen)
1687 RExC_size += RExC_extralen;
1690 if (RExC_whilem_seen > 15)
1691 RExC_whilem_seen = 15;
1693 /* Allocate space and initialize. */
1694 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1697 FAIL("Regexp out of space");
1700 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1701 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1704 r->prelen = xend - exp;
1705 r->precomp = savepvn(RExC_precomp, r->prelen);
1707 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1708 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1710 r->substrs = 0; /* Useful during FAIL. */
1711 r->startp = 0; /* Useful during FAIL. */
1712 r->endp = 0; /* Useful during FAIL. */
1714 Newz(1304, r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
1716 r->offsets[0] = RExC_size;
1718 DEBUG_r(PerlIO_printf(Perl_debug_log,
1719 "%s %"UVuf" bytes for offset annotations.\n",
1720 r->offsets ? "Got" : "Couldn't get",
1721 (UV)((2*RExC_size+1) * sizeof(U32))));
1725 /* Second pass: emit code. */
1730 RExC_emit_start = r->program;
1731 RExC_emit = r->program;
1732 /* Store the count of eval-groups for security checks: */
1733 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1734 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1736 if (reg(pRExC_state, 0, &flags) == NULL)
1739 /* Dig out information for optimizations. */
1740 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1741 pm->op_pmflags = RExC_flags16;
1743 r->reganch |= ROPT_UTF8;
1744 r->regstclass = NULL;
1745 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1746 r->reganch |= ROPT_NAUGHTY;
1747 scan = r->program + 1; /* First BRANCH. */
1749 /* XXXX To minimize changes to RE engine we always allocate
1750 3-units-long substrs field. */
1751 Newz(1004, r->substrs, 1, struct reg_substr_data);
1753 StructCopy(&zero_scan_data, &data, scan_data_t);
1754 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1755 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1757 STRLEN longest_float_length, longest_fixed_length;
1758 struct regnode_charclass_class ch_class;
1763 /* Skip introductions and multiplicators >= 1. */
1764 while ((OP(first) == OPEN && (sawopen = 1)) ||
1765 /* An OR of *one* alternative - should not happen now. */
1766 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1767 (OP(first) == PLUS) ||
1768 (OP(first) == MINMOD) ||
1769 /* An {n,m} with n>0 */
1770 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1771 if (OP(first) == PLUS)
1774 first += regarglen[(U8)OP(first)];
1775 first = NEXTOPER(first);
1778 /* Starting-point info. */
1780 if (PL_regkind[(U8)OP(first)] == EXACT) {
1781 if (OP(first) == EXACT)
1782 ; /* Empty, get anchored substr later. */
1783 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1784 r->regstclass = first;
1786 else if (strchr((char*)PL_simple,OP(first)))
1787 r->regstclass = first;
1788 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1789 PL_regkind[(U8)OP(first)] == NBOUND)
1790 r->regstclass = first;
1791 else if (PL_regkind[(U8)OP(first)] == BOL) {
1792 r->reganch |= (OP(first) == MBOL
1794 : (OP(first) == SBOL
1797 first = NEXTOPER(first);
1800 else if (OP(first) == GPOS) {
1801 r->reganch |= ROPT_ANCH_GPOS;
1802 first = NEXTOPER(first);
1805 else if ((OP(first) == STAR &&
1806 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1807 !(r->reganch & ROPT_ANCH) )
1809 /* turn .* into ^.* with an implied $*=1 */
1810 int type = OP(NEXTOPER(first));
1812 if (type == REG_ANY)
1813 type = ROPT_ANCH_MBOL;
1815 type = ROPT_ANCH_SBOL;
1817 r->reganch |= type | ROPT_IMPLICIT;
1818 first = NEXTOPER(first);
1821 if (sawplus && (!sawopen || !RExC_sawback)
1822 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1823 /* x+ must match at the 1st pos of run of x's */
1824 r->reganch |= ROPT_SKIP;
1826 /* Scan is after the zeroth branch, first is atomic matcher. */
1827 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1828 (IV)(first - scan + 1)));
1830 * If there's something expensive in the r.e., find the
1831 * longest literal string that must appear and make it the
1832 * regmust. Resolve ties in favor of later strings, since
1833 * the regstart check works with the beginning of the r.e.
1834 * and avoiding duplication strengthens checking. Not a
1835 * strong reason, but sufficient in the absence of others.
1836 * [Now we resolve ties in favor of the earlier string if
1837 * it happens that c_offset_min has been invalidated, since the
1838 * earlier string may buy us something the later one won't.]
1842 data.longest_fixed = newSVpvn("",0);
1843 data.longest_float = newSVpvn("",0);
1844 data.last_found = newSVpvn("",0);
1845 data.longest = &(data.longest_fixed);
1847 if (!r->regstclass) {
1848 cl_init(pRExC_state, &ch_class);
1849 data.start_class = &ch_class;
1850 stclass_flag = SCF_DO_STCLASS_AND;
1851 } else /* XXXX Check for BOUND? */
1853 data.last_closep = &last_close;
1855 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1856 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1857 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1858 && data.last_start_min == 0 && data.last_end > 0
1859 && !RExC_seen_zerolen
1860 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1861 r->reganch |= ROPT_CHECK_ALL;
1862 scan_commit(pRExC_state, &data);
1863 SvREFCNT_dec(data.last_found);
1865 longest_float_length = CHR_SVLEN(data.longest_float);
1866 if (longest_float_length
1867 || (data.flags & SF_FL_BEFORE_EOL
1868 && (!(data.flags & SF_FL_BEFORE_MEOL)
1869 || (RExC_flags16 & PMf_MULTILINE)))) {
1872 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1873 && data.offset_fixed == data.offset_float_min
1874 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1875 goto remove_float; /* As in (a)+. */
1877 r->float_substr = data.longest_float;
1878 r->float_min_offset = data.offset_float_min;
1879 r->float_max_offset = data.offset_float_max;
1880 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1881 && (!(data.flags & SF_FL_BEFORE_MEOL)
1882 || (RExC_flags16 & PMf_MULTILINE)));
1883 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1887 r->float_substr = Nullsv;
1888 SvREFCNT_dec(data.longest_float);
1889 longest_float_length = 0;
1892 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1893 if (longest_fixed_length
1894 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1895 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1896 || (RExC_flags16 & PMf_MULTILINE)))) {
1899 r->anchored_substr = data.longest_fixed;
1900 r->anchored_offset = data.offset_fixed;
1901 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1902 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1903 || (RExC_flags16 & PMf_MULTILINE)));
1904 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1907 r->anchored_substr = Nullsv;
1908 SvREFCNT_dec(data.longest_fixed);
1909 longest_fixed_length = 0;
1912 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1913 r->regstclass = NULL;
1914 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1915 && !(data.start_class->flags & ANYOF_EOS)
1916 && !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 PL_regdata = r->data; /* for regprop() */
1927 DEBUG_r({ SV *sv = sv_newmortal();
1928 regprop(sv, (regnode*)data.start_class);
1929 PerlIO_printf(Perl_debug_log,
1930 "synthetic stclass `%s'.\n",
1934 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1935 if (longest_fixed_length > longest_float_length) {
1936 r->check_substr = r->anchored_substr;
1937 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1938 if (r->reganch & ROPT_ANCH_SINGLE)
1939 r->reganch |= ROPT_NOSCAN;
1942 r->check_substr = r->float_substr;
1943 r->check_offset_min = data.offset_float_min;
1944 r->check_offset_max = data.offset_float_max;
1946 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1947 This should be changed ASAP! */
1948 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1949 r->reganch |= RE_USE_INTUIT;
1950 if (SvTAIL(r->check_substr))
1951 r->reganch |= RE_INTUIT_TAIL;
1955 /* Several toplevels. Best we can is to set minlen. */
1957 struct regnode_charclass_class ch_class;
1960 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1961 scan = r->program + 1;
1962 cl_init(pRExC_state, &ch_class);
1963 data.start_class = &ch_class;
1964 data.last_closep = &last_close;
1965 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1966 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1967 if (!(data.start_class->flags & ANYOF_EOS)
1968 && !cl_is_anything(data.start_class)) {
1969 I32 n = add_data(pRExC_state, 1, "f");
1971 New(1006, RExC_rx->data->data[n], 1,
1972 struct regnode_charclass_class);
1973 StructCopy(data.start_class,
1974 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1975 struct regnode_charclass_class);
1976 r->regstclass = (regnode*)RExC_rx->data->data[n];
1977 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1978 DEBUG_r({ SV* sv = sv_newmortal();
1979 regprop(sv, (regnode*)data.start_class);
1980 PerlIO_printf(Perl_debug_log,
1981 "synthetic stclass `%s'.\n",
1987 if (RExC_seen & REG_SEEN_GPOS)
1988 r->reganch |= ROPT_GPOS_SEEN;
1989 if (RExC_seen & REG_SEEN_LOOKBEHIND)
1990 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1991 if (RExC_seen & REG_SEEN_EVAL)
1992 r->reganch |= ROPT_EVAL_SEEN;
1993 if (RExC_seen & REG_SEEN_SANY)
1994 r->reganch |= ROPT_SANY_SEEN;
1995 Newz(1002, r->startp, RExC_npar, I32);
1996 Newz(1002, r->endp, RExC_npar, I32);
1997 PL_regdata = r->data; /* for regprop() */
1998 DEBUG_r(regdump(r));
2003 - reg - regular expression, i.e. main body or parenthesized thing
2005 * Caller must absorb opening parenthesis.
2007 * Combining parenthesis handling with the base level of regular expression
2008 * is a trifle forced, but the need to tie the tails of the branches to what
2009 * follows makes it hard to avoid.
2012 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
2013 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
2015 register regnode *ret; /* Will be the head of the group. */
2016 register regnode *br;
2017 register regnode *lastbr;
2018 register regnode *ender = 0;
2019 register I32 parno = 0;
2020 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
2021 char * parse_start = RExC_parse; /* MJD */
2022 char *oregcomp_parse = RExC_parse;
2025 *flagp = 0; /* Tentatively. */
2027 /* Make an OPEN node, if parenthesized. */
2029 if (*RExC_parse == '?') { /* (?...) */
2030 U16 posflags = 0, negflags = 0;
2031 U16 *flagsp = &posflags;
2033 char *seqstart = RExC_parse;
2036 paren = *RExC_parse++;
2037 ret = NULL; /* For look-ahead/behind. */
2039 case '<': /* (?<...) */
2040 RExC_seen |= REG_SEEN_LOOKBEHIND;
2041 if (*RExC_parse == '!')
2043 if (*RExC_parse != '=' && *RExC_parse != '!')
2046 case '=': /* (?=...) */
2047 case '!': /* (?!...) */
2048 RExC_seen_zerolen++;
2049 case ':': /* (?:...) */
2050 case '>': /* (?>...) */
2052 case '$': /* (?$...) */
2053 case '@': /* (?@...) */
2054 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2056 case '#': /* (?#...) */
2057 while (*RExC_parse && *RExC_parse != ')')
2059 if (*RExC_parse != ')')
2060 FAIL("Sequence (?#... not terminated");
2061 nextchar(pRExC_state);
2064 case 'p': /* (?p...) */
2066 vWARN(RExC_parse, "(?p{}) is deprecated - use (??{})");
2068 case '?': /* (??...) */
2070 paren = *RExC_parse++;
2072 case '{': /* (?{...}) */
2074 I32 count = 1, n = 0;
2076 char *s = RExC_parse;
2078 OP_4tree *sop, *rop;
2080 RExC_seen_zerolen++;
2081 RExC_seen |= REG_SEEN_EVAL;
2082 while (count && (c = *RExC_parse)) {
2083 if (c == '\\' && RExC_parse[1])
2091 if (*RExC_parse != ')')
2094 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2099 if (RExC_parse - 1 - s)
2100 sv = newSVpvn(s, RExC_parse - 1 - s);
2102 sv = newSVpvn("", 0);
2105 Perl_save_re_context(aTHX);
2106 rop = sv_compile_2op(sv, &sop, "re", &av);
2109 n = add_data(pRExC_state, 3, "nop");
2110 RExC_rx->data->data[n] = (void*)rop;
2111 RExC_rx->data->data[n+1] = (void*)sop;
2112 RExC_rx->data->data[n+2] = (void*)av;
2115 else { /* First pass */
2116 if (PL_reginterp_cnt < ++RExC_seen_evals
2117 && PL_curcop != &PL_compiling)
2118 /* No compiled RE interpolated, has runtime
2119 components ===> unsafe. */
2120 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2121 if (PL_tainting && PL_tainted)
2122 FAIL("Eval-group in insecure regular expression");
2125 nextchar(pRExC_state);
2127 ret = reg_node(pRExC_state, LOGICAL);
2130 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2131 /* deal with the length of this later - MJD */
2134 return reganode(pRExC_state, EVAL, n);
2136 case '(': /* (?(?{...})...) and (?(?=...)...) */
2138 if (RExC_parse[0] == '?') { /* (?(?...)) */
2139 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2140 || RExC_parse[1] == '<'
2141 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2144 ret = reg_node(pRExC_state, LOGICAL);
2147 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2151 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2153 parno = atoi(RExC_parse++);
2155 while (isDIGIT(*RExC_parse))
2157 ret = reganode(pRExC_state, GROUPP, parno);
2159 if ((c = *nextchar(pRExC_state)) != ')')
2160 vFAIL("Switch condition not recognized");
2162 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2163 br = regbranch(pRExC_state, &flags, 1);
2165 br = reganode(pRExC_state, LONGJMP, 0);
2167 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2168 c = *nextchar(pRExC_state);
2172 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2173 regbranch(pRExC_state, &flags, 1);
2174 regtail(pRExC_state, ret, lastbr);
2177 c = *nextchar(pRExC_state);
2182 vFAIL("Switch (?(condition)... contains too many branches");
2183 ender = reg_node(pRExC_state, TAIL);
2184 regtail(pRExC_state, br, ender);
2186 regtail(pRExC_state, lastbr, ender);
2187 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2190 regtail(pRExC_state, ret, ender);
2194 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2198 RExC_parse--; /* for vFAIL to print correctly */
2199 vFAIL("Sequence (? incomplete");
2203 parse_flags: /* (?i) */
2204 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2205 if (*RExC_parse != 'o')
2206 pmflag(flagsp, *RExC_parse);
2209 if (*RExC_parse == '-') {
2214 RExC_flags16 |= posflags;
2215 RExC_flags16 &= ~negflags;
2216 if (*RExC_parse == ':') {
2222 if (*RExC_parse != ')') {
2224 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2226 nextchar(pRExC_state);
2234 ret = reganode(pRExC_state, OPEN, parno);
2235 Set_Node_Length(ret, 1); /* MJD */
2236 Set_Node_Offset(ret, RExC_parse); /* MJD */
2243 /* Pick up the branches, linking them together. */
2244 parse_start = RExC_parse; /* MJD */
2245 br = regbranch(pRExC_state, &flags, 1);
2246 /* branch_len = (paren != 0); */
2250 if (*RExC_parse == '|') {
2251 if (!SIZE_ONLY && RExC_extralen) {
2252 reginsert(pRExC_state, BRANCHJ, br);
2255 reginsert(pRExC_state, BRANCH, br);
2256 Set_Node_Length(br, paren != 0);
2257 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
2261 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2263 else if (paren == ':') {
2264 *flagp |= flags&SIMPLE;
2266 if (open) { /* Starts with OPEN. */
2267 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2269 else if (paren != '?') /* Not Conditional */
2273 *flagp |= flags&SPSTART;
2275 while (*RExC_parse == '|') {
2276 if (!SIZE_ONLY && RExC_extralen) {
2277 ender = reganode(pRExC_state, LONGJMP,0);
2278 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2281 RExC_extralen += 2; /* Account for LONGJMP. */
2282 nextchar(pRExC_state);
2283 br = regbranch(pRExC_state, &flags, 0);
2287 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2291 *flagp |= flags&SPSTART;
2294 if (have_branch || paren != ':') {
2295 /* Make a closing node, and hook it on the end. */
2298 ender = reg_node(pRExC_state, TAIL);
2301 ender = reganode(pRExC_state, CLOSE, parno);
2302 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
2303 Set_Node_Length(ender,1); /* MJD */
2309 *flagp &= ~HASWIDTH;
2312 ender = reg_node(pRExC_state, SUCCEED);
2315 ender = reg_node(pRExC_state, END);
2318 regtail(pRExC_state, lastbr, ender);
2321 /* Hook the tails of the branches to the closing node. */
2322 for (br = ret; br != NULL; br = regnext(br)) {
2323 regoptail(pRExC_state, br, ender);
2330 static char parens[] = "=!<,>";
2332 if (paren && (p = strchr(parens, paren))) {
2333 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2334 int flag = (p - parens) > 1;
2337 node = SUSPEND, flag = 0;
2338 reginsert(pRExC_state, node,ret);
2340 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2344 /* Check for proper termination. */
2346 RExC_flags16 = oregflags;
2347 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2348 RExC_parse = oregcomp_parse;
2349 vFAIL("Unmatched (");
2352 else if (!paren && RExC_parse < RExC_end) {
2353 if (*RExC_parse == ')') {
2355 vFAIL("Unmatched )");
2358 FAIL("Junk on end of regexp"); /* "Can't happen". */
2366 - regbranch - one alternative of an | operator
2368 * Implements the concatenation operator.
2371 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2373 register regnode *ret;
2374 register regnode *chain = NULL;
2375 register regnode *latest;
2376 I32 flags = 0, c = 0;
2381 if (!SIZE_ONLY && RExC_extralen)
2382 ret = reganode(pRExC_state, BRANCHJ,0);
2384 ret = reg_node(pRExC_state, BRANCH);
2385 Set_Node_Length(ret, 1);
2389 if (!first && SIZE_ONLY)
2390 RExC_extralen += 1; /* BRANCHJ */
2392 *flagp = WORST; /* Tentatively. */
2395 nextchar(pRExC_state);
2396 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2398 latest = regpiece(pRExC_state, &flags);
2399 if (latest == NULL) {
2400 if (flags & TRYAGAIN)
2404 else if (ret == NULL)
2406 *flagp |= flags&HASWIDTH;
2407 if (chain == NULL) /* First piece. */
2408 *flagp |= flags&SPSTART;
2411 regtail(pRExC_state, chain, latest);
2416 if (chain == NULL) { /* Loop ran zero times. */
2417 chain = reg_node(pRExC_state, NOTHING);
2422 *flagp |= flags&SIMPLE;
2429 - regpiece - something followed by possible [*+?]
2431 * Note that the branching code sequences used for ? and the general cases
2432 * of * and + are somewhat optimized: they use the same NOTHING node as
2433 * both the endmarker for their branch list and the body of the last branch.
2434 * It might seem that this node could be dispensed with entirely, but the
2435 * endmarker role is not redundant.
2438 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2440 register regnode *ret;
2442 register char *next;
2444 char *origparse = RExC_parse;
2447 I32 max = REG_INFTY;
2450 ret = regatom(pRExC_state, &flags);
2452 if (flags & TRYAGAIN)
2459 if (op == '{' && regcurly(RExC_parse)) {
2460 parse_start = RExC_parse; /* MJD */
2461 next = RExC_parse + 1;
2463 while (isDIGIT(*next) || *next == ',') {
2472 if (*next == '}') { /* got one */
2476 min = atoi(RExC_parse);
2480 maxpos = RExC_parse;
2482 if (!max && *maxpos != '0')
2483 max = REG_INFTY; /* meaning "infinity" */
2484 else if (max >= REG_INFTY)
2485 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2487 nextchar(pRExC_state);
2490 if ((flags&SIMPLE)) {
2491 RExC_naughty += 2 + RExC_naughty / 2;
2492 reginsert(pRExC_state, CURLY, ret);
2493 Set_Node_Offset(ret, parse_start+1); /* MJD */
2494 Set_Node_Cur_Length(ret);
2497 regnode *w = reg_node(pRExC_state, WHILEM);
2500 regtail(pRExC_state, ret, w);
2501 if (!SIZE_ONLY && RExC_extralen) {
2502 reginsert(pRExC_state, LONGJMP,ret);
2503 reginsert(pRExC_state, NOTHING,ret);
2504 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2506 reginsert(pRExC_state, CURLYX,ret);
2508 Set_Node_Offset(ret, parse_start+1);
2509 Set_Node_Length(ret,
2510 op == '{' ? (RExC_parse - parse_start) : 1);
2512 if (!SIZE_ONLY && RExC_extralen)
2513 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2514 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2516 RExC_whilem_seen++, RExC_extralen += 3;
2517 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2525 if (max && max < min)
2526 vFAIL("Can't do {n,m} with n > m");
2541 #if 0 /* Now runtime fix should be reliable. */
2543 /* if this is reinstated, don't forget to put this back into perldiag:
2545 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2547 (F) The part of the regexp subject to either the * or + quantifier
2548 could match an empty string. The {#} shows in the regular
2549 expression about where the problem was discovered.
2553 if (!(flags&HASWIDTH) && op != '?')
2554 vFAIL("Regexp *+ operand could be empty");
2557 parse_start = RExC_parse;
2558 nextchar(pRExC_state);
2560 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2562 if (op == '*' && (flags&SIMPLE)) {
2563 reginsert(pRExC_state, STAR, ret);
2567 else if (op == '*') {
2571 else if (op == '+' && (flags&SIMPLE)) {
2572 reginsert(pRExC_state, PLUS, ret);
2576 else if (op == '+') {
2580 else if (op == '?') {
2585 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2587 "%.*s matches null string many times",
2588 RExC_parse - origparse,
2592 if (*RExC_parse == '?') {
2593 nextchar(pRExC_state);
2594 reginsert(pRExC_state, MINMOD, ret);
2595 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2597 if (ISMULT2(RExC_parse)) {
2599 vFAIL("Nested quantifiers");
2606 - regatom - the lowest level
2608 * Optimization: gobbles an entire sequence of ordinary characters so that
2609 * it can turn them into a single node, which is smaller to store and
2610 * faster to run. Backslashed characters are exceptions, each becoming a
2611 * separate node; the code is simpler that way and it's not worth fixing.
2613 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2615 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2617 register regnode *ret = 0;
2620 *flagp = WORST; /* Tentatively. */
2623 switch (*RExC_parse) {
2625 RExC_seen_zerolen++;
2626 nextchar(pRExC_state);
2627 if (RExC_flags16 & PMf_MULTILINE)
2628 ret = reg_node(pRExC_state, MBOL);
2629 else if (RExC_flags16 & PMf_SINGLELINE)
2630 ret = reg_node(pRExC_state, SBOL);
2632 ret = reg_node(pRExC_state, BOL);
2633 Set_Node_Length(ret, 1); /* MJD */
2636 nextchar(pRExC_state);
2638 RExC_seen_zerolen++;
2639 if (RExC_flags16 & PMf_MULTILINE)
2640 ret = reg_node(pRExC_state, MEOL);
2641 else if (RExC_flags16 & PMf_SINGLELINE)
2642 ret = reg_node(pRExC_state, SEOL);
2644 ret = reg_node(pRExC_state, EOL);
2645 Set_Node_Length(ret, 1); /* MJD */
2648 nextchar(pRExC_state);
2649 if (RExC_flags16 & PMf_SINGLELINE)
2650 ret = reg_node(pRExC_state, SANY);
2652 ret = reg_node(pRExC_state, REG_ANY);
2653 *flagp |= HASWIDTH|SIMPLE;
2655 Set_Node_Length(ret, 1); /* MJD */
2659 char *oregcomp_parse = ++RExC_parse;
2660 ret = regclass(pRExC_state);
2661 if (*RExC_parse != ']') {
2662 RExC_parse = oregcomp_parse;
2663 vFAIL("Unmatched [");
2665 nextchar(pRExC_state);
2666 *flagp |= HASWIDTH|SIMPLE;
2667 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
2671 nextchar(pRExC_state);
2672 ret = reg(pRExC_state, 1, &flags);
2674 if (flags & TRYAGAIN) {
2675 if (RExC_parse == RExC_end) {
2676 /* Make parent create an empty node if needed. */
2684 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2688 if (flags & TRYAGAIN) {
2692 vFAIL("Internal urp");
2693 /* Supposed to be caught earlier. */
2696 if (!regcurly(RExC_parse)) {
2705 vFAIL("Quantifier follows nothing");
2708 switch (*++RExC_parse) {
2710 RExC_seen_zerolen++;
2711 ret = reg_node(pRExC_state, SBOL);
2713 nextchar(pRExC_state);
2714 Set_Node_Length(ret, 2); /* MJD */
2717 ret = reg_node(pRExC_state, GPOS);
2718 RExC_seen |= REG_SEEN_GPOS;
2720 nextchar(pRExC_state);
2721 Set_Node_Length(ret, 2); /* MJD */
2724 ret = reg_node(pRExC_state, SEOL);
2726 nextchar(pRExC_state);
2729 ret = reg_node(pRExC_state, EOS);
2731 RExC_seen_zerolen++; /* Do not optimize RE away */
2732 nextchar(pRExC_state);
2733 Set_Node_Length(ret, 2); /* MJD */
2736 ret = reg_node(pRExC_state, SANY);
2737 RExC_seen |= REG_SEEN_SANY;
2738 *flagp |= HASWIDTH|SIMPLE;
2739 nextchar(pRExC_state);
2740 Set_Node_Length(ret, 2); /* MJD */
2743 ret = reg_node(pRExC_state, CLUMP);
2745 nextchar(pRExC_state);
2746 Set_Node_Length(ret, 2); /* MJD */
2749 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2750 *flagp |= HASWIDTH|SIMPLE;
2751 nextchar(pRExC_state);
2752 Set_Node_Length(ret, 2); /* MJD */
2755 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2756 *flagp |= HASWIDTH|SIMPLE;
2757 nextchar(pRExC_state);
2758 Set_Node_Length(ret, 2); /* MJD */
2761 RExC_seen_zerolen++;
2762 RExC_seen |= REG_SEEN_LOOKBEHIND;
2763 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2765 nextchar(pRExC_state);
2766 Set_Node_Length(ret, 2); /* MJD */
2769 RExC_seen_zerolen++;
2770 RExC_seen |= REG_SEEN_LOOKBEHIND;
2771 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2773 nextchar(pRExC_state);
2774 Set_Node_Length(ret, 2); /* MJD */
2777 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2778 *flagp |= HASWIDTH|SIMPLE;
2779 nextchar(pRExC_state);
2780 Set_Node_Length(ret, 2); /* MJD */
2783 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2784 *flagp |= HASWIDTH|SIMPLE;
2785 nextchar(pRExC_state);
2786 Set_Node_Length(ret, 2); /* MJD */
2789 ret = reg_node(pRExC_state, DIGIT);
2790 *flagp |= HASWIDTH|SIMPLE;
2791 nextchar(pRExC_state);
2792 Set_Node_Length(ret, 2); /* MJD */
2795 ret = reg_node(pRExC_state, NDIGIT);
2796 *flagp |= HASWIDTH|SIMPLE;
2797 nextchar(pRExC_state);
2798 Set_Node_Length(ret, 2); /* MJD */
2803 char* oldregxend = RExC_end;
2804 char* parse_start = RExC_parse;
2806 if (RExC_parse[1] == '{') {
2807 /* a lovely hack--pretend we saw [\pX] instead */
2808 RExC_end = strchr(RExC_parse, '}');
2811 RExC_end = oldregxend;
2812 vFAIL("Missing right brace on \\p{}");
2817 RExC_end = RExC_parse + 2;
2820 ret = regclass(pRExC_state);
2822 RExC_end = oldregxend;
2824 Set_Node_Cur_Length(ret); /* MJD */
2825 nextchar(pRExC_state);
2826 *flagp |= HASWIDTH|SIMPLE;
2839 case '1': case '2': case '3': case '4':
2840 case '5': case '6': case '7': case '8': case '9':
2842 I32 num = atoi(RExC_parse);
2844 if (num > 9 && num >= RExC_npar)
2847 char * parse_start = RExC_parse - 1; /* MJD */
2848 while (isDIGIT(*RExC_parse))
2851 if (!SIZE_ONLY && num > RExC_rx->nparens)
2852 vFAIL("Reference to nonexistent group");
2854 ret = reganode(pRExC_state, FOLD
2855 ? (LOC ? REFFL : REFF)
2859 /* override incorrect value set in reganode MJD */
2860 Set_Node_Offset(ret, parse_start+1);
2861 Set_Node_Cur_Length(ret); /* MJD */
2863 nextchar(pRExC_state);
2868 if (RExC_parse >= RExC_end)
2869 FAIL("Trailing \\");
2872 /* Do not generate `unrecognized' warnings here, we fall
2873 back into the quick-grab loop below */
2879 if (RExC_flags16 & PMf_EXTENDED) {
2880 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2881 if (RExC_parse < RExC_end)
2887 register STRLEN len;
2892 char *parse_start = RExC_parse - 1;
2897 ret = reg_node(pRExC_state, FOLD
2898 ? (LOC ? EXACTFL : EXACTF)
2901 for (len = 0, p = RExC_parse - 1;
2902 len < 127 && p < RExC_end;
2907 if (RExC_flags16 & PMf_EXTENDED)
2908 p = regwhite(p, RExC_end);
2953 ender = ASCII_TO_NATIVE('\033');
2957 ender = ASCII_TO_NATIVE('\007');
2962 char* e = strchr(p, '}');
2966 vFAIL("Missing right brace on \\x{}");
2969 numlen = 1; /* allow underscores */
2970 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
2973 /* numlen is generous */
2974 if (numlen + len >= 127) {
2982 numlen = 0; /* disallow underscores */
2983 ender = (UV)scan_hex(p, 2, &numlen);
2989 ender = UCHARAT(p++);
2990 ender = toCTRL(ender);
2992 case '0': case '1': case '2': case '3':case '4':
2993 case '5': case '6': case '7': case '8':case '9':
2995 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
2996 numlen = 0; /* disallow underscores */
2997 ender = (UV)scan_oct(p, 3, &numlen);
3007 FAIL("Trailing \\");
3010 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
3011 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
3012 goto normal_default;
3017 if (UTF8_IS_START(*p) && UTF) {
3018 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3026 if (RExC_flags16 & PMf_EXTENDED)
3027 p = regwhite(p, RExC_end);
3030 ender = toLOWER_LC_uvchr(ender);
3032 ender = toLOWER_uni(ender);
3034 if (ISMULT2(p)) { /* Back off on ?+*. */
3037 else if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3038 reguni(pRExC_state, ender, s, &numlen);
3048 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3049 reguni(pRExC_state, ender, s, &numlen);
3058 Set_Node_Cur_Length(ret); /* MJD */
3059 nextchar(pRExC_state);
3061 /* len is STRLEN which is unsigned, need to copy to signed */
3064 vFAIL("Internal disaster");
3073 RExC_size += STR_SZ(len);
3075 RExC_emit += STR_SZ(len);
3084 S_regwhite(pTHX_ char *p, char *e)
3089 else if (*p == '#') {
3092 } while (p < e && *p != '\n');
3100 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3101 Character classes ([:foo:]) can also be negated ([:^foo:]).
3102 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3103 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3104 but trigger warnings because they are currently unimplemented. */
3106 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3109 I32 namedclass = OOB_NAMEDCLASS;
3111 if (value == '[' && RExC_parse + 1 < RExC_end &&
3112 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3113 (*RExC_parse == ':' ||
3114 *RExC_parse == '=' ||
3115 *RExC_parse == '.')) {
3116 char c = *RExC_parse;
3117 char* s = RExC_parse++;
3119 while (RExC_parse < RExC_end && *RExC_parse != c)
3121 if (RExC_parse == RExC_end)
3122 /* Grandfather lone [:, [=, [. */
3125 char* t = RExC_parse++; /* skip over the c */
3127 if (*RExC_parse == ']') {
3128 RExC_parse++; /* skip over the ending ] */
3131 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3132 I32 skip = 5; /* the most common skip */
3136 if (strnEQ(posixcc, "alnum", 5))
3138 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3139 else if (strnEQ(posixcc, "alpha", 5))
3141 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3142 else if (strnEQ(posixcc, "ascii", 5))
3144 complement ? ANYOF_NASCII : ANYOF_ASCII;
3147 if (strnEQ(posixcc, "blank", 5))
3149 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3152 if (strnEQ(posixcc, "cntrl", 5))
3154 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3157 if (strnEQ(posixcc, "digit", 5))
3159 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3162 if (strnEQ(posixcc, "graph", 5))
3164 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3167 if (strnEQ(posixcc, "lower", 5))
3169 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3172 if (strnEQ(posixcc, "print", 5))
3174 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3175 else if (strnEQ(posixcc, "punct", 5))
3177 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3180 if (strnEQ(posixcc, "space", 5))
3182 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3185 if (strnEQ(posixcc, "upper", 5))
3187 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3189 case 'w': /* this is not POSIX, this is the Perl \w */
3190 if (strnEQ(posixcc, "word", 4)) {
3192 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3197 if (strnEQ(posixcc, "xdigit", 6)) {
3199 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3204 if (namedclass == OOB_NAMEDCLASS ||
3205 posixcc[skip] != ':' ||
3206 posixcc[skip+1] != ']')
3208 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3211 } else if (!SIZE_ONLY) {
3212 /* [[=foo=]] and [[.foo.]] are still future. */
3214 /* adjust RExC_parse so the warning shows after
3216 while (*RExC_parse && *RExC_parse != ']')
3218 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3221 /* Maternal grandfather:
3222 * "[:" ending in ":" but not in ":]" */
3232 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3234 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3235 (*RExC_parse == ':' ||
3236 *RExC_parse == '=' ||
3237 *RExC_parse == '.')) {
3238 char *s = RExC_parse;
3241 while(*s && isALNUM(*s))
3243 if (*s && c == *s && s[1] == ']') {
3244 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3246 /* [[=foo=]] and [[.foo.]] are still future. */
3247 if (c == '=' || c == '.')
3249 /* adjust RExC_parse so the error shows after
3251 while (*RExC_parse && *RExC_parse++ != ']')
3253 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3260 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3263 register IV prevvalue = OOB_UNICODE;
3264 register IV range = 0;
3265 register regnode *ret;
3268 char *rangebegin = 0;
3269 bool need_class = 0;
3270 SV *listsv = Nullsv;
3273 bool optimize_invert = TRUE;
3275 ret = reganode(pRExC_state, ANYOF, 0);
3278 ANYOF_FLAGS(ret) = 0;
3280 if (*RExC_parse == '^') { /* Complement of range. */
3284 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3288 RExC_size += ANYOF_SKIP;
3290 RExC_emit += ANYOF_SKIP;
3292 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3294 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3295 ANYOF_BITMAP_ZERO(ret);
3296 listsv = newSVpvn("# comment\n", 10);
3299 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3300 checkposixcc(pRExC_state);
3302 if (*RExC_parse == ']' || *RExC_parse == '-')
3303 goto charclassloop; /* allow 1st char to be ] or - */
3305 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3309 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3312 rangebegin = RExC_parse;
3314 value = utf8n_to_uvchr((U8*)RExC_parse,
3315 RExC_end - RExC_parse,
3317 RExC_parse += numlen;
3320 value = UCHARAT(RExC_parse++);
3322 namedclass = regpposixcc(pRExC_state, value);
3323 else if (value == '\\') {
3325 value = utf8n_to_uvchr((U8*)RExC_parse,
3326 RExC_end - RExC_parse,
3328 RExC_parse += numlen;
3331 value = UCHARAT(RExC_parse++);
3332 /* Some compilers cannot handle switching on 64-bit integer
3333 * values, therefore value cannot be an UV. Yes, this will
3334 * be a problem later if we want switch on Unicode.
3335 * A similar issue a little bit later when switching on
3336 * namedclass. --jhi */
3337 switch ((I32)value) {
3338 case 'w': namedclass = ANYOF_ALNUM; break;
3339 case 'W': namedclass = ANYOF_NALNUM; break;
3340 case 's': namedclass = ANYOF_SPACE; break;
3341 case 'S': namedclass = ANYOF_NSPACE; break;
3342 case 'd': namedclass = ANYOF_DIGIT; break;
3343 case 'D': namedclass = ANYOF_NDIGIT; break;
3346 if (*RExC_parse == '{') {
3347 e = strchr(RExC_parse++, '}');
3349 vFAIL("Missing right brace on \\p{}");
3358 Perl_sv_catpvf(aTHX_ listsv,
3359 "+utf8::%.*s\n", (int)n, RExC_parse);
3361 Perl_sv_catpvf(aTHX_ listsv,
3362 "!utf8::%.*s\n", (int)n, RExC_parse);
3365 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3367 case 'n': value = '\n'; break;
3368 case 'r': value = '\r'; break;
3369 case 't': value = '\t'; break;
3370 case 'f': value = '\f'; break;
3371 case 'b': value = '\b'; break;
3372 case 'e': value = ASCII_TO_NATIVE('\033');break;
3373 case 'a': value = ASCII_TO_NATIVE('\007');break;
3375 if (*RExC_parse == '{') {
3376 e = strchr(RExC_parse++, '}');
3378 vFAIL("Missing right brace on \\x{}");
3379 numlen = 1; /* allow underscores */
3380 value = (UV)scan_hex(RExC_parse,
3386 numlen = 0; /* disallow underscores */
3387 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3388 RExC_parse += numlen;
3392 value = UCHARAT(RExC_parse++);
3393 value = toCTRL(value);
3395 case '0': case '1': case '2': case '3': case '4':
3396 case '5': case '6': case '7': case '8': case '9':
3397 numlen = 0; /* disallow underscores */
3398 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3399 RExC_parse += numlen;
3402 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3404 "Unrecognized escape \\%c in character class passed through",
3408 } /* end of \blah */
3410 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3412 if (!SIZE_ONLY && !need_class)
3413 ANYOF_CLASS_ZERO(ret);
3417 /* a bad range like a-\d, a-[:digit:] ? */
3420 if (ckWARN(WARN_REGEXP))
3422 "False [] range \"%*.*s\"",
3423 RExC_parse - rangebegin,
3424 RExC_parse - rangebegin,
3426 if (prevvalue < 256) {
3427 ANYOF_BITMAP_SET(ret, prevvalue);
3428 ANYOF_BITMAP_SET(ret, '-');
3431 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3432 Perl_sv_catpvf(aTHX_ listsv,
3433 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
3437 range = 0; /* this was not a true range */
3441 if (namedclass > OOB_NAMEDCLASS)
3442 optimize_invert = FALSE;
3443 /* Possible truncation here but in some 64-bit environments
3444 * the compiler gets heartburn about switch on 64-bit values.
3445 * A similar issue a little earlier when switching on value.
3447 switch ((I32)namedclass) {
3450 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3452 for (value = 0; value < 256; value++)
3454 ANYOF_BITMAP_SET(ret, value);
3456 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3460 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3462 for (value = 0; value < 256; value++)
3463 if (!isALNUM(value))
3464 ANYOF_BITMAP_SET(ret, value);
3466 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3470 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3472 for (value = 0; value < 256; value++)
3473 if (isALNUMC(value))
3474 ANYOF_BITMAP_SET(ret, value);
3476 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3480 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3482 for (value = 0; value < 256; value++)
3483 if (!isALNUMC(value))
3484 ANYOF_BITMAP_SET(ret, value);
3486 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3490 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3492 for (value = 0; value < 256; value++)
3494 ANYOF_BITMAP_SET(ret, value);
3496 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3500 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3502 for (value = 0; value < 256; value++)
3503 if (!isALPHA(value))
3504 ANYOF_BITMAP_SET(ret, value);
3506 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3510 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3513 for (value = 0; value < 128; value++)
3514 ANYOF_BITMAP_SET(ret, value);
3516 for (value = 0; value < 256; value++) {
3518 ANYOF_BITMAP_SET(ret, value);
3522 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3526 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3529 for (value = 128; value < 256; value++)
3530 ANYOF_BITMAP_SET(ret, value);
3532 for (value = 0; value < 256; value++) {
3533 if (!isASCII(value))
3534 ANYOF_BITMAP_SET(ret, value);
3538 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3542 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3544 for (value = 0; value < 256; value++)
3546 ANYOF_BITMAP_SET(ret, value);
3548 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3552 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3554 for (value = 0; value < 256; value++)
3555 if (!isBLANK(value))
3556 ANYOF_BITMAP_SET(ret, value);
3558 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3562 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3564 for (value = 0; value < 256; value++)
3566 ANYOF_BITMAP_SET(ret, value);
3568 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3572 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3574 for (value = 0; value < 256; value++)
3575 if (!isCNTRL(value))
3576 ANYOF_BITMAP_SET(ret, value);
3578 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3582 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3584 /* consecutive digits assumed */
3585 for (value = '0'; value <= '9'; value++)
3586 ANYOF_BITMAP_SET(ret, value);
3588 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3592 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3594 /* consecutive digits assumed */
3595 for (value = 0; value < '0'; value++)
3596 ANYOF_BITMAP_SET(ret, value);
3597 for (value = '9' + 1; value < 256; value++)
3598 ANYOF_BITMAP_SET(ret, value);
3600 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3604 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3606 for (value = 0; value < 256; value++)
3608 ANYOF_BITMAP_SET(ret, value);
3610 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3614 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3616 for (value = 0; value < 256; value++)
3617 if (!isGRAPH(value))
3618 ANYOF_BITMAP_SET(ret, value);
3620 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3624 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3626 for (value = 0; value < 256; value++)
3628 ANYOF_BITMAP_SET(ret, value);
3630 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3634 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3636 for (value = 0; value < 256; value++)
3637 if (!isLOWER(value))
3638 ANYOF_BITMAP_SET(ret, value);
3640 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3644 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3646 for (value = 0; value < 256; value++)
3648 ANYOF_BITMAP_SET(ret, value);
3650 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3654 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3656 for (value = 0; value < 256; value++)
3657 if (!isPRINT(value))
3658 ANYOF_BITMAP_SET(ret, value);
3660 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3664 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3666 for (value = 0; value < 256; value++)
3667 if (isPSXSPC(value))
3668 ANYOF_BITMAP_SET(ret, value);
3670 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3674 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3676 for (value = 0; value < 256; value++)
3677 if (!isPSXSPC(value))
3678 ANYOF_BITMAP_SET(ret, value);
3680 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3684 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3686 for (value = 0; value < 256; value++)
3688 ANYOF_BITMAP_SET(ret, value);
3690 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3694 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3696 for (value = 0; value < 256; value++)
3697 if (!isPUNCT(value))
3698 ANYOF_BITMAP_SET(ret, value);
3700 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3704 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3706 for (value = 0; value < 256; value++)
3708 ANYOF_BITMAP_SET(ret, value);
3710 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3714 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3716 for (value = 0; value < 256; value++)
3717 if (!isSPACE(value))
3718 ANYOF_BITMAP_SET(ret, value);
3720 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3724 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3726 for (value = 0; value < 256; value++)
3728 ANYOF_BITMAP_SET(ret, value);
3730 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3734 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3736 for (value = 0; value < 256; value++)
3737 if (!isUPPER(value))
3738 ANYOF_BITMAP_SET(ret, value);
3740 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3744 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3746 for (value = 0; value < 256; value++)
3747 if (isXDIGIT(value))
3748 ANYOF_BITMAP_SET(ret, value);
3750 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3754 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3756 for (value = 0; value < 256; value++)
3757 if (!isXDIGIT(value))
3758 ANYOF_BITMAP_SET(ret, value);
3760 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3763 vFAIL("Invalid [::] class");
3767 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3770 } /* end of namedclass \blah */
3773 if (prevvalue > value) /* b-a */ {
3774 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3775 RExC_parse - rangebegin,
3776 RExC_parse - rangebegin,
3778 range = 0; /* not a valid range */
3782 prevvalue = value; /* save the beginning of the range */
3783 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3784 RExC_parse[1] != ']') {
3787 /* a bad range like \w-, [:word:]- ? */
3788 if (namedclass > OOB_NAMEDCLASS) {
3789 if (ckWARN(WARN_REGEXP))
3791 "False [] range \"%*.*s\"",
3792 RExC_parse - rangebegin,
3793 RExC_parse - rangebegin,
3796 ANYOF_BITMAP_SET(ret, '-');
3798 range = 1; /* yeah, it's a range! */
3799 continue; /* but do it the next time */
3803 /* now is the next time */
3807 if (prevvalue < 256) {
3808 IV ceilvalue = value < 256 ? value : 255;
3811 if ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
3812 (isUPPER(prevvalue) && isUPPER(ceilvalue)))
3814 if (isLOWER(prevvalue)) {
3815 for (i = prevvalue; i <= ceilvalue; i++)
3817 ANYOF_BITMAP_SET(ret, i);
3819 for (i = prevvalue; i <= ceilvalue; i++)
3821 ANYOF_BITMAP_SET(ret, i);
3826 for (i = prevvalue; i <= ceilvalue; i++)
3827 ANYOF_BITMAP_SET(ret, i);
3830 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3831 if (prevvalue < value)
3832 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3833 (UV)prevvalue, (UV)value);
3834 else if (prevvalue == value)
3835 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3840 range = 0; /* this range (if it was one) is done now */
3844 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
3846 RExC_size += ANYOF_CLASS_ADD_SKIP;
3848 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3851 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3853 /* If the only flag is folding (plus possibly inversion). */
3854 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
3856 for (value = 0; value < 256; ++value) {
3857 if (ANYOF_BITMAP_TEST(ret, value)) {
3858 IV fold = PL_fold[value];
3861 ANYOF_BITMAP_SET(ret, fold);
3864 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3867 /* optimize inverted simple patterns (e.g. [^a-z]) */
3868 if (!SIZE_ONLY && optimize_invert &&
3869 /* If the only flag is inversion. */
3870 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3871 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3872 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3873 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
3880 av_store(av, 0, listsv);
3881 av_store(av, 1, NULL);
3882 rv = newRV_noinc((SV*)av);
3883 n = add_data(pRExC_state, 1, "s");
3884 RExC_rx->data->data[n] = (void*)rv;
3892 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3894 char* retval = RExC_parse++;
3897 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3898 RExC_parse[2] == '#') {
3899 while (*RExC_parse && *RExC_parse != ')')
3904 if (RExC_flags16 & PMf_EXTENDED) {
3905 if (isSPACE(*RExC_parse)) {
3909 else if (*RExC_parse == '#') {
3910 while (*RExC_parse && *RExC_parse != '\n')
3921 - reg_node - emit a node
3923 STATIC regnode * /* Location. */
3924 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3926 register regnode *ret;
3927 register regnode *ptr;
3931 SIZE_ALIGN(RExC_size);
3936 NODE_ALIGN_FILL(ret);
3938 FILL_ADVANCE_NODE(ptr, op);
3939 if (RExC_offsets) { /* MJD */
3940 MJD_OFFSET_DEBUG((stderr, "%s:%u: (op %s) %s %u <- %u (len %u) (max %u).\n",
3941 "reg_node", __LINE__,
3943 RExC_emit - RExC_emit_start > RExC_offsets[0]
3944 ? "Overwriting end of array!\n" : "OK",
3945 RExC_emit - RExC_emit_start,
3946 RExC_parse - RExC_start,
3948 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
3957 - reganode - emit a node with an argument
3959 STATIC regnode * /* Location. */
3960 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
3962 register regnode *ret;
3963 register regnode *ptr;
3967 SIZE_ALIGN(RExC_size);
3972 NODE_ALIGN_FILL(ret);
3974 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3975 if (RExC_offsets) { /* MJD */
3976 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
3978 RExC_emit - RExC_emit_start > RExC_offsets[0] ?
3979 "Overwriting end of array!\n" : "OK",
3980 RExC_emit - RExC_emit_start,
3981 RExC_parse - RExC_start,
3983 Set_Cur_Node_Offset;
3992 - reguni - emit (if appropriate) a Unicode character
3995 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
3997 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4001 - reginsert - insert an operator in front of already-emitted operand
4003 * Means relocating the operand.
4006 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4008 register regnode *src;
4009 register regnode *dst;
4010 register regnode *place;
4011 register int offset = regarglen[(U8)op];
4013 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4016 RExC_size += NODE_STEP_REGNODE + offset;
4021 RExC_emit += NODE_STEP_REGNODE + offset;
4023 while (src > opnd) {
4024 StructCopy(--src, --dst, regnode);
4025 if (RExC_offsets) { /* MJD 20010112 */
4026 MJD_OFFSET_DEBUG((stderr, "%s: %s copy %u -> %u (max %u).\n",
4028 dst - RExC_emit_start > RExC_offsets[0]
4029 ? "Overwriting end of array!\n" : "OK",
4030 src - RExC_emit_start,
4031 dst - RExC_emit_start,
4033 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
4034 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
4039 place = opnd; /* Op node, where operand used to be. */
4040 if (RExC_offsets) { /* MJD */
4041 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4043 place - RExC_emit_start > RExC_offsets[0]
4044 ? "Overwriting end of array!\n" : "OK",
4045 place - RExC_emit_start,
4046 RExC_parse - RExC_start,
4048 Set_Node_Offset(place, RExC_parse);
4050 src = NEXTOPER(place);
4051 FILL_ADVANCE_NODE(place, op);
4052 Zero(src, offset, regnode);
4056 - regtail - set the next-pointer at the end of a node chain of p to val.
4059 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4061 register regnode *scan;
4062 register regnode *temp;
4067 /* Find last node. */
4070 temp = regnext(scan);
4076 if (reg_off_by_arg[OP(scan)]) {
4077 ARG_SET(scan, val - scan);
4080 NEXT_OFF(scan) = val - scan;
4085 - regoptail - regtail on operand of first argument; nop if operandless
4088 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4090 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4091 if (p == NULL || SIZE_ONLY)
4093 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4094 regtail(pRExC_state, NEXTOPER(p), val);
4096 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4097 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4104 - regcurly - a little FSA that accepts {\d+,?\d*}
4107 S_regcurly(pTHX_ register char *s)
4126 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4129 register U8 op = EXACT; /* Arbitrary non-END op. */
4130 register regnode *next;
4132 while (op != END && (!last || node < last)) {
4133 /* While that wasn't END last time... */
4139 next = regnext(node);
4141 if (OP(node) == OPTIMIZED)
4144 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4145 (int)(2*l + 1), "", SvPVX(sv));
4146 if (next == NULL) /* Next ptr. */
4147 PerlIO_printf(Perl_debug_log, "(0)");
4149 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4150 (void)PerlIO_putc(Perl_debug_log, '\n');
4152 if (PL_regkind[(U8)op] == BRANCHJ) {
4153 register regnode *nnode = (OP(next) == LONGJMP
4156 if (last && nnode > last)
4158 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4160 else if (PL_regkind[(U8)op] == BRANCH) {
4161 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4163 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4164 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4165 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4167 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4168 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4171 else if ( op == PLUS || op == STAR) {
4172 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4174 else if (op == ANYOF) {
4175 /* arglen 1 + class block */
4176 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
4177 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
4178 node = NEXTOPER(node);
4180 else if (PL_regkind[(U8)op] == EXACT) {
4181 /* Literal string, where present. */
4182 node += NODE_SZ_STR(node) - 1;
4183 node = NEXTOPER(node);
4186 node = NEXTOPER(node);
4187 node += regarglen[(U8)op];
4189 if (op == CURLYX || op == OPEN)
4191 else if (op == WHILEM)
4194 #endif /* DEBUGGING */
4199 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4202 Perl_regdump(pTHX_ regexp *r)
4205 SV *sv = sv_newmortal();
4207 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4209 /* Header fields of interest. */
4210 if (r->anchored_substr)
4211 PerlIO_printf(Perl_debug_log,
4212 "anchored `%s%.*s%s'%s at %"IVdf" ",
4214 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4215 SvPVX(r->anchored_substr),
4217 SvTAIL(r->anchored_substr) ? "$" : "",
4218 (IV)r->anchored_offset);
4219 if (r->float_substr)
4220 PerlIO_printf(Perl_debug_log,
4221 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4223 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4224 SvPVX(r->float_substr),
4226 SvTAIL(r->float_substr) ? "$" : "",
4227 (IV)r->float_min_offset, (UV)r->float_max_offset);
4228 if (r->check_substr)
4229 PerlIO_printf(Perl_debug_log,
4230 r->check_substr == r->float_substr
4231 ? "(checking floating" : "(checking anchored");
4232 if (r->reganch & ROPT_NOSCAN)
4233 PerlIO_printf(Perl_debug_log, " noscan");
4234 if (r->reganch & ROPT_CHECK_ALL)
4235 PerlIO_printf(Perl_debug_log, " isall");
4236 if (r->check_substr)
4237 PerlIO_printf(Perl_debug_log, ") ");
4239 if (r->regstclass) {
4240 regprop(sv, r->regstclass);
4241 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4243 if (r->reganch & ROPT_ANCH) {
4244 PerlIO_printf(Perl_debug_log, "anchored");
4245 if (r->reganch & ROPT_ANCH_BOL)
4246 PerlIO_printf(Perl_debug_log, "(BOL)");
4247 if (r->reganch & ROPT_ANCH_MBOL)
4248 PerlIO_printf(Perl_debug_log, "(MBOL)");
4249 if (r->reganch & ROPT_ANCH_SBOL)
4250 PerlIO_printf(Perl_debug_log, "(SBOL)");
4251 if (r->reganch & ROPT_ANCH_GPOS)
4252 PerlIO_printf(Perl_debug_log, "(GPOS)");
4253 PerlIO_putc(Perl_debug_log, ' ');
4255 if (r->reganch & ROPT_GPOS_SEEN)
4256 PerlIO_printf(Perl_debug_log, "GPOS ");
4257 if (r->reganch & ROPT_SKIP)
4258 PerlIO_printf(Perl_debug_log, "plus ");
4259 if (r->reganch & ROPT_IMPLICIT)
4260 PerlIO_printf(Perl_debug_log, "implicit ");
4261 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4262 if (r->reganch & ROPT_EVAL_SEEN)
4263 PerlIO_printf(Perl_debug_log, "with eval ");
4264 PerlIO_printf(Perl_debug_log, "\n");
4267 U32 len = r->offsets[0];
4268 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4269 for (i = 1; i <= len; i++)
4270 PerlIO_printf(Perl_debug_log, "%"UVuf"[%"UVuf"] ",
4271 (UV)r->offsets[i*2-1],
4272 (UV)r->offsets[i*2]);
4273 PerlIO_printf(Perl_debug_log, "\n");
4275 #endif /* DEBUGGING */
4279 S_put_byte(pTHX_ SV *sv, int c)
4281 if (isCNTRL(c) || c == 127 || c == 255 || !isPRINT(c))
4282 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4283 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4284 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4286 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4290 - regprop - printable representation of opcode
4293 Perl_regprop(pTHX_ SV *sv, regnode *o)
4298 sv_setpvn(sv, "", 0);
4299 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4300 /* It would be nice to FAIL() here, but this may be called from
4301 regexec.c, and it would be hard to supply pRExC_state. */
4302 Perl_croak(aTHX_ "Corrupted regexp opcode");
4303 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4305 k = PL_regkind[(U8)OP(o)];
4308 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4309 STR_LEN(o), STRING(o), PL_colors[1]);
4310 else if (k == CURLY) {
4311 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4312 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4313 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4315 else if (k == WHILEM && o->flags) /* Ordinal/of */
4316 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4317 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4318 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4319 else if (k == LOGICAL)
4320 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4321 else if (k == ANYOF) {
4322 int i, rangestart = -1;
4323 U8 flags = ANYOF_FLAGS(o);
4324 const char * const anyofs[] = { /* Should be syncronized with
4325 * ANYOF_ #xdefines in regcomp.h */
4358 if (flags & ANYOF_LOCALE)
4359 sv_catpv(sv, "{loc}");
4360 if (flags & ANYOF_FOLD)
4361 sv_catpv(sv, "{i}");
4362 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4363 if (flags & ANYOF_INVERT)
4365 for (i = 0; i <= 256; i++) {
4366 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4367 if (rangestart == -1)
4369 } else if (rangestart != -1) {
4370 if (i <= rangestart + 3)
4371 for (; rangestart < i; rangestart++)
4372 put_byte(sv, rangestart);
4374 put_byte(sv, rangestart);
4376 put_byte(sv, i - 1);
4382 if (o->flags & ANYOF_CLASS)
4383 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4384 if (ANYOF_CLASS_TEST(o,i))
4385 sv_catpv(sv, anyofs[i]);
4387 if (flags & ANYOF_UNICODE)
4388 sv_catpv(sv, "{unicode}");
4389 else if (flags & ANYOF_UNICODE_ALL)
4390 sv_catpv(sv, "{all-unicode}");
4394 SV *sw = regclass_swash(o, FALSE, &lv);
4399 U8 s[UTF8_MAXLEN+1];
4401 for (i = 0; i <= 256; i++) { /* just the first 256 */
4402 U8 *e = uvchr_to_utf8(s, i);
4404 if (i < 256 && swash_fetch(sw, s, TRUE)) {
4405 if (rangestart == -1)
4407 } else if (rangestart != -1) {
4410 if (i <= rangestart + 3)
4411 for (; rangestart < i; rangestart++) {
4412 for(e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4416 for (e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4419 for (e = uvchr_to_utf8(s, i - 1), p = s; p < e; p++)
4426 sv_catpv(sv, "..."); /* et cetera */
4430 char *s = savepv(SvPVX(lv));
4433 while(*s && *s != '\n') s++;
4454 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4456 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4457 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4458 #endif /* DEBUGGING */
4462 Perl_re_intuit_string(pTHX_ regexp *prog)
4463 { /* Assume that RE_INTUIT is set */
4466 char *s = SvPV(prog->check_substr,n_a);
4468 if (!PL_colorset) reginitcolors();
4469 PerlIO_printf(Perl_debug_log,
4470 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4471 PL_colors[4],PL_colors[5],PL_colors[0],
4474 (strlen(s) > 60 ? "..." : ""));
4477 return prog->check_substr;
4481 Perl_pregfree(pTHX_ struct regexp *r)
4483 DEBUG_r(if (!PL_colorset) reginitcolors());
4485 if (!r || (--r->refcnt > 0))
4487 DEBUG_r(PerlIO_printf(Perl_debug_log,
4488 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4489 PL_colors[4],PL_colors[5],PL_colors[0],
4492 (strlen(r->precomp) > 60 ? "..." : "")));
4495 Safefree(r->precomp);
4496 if (r->offsets) /* 20010421 MJD */
4497 Safefree(r->offsets);
4498 if (RX_MATCH_COPIED(r))
4499 Safefree(r->subbeg);
4501 if (r->anchored_substr)
4502 SvREFCNT_dec(r->anchored_substr);
4503 if (r->float_substr)
4504 SvREFCNT_dec(r->float_substr);
4505 Safefree(r->substrs);
4508 int n = r->data->count;
4509 AV* new_comppad = NULL;
4514 switch (r->data->what[n]) {
4516 SvREFCNT_dec((SV*)r->data->data[n]);
4519 Safefree(r->data->data[n]);
4522 new_comppad = (AV*)r->data->data[n];
4525 if (new_comppad == NULL)
4526 Perl_croak(aTHX_ "panic: pregfree comppad");
4527 old_comppad = PL_comppad;
4528 old_curpad = PL_curpad;
4529 /* Watch out for global destruction's random ordering. */
4530 if (SvTYPE(new_comppad) == SVt_PVAV) {
4531 PL_comppad = new_comppad;
4532 PL_curpad = AvARRAY(new_comppad);
4536 op_free((OP_4tree*)r->data->data[n]);
4537 PL_comppad = old_comppad;
4538 PL_curpad = old_curpad;
4539 SvREFCNT_dec((SV*)new_comppad);
4545 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4548 Safefree(r->data->what);
4551 Safefree(r->startp);
4557 - regnext - dig the "next" pointer out of a node
4559 * [Note, when REGALIGN is defined there are two places in regmatch()
4560 * that bypass this code for speed.]
4563 Perl_regnext(pTHX_ register regnode *p)
4565 register I32 offset;
4567 if (p == &PL_regdummy)
4570 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4578 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4581 STRLEN l1 = strlen(pat1);
4582 STRLEN l2 = strlen(pat2);
4591 Copy(pat1, buf, l1 , char);
4592 Copy(pat2, buf + l1, l2 , char);
4593 buf[l1 + l2] = '\n';
4594 buf[l1 + l2 + 1] = '\0';
4596 /* ANSI variant takes additional second argument */
4597 va_start(args, pat2);
4601 msv = vmess(buf, &args);
4603 message = SvPV(msv,l1);
4606 Copy(message, buf, l1 , char);
4607 buf[l1] = '\0'; /* Overwrite \n */
4608 Perl_croak(aTHX_ "%s", buf);
4611 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4614 Perl_save_re_context(pTHX)
4617 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4618 SAVEI32(RExC_npar); /* () count. */
4619 SAVEI32(RExC_size); /* Code size. */
4620 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4621 SAVEVPTR(RExC_rx); /* from regcomp.c */
4622 SAVEI32(RExC_seen); /* from regcomp.c */
4623 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4624 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4625 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4626 SAVEPPTR(RExC_end); /* End of input for compile */
4627 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4630 SAVEI32(PL_reg_flags); /* from regexec.c */
4632 SAVEPPTR(PL_reginput); /* String-input pointer. */
4633 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4634 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4635 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4636 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4637 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4638 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4639 SAVEGENERICPV(PL_reg_start_tmp); /* from regexec.c */
4640 PL_reg_start_tmp = 0;
4641 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4642 PL_reg_start_tmpl = 0;
4643 SAVEVPTR(PL_regdata);
4644 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4645 SAVEI32(PL_regnarrate); /* from regexec.c */
4646 SAVEVPTR(PL_regprogram); /* from regexec.c */
4647 SAVEINT(PL_regindent); /* from regexec.c */
4648 SAVEVPTR(PL_regcc); /* from regexec.c */
4649 SAVEVPTR(PL_curcop);
4650 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4651 SAVEVPTR(PL_reg_re); /* from regexec.c */
4652 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4653 SAVESPTR(PL_reg_sv); /* from regexec.c */
4654 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4655 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4656 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4657 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4658 SAVEI32(PL_regnpar); /* () count. */
4659 SAVEI32(PL_regsize); /* from regexec.c */
4661 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4672 clear_re(pTHXo_ void *r)
4674 ReREFCNT_dec((regexp *)r);
projects / p5sagit/p5-mst-13.2.git / blob