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); \
421 /* used for the parse_flags section for (?c) -- japhy */
422 #define vWARN5(loc, m, a1, a2, a3, a4) \
424 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
425 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
427 (int)offset, RExC_precomp, RExC_precomp + offset); \
431 /* Allow for side effects in s */
432 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END
434 /* Macros for recording node offsets. 20001227 mjd@plover.com
435 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
436 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
437 * Element 0 holds the number n.
440 #define MJD_OFFSET_DEBUG(x)
441 /* #define MJD_OFFSET_DEBUG(x) fprintf x */
444 # define Set_Node_Offset_To_R(node,byte) \
448 Perl_croak(aTHX_ "value of node is %d in Offset macro", node); \
450 RExC_offsets[2*(node)-1] = (byte); \
455 # define Set_Node_Offset(node,byte) Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
456 # define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
458 # define Set_Node_Length_To_R(node,len) \
461 MJD_OFFSET_DEBUG((stderr, "** (%d) size of node %d is %d.\n", __LINE__, (node), (len))); \
463 Perl_croak(aTHX_ "value of node is %d in Length macro", node); \
465 RExC_offsets[2*(node)] = (len); \
470 # define Set_Node_Length(node,len) Set_Node_Length_To_R((node)-RExC_emit_start, len)
471 # define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
472 # define Set_Node_Cur_Length(node) Set_Node_Length(node, RExC_parse - parse_start)
474 /* Get offsets and lengths */
475 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
476 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
478 static void clear_re(pTHXo_ void *r);
480 /* Mark that we cannot extend a found fixed substring at this point.
481 Updata the longest found anchored substring and the longest found
482 floating substrings if needed. */
485 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
487 STRLEN l = CHR_SVLEN(data->last_found);
488 STRLEN old_l = CHR_SVLEN(*data->longest);
490 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
491 sv_setsv(*data->longest, data->last_found);
492 if (*data->longest == data->longest_fixed) {
493 data->offset_fixed = l ? data->last_start_min : data->pos_min;
494 if (data->flags & SF_BEFORE_EOL)
496 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
498 data->flags &= ~SF_FIX_BEFORE_EOL;
501 data->offset_float_min = l ? data->last_start_min : data->pos_min;
502 data->offset_float_max = (l
503 ? data->last_start_max
504 : data->pos_min + data->pos_delta);
505 if (data->flags & SF_BEFORE_EOL)
507 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
509 data->flags &= ~SF_FL_BEFORE_EOL;
512 SvCUR_set(data->last_found, 0);
514 data->flags &= ~SF_BEFORE_EOL;
517 /* Can match anything (initialization) */
519 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
523 ANYOF_CLASS_ZERO(cl);
524 for (value = 0; value < 256; ++value)
525 ANYOF_BITMAP_SET(cl, value);
526 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
528 cl->flags |= ANYOF_LOCALE;
531 /* Can match anything (initialization) */
533 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
537 for (value = 0; value <= ANYOF_MAX; value += 2)
538 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
540 if (!(cl->flags & ANYOF_UNICODE_ALL))
542 for (value = 0; value < 256; ++value)
543 if (!ANYOF_BITMAP_TEST(cl, value))
548 /* Can match anything (initialization) */
550 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
552 Zero(cl, 1, struct regnode_charclass_class);
554 cl_anything(pRExC_state, cl);
558 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
560 Zero(cl, 1, struct regnode_charclass_class);
562 cl_anything(pRExC_state, cl);
564 cl->flags |= ANYOF_LOCALE;
567 /* 'And' a given class with another one. Can create false positives */
568 /* We assume that cl is not inverted */
570 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
571 struct regnode_charclass_class *and_with)
573 if (!(and_with->flags & ANYOF_CLASS)
574 && !(cl->flags & ANYOF_CLASS)
575 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
576 && !(and_with->flags & ANYOF_FOLD)
577 && !(cl->flags & ANYOF_FOLD)) {
580 if (and_with->flags & ANYOF_INVERT)
581 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
582 cl->bitmap[i] &= ~and_with->bitmap[i];
584 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
585 cl->bitmap[i] &= and_with->bitmap[i];
586 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
587 if (!(and_with->flags & ANYOF_EOS))
588 cl->flags &= ~ANYOF_EOS;
590 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE) {
591 cl->flags &= ~ANYOF_UNICODE_ALL;
592 cl->flags |= ANYOF_UNICODE;
593 ARG_SET(cl, ARG(and_with));
595 if (!(and_with->flags & ANYOF_UNICODE_ALL))
596 cl->flags &= ~ANYOF_UNICODE_ALL;
597 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)))
598 cl->flags &= ~ANYOF_UNICODE;
601 /* 'OR' a given class with another one. Can create false positives */
602 /* We assume that cl is not inverted */
604 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
606 if (or_with->flags & ANYOF_INVERT) {
608 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
609 * <= (B1 | !B2) | (CL1 | !CL2)
610 * which is wasteful if CL2 is small, but we ignore CL2:
611 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
612 * XXXX Can we handle case-fold? Unclear:
613 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
614 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
616 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
617 && !(or_with->flags & ANYOF_FOLD)
618 && !(cl->flags & ANYOF_FOLD) ) {
621 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
622 cl->bitmap[i] |= ~or_with->bitmap[i];
623 } /* XXXX: logic is complicated otherwise */
625 cl_anything(pRExC_state, cl);
628 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
629 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
630 && (!(or_with->flags & ANYOF_FOLD)
631 || (cl->flags & ANYOF_FOLD)) ) {
634 /* OR char bitmap and class bitmap separately */
635 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
636 cl->bitmap[i] |= or_with->bitmap[i];
637 if (or_with->flags & ANYOF_CLASS) {
638 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
639 cl->classflags[i] |= or_with->classflags[i];
640 cl->flags |= ANYOF_CLASS;
643 else { /* XXXX: logic is complicated, leave it along for a moment. */
644 cl_anything(pRExC_state, cl);
647 if (or_with->flags & ANYOF_EOS)
648 cl->flags |= ANYOF_EOS;
650 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
651 ARG(cl) != ARG(or_with)) {
652 cl->flags |= ANYOF_UNICODE_ALL;
653 cl->flags &= ~ANYOF_UNICODE;
655 if (or_with->flags & ANYOF_UNICODE_ALL) {
656 cl->flags |= ANYOF_UNICODE_ALL;
657 cl->flags &= ~ANYOF_UNICODE;
661 /* REx optimizer. Converts nodes into quickier variants "in place".
662 Finds fixed substrings. */
664 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
665 to the position after last scanned or to NULL. */
668 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
669 /* scanp: Start here (read-write). */
670 /* deltap: Write maxlen-minlen here. */
671 /* last: Stop before this one. */
673 I32 min = 0, pars = 0, code;
674 regnode *scan = *scanp, *next;
676 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
677 int is_inf_internal = 0; /* The studied chunk is infinite */
678 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
679 scan_data_t data_fake;
680 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
682 while (scan && OP(scan) != END && scan < last) {
683 /* Peephole optimizer: */
685 if (PL_regkind[(U8)OP(scan)] == EXACT) {
686 /* Merge several consecutive EXACTish nodes into one. */
687 regnode *n = regnext(scan);
690 regnode *stop = scan;
693 next = scan + NODE_SZ_STR(scan);
694 /* Skip NOTHING, merge EXACT*. */
696 ( PL_regkind[(U8)OP(n)] == NOTHING ||
697 (stringok && (OP(n) == OP(scan))))
699 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
700 if (OP(n) == TAIL || n > next)
702 if (PL_regkind[(U8)OP(n)] == NOTHING) {
703 NEXT_OFF(scan) += NEXT_OFF(n);
704 next = n + NODE_STEP_REGNODE;
712 int oldl = STR_LEN(scan);
713 regnode *nnext = regnext(n);
715 if (oldl + STR_LEN(n) > U8_MAX)
717 NEXT_OFF(scan) += NEXT_OFF(n);
718 STR_LEN(scan) += STR_LEN(n);
719 next = n + NODE_SZ_STR(n);
720 /* Now we can overwrite *n : */
721 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
730 n = scan + NODE_SZ_STR(scan);
732 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
740 /* Follow the next-chain of the current node and optimize
741 away all the NOTHINGs from it. */
742 if (OP(scan) != CURLYX) {
743 int max = (reg_off_by_arg[OP(scan)]
745 /* I32 may be smaller than U16 on CRAYs! */
746 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
747 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
751 /* Skip NOTHING and LONGJMP. */
752 while ((n = regnext(n))
753 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
754 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
757 if (reg_off_by_arg[OP(scan)])
760 NEXT_OFF(scan) = off;
762 /* The principal pseudo-switch. Cannot be a switch, since we
763 look into several different things. */
764 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
765 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
766 next = regnext(scan);
769 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
770 I32 max1 = 0, min1 = I32_MAX, num = 0;
771 struct regnode_charclass_class accum;
773 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
774 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
775 if (flags & SCF_DO_STCLASS)
776 cl_init_zero(pRExC_state, &accum);
777 while (OP(scan) == code) {
778 I32 deltanext, minnext, f = 0, fake;
779 struct regnode_charclass_class this_class;
784 data_fake.whilem_c = data->whilem_c;
785 data_fake.last_closep = data->last_closep;
788 data_fake.last_closep = &fake;
789 next = regnext(scan);
790 scan = NEXTOPER(scan);
792 scan = NEXTOPER(scan);
793 if (flags & SCF_DO_STCLASS) {
794 cl_init(pRExC_state, &this_class);
795 data_fake.start_class = &this_class;
796 f = SCF_DO_STCLASS_AND;
798 if (flags & SCF_WHILEM_VISITED_POS)
799 f |= SCF_WHILEM_VISITED_POS;
800 /* we suppose the run is continuous, last=next...*/
801 minnext = study_chunk(pRExC_state, &scan, &deltanext,
802 next, &data_fake, f);
805 if (max1 < minnext + deltanext)
806 max1 = minnext + deltanext;
807 if (deltanext == I32_MAX)
808 is_inf = is_inf_internal = 1;
810 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
812 if (data && (data_fake.flags & SF_HAS_EVAL))
813 data->flags |= SF_HAS_EVAL;
815 data->whilem_c = data_fake.whilem_c;
816 if (flags & SCF_DO_STCLASS)
817 cl_or(pRExC_state, &accum, &this_class);
821 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
823 if (flags & SCF_DO_SUBSTR) {
824 data->pos_min += min1;
825 data->pos_delta += max1 - min1;
826 if (max1 != min1 || is_inf)
827 data->longest = &(data->longest_float);
830 delta += max1 - min1;
831 if (flags & SCF_DO_STCLASS_OR) {
832 cl_or(pRExC_state, data->start_class, &accum);
834 cl_and(data->start_class, &and_with);
835 flags &= ~SCF_DO_STCLASS;
838 else if (flags & SCF_DO_STCLASS_AND) {
840 cl_and(data->start_class, &accum);
841 flags &= ~SCF_DO_STCLASS;
844 /* Switch to OR mode: cache the old value of
845 * data->start_class */
846 StructCopy(data->start_class, &and_with,
847 struct regnode_charclass_class);
848 flags &= ~SCF_DO_STCLASS_AND;
849 StructCopy(&accum, data->start_class,
850 struct regnode_charclass_class);
851 flags |= SCF_DO_STCLASS_OR;
852 data->start_class->flags |= ANYOF_EOS;
856 else if (code == BRANCHJ) /* single branch is optimized. */
857 scan = NEXTOPER(NEXTOPER(scan));
858 else /* single branch is optimized. */
859 scan = NEXTOPER(scan);
862 else if (OP(scan) == EXACT) {
863 I32 l = STR_LEN(scan);
864 UV uc = *((U8*)STRING(scan));
866 U8 *s = (U8*)STRING(scan);
867 l = utf8_length(s, s + l);
868 uc = utf8_to_uvchr(s, NULL);
871 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
872 /* The code below prefers earlier match for fixed
873 offset, later match for variable offset. */
874 if (data->last_end == -1) { /* Update the start info. */
875 data->last_start_min = data->pos_min;
876 data->last_start_max = is_inf
877 ? I32_MAX : data->pos_min + data->pos_delta;
879 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
880 data->last_end = data->pos_min + l;
881 data->pos_min += l; /* As in the first entry. */
882 data->flags &= ~SF_BEFORE_EOL;
884 if (flags & SCF_DO_STCLASS_AND) {
885 /* Check whether it is compatible with what we know already! */
889 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
890 && !ANYOF_BITMAP_TEST(data->start_class, uc)
891 && (!(data->start_class->flags & ANYOF_FOLD)
892 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
895 ANYOF_CLASS_ZERO(data->start_class);
896 ANYOF_BITMAP_ZERO(data->start_class);
898 ANYOF_BITMAP_SET(data->start_class, uc);
899 data->start_class->flags &= ~ANYOF_EOS;
901 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
903 else if (flags & SCF_DO_STCLASS_OR) {
904 /* false positive possible if the class is case-folded */
906 ANYOF_BITMAP_SET(data->start_class, uc);
908 data->start_class->flags |= ANYOF_UNICODE_ALL;
909 data->start_class->flags &= ~ANYOF_EOS;
910 cl_and(data->start_class, &and_with);
912 flags &= ~SCF_DO_STCLASS;
914 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
915 I32 l = STR_LEN(scan);
916 UV uc = *((U8*)STRING(scan));
918 /* Search for fixed substrings supports EXACT only. */
919 if (flags & SCF_DO_SUBSTR)
920 scan_commit(pRExC_state, data);
922 U8 *s = (U8 *)STRING(scan);
923 l = utf8_length(s, s + l);
924 uc = utf8_to_uvchr(s, NULL);
927 if (data && (flags & SCF_DO_SUBSTR))
929 if (flags & SCF_DO_STCLASS_AND) {
930 /* Check whether it is compatible with what we know already! */
934 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
935 && !ANYOF_BITMAP_TEST(data->start_class, uc)
936 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
938 ANYOF_CLASS_ZERO(data->start_class);
939 ANYOF_BITMAP_ZERO(data->start_class);
941 ANYOF_BITMAP_SET(data->start_class, uc);
942 data->start_class->flags &= ~ANYOF_EOS;
943 data->start_class->flags |= ANYOF_FOLD;
944 if (OP(scan) == EXACTFL)
945 data->start_class->flags |= ANYOF_LOCALE;
948 else if (flags & SCF_DO_STCLASS_OR) {
949 if (data->start_class->flags & ANYOF_FOLD) {
950 /* false positive possible if the class is case-folded.
951 Assume that the locale settings are the same... */
953 ANYOF_BITMAP_SET(data->start_class, uc);
954 data->start_class->flags &= ~ANYOF_EOS;
956 cl_and(data->start_class, &and_with);
958 flags &= ~SCF_DO_STCLASS;
960 else if (strchr((char*)PL_varies,OP(scan))) {
961 I32 mincount, maxcount, minnext, deltanext, fl = 0;
962 I32 f = flags, pos_before = 0;
963 regnode *oscan = scan;
964 struct regnode_charclass_class this_class;
965 struct regnode_charclass_class *oclass = NULL;
967 switch (PL_regkind[(U8)OP(scan)]) {
968 case WHILEM: /* End of (?:...)* . */
969 scan = NEXTOPER(scan);
972 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
973 next = NEXTOPER(scan);
974 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
976 maxcount = REG_INFTY;
977 next = regnext(scan);
978 scan = NEXTOPER(scan);
982 if (flags & SCF_DO_SUBSTR)
987 if (flags & SCF_DO_STCLASS) {
989 maxcount = REG_INFTY;
990 next = regnext(scan);
991 scan = NEXTOPER(scan);
994 is_inf = is_inf_internal = 1;
995 scan = regnext(scan);
996 if (flags & SCF_DO_SUBSTR) {
997 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
998 data->longest = &(data->longest_float);
1000 goto optimize_curly_tail;
1002 mincount = ARG1(scan);
1003 maxcount = ARG2(scan);
1004 next = regnext(scan);
1005 if (OP(scan) == CURLYX) {
1006 I32 lp = (data ? *(data->last_closep) : 0);
1008 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
1010 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
1012 if (flags & SCF_DO_SUBSTR) {
1013 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
1014 pos_before = data->pos_min;
1018 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
1020 data->flags |= SF_IS_INF;
1022 if (flags & SCF_DO_STCLASS) {
1023 cl_init(pRExC_state, &this_class);
1024 oclass = data->start_class;
1025 data->start_class = &this_class;
1026 f |= SCF_DO_STCLASS_AND;
1027 f &= ~SCF_DO_STCLASS_OR;
1029 /* These are the cases when once a subexpression
1030 fails at a particular position, it cannot succeed
1031 even after backtracking at the enclosing scope.
1033 XXXX what if minimal match and we are at the
1034 initial run of {n,m}? */
1035 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
1036 f &= ~SCF_WHILEM_VISITED_POS;
1038 /* This will finish on WHILEM, setting scan, or on NULL: */
1039 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
1041 ? (f & ~SCF_DO_SUBSTR) : f);
1043 if (flags & SCF_DO_STCLASS)
1044 data->start_class = oclass;
1045 if (mincount == 0 || minnext == 0) {
1046 if (flags & SCF_DO_STCLASS_OR) {
1047 cl_or(pRExC_state, data->start_class, &this_class);
1049 else if (flags & SCF_DO_STCLASS_AND) {
1050 /* Switch to OR mode: cache the old value of
1051 * data->start_class */
1052 StructCopy(data->start_class, &and_with,
1053 struct regnode_charclass_class);
1054 flags &= ~SCF_DO_STCLASS_AND;
1055 StructCopy(&this_class, data->start_class,
1056 struct regnode_charclass_class);
1057 flags |= SCF_DO_STCLASS_OR;
1058 data->start_class->flags |= ANYOF_EOS;
1060 } else { /* Non-zero len */
1061 if (flags & SCF_DO_STCLASS_OR) {
1062 cl_or(pRExC_state, data->start_class, &this_class);
1063 cl_and(data->start_class, &and_with);
1065 else if (flags & SCF_DO_STCLASS_AND)
1066 cl_and(data->start_class, &this_class);
1067 flags &= ~SCF_DO_STCLASS;
1069 if (!scan) /* It was not CURLYX, but CURLY. */
1071 if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0)
1072 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1073 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1076 "Quantifier unexpected on zero-length expression");
1079 min += minnext * mincount;
1080 is_inf_internal |= ((maxcount == REG_INFTY
1081 && (minnext + deltanext) > 0)
1082 || deltanext == I32_MAX);
1083 is_inf |= is_inf_internal;
1084 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1086 /* Try powerful optimization CURLYX => CURLYN. */
1087 if ( OP(oscan) == CURLYX && data
1088 && data->flags & SF_IN_PAR
1089 && !(data->flags & SF_HAS_EVAL)
1090 && !deltanext && minnext == 1 ) {
1091 /* Try to optimize to CURLYN. */
1092 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1093 regnode *nxt1 = nxt, *nxt2;
1097 if (!strchr((char*)PL_simple,OP(nxt))
1098 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1099 && STR_LEN(nxt) == 1))
1103 if (OP(nxt) != CLOSE)
1105 /* Now we know that nxt2 is the only contents: */
1106 oscan->flags = ARG(nxt);
1108 OP(nxt1) = NOTHING; /* was OPEN. */
1110 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1111 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1112 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1113 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1114 OP(nxt + 1) = OPTIMIZED; /* was count. */
1115 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1120 /* Try optimization CURLYX => CURLYM. */
1121 if ( OP(oscan) == CURLYX && data
1122 && !(data->flags & SF_HAS_PAR)
1123 && !(data->flags & SF_HAS_EVAL)
1125 /* XXXX How to optimize if data == 0? */
1126 /* Optimize to a simpler form. */
1127 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1131 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1132 && (OP(nxt2) != WHILEM))
1134 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1135 /* Need to optimize away parenths. */
1136 if (data->flags & SF_IN_PAR) {
1137 /* Set the parenth number. */
1138 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1140 if (OP(nxt) != CLOSE)
1141 FAIL("Panic opt close");
1142 oscan->flags = ARG(nxt);
1143 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1144 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1146 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1147 OP(nxt + 1) = OPTIMIZED; /* was count. */
1148 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1149 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1152 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1153 regnode *nnxt = regnext(nxt1);
1156 if (reg_off_by_arg[OP(nxt1)])
1157 ARG_SET(nxt1, nxt2 - nxt1);
1158 else if (nxt2 - nxt1 < U16_MAX)
1159 NEXT_OFF(nxt1) = nxt2 - nxt1;
1161 OP(nxt) = NOTHING; /* Cannot beautify */
1166 /* Optimize again: */
1167 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1173 else if ((OP(oscan) == CURLYX)
1174 && (flags & SCF_WHILEM_VISITED_POS)
1175 /* See the comment on a similar expression above.
1176 However, this time it not a subexpression
1177 we care about, but the expression itself. */
1178 && (maxcount == REG_INFTY)
1179 && data && ++data->whilem_c < 16) {
1180 /* This stays as CURLYX, we can put the count/of pair. */
1181 /* Find WHILEM (as in regexec.c) */
1182 regnode *nxt = oscan + NEXT_OFF(oscan);
1184 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1186 PREVOPER(nxt)->flags = data->whilem_c
1187 | (RExC_whilem_seen << 4); /* On WHILEM */
1189 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1191 if (flags & SCF_DO_SUBSTR) {
1192 SV *last_str = Nullsv;
1193 int counted = mincount != 0;
1195 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1196 I32 b = pos_before >= data->last_start_min
1197 ? pos_before : data->last_start_min;
1199 char *s = SvPV(data->last_found, l);
1200 I32 old = b - data->last_start_min;
1203 old = utf8_hop((U8*)s, old) - (U8*)s;
1206 /* Get the added string: */
1207 last_str = newSVpvn(s + old, l);
1208 if (deltanext == 0 && pos_before == b) {
1209 /* What was added is a constant string */
1211 SvGROW(last_str, (mincount * l) + 1);
1212 repeatcpy(SvPVX(last_str) + l,
1213 SvPVX(last_str), l, mincount - 1);
1214 SvCUR(last_str) *= mincount;
1215 /* Add additional parts. */
1216 SvCUR_set(data->last_found,
1217 SvCUR(data->last_found) - l);
1218 sv_catsv(data->last_found, last_str);
1219 data->last_end += l * (mincount - 1);
1222 /* start offset must point into the last copy */
1223 data->last_start_min += minnext * (mincount - 1);
1224 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1225 * (minnext + data->pos_delta);
1228 /* It is counted once already... */
1229 data->pos_min += minnext * (mincount - counted);
1230 data->pos_delta += - counted * deltanext +
1231 (minnext + deltanext) * maxcount - minnext * mincount;
1232 if (mincount != maxcount) {
1233 /* Cannot extend fixed substrings found inside
1235 scan_commit(pRExC_state,data);
1236 if (mincount && last_str) {
1237 sv_setsv(data->last_found, last_str);
1238 data->last_end = data->pos_min;
1239 data->last_start_min =
1240 data->pos_min - CHR_SVLEN(last_str);
1241 data->last_start_max = is_inf
1243 : data->pos_min + data->pos_delta
1244 - CHR_SVLEN(last_str);
1246 data->longest = &(data->longest_float);
1248 SvREFCNT_dec(last_str);
1250 if (data && (fl & SF_HAS_EVAL))
1251 data->flags |= SF_HAS_EVAL;
1252 optimize_curly_tail:
1253 if (OP(oscan) != CURLYX) {
1254 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1256 NEXT_OFF(oscan) += NEXT_OFF(next);
1259 default: /* REF and CLUMP only? */
1260 if (flags & SCF_DO_SUBSTR) {
1261 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1262 data->longest = &(data->longest_float);
1264 is_inf = is_inf_internal = 1;
1265 if (flags & SCF_DO_STCLASS_OR)
1266 cl_anything(pRExC_state, data->start_class);
1267 flags &= ~SCF_DO_STCLASS;
1271 else if (strchr((char*)PL_simple,OP(scan))) {
1274 if (flags & SCF_DO_SUBSTR) {
1275 scan_commit(pRExC_state,data);
1279 if (flags & SCF_DO_STCLASS) {
1280 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1282 /* Some of the logic below assumes that switching
1283 locale on will only add false positives. */
1284 switch (PL_regkind[(U8)OP(scan)]) {
1288 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1289 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1290 cl_anything(pRExC_state, data->start_class);
1293 if (OP(scan) == SANY)
1295 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1296 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1297 || (data->start_class->flags & ANYOF_CLASS));
1298 cl_anything(pRExC_state, data->start_class);
1300 if (flags & SCF_DO_STCLASS_AND || !value)
1301 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1304 if (flags & SCF_DO_STCLASS_AND)
1305 cl_and(data->start_class,
1306 (struct regnode_charclass_class*)scan);
1308 cl_or(pRExC_state, data->start_class,
1309 (struct regnode_charclass_class*)scan);
1312 if (flags & SCF_DO_STCLASS_AND) {
1313 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1314 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1315 for (value = 0; value < 256; value++)
1316 if (!isALNUM(value))
1317 ANYOF_BITMAP_CLEAR(data->start_class, value);
1321 if (data->start_class->flags & ANYOF_LOCALE)
1322 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1324 for (value = 0; value < 256; value++)
1326 ANYOF_BITMAP_SET(data->start_class, value);
1331 if (flags & SCF_DO_STCLASS_AND) {
1332 if (data->start_class->flags & ANYOF_LOCALE)
1333 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1336 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1337 data->start_class->flags |= ANYOF_LOCALE;
1341 if (flags & SCF_DO_STCLASS_AND) {
1342 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1343 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1344 for (value = 0; value < 256; value++)
1346 ANYOF_BITMAP_CLEAR(data->start_class, value);
1350 if (data->start_class->flags & ANYOF_LOCALE)
1351 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1353 for (value = 0; value < 256; value++)
1354 if (!isALNUM(value))
1355 ANYOF_BITMAP_SET(data->start_class, value);
1360 if (flags & SCF_DO_STCLASS_AND) {
1361 if (data->start_class->flags & ANYOF_LOCALE)
1362 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1365 data->start_class->flags |= ANYOF_LOCALE;
1366 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1370 if (flags & SCF_DO_STCLASS_AND) {
1371 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1372 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1373 for (value = 0; value < 256; value++)
1374 if (!isSPACE(value))
1375 ANYOF_BITMAP_CLEAR(data->start_class, value);
1379 if (data->start_class->flags & ANYOF_LOCALE)
1380 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1382 for (value = 0; value < 256; value++)
1384 ANYOF_BITMAP_SET(data->start_class, value);
1389 if (flags & SCF_DO_STCLASS_AND) {
1390 if (data->start_class->flags & ANYOF_LOCALE)
1391 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1394 data->start_class->flags |= ANYOF_LOCALE;
1395 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1399 if (flags & SCF_DO_STCLASS_AND) {
1400 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1401 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1402 for (value = 0; value < 256; value++)
1404 ANYOF_BITMAP_CLEAR(data->start_class, value);
1408 if (data->start_class->flags & ANYOF_LOCALE)
1409 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1411 for (value = 0; value < 256; value++)
1412 if (!isSPACE(value))
1413 ANYOF_BITMAP_SET(data->start_class, value);
1418 if (flags & SCF_DO_STCLASS_AND) {
1419 if (data->start_class->flags & ANYOF_LOCALE) {
1420 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1421 for (value = 0; value < 256; value++)
1422 if (!isSPACE(value))
1423 ANYOF_BITMAP_CLEAR(data->start_class, value);
1427 data->start_class->flags |= ANYOF_LOCALE;
1428 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1432 if (flags & SCF_DO_STCLASS_AND) {
1433 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1434 for (value = 0; value < 256; value++)
1435 if (!isDIGIT(value))
1436 ANYOF_BITMAP_CLEAR(data->start_class, value);
1439 if (data->start_class->flags & ANYOF_LOCALE)
1440 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1442 for (value = 0; value < 256; value++)
1444 ANYOF_BITMAP_SET(data->start_class, value);
1449 if (flags & SCF_DO_STCLASS_AND) {
1450 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1451 for (value = 0; value < 256; value++)
1453 ANYOF_BITMAP_CLEAR(data->start_class, value);
1456 if (data->start_class->flags & ANYOF_LOCALE)
1457 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1459 for (value = 0; value < 256; value++)
1460 if (!isDIGIT(value))
1461 ANYOF_BITMAP_SET(data->start_class, value);
1466 if (flags & SCF_DO_STCLASS_OR)
1467 cl_and(data->start_class, &and_with);
1468 flags &= ~SCF_DO_STCLASS;
1471 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1472 data->flags |= (OP(scan) == MEOL
1476 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1477 /* Lookbehind, or need to calculate parens/evals/stclass: */
1478 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1479 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1480 /* Lookahead/lookbehind */
1481 I32 deltanext, minnext, fake = 0;
1483 struct regnode_charclass_class intrnl;
1486 data_fake.flags = 0;
1488 data_fake.whilem_c = data->whilem_c;
1489 data_fake.last_closep = data->last_closep;
1492 data_fake.last_closep = &fake;
1493 if ( flags & SCF_DO_STCLASS && !scan->flags
1494 && OP(scan) == IFMATCH ) { /* Lookahead */
1495 cl_init(pRExC_state, &intrnl);
1496 data_fake.start_class = &intrnl;
1497 f |= SCF_DO_STCLASS_AND;
1499 if (flags & SCF_WHILEM_VISITED_POS)
1500 f |= SCF_WHILEM_VISITED_POS;
1501 next = regnext(scan);
1502 nscan = NEXTOPER(NEXTOPER(scan));
1503 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1506 vFAIL("Variable length lookbehind not implemented");
1508 else if (minnext > U8_MAX) {
1509 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1511 scan->flags = minnext;
1513 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1515 if (data && (data_fake.flags & SF_HAS_EVAL))
1516 data->flags |= SF_HAS_EVAL;
1518 data->whilem_c = data_fake.whilem_c;
1519 if (f & SCF_DO_STCLASS_AND) {
1520 int was = (data->start_class->flags & ANYOF_EOS);
1522 cl_and(data->start_class, &intrnl);
1524 data->start_class->flags |= ANYOF_EOS;
1527 else if (OP(scan) == OPEN) {
1530 else if (OP(scan) == CLOSE) {
1531 if (ARG(scan) == is_par) {
1532 next = regnext(scan);
1534 if ( next && (OP(next) != WHILEM) && next < last)
1535 is_par = 0; /* Disable optimization */
1538 *(data->last_closep) = ARG(scan);
1540 else if (OP(scan) == EVAL) {
1542 data->flags |= SF_HAS_EVAL;
1544 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1545 if (flags & SCF_DO_SUBSTR) {
1546 scan_commit(pRExC_state,data);
1547 data->longest = &(data->longest_float);
1549 is_inf = is_inf_internal = 1;
1550 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1551 cl_anything(pRExC_state, data->start_class);
1552 flags &= ~SCF_DO_STCLASS;
1554 /* Else: zero-length, ignore. */
1555 scan = regnext(scan);
1560 *deltap = is_inf_internal ? I32_MAX : delta;
1561 if (flags & SCF_DO_SUBSTR && is_inf)
1562 data->pos_delta = I32_MAX - data->pos_min;
1563 if (is_par > U8_MAX)
1565 if (is_par && pars==1 && data) {
1566 data->flags |= SF_IN_PAR;
1567 data->flags &= ~SF_HAS_PAR;
1569 else if (pars && data) {
1570 data->flags |= SF_HAS_PAR;
1571 data->flags &= ~SF_IN_PAR;
1573 if (flags & SCF_DO_STCLASS_OR)
1574 cl_and(data->start_class, &and_with);
1579 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1581 if (RExC_rx->data) {
1582 Renewc(RExC_rx->data,
1583 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1584 char, struct reg_data);
1585 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1586 RExC_rx->data->count += n;
1589 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1590 char, struct reg_data);
1591 New(1208, RExC_rx->data->what, n, U8);
1592 RExC_rx->data->count = n;
1594 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1595 return RExC_rx->data->count - n;
1599 Perl_reginitcolors(pTHX)
1602 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1605 PL_colors[0] = s = savepv(s);
1607 s = strchr(s, '\t');
1613 PL_colors[i] = s = "";
1617 PL_colors[i++] = "";
1624 - pregcomp - compile a regular expression into internal code
1626 * We can't allocate space until we know how big the compiled form will be,
1627 * but we can't compile it (and thus know how big it is) until we've got a
1628 * place to put the code. So we cheat: we compile it twice, once with code
1629 * generation turned off and size counting turned on, and once "for real".
1630 * This also means that we don't allocate space until we are sure that the
1631 * thing really will compile successfully, and we never have to move the
1632 * code and thus invalidate pointers into it. (Note that it has to be in
1633 * one piece because free() must be able to free it all.) [NB: not true in perl]
1635 * Beware that the optimization-preparation code in here knows about some
1636 * of the structure of the compiled regexp. [I'll say.]
1639 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1649 RExC_state_t RExC_state;
1650 RExC_state_t *pRExC_state = &RExC_state;
1653 FAIL("NULL regexp argument");
1655 /* XXXX This looks very suspicious... */
1656 if (pm->op_pmdynflags & PMdf_CMP_UTF8)
1662 DEBUG_r(if (!PL_colorset) reginitcolors());
1663 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1664 PL_colors[4],PL_colors[5],PL_colors[0],
1665 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1666 RExC_flags16 = pm->op_pmflags;
1670 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1671 RExC_seen_evals = 0;
1674 /* First pass: determine size, legality. */
1681 RExC_emit = &PL_regdummy;
1682 RExC_whilem_seen = 0;
1683 #if 0 /* REGC() is (currently) a NOP at the first pass.
1684 * Clever compilers notice this and complain. --jhi */
1685 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1687 if (reg(pRExC_state, 0, &flags) == NULL) {
1688 RExC_precomp = Nullch;
1691 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1693 /* Small enough for pointer-storage convention?
1694 If extralen==0, this means that we will not need long jumps. */
1695 if (RExC_size >= 0x10000L && RExC_extralen)
1696 RExC_size += RExC_extralen;
1699 if (RExC_whilem_seen > 15)
1700 RExC_whilem_seen = 15;
1702 /* Allocate space and initialize. */
1703 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1706 FAIL("Regexp out of space");
1709 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1710 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1713 r->prelen = xend - exp;
1714 r->precomp = savepvn(RExC_precomp, r->prelen);
1716 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1717 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1719 r->substrs = 0; /* Useful during FAIL. */
1720 r->startp = 0; /* Useful during FAIL. */
1721 r->endp = 0; /* Useful during FAIL. */
1723 Newz(1304, r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
1725 r->offsets[0] = RExC_size;
1727 DEBUG_r(PerlIO_printf(Perl_debug_log,
1728 "%s %"UVuf" bytes for offset annotations.\n",
1729 r->offsets ? "Got" : "Couldn't get",
1730 (UV)((2*RExC_size+1) * sizeof(U32))));
1734 /* Second pass: emit code. */
1739 RExC_emit_start = r->program;
1740 RExC_emit = r->program;
1741 /* Store the count of eval-groups for security checks: */
1742 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1743 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1745 if (reg(pRExC_state, 0, &flags) == NULL)
1748 /* Dig out information for optimizations. */
1749 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1750 pm->op_pmflags = RExC_flags16;
1752 r->reganch |= ROPT_UTF8;
1753 r->regstclass = NULL;
1754 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1755 r->reganch |= ROPT_NAUGHTY;
1756 scan = r->program + 1; /* First BRANCH. */
1758 /* XXXX To minimize changes to RE engine we always allocate
1759 3-units-long substrs field. */
1760 Newz(1004, r->substrs, 1, struct reg_substr_data);
1762 StructCopy(&zero_scan_data, &data, scan_data_t);
1763 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1764 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1766 STRLEN longest_float_length, longest_fixed_length;
1767 struct regnode_charclass_class ch_class;
1772 /* Skip introductions and multiplicators >= 1. */
1773 while ((OP(first) == OPEN && (sawopen = 1)) ||
1774 /* An OR of *one* alternative - should not happen now. */
1775 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1776 (OP(first) == PLUS) ||
1777 (OP(first) == MINMOD) ||
1778 /* An {n,m} with n>0 */
1779 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1780 if (OP(first) == PLUS)
1783 first += regarglen[(U8)OP(first)];
1784 first = NEXTOPER(first);
1787 /* Starting-point info. */
1789 if (PL_regkind[(U8)OP(first)] == EXACT) {
1790 if (OP(first) == EXACT)
1791 ; /* Empty, get anchored substr later. */
1792 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1793 r->regstclass = first;
1795 else if (strchr((char*)PL_simple,OP(first)))
1796 r->regstclass = first;
1797 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1798 PL_regkind[(U8)OP(first)] == NBOUND)
1799 r->regstclass = first;
1800 else if (PL_regkind[(U8)OP(first)] == BOL) {
1801 r->reganch |= (OP(first) == MBOL
1803 : (OP(first) == SBOL
1806 first = NEXTOPER(first);
1809 else if (OP(first) == GPOS) {
1810 r->reganch |= ROPT_ANCH_GPOS;
1811 first = NEXTOPER(first);
1814 else if ((OP(first) == STAR &&
1815 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1816 !(r->reganch & ROPT_ANCH) )
1818 /* turn .* into ^.* with an implied $*=1 */
1819 int type = OP(NEXTOPER(first));
1821 if (type == REG_ANY)
1822 type = ROPT_ANCH_MBOL;
1824 type = ROPT_ANCH_SBOL;
1826 r->reganch |= type | ROPT_IMPLICIT;
1827 first = NEXTOPER(first);
1830 if (sawplus && (!sawopen || !RExC_sawback)
1831 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1832 /* x+ must match at the 1st pos of run of x's */
1833 r->reganch |= ROPT_SKIP;
1835 /* Scan is after the zeroth branch, first is atomic matcher. */
1836 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1837 (IV)(first - scan + 1)));
1839 * If there's something expensive in the r.e., find the
1840 * longest literal string that must appear and make it the
1841 * regmust. Resolve ties in favor of later strings, since
1842 * the regstart check works with the beginning of the r.e.
1843 * and avoiding duplication strengthens checking. Not a
1844 * strong reason, but sufficient in the absence of others.
1845 * [Now we resolve ties in favor of the earlier string if
1846 * it happens that c_offset_min has been invalidated, since the
1847 * earlier string may buy us something the later one won't.]
1851 data.longest_fixed = newSVpvn("",0);
1852 data.longest_float = newSVpvn("",0);
1853 data.last_found = newSVpvn("",0);
1854 data.longest = &(data.longest_fixed);
1856 if (!r->regstclass) {
1857 cl_init(pRExC_state, &ch_class);
1858 data.start_class = &ch_class;
1859 stclass_flag = SCF_DO_STCLASS_AND;
1860 } else /* XXXX Check for BOUND? */
1862 data.last_closep = &last_close;
1864 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1865 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1866 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1867 && data.last_start_min == 0 && data.last_end > 0
1868 && !RExC_seen_zerolen
1869 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1870 r->reganch |= ROPT_CHECK_ALL;
1871 scan_commit(pRExC_state, &data);
1872 SvREFCNT_dec(data.last_found);
1874 longest_float_length = CHR_SVLEN(data.longest_float);
1875 if (longest_float_length
1876 || (data.flags & SF_FL_BEFORE_EOL
1877 && (!(data.flags & SF_FL_BEFORE_MEOL)
1878 || (RExC_flags16 & PMf_MULTILINE)))) {
1881 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1882 && data.offset_fixed == data.offset_float_min
1883 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1884 goto remove_float; /* As in (a)+. */
1886 r->float_substr = data.longest_float;
1887 r->float_min_offset = data.offset_float_min;
1888 r->float_max_offset = data.offset_float_max;
1889 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1890 && (!(data.flags & SF_FL_BEFORE_MEOL)
1891 || (RExC_flags16 & PMf_MULTILINE)));
1892 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1896 r->float_substr = Nullsv;
1897 SvREFCNT_dec(data.longest_float);
1898 longest_float_length = 0;
1901 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1902 if (longest_fixed_length
1903 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1904 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1905 || (RExC_flags16 & PMf_MULTILINE)))) {
1908 r->anchored_substr = data.longest_fixed;
1909 r->anchored_offset = data.offset_fixed;
1910 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1911 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1912 || (RExC_flags16 & PMf_MULTILINE)));
1913 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1916 r->anchored_substr = Nullsv;
1917 SvREFCNT_dec(data.longest_fixed);
1918 longest_fixed_length = 0;
1921 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1922 r->regstclass = NULL;
1923 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1924 && !(data.start_class->flags & ANYOF_EOS)
1925 && !cl_is_anything(data.start_class)) {
1926 I32 n = add_data(pRExC_state, 1, "f");
1928 New(1006, RExC_rx->data->data[n], 1,
1929 struct regnode_charclass_class);
1930 StructCopy(data.start_class,
1931 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1932 struct regnode_charclass_class);
1933 r->regstclass = (regnode*)RExC_rx->data->data[n];
1934 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1935 PL_regdata = r->data; /* for regprop() */
1936 DEBUG_r({ SV *sv = sv_newmortal();
1937 regprop(sv, (regnode*)data.start_class);
1938 PerlIO_printf(Perl_debug_log,
1939 "synthetic stclass `%s'.\n",
1943 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1944 if (longest_fixed_length > longest_float_length) {
1945 r->check_substr = r->anchored_substr;
1946 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1947 if (r->reganch & ROPT_ANCH_SINGLE)
1948 r->reganch |= ROPT_NOSCAN;
1951 r->check_substr = r->float_substr;
1952 r->check_offset_min = data.offset_float_min;
1953 r->check_offset_max = data.offset_float_max;
1955 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1956 This should be changed ASAP! */
1957 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1958 r->reganch |= RE_USE_INTUIT;
1959 if (SvTAIL(r->check_substr))
1960 r->reganch |= RE_INTUIT_TAIL;
1964 /* Several toplevels. Best we can is to set minlen. */
1966 struct regnode_charclass_class ch_class;
1969 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1970 scan = r->program + 1;
1971 cl_init(pRExC_state, &ch_class);
1972 data.start_class = &ch_class;
1973 data.last_closep = &last_close;
1974 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1975 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1976 if (!(data.start_class->flags & ANYOF_EOS)
1977 && !cl_is_anything(data.start_class)) {
1978 I32 n = add_data(pRExC_state, 1, "f");
1980 New(1006, RExC_rx->data->data[n], 1,
1981 struct regnode_charclass_class);
1982 StructCopy(data.start_class,
1983 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1984 struct regnode_charclass_class);
1985 r->regstclass = (regnode*)RExC_rx->data->data[n];
1986 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1987 DEBUG_r({ SV* sv = sv_newmortal();
1988 regprop(sv, (regnode*)data.start_class);
1989 PerlIO_printf(Perl_debug_log,
1990 "synthetic stclass `%s'.\n",
1996 if (RExC_seen & REG_SEEN_GPOS)
1997 r->reganch |= ROPT_GPOS_SEEN;
1998 if (RExC_seen & REG_SEEN_LOOKBEHIND)
1999 r->reganch |= ROPT_LOOKBEHIND_SEEN;
2000 if (RExC_seen & REG_SEEN_EVAL)
2001 r->reganch |= ROPT_EVAL_SEEN;
2002 if (RExC_seen & REG_SEEN_SANY)
2003 r->reganch |= ROPT_SANY_SEEN;
2004 Newz(1002, r->startp, RExC_npar, I32);
2005 Newz(1002, r->endp, RExC_npar, I32);
2006 PL_regdata = r->data; /* for regprop() */
2007 DEBUG_r(regdump(r));
2012 - reg - regular expression, i.e. main body or parenthesized thing
2014 * Caller must absorb opening parenthesis.
2016 * Combining parenthesis handling with the base level of regular expression
2017 * is a trifle forced, but the need to tie the tails of the branches to what
2018 * follows makes it hard to avoid.
2021 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
2022 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
2024 register regnode *ret; /* Will be the head of the group. */
2025 register regnode *br;
2026 register regnode *lastbr;
2027 register regnode *ender = 0;
2028 register I32 parno = 0;
2029 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
2031 /* for (?g), (?gc), and (?o) warnings; warning
2032 about (?c) will warn about (?g) -- japhy */
2034 I32 wastedflags = 0x00,
2037 wasted_gc = 0x02 | 0x04,
2040 char * parse_start = RExC_parse; /* MJD */
2041 char *oregcomp_parse = RExC_parse;
2044 *flagp = 0; /* Tentatively. */
2047 /* Make an OPEN node, if parenthesized. */
2049 if (*RExC_parse == '?') { /* (?...) */
2050 U16 posflags = 0, negflags = 0;
2051 U16 *flagsp = &posflags;
2053 char *seqstart = RExC_parse;
2056 paren = *RExC_parse++;
2057 ret = NULL; /* For look-ahead/behind. */
2059 case '<': /* (?<...) */
2060 RExC_seen |= REG_SEEN_LOOKBEHIND;
2061 if (*RExC_parse == '!')
2063 if (*RExC_parse != '=' && *RExC_parse != '!')
2066 case '=': /* (?=...) */
2067 case '!': /* (?!...) */
2068 RExC_seen_zerolen++;
2069 case ':': /* (?:...) */
2070 case '>': /* (?>...) */
2072 case '$': /* (?$...) */
2073 case '@': /* (?@...) */
2074 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2076 case '#': /* (?#...) */
2077 while (*RExC_parse && *RExC_parse != ')')
2079 if (*RExC_parse != ')')
2080 FAIL("Sequence (?#... not terminated");
2081 nextchar(pRExC_state);
2084 case 'p': /* (?p...) */
2086 vWARN(RExC_parse, "(?p{}) is deprecated - use (??{})");
2088 case '?': /* (??...) */
2090 paren = *RExC_parse++;
2092 case '{': /* (?{...}) */
2094 I32 count = 1, n = 0;
2096 char *s = RExC_parse;
2098 OP_4tree *sop, *rop;
2100 RExC_seen_zerolen++;
2101 RExC_seen |= REG_SEEN_EVAL;
2102 while (count && (c = *RExC_parse)) {
2103 if (c == '\\' && RExC_parse[1])
2111 if (*RExC_parse != ')')
2114 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2119 if (RExC_parse - 1 - s)
2120 sv = newSVpvn(s, RExC_parse - 1 - s);
2122 sv = newSVpvn("", 0);
2125 Perl_save_re_context(aTHX);
2126 rop = sv_compile_2op(sv, &sop, "re", &av);
2129 n = add_data(pRExC_state, 3, "nop");
2130 RExC_rx->data->data[n] = (void*)rop;
2131 RExC_rx->data->data[n+1] = (void*)sop;
2132 RExC_rx->data->data[n+2] = (void*)av;
2135 else { /* First pass */
2136 if (PL_reginterp_cnt < ++RExC_seen_evals
2137 && PL_curcop != &PL_compiling)
2138 /* No compiled RE interpolated, has runtime
2139 components ===> unsafe. */
2140 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2141 if (PL_tainting && PL_tainted)
2142 FAIL("Eval-group in insecure regular expression");
2145 nextchar(pRExC_state);
2147 ret = reg_node(pRExC_state, LOGICAL);
2150 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2151 /* deal with the length of this later - MJD */
2154 return reganode(pRExC_state, EVAL, n);
2156 case '(': /* (?(?{...})...) and (?(?=...)...) */
2158 if (RExC_parse[0] == '?') { /* (?(?...)) */
2159 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2160 || RExC_parse[1] == '<'
2161 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2164 ret = reg_node(pRExC_state, LOGICAL);
2167 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2171 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2173 parno = atoi(RExC_parse++);
2175 while (isDIGIT(*RExC_parse))
2177 ret = reganode(pRExC_state, GROUPP, parno);
2179 if ((c = *nextchar(pRExC_state)) != ')')
2180 vFAIL("Switch condition not recognized");
2182 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2183 br = regbranch(pRExC_state, &flags, 1);
2185 br = reganode(pRExC_state, LONGJMP, 0);
2187 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2188 c = *nextchar(pRExC_state);
2192 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2193 regbranch(pRExC_state, &flags, 1);
2194 regtail(pRExC_state, ret, lastbr);
2197 c = *nextchar(pRExC_state);
2202 vFAIL("Switch (?(condition)... contains too many branches");
2203 ender = reg_node(pRExC_state, TAIL);
2204 regtail(pRExC_state, br, ender);
2206 regtail(pRExC_state, lastbr, ender);
2207 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2210 regtail(pRExC_state, ret, ender);
2214 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2218 RExC_parse--; /* for vFAIL to print correctly */
2219 vFAIL("Sequence (? incomplete");
2223 parse_flags: /* (?i) */
2224 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2225 /* (?g), (?gc) and (?o) are useless here
2226 and must be globally applied -- japhy */
2228 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
2229 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2230 I32 wflagbit = *RExC_parse == 'o' ? wasted_o : wasted_g;
2231 if (! (wastedflags & wflagbit) ) {
2232 wastedflags |= wflagbit;
2235 "Useless (%s%c) - %suse /%c modifier",
2236 flagsp == &negflags ? "?-" : "?",
2238 flagsp == &negflags ? "don't " : "",
2244 else if (*RExC_parse == 'c') {
2245 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2246 if (! (wastedflags & wasted_c) ) {
2247 wastedflags |= wasted_gc;
2250 "Useless (%sc) - %suse /gc modifier",
2251 flagsp == &negflags ? "?-" : "?",
2252 flagsp == &negflags ? "don't " : ""
2257 else { pmflag(flagsp, *RExC_parse); }
2261 if (*RExC_parse == '-') {
2263 wastedflags = 0; /* reset so (?g-c) warns twice */
2267 RExC_flags16 |= posflags;
2268 RExC_flags16 &= ~negflags;
2269 if (*RExC_parse == ':') {
2275 if (*RExC_parse != ')') {
2277 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2279 nextchar(pRExC_state);
2287 ret = reganode(pRExC_state, OPEN, parno);
2288 Set_Node_Length(ret, 1); /* MJD */
2289 Set_Node_Offset(ret, RExC_parse); /* MJD */
2296 /* Pick up the branches, linking them together. */
2297 parse_start = RExC_parse; /* MJD */
2298 br = regbranch(pRExC_state, &flags, 1);
2299 /* branch_len = (paren != 0); */
2303 if (*RExC_parse == '|') {
2304 if (!SIZE_ONLY && RExC_extralen) {
2305 reginsert(pRExC_state, BRANCHJ, br);
2308 reginsert(pRExC_state, BRANCH, br);
2309 Set_Node_Length(br, paren != 0);
2310 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
2314 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2316 else if (paren == ':') {
2317 *flagp |= flags&SIMPLE;
2319 if (open) { /* Starts with OPEN. */
2320 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2322 else if (paren != '?') /* Not Conditional */
2326 *flagp |= flags&SPSTART;
2328 while (*RExC_parse == '|') {
2329 if (!SIZE_ONLY && RExC_extralen) {
2330 ender = reganode(pRExC_state, LONGJMP,0);
2331 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2334 RExC_extralen += 2; /* Account for LONGJMP. */
2335 nextchar(pRExC_state);
2336 br = regbranch(pRExC_state, &flags, 0);
2340 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2344 *flagp |= flags&SPSTART;
2347 if (have_branch || paren != ':') {
2348 /* Make a closing node, and hook it on the end. */
2351 ender = reg_node(pRExC_state, TAIL);
2354 ender = reganode(pRExC_state, CLOSE, parno);
2355 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
2356 Set_Node_Length(ender,1); /* MJD */
2362 *flagp &= ~HASWIDTH;
2365 ender = reg_node(pRExC_state, SUCCEED);
2368 ender = reg_node(pRExC_state, END);
2371 regtail(pRExC_state, lastbr, ender);
2374 /* Hook the tails of the branches to the closing node. */
2375 for (br = ret; br != NULL; br = regnext(br)) {
2376 regoptail(pRExC_state, br, ender);
2383 static char parens[] = "=!<,>";
2385 if (paren && (p = strchr(parens, paren))) {
2386 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2387 int flag = (p - parens) > 1;
2390 node = SUSPEND, flag = 0;
2391 reginsert(pRExC_state, node,ret);
2393 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2397 /* Check for proper termination. */
2399 RExC_flags16 = oregflags;
2400 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2401 RExC_parse = oregcomp_parse;
2402 vFAIL("Unmatched (");
2405 else if (!paren && RExC_parse < RExC_end) {
2406 if (*RExC_parse == ')') {
2408 vFAIL("Unmatched )");
2411 FAIL("Junk on end of regexp"); /* "Can't happen". */
2419 - regbranch - one alternative of an | operator
2421 * Implements the concatenation operator.
2424 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2426 register regnode *ret;
2427 register regnode *chain = NULL;
2428 register regnode *latest;
2429 I32 flags = 0, c = 0;
2434 if (!SIZE_ONLY && RExC_extralen)
2435 ret = reganode(pRExC_state, BRANCHJ,0);
2437 ret = reg_node(pRExC_state, BRANCH);
2438 Set_Node_Length(ret, 1);
2442 if (!first && SIZE_ONLY)
2443 RExC_extralen += 1; /* BRANCHJ */
2445 *flagp = WORST; /* Tentatively. */
2448 nextchar(pRExC_state);
2449 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2451 latest = regpiece(pRExC_state, &flags);
2452 if (latest == NULL) {
2453 if (flags & TRYAGAIN)
2457 else if (ret == NULL)
2459 *flagp |= flags&HASWIDTH;
2460 if (chain == NULL) /* First piece. */
2461 *flagp |= flags&SPSTART;
2464 regtail(pRExC_state, chain, latest);
2469 if (chain == NULL) { /* Loop ran zero times. */
2470 chain = reg_node(pRExC_state, NOTHING);
2475 *flagp |= flags&SIMPLE;
2482 - regpiece - something followed by possible [*+?]
2484 * Note that the branching code sequences used for ? and the general cases
2485 * of * and + are somewhat optimized: they use the same NOTHING node as
2486 * both the endmarker for their branch list and the body of the last branch.
2487 * It might seem that this node could be dispensed with entirely, but the
2488 * endmarker role is not redundant.
2491 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2493 register regnode *ret;
2495 register char *next;
2497 char *origparse = RExC_parse;
2500 I32 max = REG_INFTY;
2503 ret = regatom(pRExC_state, &flags);
2505 if (flags & TRYAGAIN)
2512 if (op == '{' && regcurly(RExC_parse)) {
2513 parse_start = RExC_parse; /* MJD */
2514 next = RExC_parse + 1;
2516 while (isDIGIT(*next) || *next == ',') {
2525 if (*next == '}') { /* got one */
2529 min = atoi(RExC_parse);
2533 maxpos = RExC_parse;
2535 if (!max && *maxpos != '0')
2536 max = REG_INFTY; /* meaning "infinity" */
2537 else if (max >= REG_INFTY)
2538 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2540 nextchar(pRExC_state);
2543 if ((flags&SIMPLE)) {
2544 RExC_naughty += 2 + RExC_naughty / 2;
2545 reginsert(pRExC_state, CURLY, ret);
2546 Set_Node_Offset(ret, parse_start+1); /* MJD */
2547 Set_Node_Cur_Length(ret);
2550 regnode *w = reg_node(pRExC_state, WHILEM);
2553 regtail(pRExC_state, ret, w);
2554 if (!SIZE_ONLY && RExC_extralen) {
2555 reginsert(pRExC_state, LONGJMP,ret);
2556 reginsert(pRExC_state, NOTHING,ret);
2557 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2559 reginsert(pRExC_state, CURLYX,ret);
2561 Set_Node_Offset(ret, parse_start+1);
2562 Set_Node_Length(ret,
2563 op == '{' ? (RExC_parse - parse_start) : 1);
2565 if (!SIZE_ONLY && RExC_extralen)
2566 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2567 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2569 RExC_whilem_seen++, RExC_extralen += 3;
2570 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2578 if (max && max < min)
2579 vFAIL("Can't do {n,m} with n > m");
2594 #if 0 /* Now runtime fix should be reliable. */
2596 /* if this is reinstated, don't forget to put this back into perldiag:
2598 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2600 (F) The part of the regexp subject to either the * or + quantifier
2601 could match an empty string. The {#} shows in the regular
2602 expression about where the problem was discovered.
2606 if (!(flags&HASWIDTH) && op != '?')
2607 vFAIL("Regexp *+ operand could be empty");
2610 parse_start = RExC_parse;
2611 nextchar(pRExC_state);
2613 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2615 if (op == '*' && (flags&SIMPLE)) {
2616 reginsert(pRExC_state, STAR, ret);
2620 else if (op == '*') {
2624 else if (op == '+' && (flags&SIMPLE)) {
2625 reginsert(pRExC_state, PLUS, ret);
2629 else if (op == '+') {
2633 else if (op == '?') {
2638 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2640 "%.*s matches null string many times",
2641 RExC_parse - origparse,
2645 if (*RExC_parse == '?') {
2646 nextchar(pRExC_state);
2647 reginsert(pRExC_state, MINMOD, ret);
2648 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2650 if (ISMULT2(RExC_parse)) {
2652 vFAIL("Nested quantifiers");
2659 - regatom - the lowest level
2661 * Optimization: gobbles an entire sequence of ordinary characters so that
2662 * it can turn them into a single node, which is smaller to store and
2663 * faster to run. Backslashed characters are exceptions, each becoming a
2664 * separate node; the code is simpler that way and it's not worth fixing.
2666 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2668 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2670 register regnode *ret = 0;
2673 *flagp = WORST; /* Tentatively. */
2676 switch (*RExC_parse) {
2678 RExC_seen_zerolen++;
2679 nextchar(pRExC_state);
2680 if (RExC_flags16 & PMf_MULTILINE)
2681 ret = reg_node(pRExC_state, MBOL);
2682 else if (RExC_flags16 & PMf_SINGLELINE)
2683 ret = reg_node(pRExC_state, SBOL);
2685 ret = reg_node(pRExC_state, BOL);
2686 Set_Node_Length(ret, 1); /* MJD */
2689 nextchar(pRExC_state);
2691 RExC_seen_zerolen++;
2692 if (RExC_flags16 & PMf_MULTILINE)
2693 ret = reg_node(pRExC_state, MEOL);
2694 else if (RExC_flags16 & PMf_SINGLELINE)
2695 ret = reg_node(pRExC_state, SEOL);
2697 ret = reg_node(pRExC_state, EOL);
2698 Set_Node_Length(ret, 1); /* MJD */
2701 nextchar(pRExC_state);
2702 if (RExC_flags16 & PMf_SINGLELINE)
2703 ret = reg_node(pRExC_state, SANY);
2705 ret = reg_node(pRExC_state, REG_ANY);
2706 *flagp |= HASWIDTH|SIMPLE;
2708 Set_Node_Length(ret, 1); /* MJD */
2712 char *oregcomp_parse = ++RExC_parse;
2713 ret = regclass(pRExC_state);
2714 if (*RExC_parse != ']') {
2715 RExC_parse = oregcomp_parse;
2716 vFAIL("Unmatched [");
2718 nextchar(pRExC_state);
2719 *flagp |= HASWIDTH|SIMPLE;
2720 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
2724 nextchar(pRExC_state);
2725 ret = reg(pRExC_state, 1, &flags);
2727 if (flags & TRYAGAIN) {
2728 if (RExC_parse == RExC_end) {
2729 /* Make parent create an empty node if needed. */
2737 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2741 if (flags & TRYAGAIN) {
2745 vFAIL("Internal urp");
2746 /* Supposed to be caught earlier. */
2749 if (!regcurly(RExC_parse)) {
2758 vFAIL("Quantifier follows nothing");
2761 switch (*++RExC_parse) {
2763 RExC_seen_zerolen++;
2764 ret = reg_node(pRExC_state, SBOL);
2766 nextchar(pRExC_state);
2767 Set_Node_Length(ret, 2); /* MJD */
2770 ret = reg_node(pRExC_state, GPOS);
2771 RExC_seen |= REG_SEEN_GPOS;
2773 nextchar(pRExC_state);
2774 Set_Node_Length(ret, 2); /* MJD */
2777 ret = reg_node(pRExC_state, SEOL);
2779 nextchar(pRExC_state);
2782 ret = reg_node(pRExC_state, EOS);
2784 RExC_seen_zerolen++; /* Do not optimize RE away */
2785 nextchar(pRExC_state);
2786 Set_Node_Length(ret, 2); /* MJD */
2789 ret = reg_node(pRExC_state, SANY);
2790 RExC_seen |= REG_SEEN_SANY;
2791 *flagp |= HASWIDTH|SIMPLE;
2792 nextchar(pRExC_state);
2793 Set_Node_Length(ret, 2); /* MJD */
2796 ret = reg_node(pRExC_state, CLUMP);
2798 nextchar(pRExC_state);
2799 Set_Node_Length(ret, 2); /* MJD */
2802 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2803 *flagp |= HASWIDTH|SIMPLE;
2804 nextchar(pRExC_state);
2805 Set_Node_Length(ret, 2); /* MJD */
2808 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2809 *flagp |= HASWIDTH|SIMPLE;
2810 nextchar(pRExC_state);
2811 Set_Node_Length(ret, 2); /* MJD */
2814 RExC_seen_zerolen++;
2815 RExC_seen |= REG_SEEN_LOOKBEHIND;
2816 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2818 nextchar(pRExC_state);
2819 Set_Node_Length(ret, 2); /* MJD */
2822 RExC_seen_zerolen++;
2823 RExC_seen |= REG_SEEN_LOOKBEHIND;
2824 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2826 nextchar(pRExC_state);
2827 Set_Node_Length(ret, 2); /* MJD */
2830 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2831 *flagp |= HASWIDTH|SIMPLE;
2832 nextchar(pRExC_state);
2833 Set_Node_Length(ret, 2); /* MJD */
2836 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2837 *flagp |= HASWIDTH|SIMPLE;
2838 nextchar(pRExC_state);
2839 Set_Node_Length(ret, 2); /* MJD */
2842 ret = reg_node(pRExC_state, DIGIT);
2843 *flagp |= HASWIDTH|SIMPLE;
2844 nextchar(pRExC_state);
2845 Set_Node_Length(ret, 2); /* MJD */
2848 ret = reg_node(pRExC_state, NDIGIT);
2849 *flagp |= HASWIDTH|SIMPLE;
2850 nextchar(pRExC_state);
2851 Set_Node_Length(ret, 2); /* MJD */
2856 char* oldregxend = RExC_end;
2857 char* parse_start = RExC_parse;
2859 if (RExC_parse[1] == '{') {
2860 /* a lovely hack--pretend we saw [\pX] instead */
2861 RExC_end = strchr(RExC_parse, '}');
2864 RExC_end = oldregxend;
2865 vFAIL("Missing right brace on \\p{}");
2870 RExC_end = RExC_parse + 2;
2873 ret = regclass(pRExC_state);
2875 RExC_end = oldregxend;
2877 Set_Node_Cur_Length(ret); /* MJD */
2878 nextchar(pRExC_state);
2879 *flagp |= HASWIDTH|SIMPLE;
2892 case '1': case '2': case '3': case '4':
2893 case '5': case '6': case '7': case '8': case '9':
2895 I32 num = atoi(RExC_parse);
2897 if (num > 9 && num >= RExC_npar)
2900 char * parse_start = RExC_parse - 1; /* MJD */
2901 while (isDIGIT(*RExC_parse))
2904 if (!SIZE_ONLY && num > RExC_rx->nparens)
2905 vFAIL("Reference to nonexistent group");
2907 ret = reganode(pRExC_state, FOLD
2908 ? (LOC ? REFFL : REFF)
2912 /* override incorrect value set in reganode MJD */
2913 Set_Node_Offset(ret, parse_start+1);
2914 Set_Node_Cur_Length(ret); /* MJD */
2916 nextchar(pRExC_state);
2921 if (RExC_parse >= RExC_end)
2922 FAIL("Trailing \\");
2925 /* Do not generate `unrecognized' warnings here, we fall
2926 back into the quick-grab loop below */
2932 if (RExC_flags16 & PMf_EXTENDED) {
2933 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2934 if (RExC_parse < RExC_end)
2940 register STRLEN len;
2945 char *parse_start = RExC_parse - 1;
2950 ret = reg_node(pRExC_state, FOLD
2951 ? (LOC ? EXACTFL : EXACTF)
2954 for (len = 0, p = RExC_parse - 1;
2955 len < 127 && p < RExC_end;
2960 if (RExC_flags16 & PMf_EXTENDED)
2961 p = regwhite(p, RExC_end);
3006 ender = ASCII_TO_NATIVE('\033');
3010 ender = ASCII_TO_NATIVE('\007');
3015 char* e = strchr(p, '}');
3019 vFAIL("Missing right brace on \\x{}");
3022 numlen = 1; /* allow underscores */
3023 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
3026 /* numlen is generous */
3027 if (numlen + len >= 127) {
3035 numlen = 0; /* disallow underscores */
3036 ender = (UV)scan_hex(p, 2, &numlen);
3042 ender = UCHARAT(p++);
3043 ender = toCTRL(ender);
3045 case '0': case '1': case '2': case '3':case '4':
3046 case '5': case '6': case '7': case '8':case '9':
3048 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
3049 numlen = 0; /* disallow underscores */
3050 ender = (UV)scan_oct(p, 3, &numlen);
3060 FAIL("Trailing \\");
3063 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
3064 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
3065 goto normal_default;
3070 if (UTF8_IS_START(*p) && UTF) {
3071 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3079 if (RExC_flags16 & PMf_EXTENDED)
3080 p = regwhite(p, RExC_end);
3083 ender = toLOWER_LC_uvchr(ender);
3085 ender = toLOWER_uni(ender);
3087 if (ISMULT2(p)) { /* Back off on ?+*. */
3090 else if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3091 reguni(pRExC_state, ender, s, &numlen);
3101 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3102 reguni(pRExC_state, ender, s, &numlen);
3111 Set_Node_Cur_Length(ret); /* MJD */
3112 nextchar(pRExC_state);
3114 /* len is STRLEN which is unsigned, need to copy to signed */
3117 vFAIL("Internal disaster");
3126 RExC_size += STR_SZ(len);
3128 RExC_emit += STR_SZ(len);
3137 S_regwhite(pTHX_ char *p, char *e)
3142 else if (*p == '#') {
3145 } while (p < e && *p != '\n');
3153 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3154 Character classes ([:foo:]) can also be negated ([:^foo:]).
3155 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3156 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3157 but trigger warnings because they are currently unimplemented. */
3159 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3162 I32 namedclass = OOB_NAMEDCLASS;
3164 if (value == '[' && RExC_parse + 1 < RExC_end &&
3165 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3166 (*RExC_parse == ':' ||
3167 *RExC_parse == '=' ||
3168 *RExC_parse == '.')) {
3169 char c = *RExC_parse;
3170 char* s = RExC_parse++;
3172 while (RExC_parse < RExC_end && *RExC_parse != c)
3174 if (RExC_parse == RExC_end)
3175 /* Grandfather lone [:, [=, [. */
3178 char* t = RExC_parse++; /* skip over the c */
3180 if (*RExC_parse == ']') {
3181 RExC_parse++; /* skip over the ending ] */
3184 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3185 I32 skip = 5; /* the most common skip */
3189 if (strnEQ(posixcc, "alnum", 5))
3191 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3192 else if (strnEQ(posixcc, "alpha", 5))
3194 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3195 else if (strnEQ(posixcc, "ascii", 5))
3197 complement ? ANYOF_NASCII : ANYOF_ASCII;
3200 if (strnEQ(posixcc, "blank", 5))
3202 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3205 if (strnEQ(posixcc, "cntrl", 5))
3207 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3210 if (strnEQ(posixcc, "digit", 5))
3212 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3215 if (strnEQ(posixcc, "graph", 5))
3217 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3220 if (strnEQ(posixcc, "lower", 5))
3222 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3225 if (strnEQ(posixcc, "print", 5))
3227 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3228 else if (strnEQ(posixcc, "punct", 5))
3230 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3233 if (strnEQ(posixcc, "space", 5))
3235 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3238 if (strnEQ(posixcc, "upper", 5))
3240 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3242 case 'w': /* this is not POSIX, this is the Perl \w */
3243 if (strnEQ(posixcc, "word", 4)) {
3245 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3250 if (strnEQ(posixcc, "xdigit", 6)) {
3252 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3257 if (namedclass == OOB_NAMEDCLASS ||
3258 posixcc[skip] != ':' ||
3259 posixcc[skip+1] != ']')
3261 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3264 } else if (!SIZE_ONLY) {
3265 /* [[=foo=]] and [[.foo.]] are still future. */
3267 /* adjust RExC_parse so the warning shows after
3269 while (*RExC_parse && *RExC_parse != ']')
3271 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3274 /* Maternal grandfather:
3275 * "[:" ending in ":" but not in ":]" */
3285 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3287 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3288 (*RExC_parse == ':' ||
3289 *RExC_parse == '=' ||
3290 *RExC_parse == '.')) {
3291 char *s = RExC_parse;
3294 while(*s && isALNUM(*s))
3296 if (*s && c == *s && s[1] == ']') {
3297 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3299 /* [[=foo=]] and [[.foo.]] are still future. */
3300 if (c == '=' || c == '.')
3302 /* adjust RExC_parse so the error shows after
3304 while (*RExC_parse && *RExC_parse++ != ']')
3306 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3313 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3316 register IV prevvalue = OOB_UNICODE;
3317 register IV range = 0;
3318 register regnode *ret;
3321 char *rangebegin = 0;
3322 bool need_class = 0;
3323 SV *listsv = Nullsv;
3326 bool optimize_invert = TRUE;
3328 ret = reganode(pRExC_state, ANYOF, 0);
3331 ANYOF_FLAGS(ret) = 0;
3333 if (*RExC_parse == '^') { /* Complement of range. */
3337 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3341 RExC_size += ANYOF_SKIP;
3343 RExC_emit += ANYOF_SKIP;
3345 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3347 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3348 ANYOF_BITMAP_ZERO(ret);
3349 listsv = newSVpvn("# comment\n", 10);
3352 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3353 checkposixcc(pRExC_state);
3355 if (*RExC_parse == ']' || *RExC_parse == '-')
3356 goto charclassloop; /* allow 1st char to be ] or - */
3358 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3362 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3365 rangebegin = RExC_parse;
3367 value = utf8n_to_uvchr((U8*)RExC_parse,
3368 RExC_end - RExC_parse,
3370 RExC_parse += numlen;
3373 value = UCHARAT(RExC_parse++);
3375 namedclass = regpposixcc(pRExC_state, value);
3376 else if (value == '\\') {
3378 value = utf8n_to_uvchr((U8*)RExC_parse,
3379 RExC_end - RExC_parse,
3381 RExC_parse += numlen;
3384 value = UCHARAT(RExC_parse++);
3385 /* Some compilers cannot handle switching on 64-bit integer
3386 * values, therefore value cannot be an UV. Yes, this will
3387 * be a problem later if we want switch on Unicode.
3388 * A similar issue a little bit later when switching on
3389 * namedclass. --jhi */
3390 switch ((I32)value) {
3391 case 'w': namedclass = ANYOF_ALNUM; break;
3392 case 'W': namedclass = ANYOF_NALNUM; break;
3393 case 's': namedclass = ANYOF_SPACE; break;
3394 case 'S': namedclass = ANYOF_NSPACE; break;
3395 case 'd': namedclass = ANYOF_DIGIT; break;
3396 case 'D': namedclass = ANYOF_NDIGIT; break;
3399 if (*RExC_parse == '{') {
3400 e = strchr(RExC_parse++, '}');
3402 vFAIL("Missing right brace on \\p{}");
3411 Perl_sv_catpvf(aTHX_ listsv,
3412 "+utf8::%.*s\n", (int)n, RExC_parse);
3414 Perl_sv_catpvf(aTHX_ listsv,
3415 "!utf8::%.*s\n", (int)n, RExC_parse);
3418 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3420 case 'n': value = '\n'; break;
3421 case 'r': value = '\r'; break;
3422 case 't': value = '\t'; break;
3423 case 'f': value = '\f'; break;
3424 case 'b': value = '\b'; break;
3425 case 'e': value = ASCII_TO_NATIVE('\033');break;
3426 case 'a': value = ASCII_TO_NATIVE('\007');break;
3428 if (*RExC_parse == '{') {
3429 e = strchr(RExC_parse++, '}');
3431 vFAIL("Missing right brace on \\x{}");
3432 numlen = 1; /* allow underscores */
3433 value = (UV)scan_hex(RExC_parse,
3439 numlen = 0; /* disallow underscores */
3440 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3441 RExC_parse += numlen;
3445 value = UCHARAT(RExC_parse++);
3446 value = toCTRL(value);
3448 case '0': case '1': case '2': case '3': case '4':
3449 case '5': case '6': case '7': case '8': case '9':
3450 numlen = 0; /* disallow underscores */
3451 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3452 RExC_parse += numlen;
3455 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3457 "Unrecognized escape \\%c in character class passed through",
3461 } /* end of \blah */
3463 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3465 if (!SIZE_ONLY && !need_class)
3466 ANYOF_CLASS_ZERO(ret);
3470 /* a bad range like a-\d, a-[:digit:] ? */
3473 if (ckWARN(WARN_REGEXP))
3475 "False [] range \"%*.*s\"",
3476 RExC_parse - rangebegin,
3477 RExC_parse - rangebegin,
3479 if (prevvalue < 256) {
3480 ANYOF_BITMAP_SET(ret, prevvalue);
3481 ANYOF_BITMAP_SET(ret, '-');
3484 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3485 Perl_sv_catpvf(aTHX_ listsv,
3486 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
3490 range = 0; /* this was not a true range */
3494 if (namedclass > OOB_NAMEDCLASS)
3495 optimize_invert = FALSE;
3496 /* Possible truncation here but in some 64-bit environments
3497 * the compiler gets heartburn about switch on 64-bit values.
3498 * A similar issue a little earlier when switching on value.
3500 switch ((I32)namedclass) {
3503 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3505 for (value = 0; value < 256; value++)
3507 ANYOF_BITMAP_SET(ret, value);
3509 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3513 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3515 for (value = 0; value < 256; value++)
3516 if (!isALNUM(value))
3517 ANYOF_BITMAP_SET(ret, value);
3519 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3523 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3525 for (value = 0; value < 256; value++)
3526 if (isALNUMC(value))
3527 ANYOF_BITMAP_SET(ret, value);
3529 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3533 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3535 for (value = 0; value < 256; value++)
3536 if (!isALNUMC(value))
3537 ANYOF_BITMAP_SET(ret, value);
3539 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3543 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3545 for (value = 0; value < 256; value++)
3547 ANYOF_BITMAP_SET(ret, value);
3549 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3553 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3555 for (value = 0; value < 256; value++)
3556 if (!isALPHA(value))
3557 ANYOF_BITMAP_SET(ret, value);
3559 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3563 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3566 for (value = 0; value < 128; value++)
3567 ANYOF_BITMAP_SET(ret, value);
3569 for (value = 0; value < 256; value++) {
3571 ANYOF_BITMAP_SET(ret, value);
3575 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3579 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3582 for (value = 128; value < 256; value++)
3583 ANYOF_BITMAP_SET(ret, value);
3585 for (value = 0; value < 256; value++) {
3586 if (!isASCII(value))
3587 ANYOF_BITMAP_SET(ret, value);
3591 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3595 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3597 for (value = 0; value < 256; value++)
3599 ANYOF_BITMAP_SET(ret, value);
3601 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3605 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3607 for (value = 0; value < 256; value++)
3608 if (!isBLANK(value))
3609 ANYOF_BITMAP_SET(ret, value);
3611 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3615 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3617 for (value = 0; value < 256; value++)
3619 ANYOF_BITMAP_SET(ret, value);
3621 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3625 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3627 for (value = 0; value < 256; value++)
3628 if (!isCNTRL(value))
3629 ANYOF_BITMAP_SET(ret, value);
3631 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3635 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3637 /* consecutive digits assumed */
3638 for (value = '0'; value <= '9'; value++)
3639 ANYOF_BITMAP_SET(ret, value);
3641 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3645 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3647 /* consecutive digits assumed */
3648 for (value = 0; value < '0'; value++)
3649 ANYOF_BITMAP_SET(ret, value);
3650 for (value = '9' + 1; value < 256; value++)
3651 ANYOF_BITMAP_SET(ret, value);
3653 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3657 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3659 for (value = 0; value < 256; value++)
3661 ANYOF_BITMAP_SET(ret, value);
3663 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3667 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3669 for (value = 0; value < 256; value++)
3670 if (!isGRAPH(value))
3671 ANYOF_BITMAP_SET(ret, value);
3673 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3677 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3679 for (value = 0; value < 256; value++)
3681 ANYOF_BITMAP_SET(ret, value);
3683 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3687 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3689 for (value = 0; value < 256; value++)
3690 if (!isLOWER(value))
3691 ANYOF_BITMAP_SET(ret, value);
3693 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3697 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3699 for (value = 0; value < 256; value++)
3701 ANYOF_BITMAP_SET(ret, value);
3703 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3707 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3709 for (value = 0; value < 256; value++)
3710 if (!isPRINT(value))
3711 ANYOF_BITMAP_SET(ret, value);
3713 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3717 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3719 for (value = 0; value < 256; value++)
3720 if (isPSXSPC(value))
3721 ANYOF_BITMAP_SET(ret, value);
3723 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3727 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3729 for (value = 0; value < 256; value++)
3730 if (!isPSXSPC(value))
3731 ANYOF_BITMAP_SET(ret, value);
3733 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3737 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3739 for (value = 0; value < 256; value++)
3741 ANYOF_BITMAP_SET(ret, value);
3743 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3747 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3749 for (value = 0; value < 256; value++)
3750 if (!isPUNCT(value))
3751 ANYOF_BITMAP_SET(ret, value);
3753 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3757 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3759 for (value = 0; value < 256; value++)
3761 ANYOF_BITMAP_SET(ret, value);
3763 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3767 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3769 for (value = 0; value < 256; value++)
3770 if (!isSPACE(value))
3771 ANYOF_BITMAP_SET(ret, value);
3773 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3777 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3779 for (value = 0; value < 256; value++)
3781 ANYOF_BITMAP_SET(ret, value);
3783 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3787 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3789 for (value = 0; value < 256; value++)
3790 if (!isUPPER(value))
3791 ANYOF_BITMAP_SET(ret, value);
3793 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3797 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3799 for (value = 0; value < 256; value++)
3800 if (isXDIGIT(value))
3801 ANYOF_BITMAP_SET(ret, value);
3803 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3807 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3809 for (value = 0; value < 256; value++)
3810 if (!isXDIGIT(value))
3811 ANYOF_BITMAP_SET(ret, value);
3813 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3816 vFAIL("Invalid [::] class");
3820 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3823 } /* end of namedclass \blah */
3826 if (prevvalue > value) /* b-a */ {
3827 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3828 RExC_parse - rangebegin,
3829 RExC_parse - rangebegin,
3831 range = 0; /* not a valid range */
3835 prevvalue = value; /* save the beginning of the range */
3836 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3837 RExC_parse[1] != ']') {
3840 /* a bad range like \w-, [:word:]- ? */
3841 if (namedclass > OOB_NAMEDCLASS) {
3842 if (ckWARN(WARN_REGEXP))
3844 "False [] range \"%*.*s\"",
3845 RExC_parse - rangebegin,
3846 RExC_parse - rangebegin,
3849 ANYOF_BITMAP_SET(ret, '-');
3851 range = 1; /* yeah, it's a range! */
3852 continue; /* but do it the next time */
3856 /* now is the next time */
3860 if (prevvalue < 256) {
3861 IV ceilvalue = value < 256 ? value : 255;
3864 if ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
3865 (isUPPER(prevvalue) && isUPPER(ceilvalue)))
3867 if (isLOWER(prevvalue)) {
3868 for (i = prevvalue; i <= ceilvalue; i++)
3870 ANYOF_BITMAP_SET(ret, i);
3872 for (i = prevvalue; i <= ceilvalue; i++)
3874 ANYOF_BITMAP_SET(ret, i);
3879 for (i = prevvalue; i <= ceilvalue; i++)
3880 ANYOF_BITMAP_SET(ret, i);
3883 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3884 if (prevvalue < value)
3885 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3886 (UV)prevvalue, (UV)value);
3887 else if (prevvalue == value)
3888 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3893 range = 0; /* this range (if it was one) is done now */
3897 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
3899 RExC_size += ANYOF_CLASS_ADD_SKIP;
3901 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3904 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3906 /* If the only flag is folding (plus possibly inversion). */
3907 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
3909 for (value = 0; value < 256; ++value) {
3910 if (ANYOF_BITMAP_TEST(ret, value)) {
3911 IV fold = PL_fold[value];
3914 ANYOF_BITMAP_SET(ret, fold);
3917 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3920 /* optimize inverted simple patterns (e.g. [^a-z]) */
3921 if (!SIZE_ONLY && optimize_invert &&
3922 /* If the only flag is inversion. */
3923 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3924 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3925 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3926 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
3933 av_store(av, 0, listsv);
3934 av_store(av, 1, NULL);
3935 rv = newRV_noinc((SV*)av);
3936 n = add_data(pRExC_state, 1, "s");
3937 RExC_rx->data->data[n] = (void*)rv;
3945 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3947 char* retval = RExC_parse++;
3950 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3951 RExC_parse[2] == '#') {
3952 while (*RExC_parse && *RExC_parse != ')')
3957 if (RExC_flags16 & PMf_EXTENDED) {
3958 if (isSPACE(*RExC_parse)) {
3962 else if (*RExC_parse == '#') {
3963 while (*RExC_parse && *RExC_parse != '\n')
3974 - reg_node - emit a node
3976 STATIC regnode * /* Location. */
3977 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3979 register regnode *ret;
3980 register regnode *ptr;
3984 SIZE_ALIGN(RExC_size);
3989 NODE_ALIGN_FILL(ret);
3991 FILL_ADVANCE_NODE(ptr, op);
3992 if (RExC_offsets) { /* MJD */
3993 MJD_OFFSET_DEBUG((stderr, "%s:%u: (op %s) %s %u <- %u (len %u) (max %u).\n",
3994 "reg_node", __LINE__,
3996 RExC_emit - RExC_emit_start > RExC_offsets[0]
3997 ? "Overwriting end of array!\n" : "OK",
3998 RExC_emit - RExC_emit_start,
3999 RExC_parse - RExC_start,
4001 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
4010 - reganode - emit a node with an argument
4012 STATIC regnode * /* Location. */
4013 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4015 register regnode *ret;
4016 register regnode *ptr;
4020 SIZE_ALIGN(RExC_size);
4025 NODE_ALIGN_FILL(ret);
4027 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
4028 if (RExC_offsets) { /* MJD */
4029 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4031 RExC_emit - RExC_emit_start > RExC_offsets[0] ?
4032 "Overwriting end of array!\n" : "OK",
4033 RExC_emit - RExC_emit_start,
4034 RExC_parse - RExC_start,
4036 Set_Cur_Node_Offset;
4045 - reguni - emit (if appropriate) a Unicode character
4048 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
4050 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4054 - reginsert - insert an operator in front of already-emitted operand
4056 * Means relocating the operand.
4059 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4061 register regnode *src;
4062 register regnode *dst;
4063 register regnode *place;
4064 register int offset = regarglen[(U8)op];
4066 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4069 RExC_size += NODE_STEP_REGNODE + offset;
4074 RExC_emit += NODE_STEP_REGNODE + offset;
4076 while (src > opnd) {
4077 StructCopy(--src, --dst, regnode);
4078 if (RExC_offsets) { /* MJD 20010112 */
4079 MJD_OFFSET_DEBUG((stderr, "%s: %s copy %u -> %u (max %u).\n",
4081 dst - RExC_emit_start > RExC_offsets[0]
4082 ? "Overwriting end of array!\n" : "OK",
4083 src - RExC_emit_start,
4084 dst - RExC_emit_start,
4086 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
4087 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
4092 place = opnd; /* Op node, where operand used to be. */
4093 if (RExC_offsets) { /* MJD */
4094 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4096 place - RExC_emit_start > RExC_offsets[0]
4097 ? "Overwriting end of array!\n" : "OK",
4098 place - RExC_emit_start,
4099 RExC_parse - RExC_start,
4101 Set_Node_Offset(place, RExC_parse);
4103 src = NEXTOPER(place);
4104 FILL_ADVANCE_NODE(place, op);
4105 Zero(src, offset, regnode);
4109 - regtail - set the next-pointer at the end of a node chain of p to val.
4112 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4114 register regnode *scan;
4115 register regnode *temp;
4120 /* Find last node. */
4123 temp = regnext(scan);
4129 if (reg_off_by_arg[OP(scan)]) {
4130 ARG_SET(scan, val - scan);
4133 NEXT_OFF(scan) = val - scan;
4138 - regoptail - regtail on operand of first argument; nop if operandless
4141 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4143 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4144 if (p == NULL || SIZE_ONLY)
4146 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4147 regtail(pRExC_state, NEXTOPER(p), val);
4149 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4150 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4157 - regcurly - a little FSA that accepts {\d+,?\d*}
4160 S_regcurly(pTHX_ register char *s)
4181 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4183 register U8 op = EXACT; /* Arbitrary non-END op. */
4184 register regnode *next;
4186 while (op != END && (!last || node < last)) {
4187 /* While that wasn't END last time... */
4193 next = regnext(node);
4195 if (OP(node) == OPTIMIZED)
4198 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4199 (int)(2*l + 1), "", SvPVX(sv));
4200 if (next == NULL) /* Next ptr. */
4201 PerlIO_printf(Perl_debug_log, "(0)");
4203 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4204 (void)PerlIO_putc(Perl_debug_log, '\n');
4206 if (PL_regkind[(U8)op] == BRANCHJ) {
4207 register regnode *nnode = (OP(next) == LONGJMP
4210 if (last && nnode > last)
4212 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4214 else if (PL_regkind[(U8)op] == BRANCH) {
4215 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4217 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4218 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4219 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4221 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4222 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4225 else if ( op == PLUS || op == STAR) {
4226 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4228 else if (op == ANYOF) {
4229 /* arglen 1 + class block */
4230 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
4231 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
4232 node = NEXTOPER(node);
4234 else if (PL_regkind[(U8)op] == EXACT) {
4235 /* Literal string, where present. */
4236 node += NODE_SZ_STR(node) - 1;
4237 node = NEXTOPER(node);
4240 node = NEXTOPER(node);
4241 node += regarglen[(U8)op];
4243 if (op == CURLYX || op == OPEN)
4245 else if (op == WHILEM)
4251 #endif /* DEBUGGING */
4254 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4257 Perl_regdump(pTHX_ regexp *r)
4260 SV *sv = sv_newmortal();
4262 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4264 /* Header fields of interest. */
4265 if (r->anchored_substr)
4266 PerlIO_printf(Perl_debug_log,
4267 "anchored `%s%.*s%s'%s at %"IVdf" ",
4269 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4270 SvPVX(r->anchored_substr),
4272 SvTAIL(r->anchored_substr) ? "$" : "",
4273 (IV)r->anchored_offset);
4274 if (r->float_substr)
4275 PerlIO_printf(Perl_debug_log,
4276 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4278 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4279 SvPVX(r->float_substr),
4281 SvTAIL(r->float_substr) ? "$" : "",
4282 (IV)r->float_min_offset, (UV)r->float_max_offset);
4283 if (r->check_substr)
4284 PerlIO_printf(Perl_debug_log,
4285 r->check_substr == r->float_substr
4286 ? "(checking floating" : "(checking anchored");
4287 if (r->reganch & ROPT_NOSCAN)
4288 PerlIO_printf(Perl_debug_log, " noscan");
4289 if (r->reganch & ROPT_CHECK_ALL)
4290 PerlIO_printf(Perl_debug_log, " isall");
4291 if (r->check_substr)
4292 PerlIO_printf(Perl_debug_log, ") ");
4294 if (r->regstclass) {
4295 regprop(sv, r->regstclass);
4296 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4298 if (r->reganch & ROPT_ANCH) {
4299 PerlIO_printf(Perl_debug_log, "anchored");
4300 if (r->reganch & ROPT_ANCH_BOL)
4301 PerlIO_printf(Perl_debug_log, "(BOL)");
4302 if (r->reganch & ROPT_ANCH_MBOL)
4303 PerlIO_printf(Perl_debug_log, "(MBOL)");
4304 if (r->reganch & ROPT_ANCH_SBOL)
4305 PerlIO_printf(Perl_debug_log, "(SBOL)");
4306 if (r->reganch & ROPT_ANCH_GPOS)
4307 PerlIO_printf(Perl_debug_log, "(GPOS)");
4308 PerlIO_putc(Perl_debug_log, ' ');
4310 if (r->reganch & ROPT_GPOS_SEEN)
4311 PerlIO_printf(Perl_debug_log, "GPOS ");
4312 if (r->reganch & ROPT_SKIP)
4313 PerlIO_printf(Perl_debug_log, "plus ");
4314 if (r->reganch & ROPT_IMPLICIT)
4315 PerlIO_printf(Perl_debug_log, "implicit ");
4316 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4317 if (r->reganch & ROPT_EVAL_SEEN)
4318 PerlIO_printf(Perl_debug_log, "with eval ");
4319 PerlIO_printf(Perl_debug_log, "\n");
4322 U32 len = r->offsets[0];
4323 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4324 for (i = 1; i <= len; i++)
4325 PerlIO_printf(Perl_debug_log, "%"UVuf"[%"UVuf"] ",
4326 (UV)r->offsets[i*2-1],
4327 (UV)r->offsets[i*2]);
4328 PerlIO_printf(Perl_debug_log, "\n");
4330 #endif /* DEBUGGING */
4336 S_put_byte(pTHX_ SV *sv, int c)
4338 if (isCNTRL(c) || c == 127 || c == 255 || !isPRINT(c))
4339 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4340 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4341 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4343 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4346 #endif /* DEBUGGING */
4349 - regprop - printable representation of opcode
4352 Perl_regprop(pTHX_ SV *sv, regnode *o)
4357 sv_setpvn(sv, "", 0);
4358 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4359 /* It would be nice to FAIL() here, but this may be called from
4360 regexec.c, and it would be hard to supply pRExC_state. */
4361 Perl_croak(aTHX_ "Corrupted regexp opcode");
4362 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4364 k = PL_regkind[(U8)OP(o)];
4367 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4368 STR_LEN(o), STRING(o), PL_colors[1]);
4369 else if (k == CURLY) {
4370 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4371 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4372 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4374 else if (k == WHILEM && o->flags) /* Ordinal/of */
4375 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4376 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4377 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4378 else if (k == LOGICAL)
4379 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4380 else if (k == ANYOF) {
4381 int i, rangestart = -1;
4382 U8 flags = ANYOF_FLAGS(o);
4383 const char * const anyofs[] = { /* Should be syncronized with
4384 * ANYOF_ #xdefines in regcomp.h */
4417 if (flags & ANYOF_LOCALE)
4418 sv_catpv(sv, "{loc}");
4419 if (flags & ANYOF_FOLD)
4420 sv_catpv(sv, "{i}");
4421 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4422 if (flags & ANYOF_INVERT)
4424 for (i = 0; i <= 256; i++) {
4425 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4426 if (rangestart == -1)
4428 } else if (rangestart != -1) {
4429 if (i <= rangestart + 3)
4430 for (; rangestart < i; rangestart++)
4431 put_byte(sv, rangestart);
4433 put_byte(sv, rangestart);
4435 put_byte(sv, i - 1);
4441 if (o->flags & ANYOF_CLASS)
4442 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4443 if (ANYOF_CLASS_TEST(o,i))
4444 sv_catpv(sv, anyofs[i]);
4446 if (flags & ANYOF_UNICODE)
4447 sv_catpv(sv, "{unicode}");
4448 else if (flags & ANYOF_UNICODE_ALL)
4449 sv_catpv(sv, "{all-unicode}");
4453 SV *sw = regclass_swash(o, FALSE, &lv);
4458 U8 s[UTF8_MAXLEN+1];
4460 for (i = 0; i <= 256; i++) { /* just the first 256 */
4461 U8 *e = uvchr_to_utf8(s, i);
4463 if (i < 256 && swash_fetch(sw, s, TRUE)) {
4464 if (rangestart == -1)
4466 } else if (rangestart != -1) {
4469 if (i <= rangestart + 3)
4470 for (; rangestart < i; rangestart++) {
4471 for(e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4475 for (e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4478 for (e = uvchr_to_utf8(s, i - 1), p = s; p < e; p++)
4485 sv_catpv(sv, "..."); /* et cetera */
4489 char *s = savepv(SvPVX(lv));
4492 while(*s && *s != '\n') s++;
4513 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4515 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4516 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4517 #endif /* DEBUGGING */
4521 Perl_re_intuit_string(pTHX_ regexp *prog)
4522 { /* Assume that RE_INTUIT is set */
4525 char *s = SvPV(prog->check_substr,n_a);
4527 if (!PL_colorset) reginitcolors();
4528 PerlIO_printf(Perl_debug_log,
4529 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4530 PL_colors[4],PL_colors[5],PL_colors[0],
4533 (strlen(s) > 60 ? "..." : ""));
4536 return prog->check_substr;
4540 Perl_pregfree(pTHX_ struct regexp *r)
4542 DEBUG_r(if (!PL_colorset) reginitcolors());
4544 if (!r || (--r->refcnt > 0))
4546 DEBUG_r(PerlIO_printf(Perl_debug_log,
4547 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4548 PL_colors[4],PL_colors[5],PL_colors[0],
4551 (strlen(r->precomp) > 60 ? "..." : "")));
4554 Safefree(r->precomp);
4555 if (r->offsets) /* 20010421 MJD */
4556 Safefree(r->offsets);
4557 if (RX_MATCH_COPIED(r))
4558 Safefree(r->subbeg);
4560 if (r->anchored_substr)
4561 SvREFCNT_dec(r->anchored_substr);
4562 if (r->float_substr)
4563 SvREFCNT_dec(r->float_substr);
4564 Safefree(r->substrs);
4567 int n = r->data->count;
4568 AV* new_comppad = NULL;
4573 switch (r->data->what[n]) {
4575 SvREFCNT_dec((SV*)r->data->data[n]);
4578 Safefree(r->data->data[n]);
4581 new_comppad = (AV*)r->data->data[n];
4584 if (new_comppad == NULL)
4585 Perl_croak(aTHX_ "panic: pregfree comppad");
4586 old_comppad = PL_comppad;
4587 old_curpad = PL_curpad;
4588 /* Watch out for global destruction's random ordering. */
4589 if (SvTYPE(new_comppad) == SVt_PVAV) {
4590 PL_comppad = new_comppad;
4591 PL_curpad = AvARRAY(new_comppad);
4595 op_free((OP_4tree*)r->data->data[n]);
4596 PL_comppad = old_comppad;
4597 PL_curpad = old_curpad;
4598 SvREFCNT_dec((SV*)new_comppad);
4604 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4607 Safefree(r->data->what);
4610 Safefree(r->startp);
4616 - regnext - dig the "next" pointer out of a node
4618 * [Note, when REGALIGN is defined there are two places in regmatch()
4619 * that bypass this code for speed.]
4622 Perl_regnext(pTHX_ register regnode *p)
4624 register I32 offset;
4626 if (p == &PL_regdummy)
4629 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4637 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4640 STRLEN l1 = strlen(pat1);
4641 STRLEN l2 = strlen(pat2);
4650 Copy(pat1, buf, l1 , char);
4651 Copy(pat2, buf + l1, l2 , char);
4652 buf[l1 + l2] = '\n';
4653 buf[l1 + l2 + 1] = '\0';
4655 /* ANSI variant takes additional second argument */
4656 va_start(args, pat2);
4660 msv = vmess(buf, &args);
4662 message = SvPV(msv,l1);
4665 Copy(message, buf, l1 , char);
4666 buf[l1] = '\0'; /* Overwrite \n */
4667 Perl_croak(aTHX_ "%s", buf);
4670 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4673 Perl_save_re_context(pTHX)
4676 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4677 SAVEI32(RExC_npar); /* () count. */
4678 SAVEI32(RExC_size); /* Code size. */
4679 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4680 SAVEVPTR(RExC_rx); /* from regcomp.c */
4681 SAVEI32(RExC_seen); /* from regcomp.c */
4682 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4683 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4684 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4685 SAVEPPTR(RExC_end); /* End of input for compile */
4686 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4689 SAVEI32(PL_reg_flags); /* from regexec.c */
4691 SAVEPPTR(PL_reginput); /* String-input pointer. */
4692 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4693 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4694 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4695 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4696 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4697 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4698 SAVEGENERICPV(PL_reg_start_tmp); /* from regexec.c */
4699 PL_reg_start_tmp = 0;
4700 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4701 PL_reg_start_tmpl = 0;
4702 SAVEVPTR(PL_regdata);
4703 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4704 SAVEI32(PL_regnarrate); /* from regexec.c */
4705 SAVEVPTR(PL_regprogram); /* from regexec.c */
4706 SAVEINT(PL_regindent); /* from regexec.c */
4707 SAVEVPTR(PL_regcc); /* from regexec.c */
4708 SAVEVPTR(PL_curcop);
4709 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4710 SAVEVPTR(PL_reg_re); /* from regexec.c */
4711 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4712 SAVESPTR(PL_reg_sv); /* from regexec.c */
4713 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4714 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4715 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4716 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4717 SAVEI32(PL_regnpar); /* () count. */
4718 SAVEI32(PL_regsize); /* from regexec.c */
4720 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4731 clear_re(pTHXo_ void *r)
4733 ReREFCNT_dec((regexp *)r);