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 #ifndef PERL_IN_XSUB_RE
98 # if defined(BUGGY_MSC6)
99 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
100 # pragma optimize("a",off)
101 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
102 # pragma optimize("w",on )
103 # endif /* BUGGY_MSC6 */
107 #define STATIC static
110 typedef struct RExC_state_t {
111 U16 flags16; /* are we folding, multilining? */
112 char *precomp; /* uncompiled string. */
114 char *start; /* Start of input for compile */
115 char *end; /* End of input for compile */
116 char *parse; /* Input-scan pointer. */
117 I32 whilem_seen; /* number of WHILEM in this expr */
118 regnode *emit_start; /* Start of emitted-code area */
119 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
120 I32 naughty; /* How bad is this pattern? */
121 I32 sawback; /* Did we see \1, ...? */
123 I32 size; /* Code size. */
124 I32 npar; /* () count. */
130 char *starttry; /* -Dr: where regtry was called. */
131 #define RExC_starttry (pRExC_state->starttry)
135 #define RExC_flags16 (pRExC_state->flags16)
136 #define RExC_precomp (pRExC_state->precomp)
137 #define RExC_rx (pRExC_state->rx)
138 #define RExC_start (pRExC_state->start)
139 #define RExC_end (pRExC_state->end)
140 #define RExC_parse (pRExC_state->parse)
141 #define RExC_whilem_seen (pRExC_state->whilem_seen)
142 #define RExC_offsets (pRExC_state->rx->offsets) /* I am not like the others */
143 #define RExC_emit (pRExC_state->emit)
144 #define RExC_emit_start (pRExC_state->emit_start)
145 #define RExC_naughty (pRExC_state->naughty)
146 #define RExC_sawback (pRExC_state->sawback)
147 #define RExC_seen (pRExC_state->seen)
148 #define RExC_size (pRExC_state->size)
149 #define RExC_npar (pRExC_state->npar)
150 #define RExC_extralen (pRExC_state->extralen)
151 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
152 #define RExC_seen_evals (pRExC_state->seen_evals)
153 #define RExC_utf8 (pRExC_state->utf8)
155 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
156 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
157 ((*s) == '{' && regcurly(s)))
160 #undef SPSTART /* dratted cpp namespace... */
163 * Flags to be passed up and down.
165 #define WORST 0 /* Worst case. */
166 #define HASWIDTH 0x1 /* Known to match non-null strings. */
167 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
168 #define SPSTART 0x4 /* Starts with * or +. */
169 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
171 /* Length of a variant. */
173 typedef struct scan_data_t {
179 I32 last_end; /* min value, <0 unless valid. */
182 SV **longest; /* Either &l_fixed, or &l_float. */
186 I32 offset_float_min;
187 I32 offset_float_max;
191 struct regnode_charclass_class *start_class;
195 * Forward declarations for pregcomp()'s friends.
198 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
201 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
202 #define SF_BEFORE_SEOL 0x1
203 #define SF_BEFORE_MEOL 0x2
204 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
205 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
208 # define SF_FIX_SHIFT_EOL (0+2)
209 # define SF_FL_SHIFT_EOL (0+4)
211 # define SF_FIX_SHIFT_EOL (+2)
212 # define SF_FL_SHIFT_EOL (+4)
215 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
216 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
218 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
219 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
220 #define SF_IS_INF 0x40
221 #define SF_HAS_PAR 0x80
222 #define SF_IN_PAR 0x100
223 #define SF_HAS_EVAL 0x200
224 #define SCF_DO_SUBSTR 0x400
225 #define SCF_DO_STCLASS_AND 0x0800
226 #define SCF_DO_STCLASS_OR 0x1000
227 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
228 #define SCF_WHILEM_VISITED_POS 0x2000
230 #define UTF RExC_utf8
231 #define LOC (RExC_flags16 & PMf_LOCALE)
232 #define FOLD (RExC_flags16 & PMf_FOLD)
234 #define OOB_UNICODE 12345678
235 #define OOB_NAMEDCLASS -1
237 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
238 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
241 /* length of regex to show in messages that don't mark a position within */
242 #define RegexLengthToShowInErrorMessages 127
245 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
246 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
247 * op/pragma/warn/regcomp.
249 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
250 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
252 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
255 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
256 * arg. Show regex, up to a maximum length. If it's too long, chop and add
261 char *ellipses = ""; \
262 IV len = RExC_end - RExC_precomp; \
265 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
267 if (len > RegexLengthToShowInErrorMessages) { \
268 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
269 len = RegexLengthToShowInErrorMessages - 10; \
272 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
273 msg, (int)len, RExC_precomp, ellipses); \
277 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
278 * args. Show regex, up to a maximum length. If it's too long, chop and add
281 #define FAIL2(pat,msg) \
283 char *ellipses = ""; \
284 IV len = RExC_end - RExC_precomp; \
287 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
289 if (len > RegexLengthToShowInErrorMessages) { \
290 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
291 len = RegexLengthToShowInErrorMessages - 10; \
294 S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \
295 msg, (int)len, RExC_precomp, ellipses); \
300 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
302 #define Simple_vFAIL(m) \
304 IV offset = RExC_parse - RExC_precomp; \
306 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
307 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
311 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
316 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
321 * Like Simple_vFAIL(), but accepts two arguments.
323 #define Simple_vFAIL2(m,a1) \
325 IV offset = RExC_parse - RExC_precomp; \
327 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
328 (int)offset, RExC_precomp, RExC_precomp + offset); \
332 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
334 #define vFAIL2(m,a1) \
337 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
338 Simple_vFAIL2(m, a1); \
343 * Like Simple_vFAIL(), but accepts three arguments.
345 #define Simple_vFAIL3(m, a1, a2) \
347 IV offset = RExC_parse - RExC_precomp; \
349 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
350 (int)offset, RExC_precomp, RExC_precomp + offset); \
354 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
356 #define vFAIL3(m,a1,a2) \
359 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
360 Simple_vFAIL3(m, a1, a2); \
364 * Like Simple_vFAIL(), but accepts four arguments.
366 #define Simple_vFAIL4(m, a1, a2, a3) \
368 IV offset = RExC_parse - RExC_precomp; \
370 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3,\
371 (int)offset, RExC_precomp, RExC_precomp + offset); \
375 * Like Simple_vFAIL(), but accepts five arguments.
377 #define Simple_vFAIL5(m, a1, a2, a3, a4) \
379 IV offset = RExC_parse - RExC_precomp; \
380 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, a4,\
381 (int)offset, RExC_precomp, RExC_precomp + offset); \
385 #define vWARN(loc,m) \
387 IV offset = loc - RExC_precomp; \
388 Perl_warner(aTHX_ WARN_REGEXP, "%s" REPORT_LOCATION,\
389 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
392 #define vWARNdep(loc,m) \
394 IV offset = loc - RExC_precomp; \
395 int warn_cat = ckWARN(WARN_REGEXP) ? WARN_REGEXP : WARN_DEPRECATED; \
396 Perl_warner(aTHX_ warn_cat, "%s" REPORT_LOCATION,\
397 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
401 #define vWARN2(loc, m, a1) \
403 IV offset = loc - RExC_precomp; \
404 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
406 (int)offset, RExC_precomp, RExC_precomp + offset); \
409 #define vWARN3(loc, m, a1, a2) \
411 IV offset = loc - RExC_precomp; \
412 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
414 (int)offset, RExC_precomp, RExC_precomp + offset); \
417 #define vWARN4(loc, m, a1, a2, a3) \
419 IV offset = loc - RExC_precomp; \
420 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\
422 (int)offset, RExC_precomp, RExC_precomp + offset); \
425 /* used for the parse_flags section for (?c) -- japhy */
426 #define vWARN5(loc, m, a1, a2, a3, a4) \
428 IV offset = loc - RExC_precomp; \
429 Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \
431 (int)offset, RExC_precomp, RExC_precomp + offset); \
435 /* Allow for side effects in s */
436 #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (void)(s);} STMT_END
438 /* Macros for recording node offsets. 20001227 mjd@plover.com
439 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
440 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
441 * Element 0 holds the number n.
444 #define MJD_OFFSET_DEBUG(x)
445 /* #define MJD_OFFSET_DEBUG(x) fprintf x */
448 # define Set_Node_Offset_To_R(node,byte) \
452 Perl_croak(aTHX_ "value of node is %d in Offset macro", node); \
454 RExC_offsets[2*(node)-1] = (byte); \
459 # define Set_Node_Offset(node,byte) Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
460 # define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
462 # define Set_Node_Length_To_R(node,len) \
465 MJD_OFFSET_DEBUG((stderr, "** (%d) size of node %d is %d.\n", __LINE__, (node), (len))); \
467 Perl_croak(aTHX_ "value of node is %d in Length macro", node); \
469 RExC_offsets[2*(node)] = (len); \
474 # define Set_Node_Length(node,len) Set_Node_Length_To_R((node)-RExC_emit_start, len)
475 # define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
476 # define Set_Node_Cur_Length(node) Set_Node_Length(node, RExC_parse - parse_start)
478 /* Get offsets and lengths */
479 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
480 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
482 static void clear_re(pTHX_ void *r);
484 /* Mark that we cannot extend a found fixed substring at this point.
485 Updata the longest found anchored substring and the longest found
486 floating substrings if needed. */
489 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
491 STRLEN l = CHR_SVLEN(data->last_found);
492 STRLEN old_l = CHR_SVLEN(*data->longest);
494 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
495 sv_setsv(*data->longest, data->last_found);
496 if (*data->longest == data->longest_fixed) {
497 data->offset_fixed = l ? data->last_start_min : data->pos_min;
498 if (data->flags & SF_BEFORE_EOL)
500 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
502 data->flags &= ~SF_FIX_BEFORE_EOL;
505 data->offset_float_min = l ? data->last_start_min : data->pos_min;
506 data->offset_float_max = (l
507 ? data->last_start_max
508 : data->pos_min + data->pos_delta);
509 if (data->flags & SF_BEFORE_EOL)
511 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
513 data->flags &= ~SF_FL_BEFORE_EOL;
516 SvCUR_set(data->last_found, 0);
518 data->flags &= ~SF_BEFORE_EOL;
521 /* Can match anything (initialization) */
523 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
525 ANYOF_CLASS_ZERO(cl);
526 ANYOF_BITMAP_SETALL(cl);
527 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
529 cl->flags |= ANYOF_LOCALE;
532 /* Can match anything (initialization) */
534 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
538 for (value = 0; value <= ANYOF_MAX; value += 2)
539 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
541 if (!(cl->flags & ANYOF_UNICODE_ALL))
543 if (!ANYOF_BITMAP_TESTALLSET(cl))
548 /* Can match anything (initialization) */
550 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
552 Zero(cl, 1, struct regnode_charclass_class);
554 cl_anything(pRExC_state, cl);
558 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
560 Zero(cl, 1, struct regnode_charclass_class);
562 cl_anything(pRExC_state, cl);
564 cl->flags |= ANYOF_LOCALE;
567 /* 'And' a given class with another one. Can create false positives */
568 /* We assume that cl is not inverted */
570 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
571 struct regnode_charclass_class *and_with)
573 if (!(and_with->flags & ANYOF_CLASS)
574 && !(cl->flags & ANYOF_CLASS)
575 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
576 && !(and_with->flags & ANYOF_FOLD)
577 && !(cl->flags & ANYOF_FOLD)) {
580 if (and_with->flags & ANYOF_INVERT)
581 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
582 cl->bitmap[i] &= ~and_with->bitmap[i];
584 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
585 cl->bitmap[i] &= and_with->bitmap[i];
586 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
587 if (!(and_with->flags & ANYOF_EOS))
588 cl->flags &= ~ANYOF_EOS;
590 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE) {
591 cl->flags &= ~ANYOF_UNICODE_ALL;
592 cl->flags |= ANYOF_UNICODE;
593 ARG_SET(cl, ARG(and_with));
595 if (!(and_with->flags & ANYOF_UNICODE_ALL))
596 cl->flags &= ~ANYOF_UNICODE_ALL;
597 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)))
598 cl->flags &= ~ANYOF_UNICODE;
601 /* 'OR' a given class with another one. Can create false positives */
602 /* We assume that cl is not inverted */
604 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
606 if (or_with->flags & ANYOF_INVERT) {
608 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
609 * <= (B1 | !B2) | (CL1 | !CL2)
610 * which is wasteful if CL2 is small, but we ignore CL2:
611 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
612 * XXXX Can we handle case-fold? Unclear:
613 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
614 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
616 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
617 && !(or_with->flags & ANYOF_FOLD)
618 && !(cl->flags & ANYOF_FOLD) ) {
621 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
622 cl->bitmap[i] |= ~or_with->bitmap[i];
623 } /* XXXX: logic is complicated otherwise */
625 cl_anything(pRExC_state, cl);
628 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
629 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
630 && (!(or_with->flags & ANYOF_FOLD)
631 || (cl->flags & ANYOF_FOLD)) ) {
634 /* OR char bitmap and class bitmap separately */
635 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
636 cl->bitmap[i] |= or_with->bitmap[i];
637 if (or_with->flags & ANYOF_CLASS) {
638 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
639 cl->classflags[i] |= or_with->classflags[i];
640 cl->flags |= ANYOF_CLASS;
643 else { /* XXXX: logic is complicated, leave it along for a moment. */
644 cl_anything(pRExC_state, cl);
647 if (or_with->flags & ANYOF_EOS)
648 cl->flags |= ANYOF_EOS;
650 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
651 ARG(cl) != ARG(or_with)) {
652 cl->flags |= ANYOF_UNICODE_ALL;
653 cl->flags &= ~ANYOF_UNICODE;
655 if (or_with->flags & ANYOF_UNICODE_ALL) {
656 cl->flags |= ANYOF_UNICODE_ALL;
657 cl->flags &= ~ANYOF_UNICODE;
662 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
663 * These need to be revisited when a newer toolchain becomes available.
665 #if defined(__sparc64__) && defined(__GNUC__)
666 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
667 # undef SPARC64_GCC_WORKAROUND
668 # define SPARC64_GCC_WORKAROUND 1
672 /* REx optimizer. Converts nodes into quickier variants "in place".
673 Finds fixed substrings. */
675 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
676 to the position after last scanned or to NULL. */
679 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
680 /* scanp: Start here (read-write). */
681 /* deltap: Write maxlen-minlen here. */
682 /* last: Stop before this one. */
684 I32 min = 0, pars = 0, code;
685 regnode *scan = *scanp, *next;
687 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
688 int is_inf_internal = 0; /* The studied chunk is infinite */
689 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
690 scan_data_t data_fake;
691 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
693 while (scan && OP(scan) != END && scan < last) {
694 /* Peephole optimizer: */
696 if (PL_regkind[(U8)OP(scan)] == EXACT) {
697 /* Merge several consecutive EXACTish nodes into one. */
698 regnode *n = regnext(scan);
701 regnode *stop = scan;
704 next = scan + NODE_SZ_STR(scan);
705 /* Skip NOTHING, merge EXACT*. */
707 ( PL_regkind[(U8)OP(n)] == NOTHING ||
708 (stringok && (OP(n) == OP(scan))))
710 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
711 if (OP(n) == TAIL || n > next)
713 if (PL_regkind[(U8)OP(n)] == NOTHING) {
714 NEXT_OFF(scan) += NEXT_OFF(n);
715 next = n + NODE_STEP_REGNODE;
723 int oldl = STR_LEN(scan);
724 regnode *nnext = regnext(n);
726 if (oldl + STR_LEN(n) > U8_MAX)
728 NEXT_OFF(scan) += NEXT_OFF(n);
729 STR_LEN(scan) += STR_LEN(n);
730 next = n + NODE_SZ_STR(n);
731 /* Now we can overwrite *n : */
732 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
741 n = scan + NODE_SZ_STR(scan);
743 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
751 /* Follow the next-chain of the current node and optimize
752 away all the NOTHINGs from it. */
753 if (OP(scan) != CURLYX) {
754 int max = (reg_off_by_arg[OP(scan)]
756 /* I32 may be smaller than U16 on CRAYs! */
757 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
758 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
762 /* Skip NOTHING and LONGJMP. */
763 while ((n = regnext(n))
764 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
765 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
768 if (reg_off_by_arg[OP(scan)])
771 NEXT_OFF(scan) = off;
773 /* The principal pseudo-switch. Cannot be a switch, since we
774 look into several different things. */
775 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
776 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
777 next = regnext(scan);
780 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
781 I32 max1 = 0, min1 = I32_MAX, num = 0;
782 struct regnode_charclass_class accum;
784 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
785 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
786 if (flags & SCF_DO_STCLASS)
787 cl_init_zero(pRExC_state, &accum);
788 while (OP(scan) == code) {
789 I32 deltanext, minnext, f = 0, fake;
790 struct regnode_charclass_class this_class;
795 data_fake.whilem_c = data->whilem_c;
796 data_fake.last_closep = data->last_closep;
799 data_fake.last_closep = &fake;
800 next = regnext(scan);
801 scan = NEXTOPER(scan);
803 scan = NEXTOPER(scan);
804 if (flags & SCF_DO_STCLASS) {
805 cl_init(pRExC_state, &this_class);
806 data_fake.start_class = &this_class;
807 f = SCF_DO_STCLASS_AND;
809 if (flags & SCF_WHILEM_VISITED_POS)
810 f |= SCF_WHILEM_VISITED_POS;
811 /* we suppose the run is continuous, last=next...*/
812 minnext = study_chunk(pRExC_state, &scan, &deltanext,
813 next, &data_fake, f);
816 if (max1 < minnext + deltanext)
817 max1 = minnext + deltanext;
818 if (deltanext == I32_MAX)
819 is_inf = is_inf_internal = 1;
821 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
823 if (data && (data_fake.flags & SF_HAS_EVAL))
824 data->flags |= SF_HAS_EVAL;
826 data->whilem_c = data_fake.whilem_c;
827 if (flags & SCF_DO_STCLASS)
828 cl_or(pRExC_state, &accum, &this_class);
832 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
834 if (flags & SCF_DO_SUBSTR) {
835 data->pos_min += min1;
836 data->pos_delta += max1 - min1;
837 if (max1 != min1 || is_inf)
838 data->longest = &(data->longest_float);
841 delta += max1 - min1;
842 if (flags & SCF_DO_STCLASS_OR) {
843 cl_or(pRExC_state, data->start_class, &accum);
845 cl_and(data->start_class, &and_with);
846 flags &= ~SCF_DO_STCLASS;
849 else if (flags & SCF_DO_STCLASS_AND) {
851 cl_and(data->start_class, &accum);
852 flags &= ~SCF_DO_STCLASS;
855 /* Switch to OR mode: cache the old value of
856 * data->start_class */
857 StructCopy(data->start_class, &and_with,
858 struct regnode_charclass_class);
859 flags &= ~SCF_DO_STCLASS_AND;
860 StructCopy(&accum, data->start_class,
861 struct regnode_charclass_class);
862 flags |= SCF_DO_STCLASS_OR;
863 data->start_class->flags |= ANYOF_EOS;
867 else if (code == BRANCHJ) /* single branch is optimized. */
868 scan = NEXTOPER(NEXTOPER(scan));
869 else /* single branch is optimized. */
870 scan = NEXTOPER(scan);
873 else if (OP(scan) == EXACT) {
874 I32 l = STR_LEN(scan);
875 UV uc = *((U8*)STRING(scan));
877 U8 *s = (U8*)STRING(scan);
878 l = utf8_length(s, s + l);
879 uc = utf8_to_uvchr(s, NULL);
882 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
883 /* The code below prefers earlier match for fixed
884 offset, later match for variable offset. */
885 if (data->last_end == -1) { /* Update the start info. */
886 data->last_start_min = data->pos_min;
887 data->last_start_max = is_inf
888 ? I32_MAX : data->pos_min + data->pos_delta;
890 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
891 data->last_end = data->pos_min + l;
892 data->pos_min += l; /* As in the first entry. */
893 data->flags &= ~SF_BEFORE_EOL;
895 if (flags & SCF_DO_STCLASS_AND) {
896 /* Check whether it is compatible with what we know already! */
900 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
901 && !ANYOF_BITMAP_TEST(data->start_class, uc)
902 && (!(data->start_class->flags & ANYOF_FOLD)
903 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
906 ANYOF_CLASS_ZERO(data->start_class);
907 ANYOF_BITMAP_ZERO(data->start_class);
909 ANYOF_BITMAP_SET(data->start_class, uc);
910 data->start_class->flags &= ~ANYOF_EOS;
912 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
914 else if (flags & SCF_DO_STCLASS_OR) {
915 /* false positive possible if the class is case-folded */
917 ANYOF_BITMAP_SET(data->start_class, uc);
919 data->start_class->flags |= ANYOF_UNICODE_ALL;
920 data->start_class->flags &= ~ANYOF_EOS;
921 cl_and(data->start_class, &and_with);
923 flags &= ~SCF_DO_STCLASS;
925 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
926 I32 l = STR_LEN(scan);
927 UV uc = *((U8*)STRING(scan));
929 /* Search for fixed substrings supports EXACT only. */
930 if (flags & SCF_DO_SUBSTR)
931 scan_commit(pRExC_state, data);
933 U8 *s = (U8 *)STRING(scan);
934 l = utf8_length(s, s + l);
935 uc = utf8_to_uvchr(s, NULL);
938 if (data && (flags & SCF_DO_SUBSTR))
940 if (flags & SCF_DO_STCLASS_AND) {
941 /* Check whether it is compatible with what we know already! */
945 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
946 && !ANYOF_BITMAP_TEST(data->start_class, uc)
947 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
949 ANYOF_CLASS_ZERO(data->start_class);
950 ANYOF_BITMAP_ZERO(data->start_class);
952 ANYOF_BITMAP_SET(data->start_class, uc);
953 data->start_class->flags &= ~ANYOF_EOS;
954 data->start_class->flags |= ANYOF_FOLD;
955 if (OP(scan) == EXACTFL)
956 data->start_class->flags |= ANYOF_LOCALE;
959 else if (flags & SCF_DO_STCLASS_OR) {
960 if (data->start_class->flags & ANYOF_FOLD) {
961 /* false positive possible if the class is case-folded.
962 Assume that the locale settings are the same... */
964 ANYOF_BITMAP_SET(data->start_class, uc);
965 data->start_class->flags &= ~ANYOF_EOS;
967 cl_and(data->start_class, &and_with);
969 flags &= ~SCF_DO_STCLASS;
971 else if (strchr((char*)PL_varies,OP(scan))) {
972 I32 mincount, maxcount, minnext, deltanext, fl = 0;
973 I32 f = flags, pos_before = 0;
974 regnode *oscan = scan;
975 struct regnode_charclass_class this_class;
976 struct regnode_charclass_class *oclass = NULL;
977 I32 next_is_eval = 0;
979 switch (PL_regkind[(U8)OP(scan)]) {
980 case WHILEM: /* End of (?:...)* . */
981 scan = NEXTOPER(scan);
984 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
985 next = NEXTOPER(scan);
986 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
988 maxcount = REG_INFTY;
989 next = regnext(scan);
990 scan = NEXTOPER(scan);
994 if (flags & SCF_DO_SUBSTR)
999 if (flags & SCF_DO_STCLASS) {
1001 maxcount = REG_INFTY;
1002 next = regnext(scan);
1003 scan = NEXTOPER(scan);
1006 is_inf = is_inf_internal = 1;
1007 scan = regnext(scan);
1008 if (flags & SCF_DO_SUBSTR) {
1009 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
1010 data->longest = &(data->longest_float);
1012 goto optimize_curly_tail;
1014 mincount = ARG1(scan);
1015 maxcount = ARG2(scan);
1016 next = regnext(scan);
1017 if (OP(scan) == CURLYX) {
1018 I32 lp = (data ? *(data->last_closep) : 0);
1020 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
1022 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
1023 next_is_eval = (OP(scan) == EVAL);
1025 if (flags & SCF_DO_SUBSTR) {
1026 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
1027 pos_before = data->pos_min;
1031 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
1033 data->flags |= SF_IS_INF;
1035 if (flags & SCF_DO_STCLASS) {
1036 cl_init(pRExC_state, &this_class);
1037 oclass = data->start_class;
1038 data->start_class = &this_class;
1039 f |= SCF_DO_STCLASS_AND;
1040 f &= ~SCF_DO_STCLASS_OR;
1042 /* These are the cases when once a subexpression
1043 fails at a particular position, it cannot succeed
1044 even after backtracking at the enclosing scope.
1046 XXXX what if minimal match and we are at the
1047 initial run of {n,m}? */
1048 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
1049 f &= ~SCF_WHILEM_VISITED_POS;
1051 /* This will finish on WHILEM, setting scan, or on NULL: */
1052 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
1054 ? (f & ~SCF_DO_SUBSTR) : f);
1056 if (flags & SCF_DO_STCLASS)
1057 data->start_class = oclass;
1058 if (mincount == 0 || minnext == 0) {
1059 if (flags & SCF_DO_STCLASS_OR) {
1060 cl_or(pRExC_state, data->start_class, &this_class);
1062 else if (flags & SCF_DO_STCLASS_AND) {
1063 /* Switch to OR mode: cache the old value of
1064 * data->start_class */
1065 StructCopy(data->start_class, &and_with,
1066 struct regnode_charclass_class);
1067 flags &= ~SCF_DO_STCLASS_AND;
1068 StructCopy(&this_class, data->start_class,
1069 struct regnode_charclass_class);
1070 flags |= SCF_DO_STCLASS_OR;
1071 data->start_class->flags |= ANYOF_EOS;
1073 } else { /* Non-zero len */
1074 if (flags & SCF_DO_STCLASS_OR) {
1075 cl_or(pRExC_state, data->start_class, &this_class);
1076 cl_and(data->start_class, &and_with);
1078 else if (flags & SCF_DO_STCLASS_AND)
1079 cl_and(data->start_class, &this_class);
1080 flags &= ~SCF_DO_STCLASS;
1082 if (!scan) /* It was not CURLYX, but CURLY. */
1084 if (ckWARN(WARN_REGEXP)
1085 /* ? quantifier ok, except for (?{ ... }) */
1086 && (next_is_eval || !(mincount == 0 && maxcount == 1))
1087 && (minnext == 0) && (deltanext == 0)
1088 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1089 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1092 "Quantifier unexpected on zero-length expression");
1095 min += minnext * mincount;
1096 is_inf_internal |= ((maxcount == REG_INFTY
1097 && (minnext + deltanext) > 0)
1098 || deltanext == I32_MAX);
1099 is_inf |= is_inf_internal;
1100 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1102 /* Try powerful optimization CURLYX => CURLYN. */
1103 if ( OP(oscan) == CURLYX && data
1104 && data->flags & SF_IN_PAR
1105 && !(data->flags & SF_HAS_EVAL)
1106 && !deltanext && minnext == 1 ) {
1107 /* Try to optimize to CURLYN. */
1108 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1109 regnode *nxt1 = nxt;
1116 if (!strchr((char*)PL_simple,OP(nxt))
1117 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1118 && STR_LEN(nxt) == 1))
1124 if (OP(nxt) != CLOSE)
1126 /* Now we know that nxt2 is the only contents: */
1127 oscan->flags = ARG(nxt);
1129 OP(nxt1) = NOTHING; /* was OPEN. */
1131 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1132 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1133 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1134 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1135 OP(nxt + 1) = OPTIMIZED; /* was count. */
1136 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1141 /* Try optimization CURLYX => CURLYM. */
1142 if ( OP(oscan) == CURLYX && data
1143 && !(data->flags & SF_HAS_PAR)
1144 && !(data->flags & SF_HAS_EVAL)
1146 /* XXXX How to optimize if data == 0? */
1147 /* Optimize to a simpler form. */
1148 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1152 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1153 && (OP(nxt2) != WHILEM))
1155 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1156 /* Need to optimize away parenths. */
1157 if (data->flags & SF_IN_PAR) {
1158 /* Set the parenth number. */
1159 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1161 if (OP(nxt) != CLOSE)
1162 FAIL("Panic opt close");
1163 oscan->flags = ARG(nxt);
1164 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1165 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1167 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1168 OP(nxt + 1) = OPTIMIZED; /* was count. */
1169 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1170 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1173 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1174 regnode *nnxt = regnext(nxt1);
1177 if (reg_off_by_arg[OP(nxt1)])
1178 ARG_SET(nxt1, nxt2 - nxt1);
1179 else if (nxt2 - nxt1 < U16_MAX)
1180 NEXT_OFF(nxt1) = nxt2 - nxt1;
1182 OP(nxt) = NOTHING; /* Cannot beautify */
1187 /* Optimize again: */
1188 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1194 else if ((OP(oscan) == CURLYX)
1195 && (flags & SCF_WHILEM_VISITED_POS)
1196 /* See the comment on a similar expression above.
1197 However, this time it not a subexpression
1198 we care about, but the expression itself. */
1199 && (maxcount == REG_INFTY)
1200 && data && ++data->whilem_c < 16) {
1201 /* This stays as CURLYX, we can put the count/of pair. */
1202 /* Find WHILEM (as in regexec.c) */
1203 regnode *nxt = oscan + NEXT_OFF(oscan);
1205 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1207 PREVOPER(nxt)->flags = data->whilem_c
1208 | (RExC_whilem_seen << 4); /* On WHILEM */
1210 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1212 if (flags & SCF_DO_SUBSTR) {
1213 SV *last_str = Nullsv;
1214 int counted = mincount != 0;
1216 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1217 #if defined(SPARC64_GCC_WORKAROUND)
1223 if (pos_before >= data->last_start_min)
1226 b = data->last_start_min;
1229 s = SvPV(data->last_found, l);
1230 old = b - data->last_start_min;
1233 I32 b = pos_before >= data->last_start_min
1234 ? pos_before : data->last_start_min;
1236 char *s = SvPV(data->last_found, l);
1237 I32 old = b - data->last_start_min;
1241 old = utf8_hop((U8*)s, old) - (U8*)s;
1244 /* Get the added string: */
1245 last_str = newSVpvn(s + old, l);
1246 if (deltanext == 0 && pos_before == b) {
1247 /* What was added is a constant string */
1249 SvGROW(last_str, (mincount * l) + 1);
1250 repeatcpy(SvPVX(last_str) + l,
1251 SvPVX(last_str), l, mincount - 1);
1252 SvCUR(last_str) *= mincount;
1253 /* Add additional parts. */
1254 SvCUR_set(data->last_found,
1255 SvCUR(data->last_found) - l);
1256 sv_catsv(data->last_found, last_str);
1257 data->last_end += l * (mincount - 1);
1260 /* start offset must point into the last copy */
1261 data->last_start_min += minnext * (mincount - 1);
1262 data->last_start_max += is_inf ? 0 : (maxcount - 1)
1263 * (minnext + data->pos_delta);
1266 /* It is counted once already... */
1267 data->pos_min += minnext * (mincount - counted);
1268 data->pos_delta += - counted * deltanext +
1269 (minnext + deltanext) * maxcount - minnext * mincount;
1270 if (mincount != maxcount) {
1271 /* Cannot extend fixed substrings found inside
1273 scan_commit(pRExC_state,data);
1274 if (mincount && last_str) {
1275 sv_setsv(data->last_found, last_str);
1276 data->last_end = data->pos_min;
1277 data->last_start_min =
1278 data->pos_min - CHR_SVLEN(last_str);
1279 data->last_start_max = is_inf
1281 : data->pos_min + data->pos_delta
1282 - CHR_SVLEN(last_str);
1284 data->longest = &(data->longest_float);
1286 SvREFCNT_dec(last_str);
1288 if (data && (fl & SF_HAS_EVAL))
1289 data->flags |= SF_HAS_EVAL;
1290 optimize_curly_tail:
1291 if (OP(oscan) != CURLYX) {
1292 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1294 NEXT_OFF(oscan) += NEXT_OFF(next);
1297 default: /* REF and CLUMP only? */
1298 if (flags & SCF_DO_SUBSTR) {
1299 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1300 data->longest = &(data->longest_float);
1302 is_inf = is_inf_internal = 1;
1303 if (flags & SCF_DO_STCLASS_OR)
1304 cl_anything(pRExC_state, data->start_class);
1305 flags &= ~SCF_DO_STCLASS;
1309 else if (strchr((char*)PL_simple,OP(scan))) {
1312 if (flags & SCF_DO_SUBSTR) {
1313 scan_commit(pRExC_state,data);
1317 if (flags & SCF_DO_STCLASS) {
1318 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1320 /* Some of the logic below assumes that switching
1321 locale on will only add false positives. */
1322 switch (PL_regkind[(U8)OP(scan)]) {
1326 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1327 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1328 cl_anything(pRExC_state, data->start_class);
1331 if (OP(scan) == SANY)
1333 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1334 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1335 || (data->start_class->flags & ANYOF_CLASS));
1336 cl_anything(pRExC_state, data->start_class);
1338 if (flags & SCF_DO_STCLASS_AND || !value)
1339 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1342 if (flags & SCF_DO_STCLASS_AND)
1343 cl_and(data->start_class,
1344 (struct regnode_charclass_class*)scan);
1346 cl_or(pRExC_state, data->start_class,
1347 (struct regnode_charclass_class*)scan);
1350 if (flags & SCF_DO_STCLASS_AND) {
1351 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1352 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1353 for (value = 0; value < 256; value++)
1354 if (!isALNUM(value))
1355 ANYOF_BITMAP_CLEAR(data->start_class, value);
1359 if (data->start_class->flags & ANYOF_LOCALE)
1360 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1362 for (value = 0; value < 256; value++)
1364 ANYOF_BITMAP_SET(data->start_class, value);
1369 if (flags & SCF_DO_STCLASS_AND) {
1370 if (data->start_class->flags & ANYOF_LOCALE)
1371 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1374 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1375 data->start_class->flags |= ANYOF_LOCALE;
1379 if (flags & SCF_DO_STCLASS_AND) {
1380 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1381 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1382 for (value = 0; value < 256; value++)
1384 ANYOF_BITMAP_CLEAR(data->start_class, value);
1388 if (data->start_class->flags & ANYOF_LOCALE)
1389 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1391 for (value = 0; value < 256; value++)
1392 if (!isALNUM(value))
1393 ANYOF_BITMAP_SET(data->start_class, value);
1398 if (flags & SCF_DO_STCLASS_AND) {
1399 if (data->start_class->flags & ANYOF_LOCALE)
1400 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1403 data->start_class->flags |= ANYOF_LOCALE;
1404 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1408 if (flags & SCF_DO_STCLASS_AND) {
1409 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1410 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1411 for (value = 0; value < 256; value++)
1412 if (!isSPACE(value))
1413 ANYOF_BITMAP_CLEAR(data->start_class, value);
1417 if (data->start_class->flags & ANYOF_LOCALE)
1418 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1420 for (value = 0; value < 256; value++)
1422 ANYOF_BITMAP_SET(data->start_class, value);
1427 if (flags & SCF_DO_STCLASS_AND) {
1428 if (data->start_class->flags & ANYOF_LOCALE)
1429 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1432 data->start_class->flags |= ANYOF_LOCALE;
1433 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1437 if (flags & SCF_DO_STCLASS_AND) {
1438 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1439 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1440 for (value = 0; value < 256; value++)
1442 ANYOF_BITMAP_CLEAR(data->start_class, value);
1446 if (data->start_class->flags & ANYOF_LOCALE)
1447 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1449 for (value = 0; value < 256; value++)
1450 if (!isSPACE(value))
1451 ANYOF_BITMAP_SET(data->start_class, value);
1456 if (flags & SCF_DO_STCLASS_AND) {
1457 if (data->start_class->flags & ANYOF_LOCALE) {
1458 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1459 for (value = 0; value < 256; value++)
1460 if (!isSPACE(value))
1461 ANYOF_BITMAP_CLEAR(data->start_class, value);
1465 data->start_class->flags |= ANYOF_LOCALE;
1466 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1470 if (flags & SCF_DO_STCLASS_AND) {
1471 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1472 for (value = 0; value < 256; value++)
1473 if (!isDIGIT(value))
1474 ANYOF_BITMAP_CLEAR(data->start_class, value);
1477 if (data->start_class->flags & ANYOF_LOCALE)
1478 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1480 for (value = 0; value < 256; value++)
1482 ANYOF_BITMAP_SET(data->start_class, value);
1487 if (flags & SCF_DO_STCLASS_AND) {
1488 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1489 for (value = 0; value < 256; value++)
1491 ANYOF_BITMAP_CLEAR(data->start_class, value);
1494 if (data->start_class->flags & ANYOF_LOCALE)
1495 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1497 for (value = 0; value < 256; value++)
1498 if (!isDIGIT(value))
1499 ANYOF_BITMAP_SET(data->start_class, value);
1504 if (flags & SCF_DO_STCLASS_OR)
1505 cl_and(data->start_class, &and_with);
1506 flags &= ~SCF_DO_STCLASS;
1509 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1510 data->flags |= (OP(scan) == MEOL
1514 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1515 /* Lookbehind, or need to calculate parens/evals/stclass: */
1516 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1517 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1518 /* Lookahead/lookbehind */
1519 I32 deltanext, minnext, fake = 0;
1521 struct regnode_charclass_class intrnl;
1524 data_fake.flags = 0;
1526 data_fake.whilem_c = data->whilem_c;
1527 data_fake.last_closep = data->last_closep;
1530 data_fake.last_closep = &fake;
1531 if ( flags & SCF_DO_STCLASS && !scan->flags
1532 && OP(scan) == IFMATCH ) { /* Lookahead */
1533 cl_init(pRExC_state, &intrnl);
1534 data_fake.start_class = &intrnl;
1535 f |= SCF_DO_STCLASS_AND;
1537 if (flags & SCF_WHILEM_VISITED_POS)
1538 f |= SCF_WHILEM_VISITED_POS;
1539 next = regnext(scan);
1540 nscan = NEXTOPER(NEXTOPER(scan));
1541 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1544 vFAIL("Variable length lookbehind not implemented");
1546 else if (minnext > U8_MAX) {
1547 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1549 scan->flags = minnext;
1551 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1553 if (data && (data_fake.flags & SF_HAS_EVAL))
1554 data->flags |= SF_HAS_EVAL;
1556 data->whilem_c = data_fake.whilem_c;
1557 if (f & SCF_DO_STCLASS_AND) {
1558 int was = (data->start_class->flags & ANYOF_EOS);
1560 cl_and(data->start_class, &intrnl);
1562 data->start_class->flags |= ANYOF_EOS;
1565 else if (OP(scan) == OPEN) {
1568 else if (OP(scan) == CLOSE) {
1569 if (ARG(scan) == is_par) {
1570 next = regnext(scan);
1572 if ( next && (OP(next) != WHILEM) && next < last)
1573 is_par = 0; /* Disable optimization */
1576 *(data->last_closep) = ARG(scan);
1578 else if (OP(scan) == EVAL) {
1580 data->flags |= SF_HAS_EVAL;
1582 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1583 if (flags & SCF_DO_SUBSTR) {
1584 scan_commit(pRExC_state,data);
1585 data->longest = &(data->longest_float);
1587 is_inf = is_inf_internal = 1;
1588 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1589 cl_anything(pRExC_state, data->start_class);
1590 flags &= ~SCF_DO_STCLASS;
1592 /* Else: zero-length, ignore. */
1593 scan = regnext(scan);
1598 *deltap = is_inf_internal ? I32_MAX : delta;
1599 if (flags & SCF_DO_SUBSTR && is_inf)
1600 data->pos_delta = I32_MAX - data->pos_min;
1601 if (is_par > U8_MAX)
1603 if (is_par && pars==1 && data) {
1604 data->flags |= SF_IN_PAR;
1605 data->flags &= ~SF_HAS_PAR;
1607 else if (pars && data) {
1608 data->flags |= SF_HAS_PAR;
1609 data->flags &= ~SF_IN_PAR;
1611 if (flags & SCF_DO_STCLASS_OR)
1612 cl_and(data->start_class, &and_with);
1617 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1619 if (RExC_rx->data) {
1620 Renewc(RExC_rx->data,
1621 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1622 char, struct reg_data);
1623 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1624 RExC_rx->data->count += n;
1627 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1628 char, struct reg_data);
1629 New(1208, RExC_rx->data->what, n, U8);
1630 RExC_rx->data->count = n;
1632 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1633 return RExC_rx->data->count - n;
1637 Perl_reginitcolors(pTHX)
1640 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1643 PL_colors[0] = s = savepv(s);
1645 s = strchr(s, '\t');
1651 PL_colors[i] = s = "";
1655 PL_colors[i++] = "";
1662 - pregcomp - compile a regular expression into internal code
1664 * We can't allocate space until we know how big the compiled form will be,
1665 * but we can't compile it (and thus know how big it is) until we've got a
1666 * place to put the code. So we cheat: we compile it twice, once with code
1667 * generation turned off and size counting turned on, and once "for real".
1668 * This also means that we don't allocate space until we are sure that the
1669 * thing really will compile successfully, and we never have to move the
1670 * code and thus invalidate pointers into it. (Note that it has to be in
1671 * one piece because free() must be able to free it all.) [NB: not true in perl]
1673 * Beware that the optimization-preparation code in here knows about some
1674 * of the structure of the compiled regexp. [I'll say.]
1677 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1687 RExC_state_t RExC_state;
1688 RExC_state_t *pRExC_state = &RExC_state;
1691 FAIL("NULL regexp argument");
1693 /* XXXX This looks very suspicious... */
1694 if (pm->op_pmdynflags & PMdf_CMP_UTF8)
1700 DEBUG_r(if (!PL_colorset) reginitcolors());
1701 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1702 PL_colors[4],PL_colors[5],PL_colors[0],
1703 (int)(xend - exp), RExC_precomp, PL_colors[1]));
1704 RExC_flags16 = pm->op_pmflags;
1708 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1709 RExC_seen_evals = 0;
1712 /* First pass: determine size, legality. */
1719 RExC_emit = &PL_regdummy;
1720 RExC_whilem_seen = 0;
1721 #if 0 /* REGC() is (currently) a NOP at the first pass.
1722 * Clever compilers notice this and complain. --jhi */
1723 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1725 if (reg(pRExC_state, 0, &flags) == NULL) {
1726 RExC_precomp = Nullch;
1729 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1731 /* Small enough for pointer-storage convention?
1732 If extralen==0, this means that we will not need long jumps. */
1733 if (RExC_size >= 0x10000L && RExC_extralen)
1734 RExC_size += RExC_extralen;
1737 if (RExC_whilem_seen > 15)
1738 RExC_whilem_seen = 15;
1740 /* Allocate space and initialize. */
1741 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1744 FAIL("Regexp out of space");
1747 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1748 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1751 r->prelen = xend - exp;
1752 r->precomp = savepvn(RExC_precomp, r->prelen);
1754 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1755 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1757 r->substrs = 0; /* Useful during FAIL. */
1758 r->startp = 0; /* Useful during FAIL. */
1759 r->endp = 0; /* Useful during FAIL. */
1761 Newz(1304, r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
1763 r->offsets[0] = RExC_size;
1765 DEBUG_r(PerlIO_printf(Perl_debug_log,
1766 "%s %"UVuf" bytes for offset annotations.\n",
1767 r->offsets ? "Got" : "Couldn't get",
1768 (UV)((2*RExC_size+1) * sizeof(U32))));
1772 /* Second pass: emit code. */
1773 RExC_flags16 = pm->op_pmflags; /* don't let top level (?i) bleed */
1778 RExC_emit_start = r->program;
1779 RExC_emit = r->program;
1780 /* Store the count of eval-groups for security checks: */
1781 RExC_emit->next_off = ((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1782 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1784 if (reg(pRExC_state, 0, &flags) == NULL)
1787 /* Dig out information for optimizations. */
1788 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1789 pm->op_pmflags = RExC_flags16;
1791 r->reganch |= ROPT_UTF8; /* Unicode in it? */
1792 r->regstclass = NULL;
1793 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1794 r->reganch |= ROPT_NAUGHTY;
1795 scan = r->program + 1; /* First BRANCH. */
1797 /* XXXX To minimize changes to RE engine we always allocate
1798 3-units-long substrs field. */
1799 Newz(1004, r->substrs, 1, struct reg_substr_data);
1801 StructCopy(&zero_scan_data, &data, scan_data_t);
1802 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1803 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1805 STRLEN longest_float_length, longest_fixed_length;
1806 struct regnode_charclass_class ch_class;
1811 /* Skip introductions and multiplicators >= 1. */
1812 while ((OP(first) == OPEN && (sawopen = 1)) ||
1813 /* An OR of *one* alternative - should not happen now. */
1814 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1815 (OP(first) == PLUS) ||
1816 (OP(first) == MINMOD) ||
1817 /* An {n,m} with n>0 */
1818 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1819 if (OP(first) == PLUS)
1822 first += regarglen[(U8)OP(first)];
1823 first = NEXTOPER(first);
1826 /* Starting-point info. */
1828 if (PL_regkind[(U8)OP(first)] == EXACT) {
1829 if (OP(first) == EXACT)
1830 ; /* Empty, get anchored substr later. */
1831 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1832 r->regstclass = first;
1834 else if (strchr((char*)PL_simple,OP(first)))
1835 r->regstclass = first;
1836 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1837 PL_regkind[(U8)OP(first)] == NBOUND)
1838 r->regstclass = first;
1839 else if (PL_regkind[(U8)OP(first)] == BOL) {
1840 r->reganch |= (OP(first) == MBOL
1842 : (OP(first) == SBOL
1845 first = NEXTOPER(first);
1848 else if (OP(first) == GPOS) {
1849 r->reganch |= ROPT_ANCH_GPOS;
1850 first = NEXTOPER(first);
1853 else if ((OP(first) == STAR &&
1854 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1855 !(r->reganch & ROPT_ANCH) )
1857 /* turn .* into ^.* with an implied $*=1 */
1858 int type = OP(NEXTOPER(first));
1860 if (type == REG_ANY)
1861 type = ROPT_ANCH_MBOL;
1863 type = ROPT_ANCH_SBOL;
1865 r->reganch |= type | ROPT_IMPLICIT;
1866 first = NEXTOPER(first);
1869 if (sawplus && (!sawopen || !RExC_sawback)
1870 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1871 /* x+ must match at the 1st pos of run of x's */
1872 r->reganch |= ROPT_SKIP;
1874 /* Scan is after the zeroth branch, first is atomic matcher. */
1875 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1876 (IV)(first - scan + 1)));
1878 * If there's something expensive in the r.e., find the
1879 * longest literal string that must appear and make it the
1880 * regmust. Resolve ties in favor of later strings, since
1881 * the regstart check works with the beginning of the r.e.
1882 * and avoiding duplication strengthens checking. Not a
1883 * strong reason, but sufficient in the absence of others.
1884 * [Now we resolve ties in favor of the earlier string if
1885 * it happens that c_offset_min has been invalidated, since the
1886 * earlier string may buy us something the later one won't.]
1890 data.longest_fixed = newSVpvn("",0);
1891 data.longest_float = newSVpvn("",0);
1892 data.last_found = newSVpvn("",0);
1893 data.longest = &(data.longest_fixed);
1895 if (!r->regstclass) {
1896 cl_init(pRExC_state, &ch_class);
1897 data.start_class = &ch_class;
1898 stclass_flag = SCF_DO_STCLASS_AND;
1899 } else /* XXXX Check for BOUND? */
1901 data.last_closep = &last_close;
1903 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1904 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1905 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1906 && data.last_start_min == 0 && data.last_end > 0
1907 && !RExC_seen_zerolen
1908 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1909 r->reganch |= ROPT_CHECK_ALL;
1910 scan_commit(pRExC_state, &data);
1911 SvREFCNT_dec(data.last_found);
1913 longest_float_length = CHR_SVLEN(data.longest_float);
1914 if (longest_float_length
1915 || (data.flags & SF_FL_BEFORE_EOL
1916 && (!(data.flags & SF_FL_BEFORE_MEOL)
1917 || (RExC_flags16 & PMf_MULTILINE)))) {
1920 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1921 && data.offset_fixed == data.offset_float_min
1922 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1923 goto remove_float; /* As in (a)+. */
1925 r->float_substr = data.longest_float;
1926 r->float_min_offset = data.offset_float_min;
1927 r->float_max_offset = data.offset_float_max;
1928 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1929 && (!(data.flags & SF_FL_BEFORE_MEOL)
1930 || (RExC_flags16 & PMf_MULTILINE)));
1931 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1935 r->float_substr = Nullsv;
1936 SvREFCNT_dec(data.longest_float);
1937 longest_float_length = 0;
1940 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1941 if (longest_fixed_length
1942 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1943 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1944 || (RExC_flags16 & PMf_MULTILINE)))) {
1947 r->anchored_substr = data.longest_fixed;
1948 r->anchored_offset = data.offset_fixed;
1949 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1950 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1951 || (RExC_flags16 & PMf_MULTILINE)));
1952 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1955 r->anchored_substr = Nullsv;
1956 SvREFCNT_dec(data.longest_fixed);
1957 longest_fixed_length = 0;
1960 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
1961 r->regstclass = NULL;
1962 if ((!r->anchored_substr || r->anchored_offset) && stclass_flag
1963 && !(data.start_class->flags & ANYOF_EOS)
1964 && !cl_is_anything(data.start_class)) {
1965 I32 n = add_data(pRExC_state, 1, "f");
1967 New(1006, RExC_rx->data->data[n], 1,
1968 struct regnode_charclass_class);
1969 StructCopy(data.start_class,
1970 (struct regnode_charclass_class*)RExC_rx->data->data[n],
1971 struct regnode_charclass_class);
1972 r->regstclass = (regnode*)RExC_rx->data->data[n];
1973 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
1974 PL_regdata = r->data; /* for regprop() */
1975 DEBUG_r({ SV *sv = sv_newmortal();
1976 regprop(sv, (regnode*)data.start_class);
1977 PerlIO_printf(Perl_debug_log,
1978 "synthetic stclass `%s'.\n",
1982 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1983 if (longest_fixed_length > longest_float_length) {
1984 r->check_substr = r->anchored_substr;
1985 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1986 if (r->reganch & ROPT_ANCH_SINGLE)
1987 r->reganch |= ROPT_NOSCAN;
1990 r->check_substr = r->float_substr;
1991 r->check_offset_min = data.offset_float_min;
1992 r->check_offset_max = data.offset_float_max;
1994 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
1995 This should be changed ASAP! */
1996 if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) {
1997 r->reganch |= RE_USE_INTUIT;
1998 if (SvTAIL(r->check_substr))
1999 r->reganch |= RE_INTUIT_TAIL;
2003 /* Several toplevels. Best we can is to set minlen. */
2005 struct regnode_charclass_class ch_class;
2008 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
2009 scan = r->program + 1;
2010 cl_init(pRExC_state, &ch_class);
2011 data.start_class = &ch_class;
2012 data.last_closep = &last_close;
2013 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
2014 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
2015 if (!(data.start_class->flags & ANYOF_EOS)
2016 && !cl_is_anything(data.start_class)) {
2017 I32 n = add_data(pRExC_state, 1, "f");
2019 New(1006, RExC_rx->data->data[n], 1,
2020 struct regnode_charclass_class);
2021 StructCopy(data.start_class,
2022 (struct regnode_charclass_class*)RExC_rx->data->data[n],
2023 struct regnode_charclass_class);
2024 r->regstclass = (regnode*)RExC_rx->data->data[n];
2025 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
2026 DEBUG_r({ SV* sv = sv_newmortal();
2027 regprop(sv, (regnode*)data.start_class);
2028 PerlIO_printf(Perl_debug_log,
2029 "synthetic stclass `%s'.\n",
2035 if (RExC_seen & REG_SEEN_GPOS)
2036 r->reganch |= ROPT_GPOS_SEEN;
2037 if (RExC_seen & REG_SEEN_LOOKBEHIND)
2038 r->reganch |= ROPT_LOOKBEHIND_SEEN;
2039 if (RExC_seen & REG_SEEN_EVAL)
2040 r->reganch |= ROPT_EVAL_SEEN;
2041 if (RExC_seen & REG_SEEN_CANY)
2042 r->reganch |= ROPT_CANY_SEEN;
2043 Newz(1002, r->startp, RExC_npar, I32);
2044 Newz(1002, r->endp, RExC_npar, I32);
2045 PL_regdata = r->data; /* for regprop() */
2046 DEBUG_r(regdump(r));
2051 - reg - regular expression, i.e. main body or parenthesized thing
2053 * Caller must absorb opening parenthesis.
2055 * Combining parenthesis handling with the base level of regular expression
2056 * is a trifle forced, but the need to tie the tails of the branches to what
2057 * follows makes it hard to avoid.
2060 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
2061 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
2063 register regnode *ret; /* Will be the head of the group. */
2064 register regnode *br;
2065 register regnode *lastbr;
2066 register regnode *ender = 0;
2067 register I32 parno = 0;
2068 I32 flags, oregflags = RExC_flags16, have_branch = 0, open = 0;
2070 /* for (?g), (?gc), and (?o) warnings; warning
2071 about (?c) will warn about (?g) -- japhy */
2073 I32 wastedflags = 0x00,
2076 wasted_gc = 0x02 | 0x04,
2079 char * parse_start = RExC_parse; /* MJD */
2080 char *oregcomp_parse = RExC_parse;
2083 *flagp = 0; /* Tentatively. */
2086 /* Make an OPEN node, if parenthesized. */
2088 if (*RExC_parse == '?') { /* (?...) */
2089 U16 posflags = 0, negflags = 0;
2090 U16 *flagsp = &posflags;
2092 char *seqstart = RExC_parse;
2095 paren = *RExC_parse++;
2096 ret = NULL; /* For look-ahead/behind. */
2098 case '<': /* (?<...) */
2099 RExC_seen |= REG_SEEN_LOOKBEHIND;
2100 if (*RExC_parse == '!')
2102 if (*RExC_parse != '=' && *RExC_parse != '!')
2105 case '=': /* (?=...) */
2106 case '!': /* (?!...) */
2107 RExC_seen_zerolen++;
2108 case ':': /* (?:...) */
2109 case '>': /* (?>...) */
2111 case '$': /* (?$...) */
2112 case '@': /* (?@...) */
2113 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2115 case '#': /* (?#...) */
2116 while (*RExC_parse && *RExC_parse != ')')
2118 if (*RExC_parse != ')')
2119 FAIL("Sequence (?#... not terminated");
2120 nextchar(pRExC_state);
2123 case 'p': /* (?p...) */
2124 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
2125 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
2127 case '?': /* (??...) */
2129 paren = *RExC_parse++;
2131 case '{': /* (?{...}) */
2133 I32 count = 1, n = 0;
2135 char *s = RExC_parse;
2137 OP_4tree *sop, *rop;
2139 RExC_seen_zerolen++;
2140 RExC_seen |= REG_SEEN_EVAL;
2141 while (count && (c = *RExC_parse)) {
2142 if (c == '\\' && RExC_parse[1])
2150 if (*RExC_parse != ')')
2153 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2158 if (RExC_parse - 1 - s)
2159 sv = newSVpvn(s, RExC_parse - 1 - s);
2161 sv = newSVpvn("", 0);
2164 Perl_save_re_context(aTHX);
2165 rop = sv_compile_2op(sv, &sop, "re", &av);
2166 sop->op_private |= OPpREFCOUNTED;
2167 /* re_dup will OpREFCNT_inc */
2168 OpREFCNT_set(sop, 1);
2171 n = add_data(pRExC_state, 3, "nop");
2172 RExC_rx->data->data[n] = (void*)rop;
2173 RExC_rx->data->data[n+1] = (void*)sop;
2174 RExC_rx->data->data[n+2] = (void*)av;
2177 else { /* First pass */
2178 if (PL_reginterp_cnt < ++RExC_seen_evals
2179 && PL_curcop != &PL_compiling)
2180 /* No compiled RE interpolated, has runtime
2181 components ===> unsafe. */
2182 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2183 if (PL_tainting && PL_tainted)
2184 FAIL("Eval-group in insecure regular expression");
2187 nextchar(pRExC_state);
2189 ret = reg_node(pRExC_state, LOGICAL);
2192 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2193 /* deal with the length of this later - MJD */
2196 return reganode(pRExC_state, EVAL, n);
2198 case '(': /* (?(?{...})...) and (?(?=...)...) */
2200 if (RExC_parse[0] == '?') { /* (?(?...)) */
2201 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2202 || RExC_parse[1] == '<'
2203 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2206 ret = reg_node(pRExC_state, LOGICAL);
2209 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2213 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2215 parno = atoi(RExC_parse++);
2217 while (isDIGIT(*RExC_parse))
2219 ret = reganode(pRExC_state, GROUPP, parno);
2221 if ((c = *nextchar(pRExC_state)) != ')')
2222 vFAIL("Switch condition not recognized");
2224 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2225 br = regbranch(pRExC_state, &flags, 1);
2227 br = reganode(pRExC_state, LONGJMP, 0);
2229 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2230 c = *nextchar(pRExC_state);
2234 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2235 regbranch(pRExC_state, &flags, 1);
2236 regtail(pRExC_state, ret, lastbr);
2239 c = *nextchar(pRExC_state);
2244 vFAIL("Switch (?(condition)... contains too many branches");
2245 ender = reg_node(pRExC_state, TAIL);
2246 regtail(pRExC_state, br, ender);
2248 regtail(pRExC_state, lastbr, ender);
2249 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2252 regtail(pRExC_state, ret, ender);
2256 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2260 RExC_parse--; /* for vFAIL to print correctly */
2261 vFAIL("Sequence (? incomplete");
2265 parse_flags: /* (?i) */
2266 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2267 /* (?g), (?gc) and (?o) are useless here
2268 and must be globally applied -- japhy */
2270 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
2271 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2272 I32 wflagbit = *RExC_parse == 'o' ? wasted_o : wasted_g;
2273 if (! (wastedflags & wflagbit) ) {
2274 wastedflags |= wflagbit;
2277 "Useless (%s%c) - %suse /%c modifier",
2278 flagsp == &negflags ? "?-" : "?",
2280 flagsp == &negflags ? "don't " : "",
2286 else if (*RExC_parse == 'c') {
2287 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2288 if (! (wastedflags & wasted_c) ) {
2289 wastedflags |= wasted_gc;
2292 "Useless (%sc) - %suse /gc modifier",
2293 flagsp == &negflags ? "?-" : "?",
2294 flagsp == &negflags ? "don't " : ""
2299 else { pmflag(flagsp, *RExC_parse); }
2303 if (*RExC_parse == '-') {
2305 wastedflags = 0; /* reset so (?g-c) warns twice */
2309 RExC_flags16 |= posflags;
2310 RExC_flags16 &= ~negflags;
2311 if (*RExC_parse == ':') {
2317 if (*RExC_parse != ')') {
2319 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2321 nextchar(pRExC_state);
2329 ret = reganode(pRExC_state, OPEN, parno);
2330 Set_Node_Length(ret, 1); /* MJD */
2331 Set_Node_Offset(ret, RExC_parse); /* MJD */
2338 /* Pick up the branches, linking them together. */
2339 parse_start = RExC_parse; /* MJD */
2340 br = regbranch(pRExC_state, &flags, 1);
2341 /* branch_len = (paren != 0); */
2345 if (*RExC_parse == '|') {
2346 if (!SIZE_ONLY && RExC_extralen) {
2347 reginsert(pRExC_state, BRANCHJ, br);
2350 reginsert(pRExC_state, BRANCH, br);
2351 Set_Node_Length(br, paren != 0);
2352 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
2356 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2358 else if (paren == ':') {
2359 *flagp |= flags&SIMPLE;
2361 if (open) { /* Starts with OPEN. */
2362 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2364 else if (paren != '?') /* Not Conditional */
2368 *flagp |= flags&SPSTART;
2370 while (*RExC_parse == '|') {
2371 if (!SIZE_ONLY && RExC_extralen) {
2372 ender = reganode(pRExC_state, LONGJMP,0);
2373 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2376 RExC_extralen += 2; /* Account for LONGJMP. */
2377 nextchar(pRExC_state);
2378 br = regbranch(pRExC_state, &flags, 0);
2382 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2386 *flagp |= flags&SPSTART;
2389 if (have_branch || paren != ':') {
2390 /* Make a closing node, and hook it on the end. */
2393 ender = reg_node(pRExC_state, TAIL);
2396 ender = reganode(pRExC_state, CLOSE, parno);
2397 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
2398 Set_Node_Length(ender,1); /* MJD */
2404 *flagp &= ~HASWIDTH;
2407 ender = reg_node(pRExC_state, SUCCEED);
2410 ender = reg_node(pRExC_state, END);
2413 regtail(pRExC_state, lastbr, ender);
2416 /* Hook the tails of the branches to the closing node. */
2417 for (br = ret; br != NULL; br = regnext(br)) {
2418 regoptail(pRExC_state, br, ender);
2425 static char parens[] = "=!<,>";
2427 if (paren && (p = strchr(parens, paren))) {
2428 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2429 int flag = (p - parens) > 1;
2432 node = SUSPEND, flag = 0;
2433 reginsert(pRExC_state, node,ret);
2435 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2439 /* Check for proper termination. */
2441 RExC_flags16 = oregflags;
2442 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2443 RExC_parse = oregcomp_parse;
2444 vFAIL("Unmatched (");
2447 else if (!paren && RExC_parse < RExC_end) {
2448 if (*RExC_parse == ')') {
2450 vFAIL("Unmatched )");
2453 FAIL("Junk on end of regexp"); /* "Can't happen". */
2461 - regbranch - one alternative of an | operator
2463 * Implements the concatenation operator.
2466 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2468 register regnode *ret;
2469 register regnode *chain = NULL;
2470 register regnode *latest;
2471 I32 flags = 0, c = 0;
2476 if (!SIZE_ONLY && RExC_extralen)
2477 ret = reganode(pRExC_state, BRANCHJ,0);
2479 ret = reg_node(pRExC_state, BRANCH);
2480 Set_Node_Length(ret, 1);
2484 if (!first && SIZE_ONLY)
2485 RExC_extralen += 1; /* BRANCHJ */
2487 *flagp = WORST; /* Tentatively. */
2490 nextchar(pRExC_state);
2491 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2493 latest = regpiece(pRExC_state, &flags);
2494 if (latest == NULL) {
2495 if (flags & TRYAGAIN)
2499 else if (ret == NULL)
2501 *flagp |= flags&HASWIDTH;
2502 if (chain == NULL) /* First piece. */
2503 *flagp |= flags&SPSTART;
2506 regtail(pRExC_state, chain, latest);
2511 if (chain == NULL) { /* Loop ran zero times. */
2512 chain = reg_node(pRExC_state, NOTHING);
2517 *flagp |= flags&SIMPLE;
2524 - regpiece - something followed by possible [*+?]
2526 * Note that the branching code sequences used for ? and the general cases
2527 * of * and + are somewhat optimized: they use the same NOTHING node as
2528 * both the endmarker for their branch list and the body of the last branch.
2529 * It might seem that this node could be dispensed with entirely, but the
2530 * endmarker role is not redundant.
2533 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2535 register regnode *ret;
2537 register char *next;
2539 char *origparse = RExC_parse;
2542 I32 max = REG_INFTY;
2545 ret = regatom(pRExC_state, &flags);
2547 if (flags & TRYAGAIN)
2554 if (op == '{' && regcurly(RExC_parse)) {
2555 parse_start = RExC_parse; /* MJD */
2556 next = RExC_parse + 1;
2558 while (isDIGIT(*next) || *next == ',') {
2567 if (*next == '}') { /* got one */
2571 min = atoi(RExC_parse);
2575 maxpos = RExC_parse;
2577 if (!max && *maxpos != '0')
2578 max = REG_INFTY; /* meaning "infinity" */
2579 else if (max >= REG_INFTY)
2580 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2582 nextchar(pRExC_state);
2585 if ((flags&SIMPLE)) {
2586 RExC_naughty += 2 + RExC_naughty / 2;
2587 reginsert(pRExC_state, CURLY, ret);
2588 Set_Node_Offset(ret, parse_start+1); /* MJD */
2589 Set_Node_Cur_Length(ret);
2592 regnode *w = reg_node(pRExC_state, WHILEM);
2595 regtail(pRExC_state, ret, w);
2596 if (!SIZE_ONLY && RExC_extralen) {
2597 reginsert(pRExC_state, LONGJMP,ret);
2598 reginsert(pRExC_state, NOTHING,ret);
2599 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2601 reginsert(pRExC_state, CURLYX,ret);
2603 Set_Node_Offset(ret, parse_start+1);
2604 Set_Node_Length(ret,
2605 op == '{' ? (RExC_parse - parse_start) : 1);
2607 if (!SIZE_ONLY && RExC_extralen)
2608 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2609 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2611 RExC_whilem_seen++, RExC_extralen += 3;
2612 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2620 if (max && max < min)
2621 vFAIL("Can't do {n,m} with n > m");
2636 #if 0 /* Now runtime fix should be reliable. */
2638 /* if this is reinstated, don't forget to put this back into perldiag:
2640 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2642 (F) The part of the regexp subject to either the * or + quantifier
2643 could match an empty string. The {#} shows in the regular
2644 expression about where the problem was discovered.
2648 if (!(flags&HASWIDTH) && op != '?')
2649 vFAIL("Regexp *+ operand could be empty");
2652 parse_start = RExC_parse;
2653 nextchar(pRExC_state);
2655 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2657 if (op == '*' && (flags&SIMPLE)) {
2658 reginsert(pRExC_state, STAR, ret);
2662 else if (op == '*') {
2666 else if (op == '+' && (flags&SIMPLE)) {
2667 reginsert(pRExC_state, PLUS, ret);
2671 else if (op == '+') {
2675 else if (op == '?') {
2680 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2682 "%.*s matches null string many times",
2683 RExC_parse - origparse,
2687 if (*RExC_parse == '?') {
2688 nextchar(pRExC_state);
2689 reginsert(pRExC_state, MINMOD, ret);
2690 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2692 if (ISMULT2(RExC_parse)) {
2694 vFAIL("Nested quantifiers");
2701 - regatom - the lowest level
2703 * Optimization: gobbles an entire sequence of ordinary characters so that
2704 * it can turn them into a single node, which is smaller to store and
2705 * faster to run. Backslashed characters are exceptions, each becoming a
2706 * separate node; the code is simpler that way and it's not worth fixing.
2708 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2710 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2712 register regnode *ret = 0;
2714 char *parse_start = 0;
2716 *flagp = WORST; /* Tentatively. */
2719 switch (*RExC_parse) {
2721 RExC_seen_zerolen++;
2722 nextchar(pRExC_state);
2723 if (RExC_flags16 & PMf_MULTILINE)
2724 ret = reg_node(pRExC_state, MBOL);
2725 else if (RExC_flags16 & PMf_SINGLELINE)
2726 ret = reg_node(pRExC_state, SBOL);
2728 ret = reg_node(pRExC_state, BOL);
2729 Set_Node_Length(ret, 1); /* MJD */
2732 nextchar(pRExC_state);
2734 RExC_seen_zerolen++;
2735 if (RExC_flags16 & PMf_MULTILINE)
2736 ret = reg_node(pRExC_state, MEOL);
2737 else if (RExC_flags16 & PMf_SINGLELINE)
2738 ret = reg_node(pRExC_state, SEOL);
2740 ret = reg_node(pRExC_state, EOL);
2741 Set_Node_Length(ret, 1); /* MJD */
2744 nextchar(pRExC_state);
2745 if (RExC_flags16 & PMf_SINGLELINE)
2746 ret = reg_node(pRExC_state, SANY);
2748 ret = reg_node(pRExC_state, REG_ANY);
2749 *flagp |= HASWIDTH|SIMPLE;
2751 Set_Node_Length(ret, 1); /* MJD */
2755 char *oregcomp_parse = ++RExC_parse;
2756 ret = regclass(pRExC_state);
2757 if (*RExC_parse != ']') {
2758 RExC_parse = oregcomp_parse;
2759 vFAIL("Unmatched [");
2761 nextchar(pRExC_state);
2762 *flagp |= HASWIDTH|SIMPLE;
2763 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
2767 nextchar(pRExC_state);
2768 ret = reg(pRExC_state, 1, &flags);
2770 if (flags & TRYAGAIN) {
2771 if (RExC_parse == RExC_end) {
2772 /* Make parent create an empty node if needed. */
2780 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2784 if (flags & TRYAGAIN) {
2788 vFAIL("Internal urp");
2789 /* Supposed to be caught earlier. */
2792 if (!regcurly(RExC_parse)) {
2801 vFAIL("Quantifier follows nothing");
2804 switch (*++RExC_parse) {
2806 RExC_seen_zerolen++;
2807 ret = reg_node(pRExC_state, SBOL);
2809 nextchar(pRExC_state);
2810 Set_Node_Length(ret, 2); /* MJD */
2813 ret = reg_node(pRExC_state, GPOS);
2814 RExC_seen |= REG_SEEN_GPOS;
2816 nextchar(pRExC_state);
2817 Set_Node_Length(ret, 2); /* MJD */
2820 ret = reg_node(pRExC_state, SEOL);
2822 RExC_seen_zerolen++; /* Do not optimize RE away */
2823 nextchar(pRExC_state);
2826 ret = reg_node(pRExC_state, EOS);
2828 RExC_seen_zerolen++; /* Do not optimize RE away */
2829 nextchar(pRExC_state);
2830 Set_Node_Length(ret, 2); /* MJD */
2833 ret = reg_node(pRExC_state, CANY);
2834 RExC_seen |= REG_SEEN_CANY;
2835 *flagp |= HASWIDTH|SIMPLE;
2836 nextchar(pRExC_state);
2837 Set_Node_Length(ret, 2); /* MJD */
2840 ret = reg_node(pRExC_state, CLUMP);
2842 nextchar(pRExC_state);
2843 Set_Node_Length(ret, 2); /* MJD */
2846 ret = reg_node(pRExC_state, LOC ? ALNUML : ALNUM);
2847 *flagp |= HASWIDTH|SIMPLE;
2848 nextchar(pRExC_state);
2849 Set_Node_Length(ret, 2); /* MJD */
2852 ret = reg_node(pRExC_state, LOC ? NALNUML : NALNUM);
2853 *flagp |= HASWIDTH|SIMPLE;
2854 nextchar(pRExC_state);
2855 Set_Node_Length(ret, 2); /* MJD */
2858 RExC_seen_zerolen++;
2859 RExC_seen |= REG_SEEN_LOOKBEHIND;
2860 ret = reg_node(pRExC_state, LOC ? BOUNDL : BOUND);
2862 nextchar(pRExC_state);
2863 Set_Node_Length(ret, 2); /* MJD */
2866 RExC_seen_zerolen++;
2867 RExC_seen |= REG_SEEN_LOOKBEHIND;
2868 ret = reg_node(pRExC_state, LOC ? NBOUNDL : NBOUND);
2870 nextchar(pRExC_state);
2871 Set_Node_Length(ret, 2); /* MJD */
2874 ret = reg_node(pRExC_state, LOC ? SPACEL : SPACE);
2875 *flagp |= HASWIDTH|SIMPLE;
2876 nextchar(pRExC_state);
2877 Set_Node_Length(ret, 2); /* MJD */
2880 ret = reg_node(pRExC_state, LOC ? NSPACEL : NSPACE);
2881 *flagp |= HASWIDTH|SIMPLE;
2882 nextchar(pRExC_state);
2883 Set_Node_Length(ret, 2); /* MJD */
2886 ret = reg_node(pRExC_state, DIGIT);
2887 *flagp |= HASWIDTH|SIMPLE;
2888 nextchar(pRExC_state);
2889 Set_Node_Length(ret, 2); /* MJD */
2892 ret = reg_node(pRExC_state, NDIGIT);
2893 *flagp |= HASWIDTH|SIMPLE;
2894 nextchar(pRExC_state);
2895 Set_Node_Length(ret, 2); /* MJD */
2900 char* oldregxend = RExC_end;
2901 char* parse_start = RExC_parse;
2903 if (RExC_parse[1] == '{') {
2904 /* a lovely hack--pretend we saw [\pX] instead */
2905 RExC_end = strchr(RExC_parse, '}');
2907 U8 c = (U8)*RExC_parse;
2909 RExC_end = oldregxend;
2910 vFAIL2("Missing right brace on \\%c{}", c);
2915 RExC_end = RExC_parse + 2;
2918 ret = regclass(pRExC_state);
2920 RExC_end = oldregxend;
2922 Set_Node_Cur_Length(ret); /* MJD */
2923 nextchar(pRExC_state);
2924 *flagp |= HASWIDTH|SIMPLE;
2937 case '1': case '2': case '3': case '4':
2938 case '5': case '6': case '7': case '8': case '9':
2940 I32 num = atoi(RExC_parse);
2942 if (num > 9 && num >= RExC_npar)
2945 char * parse_start = RExC_parse - 1; /* MJD */
2946 while (isDIGIT(*RExC_parse))
2949 if (!SIZE_ONLY && num > RExC_rx->nparens)
2950 vFAIL("Reference to nonexistent group");
2952 ret = reganode(pRExC_state, FOLD
2953 ? (LOC ? REFFL : REFF)
2957 /* override incorrect value set in reganode MJD */
2958 Set_Node_Offset(ret, parse_start+1);
2959 Set_Node_Cur_Length(ret); /* MJD */
2961 nextchar(pRExC_state);
2966 if (RExC_parse >= RExC_end)
2967 FAIL("Trailing \\");
2970 /* Do not generate `unrecognized' warnings here, we fall
2971 back into the quick-grab loop below */
2977 if (RExC_flags16 & PMf_EXTENDED) {
2978 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
2979 if (RExC_parse < RExC_end)
2985 register STRLEN len;
2991 U8 tmpbuf[UTF8_MAXLEN_UCLC+1];
2993 parse_start = RExC_parse - 1;
2998 ret = reg_node(pRExC_state, FOLD
2999 ? (LOC ? EXACTFL : EXACTF)
3002 for (len = 0, p = RExC_parse - 1;
3003 len < 127 && p < RExC_end;
3008 if (RExC_flags16 & PMf_EXTENDED)
3009 p = regwhite(p, RExC_end);
3054 ender = ASCII_TO_NATIVE('\033');
3058 ender = ASCII_TO_NATIVE('\007');
3063 char* e = strchr(p, '}');
3067 vFAIL("Missing right brace on \\x{}");
3070 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3071 | PERL_SCAN_DISALLOW_PREFIX;
3073 ender = grok_hex(p + 1, &numlen, &flags, NULL);
3076 /* numlen is generous */
3077 if (numlen + len >= 127) {
3085 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
3087 ender = grok_hex(p, &numlen, &flags, NULL);
3093 ender = UCHARAT(p++);
3094 ender = toCTRL(ender);
3096 case '0': case '1': case '2': case '3':case '4':
3097 case '5': case '6': case '7': case '8':case '9':
3099 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
3102 ender = grok_oct(p, &numlen, &flags, NULL);
3112 FAIL("Trailing \\");
3115 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
3116 vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
3117 goto normal_default;
3122 if (UTF8_IS_START(*p) && UTF) {
3123 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3131 if (RExC_flags16 & PMf_EXTENDED)
3132 p = regwhite(p, RExC_end);
3134 toLOWER_uni(ender, tmpbuf, &ulen);
3135 ender = utf8_to_uvchr(tmpbuf, 0);
3137 if (ISMULT2(p)) { /* Back off on ?+*. */
3140 else if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3141 reguni(pRExC_state, ender, s, &numlen);
3151 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(ender)) && UTF) {
3152 reguni(pRExC_state, ender, s, &numlen);
3161 Set_Node_Cur_Length(ret); /* MJD */
3162 nextchar(pRExC_state);
3164 /* len is STRLEN which is unsigned, need to copy to signed */
3167 vFAIL("Internal disaster");
3176 RExC_size += STR_SZ(len);
3178 RExC_emit += STR_SZ(len);
3183 if (PL_encoding && PL_regkind[(U8)OP(ret)] == EXACT && !RExC_utf8) {
3184 STRLEN oldlen = STR_LEN(ret);
3185 SV *sv = sv_2mortal(newSVpvn(STRING(ret), oldlen));
3186 char *s = Perl_sv_recode_to_utf8(aTHX_ sv, PL_encoding);
3187 STRLEN newlen = SvCUR(sv);
3189 DEBUG_r(PerlIO_printf(Perl_debug_log, "recode %*s to %*s\n",
3190 (int)oldlen, STRING(ret), (int)newlen, s));
3191 Copy(s, STRING(ret), newlen, char);
3192 STR_LEN(ret) += newlen - oldlen;
3193 RExC_emit += STR_SZ(newlen) - STR_SZ(oldlen);
3195 RExC_size += STR_SZ(newlen) - STR_SZ(oldlen);
3203 S_regwhite(pTHX_ char *p, char *e)
3208 else if (*p == '#') {
3211 } while (p < e && *p != '\n');
3219 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3220 Character classes ([:foo:]) can also be negated ([:^foo:]).
3221 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3222 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3223 but trigger failures because they are currently unimplemented. */
3225 #define POSIXCC_DONE(c) ((c) == ':')
3226 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
3227 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
3230 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3233 I32 namedclass = OOB_NAMEDCLASS;
3235 if (value == '[' && RExC_parse + 1 < RExC_end &&
3236 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3237 POSIXCC(UCHARAT(RExC_parse))) {
3238 char c = UCHARAT(RExC_parse);
3239 char* s = RExC_parse++;
3241 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
3243 if (RExC_parse == RExC_end)
3244 /* Grandfather lone [:, [=, [. */
3247 char* t = RExC_parse++; /* skip over the c */
3249 if (UCHARAT(RExC_parse) == ']') {
3250 RExC_parse++; /* skip over the ending ] */
3253 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3254 I32 skip = 5; /* the most common skip */
3258 if (strnEQ(posixcc, "alnum", 5))
3260 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3261 else if (strnEQ(posixcc, "alpha", 5))
3263 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3264 else if (strnEQ(posixcc, "ascii", 5))
3266 complement ? ANYOF_NASCII : ANYOF_ASCII;
3269 if (strnEQ(posixcc, "blank", 5))
3271 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3274 if (strnEQ(posixcc, "cntrl", 5))
3276 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3279 if (strnEQ(posixcc, "digit", 5))
3281 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3284 if (strnEQ(posixcc, "graph", 5))
3286 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3289 if (strnEQ(posixcc, "lower", 5))
3291 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3294 if (strnEQ(posixcc, "print", 5))
3296 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3297 else if (strnEQ(posixcc, "punct", 5))
3299 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3302 if (strnEQ(posixcc, "space", 5))
3304 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3307 if (strnEQ(posixcc, "upper", 5))
3309 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3311 case 'w': /* this is not POSIX, this is the Perl \w */
3312 if (strnEQ(posixcc, "word", 4)) {
3314 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3319 if (strnEQ(posixcc, "xdigit", 6)) {
3321 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3326 if (namedclass == OOB_NAMEDCLASS ||
3327 posixcc[skip] != ':' ||
3328 posixcc[skip+1] != ']')
3330 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3333 } else if (!SIZE_ONLY) {
3334 /* [[=foo=]] and [[.foo.]] are still future. */
3336 /* adjust RExC_parse so the warning shows after
3338 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
3340 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3343 /* Maternal grandfather:
3344 * "[:" ending in ":" but not in ":]" */
3354 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3356 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) &&
3357 POSIXCC(UCHARAT(RExC_parse))) {
3358 char *s = RExC_parse;
3361 while(*s && isALNUM(*s))
3363 if (*s && c == *s && s[1] == ']') {
3364 vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c);
3366 /* [[=foo=]] and [[.foo.]] are still future. */
3367 if (POSIXCC_NOTYET(c)) {
3368 /* adjust RExC_parse so the error shows after
3370 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
3372 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3379 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3382 register UV nextvalue;
3383 register IV prevvalue = OOB_UNICODE;
3384 register IV range = 0;
3385 register regnode *ret;
3388 char *rangebegin = 0;
3389 bool need_class = 0;
3390 SV *listsv = Nullsv;
3393 bool optimize_invert = TRUE;
3395 ret = reganode(pRExC_state, ANYOF, 0);
3398 ANYOF_FLAGS(ret) = 0;
3400 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
3404 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3408 RExC_size += ANYOF_SKIP;
3410 RExC_emit += ANYOF_SKIP;
3412 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3414 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3415 ANYOF_BITMAP_ZERO(ret);
3416 listsv = newSVpvn("# comment\n", 10);
3419 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
3421 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && POSIXCC(nextvalue))
3422 checkposixcc(pRExC_state);
3424 if (UCHARAT(RExC_parse) == ']' || UCHARAT(RExC_parse) == '-')
3425 goto charclassloop; /* allow 1st char to be ] or - */
3427 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
3431 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3434 rangebegin = RExC_parse;
3436 value = utf8n_to_uvchr((U8*)RExC_parse,
3437 RExC_end - RExC_parse,
3439 RExC_parse += numlen;
3442 value = UCHARAT(RExC_parse++);
3443 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
3444 if (value == '[' && POSIXCC(nextvalue))
3445 namedclass = regpposixcc(pRExC_state, value);
3446 else if (value == '\\') {
3448 value = utf8n_to_uvchr((U8*)RExC_parse,
3449 RExC_end - RExC_parse,
3451 RExC_parse += numlen;
3454 value = UCHARAT(RExC_parse++);
3455 /* Some compilers cannot handle switching on 64-bit integer
3456 * values, therefore value cannot be an UV. Yes, this will
3457 * be a problem later if we want switch on Unicode.
3458 * A similar issue a little bit later when switching on
3459 * namedclass. --jhi */
3460 switch ((I32)value) {
3461 case 'w': namedclass = ANYOF_ALNUM; break;
3462 case 'W': namedclass = ANYOF_NALNUM; break;
3463 case 's': namedclass = ANYOF_SPACE; break;
3464 case 'S': namedclass = ANYOF_NSPACE; break;
3465 case 'd': namedclass = ANYOF_DIGIT; break;
3466 case 'D': namedclass = ANYOF_NDIGIT; break;
3469 if (*RExC_parse == '{') {
3471 e = strchr(RExC_parse++, '}');
3473 vFAIL2("Missing right brace on \\%c{}", c);
3474 while (isSPACE(UCHARAT(RExC_parse)))
3476 if (e == RExC_parse)
3477 vFAIL2("Empty \\%c{}", c);
3479 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
3487 if (UCHARAT(RExC_parse) == '^') {
3490 value = value == 'p' ? 'P' : 'p'; /* toggle */
3491 while (isSPACE(UCHARAT(RExC_parse))) {
3497 Perl_sv_catpvf(aTHX_ listsv,
3498 "+utf8::%.*s\n", (int)n, RExC_parse);
3500 Perl_sv_catpvf(aTHX_ listsv,
3501 "!utf8::%.*s\n", (int)n, RExC_parse);
3504 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3506 case 'n': value = '\n'; break;
3507 case 'r': value = '\r'; break;
3508 case 't': value = '\t'; break;
3509 case 'f': value = '\f'; break;
3510 case 'b': value = '\b'; break;
3511 case 'e': value = ASCII_TO_NATIVE('\033');break;
3512 case 'a': value = ASCII_TO_NATIVE('\007');break;
3514 if (*RExC_parse == '{') {
3515 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3516 | PERL_SCAN_DISALLOW_PREFIX;
3517 e = strchr(RExC_parse++, '}');
3519 vFAIL("Missing right brace on \\x{}");
3521 numlen = e - RExC_parse;
3522 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
3526 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
3528 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
3529 RExC_parse += numlen;
3533 value = UCHARAT(RExC_parse++);
3534 value = toCTRL(value);
3536 case '0': case '1': case '2': case '3': case '4':
3537 case '5': case '6': case '7': case '8': case '9':
3541 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
3542 RExC_parse += numlen;
3546 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3548 "Unrecognized escape \\%c in character class passed through",
3552 } /* end of \blah */
3554 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3556 if (!SIZE_ONLY && !need_class)
3557 ANYOF_CLASS_ZERO(ret);
3561 /* a bad range like a-\d, a-[:digit:] ? */
3564 if (ckWARN(WARN_REGEXP))
3566 "False [] range \"%*.*s\"",
3567 RExC_parse - rangebegin,
3568 RExC_parse - rangebegin,
3570 if (prevvalue < 256) {
3571 ANYOF_BITMAP_SET(ret, prevvalue);
3572 ANYOF_BITMAP_SET(ret, '-');
3575 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3576 Perl_sv_catpvf(aTHX_ listsv,
3577 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
3581 range = 0; /* this was not a true range */
3585 if (namedclass > OOB_NAMEDCLASS)
3586 optimize_invert = FALSE;
3587 /* Possible truncation here but in some 64-bit environments
3588 * the compiler gets heartburn about switch on 64-bit values.
3589 * A similar issue a little earlier when switching on value.
3591 switch ((I32)namedclass) {
3594 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3596 for (value = 0; value < 256; value++)
3598 ANYOF_BITMAP_SET(ret, value);
3600 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3604 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3606 for (value = 0; value < 256; value++)
3607 if (!isALNUM(value))
3608 ANYOF_BITMAP_SET(ret, value);
3610 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3614 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3616 for (value = 0; value < 256; value++)
3617 if (isALNUMC(value))
3618 ANYOF_BITMAP_SET(ret, value);
3620 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3624 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3626 for (value = 0; value < 256; value++)
3627 if (!isALNUMC(value))
3628 ANYOF_BITMAP_SET(ret, value);
3630 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3634 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3636 for (value = 0; value < 256; value++)
3638 ANYOF_BITMAP_SET(ret, value);
3640 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3644 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3646 for (value = 0; value < 256; value++)
3647 if (!isALPHA(value))
3648 ANYOF_BITMAP_SET(ret, value);
3650 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3654 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3657 for (value = 0; value < 128; value++)
3658 ANYOF_BITMAP_SET(ret, value);
3660 for (value = 0; value < 256; value++) {
3662 ANYOF_BITMAP_SET(ret, value);
3666 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3670 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3673 for (value = 128; value < 256; value++)
3674 ANYOF_BITMAP_SET(ret, value);
3676 for (value = 0; value < 256; value++) {
3677 if (!isASCII(value))
3678 ANYOF_BITMAP_SET(ret, value);
3682 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3686 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3688 for (value = 0; value < 256; value++)
3690 ANYOF_BITMAP_SET(ret, value);
3692 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3696 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3698 for (value = 0; value < 256; value++)
3699 if (!isBLANK(value))
3700 ANYOF_BITMAP_SET(ret, value);
3702 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3706 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3708 for (value = 0; value < 256; value++)
3710 ANYOF_BITMAP_SET(ret, value);
3712 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3716 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3718 for (value = 0; value < 256; value++)
3719 if (!isCNTRL(value))
3720 ANYOF_BITMAP_SET(ret, value);
3722 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3726 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3728 /* consecutive digits assumed */
3729 for (value = '0'; value <= '9'; value++)
3730 ANYOF_BITMAP_SET(ret, value);
3732 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3736 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3738 /* consecutive digits assumed */
3739 for (value = 0; value < '0'; value++)
3740 ANYOF_BITMAP_SET(ret, value);
3741 for (value = '9' + 1; value < 256; value++)
3742 ANYOF_BITMAP_SET(ret, value);
3744 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3748 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3750 for (value = 0; value < 256; value++)
3752 ANYOF_BITMAP_SET(ret, value);
3754 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3758 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3760 for (value = 0; value < 256; value++)
3761 if (!isGRAPH(value))
3762 ANYOF_BITMAP_SET(ret, value);
3764 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3768 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3770 for (value = 0; value < 256; value++)
3772 ANYOF_BITMAP_SET(ret, value);
3774 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3778 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3780 for (value = 0; value < 256; value++)
3781 if (!isLOWER(value))
3782 ANYOF_BITMAP_SET(ret, value);
3784 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3788 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3790 for (value = 0; value < 256; value++)
3792 ANYOF_BITMAP_SET(ret, value);
3794 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3798 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3800 for (value = 0; value < 256; value++)
3801 if (!isPRINT(value))
3802 ANYOF_BITMAP_SET(ret, value);
3804 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3808 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3810 for (value = 0; value < 256; value++)
3811 if (isPSXSPC(value))
3812 ANYOF_BITMAP_SET(ret, value);
3814 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3818 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3820 for (value = 0; value < 256; value++)
3821 if (!isPSXSPC(value))
3822 ANYOF_BITMAP_SET(ret, value);
3824 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3828 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3830 for (value = 0; value < 256; value++)
3832 ANYOF_BITMAP_SET(ret, value);
3834 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3838 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
3840 for (value = 0; value < 256; value++)
3841 if (!isPUNCT(value))
3842 ANYOF_BITMAP_SET(ret, value);
3844 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
3848 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
3850 for (value = 0; value < 256; value++)
3852 ANYOF_BITMAP_SET(ret, value);
3854 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
3858 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
3860 for (value = 0; value < 256; value++)
3861 if (!isSPACE(value))
3862 ANYOF_BITMAP_SET(ret, value);
3864 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
3868 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
3870 for (value = 0; value < 256; value++)
3872 ANYOF_BITMAP_SET(ret, value);
3874 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
3878 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
3880 for (value = 0; value < 256; value++)
3881 if (!isUPPER(value))
3882 ANYOF_BITMAP_SET(ret, value);
3884 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
3888 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
3890 for (value = 0; value < 256; value++)
3891 if (isXDIGIT(value))
3892 ANYOF_BITMAP_SET(ret, value);
3894 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
3898 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
3900 for (value = 0; value < 256; value++)
3901 if (!isXDIGIT(value))
3902 ANYOF_BITMAP_SET(ret, value);
3904 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
3907 vFAIL("Invalid [::] class");
3911 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
3914 } /* end of namedclass \blah */
3917 if (prevvalue > value) /* b-a */ {
3918 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
3919 RExC_parse - rangebegin,
3920 RExC_parse - rangebegin,
3922 range = 0; /* not a valid range */
3926 prevvalue = value; /* save the beginning of the range */
3927 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
3928 RExC_parse[1] != ']') {
3931 /* a bad range like \w-, [:word:]- ? */
3932 if (namedclass > OOB_NAMEDCLASS) {
3933 if (ckWARN(WARN_REGEXP))
3935 "False [] range \"%*.*s\"",
3936 RExC_parse - rangebegin,
3937 RExC_parse - rangebegin,
3940 ANYOF_BITMAP_SET(ret, '-');
3942 range = 1; /* yeah, it's a range! */
3943 continue; /* but do it the next time */
3947 /* now is the next time */
3951 if (prevvalue < 256) {
3952 IV ceilvalue = value < 256 ? value : 255;
3955 if ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
3956 (isUPPER(prevvalue) && isUPPER(ceilvalue)))
3958 if (isLOWER(prevvalue)) {
3959 for (i = prevvalue; i <= ceilvalue; i++)
3961 ANYOF_BITMAP_SET(ret, i);
3963 for (i = prevvalue; i <= ceilvalue; i++)
3965 ANYOF_BITMAP_SET(ret, i);
3970 for (i = prevvalue; i <= ceilvalue; i++)
3971 ANYOF_BITMAP_SET(ret, i);
3974 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3975 if (prevvalue < value)
3976 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
3977 (UV)prevvalue, (UV)value);
3978 else if (prevvalue == value)
3979 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
3984 range = 0; /* this range (if it was one) is done now */
3988 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
3990 RExC_size += ANYOF_CLASS_ADD_SKIP;
3992 RExC_emit += ANYOF_CLASS_ADD_SKIP;
3995 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
3997 /* If the only flag is folding (plus possibly inversion). */
3998 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
4000 for (value = 0; value < 256; ++value) {
4001 if (ANYOF_BITMAP_TEST(ret, value)) {
4002 IV fold = PL_fold[value];
4005 ANYOF_BITMAP_SET(ret, fold);
4008 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
4011 /* optimize inverted simple patterns (e.g. [^a-z]) */
4012 if (!SIZE_ONLY && optimize_invert &&
4013 /* If the only flag is inversion. */
4014 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
4015 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
4016 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
4017 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
4024 av_store(av, 0, listsv);
4025 av_store(av, 1, NULL);
4026 rv = newRV_noinc((SV*)av);
4027 n = add_data(pRExC_state, 1, "s");
4028 RExC_rx->data->data[n] = (void*)rv;
4036 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
4038 char* retval = RExC_parse++;
4041 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
4042 RExC_parse[2] == '#') {
4043 while (*RExC_parse && *RExC_parse != ')')
4048 if (RExC_flags16 & PMf_EXTENDED) {
4049 if (isSPACE(*RExC_parse)) {
4053 else if (*RExC_parse == '#') {
4054 while (*RExC_parse && *RExC_parse != '\n')
4065 - reg_node - emit a node
4067 STATIC regnode * /* Location. */
4068 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
4070 register regnode *ret;
4071 register regnode *ptr;
4075 SIZE_ALIGN(RExC_size);
4080 NODE_ALIGN_FILL(ret);
4082 FILL_ADVANCE_NODE(ptr, op);
4083 if (RExC_offsets) { /* MJD */
4084 MJD_OFFSET_DEBUG((stderr, "%s:%u: (op %s) %s %u <- %u (len %u) (max %u).\n",
4085 "reg_node", __LINE__,
4087 RExC_emit - RExC_emit_start > RExC_offsets[0]
4088 ? "Overwriting end of array!\n" : "OK",
4089 RExC_emit - RExC_emit_start,
4090 RExC_parse - RExC_start,
4092 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
4101 - reganode - emit a node with an argument
4103 STATIC regnode * /* Location. */
4104 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4106 register regnode *ret;
4107 register regnode *ptr;
4111 SIZE_ALIGN(RExC_size);
4116 NODE_ALIGN_FILL(ret);
4118 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
4119 if (RExC_offsets) { /* MJD */
4120 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4122 RExC_emit - RExC_emit_start > RExC_offsets[0] ?
4123 "Overwriting end of array!\n" : "OK",
4124 RExC_emit - RExC_emit_start,
4125 RExC_parse - RExC_start,
4127 Set_Cur_Node_Offset;
4136 - reguni - emit (if appropriate) a Unicode character
4139 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
4141 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4145 - reginsert - insert an operator in front of already-emitted operand
4147 * Means relocating the operand.
4150 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4152 register regnode *src;
4153 register regnode *dst;
4154 register regnode *place;
4155 register int offset = regarglen[(U8)op];
4157 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4160 RExC_size += NODE_STEP_REGNODE + offset;
4165 RExC_emit += NODE_STEP_REGNODE + offset;
4167 while (src > opnd) {
4168 StructCopy(--src, --dst, regnode);
4169 if (RExC_offsets) { /* MJD 20010112 */
4170 MJD_OFFSET_DEBUG((stderr, "%s: %s copy %u -> %u (max %u).\n",
4172 dst - RExC_emit_start > RExC_offsets[0]
4173 ? "Overwriting end of array!\n" : "OK",
4174 src - RExC_emit_start,
4175 dst - RExC_emit_start,
4177 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
4178 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
4183 place = opnd; /* Op node, where operand used to be. */
4184 if (RExC_offsets) { /* MJD */
4185 MJD_OFFSET_DEBUG((stderr, "%s: %s %u <- %u (max %u).\n",
4187 place - RExC_emit_start > RExC_offsets[0]
4188 ? "Overwriting end of array!\n" : "OK",
4189 place - RExC_emit_start,
4190 RExC_parse - RExC_start,
4192 Set_Node_Offset(place, RExC_parse);
4194 src = NEXTOPER(place);
4195 FILL_ADVANCE_NODE(place, op);
4196 Zero(src, offset, regnode);
4200 - regtail - set the next-pointer at the end of a node chain of p to val.
4203 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4205 register regnode *scan;
4206 register regnode *temp;
4211 /* Find last node. */
4214 temp = regnext(scan);
4220 if (reg_off_by_arg[OP(scan)]) {
4221 ARG_SET(scan, val - scan);
4224 NEXT_OFF(scan) = val - scan;
4229 - regoptail - regtail on operand of first argument; nop if operandless
4232 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4234 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4235 if (p == NULL || SIZE_ONLY)
4237 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4238 regtail(pRExC_state, NEXTOPER(p), val);
4240 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4241 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4248 - regcurly - a little FSA that accepts {\d+,?\d*}
4251 S_regcurly(pTHX_ register char *s)
4272 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4274 register U8 op = EXACT; /* Arbitrary non-END op. */
4275 register regnode *next;
4277 while (op != END && (!last || node < last)) {
4278 /* While that wasn't END last time... */
4284 next = regnext(node);
4286 if (OP(node) == OPTIMIZED)
4289 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4290 (int)(2*l + 1), "", SvPVX(sv));
4291 if (next == NULL) /* Next ptr. */
4292 PerlIO_printf(Perl_debug_log, "(0)");
4294 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4295 (void)PerlIO_putc(Perl_debug_log, '\n');
4297 if (PL_regkind[(U8)op] == BRANCHJ) {
4298 register regnode *nnode = (OP(next) == LONGJMP
4301 if (last && nnode > last)
4303 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4305 else if (PL_regkind[(U8)op] == BRANCH) {
4306 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4308 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4309 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4310 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4312 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4313 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4316 else if ( op == PLUS || op == STAR) {
4317 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4319 else if (op == ANYOF) {
4320 /* arglen 1 + class block */
4321 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
4322 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
4323 node = NEXTOPER(node);
4325 else if (PL_regkind[(U8)op] == EXACT) {
4326 /* Literal string, where present. */
4327 node += NODE_SZ_STR(node) - 1;
4328 node = NEXTOPER(node);
4331 node = NEXTOPER(node);
4332 node += regarglen[(U8)op];
4334 if (op == CURLYX || op == OPEN)
4336 else if (op == WHILEM)
4342 #endif /* DEBUGGING */
4345 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4348 Perl_regdump(pTHX_ regexp *r)
4351 SV *sv = sv_newmortal();
4353 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4355 /* Header fields of interest. */
4356 if (r->anchored_substr)
4357 PerlIO_printf(Perl_debug_log,
4358 "anchored `%s%.*s%s'%s at %"IVdf" ",
4360 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4361 SvPVX(r->anchored_substr),
4363 SvTAIL(r->anchored_substr) ? "$" : "",
4364 (IV)r->anchored_offset);
4365 if (r->float_substr)
4366 PerlIO_printf(Perl_debug_log,
4367 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4369 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4370 SvPVX(r->float_substr),
4372 SvTAIL(r->float_substr) ? "$" : "",
4373 (IV)r->float_min_offset, (UV)r->float_max_offset);
4374 if (r->check_substr)
4375 PerlIO_printf(Perl_debug_log,
4376 r->check_substr == r->float_substr
4377 ? "(checking floating" : "(checking anchored");
4378 if (r->reganch & ROPT_NOSCAN)
4379 PerlIO_printf(Perl_debug_log, " noscan");
4380 if (r->reganch & ROPT_CHECK_ALL)
4381 PerlIO_printf(Perl_debug_log, " isall");
4382 if (r->check_substr)
4383 PerlIO_printf(Perl_debug_log, ") ");
4385 if (r->regstclass) {
4386 regprop(sv, r->regstclass);
4387 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4389 if (r->reganch & ROPT_ANCH) {
4390 PerlIO_printf(Perl_debug_log, "anchored");
4391 if (r->reganch & ROPT_ANCH_BOL)
4392 PerlIO_printf(Perl_debug_log, "(BOL)");
4393 if (r->reganch & ROPT_ANCH_MBOL)
4394 PerlIO_printf(Perl_debug_log, "(MBOL)");
4395 if (r->reganch & ROPT_ANCH_SBOL)
4396 PerlIO_printf(Perl_debug_log, "(SBOL)");
4397 if (r->reganch & ROPT_ANCH_GPOS)
4398 PerlIO_printf(Perl_debug_log, "(GPOS)");
4399 PerlIO_putc(Perl_debug_log, ' ');
4401 if (r->reganch & ROPT_GPOS_SEEN)
4402 PerlIO_printf(Perl_debug_log, "GPOS ");
4403 if (r->reganch & ROPT_SKIP)
4404 PerlIO_printf(Perl_debug_log, "plus ");
4405 if (r->reganch & ROPT_IMPLICIT)
4406 PerlIO_printf(Perl_debug_log, "implicit ");
4407 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4408 if (r->reganch & ROPT_EVAL_SEEN)
4409 PerlIO_printf(Perl_debug_log, "with eval ");
4410 PerlIO_printf(Perl_debug_log, "\n");
4413 U32 len = r->offsets[0];
4414 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4415 for (i = 1; i <= len; i++)
4416 PerlIO_printf(Perl_debug_log, "%"UVuf"[%"UVuf"] ",
4417 (UV)r->offsets[i*2-1],
4418 (UV)r->offsets[i*2]);
4419 PerlIO_printf(Perl_debug_log, "\n");
4421 #endif /* DEBUGGING */
4427 S_put_byte(pTHX_ SV *sv, int c)
4429 if (isCNTRL(c) || c == 255 || !isPRINT(c))
4430 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4431 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4432 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4434 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4437 #endif /* DEBUGGING */
4440 - regprop - printable representation of opcode
4443 Perl_regprop(pTHX_ SV *sv, regnode *o)
4448 sv_setpvn(sv, "", 0);
4449 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4450 /* It would be nice to FAIL() here, but this may be called from
4451 regexec.c, and it would be hard to supply pRExC_state. */
4452 Perl_croak(aTHX_ "Corrupted regexp opcode");
4453 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4455 k = PL_regkind[(U8)OP(o)];
4458 SV *dsv = sv_2mortal(newSVpvn("", 0));
4459 bool do_utf8 = DO_UTF8(sv);
4461 pv_uni_display(dsv, (U8*)STRING(o), STR_LEN(o), 60, 0) :
4466 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>",
4471 else if (k == CURLY) {
4472 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4473 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4474 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4476 else if (k == WHILEM && o->flags) /* Ordinal/of */
4477 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4478 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4479 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4480 else if (k == LOGICAL)
4481 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4482 else if (k == ANYOF) {
4483 int i, rangestart = -1;
4484 U8 flags = ANYOF_FLAGS(o);
4485 const char * const anyofs[] = { /* Should be syncronized with
4486 * ANYOF_ #xdefines in regcomp.h */
4519 if (flags & ANYOF_LOCALE)
4520 sv_catpv(sv, "{loc}");
4521 if (flags & ANYOF_FOLD)
4522 sv_catpv(sv, "{i}");
4523 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4524 if (flags & ANYOF_INVERT)
4526 for (i = 0; i <= 256; i++) {
4527 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4528 if (rangestart == -1)
4530 } else if (rangestart != -1) {
4531 if (i <= rangestart + 3)
4532 for (; rangestart < i; rangestart++)
4533 put_byte(sv, rangestart);
4535 put_byte(sv, rangestart);
4537 put_byte(sv, i - 1);
4543 if (o->flags & ANYOF_CLASS)
4544 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4545 if (ANYOF_CLASS_TEST(o,i))
4546 sv_catpv(sv, anyofs[i]);
4548 if (flags & ANYOF_UNICODE)
4549 sv_catpv(sv, "{unicode}");
4550 else if (flags & ANYOF_UNICODE_ALL)
4551 sv_catpv(sv, "{unicode_all}");
4555 SV *sw = regclass_swash(o, FALSE, &lv);
4560 U8 s[UTF8_MAXLEN+1];
4562 for (i = 0; i <= 256; i++) { /* just the first 256 */
4563 U8 *e = uvchr_to_utf8(s, i);
4565 if (i < 256 && swash_fetch(sw, s, TRUE)) {
4566 if (rangestart == -1)
4568 } else if (rangestart != -1) {
4571 if (i <= rangestart + 3)
4572 for (; rangestart < i; rangestart++) {
4573 for(e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4577 for (e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4580 for (e = uvchr_to_utf8(s, i - 1), p = s; p < e; p++)
4587 sv_catpv(sv, "..."); /* et cetera */
4591 char *s = savepv(SvPVX(lv));
4594 while(*s && *s != '\n') s++;
4615 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4617 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4618 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4619 #endif /* DEBUGGING */
4623 Perl_re_intuit_string(pTHX_ regexp *prog)
4624 { /* Assume that RE_INTUIT is set */
4627 char *s = SvPV(prog->check_substr,n_a);
4629 if (!PL_colorset) reginitcolors();
4630 PerlIO_printf(Perl_debug_log,
4631 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
4632 PL_colors[4],PL_colors[5],PL_colors[0],
4635 (strlen(s) > 60 ? "..." : ""));
4638 return prog->check_substr;
4642 Perl_pregfree(pTHX_ struct regexp *r)
4644 DEBUG_r(if (!PL_colorset) reginitcolors());
4646 if (!r || (--r->refcnt > 0))
4648 DEBUG_r(PerlIO_printf(Perl_debug_log,
4649 "%sFreeing REx:%s `%s%.60s%s%s'\n",
4650 PL_colors[4],PL_colors[5],PL_colors[0],
4653 (strlen(r->precomp) > 60 ? "..." : "")));
4656 Safefree(r->precomp);
4657 if (r->offsets) /* 20010421 MJD */
4658 Safefree(r->offsets);
4659 if (RX_MATCH_COPIED(r))
4660 Safefree(r->subbeg);
4662 if (r->anchored_substr)
4663 SvREFCNT_dec(r->anchored_substr);
4664 if (r->float_substr)
4665 SvREFCNT_dec(r->float_substr);
4666 Safefree(r->substrs);
4669 int n = r->data->count;
4670 AV* new_comppad = NULL;
4675 /* If you add a ->what type here, update the comment in regcomp.h */
4676 switch (r->data->what[n]) {
4678 SvREFCNT_dec((SV*)r->data->data[n]);
4681 Safefree(r->data->data[n]);
4684 new_comppad = (AV*)r->data->data[n];
4687 if (new_comppad == NULL)
4688 Perl_croak(aTHX_ "panic: pregfree comppad");
4689 old_comppad = PL_comppad;
4690 old_curpad = PL_curpad;
4691 /* Watch out for global destruction's random ordering. */
4692 if (SvTYPE(new_comppad) == SVt_PVAV) {
4693 PL_comppad = new_comppad;
4694 PL_curpad = AvARRAY(new_comppad);
4699 if (!OpREFCNT_dec((OP_4tree*)r->data->data[n])) {
4700 op_free((OP_4tree*)r->data->data[n]);
4703 PL_comppad = old_comppad;
4704 PL_curpad = old_curpad;
4705 SvREFCNT_dec((SV*)new_comppad);
4711 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4714 Safefree(r->data->what);
4717 Safefree(r->startp);
4723 - regnext - dig the "next" pointer out of a node
4725 * [Note, when REGALIGN is defined there are two places in regmatch()
4726 * that bypass this code for speed.]
4729 Perl_regnext(pTHX_ register regnode *p)
4731 register I32 offset;
4733 if (p == &PL_regdummy)
4736 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
4744 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
4747 STRLEN l1 = strlen(pat1);
4748 STRLEN l2 = strlen(pat2);
4757 Copy(pat1, buf, l1 , char);
4758 Copy(pat2, buf + l1, l2 , char);
4759 buf[l1 + l2] = '\n';
4760 buf[l1 + l2 + 1] = '\0';
4762 /* ANSI variant takes additional second argument */
4763 va_start(args, pat2);
4767 msv = vmess(buf, &args);
4769 message = SvPV(msv,l1);
4772 Copy(message, buf, l1 , char);
4773 buf[l1] = '\0'; /* Overwrite \n */
4774 Perl_croak(aTHX_ "%s", buf);
4777 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
4780 Perl_save_re_context(pTHX)
4783 SAVEPPTR(RExC_precomp); /* uncompiled string. */
4784 SAVEI32(RExC_npar); /* () count. */
4785 SAVEI32(RExC_size); /* Code size. */
4786 SAVEI16(RExC_flags16); /* are we folding, multilining? */
4787 SAVEVPTR(RExC_rx); /* from regcomp.c */
4788 SAVEI32(RExC_seen); /* from regcomp.c */
4789 SAVEI32(RExC_sawback); /* Did we see \1, ...? */
4790 SAVEI32(RExC_naughty); /* How bad is this pattern? */
4791 SAVEVPTR(RExC_emit); /* Code-emit pointer; ®dummy = don't */
4792 SAVEPPTR(RExC_end); /* End of input for compile */
4793 SAVEPPTR(RExC_parse); /* Input-scan pointer. */
4796 SAVEI32(PL_reg_flags); /* from regexec.c */
4798 SAVEPPTR(PL_reginput); /* String-input pointer. */
4799 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
4800 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
4801 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
4802 SAVEVPTR(PL_regendp); /* Ditto for endp. */
4803 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
4804 SAVEPPTR(PL_regtill); /* How far we are required to go. */
4805 SAVEGENERICPV(PL_reg_start_tmp); /* from regexec.c */
4806 PL_reg_start_tmp = 0;
4807 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
4808 PL_reg_start_tmpl = 0;
4809 SAVEVPTR(PL_regdata);
4810 SAVEI32(PL_reg_eval_set); /* from regexec.c */
4811 SAVEI32(PL_regnarrate); /* from regexec.c */
4812 SAVEVPTR(PL_regprogram); /* from regexec.c */
4813 SAVEINT(PL_regindent); /* from regexec.c */
4814 SAVEVPTR(PL_regcc); /* from regexec.c */
4815 SAVEVPTR(PL_curcop);
4816 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
4817 SAVEVPTR(PL_reg_re); /* from regexec.c */
4818 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
4819 SAVESPTR(PL_reg_sv); /* from regexec.c */
4820 SAVEI8(PL_reg_match_utf8); /* from regexec.c */
4821 SAVEVPTR(PL_reg_magic); /* from regexec.c */
4822 SAVEI32(PL_reg_oldpos); /* from regexec.c */
4823 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
4824 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
4825 SAVEI32(PL_regnpar); /* () count. */
4826 SAVEI32(PL_regsize); /* from regexec.c */
4828 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
4833 clear_re(pTHX_ void *r)
4835 ReREFCNT_dec((regexp *)r);
https://perl5.git.perl.org / perl5.git / blob