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); \
396 #define vWARNdep(loc,m) \
398 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
399 int warn_cat = ckWARN(WARN_REGEXP) ? WARN_REGEXP : WARN_DEPRECATED; \
400 Perl_warner(aTHX_ warn_cat, "%s" REPORT_LOCATION,\
401 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
405 #define vWARN2(loc, m, a1) \
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 vWARN3(loc, m, a1, a2) \
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 #define vWARN4(loc, m, a1, a2, a3) \
423 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
424 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
426 (int)offset, RExC_precomp, RExC_precomp + offset); \
429 /* used for the parse_flags section for (?c) -- japhy */
430 #define vWARN5(loc, m, a1, a2, a3, a4) \
432 unsigned offset = strlen(RExC_precomp)-(RExC_end-(loc)); \
433 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
435 (int)offset, RExC_precomp, RExC_precomp + offset); \
439 /* Allow for side effects in s */
440 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (void)(s);} STMT_END
442 /* Macros for recording node offsets. 20001227 mjd@plover.com
443 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
444 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
445 * Element 0 holds the number n.
448 #define MJD_OFFSET_DEBUG(x)
449 /* #define MJD_OFFSET_DEBUG(x) fprintf x */
452 # define Set_Node_Offset_To_R(node,byte) \
456 Perl_croak(aTHX_ "value of node is %d in Offset macro", node); \
458 RExC_offsets[2*(node)-1] = (byte); \
463 # define Set_Node_Offset(node,byte) Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
464 # define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
466 # define Set_Node_Length_To_R(node,len) \
469 MJD_OFFSET_DEBUG((stderr, "** (%d) size of node %d is %d.\n", __LINE__, (node), (len))); \
471 Perl_croak(aTHX_ "value of node is %d in Length macro", node); \
473 RExC_offsets[2*(node)] = (len); \
478 # define Set_Node_Length(node,len) Set_Node_Length_To_R((node)-RExC_emit_start, len)
479 # define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
480 # define Set_Node_Cur_Length(node) Set_Node_Length(node, RExC_parse - parse_start)
482 /* Get offsets and lengths */
483 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
484 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
486 static void clear_re(pTHXo_ void *r);
488 /* Mark that we cannot extend a found fixed substring at this point.
489 Updata the longest found anchored substring and the longest found
490 floating substrings if needed. */
493 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
495 STRLEN l = CHR_SVLEN(data->last_found);
496 STRLEN old_l = CHR_SVLEN(*data->longest);
498 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
499 sv_setsv(*data->longest, data->last_found);
500 if (*data->longest == data->longest_fixed) {
501 data->offset_fixed = l ? data->last_start_min : data->pos_min;
502 if (data->flags & SF_BEFORE_EOL)
504 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
506 data->flags &= ~SF_FIX_BEFORE_EOL;
509 data->offset_float_min = l ? data->last_start_min : data->pos_min;
510 data->offset_float_max = (l
511 ? data->last_start_max
512 : data->pos_min + data->pos_delta);
513 if (data->flags & SF_BEFORE_EOL)
515 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
517 data->flags &= ~SF_FL_BEFORE_EOL;
520 SvCUR_set(data->last_found, 0);
522 data->flags &= ~SF_BEFORE_EOL;
525 /* Can match anything (initialization) */
527 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
531 ANYOF_CLASS_ZERO(cl);
532 for (value = 0; value < 256; ++value)
533 ANYOF_BITMAP_SET(cl, value);
534 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
536 cl->flags |= ANYOF_LOCALE;
539 /* Can match anything (initialization) */
541 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
545 for (value = 0; value <= ANYOF_MAX; value += 2)
546 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
548 if (!(cl->flags & ANYOF_UNICODE_ALL))
550 for (value = 0; value < 256; ++value)
551 if (!ANYOF_BITMAP_TEST(cl, value))
556 /* Can match anything (initialization) */
558 S_cl_init(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);
566 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
568 Zero(cl, 1, struct regnode_charclass_class);
570 cl_anything(pRExC_state, cl);
572 cl->flags |= ANYOF_LOCALE;
575 /* 'And' a given class with another one. Can create false positives */
576 /* We assume that cl is not inverted */
578 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
579 struct regnode_charclass_class *and_with)
581 if (!(and_with->flags & ANYOF_CLASS)
582 && !(cl->flags & ANYOF_CLASS)
583 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
584 && !(and_with->flags & ANYOF_FOLD)
585 && !(cl->flags & ANYOF_FOLD)) {
588 if (and_with->flags & ANYOF_INVERT)
589 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
590 cl->bitmap[i] &= ~and_with->bitmap[i];
592 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
593 cl->bitmap[i] &= and_with->bitmap[i];
594 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
595 if (!(and_with->flags & ANYOF_EOS))
596 cl->flags &= ~ANYOF_EOS;
598 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE) {
599 cl->flags &= ~ANYOF_UNICODE_ALL;
600 cl->flags |= ANYOF_UNICODE;
601 ARG_SET(cl, ARG(and_with));
603 if (!(and_with->flags & ANYOF_UNICODE_ALL))
604 cl->flags &= ~ANYOF_UNICODE_ALL;
605 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)))
606 cl->flags &= ~ANYOF_UNICODE;
609 /* 'OR' a given class with another one. Can create false positives */
610 /* We assume that cl is not inverted */
612 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
614 if (or_with->flags & ANYOF_INVERT) {
616 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
617 * <= (B1 | !B2) | (CL1 | !CL2)
618 * which is wasteful if CL2 is small, but we ignore CL2:
619 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
620 * XXXX Can we handle case-fold? Unclear:
621 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
622 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
624 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
625 && !(or_with->flags & ANYOF_FOLD)
626 && !(cl->flags & ANYOF_FOLD) ) {
629 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
630 cl->bitmap[i] |= ~or_with->bitmap[i];
631 } /* XXXX: logic is complicated otherwise */
633 cl_anything(pRExC_state, cl);
636 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
637 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
638 && (!(or_with->flags & ANYOF_FOLD)
639 || (cl->flags & ANYOF_FOLD)) ) {
642 /* OR char bitmap and class bitmap separately */
643 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
644 cl->bitmap[i] |= or_with->bitmap[i];
645 if (or_with->flags & ANYOF_CLASS) {
646 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
647 cl->classflags[i] |= or_with->classflags[i];
648 cl->flags |= ANYOF_CLASS;
651 else { /* XXXX: logic is complicated, leave it along for a moment. */
652 cl_anything(pRExC_state, cl);
655 if (or_with->flags & ANYOF_EOS)
656 cl->flags |= ANYOF_EOS;
658 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
659 ARG(cl) != ARG(or_with)) {
660 cl->flags |= ANYOF_UNICODE_ALL;
661 cl->flags &= ~ANYOF_UNICODE;
663 if (or_with->flags & ANYOF_UNICODE_ALL) {
664 cl->flags |= ANYOF_UNICODE_ALL;
665 cl->flags &= ~ANYOF_UNICODE;
669 /* REx optimizer. Converts nodes into quickier variants "in place".
670 Finds fixed substrings. */
672 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
673 to the position after last scanned or to NULL. */
676 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
677 /* scanp: Start here (read-write). */
678 /* deltap: Write maxlen-minlen here. */
679 /* last: Stop before this one. */
681 I32 min = 0, pars = 0, code;
682 regnode *scan = *scanp, *next;
684 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
685 int is_inf_internal = 0; /* The studied chunk is infinite */
686 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
687 scan_data_t data_fake;
688 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
690 while (scan && OP(scan) != END && scan < last) {
691 /* Peephole optimizer: */
693 if (PL_regkind[(U8)OP(scan)] == EXACT) {
694 /* Merge several consecutive EXACTish nodes into one. */
695 regnode *n = regnext(scan);
698 regnode *stop = scan;
701 next = scan + NODE_SZ_STR(scan);
702 /* Skip NOTHING, merge EXACT*. */
704 ( PL_regkind[(U8)OP(n)] == NOTHING ||
705 (stringok && (OP(n) == OP(scan))))
707 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
708 if (OP(n) == TAIL || n > next)
710 if (PL_regkind[(U8)OP(n)] == NOTHING) {
711 NEXT_OFF(scan) += NEXT_OFF(n);
712 next = n + NODE_STEP_REGNODE;
720 int oldl = STR_LEN(scan);
721 regnode *nnext = regnext(n);
723 if (oldl + STR_LEN(n) > U8_MAX)
725 NEXT_OFF(scan) += NEXT_OFF(n);
726 STR_LEN(scan) += STR_LEN(n);
727 next = n + NODE_SZ_STR(n);
728 /* Now we can overwrite *n : */
729 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
738 n = scan + NODE_SZ_STR(scan);
740 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
748 /* Follow the next-chain of the current node and optimize
749 away all the NOTHINGs from it. */
750 if (OP(scan) != CURLYX) {
751 int max = (reg_off_by_arg[OP(scan)]
753 /* I32 may be smaller than U16 on CRAYs! */
754 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
755 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
759 /* Skip NOTHING and LONGJMP. */
760 while ((n = regnext(n))
761 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
762 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
765 if (reg_off_by_arg[OP(scan)])
768 NEXT_OFF(scan) = off;
770 /* The principal pseudo-switch. Cannot be a switch, since we
771 look into several different things. */
772 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
773 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
774 next = regnext(scan);
777 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
778 I32 max1 = 0, min1 = I32_MAX, num = 0;
779 struct regnode_charclass_class accum;
781 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
782 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
783 if (flags & SCF_DO_STCLASS)
784 cl_init_zero(pRExC_state, &accum);
785 while (OP(scan) == code) {
786 I32 deltanext, minnext, f = 0, fake;
787 struct regnode_charclass_class this_class;
792 data_fake.whilem_c = data->whilem_c;
793 data_fake.last_closep = data->last_closep;
796 data_fake.last_closep = &fake;
797 next = regnext(scan);
798 scan = NEXTOPER(scan);
800 scan = NEXTOPER(scan);
801 if (flags & SCF_DO_STCLASS) {
802 cl_init(pRExC_state, &this_class);
803 data_fake.start_class = &this_class;
804 f = SCF_DO_STCLASS_AND;
806 if (flags & SCF_WHILEM_VISITED_POS)
807 f |= SCF_WHILEM_VISITED_POS;
808 /* we suppose the run is continuous, last=next...*/
809 minnext = study_chunk(pRExC_state, &scan, &deltanext,
810 next, &data_fake, f);
813 if (max1 < minnext + deltanext)
814 max1 = minnext + deltanext;
815 if (deltanext == I32_MAX)
816 is_inf = is_inf_internal = 1;
818 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
820 if (data && (data_fake.flags & SF_HAS_EVAL))
821 data->flags |= SF_HAS_EVAL;
823 data->whilem_c = data_fake.whilem_c;
824 if (flags & SCF_DO_STCLASS)
825 cl_or(pRExC_state, &accum, &this_class);
829 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
831 if (flags & SCF_DO_SUBSTR) {
832 data->pos_min += min1;
833 data->pos_delta += max1 - min1;
834 if (max1 != min1 || is_inf)
835 data->longest = &(data->longest_float);
838 delta += max1 - min1;
839 if (flags & SCF_DO_STCLASS_OR) {
840 cl_or(pRExC_state, data->start_class, &accum);
842 cl_and(data->start_class, &and_with);
843 flags &= ~SCF_DO_STCLASS;
846 else if (flags & SCF_DO_STCLASS_AND) {
848 cl_and(data->start_class, &accum);
849 flags &= ~SCF_DO_STCLASS;
852 /* Switch to OR mode: cache the old value of
853 * data->start_class */
854 StructCopy(data->start_class, &and_with,
855 struct regnode_charclass_class);
856 flags &= ~SCF_DO_STCLASS_AND;
857 StructCopy(&accum, data->start_class,
858 struct regnode_charclass_class);
859 flags |= SCF_DO_STCLASS_OR;
860 data->start_class->flags |= ANYOF_EOS;
864 else if (code == BRANCHJ) /* single branch is optimized. */
865 scan = NEXTOPER(NEXTOPER(scan));
866 else /* single branch is optimized. */
867 scan = NEXTOPER(scan);
870 else if (OP(scan) == EXACT) {
871 I32 l = STR_LEN(scan);
872 UV uc = *((U8*)STRING(scan));
874 U8 *s = (U8*)STRING(scan);
875 l = utf8_length(s, s + l);
876 uc = utf8_to_uvchr(s, NULL);
879 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
880 /* The code below prefers earlier match for fixed
881 offset, later match for variable offset. */
882 if (data->last_end == -1) { /* Update the start info. */
883 data->last_start_min = data->pos_min;
884 data->last_start_max = is_inf
885 ? I32_MAX : data->pos_min + data->pos_delta;
887 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
888 data->last_end = data->pos_min + l;
889 data->pos_min += l; /* As in the first entry. */
890 data->flags &= ~SF_BEFORE_EOL;
892 if (flags & SCF_DO_STCLASS_AND) {
893 /* Check whether it is compatible with what we know already! */
897 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
898 && !ANYOF_BITMAP_TEST(data->start_class, uc)
899 && (!(data->start_class->flags & ANYOF_FOLD)
900 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
903 ANYOF_CLASS_ZERO(data->start_class);
904 ANYOF_BITMAP_ZERO(data->start_class);
906 ANYOF_BITMAP_SET(data->start_class, uc);
907 data->start_class->flags &= ~ANYOF_EOS;
909 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
911 else if (flags & SCF_DO_STCLASS_OR) {
912 /* false positive possible if the class is case-folded */
914 ANYOF_BITMAP_SET(data->start_class, uc);
916 data->start_class->flags |= ANYOF_UNICODE_ALL;
917 data->start_class->flags &= ~ANYOF_EOS;
918 cl_and(data->start_class, &and_with);
920 flags &= ~SCF_DO_STCLASS;
922 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
923 I32 l = STR_LEN(scan);
924 UV uc = *((U8*)STRING(scan));
926 /* Search for fixed substrings supports EXACT only. */
927 if (flags & SCF_DO_SUBSTR)
928 scan_commit(pRExC_state, data);
930 U8 *s = (U8 *)STRING(scan);
931 l = utf8_length(s, s + l);
932 uc = utf8_to_uvchr(s, NULL);
935 if (data && (flags & SCF_DO_SUBSTR))
937 if (flags & SCF_DO_STCLASS_AND) {
938 /* Check whether it is compatible with what we know already! */
942 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
943 && !ANYOF_BITMAP_TEST(data->start_class, uc)
944 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
946 ANYOF_CLASS_ZERO(data->start_class);
947 ANYOF_BITMAP_ZERO(data->start_class);
949 ANYOF_BITMAP_SET(data->start_class, uc);
950 data->start_class->flags &= ~ANYOF_EOS;
951 data->start_class->flags |= ANYOF_FOLD;
952 if (OP(scan) == EXACTFL)
953 data->start_class->flags |= ANYOF_LOCALE;
956 else if (flags & SCF_DO_STCLASS_OR) {
957 if (data->start_class->flags & ANYOF_FOLD) {
958 /* false positive possible if the class is case-folded.
959 Assume that the locale settings are the same... */
961 ANYOF_BITMAP_SET(data->start_class, uc);
962 data->start_class->flags &= ~ANYOF_EOS;
964 cl_and(data->start_class, &and_with);
966 flags &= ~SCF_DO_STCLASS;
968 else if (strchr((char*)PL_varies,OP(scan))) {
969 I32 mincount, maxcount, minnext, deltanext, fl = 0;
970 I32 f = flags, pos_before = 0;
971 regnode *oscan = scan;
972 struct regnode_charclass_class this_class;
973 struct regnode_charclass_class *oclass = NULL;
975 switch (PL_regkind[(U8)OP(scan)]) {
976 case WHILEM: /* End of (?:...)* . */
977 scan = NEXTOPER(scan);
980 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
981 next = NEXTOPER(scan);
982 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
984 maxcount = REG_INFTY;
985 next = regnext(scan);
986 scan = NEXTOPER(scan);
990 if (flags & SCF_DO_SUBSTR)
995 if (flags & SCF_DO_STCLASS) {
997 maxcount = REG_INFTY;
998 next = regnext(scan);
999 scan = NEXTOPER(scan);
1002 is_inf = is_inf_internal = 1;
1003 scan = regnext(scan);
1004 if (flags & SCF_DO_SUBSTR) {
1005 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
1006 data->longest = &(data->longest_float);
1008 goto optimize_curly_tail;
1010 mincount = ARG1(scan);
1011 maxcount = ARG2(scan);
1012 next = regnext(scan);
1013 if (OP(scan) == CURLYX) {
1014 I32 lp = (data ? *(data->last_closep) : 0);
1016 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
1018 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
1020 if (flags & SCF_DO_SUBSTR) {
1021 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
1022 pos_before = data->pos_min;
1026 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
1028 data->flags |= SF_IS_INF;
1030 if (flags & SCF_DO_STCLASS) {
1031 cl_init(pRExC_state, &this_class);
1032 oclass = data->start_class;
1033 data->start_class = &this_class;
1034 f |= SCF_DO_STCLASS_AND;
1035 f &= ~SCF_DO_STCLASS_OR;
1037 /* These are the cases when once a subexpression
1038 fails at a particular position, it cannot succeed
1039 even after backtracking at the enclosing scope.
1041 XXXX what if minimal match and we are at the
1042 initial run of {n,m}? */
1043 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
1044 f &= ~SCF_WHILEM_VISITED_POS;
1046 /* This will finish on WHILEM, setting scan, or on NULL: */
1047 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
1049 ? (f & ~SCF_DO_SUBSTR) : f);
1051 if (flags & SCF_DO_STCLASS)
1052 data->start_class = oclass;
1053 if (mincount == 0 || minnext == 0) {
1054 if (flags & SCF_DO_STCLASS_OR) {
1055 cl_or(pRExC_state, data->start_class, &this_class);
1057 else if (flags & SCF_DO_STCLASS_AND) {
1058 /* Switch to OR mode: cache the old value of
1059 * data->start_class */
1060 StructCopy(data->start_class, &and_with,
1061 struct regnode_charclass_class);
1062 flags &= ~SCF_DO_STCLASS_AND;
1063 StructCopy(&this_class, data->start_class,
1064 struct regnode_charclass_class);
1065 flags |= SCF_DO_STCLASS_OR;
1066 data->start_class->flags |= ANYOF_EOS;
1068 } else { /* Non-zero len */
1069 if (flags & SCF_DO_STCLASS_OR) {
1070 cl_or(pRExC_state, data->start_class, &this_class);
1071 cl_and(data->start_class, &and_with);
1073 else if (flags & SCF_DO_STCLASS_AND)
1074 cl_and(data->start_class, &this_class);
1075 flags &= ~SCF_DO_STCLASS;
1077 if (!scan) /* It was not CURLYX, but CURLY. */
1079 if (ckWARN(WARN_REGEXP)
1080 && (minnext == 0) && (deltanext == 0)
1081 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1082 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1085 "Quantifier unexpected on zero-length expression");
1088 min += minnext * mincount;
1089 is_inf_internal |= ((maxcount == REG_INFTY
1090 && (minnext + deltanext) > 0)
1091 || deltanext == I32_MAX);
1092 is_inf |= is_inf_internal;
1093 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1095 /* Try powerful optimization CURLYX => CURLYN. */
1096 if ( OP(oscan) == CURLYX && data
1097 && data->flags & SF_IN_PAR
1098 && !(data->flags & SF_HAS_EVAL)
1099 && !deltanext && minnext == 1 ) {
1100 /* Try to optimize to CURLYN. */
1101 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1102 regnode *nxt1 = nxt;
1109 if (!strchr((char*)PL_simple,OP(nxt))
1110 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1111 && STR_LEN(nxt) == 1))
1117 if (OP(nxt) != CLOSE)
1119 /* Now we know that nxt2 is the only contents: */
1120 oscan->flags = ARG(nxt);
1122 OP(nxt1) = NOTHING; /* was OPEN. */
1124 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1125 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1126 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1127 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1128 OP(nxt + 1) = OPTIMIZED; /* was count. */
1129 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1134 /* Try optimization CURLYX => CURLYM. */
1135 if ( OP(oscan) == CURLYX && data
1136 && !(data->flags & SF_HAS_PAR)
1137 && !(data->flags & SF_HAS_EVAL)
1139 /* XXXX How to optimize if data == 0? */
1140 /* Optimize to a simpler form. */
1141 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1145 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1146 && (OP(nxt2) != WHILEM))
1148 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1149 /* Need to optimize away parenths. */
1150 if (data->flags & SF_IN_PAR) {
1151 /* Set the parenth number. */
1152 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1154 if (OP(nxt) != CLOSE)
1155 FAIL("Panic opt close");
1156 oscan->flags = ARG(nxt);
1157 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1158 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1160 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1161 OP(nxt + 1) = OPTIMIZED; /* was count. */
1162 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1163 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1166 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1167 regnode *nnxt = regnext(nxt1);
1170 if (reg_off_by_arg[OP(nxt1)])
1171 ARG_SET(nxt1, nxt2 - nxt1);
1172 else if (nxt2 - nxt1 < U16_MAX)
1173 NEXT_OFF(nxt1) = nxt2 - nxt1;
1175 OP(nxt) = NOTHING; /* Cannot beautify */
1180 /* Optimize again: */
1181 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1187 else if ((OP(oscan) == CURLYX)
1188 && (flags & SCF_WHILEM_VISITED_POS)
1189 /* See the comment on a similar expression above.
1190 However, this time it not a subexpression
1191 we care about, but the expression itself. */
1192 && (maxcount == REG_INFTY)
1193 && data && ++data->whilem_c < 16) {
1194 /* This stays as CURLYX, we can put the count/of pair. */
1195 /* Find WHILEM (as in regexec.c) */
1196 regnode *nxt = oscan + NEXT_OFF(oscan);
1198 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1200 PREVOPER(nxt)->flags = data->whilem_c
1201 | (RExC_whilem_seen << 4); /* On WHILEM */
1203 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1205 if (flags & SCF_DO_SUBSTR) {
1206 SV *last_str = Nullsv;
1207 int counted = mincount != 0;
1209 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1210 I32 b = pos_before >= data->last_start_min
1211 ? pos_before : data->last_start_min;
1213 char *s = SvPV(data->last_found, l);
1214 I32 old = b - data->last_start_min;
1217 old = utf8_hop((U8*)s, old) - (U8*)s;
1220 /* Get the added string: */
1221 last_str = newSVpvn(s + old, l);
1222 if (deltanext == 0 && pos_before == b) {
1223 /* What was added is a constant string */
1225 SvGROW(last_str, (mincount * l) + 1);
1226 repeatcpy(SvPVX(last_str) + l,
1227 SvPVX(last_str), l, mincount - 1);
1228 SvCUR(last_str) *= mincount;
1229 /* Add additional parts. */
1230 SvCUR_set(data->last_found,
1231 SvCUR(data->last_found) - l);
1232 sv_catsv(data->last_found, last_str);
1233 data->last_end += l * (mincount - 1);
1236 /* start offset must point into the last copy */
1237 data->last_start_min += minnext * (mincount - 1);
1238 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1239 * (minnext + data->pos_delta);
1242 /* It is counted once already... */
1243 data->pos_min += minnext * (mincount - counted);
1244 data->pos_delta += - counted * deltanext +
1245 (minnext + deltanext) * maxcount - minnext * mincount;
1246 if (mincount != maxcount) {
1247 /* Cannot extend fixed substrings found inside
1249 scan_commit(pRExC_state,data);
1250 if (mincount && last_str) {
1251 sv_setsv(data->last_found, last_str);
1252 data->last_end = data->pos_min;
1253 data->last_start_min =
1254 data->pos_min - CHR_SVLEN(last_str);
1255 data->last_start_max = is_inf
1257 : data->pos_min + data->pos_delta
1258 - CHR_SVLEN(last_str);
1260 data->longest = &(data->longest_float);
1262 SvREFCNT_dec(last_str);
1264 if (data && (fl & SF_HAS_EVAL))
1265 data->flags |= SF_HAS_EVAL;
1266 optimize_curly_tail:
1267 if (OP(oscan) != CURLYX) {
1268 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1270 NEXT_OFF(oscan) += NEXT_OFF(next);
1273 default: /* REF and CLUMP only? */
1274 if (flags & SCF_DO_SUBSTR) {
1275 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1276 data->longest = &(data->longest_float);
1278 is_inf = is_inf_internal = 1;
1279 if (flags & SCF_DO_STCLASS_OR)
1280 cl_anything(pRExC_state, data->start_class);
1281 flags &= ~SCF_DO_STCLASS;
1285 else if (strchr((char*)PL_simple,OP(scan))) {
1288 if (flags & SCF_DO_SUBSTR) {
1289 scan_commit(pRExC_state,data);
1293 if (flags & SCF_DO_STCLASS) {
1294 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1296 /* Some of the logic below assumes that switching
1297 locale on will only add false positives. */
1298 switch (PL_regkind[(U8)OP(scan)]) {
1302 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1303 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1304 cl_anything(pRExC_state, data->start_class);
1307 if (OP(scan) == SANY)
1309 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1310 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1311 || (data->start_class->flags & ANYOF_CLASS));
1312 cl_anything(pRExC_state, data->start_class);
1314 if (flags & SCF_DO_STCLASS_AND || !value)
1315 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1318 if (flags & SCF_DO_STCLASS_AND)
1319 cl_and(data->start_class,
1320 (struct regnode_charclass_class*)scan);
1322 cl_or(pRExC_state, data->start_class,
1323 (struct regnode_charclass_class*)scan);
1326 if (flags & SCF_DO_STCLASS_AND) {
1327 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1328 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1329 for (value = 0; value < 256; value++)
1330 if (!isALNUM(value))
1331 ANYOF_BITMAP_CLEAR(data->start_class, value);
1335 if (data->start_class->flags & ANYOF_LOCALE)
1336 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1338 for (value = 0; value < 256; value++)
1340 ANYOF_BITMAP_SET(data->start_class, value);
1345 if (flags & SCF_DO_STCLASS_AND) {
1346 if (data->start_class->flags & ANYOF_LOCALE)
1347 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1350 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1351 data->start_class->flags |= ANYOF_LOCALE;
1355 if (flags & SCF_DO_STCLASS_AND) {
1356 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1357 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1358 for (value = 0; value < 256; value++)
1360 ANYOF_BITMAP_CLEAR(data->start_class, value);
1364 if (data->start_class->flags & ANYOF_LOCALE)
1365 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1367 for (value = 0; value < 256; value++)
1368 if (!isALNUM(value))
1369 ANYOF_BITMAP_SET(data->start_class, value);
1374 if (flags & SCF_DO_STCLASS_AND) {
1375 if (data->start_class->flags & ANYOF_LOCALE)
1376 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1379 data->start_class->flags |= ANYOF_LOCALE;
1380 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1384 if (flags & SCF_DO_STCLASS_AND) {
1385 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1386 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1387 for (value = 0; value < 256; value++)
1388 if (!isSPACE(value))
1389 ANYOF_BITMAP_CLEAR(data->start_class, value);
1393 if (data->start_class->flags & ANYOF_LOCALE)
1394 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1396 for (value = 0; value < 256; value++)
1398 ANYOF_BITMAP_SET(data->start_class, value);
1403 if (flags & SCF_DO_STCLASS_AND) {
1404 if (data->start_class->flags & ANYOF_LOCALE)
1405 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1408 data->start_class->flags |= ANYOF_LOCALE;
1409 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1413 if (flags & SCF_DO_STCLASS_AND) {
1414 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1415 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1416 for (value = 0; value < 256; value++)
1418 ANYOF_BITMAP_CLEAR(data->start_class, value);
1422 if (data->start_class->flags & ANYOF_LOCALE)
1423 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1425 for (value = 0; value < 256; value++)
1426 if (!isSPACE(value))
1427 ANYOF_BITMAP_SET(data->start_class, value);
1432 if (flags & SCF_DO_STCLASS_AND) {
1433 if (data->start_class->flags & ANYOF_LOCALE) {
1434 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1435 for (value = 0; value < 256; value++)
1436 if (!isSPACE(value))
1437 ANYOF_BITMAP_CLEAR(data->start_class, value);
1441 data->start_class->flags |= ANYOF_LOCALE;
1442 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1446 if (flags & SCF_DO_STCLASS_AND) {
1447 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1448 for (value = 0; value < 256; value++)
1449 if (!isDIGIT(value))
1450 ANYOF_BITMAP_CLEAR(data->start_class, value);
1453 if (data->start_class->flags & ANYOF_LOCALE)
1454 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1456 for (value = 0; value < 256; value++)
1458 ANYOF_BITMAP_SET(data->start_class, value);
1463 if (flags & SCF_DO_STCLASS_AND) {
1464 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1465 for (value = 0; value < 256; value++)
1467 ANYOF_BITMAP_CLEAR(data->start_class, value);
1470 if (data->start_class->flags & ANYOF_LOCALE)
1471 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1473 for (value = 0; value < 256; value++)
1474 if (!isDIGIT(value))
1475 ANYOF_BITMAP_SET(data->start_class, value);
1480 if (flags & SCF_DO_STCLASS_OR)
1481 cl_and(data->start_class, &and_with);
1482 flags &= ~SCF_DO_STCLASS;
1485 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1486 data->flags |= (OP(scan) == MEOL
1490 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1491 /* Lookbehind, or need to calculate parens/evals/stclass: */
1492 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1493 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1494 /* Lookahead/lookbehind */
1495 I32 deltanext, minnext, fake = 0;
1497 struct regnode_charclass_class intrnl;
1500 data_fake.flags = 0;
1502 data_fake.whilem_c = data->whilem_c;
1503 data_fake.last_closep = data->last_closep;
1506 data_fake.last_closep = &fake;
1507 if ( flags & SCF_DO_STCLASS && !scan->flags
1508 && OP(scan) == IFMATCH ) { /* Lookahead */
1509 cl_init(pRExC_state, &intrnl);
1510 data_fake.start_class = &intrnl;
1511 f |= SCF_DO_STCLASS_AND;
1513 if (flags & SCF_WHILEM_VISITED_POS)
1514 f |= SCF_WHILEM_VISITED_POS;
1515 next = regnext(scan);
1516 nscan = NEXTOPER(NEXTOPER(scan));
1517 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1520 vFAIL("Variable length lookbehind not implemented");
1522 else if (minnext > U8_MAX) {
1523 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1525 scan->flags = minnext;
1527 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1529 if (data && (data_fake.flags & SF_HAS_EVAL))
1530 data->flags |= SF_HAS_EVAL;
1532 data->whilem_c = data_fake.whilem_c;
1533 if (f & SCF_DO_STCLASS_AND) {
1534 int was = (data->start_class->flags & ANYOF_EOS);
1536 cl_and(data->start_class, &intrnl);
1538 data->start_class->flags |= ANYOF_EOS;
1541 else if (OP(scan) == OPEN) {
1544 else if (OP(scan) == CLOSE) {
1545 if (ARG(scan) == is_par) {
1546 next = regnext(scan);
1548 if ( next && (OP(next) != WHILEM) && next < last)
1549 is_par = 0; /* Disable optimization */
1552 *(data->last_closep) = ARG(scan);
1554 else if (OP(scan) == EVAL) {
1556 data->flags |= SF_HAS_EVAL;
1558 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1559 if (flags & SCF_DO_SUBSTR) {
1560 scan_commit(pRExC_state,data);
1561 data->longest = &(data->longest_float);
1563 is_inf = is_inf_internal = 1;
1564 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1565 cl_anything(pRExC_state, data->start_class);
1566 flags &= ~SCF_DO_STCLASS;
1568 /* Else: zero-length, ignore. */
1569 scan = regnext(scan);
1574 *deltap = is_inf_internal ? I32_MAX : delta;
1575 if (flags & SCF_DO_SUBSTR && is_inf)
1576 data->pos_delta = I32_MAX - data->pos_min;
1577 if (is_par > U8_MAX)
1579 if (is_par && pars==1 && data) {
1580 data->flags |= SF_IN_PAR;
1581 data->flags &= ~SF_HAS_PAR;
1583 else if (pars && data) {
1584 data->flags |= SF_HAS_PAR;
1585 data->flags &= ~SF_IN_PAR;
1587 if (flags & SCF_DO_STCLASS_OR)
1588 cl_and(data->start_class, &and_with);
1593 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1595 if (RExC_rx->data) {
1596 Renewc(RExC_rx->data,
1597 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1598 char, struct reg_data);
1599 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1600 RExC_rx->data->count += n;
1603 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1604 char, struct reg_data);
1605 New(1208, RExC_rx->data->what, n, U8);
1606 RExC_rx->data->count = n;
1608 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1609 return RExC_rx->data->count - n;
1613 Perl_reginitcolors(pTHX)
1616 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1619 PL_colors[0] = s = savepv(s);
1621 s = strchr(s, '\t');
1627 PL_colors[i] = s = "";
1631 PL_colors[i++] = "";
1638 - pregcomp - compile a regular expression into internal code
1640 * We can't allocate space until we know how big the compiled form will be,
1641 * but we can't compile it (and thus know how big it is) until we've got a
1642 * place to put the code. So we cheat: we compile it twice, once with code
1643 * generation turned off and size counting turned on, and once "for real".
1644 * This also means that we don't allocate space until we are sure that the
1645 * thing really will compile successfully, and we never have to move the
1646 * code and thus invalidate pointers into it. (Note that it has to be in
1647 * one piece because free() must be able to free it all.) [NB: not true in perl]
1649 * Beware that the optimization-preparation code in here knows about some
1650 * of the structure of the compiled regexp. [I'll say.]
1653 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1663 RExC_state_t RExC_state;
1664 RExC_state_t *pRExC_state = &RExC_state;
1667 FAIL("NULL regexp argument");
1672 DEBUG_r(if (!PL_colorset) reginitcolors());
1673 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1674 PL_colors[4],PL_colors[5],PL_colors[0],
1675 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1676 RExC_flags16 = pm->op_pmflags;
1680 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1681 RExC_seen_evals = 0;
1684 /* First pass: determine size, legality. */
1691 RExC_emit = &PL_regdummy;
1692 RExC_whilem_seen = 0;
1693 #if 0 /* REGC() is (currently) a NOP at the first pass.
1694 * Clever compilers notice this and complain. --jhi */
1695 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1697 if (reg(pRExC_state, 0, &flags) == NULL) {
1698 RExC_precomp = Nullch;
1701 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1703 /* Small enough for pointer-storage convention?
1704 If extralen==0, this means that we will not need long jumps. */
1705 if (RExC_size >= 0x10000L && RExC_extralen)
1706 RExC_size += RExC_extralen;
1709 if (RExC_whilem_seen > 15)
1710 RExC_whilem_seen = 15;
1712 /* Allocate space and initialize. */
1713 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1716 FAIL("Regexp out of space");
1719 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1720 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1723 r->prelen = xend - exp;
1724 r->precomp = savepvn(RExC_precomp, r->prelen);
1726 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1727 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1729 r->substrs = 0; /* Useful during FAIL. */
1730 r->startp = 0; /* Useful during FAIL. */
1731 r->endp = 0; /* Useful during FAIL. */
1733 Newz(1304, r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
1735 r->offsets[0] = RExC_size;
1737 DEBUG_r(PerlIO_printf(Perl_debug_log,
1738 "%s %"UVuf" bytes for offset annotations.\n",
1739 r->offsets ? "Got" : "Couldn't get",
1740 (UV)((2*RExC_size+1) * sizeof(U32))));
1744 /* Second pass: emit code. */
1749 RExC_emit_start = r->program;
1750 RExC_emit = r->program;
1751 /* Store the count of eval-groups for security checks: */
1752 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1753 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1755 if (reg(pRExC_state, 0, &flags) == NULL)
1758 /* Dig out information for optimizations. */
1759 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1760 pm->op_pmflags = RExC_flags16;
1762 r->reganch |= ROPT_UTF8;
1763 r->regstclass = NULL;
1764 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1765 r->reganch |= ROPT_NAUGHTY;
1766 scan = r->program + 1; /* First BRANCH. */
1768 /* XXXX To minimize changes to RE engine we always allocate
1769 3-units-long substrs field. */
1770 Newz(1004, r->substrs, 1, struct reg_substr_data);
1772 StructCopy(&zero_scan_data, &data, scan_data_t);
1773 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1774 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1776 STRLEN longest_float_length, longest_fixed_length;
1777 struct regnode_charclass_class ch_class;
1782 /* Skip introductions and multiplicators >= 1. */
1783 while ((OP(first) == OPEN && (sawopen = 1)) ||
1784 /* An OR of *one* alternative - should not happen now. */
1785 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1786 (OP(first) == PLUS) ||
1787 (OP(first) == MINMOD) ||
1788 /* An {n,m} with n>0 */
1789 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1790 if (OP(first) == PLUS)
1793 first += regarglen[(U8)OP(first)];
1794 first = NEXTOPER(first);
1797 /* Starting-point info. */
1799 if (PL_regkind[(U8)OP(first)] == EXACT) {
1800 if (OP(first) == EXACT)
1801 ; /* Empty, get anchored substr later. */
1802 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1803 r->regstclass = first;
1805 else if (strchr((char*)PL_simple,OP(first)))
1806 r->regstclass = first;
1807 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1808 PL_regkind[(U8)OP(first)] == NBOUND)
1809 r->regstclass = first;
1810 else if (PL_regkind[(U8)OP(first)] == BOL) {
1811 r->reganch |= (OP(first) == MBOL
1813 : (OP(first) == SBOL
1816 first = NEXTOPER(first);
1819 else if (OP(first) == GPOS) {
1820 r->reganch |= ROPT_ANCH_GPOS;
1821 first = NEXTOPER(first);
1824 else if ((OP(first) == STAR &&
1825 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1826 !(r->reganch & ROPT_ANCH) )
1828 /* turn .* into ^.* with an implied $*=1 */
1829 int type = OP(NEXTOPER(first));
1831 if (type == REG_ANY)
1832 type = ROPT_ANCH_MBOL;
1834 type = ROPT_ANCH_SBOL;
1836 r->reganch |= type | ROPT_IMPLICIT;
1837 first = NEXTOPER(first);
1840 if (sawplus && (!sawopen || !RExC_sawback)
1841 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1842 /* x+ must match at the 1st pos of run of x's */
1843 r->reganch |= ROPT_SKIP;
1845 /* Scan is after the zeroth branch, first is atomic matcher. */
1846 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1847 (IV)(first - scan + 1)));
1849 * If there's something expensive in the r.e., find the
1850 * longest literal string that must appear and make it the
1851 * regmust. Resolve ties in favor of later strings, since
1852 * the regstart check works with the beginning of the r.e.
1853 * and avoiding duplication strengthens checking. Not a
1854 * strong reason, but sufficient in the absence of others.
1855 * [Now we resolve ties in favor of the earlier string if
1856 * it happens that c_offset_min has been invalidated, since the
1857 * earlier string may buy us something the later one won't.]
1861 data.longest_fixed = newSVpvn("",0);
1862 data.longest_float = newSVpvn("",0);
1863 data.last_found = newSVpvn("",0);
1864 data.longest = &(data.longest_fixed);
1866 if (!r->regstclass) {
1867 cl_init(pRExC_state, &ch_class);
1868 data.start_class = &ch_class;
1869 stclass_flag = SCF_DO_STCLASS_AND;
1870 } else /* XXXX Check for BOUND? */
1872 data.last_closep = &last_close;
1874 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1875 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1876 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1877 && data.last_start_min == 0 && data.last_end > 0
1878 && !RExC_seen_zerolen
1879 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1880 r->reganch |= ROPT_CHECK_ALL;
1881 scan_commit(pRExC_state, &data);
1882 SvREFCNT_dec(data.last_found);
1884 longest_float_length = CHR_SVLEN(data.longest_float);
1885 if (longest_float_length
1886 || (data.flags & SF_FL_BEFORE_EOL
1887 && (!(data.flags & SF_FL_BEFORE_MEOL)
1888 || (RExC_flags16 & PMf_MULTILINE)))) {
1891 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1892 && data.offset_fixed == data.offset_float_min
1893 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1894 goto remove_float; /* As in (a)+. */
1896 r->float_substr = data.longest_float;
1897 r->float_min_offset = data.offset_float_min;
1898 r->float_max_offset = data.offset_float_max;
1899 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1900 && (!(data.flags & SF_FL_BEFORE_MEOL)
1901 || (RExC_flags16 & PMf_MULTILINE)));
1902 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1906 r->float_substr = Nullsv;
1907 SvREFCNT_dec(data.longest_float);
1908 longest_float_length = 0;
1911 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1912 if (longest_fixed_length
1913 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1914 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1915 || (RExC_flags16 & PMf_MULTILINE)))) {
1918 r->anchored_substr = data.longest_fixed;
1919 r->anchored_offset = data.offset_fixed;
1920 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1921 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1922 || (RExC_flags16 & PMf_MULTILINE)));
1923 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1926 r->anchored_substr = Nullsv;
1927 SvREFCNT_dec(data.longest_fixed);
1928 longest_fixed_length = 0;
1931 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1932 r->regstclass = NULL;
1933 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1934 && !(data.start_class->flags & ANYOF_EOS)
1935 && !cl_is_anything(data.start_class)) {
1936 I32 n = add_data(pRExC_state, 1, "f");
1938 New(1006, RExC_rx->data->data[n], 1,
1939 struct regnode_charclass_class);
1940 StructCopy(data.start_class,
1941 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1942 struct regnode_charclass_class);
1943 r->regstclass = (regnode*)RExC_rx->data->data[n];
1944 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1945 PL_regdata = r->data; /* for regprop() */
1946 DEBUG_r({ SV *sv = sv_newmortal();
1947 regprop(sv, (regnode*)data.start_class);
1948 PerlIO_printf(Perl_debug_log,
1949 "synthetic stclass `%s'.\n",
1953 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1954 if (longest_fixed_length > longest_float_length) {
1955 r->check_substr = r->anchored_substr;
1956 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1957 if (r->reganch & ROPT_ANCH_SINGLE)
1958 r->reganch |= ROPT_NOSCAN;
1961 r->check_substr = r->float_substr;
1962 r->check_offset_min = data.offset_float_min;
1963 r->check_offset_max = data.offset_float_max;
1965 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1966 This should be changed ASAP! */
1967 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1968 r->reganch |= RE_USE_INTUIT;
1969 if (SvTAIL(r->check_substr))
1970 r->reganch |= RE_INTUIT_TAIL;
1974 /* Several toplevels. Best we can is to set minlen. */
1976 struct regnode_charclass_class ch_class;
1979 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1980 scan = r->program + 1;
1981 cl_init(pRExC_state, &ch_class);
1982 data.start_class = &ch_class;
1983 data.last_closep = &last_close;
1984 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
1985 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1986 if (!(data.start_class->flags & ANYOF_EOS)
1987 && !cl_is_anything(data.start_class)) {
1988 I32 n = add_data(pRExC_state, 1, "f");
1990 New(1006, RExC_rx->data->data[n], 1,
1991 struct regnode_charclass_class);
1992 StructCopy(data.start_class,
1993 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1994 struct regnode_charclass_class);
1995 r->regstclass = (regnode*)RExC_rx->data->data[n];
1996 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1997 DEBUG_r({ SV* sv = sv_newmortal();
1998 regprop(sv, (regnode*)data.start_class);
1999 PerlIO_printf(Perl_debug_log,
2000 "synthetic stclass `%s'.\n",
2006 if (RExC_seen & REG_SEEN_GPOS)
2007 r->reganch |= ROPT_GPOS_SEEN;
2008 if (RExC_seen & REG_SEEN_LOOKBEHIND)
2009 r->reganch |= ROPT_LOOKBEHIND_SEEN;
2010 if (RExC_seen & REG_SEEN_EVAL)
2011 r->reganch |= ROPT_EVAL_SEEN;
2012 if (RExC_seen & REG_SEEN_CANY)
2013 r->reganch |= ROPT_CANY_SEEN;
2014 Newz(1002, r->startp, RExC_npar, I32);
2015 Newz(1002, r->endp, RExC_npar, I32);
2016 PL_regdata = r->data; /* for regprop() */
2017 DEBUG_r(regdump(r));
2022 - reg - regular expression, i.e. main body or parenthesized thing
2024 * Caller must absorb opening parenthesis.
2026 * Combining parenthesis handling with the base level of regular expression
2027 * is a trifle forced, but the need to tie the tails of the branches to what
2028 * follows makes it hard to avoid.
2031 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
2032 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
2034 register regnode *ret; /* Will be the head of the group. */
2035 register regnode *br;
2036 register regnode *lastbr;
2037 register regnode *ender = 0;
2038 register I32 parno = 0;
2039 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
2041 /* for (?g), (?gc), and (?o) warnings; warning
2042 about (?c) will warn about (?g) -- japhy */
2044 I32 wastedflags = 0x00,
2047 wasted_gc = 0x02 | 0x04,
2050 char * parse_start = RExC_parse; /* MJD */
2051 char *oregcomp_parse = RExC_parse;
2054 *flagp = 0; /* Tentatively. */
2057 /* Make an OPEN node, if parenthesized. */
2059 if (*RExC_parse == '?') { /* (?...) */
2060 U16 posflags = 0, negflags = 0;
2061 U16 *flagsp = &posflags;
2063 char *seqstart = RExC_parse;
2066 paren = *RExC_parse++;
2067 ret = NULL; /* For look-ahead/behind. */
2069 case '<': /* (?<...) */
2070 RExC_seen |= REG_SEEN_LOOKBEHIND;
2071 if (*RExC_parse == '!')
2073 if (*RExC_parse != '=' && *RExC_parse != '!')
2076 case '=': /* (?=...) */
2077 case '!': /* (?!...) */
2078 RExC_seen_zerolen++;
2079 case ':': /* (?:...) */
2080 case '>': /* (?>...) */
2082 case '$': /* (?$...) */
2083 case '@': /* (?@...) */
2084 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2086 case '#': /* (?#...) */
2087 while (*RExC_parse && *RExC_parse != ')')
2089 if (*RExC_parse != ')')
2090 FAIL("Sequence (?#... not terminated");
2091 nextchar(pRExC_state);
2094 case 'p': /* (?p...) */
2095 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
2096 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
2098 case '?': /* (??...) */
2100 paren = *RExC_parse++;
2102 case '{': /* (?{...}) */
2104 I32 count = 1, n = 0;
2106 char *s = RExC_parse;
2108 OP_4tree *sop, *rop;
2110 RExC_seen_zerolen++;
2111 RExC_seen |= REG_SEEN_EVAL;
2112 while (count && (c = *RExC_parse)) {
2113 if (c == '\\' && RExC_parse[1])
2121 if (*RExC_parse != ')')
2124 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2129 if (RExC_parse - 1 - s)
2130 sv = newSVpvn(s, RExC_parse - 1 - s);
2132 sv = newSVpvn("", 0);
2135 Perl_save_re_context(aTHX);
2136 rop = sv_compile_2op(sv, &sop, "re", &av);
2137 sop->op_private |= OPpREFCOUNTED;
2138 /* re_dup will OpREFCNT_inc */
2139 OpREFCNT_set(sop, 1);
2142 n = add_data(pRExC_state, 3, "nop");
2143 RExC_rx->data->data[n] = (void*)rop;
2144 RExC_rx->data->data[n+1] = (void*)sop;
2145 RExC_rx->data->data[n+2] = (void*)av;
2148 else { /* First pass */
2149 if (PL_reginterp_cnt < ++RExC_seen_evals
2150 && PL_curcop != &PL_compiling)
2151 /* No compiled RE interpolated, has runtime
2152 components ===> unsafe. */
2153 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2154 if (PL_tainting && PL_tainted)
2155 FAIL("Eval-group in insecure regular expression");
2158 nextchar(pRExC_state);
2160 ret = reg_node(pRExC_state, LOGICAL);
2163 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2164 /* deal with the length of this later - MJD */
2167 return reganode(pRExC_state, EVAL, n);
2169 case '(': /* (?(?{...})...) and (?(?=...)...) */
2171 if (RExC_parse[0] == '?') { /* (?(?...)) */
2172 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2173 || RExC_parse[1] == '<'
2174 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2177 ret = reg_node(pRExC_state, LOGICAL);
2180 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2184 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2186 parno = atoi(RExC_parse++);
2188 while (isDIGIT(*RExC_parse))
2190 ret = reganode(pRExC_state, GROUPP, parno);
2192 if ((c = *nextchar(pRExC_state)) != ')')
2193 vFAIL("Switch condition not recognized");
2195 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2196 br = regbranch(pRExC_state, &flags, 1);
2198 br = reganode(pRExC_state, LONGJMP, 0);
2200 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2201 c = *nextchar(pRExC_state);
2205 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2206 regbranch(pRExC_state, &flags, 1);
2207 regtail(pRExC_state, ret, lastbr);
2210 c = *nextchar(pRExC_state);
2215 vFAIL("Switch (?(condition)... contains too many branches");
2216 ender = reg_node(pRExC_state, TAIL);
2217 regtail(pRExC_state, br, ender);
2219 regtail(pRExC_state, lastbr, ender);
2220 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2223 regtail(pRExC_state, ret, ender);
2227 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2231 RExC_parse--; /* for vFAIL to print correctly */
2232 vFAIL("Sequence (? incomplete");
2236 parse_flags: /* (?i) */
2237 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2238 /* (?g), (?gc) and (?o) are useless here
2239 and must be globally applied -- japhy */
2241 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
2242 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2243 I32 wflagbit = *RExC_parse == 'o' ? wasted_o : wasted_g;
2244 if (! (wastedflags & wflagbit) ) {
2245 wastedflags |= wflagbit;
2248 "Useless (%s%c) - %suse /%c modifier",
2249 flagsp == &negflags ? "?-" : "?",
2251 flagsp == &negflags ? "don't " : "",
2257 else if (*RExC_parse == 'c') {
2258 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2259 if (! (wastedflags & wasted_c) ) {
2260 wastedflags |= wasted_gc;
2263 "Useless (%sc) - %suse /gc modifier",
2264 flagsp == &negflags ? "?-" : "?",
2265 flagsp == &negflags ? "don't " : ""
2270 else { pmflag(flagsp, *RExC_parse); }
2274 if (*RExC_parse == '-') {
2276 wastedflags = 0; /* reset so (?g-c) warns twice */
2280 RExC_flags16 |= posflags;
2281 RExC_flags16 &= ~negflags;
2282 if (*RExC_parse == ':') {
2288 if (*RExC_parse != ')') {
2290 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2292 nextchar(pRExC_state);
2300 ret = reganode(pRExC_state, OPEN, parno);
2301 Set_Node_Length(ret, 1); /* MJD */
2302 Set_Node_Offset(ret, RExC_parse); /* MJD */
2309 /* Pick up the branches, linking them together. */
2310 parse_start = RExC_parse; /* MJD */
2311 br = regbranch(pRExC_state, &flags, 1);
2312 /* branch_len = (paren != 0); */
2316 if (*RExC_parse == '|') {
2317 if (!SIZE_ONLY && RExC_extralen) {
2318 reginsert(pRExC_state, BRANCHJ, br);
2321 reginsert(pRExC_state, BRANCH, br);
2322 Set_Node_Length(br, paren != 0);
2323 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
2327 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2329 else if (paren == ':') {
2330 *flagp |= flags&SIMPLE;
2332 if (open) { /* Starts with OPEN. */
2333 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2335 else if (paren != '?') /* Not Conditional */
2339 *flagp |= flags&SPSTART;
2341 while (*RExC_parse == '|') {
2342 if (!SIZE_ONLY && RExC_extralen) {
2343 ender = reganode(pRExC_state, LONGJMP,0);
2344 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2347 RExC_extralen += 2; /* Account for LONGJMP. */
2348 nextchar(pRExC_state);
2349 br = regbranch(pRExC_state, &flags, 0);
2353 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2357 *flagp |= flags&SPSTART;
2360 if (have_branch || paren != ':') {
2361 /* Make a closing node, and hook it on the end. */
2364 ender = reg_node(pRExC_state, TAIL);
2367 ender = reganode(pRExC_state, CLOSE, parno);
2368 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
2369 Set_Node_Length(ender,1); /* MJD */
2375 *flagp &= ~HASWIDTH;
2378 ender = reg_node(pRExC_state, SUCCEED);
2381 ender = reg_node(pRExC_state, END);
2384 regtail(pRExC_state, lastbr, ender);
2387 /* Hook the tails of the branches to the closing node. */
2388 for (br = ret; br != NULL; br = regnext(br)) {
2389 regoptail(pRExC_state, br, ender);
2396 static char parens[] = "=!<,>";
2398 if (paren && (p = strchr(parens, paren))) {
2399 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2400 int flag = (p - parens) > 1;
2403 node = SUSPEND, flag = 0;
2404 reginsert(pRExC_state, node,ret);
2406 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2410 /* Check for proper termination. */
2412 RExC_flags16 = oregflags;
2413 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2414 RExC_parse = oregcomp_parse;
2415 vFAIL("Unmatched (");
2418 else if (!paren && RExC_parse < RExC_end) {
2419 if (*RExC_parse == ')') {
2421 vFAIL("Unmatched )");
2424 FAIL("Junk on end of regexp"); /* "Can't happen". */
2432 - regbranch - one alternative of an | operator
2434 * Implements the concatenation operator.
2437 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2439 register regnode *ret;
2440 register regnode *chain = NULL;
2441 register regnode *latest;
2442 I32 flags = 0, c = 0;
2447 if (!SIZE_ONLY && RExC_extralen)
2448 ret = reganode(pRExC_state, BRANCHJ,0);
2450 ret = reg_node(pRExC_state, BRANCH);
2451 Set_Node_Length(ret, 1);
2455 if (!first && SIZE_ONLY)
2456 RExC_extralen += 1; /* BRANCHJ */
2458 *flagp = WORST; /* Tentatively. */
2461 nextchar(pRExC_state);
2462 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2464 latest = regpiece(pRExC_state, &flags);
2465 if (latest == NULL) {
2466 if (flags & TRYAGAIN)
2470 else if (ret == NULL)
2472 *flagp |= flags&HASWIDTH;
2473 if (chain == NULL) /* First piece. */
2474 *flagp |= flags&SPSTART;
2477 regtail(pRExC_state, chain, latest);
2482 if (chain == NULL) { /* Loop ran zero times. */
2483 chain = reg_node(pRExC_state, NOTHING);
2488 *flagp |= flags&SIMPLE;
2495 - regpiece - something followed by possible [*+?]
2497 * Note that the branching code sequences used for ? and the general cases
2498 * of * and + are somewhat optimized: they use the same NOTHING node as
2499 * both the endmarker for their branch list and the body of the last branch.
2500 * It might seem that this node could be dispensed with entirely, but the
2501 * endmarker role is not redundant.
2504 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2506 register regnode *ret;
2508 register char *next;
2510 char *origparse = RExC_parse;
2513 I32 max = REG_INFTY;
2516 ret = regatom(pRExC_state, &flags);
2518 if (flags & TRYAGAIN)
2525 if (op == '{' && regcurly(RExC_parse)) {
2526 parse_start = RExC_parse; /* MJD */
2527 next = RExC_parse + 1;
2529 while (isDIGIT(*next) || *next == ',') {
2538 if (*next == '}') { /* got one */
2542 min = atoi(RExC_parse);
2546 maxpos = RExC_parse;
2548 if (!max && *maxpos != '0')
2549 max = REG_INFTY; /* meaning "infinity" */
2550 else if (max >= REG_INFTY)
2551 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2553 nextchar(pRExC_state);
2556 if ((flags&SIMPLE)) {
2557 RExC_naughty += 2 + RExC_naughty / 2;
2558 reginsert(pRExC_state, CURLY, ret);
2559 Set_Node_Offset(ret, parse_start+1); /* MJD */
2560 Set_Node_Cur_Length(ret);
2563 regnode *w = reg_node(pRExC_state, WHILEM);
2566 regtail(pRExC_state, ret, w);
2567 if (!SIZE_ONLY && RExC_extralen) {
2568 reginsert(pRExC_state, LONGJMP,ret);
2569 reginsert(pRExC_state, NOTHING,ret);
2570 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2572 reginsert(pRExC_state, CURLYX,ret);
2574 Set_Node_Offset(ret, parse_start+1);
2575 Set_Node_Length(ret,
2576 op == '{' ? (RExC_parse - parse_start) : 1);
2578 if (!SIZE_ONLY && RExC_extralen)
2579 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2580 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2582 RExC_whilem_seen++, RExC_extralen += 3;
2583 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2591 if (max && max < min)
2592 vFAIL("Can't do {n,m} with n > m");
2607 #if 0 /* Now runtime fix should be reliable. */
2609 /* if this is reinstated, don't forget to put this back into perldiag:
2611 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2613 (F) The part of the regexp subject to either the * or + quantifier
2614 could match an empty string. The {#} shows in the regular
2615 expression about where the problem was discovered.
2619 if (!(flags&HASWIDTH) && op != '?')
2620 vFAIL("Regexp *+ operand could be empty");
2623 parse_start = RExC_parse;
2624 nextchar(pRExC_state);
2626 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2628 if (op == '*' && (flags&SIMPLE)) {
2629 reginsert(pRExC_state, STAR, ret);
2633 else if (op == '*') {
2637 else if (op == '+' && (flags&SIMPLE)) {
2638 reginsert(pRExC_state, PLUS, ret);
2642 else if (op == '+') {
2646 else if (op == '?') {
2651 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2653 "%.*s matches null string many times",
2654 RExC_parse - origparse,
2658 if (*RExC_parse == '?') {
2659 nextchar(pRExC_state);
2660 reginsert(pRExC_state, MINMOD, ret);
2661 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2663 if (ISMULT2(RExC_parse)) {
2665 vFAIL("Nested quantifiers");
2672 - regatom - the lowest level
2674 * Optimization: gobbles an entire sequence of ordinary characters so that
2675 * it can turn them into a single node, which is smaller to store and
2676 * faster to run. Backslashed characters are exceptions, each becoming a
2677 * separate node; the code is simpler that way and it's not worth fixing.
2679 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2681 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2683 register regnode *ret = 0;
2685 char *parse_start = 0;
2687 *flagp = WORST; /* Tentatively. */
2690 switch (*RExC_parse) {
2692 RExC_seen_zerolen++;
2693 nextchar(pRExC_state);
2694 if (RExC_flags16 & PMf_MULTILINE)
2695 ret = reg_node(pRExC_state, MBOL);
2696 else if (RExC_flags16 & PMf_SINGLELINE)
2697 ret = reg_node(pRExC_state, SBOL);
2699 ret = reg_node(pRExC_state, BOL);
2700 Set_Node_Length(ret, 1); /* MJD */
2703 nextchar(pRExC_state);
2705 RExC_seen_zerolen++;
2706 if (RExC_flags16 & PMf_MULTILINE)
2707 ret = reg_node(pRExC_state, MEOL);
2708 else if (RExC_flags16 & PMf_SINGLELINE)
2709 ret = reg_node(pRExC_state, SEOL);
2711 ret = reg_node(pRExC_state, EOL);
2712 Set_Node_Length(ret, 1); /* MJD */
2715 nextchar(pRExC_state);
2716 if (RExC_flags16 & PMf_SINGLELINE)
2717 ret = reg_node(pRExC_state, SANY);
2719 ret = reg_node(pRExC_state, REG_ANY);
2720 *flagp |= HASWIDTH|SIMPLE;
2722 Set_Node_Length(ret, 1); /* MJD */
2726 char *oregcomp_parse = ++RExC_parse;
2727 ret = regclass(pRExC_state);
2728 if (*RExC_parse != ']') {
2729 RExC_parse = oregcomp_parse;
2730 vFAIL("Unmatched [");
2732 nextchar(pRExC_state);
2733 *flagp |= HASWIDTH|SIMPLE;
2734 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
2738 nextchar(pRExC_state);
2739 ret = reg(pRExC_state, 1, &flags);
2741 if (flags & TRYAGAIN) {
2742 if (RExC_parse == RExC_end) {
2743 /* Make parent create an empty node if needed. */
2751 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2755 if (flags & TRYAGAIN) {
2759 vFAIL("Internal urp");
2760 /* Supposed to be caught earlier. */
2763 if (!regcurly(RExC_parse)) {
2772 vFAIL("Quantifier follows nothing");
2775 switch (*++RExC_parse) {
2777 RExC_seen_zerolen++;
2778 ret = reg_node(pRExC_state, SBOL);
2780 nextchar(pRExC_state);
2781 Set_Node_Length(ret, 2); /* MJD */
2784 ret = reg_node(pRExC_state, GPOS);
2785 RExC_seen |= REG_SEEN_GPOS;
2787 nextchar(pRExC_state);
2788 Set_Node_Length(ret, 2); /* MJD */
2791 ret = reg_node(pRExC_state, SEOL);
2793 nextchar(pRExC_state);
2796 ret = reg_node(pRExC_state, EOS);
2798 RExC_seen_zerolen++; /* Do not optimize RE away */
2799 nextchar(pRExC_state);
2800 Set_Node_Length(ret, 2); /* MJD */
2803 ret = reg_node(pRExC_state, CANY);
2804 RExC_seen |= REG_SEEN_CANY;
2805 *flagp |= HASWIDTH|SIMPLE;
2806 nextchar(pRExC_state);
2807 Set_Node_Length(ret, 2); /* MJD */
2810 ret = reg_node(pRExC_state, CLUMP);
2812 nextchar(pRExC_state);
2813 Set_Node_Length(ret, 2); /* MJD */
2816 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2817 *flagp |= HASWIDTH|SIMPLE;
2818 nextchar(pRExC_state);
2819 Set_Node_Length(ret, 2); /* MJD */
2822 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2823 *flagp |= HASWIDTH|SIMPLE;
2824 nextchar(pRExC_state);
2825 Set_Node_Length(ret, 2); /* MJD */
2828 RExC_seen_zerolen++;
2829 RExC_seen |= REG_SEEN_LOOKBEHIND;
2830 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2832 nextchar(pRExC_state);
2833 Set_Node_Length(ret, 2); /* MJD */
2836 RExC_seen_zerolen++;
2837 RExC_seen |= REG_SEEN_LOOKBEHIND;
2838 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2840 nextchar(pRExC_state);
2841 Set_Node_Length(ret, 2); /* MJD */
2844 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2845 *flagp |= HASWIDTH|SIMPLE;
2846 nextchar(pRExC_state);
2847 Set_Node_Length(ret, 2); /* MJD */
2850 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2851 *flagp |= HASWIDTH|SIMPLE;
2852 nextchar(pRExC_state);
2853 Set_Node_Length(ret, 2); /* MJD */
2856 ret = reg_node(pRExC_state, DIGIT);
2857 *flagp |= HASWIDTH|SIMPLE;
2858 nextchar(pRExC_state);
2859 Set_Node_Length(ret, 2); /* MJD */
2862 ret = reg_node(pRExC_state, NDIGIT);
2863 *flagp |= HASWIDTH|SIMPLE;
2864 nextchar(pRExC_state);
2865 Set_Node_Length(ret, 2); /* MJD */
2870 char* oldregxend = RExC_end;
2871 char* parse_start = RExC_parse;
2873 if (RExC_parse[1] == '{') {
2874 /* a lovely hack--pretend we saw [\pX] instead */
2875 RExC_end = strchr(RExC_parse, '}');
2878 RExC_end = oldregxend;
2879 vFAIL("Missing right brace on \\p{}");
2884 RExC_end = RExC_parse + 2;
2887 ret = regclass(pRExC_state);
2889 RExC_end = oldregxend;
2891 Set_Node_Cur_Length(ret); /* MJD */
2892 nextchar(pRExC_state);
2893 *flagp |= HASWIDTH|SIMPLE;
2906 case '1': case '2': case '3': case '4':
2907 case '5': case '6': case '7': case '8': case '9':
2909 I32 num = atoi(RExC_parse);
2911 if (num > 9 && num >= RExC_npar)
2914 char * parse_start = RExC_parse - 1; /* MJD */
2915 while (isDIGIT(*RExC_parse))
2918 if (!SIZE_ONLY && num > RExC_rx->nparens)
2919 vFAIL("Reference to nonexistent group");
2921 ret = reganode(pRExC_state, FOLD
2922 ? (LOC ? REFFL : REFF)
2926 /* override incorrect value set in reganode MJD */
2927 Set_Node_Offset(ret, parse_start+1);
2928 Set_Node_Cur_Length(ret); /* MJD */
2930 nextchar(pRExC_state);
2935 if (RExC_parse >= RExC_end)
2936 FAIL("Trailing \\");
2939 /* Do not generate `unrecognized' warnings here, we fall
2940 back into the quick-grab loop below */
2946 if (RExC_flags16 & PMf_EXTENDED) {
2947 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2948 if (RExC_parse < RExC_end)
2954 register STRLEN len;
2960 parse_start = RExC_parse - 1;
2965 ret = reg_node(pRExC_state, FOLD
2966 ? (LOC ? EXACTFL : EXACTF)
2969 for (len = 0, p = RExC_parse - 1;
2970 len < 127 && p < RExC_end;
2975 if (RExC_flags16 & PMf_EXTENDED)
2976 p = regwhite(p, RExC_end);
3021 ender = ASCII_TO_NATIVE('\033');
3025 ender = ASCII_TO_NATIVE('\007');
3030 char* e = strchr(p, '}');
3034 vFAIL("Missing right brace on \\x{}");
3037 numlen = 1; /* allow underscores */
3038 ender = (UV)scan_hex(p + 1, e - p - 1, &numlen);
3041 /* numlen is generous */
3042 if (numlen + len >= 127) {
3050 numlen = 0; /* disallow underscores */
3051 ender = (UV)scan_hex(p, 2, &numlen);
3057 ender = UCHARAT(p++);
3058 ender = toCTRL(ender);
3060 case '0': case '1': case '2': case '3':case '4':
3061 case '5': case '6': case '7': case '8':case '9':
3063 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
3064 numlen = 0; /* disallow underscores */
3065 ender = (UV)scan_oct(p, 3, &numlen);
3075 FAIL("Trailing \\");
3078 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
3079 vWARN2(p +1, "Unrecognized escape \\%c passed through", *p);
3080 goto normal_default;
3085 if (UTF8_IS_START(*p) && UTF) {
3086 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3094 if (RExC_flags16 & PMf_EXTENDED)
3095 p = regwhite(p, RExC_end);
3098 ender = toLOWER_LC_uvchr(ender);
3100 ender = toLOWER_uni(ender);
3102 if (ISMULT2(p)) { /* Back off on ?+*. */
3105 else if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3106 reguni(pRExC_state, ender, s, &numlen);
3116 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3117 reguni(pRExC_state, ender, s, &numlen);
3126 Set_Node_Cur_Length(ret); /* MJD */
3127 nextchar(pRExC_state);
3129 /* len is STRLEN which is unsigned, need to copy to signed */
3132 vFAIL("Internal disaster");
3141 RExC_size += STR_SZ(len);
3143 RExC_emit += STR_SZ(len);
3152 S_regwhite(pTHX_ char *p, char *e)
3157 else if (*p == '#') {
3160 } while (p < e && *p != '\n');
3168 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3169 Character classes ([:foo:]) can also be negated ([:^foo:]).
3170 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3171 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3172 but trigger warnings because they are currently unimplemented. */
3174 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3177 I32 namedclass = OOB_NAMEDCLASS;
3179 if (value == '[' && RExC_parse + 1 < RExC_end &&
3180 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3181 (*RExC_parse == ':' ||
3182 *RExC_parse == '=' ||
3183 *RExC_parse == '.')) {
3184 char c = *RExC_parse;
3185 char* s = RExC_parse++;
3187 while (RExC_parse < RExC_end && *RExC_parse != c)
3189 if (RExC_parse == RExC_end)
3190 /* Grandfather lone [:, [=, [. */
3193 char* t = RExC_parse++; /* skip over the c */
3195 if (*RExC_parse == ']') {
3196 RExC_parse++; /* skip over the ending ] */
3199 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3200 I32 skip = 5; /* the most common skip */
3204 if (strnEQ(posixcc, "alnum", 5))
3206 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3207 else if (strnEQ(posixcc, "alpha", 5))
3209 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3210 else if (strnEQ(posixcc, "ascii", 5))
3212 complement ? ANYOF_NASCII : ANYOF_ASCII;
3215 if (strnEQ(posixcc, "blank", 5))
3217 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3220 if (strnEQ(posixcc, "cntrl", 5))
3222 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3225 if (strnEQ(posixcc, "digit", 5))
3227 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3230 if (strnEQ(posixcc, "graph", 5))
3232 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3235 if (strnEQ(posixcc, "lower", 5))
3237 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3240 if (strnEQ(posixcc, "print", 5))
3242 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3243 else if (strnEQ(posixcc, "punct", 5))
3245 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3248 if (strnEQ(posixcc, "space", 5))
3250 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3253 if (strnEQ(posixcc, "upper", 5))
3255 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3257 case 'w': /* this is not POSIX, this is the Perl \w */
3258 if (strnEQ(posixcc, "word", 4)) {
3260 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3265 if (strnEQ(posixcc, "xdigit", 6)) {
3267 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3272 if (namedclass == OOB_NAMEDCLASS ||
3273 posixcc[skip] != ':' ||
3274 posixcc[skip+1] != ']')
3276 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3279 } else if (!SIZE_ONLY) {
3280 /* [[=foo=]] and [[.foo.]] are still future. */
3282 /* adjust RExC_parse so the warning shows after
3284 while (*RExC_parse && *RExC_parse != ']')
3286 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3289 /* Maternal grandfather:
3290 * "[:" ending in ":" but not in ":]" */
3300 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3302 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3303 (*RExC_parse == ':' ||
3304 *RExC_parse == '=' ||
3305 *RExC_parse == '.')) {
3306 char *s = RExC_parse;
3309 while(*s && isALNUM(*s))
3311 if (*s && c == *s && s[1] == ']') {
3312 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3314 /* [[=foo=]] and [[.foo.]] are still future. */
3315 if (c == '=' || c == '.')
3317 /* adjust RExC_parse so the error shows after
3319 while (*RExC_parse && *RExC_parse++ != ']')
3321 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3328 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3331 register IV prevvalue = OOB_UNICODE;
3332 register IV range = 0;
3333 register regnode *ret;
3336 char *rangebegin = 0;
3337 bool need_class = 0;
3338 SV *listsv = Nullsv;
3341 bool optimize_invert = TRUE;
3343 ret = reganode(pRExC_state, ANYOF, 0);
3346 ANYOF_FLAGS(ret) = 0;
3348 if (*RExC_parse == '^') { /* Complement of range. */
3352 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3356 RExC_size += ANYOF_SKIP;
3358 RExC_emit += ANYOF_SKIP;
3360 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3362 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3363 ANYOF_BITMAP_ZERO(ret);
3364 listsv = newSVpvn("# comment\n", 10);
3367 if (!SIZE_ONLY && ckWARN(WARN_REGEXP))
3368 checkposixcc(pRExC_state);
3370 if (*RExC_parse == ']' || *RExC_parse == '-')
3371 goto charclassloop; /* allow 1st char to be ] or - */
3373 while (RExC_parse < RExC_end && *RExC_parse != ']') {
3377 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3380 rangebegin = RExC_parse;
3382 value = utf8n_to_uvchr((U8*)RExC_parse,
3383 RExC_end - RExC_parse,
3385 RExC_parse += numlen;
3388 value = UCHARAT(RExC_parse++);
3390 namedclass = regpposixcc(pRExC_state, value);
3391 else if (value == '\\') {
3393 value = utf8n_to_uvchr((U8*)RExC_parse,
3394 RExC_end - RExC_parse,
3396 RExC_parse += numlen;
3399 value = UCHARAT(RExC_parse++);
3400 /* Some compilers cannot handle switching on 64-bit integer
3401 * values, therefore value cannot be an UV. Yes, this will
3402 * be a problem later if we want switch on Unicode.
3403 * A similar issue a little bit later when switching on
3404 * namedclass. --jhi */
3405 switch ((I32)value) {
3406 case 'w': namedclass = ANYOF_ALNUM; break;
3407 case 'W': namedclass = ANYOF_NALNUM; break;
3408 case 's': namedclass = ANYOF_SPACE; break;
3409 case 'S': namedclass = ANYOF_NSPACE; break;
3410 case 'd': namedclass = ANYOF_DIGIT; break;
3411 case 'D': namedclass = ANYOF_NDIGIT; break;
3414 if (*RExC_parse == '{') {
3415 e = strchr(RExC_parse++, '}');
3417 vFAIL("Missing right brace on \\p{}");
3426 Perl_sv_catpvf(aTHX_ listsv,
3427 "+utf8::%.*s\n", (int)n, RExC_parse);
3429 Perl_sv_catpvf(aTHX_ listsv,
3430 "!utf8::%.*s\n", (int)n, RExC_parse);
3433 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3435 case 'n': value = '\n'; break;
3436 case 'r': value = '\r'; break;
3437 case 't': value = '\t'; break;
3438 case 'f': value = '\f'; break;
3439 case 'b': value = '\b'; break;
3440 case 'e': value = ASCII_TO_NATIVE('\033');break;
3441 case 'a': value = ASCII_TO_NATIVE('\007');break;
3443 if (*RExC_parse == '{') {
3444 e = strchr(RExC_parse++, '}');
3446 vFAIL("Missing right brace on \\x{}");
3447 numlen = 1; /* allow underscores */
3448 value = (UV)scan_hex(RExC_parse,
3454 numlen = 0; /* disallow underscores */
3455 value = (UV)scan_hex(RExC_parse, 2, &numlen);
3456 RExC_parse += numlen;
3460 value = UCHARAT(RExC_parse++);
3461 value = toCTRL(value);
3463 case '0': case '1': case '2': case '3': case '4':
3464 case '5': case '6': case '7': case '8': case '9':
3465 numlen = 0; /* disallow underscores */
3466 value = (UV)scan_oct(--RExC_parse, 3, &numlen);
3467 RExC_parse += numlen;
3470 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3472 "Unrecognized escape \\%c in character class passed through",
3476 } /* end of \blah */
3478 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3480 if (!SIZE_ONLY && !need_class)
3481 ANYOF_CLASS_ZERO(ret);
3485 /* a bad range like a-\d, a-[:digit:] ? */
3488 if (ckWARN(WARN_REGEXP))
3490 "False [] range \"%*.*s\"",
3491 RExC_parse - rangebegin,
3492 RExC_parse - rangebegin,
3494 if (prevvalue < 256) {
3495 ANYOF_BITMAP_SET(ret, prevvalue);
3496 ANYOF_BITMAP_SET(ret, '-');
3499 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3500 Perl_sv_catpvf(aTHX_ listsv,
3501 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
3505 range = 0; /* this was not a true range */
3509 if (namedclass > OOB_NAMEDCLASS)
3510 optimize_invert = FALSE;
3511 /* Possible truncation here but in some 64-bit environments
3512 * the compiler gets heartburn about switch on 64-bit values.
3513 * A similar issue a little earlier when switching on value.
3515 switch ((I32)namedclass) {
3518 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3520 for (value = 0; value < 256; value++)
3522 ANYOF_BITMAP_SET(ret, value);
3524 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3528 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3530 for (value = 0; value < 256; value++)
3531 if (!isALNUM(value))
3532 ANYOF_BITMAP_SET(ret, value);
3534 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3538 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3540 for (value = 0; value < 256; value++)
3541 if (isALNUMC(value))
3542 ANYOF_BITMAP_SET(ret, value);
3544 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3548 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3550 for (value = 0; value < 256; value++)
3551 if (!isALNUMC(value))
3552 ANYOF_BITMAP_SET(ret, value);
3554 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3558 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3560 for (value = 0; value < 256; value++)
3562 ANYOF_BITMAP_SET(ret, value);
3564 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3568 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3570 for (value = 0; value < 256; value++)
3571 if (!isALPHA(value))
3572 ANYOF_BITMAP_SET(ret, value);
3574 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3578 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3581 for (value = 0; value < 128; value++)
3582 ANYOF_BITMAP_SET(ret, value);
3584 for (value = 0; value < 256; value++) {
3586 ANYOF_BITMAP_SET(ret, value);
3590 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3594 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3597 for (value = 128; value < 256; value++)
3598 ANYOF_BITMAP_SET(ret, value);
3600 for (value = 0; value < 256; value++) {
3601 if (!isASCII(value))
3602 ANYOF_BITMAP_SET(ret, value);
3606 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3610 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3612 for (value = 0; value < 256; value++)
3614 ANYOF_BITMAP_SET(ret, value);
3616 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3620 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3622 for (value = 0; value < 256; value++)
3623 if (!isBLANK(value))
3624 ANYOF_BITMAP_SET(ret, value);
3626 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3630 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3632 for (value = 0; value < 256; value++)
3634 ANYOF_BITMAP_SET(ret, value);
3636 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3640 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3642 for (value = 0; value < 256; value++)
3643 if (!isCNTRL(value))
3644 ANYOF_BITMAP_SET(ret, value);
3646 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3650 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3652 /* consecutive digits assumed */
3653 for (value = '0'; value <= '9'; value++)
3654 ANYOF_BITMAP_SET(ret, value);
3656 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3660 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3662 /* consecutive digits assumed */
3663 for (value = 0; value < '0'; value++)
3664 ANYOF_BITMAP_SET(ret, value);
3665 for (value = '9' + 1; value < 256; value++)
3666 ANYOF_BITMAP_SET(ret, value);
3668 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3672 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3674 for (value = 0; value < 256; value++)
3676 ANYOF_BITMAP_SET(ret, value);
3678 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3682 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3684 for (value = 0; value < 256; value++)
3685 if (!isGRAPH(value))
3686 ANYOF_BITMAP_SET(ret, value);
3688 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3692 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3694 for (value = 0; value < 256; value++)
3696 ANYOF_BITMAP_SET(ret, value);
3698 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3702 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3704 for (value = 0; value < 256; value++)
3705 if (!isLOWER(value))
3706 ANYOF_BITMAP_SET(ret, value);
3708 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3712 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3714 for (value = 0; value < 256; value++)
3716 ANYOF_BITMAP_SET(ret, value);
3718 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3722 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3724 for (value = 0; value < 256; value++)
3725 if (!isPRINT(value))
3726 ANYOF_BITMAP_SET(ret, value);
3728 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3732 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3734 for (value = 0; value < 256; value++)
3735 if (isPSXSPC(value))
3736 ANYOF_BITMAP_SET(ret, value);
3738 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3742 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3744 for (value = 0; value < 256; value++)
3745 if (!isPSXSPC(value))
3746 ANYOF_BITMAP_SET(ret, value);
3748 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3752 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3754 for (value = 0; value < 256; value++)
3756 ANYOF_BITMAP_SET(ret, value);
3758 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3762 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3764 for (value = 0; value < 256; value++)
3765 if (!isPUNCT(value))
3766 ANYOF_BITMAP_SET(ret, value);
3768 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3772 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3774 for (value = 0; value < 256; value++)
3776 ANYOF_BITMAP_SET(ret, value);
3778 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3782 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3784 for (value = 0; value < 256; value++)
3785 if (!isSPACE(value))
3786 ANYOF_BITMAP_SET(ret, value);
3788 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3792 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3794 for (value = 0; value < 256; value++)
3796 ANYOF_BITMAP_SET(ret, value);
3798 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3802 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3804 for (value = 0; value < 256; value++)
3805 if (!isUPPER(value))
3806 ANYOF_BITMAP_SET(ret, value);
3808 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3812 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3814 for (value = 0; value < 256; value++)
3815 if (isXDIGIT(value))
3816 ANYOF_BITMAP_SET(ret, value);
3818 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3822 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3824 for (value = 0; value < 256; value++)
3825 if (!isXDIGIT(value))
3826 ANYOF_BITMAP_SET(ret, value);
3828 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3831 vFAIL("Invalid [::] class");
3835 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3838 } /* end of namedclass \blah */
3841 if (prevvalue > value) /* b-a */ {
3842 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3843 RExC_parse - rangebegin,
3844 RExC_parse - rangebegin,
3846 range = 0; /* not a valid range */
3850 prevvalue = value; /* save the beginning of the range */
3851 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3852 RExC_parse[1] != ']') {
3855 /* a bad range like \w-, [:word:]- ? */
3856 if (namedclass > OOB_NAMEDCLASS) {
3857 if (ckWARN(WARN_REGEXP))
3859 "False [] range \"%*.*s\"",
3860 RExC_parse - rangebegin,
3861 RExC_parse - rangebegin,
3864 ANYOF_BITMAP_SET(ret, '-');
3866 range = 1; /* yeah, it's a range! */
3867 continue; /* but do it the next time */
3871 /* now is the next time */
3875 if (prevvalue < 256) {
3876 IV ceilvalue = value < 256 ? value : 255;
3879 if ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
3880 (isUPPER(prevvalue) && isUPPER(ceilvalue)))
3882 if (isLOWER(prevvalue)) {
3883 for (i = prevvalue; i <= ceilvalue; i++)
3885 ANYOF_BITMAP_SET(ret, i);
3887 for (i = prevvalue; i <= ceilvalue; i++)
3889 ANYOF_BITMAP_SET(ret, i);
3894 for (i = prevvalue; i <= ceilvalue; i++)
3895 ANYOF_BITMAP_SET(ret, i);
3898 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3899 if (prevvalue < value)
3900 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3901 (UV)prevvalue, (UV)value);
3902 else if (prevvalue == value)
3903 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3908 range = 0; /* this range (if it was one) is done now */
3912 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
3914 RExC_size += ANYOF_CLASS_ADD_SKIP;
3916 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3919 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3921 /* If the only flag is folding (plus possibly inversion). */
3922 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
3924 for (value = 0; value < 256; ++value) {
3925 if (ANYOF_BITMAP_TEST(ret, value)) {
3926 IV fold = PL_fold[value];
3929 ANYOF_BITMAP_SET(ret, fold);
3932 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
3935 /* optimize inverted simple patterns (e.g. [^a-z]) */
3936 if (!SIZE_ONLY && optimize_invert &&
3937 /* If the only flag is inversion. */
3938 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
3939 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
3940 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
3941 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
3948 av_store(av, 0, listsv);
3949 av_store(av, 1, NULL);
3950 rv = newRV_noinc((SV*)av);
3951 n = add_data(pRExC_state, 1, "s");
3952 RExC_rx->data->data[n] = (void*)rv;
3960 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
3962 char* retval = RExC_parse++;
3965 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
3966 RExC_parse[2] == '#') {
3967 while (*RExC_parse && *RExC_parse != ')')
3972 if (RExC_flags16 & PMf_EXTENDED) {
3973 if (isSPACE(*RExC_parse)) {
3977 else if (*RExC_parse == '#') {
3978 while (*RExC_parse && *RExC_parse != '\n')
3989 - reg_node - emit a node
3991 STATIC regnode * /* Location. */
3992 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
3994 register regnode *ret;
3995 register regnode *ptr;
3999 SIZE_ALIGN(RExC_size);
4004 NODE_ALIGN_FILL(ret);
4006 FILL_ADVANCE_NODE(ptr, op);
4007 if (RExC_offsets) { /* MJD */
4008 MJD_OFFSET_DEBUG((stderr, "%s:%u: (op %s) %s %u <- %u (len %u) (max %u).\n",
4009 "reg_node", __LINE__,
4011 RExC_emit - RExC_emit_start > RExC_offsets[0]
4012 ? "Overwriting end of array!\n" : "OK",
4013 RExC_emit - RExC_emit_start,
4014 RExC_parse - RExC_start,
4016 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
4025 - reganode - emit a node with an argument
4027 STATIC regnode * /* Location. */
4028 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4030 register regnode *ret;
4031 register regnode *ptr;
4035 SIZE_ALIGN(RExC_size);
4040 NODE_ALIGN_FILL(ret);
4042 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
4043 if (RExC_offsets) { /* MJD */
4044 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4046 RExC_emit - RExC_emit_start > RExC_offsets[0] ?
4047 "Overwriting end of array!\n" : "OK",
4048 RExC_emit - RExC_emit_start,
4049 RExC_parse - RExC_start,
4051 Set_Cur_Node_Offset;
4060 - reguni - emit (if appropriate) a Unicode character
4063 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
4065 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4069 - reginsert - insert an operator in front of already-emitted operand
4071 * Means relocating the operand.
4074 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4076 register regnode *src;
4077 register regnode *dst;
4078 register regnode *place;
4079 register int offset = regarglen[(U8)op];
4081 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4084 RExC_size += NODE_STEP_REGNODE + offset;
4089 RExC_emit += NODE_STEP_REGNODE + offset;
4091 while (src > opnd) {
4092 StructCopy(--src, --dst, regnode);
4093 if (RExC_offsets) { /* MJD 20010112 */
4094 MJD_OFFSET_DEBUG((stderr, "%s: %s copy %u -> %u (max %u).\n",
4096 dst - RExC_emit_start > RExC_offsets[0]
4097 ? "Overwriting end of array!\n" : "OK",
4098 src - RExC_emit_start,
4099 dst - RExC_emit_start,
4101 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
4102 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
4107 place = opnd; /* Op node, where operand used to be. */
4108 if (RExC_offsets) { /* MJD */
4109 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4111 place - RExC_emit_start > RExC_offsets[0]
4112 ? "Overwriting end of array!\n" : "OK",
4113 place - RExC_emit_start,
4114 RExC_parse - RExC_start,
4116 Set_Node_Offset(place, RExC_parse);
4118 src = NEXTOPER(place);
4119 FILL_ADVANCE_NODE(place, op);
4120 Zero(src, offset, regnode);
4124 - regtail - set the next-pointer at the end of a node chain of p to val.
4127 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4129 register regnode *scan;
4130 register regnode *temp;
4135 /* Find last node. */
4138 temp = regnext(scan);
4144 if (reg_off_by_arg[OP(scan)]) {
4145 ARG_SET(scan, val - scan);
4148 NEXT_OFF(scan) = val - scan;
4153 - regoptail - regtail on operand of first argument; nop if operandless
4156 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4158 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4159 if (p == NULL || SIZE_ONLY)
4161 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4162 regtail(pRExC_state, NEXTOPER(p), val);
4164 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4165 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4172 - regcurly - a little FSA that accepts {\d+,?\d*}
4175 S_regcurly(pTHX_ register char *s)
4196 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4198 register U8 op = EXACT; /* Arbitrary non-END op. */
4199 register regnode *next;
4201 while (op != END && (!last || node < last)) {
4202 /* While that wasn't END last time... */
4208 next = regnext(node);
4210 if (OP(node) == OPTIMIZED)
4213 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4214 (int)(2*l + 1), "", SvPVX(sv));
4215 if (next == NULL) /* Next ptr. */
4216 PerlIO_printf(Perl_debug_log, "(0)");
4218 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4219 (void)PerlIO_putc(Perl_debug_log, '\n');
4221 if (PL_regkind[(U8)op] == BRANCHJ) {
4222 register regnode *nnode = (OP(next) == LONGJMP
4225 if (last && nnode > last)
4227 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4229 else if (PL_regkind[(U8)op] == BRANCH) {
4230 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4232 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4233 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4234 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4236 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4237 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4240 else if ( op == PLUS || op == STAR) {
4241 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4243 else if (op == ANYOF) {
4244 /* arglen 1 + class block */
4245 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
4246 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
4247 node = NEXTOPER(node);
4249 else if (PL_regkind[(U8)op] == EXACT) {
4250 /* Literal string, where present. */
4251 node += NODE_SZ_STR(node) - 1;
4252 node = NEXTOPER(node);
4255 node = NEXTOPER(node);
4256 node += regarglen[(U8)op];
4258 if (op == CURLYX || op == OPEN)
4260 else if (op == WHILEM)
4266 #endif /* DEBUGGING */
4269 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4272 Perl_regdump(pTHX_ regexp *r)
4275 SV *sv = sv_newmortal();
4277 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4279 /* Header fields of interest. */
4280 if (r->anchored_substr)
4281 PerlIO_printf(Perl_debug_log,
4282 "anchored `%s%.*s%s'%s at %"IVdf" ",
4284 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4285 SvPVX(r->anchored_substr),
4287 SvTAIL(r->anchored_substr) ? "$" : "",
4288 (IV)r->anchored_offset);
4289 if (r->float_substr)
4290 PerlIO_printf(Perl_debug_log,
4291 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4293 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4294 SvPVX(r->float_substr),
4296 SvTAIL(r->float_substr) ? "$" : "",
4297 (IV)r->float_min_offset, (UV)r->float_max_offset);
4298 if (r->check_substr)
4299 PerlIO_printf(Perl_debug_log,
4300 r->check_substr == r->float_substr
4301 ? "(checking floating" : "(checking anchored");
4302 if (r->reganch & ROPT_NOSCAN)
4303 PerlIO_printf(Perl_debug_log, " noscan");
4304 if (r->reganch & ROPT_CHECK_ALL)
4305 PerlIO_printf(Perl_debug_log, " isall");
4306 if (r->check_substr)
4307 PerlIO_printf(Perl_debug_log, ") ");
4309 if (r->regstclass) {
4310 regprop(sv, r->regstclass);
4311 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4313 if (r->reganch & ROPT_ANCH) {
4314 PerlIO_printf(Perl_debug_log, "anchored");
4315 if (r->reganch & ROPT_ANCH_BOL)
4316 PerlIO_printf(Perl_debug_log, "(BOL)");
4317 if (r->reganch & ROPT_ANCH_MBOL)
4318 PerlIO_printf(Perl_debug_log, "(MBOL)");
4319 if (r->reganch & ROPT_ANCH_SBOL)
4320 PerlIO_printf(Perl_debug_log, "(SBOL)");
4321 if (r->reganch & ROPT_ANCH_GPOS)
4322 PerlIO_printf(Perl_debug_log, "(GPOS)");
4323 PerlIO_putc(Perl_debug_log, ' ');
4325 if (r->reganch & ROPT_GPOS_SEEN)
4326 PerlIO_printf(Perl_debug_log, "GPOS ");
4327 if (r->reganch & ROPT_SKIP)
4328 PerlIO_printf(Perl_debug_log, "plus ");
4329 if (r->reganch & ROPT_IMPLICIT)
4330 PerlIO_printf(Perl_debug_log, "implicit ");
4331 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4332 if (r->reganch & ROPT_EVAL_SEEN)
4333 PerlIO_printf(Perl_debug_log, "with eval ");
4334 PerlIO_printf(Perl_debug_log, "\n");
4337 U32 len = r->offsets[0];
4338 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4339 for (i = 1; i <= len; i++)
4340 PerlIO_printf(Perl_debug_log, "%"UVuf"[%"UVuf"] ",
4341 (UV)r->offsets[i*2-1],
4342 (UV)r->offsets[i*2]);
4343 PerlIO_printf(Perl_debug_log, "\n");
4345 #endif /* DEBUGGING */
4351 S_put_byte(pTHX_ SV *sv, int c)
4353 if (isCNTRL(c) || c == 255 || !isPRINT(c))
4354 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4355 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4356 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4358 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4361 #endif /* DEBUGGING */
4364 - regprop - printable representation of opcode
4367 Perl_regprop(pTHX_ SV *sv, regnode *o)
4372 sv_setpvn(sv, "", 0);
4373 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4374 /* It would be nice to FAIL() here, but this may be called from
4375 regexec.c, and it would be hard to supply pRExC_state. */
4376 Perl_croak(aTHX_ "Corrupted regexp opcode");
4377 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4379 k = PL_regkind[(U8)OP(o)];
4382 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0],
4383 STR_LEN(o), STRING(o), PL_colors[1]);
4384 else if (k == CURLY) {
4385 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4386 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4387 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4389 else if (k == WHILEM && o->flags) /* Ordinal/of */
4390 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4391 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4392 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4393 else if (k == LOGICAL)
4394 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4395 else if (k == ANYOF) {
4396 int i, rangestart = -1;
4397 U8 flags = ANYOF_FLAGS(o);
4398 const char * const anyofs[] = { /* Should be syncronized with
4399 * ANYOF_ #xdefines in regcomp.h */
4432 if (flags & ANYOF_LOCALE)
4433 sv_catpv(sv, "{loc}");
4434 if (flags & ANYOF_FOLD)
4435 sv_catpv(sv, "{i}");
4436 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4437 if (flags & ANYOF_INVERT)
4439 for (i = 0; i <= 256; i++) {
4440 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4441 if (rangestart == -1)
4443 } else if (rangestart != -1) {
4444 if (i <= rangestart + 3)
4445 for (; rangestart < i; rangestart++)
4446 put_byte(sv, rangestart);
4448 put_byte(sv, rangestart);
4450 put_byte(sv, i - 1);
4456 if (o->flags & ANYOF_CLASS)
4457 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4458 if (ANYOF_CLASS_TEST(o,i))
4459 sv_catpv(sv, anyofs[i]);
4461 if (flags & ANYOF_UNICODE)
4462 sv_catpv(sv, "{unicode}");
4463 else if (flags & ANYOF_UNICODE_ALL)
4464 sv_catpv(sv, "{all-unicode}");
4468 SV *sw = regclass_swash(o, FALSE, &lv);
4473 U8 s[UTF8_MAXLEN+1];
4475 for (i = 0; i <= 256; i++) { /* just the first 256 */
4476 U8 *e = uvchr_to_utf8(s, i);
4478 if (i < 256 && swash_fetch(sw, s, TRUE)) {
4479 if (rangestart == -1)
4481 } else if (rangestart != -1) {
4484 if (i <= rangestart + 3)
4485 for (; rangestart < i; rangestart++) {
4486 for(e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4490 for (e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4493 for (e = uvchr_to_utf8(s, i - 1), p = s; p < e; p++)
4500 sv_catpv(sv, "..."); /* et cetera */
4504 char *s = savepv(SvPVX(lv));
4507 while(*s && *s != '\n') s++;
4528 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4530 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4531 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4532 #endif /* DEBUGGING */
4536 Perl_re_intuit_string(pTHX_ regexp *prog)
4537 { /* Assume that RE_INTUIT is set */
4540 char *s = SvPV(prog->check_substr,n_a);
4542 if (!PL_colorset) reginitcolors();
4543 PerlIO_printf(Perl_debug_log,
4544 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4545 PL_colors[4],PL_colors[5],PL_colors[0],
4548 (strlen(s) > 60 ? "..." : ""));
4551 return prog->check_substr;
4555 Perl_pregfree(pTHX_ struct regexp *r)
4557 DEBUG_r(if (!PL_colorset) reginitcolors());
4559 if (!r || (--r->refcnt > 0))
4561 DEBUG_r(PerlIO_printf(Perl_debug_log,
4562 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4563 PL_colors[4],PL_colors[5],PL_colors[0],
4566 (strlen(r->precomp) > 60 ? "..." : "")));
4569 Safefree(r->precomp);
4570 if (r->offsets) /* 20010421 MJD */
4571 Safefree(r->offsets);
4572 if (RX_MATCH_COPIED(r))
4573 Safefree(r->subbeg);
4575 if (r->anchored_substr)
4576 SvREFCNT_dec(r->anchored_substr);
4577 if (r->float_substr)
4578 SvREFCNT_dec(r->float_substr);
4579 Safefree(r->substrs);
4582 int n = r->data->count;
4583 AV* new_comppad = NULL;
4588 /* If you add a ->what type here, update the comment in regcomp.h */
4589 switch (r->data->what[n]) {
4591 SvREFCNT_dec((SV*)r->data->data[n]);
4594 Safefree(r->data->data[n]);
4597 new_comppad = (AV*)r->data->data[n];
4600 if (new_comppad == NULL)
4601 Perl_croak(aTHX_ "panic: pregfree comppad");
4602 old_comppad = PL_comppad;
4603 old_curpad = PL_curpad;
4604 /* Watch out for global destruction's random ordering. */
4605 if (SvTYPE(new_comppad) == SVt_PVAV) {
4606 PL_comppad = new_comppad;
4607 PL_curpad = AvARRAY(new_comppad);
4612 if (!OpREFCNT_dec((OP_4tree*)r->data->data[n])) {
4613 op_free((OP_4tree*)r->data->data[n]);
4616 PL_comppad = old_comppad;
4617 PL_curpad = old_curpad;
4618 SvREFCNT_dec((SV*)new_comppad);
4624 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4627 Safefree(r->data->what);
4630 Safefree(r->startp);
4636 - regnext - dig the "next" pointer out of a node
4638 * [Note, when REGALIGN is defined there are two places in regmatch()
4639 * that bypass this code for speed.]
4642 Perl_regnext(pTHX_ register regnode *p)
4644 register I32 offset;
4646 if (p == &PL_regdummy)
4649 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4657 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4660 STRLEN l1 = strlen(pat1);
4661 STRLEN l2 = strlen(pat2);
4670 Copy(pat1, buf, l1 , char);
4671 Copy(pat2, buf + l1, l2 , char);
4672 buf[l1 + l2] = '\n';
4673 buf[l1 + l2 + 1] = '\0';
4675 /* ANSI variant takes additional second argument */
4676 va_start(args, pat2);
4680 msv = vmess(buf, &args);
4682 message = SvPV(msv,l1);
4685 Copy(message, buf, l1 , char);
4686 buf[l1] = '\0'; /* Overwrite \n */
4687 Perl_croak(aTHX_ "%s", buf);
4690 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4693 Perl_save_re_context(pTHX)
4696 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4697 SAVEI32(RExC_npar); /* () count. */
4698 SAVEI32(RExC_size); /* Code size. */
4699 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4700 SAVEVPTR(RExC_rx); /* from regcomp.c */
4701 SAVEI32(RExC_seen); /* from regcomp.c */
4702 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4703 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4704 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4705 SAVEPPTR(RExC_end); /* End of input for compile */
4706 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4709 SAVEI32(PL_reg_flags); /* from regexec.c */
4711 SAVEPPTR(PL_reginput); /* String-input pointer. */
4712 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4713 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4714 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4715 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4716 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4717 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4718 SAVEGENERICPV(PL_reg_start_tmp); /* from regexec.c */
4719 PL_reg_start_tmp = 0;
4720 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4721 PL_reg_start_tmpl = 0;
4722 SAVEVPTR(PL_regdata);
4723 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4724 SAVEI32(PL_regnarrate); /* from regexec.c */
4725 SAVEVPTR(PL_regprogram); /* from regexec.c */
4726 SAVEINT(PL_regindent); /* from regexec.c */
4727 SAVEVPTR(PL_regcc); /* from regexec.c */
4728 SAVEVPTR(PL_curcop);
4729 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4730 SAVEVPTR(PL_reg_re); /* from regexec.c */
4731 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4732 SAVESPTR(PL_reg_sv); /* from regexec.c */
4733 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4734 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4735 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4736 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4737 SAVEI32(PL_regnpar); /* () count. */
4738 SAVEI32(PL_regsize); /* from regexec.c */
4740 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4751 clear_re(pTHXo_ void *r)
4753 ReREFCNT_dec((regexp *)r);
projects / p5sagit/p5-mst-13.2.git / blob