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, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
73 **** 2000, 2001, 2002, 2003, by Larry Wall and others
75 **** You may distribute under the terms of either the GNU General Public
76 **** License or the Artistic License, as specified in the README file.
79 * Beware that some of this code is subtly aware of the way operator
80 * precedence is structured in regular expressions. Serious changes in
81 * regular-expression syntax might require a total rethink.
84 #define PERL_IN_REGCOMP_C
87 #ifndef PERL_IN_XSUB_RE
99 # if defined(BUGGY_MSC6)
100 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
101 # pragma optimize("a",off)
102 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
103 # pragma optimize("w",on )
104 # endif /* BUGGY_MSC6 */
108 #define STATIC static
111 typedef struct RExC_state_t {
112 U32 flags; /* are we folding, multilining? */
113 char *precomp; /* uncompiled string. */
115 char *start; /* Start of input for compile */
116 char *end; /* End of input for compile */
117 char *parse; /* Input-scan pointer. */
118 I32 whilem_seen; /* number of WHILEM in this expr */
119 regnode *emit_start; /* Start of emitted-code area */
120 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
121 I32 naughty; /* How bad is this pattern? */
122 I32 sawback; /* Did we see \1, ...? */
124 I32 size; /* Code size. */
125 I32 npar; /* () count. */
131 char *starttry; /* -Dr: where regtry was called. */
132 #define RExC_starttry (pRExC_state->starttry)
136 #define RExC_flags (pRExC_state->flags)
137 #define RExC_precomp (pRExC_state->precomp)
138 #define RExC_rx (pRExC_state->rx)
139 #define RExC_start (pRExC_state->start)
140 #define RExC_end (pRExC_state->end)
141 #define RExC_parse (pRExC_state->parse)
142 #define RExC_whilem_seen (pRExC_state->whilem_seen)
143 #define RExC_offsets (pRExC_state->rx->offsets) /* I am not like the others */
144 #define RExC_emit (pRExC_state->emit)
145 #define RExC_emit_start (pRExC_state->emit_start)
146 #define RExC_naughty (pRExC_state->naughty)
147 #define RExC_sawback (pRExC_state->sawback)
148 #define RExC_seen (pRExC_state->seen)
149 #define RExC_size (pRExC_state->size)
150 #define RExC_npar (pRExC_state->npar)
151 #define RExC_extralen (pRExC_state->extralen)
152 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
153 #define RExC_seen_evals (pRExC_state->seen_evals)
154 #define RExC_utf8 (pRExC_state->utf8)
156 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
157 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
158 ((*s) == '{' && regcurly(s)))
161 #undef SPSTART /* dratted cpp namespace... */
164 * Flags to be passed up and down.
166 #define WORST 0 /* Worst case. */
167 #define HASWIDTH 0x1 /* Known to match non-null strings. */
168 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
169 #define SPSTART 0x4 /* Starts with * or +. */
170 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
172 /* Length of a variant. */
174 typedef struct scan_data_t {
180 I32 last_end; /* min value, <0 unless valid. */
183 SV **longest; /* Either &l_fixed, or &l_float. */
187 I32 offset_float_min;
188 I32 offset_float_max;
192 struct regnode_charclass_class *start_class;
196 * Forward declarations for pregcomp()'s friends.
199 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
202 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
203 #define SF_BEFORE_SEOL 0x1
204 #define SF_BEFORE_MEOL 0x2
205 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
206 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
209 # define SF_FIX_SHIFT_EOL (0+2)
210 # define SF_FL_SHIFT_EOL (0+4)
212 # define SF_FIX_SHIFT_EOL (+2)
213 # define SF_FL_SHIFT_EOL (+4)
216 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
217 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
219 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
220 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
221 #define SF_IS_INF 0x40
222 #define SF_HAS_PAR 0x80
223 #define SF_IN_PAR 0x100
224 #define SF_HAS_EVAL 0x200
225 #define SCF_DO_SUBSTR 0x400
226 #define SCF_DO_STCLASS_AND 0x0800
227 #define SCF_DO_STCLASS_OR 0x1000
228 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
229 #define SCF_WHILEM_VISITED_POS 0x2000
231 #define UTF (RExC_utf8 != 0)
232 #define LOC ((RExC_flags & PMf_LOCALE) != 0)
233 #define FOLD ((RExC_flags & PMf_FOLD) != 0)
235 #define OOB_UNICODE 12345678
236 #define OOB_NAMEDCLASS -1
238 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
239 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
242 /* length of regex to show in messages that don't mark a position within */
243 #define RegexLengthToShowInErrorMessages 127
246 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
247 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
248 * op/pragma/warn/regcomp.
250 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
251 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
253 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
256 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
257 * arg. Show regex, up to a maximum length. If it's too long, chop and add
260 #define FAIL(msg) STMT_START { \
261 char *ellipses = ""; \
262 IV len = RExC_end - RExC_precomp; \
265 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
266 if (len > RegexLengthToShowInErrorMessages) { \
267 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
268 len = RegexLengthToShowInErrorMessages - 10; \
271 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
272 msg, (int)len, RExC_precomp, ellipses); \
276 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
277 * args. Show regex, up to a maximum length. If it's too long, chop and add
280 #define FAIL2(pat,msg) STMT_START { \
281 char *ellipses = ""; \
282 IV len = RExC_end - RExC_precomp; \
285 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
286 if (len > RegexLengthToShowInErrorMessages) { \
287 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
288 len = RegexLengthToShowInErrorMessages - 10; \
291 S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \
292 msg, (int)len, RExC_precomp, ellipses); \
297 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
299 #define Simple_vFAIL(m) STMT_START { \
300 IV offset = RExC_parse - RExC_precomp; \
301 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
302 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
306 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
308 #define vFAIL(m) STMT_START { \
310 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
315 * Like Simple_vFAIL(), but accepts two arguments.
317 #define Simple_vFAIL2(m,a1) STMT_START { \
318 IV offset = RExC_parse - RExC_precomp; \
319 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
320 (int)offset, RExC_precomp, RExC_precomp + offset); \
324 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
326 #define vFAIL2(m,a1) STMT_START { \
328 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
329 Simple_vFAIL2(m, a1); \
334 * Like Simple_vFAIL(), but accepts three arguments.
336 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
337 IV offset = RExC_parse - RExC_precomp; \
338 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
339 (int)offset, RExC_precomp, RExC_precomp + offset); \
343 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
345 #define vFAIL3(m,a1,a2) STMT_START { \
347 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
348 Simple_vFAIL3(m, a1, a2); \
352 * Like Simple_vFAIL(), but accepts four arguments.
354 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
355 IV offset = RExC_parse - RExC_precomp; \
356 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
357 (int)offset, RExC_precomp, RExC_precomp + offset); \
361 * Like Simple_vFAIL(), but accepts five arguments.
363 #define Simple_vFAIL5(m, a1, a2, a3, a4) STMT_START { \
364 IV offset = RExC_parse - RExC_precomp; \
365 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, a4, \
366 (int)offset, RExC_precomp, RExC_precomp + offset); \
370 #define vWARN(loc,m) STMT_START { \
371 IV offset = loc - RExC_precomp; \
372 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
373 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
376 #define vWARNdep(loc,m) STMT_START { \
377 IV offset = loc - RExC_precomp; \
378 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
379 "%s" REPORT_LOCATION, \
380 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
384 #define vWARN2(loc, m, a1) STMT_START { \
385 IV offset = loc - RExC_precomp; \
386 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
387 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
390 #define vWARN3(loc, m, a1, a2) STMT_START { \
391 IV offset = loc - RExC_precomp; \
392 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
393 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
396 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
397 IV offset = loc - RExC_precomp; \
398 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
399 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
402 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
403 IV offset = loc - RExC_precomp; \
404 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
405 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
409 /* Allow for side effects in s */
410 #define REGC(c,s) STMT_START { \
411 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
414 /* Macros for recording node offsets. 20001227 mjd@plover.com
415 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
416 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
417 * Element 0 holds the number n.
420 #define MJD_OFFSET_DEBUG(x)
421 /* #define MJD_OFFSET_DEBUG(x) Perl_warn_nocontext x */
424 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
426 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
427 __LINE__, (node), (byte))); \
429 Perl_croak(aTHX_ "value of node is %d in Offset macro", node); \
431 RExC_offsets[2*(node)-1] = (byte); \
436 #define Set_Node_Offset(node,byte) \
437 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
438 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
440 #define Set_Node_Length_To_R(node,len) STMT_START { \
442 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
443 __LINE__, (node), (len))); \
445 Perl_croak(aTHX_ "value of node is %d in Length macro", node); \
447 RExC_offsets[2*(node)] = (len); \
452 #define Set_Node_Length(node,len) \
453 Set_Node_Length_To_R((node)-RExC_emit_start, len)
454 #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
455 #define Set_Node_Cur_Length(node) \
456 Set_Node_Length(node, RExC_parse - parse_start)
458 /* Get offsets and lengths */
459 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
460 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
462 static void clear_re(pTHX_ void *r);
464 /* Mark that we cannot extend a found fixed substring at this point.
465 Updata the longest found anchored substring and the longest found
466 floating substrings if needed. */
469 S_scan_commit(pTHX_ RExC_state_t *pRExC_state, scan_data_t *data)
471 STRLEN l = CHR_SVLEN(data->last_found);
472 STRLEN old_l = CHR_SVLEN(*data->longest);
474 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
475 SvSetMagicSV(*data->longest, data->last_found);
476 if (*data->longest == data->longest_fixed) {
477 data->offset_fixed = l ? data->last_start_min : data->pos_min;
478 if (data->flags & SF_BEFORE_EOL)
480 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
482 data->flags &= ~SF_FIX_BEFORE_EOL;
485 data->offset_float_min = l ? data->last_start_min : data->pos_min;
486 data->offset_float_max = (l
487 ? data->last_start_max
488 : data->pos_min + data->pos_delta);
489 if ((U32)data->offset_float_max > (U32)I32_MAX)
490 data->offset_float_max = I32_MAX;
491 if (data->flags & SF_BEFORE_EOL)
493 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
495 data->flags &= ~SF_FL_BEFORE_EOL;
498 SvCUR_set(data->last_found, 0);
500 SV * sv = data->last_found;
502 SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
503 if (mg && mg->mg_len > 0)
507 data->flags &= ~SF_BEFORE_EOL;
510 /* Can match anything (initialization) */
512 S_cl_anything(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
514 ANYOF_CLASS_ZERO(cl);
515 ANYOF_BITMAP_SETALL(cl);
516 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
518 cl->flags |= ANYOF_LOCALE;
521 /* Can match anything (initialization) */
523 S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl)
527 for (value = 0; value <= ANYOF_MAX; value += 2)
528 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
530 if (!(cl->flags & ANYOF_UNICODE_ALL))
532 if (!ANYOF_BITMAP_TESTALLSET(cl))
537 /* Can match anything (initialization) */
539 S_cl_init(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
541 Zero(cl, 1, struct regnode_charclass_class);
543 cl_anything(pRExC_state, cl);
547 S_cl_init_zero(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
549 Zero(cl, 1, struct regnode_charclass_class);
551 cl_anything(pRExC_state, cl);
553 cl->flags |= ANYOF_LOCALE;
556 /* 'And' a given class with another one. Can create false positives */
557 /* We assume that cl is not inverted */
559 S_cl_and(pTHX_ struct regnode_charclass_class *cl,
560 struct regnode_charclass_class *and_with)
562 if (!(and_with->flags & ANYOF_CLASS)
563 && !(cl->flags & ANYOF_CLASS)
564 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
565 && !(and_with->flags & ANYOF_FOLD)
566 && !(cl->flags & ANYOF_FOLD)) {
569 if (and_with->flags & ANYOF_INVERT)
570 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
571 cl->bitmap[i] &= ~and_with->bitmap[i];
573 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
574 cl->bitmap[i] &= and_with->bitmap[i];
575 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
576 if (!(and_with->flags & ANYOF_EOS))
577 cl->flags &= ~ANYOF_EOS;
579 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE &&
580 !(and_with->flags & ANYOF_INVERT)) {
581 cl->flags &= ~ANYOF_UNICODE_ALL;
582 cl->flags |= ANYOF_UNICODE;
583 ARG_SET(cl, ARG(and_with));
585 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
586 !(and_with->flags & ANYOF_INVERT))
587 cl->flags &= ~ANYOF_UNICODE_ALL;
588 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) &&
589 !(and_with->flags & ANYOF_INVERT))
590 cl->flags &= ~ANYOF_UNICODE;
593 /* 'OR' a given class with another one. Can create false positives */
594 /* We assume that cl is not inverted */
596 S_cl_or(pTHX_ RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with)
598 if (or_with->flags & ANYOF_INVERT) {
600 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
601 * <= (B1 | !B2) | (CL1 | !CL2)
602 * which is wasteful if CL2 is small, but we ignore CL2:
603 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
604 * XXXX Can we handle case-fold? Unclear:
605 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
606 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
608 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
609 && !(or_with->flags & ANYOF_FOLD)
610 && !(cl->flags & ANYOF_FOLD) ) {
613 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
614 cl->bitmap[i] |= ~or_with->bitmap[i];
615 } /* XXXX: logic is complicated otherwise */
617 cl_anything(pRExC_state, cl);
620 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
621 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
622 && (!(or_with->flags & ANYOF_FOLD)
623 || (cl->flags & ANYOF_FOLD)) ) {
626 /* OR char bitmap and class bitmap separately */
627 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
628 cl->bitmap[i] |= or_with->bitmap[i];
629 if (or_with->flags & ANYOF_CLASS) {
630 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
631 cl->classflags[i] |= or_with->classflags[i];
632 cl->flags |= ANYOF_CLASS;
635 else { /* XXXX: logic is complicated, leave it along for a moment. */
636 cl_anything(pRExC_state, cl);
639 if (or_with->flags & ANYOF_EOS)
640 cl->flags |= ANYOF_EOS;
642 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
643 ARG(cl) != ARG(or_with)) {
644 cl->flags |= ANYOF_UNICODE_ALL;
645 cl->flags &= ~ANYOF_UNICODE;
647 if (or_with->flags & ANYOF_UNICODE_ALL) {
648 cl->flags |= ANYOF_UNICODE_ALL;
649 cl->flags &= ~ANYOF_UNICODE;
654 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
655 * These need to be revisited when a newer toolchain becomes available.
657 #if defined(__sparc64__) && defined(__GNUC__)
658 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
659 # undef SPARC64_GCC_WORKAROUND
660 # define SPARC64_GCC_WORKAROUND 1
664 /* REx optimizer. Converts nodes into quickier variants "in place".
665 Finds fixed substrings. */
667 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
668 to the position after last scanned or to NULL. */
671 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
672 /* scanp: Start here (read-write). */
673 /* deltap: Write maxlen-minlen here. */
674 /* last: Stop before this one. */
676 I32 min = 0, pars = 0, code;
677 regnode *scan = *scanp, *next;
679 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
680 int is_inf_internal = 0; /* The studied chunk is infinite */
681 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
682 scan_data_t data_fake;
683 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
685 while (scan && OP(scan) != END && scan < last) {
686 /* Peephole optimizer: */
688 if (PL_regkind[(U8)OP(scan)] == EXACT) {
689 /* Merge several consecutive EXACTish nodes into one. */
690 regnode *n = regnext(scan);
693 regnode *stop = scan;
696 next = scan + NODE_SZ_STR(scan);
697 /* Skip NOTHING, merge EXACT*. */
699 ( PL_regkind[(U8)OP(n)] == NOTHING ||
700 (stringok && (OP(n) == OP(scan))))
702 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
703 if (OP(n) == TAIL || n > next)
705 if (PL_regkind[(U8)OP(n)] == NOTHING) {
706 NEXT_OFF(scan) += NEXT_OFF(n);
707 next = n + NODE_STEP_REGNODE;
715 int oldl = STR_LEN(scan);
716 regnode *nnext = regnext(n);
718 if (oldl + STR_LEN(n) > U8_MAX)
720 NEXT_OFF(scan) += NEXT_OFF(n);
721 STR_LEN(scan) += STR_LEN(n);
722 next = n + NODE_SZ_STR(n);
723 /* Now we can overwrite *n : */
724 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
732 if (UTF && OP(scan) == EXACTF && STR_LEN(scan) >= 6) {
734 Two problematic code points in Unicode casefolding of EXACT nodes:
736 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
737 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
743 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
744 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
746 This means that in case-insensitive matching (or "loose matching",
747 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
748 length of the above casefolded versions) can match a target string
749 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
750 This would rather mess up the minimum length computation.
752 What we'll do is to look for the tail four bytes, and then peek
753 at the preceding two bytes to see whether we need to decrease
754 the minimum length by four (six minus two).
756 Thanks to the design of UTF-8, there cannot be false matches:
757 A sequence of valid UTF-8 bytes cannot be a subsequence of
758 another valid sequence of UTF-8 bytes.
761 char *s0 = STRING(scan), *s, *t;
762 char *s1 = s0 + STR_LEN(scan) - 1, *s2 = s1 - 4;
763 char *t0 = "\xcc\x88\xcc\x81";
767 s < s2 && (t = ninstr(s, s1, t0, t1));
769 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
770 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
777 n = scan + NODE_SZ_STR(scan);
779 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
787 /* Follow the next-chain of the current node and optimize
788 away all the NOTHINGs from it. */
789 if (OP(scan) != CURLYX) {
790 int max = (reg_off_by_arg[OP(scan)]
792 /* I32 may be smaller than U16 on CRAYs! */
793 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
794 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
798 /* Skip NOTHING and LONGJMP. */
799 while ((n = regnext(n))
800 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
801 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
804 if (reg_off_by_arg[OP(scan)])
807 NEXT_OFF(scan) = off;
809 /* The principal pseudo-switch. Cannot be a switch, since we
810 look into several different things. */
811 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
812 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
813 next = regnext(scan);
816 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
817 I32 max1 = 0, min1 = I32_MAX, num = 0;
818 struct regnode_charclass_class accum;
820 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
821 scan_commit(pRExC_state, data); /* Cannot merge strings after this. */
822 if (flags & SCF_DO_STCLASS)
823 cl_init_zero(pRExC_state, &accum);
824 while (OP(scan) == code) {
825 I32 deltanext, minnext, f = 0, fake;
826 struct regnode_charclass_class this_class;
831 data_fake.whilem_c = data->whilem_c;
832 data_fake.last_closep = data->last_closep;
835 data_fake.last_closep = &fake;
836 next = regnext(scan);
837 scan = NEXTOPER(scan);
839 scan = NEXTOPER(scan);
840 if (flags & SCF_DO_STCLASS) {
841 cl_init(pRExC_state, &this_class);
842 data_fake.start_class = &this_class;
843 f = SCF_DO_STCLASS_AND;
845 if (flags & SCF_WHILEM_VISITED_POS)
846 f |= SCF_WHILEM_VISITED_POS;
847 /* we suppose the run is continuous, last=next...*/
848 minnext = study_chunk(pRExC_state, &scan, &deltanext,
849 next, &data_fake, f);
852 if (max1 < minnext + deltanext)
853 max1 = minnext + deltanext;
854 if (deltanext == I32_MAX)
855 is_inf = is_inf_internal = 1;
857 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
859 if (data && (data_fake.flags & SF_HAS_EVAL))
860 data->flags |= SF_HAS_EVAL;
862 data->whilem_c = data_fake.whilem_c;
863 if (flags & SCF_DO_STCLASS)
864 cl_or(pRExC_state, &accum, &this_class);
868 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
870 if (flags & SCF_DO_SUBSTR) {
871 data->pos_min += min1;
872 data->pos_delta += max1 - min1;
873 if (max1 != min1 || is_inf)
874 data->longest = &(data->longest_float);
877 delta += max1 - min1;
878 if (flags & SCF_DO_STCLASS_OR) {
879 cl_or(pRExC_state, data->start_class, &accum);
881 cl_and(data->start_class, &and_with);
882 flags &= ~SCF_DO_STCLASS;
885 else if (flags & SCF_DO_STCLASS_AND) {
887 cl_and(data->start_class, &accum);
888 flags &= ~SCF_DO_STCLASS;
891 /* Switch to OR mode: cache the old value of
892 * data->start_class */
893 StructCopy(data->start_class, &and_with,
894 struct regnode_charclass_class);
895 flags &= ~SCF_DO_STCLASS_AND;
896 StructCopy(&accum, data->start_class,
897 struct regnode_charclass_class);
898 flags |= SCF_DO_STCLASS_OR;
899 data->start_class->flags |= ANYOF_EOS;
903 else if (code == BRANCHJ) /* single branch is optimized. */
904 scan = NEXTOPER(NEXTOPER(scan));
905 else /* single branch is optimized. */
906 scan = NEXTOPER(scan);
909 else if (OP(scan) == EXACT) {
910 I32 l = STR_LEN(scan);
911 UV uc = *((U8*)STRING(scan));
913 U8 *s = (U8*)STRING(scan);
914 l = utf8_length(s, s + l);
915 uc = utf8_to_uvchr(s, NULL);
918 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
919 /* The code below prefers earlier match for fixed
920 offset, later match for variable offset. */
921 if (data->last_end == -1) { /* Update the start info. */
922 data->last_start_min = data->pos_min;
923 data->last_start_max = is_inf
924 ? I32_MAX : data->pos_min + data->pos_delta;
926 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
928 SV * sv = data->last_found;
929 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ?
930 mg_find(sv, PERL_MAGIC_utf8) : NULL;
931 if (mg && mg->mg_len >= 0)
932 mg->mg_len += utf8_length((U8*)STRING(scan),
933 (U8*)STRING(scan)+STR_LEN(scan));
936 SvUTF8_on(data->last_found);
937 data->last_end = data->pos_min + l;
938 data->pos_min += l; /* As in the first entry. */
939 data->flags &= ~SF_BEFORE_EOL;
941 if (flags & SCF_DO_STCLASS_AND) {
942 /* Check whether it is compatible with what we know already! */
946 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
947 && !ANYOF_BITMAP_TEST(data->start_class, uc)
948 && (!(data->start_class->flags & ANYOF_FOLD)
949 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
952 ANYOF_CLASS_ZERO(data->start_class);
953 ANYOF_BITMAP_ZERO(data->start_class);
955 ANYOF_BITMAP_SET(data->start_class, uc);
956 data->start_class->flags &= ~ANYOF_EOS;
958 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
960 else if (flags & SCF_DO_STCLASS_OR) {
961 /* false positive possible if the class is case-folded */
963 ANYOF_BITMAP_SET(data->start_class, uc);
965 data->start_class->flags |= ANYOF_UNICODE_ALL;
966 data->start_class->flags &= ~ANYOF_EOS;
967 cl_and(data->start_class, &and_with);
969 flags &= ~SCF_DO_STCLASS;
971 else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */
972 I32 l = STR_LEN(scan);
973 UV uc = *((U8*)STRING(scan));
975 /* Search for fixed substrings supports EXACT only. */
976 if (flags & SCF_DO_SUBSTR)
977 scan_commit(pRExC_state, data);
979 U8 *s = (U8 *)STRING(scan);
980 l = utf8_length(s, s + l);
981 uc = utf8_to_uvchr(s, NULL);
984 if (data && (flags & SCF_DO_SUBSTR))
986 if (flags & SCF_DO_STCLASS_AND) {
987 /* Check whether it is compatible with what we know already! */
991 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
992 && !ANYOF_BITMAP_TEST(data->start_class, uc)
993 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
995 ANYOF_CLASS_ZERO(data->start_class);
996 ANYOF_BITMAP_ZERO(data->start_class);
998 ANYOF_BITMAP_SET(data->start_class, uc);
999 data->start_class->flags &= ~ANYOF_EOS;
1000 data->start_class->flags |= ANYOF_FOLD;
1001 if (OP(scan) == EXACTFL)
1002 data->start_class->flags |= ANYOF_LOCALE;
1005 else if (flags & SCF_DO_STCLASS_OR) {
1006 if (data->start_class->flags & ANYOF_FOLD) {
1007 /* false positive possible if the class is case-folded.
1008 Assume that the locale settings are the same... */
1010 ANYOF_BITMAP_SET(data->start_class, uc);
1011 data->start_class->flags &= ~ANYOF_EOS;
1013 cl_and(data->start_class, &and_with);
1015 flags &= ~SCF_DO_STCLASS;
1017 else if (strchr((char*)PL_varies,OP(scan))) {
1018 I32 mincount, maxcount, minnext, deltanext, fl = 0;
1019 I32 f = flags, pos_before = 0;
1020 regnode *oscan = scan;
1021 struct regnode_charclass_class this_class;
1022 struct regnode_charclass_class *oclass = NULL;
1023 I32 next_is_eval = 0;
1025 switch (PL_regkind[(U8)OP(scan)]) {
1026 case WHILEM: /* End of (?:...)* . */
1027 scan = NEXTOPER(scan);
1030 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
1031 next = NEXTOPER(scan);
1032 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
1034 maxcount = REG_INFTY;
1035 next = regnext(scan);
1036 scan = NEXTOPER(scan);
1040 if (flags & SCF_DO_SUBSTR)
1045 if (flags & SCF_DO_STCLASS) {
1047 maxcount = REG_INFTY;
1048 next = regnext(scan);
1049 scan = NEXTOPER(scan);
1052 is_inf = is_inf_internal = 1;
1053 scan = regnext(scan);
1054 if (flags & SCF_DO_SUBSTR) {
1055 scan_commit(pRExC_state, data); /* Cannot extend fixed substrings */
1056 data->longest = &(data->longest_float);
1058 goto optimize_curly_tail;
1060 mincount = ARG1(scan);
1061 maxcount = ARG2(scan);
1062 next = regnext(scan);
1063 if (OP(scan) == CURLYX) {
1064 I32 lp = (data ? *(data->last_closep) : 0);
1066 scan->flags = ((lp <= U8_MAX) ? lp : U8_MAX);
1068 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
1069 next_is_eval = (OP(scan) == EVAL);
1071 if (flags & SCF_DO_SUBSTR) {
1072 if (mincount == 0) scan_commit(pRExC_state,data); /* Cannot extend fixed substrings */
1073 pos_before = data->pos_min;
1077 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
1079 data->flags |= SF_IS_INF;
1081 if (flags & SCF_DO_STCLASS) {
1082 cl_init(pRExC_state, &this_class);
1083 oclass = data->start_class;
1084 data->start_class = &this_class;
1085 f |= SCF_DO_STCLASS_AND;
1086 f &= ~SCF_DO_STCLASS_OR;
1088 /* These are the cases when once a subexpression
1089 fails at a particular position, it cannot succeed
1090 even after backtracking at the enclosing scope.
1092 XXXX what if minimal match and we are at the
1093 initial run of {n,m}? */
1094 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
1095 f &= ~SCF_WHILEM_VISITED_POS;
1097 /* This will finish on WHILEM, setting scan, or on NULL: */
1098 minnext = study_chunk(pRExC_state, &scan, &deltanext, last, data,
1100 ? (f & ~SCF_DO_SUBSTR) : f);
1102 if (flags & SCF_DO_STCLASS)
1103 data->start_class = oclass;
1104 if (mincount == 0 || minnext == 0) {
1105 if (flags & SCF_DO_STCLASS_OR) {
1106 cl_or(pRExC_state, data->start_class, &this_class);
1108 else if (flags & SCF_DO_STCLASS_AND) {
1109 /* Switch to OR mode: cache the old value of
1110 * data->start_class */
1111 StructCopy(data->start_class, &and_with,
1112 struct regnode_charclass_class);
1113 flags &= ~SCF_DO_STCLASS_AND;
1114 StructCopy(&this_class, data->start_class,
1115 struct regnode_charclass_class);
1116 flags |= SCF_DO_STCLASS_OR;
1117 data->start_class->flags |= ANYOF_EOS;
1119 } else { /* Non-zero len */
1120 if (flags & SCF_DO_STCLASS_OR) {
1121 cl_or(pRExC_state, data->start_class, &this_class);
1122 cl_and(data->start_class, &and_with);
1124 else if (flags & SCF_DO_STCLASS_AND)
1125 cl_and(data->start_class, &this_class);
1126 flags &= ~SCF_DO_STCLASS;
1128 if (!scan) /* It was not CURLYX, but CURLY. */
1130 if (ckWARN(WARN_REGEXP)
1131 /* ? quantifier ok, except for (?{ ... }) */
1132 && (next_is_eval || !(mincount == 0 && maxcount == 1))
1133 && (minnext == 0) && (deltanext == 0)
1134 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
1135 && maxcount <= REG_INFTY/3) /* Complement check for big count */
1138 "Quantifier unexpected on zero-length expression");
1141 min += minnext * mincount;
1142 is_inf_internal |= ((maxcount == REG_INFTY
1143 && (minnext + deltanext) > 0)
1144 || deltanext == I32_MAX);
1145 is_inf |= is_inf_internal;
1146 delta += (minnext + deltanext) * maxcount - minnext * mincount;
1148 /* Try powerful optimization CURLYX => CURLYN. */
1149 if ( OP(oscan) == CURLYX && data
1150 && data->flags & SF_IN_PAR
1151 && !(data->flags & SF_HAS_EVAL)
1152 && !deltanext && minnext == 1 ) {
1153 /* Try to optimize to CURLYN. */
1154 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
1155 regnode *nxt1 = nxt;
1162 if (!strchr((char*)PL_simple,OP(nxt))
1163 && !(PL_regkind[(U8)OP(nxt)] == EXACT
1164 && STR_LEN(nxt) == 1))
1170 if (OP(nxt) != CLOSE)
1172 /* Now we know that nxt2 is the only contents: */
1173 oscan->flags = (U8)ARG(nxt);
1175 OP(nxt1) = NOTHING; /* was OPEN. */
1177 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1178 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
1179 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
1180 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1181 OP(nxt + 1) = OPTIMIZED; /* was count. */
1182 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
1187 /* Try optimization CURLYX => CURLYM. */
1188 if ( OP(oscan) == CURLYX && data
1189 && !(data->flags & SF_HAS_PAR)
1190 && !(data->flags & SF_HAS_EVAL)
1192 /* XXXX How to optimize if data == 0? */
1193 /* Optimize to a simpler form. */
1194 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
1198 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
1199 && (OP(nxt2) != WHILEM))
1201 OP(nxt2) = SUCCEED; /* Whas WHILEM */
1202 /* Need to optimize away parenths. */
1203 if (data->flags & SF_IN_PAR) {
1204 /* Set the parenth number. */
1205 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
1207 if (OP(nxt) != CLOSE)
1208 FAIL("Panic opt close");
1209 oscan->flags = (U8)ARG(nxt);
1210 OP(nxt1) = OPTIMIZED; /* was OPEN. */
1211 OP(nxt) = OPTIMIZED; /* was CLOSE. */
1213 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
1214 OP(nxt + 1) = OPTIMIZED; /* was count. */
1215 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
1216 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
1219 while ( nxt1 && (OP(nxt1) != WHILEM)) {
1220 regnode *nnxt = regnext(nxt1);
1223 if (reg_off_by_arg[OP(nxt1)])
1224 ARG_SET(nxt1, nxt2 - nxt1);
1225 else if (nxt2 - nxt1 < U16_MAX)
1226 NEXT_OFF(nxt1) = nxt2 - nxt1;
1228 OP(nxt) = NOTHING; /* Cannot beautify */
1233 /* Optimize again: */
1234 study_chunk(pRExC_state, &nxt1, &deltanext, nxt,
1240 else if ((OP(oscan) == CURLYX)
1241 && (flags & SCF_WHILEM_VISITED_POS)
1242 /* See the comment on a similar expression above.
1243 However, this time it not a subexpression
1244 we care about, but the expression itself. */
1245 && (maxcount == REG_INFTY)
1246 && data && ++data->whilem_c < 16) {
1247 /* This stays as CURLYX, we can put the count/of pair. */
1248 /* Find WHILEM (as in regexec.c) */
1249 regnode *nxt = oscan + NEXT_OFF(oscan);
1251 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
1253 PREVOPER(nxt)->flags = (U8)(data->whilem_c
1254 | (RExC_whilem_seen << 4)); /* On WHILEM */
1256 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
1258 if (flags & SCF_DO_SUBSTR) {
1259 SV *last_str = Nullsv;
1260 int counted = mincount != 0;
1262 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
1263 #if defined(SPARC64_GCC_WORKAROUND)
1269 if (pos_before >= data->last_start_min)
1272 b = data->last_start_min;
1275 s = SvPV(data->last_found, l);
1276 old = b - data->last_start_min;
1279 I32 b = pos_before >= data->last_start_min
1280 ? pos_before : data->last_start_min;
1282 char *s = SvPV(data->last_found, l);
1283 I32 old = b - data->last_start_min;
1287 old = utf8_hop((U8*)s, old) - (U8*)s;
1290 /* Get the added string: */
1291 last_str = newSVpvn(s + old, l);
1293 SvUTF8_on(last_str);
1294 if (deltanext == 0 && pos_before == b) {
1295 /* What was added is a constant string */
1297 SvGROW(last_str, (mincount * l) + 1);
1298 repeatcpy(SvPVX(last_str) + l,
1299 SvPVX(last_str), l, mincount - 1);
1300 SvCUR(last_str) *= mincount;
1301 /* Add additional parts. */
1302 SvCUR_set(data->last_found,
1303 SvCUR(data->last_found) - l);
1304 sv_catsv(data->last_found, last_str);
1306 SV * sv = data->last_found;
1308 SvUTF8(sv) && SvMAGICAL(sv) ?
1309 mg_find(sv, PERL_MAGIC_utf8) : NULL;
1310 if (mg && mg->mg_len >= 0)
1311 mg->mg_len += CHR_SVLEN(last_str);
1313 data->last_end += l * (mincount - 1);
1316 /* start offset must point into the last copy */
1317 data->last_start_min += minnext * (mincount - 1);
1318 data->last_start_max += is_inf ? I32_MAX
1319 : (maxcount - 1) * (minnext + data->pos_delta);
1322 /* It is counted once already... */
1323 data->pos_min += minnext * (mincount - counted);
1324 data->pos_delta += - counted * deltanext +
1325 (minnext + deltanext) * maxcount - minnext * mincount;
1326 if (mincount != maxcount) {
1327 /* Cannot extend fixed substrings found inside
1329 scan_commit(pRExC_state,data);
1330 if (mincount && last_str) {
1331 sv_setsv(data->last_found, last_str);
1332 data->last_end = data->pos_min;
1333 data->last_start_min =
1334 data->pos_min - CHR_SVLEN(last_str);
1335 data->last_start_max = is_inf
1337 : data->pos_min + data->pos_delta
1338 - CHR_SVLEN(last_str);
1340 data->longest = &(data->longest_float);
1342 SvREFCNT_dec(last_str);
1344 if (data && (fl & SF_HAS_EVAL))
1345 data->flags |= SF_HAS_EVAL;
1346 optimize_curly_tail:
1347 if (OP(oscan) != CURLYX) {
1348 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
1350 NEXT_OFF(oscan) += NEXT_OFF(next);
1353 default: /* REF and CLUMP only? */
1354 if (flags & SCF_DO_SUBSTR) {
1355 scan_commit(pRExC_state,data); /* Cannot expect anything... */
1356 data->longest = &(data->longest_float);
1358 is_inf = is_inf_internal = 1;
1359 if (flags & SCF_DO_STCLASS_OR)
1360 cl_anything(pRExC_state, data->start_class);
1361 flags &= ~SCF_DO_STCLASS;
1365 else if (strchr((char*)PL_simple,OP(scan))) {
1368 if (flags & SCF_DO_SUBSTR) {
1369 scan_commit(pRExC_state,data);
1373 if (flags & SCF_DO_STCLASS) {
1374 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
1376 /* Some of the logic below assumes that switching
1377 locale on will only add false positives. */
1378 switch (PL_regkind[(U8)OP(scan)]) {
1382 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
1383 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1384 cl_anything(pRExC_state, data->start_class);
1387 if (OP(scan) == SANY)
1389 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
1390 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
1391 || (data->start_class->flags & ANYOF_CLASS));
1392 cl_anything(pRExC_state, data->start_class);
1394 if (flags & SCF_DO_STCLASS_AND || !value)
1395 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
1398 if (flags & SCF_DO_STCLASS_AND)
1399 cl_and(data->start_class,
1400 (struct regnode_charclass_class*)scan);
1402 cl_or(pRExC_state, data->start_class,
1403 (struct regnode_charclass_class*)scan);
1406 if (flags & SCF_DO_STCLASS_AND) {
1407 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1408 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1409 for (value = 0; value < 256; value++)
1410 if (!isALNUM(value))
1411 ANYOF_BITMAP_CLEAR(data->start_class, value);
1415 if (data->start_class->flags & ANYOF_LOCALE)
1416 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1418 for (value = 0; value < 256; value++)
1420 ANYOF_BITMAP_SET(data->start_class, value);
1425 if (flags & SCF_DO_STCLASS_AND) {
1426 if (data->start_class->flags & ANYOF_LOCALE)
1427 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
1430 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
1431 data->start_class->flags |= ANYOF_LOCALE;
1435 if (flags & SCF_DO_STCLASS_AND) {
1436 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1437 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1438 for (value = 0; value < 256; value++)
1440 ANYOF_BITMAP_CLEAR(data->start_class, value);
1444 if (data->start_class->flags & ANYOF_LOCALE)
1445 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1447 for (value = 0; value < 256; value++)
1448 if (!isALNUM(value))
1449 ANYOF_BITMAP_SET(data->start_class, value);
1454 if (flags & SCF_DO_STCLASS_AND) {
1455 if (data->start_class->flags & ANYOF_LOCALE)
1456 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
1459 data->start_class->flags |= ANYOF_LOCALE;
1460 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
1464 if (flags & SCF_DO_STCLASS_AND) {
1465 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1466 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1467 for (value = 0; value < 256; value++)
1468 if (!isSPACE(value))
1469 ANYOF_BITMAP_CLEAR(data->start_class, value);
1473 if (data->start_class->flags & ANYOF_LOCALE)
1474 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1476 for (value = 0; value < 256; value++)
1478 ANYOF_BITMAP_SET(data->start_class, value);
1483 if (flags & SCF_DO_STCLASS_AND) {
1484 if (data->start_class->flags & ANYOF_LOCALE)
1485 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
1488 data->start_class->flags |= ANYOF_LOCALE;
1489 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
1493 if (flags & SCF_DO_STCLASS_AND) {
1494 if (!(data->start_class->flags & ANYOF_LOCALE)) {
1495 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1496 for (value = 0; value < 256; value++)
1498 ANYOF_BITMAP_CLEAR(data->start_class, value);
1502 if (data->start_class->flags & ANYOF_LOCALE)
1503 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1505 for (value = 0; value < 256; value++)
1506 if (!isSPACE(value))
1507 ANYOF_BITMAP_SET(data->start_class, value);
1512 if (flags & SCF_DO_STCLASS_AND) {
1513 if (data->start_class->flags & ANYOF_LOCALE) {
1514 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
1515 for (value = 0; value < 256; value++)
1516 if (!isSPACE(value))
1517 ANYOF_BITMAP_CLEAR(data->start_class, value);
1521 data->start_class->flags |= ANYOF_LOCALE;
1522 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
1526 if (flags & SCF_DO_STCLASS_AND) {
1527 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
1528 for (value = 0; value < 256; value++)
1529 if (!isDIGIT(value))
1530 ANYOF_BITMAP_CLEAR(data->start_class, value);
1533 if (data->start_class->flags & ANYOF_LOCALE)
1534 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
1536 for (value = 0; value < 256; value++)
1538 ANYOF_BITMAP_SET(data->start_class, value);
1543 if (flags & SCF_DO_STCLASS_AND) {
1544 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
1545 for (value = 0; value < 256; value++)
1547 ANYOF_BITMAP_CLEAR(data->start_class, value);
1550 if (data->start_class->flags & ANYOF_LOCALE)
1551 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
1553 for (value = 0; value < 256; value++)
1554 if (!isDIGIT(value))
1555 ANYOF_BITMAP_SET(data->start_class, value);
1560 if (flags & SCF_DO_STCLASS_OR)
1561 cl_and(data->start_class, &and_with);
1562 flags &= ~SCF_DO_STCLASS;
1565 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
1566 data->flags |= (OP(scan) == MEOL
1570 else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ
1571 /* Lookbehind, or need to calculate parens/evals/stclass: */
1572 && (scan->flags || data || (flags & SCF_DO_STCLASS))
1573 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
1574 /* Lookahead/lookbehind */
1575 I32 deltanext, minnext, fake = 0;
1577 struct regnode_charclass_class intrnl;
1580 data_fake.flags = 0;
1582 data_fake.whilem_c = data->whilem_c;
1583 data_fake.last_closep = data->last_closep;
1586 data_fake.last_closep = &fake;
1587 if ( flags & SCF_DO_STCLASS && !scan->flags
1588 && OP(scan) == IFMATCH ) { /* Lookahead */
1589 cl_init(pRExC_state, &intrnl);
1590 data_fake.start_class = &intrnl;
1591 f |= SCF_DO_STCLASS_AND;
1593 if (flags & SCF_WHILEM_VISITED_POS)
1594 f |= SCF_WHILEM_VISITED_POS;
1595 next = regnext(scan);
1596 nscan = NEXTOPER(NEXTOPER(scan));
1597 minnext = study_chunk(pRExC_state, &nscan, &deltanext, last, &data_fake, f);
1600 vFAIL("Variable length lookbehind not implemented");
1602 else if (minnext > U8_MAX) {
1603 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
1605 scan->flags = (U8)minnext;
1607 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
1609 if (data && (data_fake.flags & SF_HAS_EVAL))
1610 data->flags |= SF_HAS_EVAL;
1612 data->whilem_c = data_fake.whilem_c;
1613 if (f & SCF_DO_STCLASS_AND) {
1614 int was = (data->start_class->flags & ANYOF_EOS);
1616 cl_and(data->start_class, &intrnl);
1618 data->start_class->flags |= ANYOF_EOS;
1621 else if (OP(scan) == OPEN) {
1624 else if (OP(scan) == CLOSE) {
1625 if ((I32)ARG(scan) == is_par) {
1626 next = regnext(scan);
1628 if ( next && (OP(next) != WHILEM) && next < last)
1629 is_par = 0; /* Disable optimization */
1632 *(data->last_closep) = ARG(scan);
1634 else if (OP(scan) == EVAL) {
1636 data->flags |= SF_HAS_EVAL;
1638 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */
1639 if (flags & SCF_DO_SUBSTR) {
1640 scan_commit(pRExC_state,data);
1641 data->longest = &(data->longest_float);
1643 is_inf = is_inf_internal = 1;
1644 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
1645 cl_anything(pRExC_state, data->start_class);
1646 flags &= ~SCF_DO_STCLASS;
1648 /* Else: zero-length, ignore. */
1649 scan = regnext(scan);
1654 *deltap = is_inf_internal ? I32_MAX : delta;
1655 if (flags & SCF_DO_SUBSTR && is_inf)
1656 data->pos_delta = I32_MAX - data->pos_min;
1657 if (is_par > U8_MAX)
1659 if (is_par && pars==1 && data) {
1660 data->flags |= SF_IN_PAR;
1661 data->flags &= ~SF_HAS_PAR;
1663 else if (pars && data) {
1664 data->flags |= SF_HAS_PAR;
1665 data->flags &= ~SF_IN_PAR;
1667 if (flags & SCF_DO_STCLASS_OR)
1668 cl_and(data->start_class, &and_with);
1673 S_add_data(pTHX_ RExC_state_t *pRExC_state, I32 n, char *s)
1675 if (RExC_rx->data) {
1676 Renewc(RExC_rx->data,
1677 sizeof(*RExC_rx->data) + sizeof(void*) * (RExC_rx->data->count + n - 1),
1678 char, struct reg_data);
1679 Renew(RExC_rx->data->what, RExC_rx->data->count + n, U8);
1680 RExC_rx->data->count += n;
1683 Newc(1207, RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
1684 char, struct reg_data);
1685 New(1208, RExC_rx->data->what, n, U8);
1686 RExC_rx->data->count = n;
1688 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
1689 return RExC_rx->data->count - n;
1693 Perl_reginitcolors(pTHX)
1696 char *s = PerlEnv_getenv("PERL_RE_COLORS");
1699 PL_colors[0] = s = savepv(s);
1701 s = strchr(s, '\t');
1707 PL_colors[i] = s = "";
1711 PL_colors[i++] = "";
1718 - pregcomp - compile a regular expression into internal code
1720 * We can't allocate space until we know how big the compiled form will be,
1721 * but we can't compile it (and thus know how big it is) until we've got a
1722 * place to put the code. So we cheat: we compile it twice, once with code
1723 * generation turned off and size counting turned on, and once "for real".
1724 * This also means that we don't allocate space until we are sure that the
1725 * thing really will compile successfully, and we never have to move the
1726 * code and thus invalidate pointers into it. (Note that it has to be in
1727 * one piece because free() must be able to free it all.) [NB: not true in perl]
1729 * Beware that the optimization-preparation code in here knows about some
1730 * of the structure of the compiled regexp. [I'll say.]
1733 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
1743 RExC_state_t RExC_state;
1744 RExC_state_t *pRExC_state = &RExC_state;
1747 FAIL("NULL regexp argument");
1749 RExC_utf8 = pm->op_pmdynflags & PMdf_CMP_UTF8;
1753 if (!PL_colorset) reginitcolors();
1754 PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
1755 PL_colors[4],PL_colors[5],PL_colors[0],
1756 (int)(xend - exp), RExC_precomp, PL_colors[1]);
1758 RExC_flags = pm->op_pmflags;
1762 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
1763 RExC_seen_evals = 0;
1766 /* First pass: determine size, legality. */
1773 RExC_emit = &PL_regdummy;
1774 RExC_whilem_seen = 0;
1775 #if 0 /* REGC() is (currently) a NOP at the first pass.
1776 * Clever compilers notice this and complain. --jhi */
1777 REGC((U8)REG_MAGIC, (char*)RExC_emit);
1779 if (reg(pRExC_state, 0, &flags) == NULL) {
1780 RExC_precomp = Nullch;
1783 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)RExC_size));
1785 /* Small enough for pointer-storage convention?
1786 If extralen==0, this means that we will not need long jumps. */
1787 if (RExC_size >= 0x10000L && RExC_extralen)
1788 RExC_size += RExC_extralen;
1791 if (RExC_whilem_seen > 15)
1792 RExC_whilem_seen = 15;
1794 /* Allocate space and initialize. */
1795 Newc(1001, r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
1798 FAIL("Regexp out of space");
1801 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
1802 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
1805 r->prelen = xend - exp;
1806 r->precomp = savepvn(RExC_precomp, r->prelen);
1808 #ifdef PERL_COPY_ON_WRITE
1809 r->saved_copy = Nullsv;
1811 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
1812 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
1814 r->substrs = 0; /* Useful during FAIL. */
1815 r->startp = 0; /* Useful during FAIL. */
1816 r->endp = 0; /* Useful during FAIL. */
1818 Newz(1304, r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
1820 r->offsets[0] = RExC_size;
1822 DEBUG_r(PerlIO_printf(Perl_debug_log,
1823 "%s %"UVuf" bytes for offset annotations.\n",
1824 r->offsets ? "Got" : "Couldn't get",
1825 (UV)((2*RExC_size+1) * sizeof(U32))));
1829 /* Second pass: emit code. */
1830 RExC_flags = pm->op_pmflags; /* don't let top level (?i) bleed */
1835 RExC_emit_start = r->program;
1836 RExC_emit = r->program;
1837 /* Store the count of eval-groups for security checks: */
1838 RExC_emit->next_off = (U16)((RExC_seen_evals > U16_MAX) ? U16_MAX : RExC_seen_evals);
1839 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
1841 if (reg(pRExC_state, 0, &flags) == NULL)
1844 /* Dig out information for optimizations. */
1845 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
1846 pm->op_pmflags = RExC_flags;
1848 r->reganch |= ROPT_UTF8; /* Unicode in it? */
1849 r->regstclass = NULL;
1850 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
1851 r->reganch |= ROPT_NAUGHTY;
1852 scan = r->program + 1; /* First BRANCH. */
1854 /* XXXX To minimize changes to RE engine we always allocate
1855 3-units-long substrs field. */
1856 Newz(1004, r->substrs, 1, struct reg_substr_data);
1858 StructCopy(&zero_scan_data, &data, scan_data_t);
1859 /* XXXX Should not we check for something else? Usually it is OPEN1... */
1860 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
1862 STRLEN longest_float_length, longest_fixed_length;
1863 struct regnode_charclass_class ch_class;
1868 /* Skip introductions and multiplicators >= 1. */
1869 while ((OP(first) == OPEN && (sawopen = 1)) ||
1870 /* An OR of *one* alternative - should not happen now. */
1871 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
1872 (OP(first) == PLUS) ||
1873 (OP(first) == MINMOD) ||
1874 /* An {n,m} with n>0 */
1875 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
1876 if (OP(first) == PLUS)
1879 first += regarglen[(U8)OP(first)];
1880 first = NEXTOPER(first);
1883 /* Starting-point info. */
1885 if (PL_regkind[(U8)OP(first)] == EXACT) {
1886 if (OP(first) == EXACT)
1887 ; /* Empty, get anchored substr later. */
1888 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
1889 r->regstclass = first;
1891 else if (strchr((char*)PL_simple,OP(first)))
1892 r->regstclass = first;
1893 else if (PL_regkind[(U8)OP(first)] == BOUND ||
1894 PL_regkind[(U8)OP(first)] == NBOUND)
1895 r->regstclass = first;
1896 else if (PL_regkind[(U8)OP(first)] == BOL) {
1897 r->reganch |= (OP(first) == MBOL
1899 : (OP(first) == SBOL
1902 first = NEXTOPER(first);
1905 else if (OP(first) == GPOS) {
1906 r->reganch |= ROPT_ANCH_GPOS;
1907 first = NEXTOPER(first);
1910 else if (!sawopen && (OP(first) == STAR &&
1911 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
1912 !(r->reganch & ROPT_ANCH) )
1914 /* turn .* into ^.* with an implied $*=1 */
1915 int type = OP(NEXTOPER(first));
1917 if (type == REG_ANY)
1918 type = ROPT_ANCH_MBOL;
1920 type = ROPT_ANCH_SBOL;
1922 r->reganch |= type | ROPT_IMPLICIT;
1923 first = NEXTOPER(first);
1926 if (sawplus && (!sawopen || !RExC_sawback)
1927 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
1928 /* x+ must match at the 1st pos of run of x's */
1929 r->reganch |= ROPT_SKIP;
1931 /* Scan is after the zeroth branch, first is atomic matcher. */
1932 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
1933 (IV)(first - scan + 1)));
1935 * If there's something expensive in the r.e., find the
1936 * longest literal string that must appear and make it the
1937 * regmust. Resolve ties in favor of later strings, since
1938 * the regstart check works with the beginning of the r.e.
1939 * and avoiding duplication strengthens checking. Not a
1940 * strong reason, but sufficient in the absence of others.
1941 * [Now we resolve ties in favor of the earlier string if
1942 * it happens that c_offset_min has been invalidated, since the
1943 * earlier string may buy us something the later one won't.]
1947 data.longest_fixed = newSVpvn("",0);
1948 data.longest_float = newSVpvn("",0);
1949 data.last_found = newSVpvn("",0);
1950 data.longest = &(data.longest_fixed);
1952 if (!r->regstclass) {
1953 cl_init(pRExC_state, &ch_class);
1954 data.start_class = &ch_class;
1955 stclass_flag = SCF_DO_STCLASS_AND;
1956 } else /* XXXX Check for BOUND? */
1958 data.last_closep = &last_close;
1960 minlen = study_chunk(pRExC_state, &first, &fake, scan + RExC_size, /* Up to end */
1961 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag);
1962 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
1963 && data.last_start_min == 0 && data.last_end > 0
1964 && !RExC_seen_zerolen
1965 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1966 r->reganch |= ROPT_CHECK_ALL;
1967 scan_commit(pRExC_state, &data);
1968 SvREFCNT_dec(data.last_found);
1970 longest_float_length = CHR_SVLEN(data.longest_float);
1971 if (longest_float_length
1972 || (data.flags & SF_FL_BEFORE_EOL
1973 && (!(data.flags & SF_FL_BEFORE_MEOL)
1974 || (RExC_flags & PMf_MULTILINE)))) {
1977 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1978 && data.offset_fixed == data.offset_float_min
1979 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1980 goto remove_float; /* As in (a)+. */
1982 if (SvUTF8(data.longest_float)) {
1983 r->float_utf8 = data.longest_float;
1984 r->float_substr = Nullsv;
1986 r->float_substr = data.longest_float;
1987 r->float_utf8 = Nullsv;
1989 r->float_min_offset = data.offset_float_min;
1990 r->float_max_offset = data.offset_float_max;
1991 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1992 && (!(data.flags & SF_FL_BEFORE_MEOL)
1993 || (RExC_flags & PMf_MULTILINE)));
1994 fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0);
1998 r->float_substr = r->float_utf8 = Nullsv;
1999 SvREFCNT_dec(data.longest_float);
2000 longest_float_length = 0;
2003 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
2004 if (longest_fixed_length
2005 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
2006 && (!(data.flags & SF_FIX_BEFORE_MEOL)
2007 || (RExC_flags & PMf_MULTILINE)))) {
2010 if (SvUTF8(data.longest_fixed)) {
2011 r->anchored_utf8 = data.longest_fixed;
2012 r->anchored_substr = Nullsv;
2014 r->anchored_substr = data.longest_fixed;
2015 r->anchored_utf8 = Nullsv;
2017 r->anchored_offset = data.offset_fixed;
2018 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
2019 && (!(data.flags & SF_FIX_BEFORE_MEOL)
2020 || (RExC_flags & PMf_MULTILINE)));
2021 fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0);
2024 r->anchored_substr = r->anchored_utf8 = Nullsv;
2025 SvREFCNT_dec(data.longest_fixed);
2026 longest_fixed_length = 0;
2029 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
2030 r->regstclass = NULL;
2031 if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset)
2033 && !(data.start_class->flags & ANYOF_EOS)
2034 && !cl_is_anything(data.start_class))
2036 I32 n = add_data(pRExC_state, 1, "f");
2038 New(1006, RExC_rx->data->data[n], 1,
2039 struct regnode_charclass_class);
2040 StructCopy(data.start_class,
2041 (struct regnode_charclass_class*)RExC_rx->data->data[n],
2042 struct regnode_charclass_class);
2043 r->regstclass = (regnode*)RExC_rx->data->data[n];
2044 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
2045 PL_regdata = r->data; /* for regprop() */
2046 DEBUG_r({ SV *sv = sv_newmortal();
2047 regprop(sv, (regnode*)data.start_class);
2048 PerlIO_printf(Perl_debug_log,
2049 "synthetic stclass `%s'.\n",
2053 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
2054 if (longest_fixed_length > longest_float_length) {
2055 r->check_substr = r->anchored_substr;
2056 r->check_utf8 = r->anchored_utf8;
2057 r->check_offset_min = r->check_offset_max = r->anchored_offset;
2058 if (r->reganch & ROPT_ANCH_SINGLE)
2059 r->reganch |= ROPT_NOSCAN;
2062 r->check_substr = r->float_substr;
2063 r->check_utf8 = r->float_utf8;
2064 r->check_offset_min = data.offset_float_min;
2065 r->check_offset_max = data.offset_float_max;
2067 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
2068 This should be changed ASAP! */
2069 if ((r->check_substr || r->check_utf8) && !(r->reganch & ROPT_ANCH_GPOS)) {
2070 r->reganch |= RE_USE_INTUIT;
2071 if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8))
2072 r->reganch |= RE_INTUIT_TAIL;
2076 /* Several toplevels. Best we can is to set minlen. */
2078 struct regnode_charclass_class ch_class;
2081 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
2082 scan = r->program + 1;
2083 cl_init(pRExC_state, &ch_class);
2084 data.start_class = &ch_class;
2085 data.last_closep = &last_close;
2086 minlen = study_chunk(pRExC_state, &scan, &fake, scan + RExC_size, &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS);
2087 r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8
2088 = r->float_substr = r->float_utf8 = Nullsv;
2089 if (!(data.start_class->flags & ANYOF_EOS)
2090 && !cl_is_anything(data.start_class))
2092 I32 n = add_data(pRExC_state, 1, "f");
2094 New(1006, RExC_rx->data->data[n], 1,
2095 struct regnode_charclass_class);
2096 StructCopy(data.start_class,
2097 (struct regnode_charclass_class*)RExC_rx->data->data[n],
2098 struct regnode_charclass_class);
2099 r->regstclass = (regnode*)RExC_rx->data->data[n];
2100 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
2101 DEBUG_r({ SV* sv = sv_newmortal();
2102 regprop(sv, (regnode*)data.start_class);
2103 PerlIO_printf(Perl_debug_log,
2104 "synthetic stclass `%s'.\n",
2110 if (RExC_seen & REG_SEEN_GPOS)
2111 r->reganch |= ROPT_GPOS_SEEN;
2112 if (RExC_seen & REG_SEEN_LOOKBEHIND)
2113 r->reganch |= ROPT_LOOKBEHIND_SEEN;
2114 if (RExC_seen & REG_SEEN_EVAL)
2115 r->reganch |= ROPT_EVAL_SEEN;
2116 if (RExC_seen & REG_SEEN_CANY)
2117 r->reganch |= ROPT_CANY_SEEN;
2118 Newz(1002, r->startp, RExC_npar, I32);
2119 Newz(1002, r->endp, RExC_npar, I32);
2120 PL_regdata = r->data; /* for regprop() */
2121 DEBUG_r(regdump(r));
2126 - reg - regular expression, i.e. main body or parenthesized thing
2128 * Caller must absorb opening parenthesis.
2130 * Combining parenthesis handling with the base level of regular expression
2131 * is a trifle forced, but the need to tie the tails of the branches to what
2132 * follows makes it hard to avoid.
2135 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp)
2136 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
2138 register regnode *ret; /* Will be the head of the group. */
2139 register regnode *br;
2140 register regnode *lastbr;
2141 register regnode *ender = 0;
2142 register I32 parno = 0;
2143 I32 flags, oregflags = RExC_flags, have_branch = 0, open = 0;
2145 /* for (?g), (?gc), and (?o) warnings; warning
2146 about (?c) will warn about (?g) -- japhy */
2148 I32 wastedflags = 0x00,
2151 wasted_gc = 0x02 | 0x04,
2154 char * parse_start = RExC_parse; /* MJD */
2155 char *oregcomp_parse = RExC_parse;
2158 *flagp = 0; /* Tentatively. */
2161 /* Make an OPEN node, if parenthesized. */
2163 if (*RExC_parse == '?') { /* (?...) */
2164 U32 posflags = 0, negflags = 0;
2165 U32 *flagsp = &posflags;
2167 char *seqstart = RExC_parse;
2170 paren = *RExC_parse++;
2171 ret = NULL; /* For look-ahead/behind. */
2173 case '<': /* (?<...) */
2174 RExC_seen |= REG_SEEN_LOOKBEHIND;
2175 if (*RExC_parse == '!')
2177 if (*RExC_parse != '=' && *RExC_parse != '!')
2180 case '=': /* (?=...) */
2181 case '!': /* (?!...) */
2182 RExC_seen_zerolen++;
2183 case ':': /* (?:...) */
2184 case '>': /* (?>...) */
2186 case '$': /* (?$...) */
2187 case '@': /* (?@...) */
2188 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
2190 case '#': /* (?#...) */
2191 while (*RExC_parse && *RExC_parse != ')')
2193 if (*RExC_parse != ')')
2194 FAIL("Sequence (?#... not terminated");
2195 nextchar(pRExC_state);
2198 case 'p': /* (?p...) */
2199 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
2200 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
2202 case '?': /* (??...) */
2204 if (*RExC_parse != '{')
2206 paren = *RExC_parse++;
2208 case '{': /* (?{...}) */
2210 I32 count = 1, n = 0;
2212 char *s = RExC_parse;
2214 OP_4tree *sop, *rop;
2216 RExC_seen_zerolen++;
2217 RExC_seen |= REG_SEEN_EVAL;
2218 while (count && (c = *RExC_parse)) {
2219 if (c == '\\' && RExC_parse[1])
2227 if (*RExC_parse != ')')
2230 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
2235 if (RExC_parse - 1 - s)
2236 sv = newSVpvn(s, RExC_parse - 1 - s);
2238 sv = newSVpvn("", 0);
2241 Perl_save_re_context(aTHX);
2242 rop = sv_compile_2op(sv, &sop, "re", &pad);
2243 sop->op_private |= OPpREFCOUNTED;
2244 /* re_dup will OpREFCNT_inc */
2245 OpREFCNT_set(sop, 1);
2248 n = add_data(pRExC_state, 3, "nop");
2249 RExC_rx->data->data[n] = (void*)rop;
2250 RExC_rx->data->data[n+1] = (void*)sop;
2251 RExC_rx->data->data[n+2] = (void*)pad;
2254 else { /* First pass */
2255 if (PL_reginterp_cnt < ++RExC_seen_evals
2257 /* No compiled RE interpolated, has runtime
2258 components ===> unsafe. */
2259 FAIL("Eval-group not allowed at runtime, use re 'eval'");
2260 if (PL_tainting && PL_tainted)
2261 FAIL("Eval-group in insecure regular expression");
2262 if (IN_PERL_COMPILETIME)
2266 nextchar(pRExC_state);
2268 ret = reg_node(pRExC_state, LOGICAL);
2271 regtail(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
2272 /* deal with the length of this later - MJD */
2275 ret = reganode(pRExC_state, EVAL, n);
2276 Set_Node_Length(ret, RExC_parse - parse_start + 1);
2277 Set_Node_Offset(ret, parse_start);
2280 case '(': /* (?(?{...})...) and (?(?=...)...) */
2282 if (RExC_parse[0] == '?') { /* (?(?...)) */
2283 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
2284 || RExC_parse[1] == '<'
2285 || RExC_parse[1] == '{') { /* Lookahead or eval. */
2288 ret = reg_node(pRExC_state, LOGICAL);
2291 regtail(pRExC_state, ret, reg(pRExC_state, 1, &flag));
2295 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
2297 parno = atoi(RExC_parse++);
2299 while (isDIGIT(*RExC_parse))
2301 ret = reganode(pRExC_state, GROUPP, parno);
2303 if ((c = *nextchar(pRExC_state)) != ')')
2304 vFAIL("Switch condition not recognized");
2306 regtail(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
2307 br = regbranch(pRExC_state, &flags, 1);
2309 br = reganode(pRExC_state, LONGJMP, 0);
2311 regtail(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
2312 c = *nextchar(pRExC_state);
2316 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
2317 regbranch(pRExC_state, &flags, 1);
2318 regtail(pRExC_state, ret, lastbr);
2321 c = *nextchar(pRExC_state);
2326 vFAIL("Switch (?(condition)... contains too many branches");
2327 ender = reg_node(pRExC_state, TAIL);
2328 regtail(pRExC_state, br, ender);
2330 regtail(pRExC_state, lastbr, ender);
2331 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
2334 regtail(pRExC_state, ret, ender);
2338 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
2342 RExC_parse--; /* for vFAIL to print correctly */
2343 vFAIL("Sequence (? incomplete");
2347 parse_flags: /* (?i) */
2348 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
2349 /* (?g), (?gc) and (?o) are useless here
2350 and must be globally applied -- japhy */
2352 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
2353 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2354 I32 wflagbit = *RExC_parse == 'o' ? wasted_o : wasted_g;
2355 if (! (wastedflags & wflagbit) ) {
2356 wastedflags |= wflagbit;
2359 "Useless (%s%c) - %suse /%c modifier",
2360 flagsp == &negflags ? "?-" : "?",
2362 flagsp == &negflags ? "don't " : "",
2368 else if (*RExC_parse == 'c') {
2369 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
2370 if (! (wastedflags & wasted_c) ) {
2371 wastedflags |= wasted_gc;
2374 "Useless (%sc) - %suse /gc modifier",
2375 flagsp == &negflags ? "?-" : "?",
2376 flagsp == &negflags ? "don't " : ""
2381 else { pmflag(flagsp, *RExC_parse); }
2385 if (*RExC_parse == '-') {
2387 wastedflags = 0; /* reset so (?g-c) warns twice */
2391 RExC_flags |= posflags;
2392 RExC_flags &= ~negflags;
2393 if (*RExC_parse == ':') {
2399 if (*RExC_parse != ')') {
2401 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
2403 nextchar(pRExC_state);
2411 ret = reganode(pRExC_state, OPEN, parno);
2412 Set_Node_Length(ret, 1); /* MJD */
2413 Set_Node_Offset(ret, RExC_parse); /* MJD */
2420 /* Pick up the branches, linking them together. */
2421 parse_start = RExC_parse; /* MJD */
2422 br = regbranch(pRExC_state, &flags, 1);
2423 /* branch_len = (paren != 0); */
2427 if (*RExC_parse == '|') {
2428 if (!SIZE_ONLY && RExC_extralen) {
2429 reginsert(pRExC_state, BRANCHJ, br);
2432 reginsert(pRExC_state, BRANCH, br);
2433 Set_Node_Length(br, paren != 0);
2434 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
2438 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
2440 else if (paren == ':') {
2441 *flagp |= flags&SIMPLE;
2443 if (open) { /* Starts with OPEN. */
2444 regtail(pRExC_state, ret, br); /* OPEN -> first. */
2446 else if (paren != '?') /* Not Conditional */
2448 *flagp |= flags & (SPSTART | HASWIDTH);
2450 while (*RExC_parse == '|') {
2451 if (!SIZE_ONLY && RExC_extralen) {
2452 ender = reganode(pRExC_state, LONGJMP,0);
2453 regtail(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
2456 RExC_extralen += 2; /* Account for LONGJMP. */
2457 nextchar(pRExC_state);
2458 br = regbranch(pRExC_state, &flags, 0);
2462 regtail(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
2466 *flagp |= flags&SPSTART;
2469 if (have_branch || paren != ':') {
2470 /* Make a closing node, and hook it on the end. */
2473 ender = reg_node(pRExC_state, TAIL);
2476 ender = reganode(pRExC_state, CLOSE, parno);
2477 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
2478 Set_Node_Length(ender,1); /* MJD */
2484 *flagp &= ~HASWIDTH;
2487 ender = reg_node(pRExC_state, SUCCEED);
2490 ender = reg_node(pRExC_state, END);
2493 regtail(pRExC_state, lastbr, ender);
2496 /* Hook the tails of the branches to the closing node. */
2497 for (br = ret; br != NULL; br = regnext(br)) {
2498 regoptail(pRExC_state, br, ender);
2505 static char parens[] = "=!<,>";
2507 if (paren && (p = strchr(parens, paren))) {
2508 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
2509 int flag = (p - parens) > 1;
2512 node = SUSPEND, flag = 0;
2513 reginsert(pRExC_state, node,ret);
2514 Set_Node_Cur_Length(ret);
2515 Set_Node_Offset(ret, parse_start + 1);
2517 regtail(pRExC_state, ret, reg_node(pRExC_state, TAIL));
2521 /* Check for proper termination. */
2523 RExC_flags = oregflags;
2524 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
2525 RExC_parse = oregcomp_parse;
2526 vFAIL("Unmatched (");
2529 else if (!paren && RExC_parse < RExC_end) {
2530 if (*RExC_parse == ')') {
2532 vFAIL("Unmatched )");
2535 FAIL("Junk on end of regexp"); /* "Can't happen". */
2543 - regbranch - one alternative of an | operator
2545 * Implements the concatenation operator.
2548 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first)
2550 register regnode *ret;
2551 register regnode *chain = NULL;
2552 register regnode *latest;
2553 I32 flags = 0, c = 0;
2558 if (!SIZE_ONLY && RExC_extralen)
2559 ret = reganode(pRExC_state, BRANCHJ,0);
2561 ret = reg_node(pRExC_state, BRANCH);
2562 Set_Node_Length(ret, 1);
2566 if (!first && SIZE_ONLY)
2567 RExC_extralen += 1; /* BRANCHJ */
2569 *flagp = WORST; /* Tentatively. */
2572 nextchar(pRExC_state);
2573 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
2575 latest = regpiece(pRExC_state, &flags);
2576 if (latest == NULL) {
2577 if (flags & TRYAGAIN)
2581 else if (ret == NULL)
2583 *flagp |= flags&HASWIDTH;
2584 if (chain == NULL) /* First piece. */
2585 *flagp |= flags&SPSTART;
2588 regtail(pRExC_state, chain, latest);
2593 if (chain == NULL) { /* Loop ran zero times. */
2594 chain = reg_node(pRExC_state, NOTHING);
2599 *flagp |= flags&SIMPLE;
2606 - regpiece - something followed by possible [*+?]
2608 * Note that the branching code sequences used for ? and the general cases
2609 * of * and + are somewhat optimized: they use the same NOTHING node as
2610 * both the endmarker for their branch list and the body of the last branch.
2611 * It might seem that this node could be dispensed with entirely, but the
2612 * endmarker role is not redundant.
2615 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2617 register regnode *ret;
2619 register char *next;
2621 char *origparse = RExC_parse;
2624 I32 max = REG_INFTY;
2627 ret = regatom(pRExC_state, &flags);
2629 if (flags & TRYAGAIN)
2636 if (op == '{' && regcurly(RExC_parse)) {
2637 parse_start = RExC_parse; /* MJD */
2638 next = RExC_parse + 1;
2640 while (isDIGIT(*next) || *next == ',') {
2649 if (*next == '}') { /* got one */
2653 min = atoi(RExC_parse);
2657 maxpos = RExC_parse;
2659 if (!max && *maxpos != '0')
2660 max = REG_INFTY; /* meaning "infinity" */
2661 else if (max >= REG_INFTY)
2662 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
2664 nextchar(pRExC_state);
2667 if ((flags&SIMPLE)) {
2668 RExC_naughty += 2 + RExC_naughty / 2;
2669 reginsert(pRExC_state, CURLY, ret);
2670 Set_Node_Offset(ret, parse_start+1); /* MJD */
2671 Set_Node_Cur_Length(ret);
2674 regnode *w = reg_node(pRExC_state, WHILEM);
2677 regtail(pRExC_state, ret, w);
2678 if (!SIZE_ONLY && RExC_extralen) {
2679 reginsert(pRExC_state, LONGJMP,ret);
2680 reginsert(pRExC_state, NOTHING,ret);
2681 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
2683 reginsert(pRExC_state, CURLYX,ret);
2685 Set_Node_Offset(ret, parse_start+1);
2686 Set_Node_Length(ret,
2687 op == '{' ? (RExC_parse - parse_start) : 1);
2689 if (!SIZE_ONLY && RExC_extralen)
2690 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
2691 regtail(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
2693 RExC_whilem_seen++, RExC_extralen += 3;
2694 RExC_naughty += 4 + RExC_naughty; /* compound interest */
2702 if (max && max < min)
2703 vFAIL("Can't do {n,m} with n > m");
2705 ARG1_SET(ret, (U16)min);
2706 ARG2_SET(ret, (U16)max);
2718 #if 0 /* Now runtime fix should be reliable. */
2720 /* if this is reinstated, don't forget to put this back into perldiag:
2722 =item Regexp *+ operand could be empty at {#} in regex m/%s/
2724 (F) The part of the regexp subject to either the * or + quantifier
2725 could match an empty string. The {#} shows in the regular
2726 expression about where the problem was discovered.
2730 if (!(flags&HASWIDTH) && op != '?')
2731 vFAIL("Regexp *+ operand could be empty");
2734 parse_start = RExC_parse;
2735 nextchar(pRExC_state);
2737 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
2739 if (op == '*' && (flags&SIMPLE)) {
2740 reginsert(pRExC_state, STAR, ret);
2744 else if (op == '*') {
2748 else if (op == '+' && (flags&SIMPLE)) {
2749 reginsert(pRExC_state, PLUS, ret);
2753 else if (op == '+') {
2757 else if (op == '?') {
2762 if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
2764 "%.*s matches null string many times",
2765 RExC_parse - origparse,
2769 if (*RExC_parse == '?') {
2770 nextchar(pRExC_state);
2771 reginsert(pRExC_state, MINMOD, ret);
2772 regtail(pRExC_state, ret, ret + NODE_STEP_REGNODE);
2774 if (ISMULT2(RExC_parse)) {
2776 vFAIL("Nested quantifiers");
2783 - regatom - the lowest level
2785 * Optimization: gobbles an entire sequence of ordinary characters so that
2786 * it can turn them into a single node, which is smaller to store and
2787 * faster to run. Backslashed characters are exceptions, each becoming a
2788 * separate node; the code is simpler that way and it's not worth fixing.
2790 * [Yes, it is worth fixing, some scripts can run twice the speed.] */
2792 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp)
2794 register regnode *ret = 0;
2796 char *parse_start = RExC_parse;
2798 *flagp = WORST; /* Tentatively. */
2801 switch (*RExC_parse) {
2803 RExC_seen_zerolen++;
2804 nextchar(pRExC_state);
2805 if (RExC_flags & PMf_MULTILINE)
2806 ret = reg_node(pRExC_state, MBOL);
2807 else if (RExC_flags & PMf_SINGLELINE)
2808 ret = reg_node(pRExC_state, SBOL);
2810 ret = reg_node(pRExC_state, BOL);
2811 Set_Node_Length(ret, 1); /* MJD */
2814 nextchar(pRExC_state);
2816 RExC_seen_zerolen++;
2817 if (RExC_flags & PMf_MULTILINE)
2818 ret = reg_node(pRExC_state, MEOL);
2819 else if (RExC_flags & PMf_SINGLELINE)
2820 ret = reg_node(pRExC_state, SEOL);
2822 ret = reg_node(pRExC_state, EOL);
2823 Set_Node_Length(ret, 1); /* MJD */
2826 nextchar(pRExC_state);
2827 if (RExC_flags & PMf_SINGLELINE)
2828 ret = reg_node(pRExC_state, SANY);
2830 ret = reg_node(pRExC_state, REG_ANY);
2831 *flagp |= HASWIDTH|SIMPLE;
2833 Set_Node_Length(ret, 1); /* MJD */
2837 char *oregcomp_parse = ++RExC_parse;
2838 ret = regclass(pRExC_state);
2839 if (*RExC_parse != ']') {
2840 RExC_parse = oregcomp_parse;
2841 vFAIL("Unmatched [");
2843 nextchar(pRExC_state);
2844 *flagp |= HASWIDTH|SIMPLE;
2845 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
2849 nextchar(pRExC_state);
2850 ret = reg(pRExC_state, 1, &flags);
2852 if (flags & TRYAGAIN) {
2853 if (RExC_parse == RExC_end) {
2854 /* Make parent create an empty node if needed. */
2862 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
2866 if (flags & TRYAGAIN) {
2870 vFAIL("Internal urp");
2871 /* Supposed to be caught earlier. */
2874 if (!regcurly(RExC_parse)) {
2883 vFAIL("Quantifier follows nothing");
2886 switch (*++RExC_parse) {
2888 RExC_seen_zerolen++;
2889 ret = reg_node(pRExC_state, SBOL);
2891 nextchar(pRExC_state);
2892 Set_Node_Length(ret, 2); /* MJD */
2895 ret = reg_node(pRExC_state, GPOS);
2896 RExC_seen |= REG_SEEN_GPOS;
2898 nextchar(pRExC_state);
2899 Set_Node_Length(ret, 2); /* MJD */
2902 ret = reg_node(pRExC_state, SEOL);
2904 RExC_seen_zerolen++; /* Do not optimize RE away */
2905 nextchar(pRExC_state);
2908 ret = reg_node(pRExC_state, EOS);
2910 RExC_seen_zerolen++; /* Do not optimize RE away */
2911 nextchar(pRExC_state);
2912 Set_Node_Length(ret, 2); /* MJD */
2915 ret = reg_node(pRExC_state, CANY);
2916 RExC_seen |= REG_SEEN_CANY;
2917 *flagp |= HASWIDTH|SIMPLE;
2918 nextchar(pRExC_state);
2919 Set_Node_Length(ret, 2); /* MJD */
2922 ret = reg_node(pRExC_state, CLUMP);
2924 nextchar(pRExC_state);
2925 Set_Node_Length(ret, 2); /* MJD */
2928 ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM));
2929 *flagp |= HASWIDTH|SIMPLE;
2930 nextchar(pRExC_state);
2931 Set_Node_Length(ret, 2); /* MJD */
2934 ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM));
2935 *flagp |= HASWIDTH|SIMPLE;
2936 nextchar(pRExC_state);
2937 Set_Node_Length(ret, 2); /* MJD */
2940 RExC_seen_zerolen++;
2941 RExC_seen |= REG_SEEN_LOOKBEHIND;
2942 ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND));
2944 nextchar(pRExC_state);
2945 Set_Node_Length(ret, 2); /* MJD */
2948 RExC_seen_zerolen++;
2949 RExC_seen |= REG_SEEN_LOOKBEHIND;
2950 ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND));
2952 nextchar(pRExC_state);
2953 Set_Node_Length(ret, 2); /* MJD */
2956 ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE));
2957 *flagp |= HASWIDTH|SIMPLE;
2958 nextchar(pRExC_state);
2959 Set_Node_Length(ret, 2); /* MJD */
2962 ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE));
2963 *flagp |= HASWIDTH|SIMPLE;
2964 nextchar(pRExC_state);
2965 Set_Node_Length(ret, 2); /* MJD */
2968 ret = reg_node(pRExC_state, DIGIT);
2969 *flagp |= HASWIDTH|SIMPLE;
2970 nextchar(pRExC_state);
2971 Set_Node_Length(ret, 2); /* MJD */
2974 ret = reg_node(pRExC_state, NDIGIT);
2975 *flagp |= HASWIDTH|SIMPLE;
2976 nextchar(pRExC_state);
2977 Set_Node_Length(ret, 2); /* MJD */
2982 char* oldregxend = RExC_end;
2983 char* parse_start = RExC_parse - 2;
2985 if (RExC_parse[1] == '{') {
2986 /* a lovely hack--pretend we saw [\pX] instead */
2987 RExC_end = strchr(RExC_parse, '}');
2989 U8 c = (U8)*RExC_parse;
2991 RExC_end = oldregxend;
2992 vFAIL2("Missing right brace on \\%c{}", c);
2997 RExC_end = RExC_parse + 2;
2998 if (RExC_end > oldregxend)
2999 RExC_end = oldregxend;
3003 ret = regclass(pRExC_state);
3005 RExC_end = oldregxend;
3008 Set_Node_Offset(ret, parse_start + 2);
3009 Set_Node_Cur_Length(ret);
3010 nextchar(pRExC_state);
3011 *flagp |= HASWIDTH|SIMPLE;
3024 case '1': case '2': case '3': case '4':
3025 case '5': case '6': case '7': case '8': case '9':
3027 I32 num = atoi(RExC_parse);
3029 if (num > 9 && num >= RExC_npar)
3032 char * parse_start = RExC_parse - 1; /* MJD */
3033 while (isDIGIT(*RExC_parse))
3036 if (!SIZE_ONLY && num > (I32)RExC_rx->nparens)
3037 vFAIL("Reference to nonexistent group");
3039 ret = reganode(pRExC_state,
3040 (U8)(FOLD ? (LOC ? REFFL : REFF) : REF),
3044 /* override incorrect value set in reganode MJD */
3045 Set_Node_Offset(ret, parse_start+1);
3046 Set_Node_Cur_Length(ret); /* MJD */
3048 nextchar(pRExC_state);
3053 if (RExC_parse >= RExC_end)
3054 FAIL("Trailing \\");
3057 /* Do not generate `unrecognized' warnings here, we fall
3058 back into the quick-grab loop below */
3065 if (RExC_flags & PMf_EXTENDED) {
3066 while (RExC_parse < RExC_end && *RExC_parse != '\n') RExC_parse++;
3067 if (RExC_parse < RExC_end)
3073 register STRLEN len;
3079 U8 tmpbuf[UTF8_MAXLEN_FOLD+1], *foldbuf;
3081 parse_start = RExC_parse - 1;
3087 ret = reg_node(pRExC_state,
3088 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
3090 for (len = 0, p = RExC_parse - 1;
3091 len < 127 && p < RExC_end;
3096 if (RExC_flags & PMf_EXTENDED)
3097 p = regwhite(p, RExC_end);
3144 ender = ASCII_TO_NATIVE('\033');
3148 ender = ASCII_TO_NATIVE('\007');
3153 char* e = strchr(p, '}');
3157 vFAIL("Missing right brace on \\x{}");
3160 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3161 | PERL_SCAN_DISALLOW_PREFIX;
3163 ender = grok_hex(p + 1, &numlen, &flags, NULL);
3170 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
3172 ender = grok_hex(p, &numlen, &flags, NULL);
3178 ender = UCHARAT(p++);
3179 ender = toCTRL(ender);
3181 case '0': case '1': case '2': case '3':case '4':
3182 case '5': case '6': case '7': case '8':case '9':
3184 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
3187 ender = grok_oct(p, &numlen, &flags, NULL);
3197 FAIL("Trailing \\");
3200 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p))
3201 vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
3202 goto normal_default;
3207 if (UTF8_IS_START(*p) && UTF) {
3208 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
3216 if (RExC_flags & PMf_EXTENDED)
3217 p = regwhite(p, RExC_end);
3219 /* Prime the casefolded buffer. */
3220 ender = toFOLD_uni(ender, tmpbuf, &foldlen);
3222 if (ISMULT2(p)) { /* Back off on ?+*. */
3229 /* Emit all the Unicode characters. */
3230 for (foldbuf = tmpbuf;
3232 foldlen -= numlen) {
3233 ender = utf8_to_uvchr(foldbuf, &numlen);
3235 reguni(pRExC_state, ender, s, &unilen);
3238 /* In EBCDIC the numlen
3239 * and unilen can differ. */
3241 if (numlen >= foldlen)
3245 break; /* "Can't happen." */
3249 reguni(pRExC_state, ender, s, &unilen);
3258 REGC((char)ender, s++);
3266 /* Emit all the Unicode characters. */
3267 for (foldbuf = tmpbuf;
3269 foldlen -= numlen) {
3270 ender = utf8_to_uvchr(foldbuf, &numlen);
3272 reguni(pRExC_state, ender, s, &unilen);
3275 /* In EBCDIC the numlen
3276 * and unilen can differ. */
3278 if (numlen >= foldlen)
3286 reguni(pRExC_state, ender, s, &unilen);
3295 REGC((char)ender, s++);
3299 Set_Node_Cur_Length(ret); /* MJD */
3300 nextchar(pRExC_state);
3302 /* len is STRLEN which is unsigned, need to copy to signed */
3305 vFAIL("Internal disaster");
3309 if (len == 1 && UNI_IS_INVARIANT(ender))
3314 RExC_size += STR_SZ(len);
3316 RExC_emit += STR_SZ(len);
3321 /* If the encoding pragma is in effect recode the text of
3322 * any EXACT-kind nodes. */
3323 if (PL_encoding && PL_regkind[(U8)OP(ret)] == EXACT) {
3324 STRLEN oldlen = STR_LEN(ret);
3325 SV *sv = sv_2mortal(newSVpvn(STRING(ret), oldlen));
3329 if (sv_utf8_downgrade(sv, TRUE)) {
3330 char *s = sv_recode_to_utf8(sv, PL_encoding);
3331 STRLEN newlen = SvCUR(sv);
3336 DEBUG_r(PerlIO_printf(Perl_debug_log, "recode %*s to %*s\n",
3337 (int)oldlen, STRING(ret),
3339 Copy(s, STRING(ret), newlen, char);
3340 STR_LEN(ret) += newlen - oldlen;
3341 RExC_emit += STR_SZ(newlen) - STR_SZ(oldlen);
3343 RExC_size += STR_SZ(newlen) - STR_SZ(oldlen);
3351 S_regwhite(pTHX_ char *p, char *e)
3356 else if (*p == '#') {
3359 } while (p < e && *p != '\n');
3367 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
3368 Character classes ([:foo:]) can also be negated ([:^foo:]).
3369 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
3370 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
3371 but trigger failures because they are currently unimplemented. */
3373 #define POSIXCC_DONE(c) ((c) == ':')
3374 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
3375 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
3378 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
3381 I32 namedclass = OOB_NAMEDCLASS;
3383 if (value == '[' && RExC_parse + 1 < RExC_end &&
3384 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3385 POSIXCC(UCHARAT(RExC_parse))) {
3386 char c = UCHARAT(RExC_parse);
3387 char* s = RExC_parse++;
3389 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
3391 if (RExC_parse == RExC_end)
3392 /* Grandfather lone [:, [=, [. */
3395 char* t = RExC_parse++; /* skip over the c */
3397 if (UCHARAT(RExC_parse) == ']') {
3398 RExC_parse++; /* skip over the ending ] */
3401 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
3402 I32 skip = 5; /* the most common skip */
3406 if (strnEQ(posixcc, "alnum", 5))
3408 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
3409 else if (strnEQ(posixcc, "alpha", 5))
3411 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
3412 else if (strnEQ(posixcc, "ascii", 5))
3414 complement ? ANYOF_NASCII : ANYOF_ASCII;
3417 if (strnEQ(posixcc, "blank", 5))
3419 complement ? ANYOF_NBLANK : ANYOF_BLANK;
3422 if (strnEQ(posixcc, "cntrl", 5))
3424 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
3427 if (strnEQ(posixcc, "digit", 5))
3429 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
3432 if (strnEQ(posixcc, "graph", 5))
3434 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
3437 if (strnEQ(posixcc, "lower", 5))
3439 complement ? ANYOF_NLOWER : ANYOF_LOWER;
3442 if (strnEQ(posixcc, "print", 5))
3444 complement ? ANYOF_NPRINT : ANYOF_PRINT;
3445 else if (strnEQ(posixcc, "punct", 5))
3447 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
3450 if (strnEQ(posixcc, "space", 5))
3452 complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
3455 if (strnEQ(posixcc, "upper", 5))
3457 complement ? ANYOF_NUPPER : ANYOF_UPPER;
3459 case 'w': /* this is not POSIX, this is the Perl \w */
3460 if (strnEQ(posixcc, "word", 4)) {
3462 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
3467 if (strnEQ(posixcc, "xdigit", 6)) {
3469 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
3474 if (namedclass == OOB_NAMEDCLASS ||
3475 posixcc[skip] != ':' ||
3476 posixcc[skip+1] != ']')
3478 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
3481 } else if (!SIZE_ONLY) {
3482 /* [[=foo=]] and [[.foo.]] are still future. */
3484 /* adjust RExC_parse so the warning shows after
3486 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
3488 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3491 /* Maternal grandfather:
3492 * "[:" ending in ":" but not in ":]" */
3502 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
3504 if (!SIZE_ONLY && POSIXCC(UCHARAT(RExC_parse))) {
3505 char *s = RExC_parse;
3508 while(*s && isALNUM(*s))
3510 if (*s && c == *s && s[1] == ']') {
3511 if (ckWARN(WARN_REGEXP))
3513 "POSIX syntax [%c %c] belongs inside character classes",
3516 /* [[=foo=]] and [[.foo.]] are still future. */
3517 if (POSIXCC_NOTYET(c)) {
3518 /* adjust RExC_parse so the error shows after
3520 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
3522 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
3529 S_regclass(pTHX_ RExC_state_t *pRExC_state)
3532 register UV nextvalue;
3533 register IV prevvalue = OOB_UNICODE;
3534 register IV range = 0;
3535 register regnode *ret;
3538 char *rangebegin = 0;
3539 bool need_class = 0;
3540 SV *listsv = Nullsv;
3543 bool optimize_invert = TRUE;
3544 AV* unicode_alternate = 0;
3546 UV literal_endpoint = 0;
3549 ret = reganode(pRExC_state, ANYOF, 0);
3552 ANYOF_FLAGS(ret) = 0;
3554 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
3558 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
3562 RExC_size += ANYOF_SKIP;
3564 RExC_emit += ANYOF_SKIP;
3566 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
3568 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
3569 ANYOF_BITMAP_ZERO(ret);
3570 listsv = newSVpvn("# comment\n", 10);
3573 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
3575 if (!SIZE_ONLY && POSIXCC(nextvalue))
3576 checkposixcc(pRExC_state);
3578 /* allow 1st char to be ] (allowing it to be - is dealt with later) */
3579 if (UCHARAT(RExC_parse) == ']')
3582 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
3586 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
3589 rangebegin = RExC_parse;
3591 value = utf8n_to_uvchr((U8*)RExC_parse,
3592 RExC_end - RExC_parse,
3594 RExC_parse += numlen;
3597 value = UCHARAT(RExC_parse++);
3598 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
3599 if (value == '[' && POSIXCC(nextvalue))
3600 namedclass = regpposixcc(pRExC_state, value);
3601 else if (value == '\\') {
3603 value = utf8n_to_uvchr((U8*)RExC_parse,
3604 RExC_end - RExC_parse,
3606 RExC_parse += numlen;
3609 value = UCHARAT(RExC_parse++);
3610 /* Some compilers cannot handle switching on 64-bit integer
3611 * values, therefore value cannot be an UV. Yes, this will
3612 * be a problem later if we want switch on Unicode.
3613 * A similar issue a little bit later when switching on
3614 * namedclass. --jhi */
3615 switch ((I32)value) {
3616 case 'w': namedclass = ANYOF_ALNUM; break;
3617 case 'W': namedclass = ANYOF_NALNUM; break;
3618 case 's': namedclass = ANYOF_SPACE; break;
3619 case 'S': namedclass = ANYOF_NSPACE; break;
3620 case 'd': namedclass = ANYOF_DIGIT; break;
3621 case 'D': namedclass = ANYOF_NDIGIT; break;
3624 if (RExC_parse >= RExC_end)
3625 vFAIL2("Empty \\%c{}", (U8)value);
3626 if (*RExC_parse == '{') {
3628 e = strchr(RExC_parse++, '}');
3630 vFAIL2("Missing right brace on \\%c{}", c);
3631 while (isSPACE(UCHARAT(RExC_parse)))
3633 if (e == RExC_parse)
3634 vFAIL2("Empty \\%c{}", c);
3636 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
3644 if (UCHARAT(RExC_parse) == '^') {
3647 value = value == 'p' ? 'P' : 'p'; /* toggle */
3648 while (isSPACE(UCHARAT(RExC_parse))) {
3654 Perl_sv_catpvf(aTHX_ listsv,
3655 "+utf8::%.*s\n", (int)n, RExC_parse);
3657 Perl_sv_catpvf(aTHX_ listsv,
3658 "!utf8::%.*s\n", (int)n, RExC_parse);
3661 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3663 case 'n': value = '\n'; break;
3664 case 'r': value = '\r'; break;
3665 case 't': value = '\t'; break;
3666 case 'f': value = '\f'; break;
3667 case 'b': value = '\b'; break;
3668 case 'e': value = ASCII_TO_NATIVE('\033');break;
3669 case 'a': value = ASCII_TO_NATIVE('\007');break;
3671 if (*RExC_parse == '{') {
3672 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3673 | PERL_SCAN_DISALLOW_PREFIX;
3674 e = strchr(RExC_parse++, '}');
3676 vFAIL("Missing right brace on \\x{}");
3678 numlen = e - RExC_parse;
3679 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
3683 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
3685 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
3686 RExC_parse += numlen;
3690 value = UCHARAT(RExC_parse++);
3691 value = toCTRL(value);
3693 case '0': case '1': case '2': case '3': case '4':
3694 case '5': case '6': case '7': case '8': case '9':
3698 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
3699 RExC_parse += numlen;
3703 if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value))
3705 "Unrecognized escape \\%c in character class passed through",
3709 } /* end of \blah */
3715 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
3717 if (!SIZE_ONLY && !need_class)
3718 ANYOF_CLASS_ZERO(ret);
3722 /* a bad range like a-\d, a-[:digit:] ? */
3725 if (ckWARN(WARN_REGEXP))
3727 "False [] range \"%*.*s\"",
3728 RExC_parse - rangebegin,
3729 RExC_parse - rangebegin,
3731 if (prevvalue < 256) {
3732 ANYOF_BITMAP_SET(ret, prevvalue);
3733 ANYOF_BITMAP_SET(ret, '-');
3736 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
3737 Perl_sv_catpvf(aTHX_ listsv,
3738 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
3742 range = 0; /* this was not a true range */
3746 if (namedclass > OOB_NAMEDCLASS)
3747 optimize_invert = FALSE;
3748 /* Possible truncation here but in some 64-bit environments
3749 * the compiler gets heartburn about switch on 64-bit values.
3750 * A similar issue a little earlier when switching on value.
3752 switch ((I32)namedclass) {
3755 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
3757 for (value = 0; value < 256; value++)
3759 ANYOF_BITMAP_SET(ret, value);
3761 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n");
3765 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
3767 for (value = 0; value < 256; value++)
3768 if (!isALNUM(value))
3769 ANYOF_BITMAP_SET(ret, value);
3771 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n");
3775 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
3777 for (value = 0; value < 256; value++)
3778 if (isALNUMC(value))
3779 ANYOF_BITMAP_SET(ret, value);
3781 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n");
3785 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
3787 for (value = 0; value < 256; value++)
3788 if (!isALNUMC(value))
3789 ANYOF_BITMAP_SET(ret, value);
3791 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n");
3795 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
3797 for (value = 0; value < 256; value++)
3799 ANYOF_BITMAP_SET(ret, value);
3801 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n");
3805 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
3807 for (value = 0; value < 256; value++)
3808 if (!isALPHA(value))
3809 ANYOF_BITMAP_SET(ret, value);
3811 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n");
3815 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
3818 for (value = 0; value < 128; value++)
3819 ANYOF_BITMAP_SET(ret, value);
3821 for (value = 0; value < 256; value++) {
3823 ANYOF_BITMAP_SET(ret, value);
3827 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n");
3831 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
3834 for (value = 128; value < 256; value++)
3835 ANYOF_BITMAP_SET(ret, value);
3837 for (value = 0; value < 256; value++) {
3838 if (!isASCII(value))
3839 ANYOF_BITMAP_SET(ret, value);
3843 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n");
3847 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
3849 for (value = 0; value < 256; value++)
3851 ANYOF_BITMAP_SET(ret, value);
3853 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsBlank\n");
3857 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
3859 for (value = 0; value < 256; value++)
3860 if (!isBLANK(value))
3861 ANYOF_BITMAP_SET(ret, value);
3863 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsBlank\n");
3867 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
3869 for (value = 0; value < 256; value++)
3871 ANYOF_BITMAP_SET(ret, value);
3873 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n");
3877 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
3879 for (value = 0; value < 256; value++)
3880 if (!isCNTRL(value))
3881 ANYOF_BITMAP_SET(ret, value);
3883 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n");
3887 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
3889 /* consecutive digits assumed */
3890 for (value = '0'; value <= '9'; value++)
3891 ANYOF_BITMAP_SET(ret, value);
3893 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n");
3897 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
3899 /* consecutive digits assumed */
3900 for (value = 0; value < '0'; value++)
3901 ANYOF_BITMAP_SET(ret, value);
3902 for (value = '9' + 1; value < 256; value++)
3903 ANYOF_BITMAP_SET(ret, value);
3905 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n");
3909 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
3911 for (value = 0; value < 256; value++)
3913 ANYOF_BITMAP_SET(ret, value);
3915 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n");
3919 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
3921 for (value = 0; value < 256; value++)
3922 if (!isGRAPH(value))
3923 ANYOF_BITMAP_SET(ret, value);
3925 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n");
3929 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
3931 for (value = 0; value < 256; value++)
3933 ANYOF_BITMAP_SET(ret, value);
3935 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n");
3939 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
3941 for (value = 0; value < 256; value++)
3942 if (!isLOWER(value))
3943 ANYOF_BITMAP_SET(ret, value);
3945 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n");
3949 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
3951 for (value = 0; value < 256; value++)
3953 ANYOF_BITMAP_SET(ret, value);
3955 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n");
3959 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
3961 for (value = 0; value < 256; value++)
3962 if (!isPRINT(value))
3963 ANYOF_BITMAP_SET(ret, value);
3965 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n");
3969 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
3971 for (value = 0; value < 256; value++)
3972 if (isPSXSPC(value))
3973 ANYOF_BITMAP_SET(ret, value);
3975 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n");
3979 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
3981 for (value = 0; value < 256; value++)
3982 if (!isPSXSPC(value))
3983 ANYOF_BITMAP_SET(ret, value);
3985 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n");
3989 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
3991 for (value = 0; value < 256; value++)
3993 ANYOF_BITMAP_SET(ret, value);
3995 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n");
3999 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
4001 for (value = 0; value < 256; value++)
4002 if (!isPUNCT(value))
4003 ANYOF_BITMAP_SET(ret, value);
4005 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n");
4009 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
4011 for (value = 0; value < 256; value++)
4013 ANYOF_BITMAP_SET(ret, value);
4015 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpacePerl\n");
4019 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
4021 for (value = 0; value < 256; value++)
4022 if (!isSPACE(value))
4023 ANYOF_BITMAP_SET(ret, value);
4025 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpacePerl\n");
4029 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
4031 for (value = 0; value < 256; value++)
4033 ANYOF_BITMAP_SET(ret, value);
4035 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n");
4039 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
4041 for (value = 0; value < 256; value++)
4042 if (!isUPPER(value))
4043 ANYOF_BITMAP_SET(ret, value);
4045 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n");
4049 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
4051 for (value = 0; value < 256; value++)
4052 if (isXDIGIT(value))
4053 ANYOF_BITMAP_SET(ret, value);
4055 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n");
4059 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
4061 for (value = 0; value < 256; value++)
4062 if (!isXDIGIT(value))
4063 ANYOF_BITMAP_SET(ret, value);
4065 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n");
4068 vFAIL("Invalid [::] class");
4072 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
4075 } /* end of namedclass \blah */
4078 if (prevvalue > (IV)value) /* b-a */ {
4079 Simple_vFAIL4("Invalid [] range \"%*.*s\"",
4080 RExC_parse - rangebegin,
4081 RExC_parse - rangebegin,
4083 range = 0; /* not a valid range */
4087 prevvalue = value; /* save the beginning of the range */
4088 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
4089 RExC_parse[1] != ']') {
4092 /* a bad range like \w-, [:word:]- ? */
4093 if (namedclass > OOB_NAMEDCLASS) {
4094 if (ckWARN(WARN_REGEXP))
4096 "False [] range \"%*.*s\"",
4097 RExC_parse - rangebegin,
4098 RExC_parse - rangebegin,
4101 ANYOF_BITMAP_SET(ret, '-');
4103 range = 1; /* yeah, it's a range! */
4104 continue; /* but do it the next time */
4108 /* now is the next time */
4112 if (prevvalue < 256) {
4113 IV ceilvalue = value < 256 ? value : 255;
4116 /* In EBCDIC [\x89-\x91] should include
4117 * the \x8e but [i-j] should not. */
4118 if (literal_endpoint == 2 &&
4119 ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
4120 (isUPPER(prevvalue) && isUPPER(ceilvalue))))
4122 if (isLOWER(prevvalue)) {
4123 for (i = prevvalue; i <= ceilvalue; i++)
4125 ANYOF_BITMAP_SET(ret, i);
4127 for (i = prevvalue; i <= ceilvalue; i++)
4129 ANYOF_BITMAP_SET(ret, i);
4134 for (i = prevvalue; i <= ceilvalue; i++)
4135 ANYOF_BITMAP_SET(ret, i);
4137 if (value > 255 || UTF) {
4138 UV prevnatvalue = NATIVE_TO_UNI(prevvalue);
4139 UV natvalue = NATIVE_TO_UNI(value);
4141 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
4142 if (prevnatvalue < natvalue) { /* what about > ? */
4143 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
4144 prevnatvalue, natvalue);
4146 else if (prevnatvalue == natvalue) {
4147 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue);
4149 U8 foldbuf[UTF8_MAXLEN_FOLD+1];
4151 UV f = to_uni_fold(natvalue, foldbuf, &foldlen);
4153 /* If folding and foldable and a single
4154 * character, insert also the folded version
4155 * to the charclass. */
4157 if (foldlen == (STRLEN)UNISKIP(f))
4158 Perl_sv_catpvf(aTHX_ listsv,
4161 /* Any multicharacter foldings
4162 * require the following transform:
4163 * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst)
4164 * where E folds into "pq" and F folds
4165 * into "rst", all other characters
4166 * fold to single characters. We save
4167 * away these multicharacter foldings,
4168 * to be later saved as part of the
4169 * additional "s" data. */
4172 if (!unicode_alternate)
4173 unicode_alternate = newAV();
4174 sv = newSVpvn((char*)foldbuf, foldlen);
4176 av_push(unicode_alternate, sv);
4180 /* If folding and the value is one of the Greek
4181 * sigmas insert a few more sigmas to make the
4182 * folding rules of the sigmas to work right.
4183 * Note that not all the possible combinations
4184 * are handled here: some of them are handled
4185 * by the standard folding rules, and some of
4186 * them (literal or EXACTF cases) are handled
4187 * during runtime in regexec.c:S_find_byclass(). */
4188 if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) {
4189 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
4190 (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA);
4191 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
4192 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
4194 else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA)
4195 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
4196 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
4201 literal_endpoint = 0;
4205 range = 0; /* this range (if it was one) is done now */
4209 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
4211 RExC_size += ANYOF_CLASS_ADD_SKIP;
4213 RExC_emit += ANYOF_CLASS_ADD_SKIP;
4216 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
4218 /* If the only flag is folding (plus possibly inversion). */
4219 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
4221 for (value = 0; value < 256; ++value) {
4222 if (ANYOF_BITMAP_TEST(ret, value)) {
4223 UV fold = PL_fold[value];
4226 ANYOF_BITMAP_SET(ret, fold);
4229 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
4232 /* optimize inverted simple patterns (e.g. [^a-z]) */
4233 if (!SIZE_ONLY && optimize_invert &&
4234 /* If the only flag is inversion. */
4235 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
4236 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
4237 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
4238 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
4245 /* The 0th element stores the character class description
4246 * in its textual form: used later (regexec.c:Perl_regclass_swash())
4247 * to initialize the appropriate swash (which gets stored in
4248 * the 1st element), and also useful for dumping the regnode.
4249 * The 2nd element stores the multicharacter foldings,
4250 * used later (regexec.c:S_reginclass()). */
4251 av_store(av, 0, listsv);
4252 av_store(av, 1, NULL);
4253 av_store(av, 2, (SV*)unicode_alternate);
4254 rv = newRV_noinc((SV*)av);
4255 n = add_data(pRExC_state, 1, "s");
4256 RExC_rx->data->data[n] = (void*)rv;
4264 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
4266 char* retval = RExC_parse++;
4269 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
4270 RExC_parse[2] == '#') {
4271 while (*RExC_parse != ')') {
4272 if (RExC_parse == RExC_end)
4273 FAIL("Sequence (?#... not terminated");
4279 if (RExC_flags & PMf_EXTENDED) {
4280 if (isSPACE(*RExC_parse)) {
4284 else if (*RExC_parse == '#') {
4285 while (RExC_parse < RExC_end)
4286 if (*RExC_parse++ == '\n') break;
4295 - reg_node - emit a node
4297 STATIC regnode * /* Location. */
4298 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
4300 register regnode *ret;
4301 register regnode *ptr;
4305 SIZE_ALIGN(RExC_size);
4310 NODE_ALIGN_FILL(ret);
4312 FILL_ADVANCE_NODE(ptr, op);
4313 if (RExC_offsets) { /* MJD */
4314 MJD_OFFSET_DEBUG(("%s:%u: (op %s) %s %u <- %u (len %u) (max %u).\n",
4315 "reg_node", __LINE__,
4317 RExC_emit - RExC_emit_start > RExC_offsets[0]
4318 ? "Overwriting end of array!\n" : "OK",
4319 RExC_emit - RExC_emit_start,
4320 RExC_parse - RExC_start,
4322 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
4331 - reganode - emit a node with an argument
4333 STATIC regnode * /* Location. */
4334 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
4336 register regnode *ret;
4337 register regnode *ptr;
4341 SIZE_ALIGN(RExC_size);
4346 NODE_ALIGN_FILL(ret);
4348 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
4349 if (RExC_offsets) { /* MJD */
4350 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %u <- %u (max %u).\n",
4354 RExC_emit - RExC_emit_start > RExC_offsets[0] ?
4355 "Overwriting end of array!\n" : "OK",
4356 RExC_emit - RExC_emit_start,
4357 RExC_parse - RExC_start,
4359 Set_Cur_Node_Offset;
4368 - reguni - emit (if appropriate) a Unicode character
4371 S_reguni(pTHX_ RExC_state_t *pRExC_state, UV uv, char* s, STRLEN* lenp)
4373 *lenp = SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
4377 - reginsert - insert an operator in front of already-emitted operand
4379 * Means relocating the operand.
4382 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd)
4384 register regnode *src;
4385 register regnode *dst;
4386 register regnode *place;
4387 register int offset = regarglen[(U8)op];
4389 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
4392 RExC_size += NODE_STEP_REGNODE + offset;
4397 RExC_emit += NODE_STEP_REGNODE + offset;
4399 while (src > opnd) {
4400 StructCopy(--src, --dst, regnode);
4401 if (RExC_offsets) { /* MJD 20010112 */
4402 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %u -> %u (max %u).\n",
4406 dst - RExC_emit_start > RExC_offsets[0]
4407 ? "Overwriting end of array!\n" : "OK",
4408 src - RExC_emit_start,
4409 dst - RExC_emit_start,
4411 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
4412 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
4417 place = opnd; /* Op node, where operand used to be. */
4418 if (RExC_offsets) { /* MJD */
4419 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %u <- %u (max %u).\n",
4423 place - RExC_emit_start > RExC_offsets[0]
4424 ? "Overwriting end of array!\n" : "OK",
4425 place - RExC_emit_start,
4426 RExC_parse - RExC_start,
4428 Set_Node_Offset(place, RExC_parse);
4429 Set_Node_Length(place, 1);
4431 src = NEXTOPER(place);
4432 FILL_ADVANCE_NODE(place, op);
4433 Zero(src, offset, regnode);
4437 - regtail - set the next-pointer at the end of a node chain of p to val.
4440 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4442 register regnode *scan;
4443 register regnode *temp;
4448 /* Find last node. */
4451 temp = regnext(scan);
4457 if (reg_off_by_arg[OP(scan)]) {
4458 ARG_SET(scan, val - scan);
4461 NEXT_OFF(scan) = val - scan;
4466 - regoptail - regtail on operand of first argument; nop if operandless
4469 S_regoptail(pTHX_ RExC_state_t *pRExC_state, regnode *p, regnode *val)
4471 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
4472 if (p == NULL || SIZE_ONLY)
4474 if (PL_regkind[(U8)OP(p)] == BRANCH) {
4475 regtail(pRExC_state, NEXTOPER(p), val);
4477 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
4478 regtail(pRExC_state, NEXTOPER(NEXTOPER(p)), val);
4485 - regcurly - a little FSA that accepts {\d+,?\d*}
4488 S_regcurly(pTHX_ register char *s)
4509 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
4511 register U8 op = EXACT; /* Arbitrary non-END op. */
4512 register regnode *next;
4514 while (op != END && (!last || node < last)) {
4515 /* While that wasn't END last time... */
4521 next = regnext(node);
4523 if (OP(node) == OPTIMIZED)
4526 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
4527 (int)(2*l + 1), "", SvPVX(sv));
4528 if (next == NULL) /* Next ptr. */
4529 PerlIO_printf(Perl_debug_log, "(0)");
4531 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
4532 (void)PerlIO_putc(Perl_debug_log, '\n');
4534 if (PL_regkind[(U8)op] == BRANCHJ) {
4535 register regnode *nnode = (OP(next) == LONGJMP
4538 if (last && nnode > last)
4540 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
4542 else if (PL_regkind[(U8)op] == BRANCH) {
4543 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
4545 else if ( op == CURLY) { /* `next' might be very big: optimizer */
4546 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4547 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
4549 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
4550 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
4553 else if ( op == PLUS || op == STAR) {
4554 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
4556 else if (op == ANYOF) {
4557 /* arglen 1 + class block */
4558 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
4559 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
4560 node = NEXTOPER(node);
4562 else if (PL_regkind[(U8)op] == EXACT) {
4563 /* Literal string, where present. */
4564 node += NODE_SZ_STR(node) - 1;
4565 node = NEXTOPER(node);
4568 node = NEXTOPER(node);
4569 node += regarglen[(U8)op];
4571 if (op == CURLYX || op == OPEN)
4573 else if (op == WHILEM)
4579 #endif /* DEBUGGING */
4582 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
4585 Perl_regdump(pTHX_ regexp *r)
4588 SV *sv = sv_newmortal();
4590 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
4592 /* Header fields of interest. */
4593 if (r->anchored_substr)
4594 PerlIO_printf(Perl_debug_log,
4595 "anchored `%s%.*s%s'%s at %"IVdf" ",
4597 (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)),
4598 SvPVX(r->anchored_substr),
4600 SvTAIL(r->anchored_substr) ? "$" : "",
4601 (IV)r->anchored_offset);
4602 else if (r->anchored_utf8)
4603 PerlIO_printf(Perl_debug_log,
4604 "anchored utf8 `%s%.*s%s'%s at %"IVdf" ",
4606 (int)(SvCUR(r->anchored_utf8) - (SvTAIL(r->anchored_utf8)!=0)),
4607 SvPVX(r->anchored_utf8),
4609 SvTAIL(r->anchored_utf8) ? "$" : "",
4610 (IV)r->anchored_offset);
4611 if (r->float_substr)
4612 PerlIO_printf(Perl_debug_log,
4613 "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4615 (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)),
4616 SvPVX(r->float_substr),
4618 SvTAIL(r->float_substr) ? "$" : "",
4619 (IV)r->float_min_offset, (UV)r->float_max_offset);
4620 else if (r->float_utf8)
4621 PerlIO_printf(Perl_debug_log,
4622 "floating utf8 `%s%.*s%s'%s at %"IVdf"..%"UVuf" ",
4624 (int)(SvCUR(r->float_utf8) - (SvTAIL(r->float_utf8)!=0)),
4625 SvPVX(r->float_utf8),
4627 SvTAIL(r->float_utf8) ? "$" : "",
4628 (IV)r->float_min_offset, (UV)r->float_max_offset);
4629 if (r->check_substr || r->check_utf8)
4630 PerlIO_printf(Perl_debug_log,
4631 r->check_substr == r->float_substr
4632 && r->check_utf8 == r->float_utf8
4633 ? "(checking floating" : "(checking anchored");
4634 if (r->reganch & ROPT_NOSCAN)
4635 PerlIO_printf(Perl_debug_log, " noscan");
4636 if (r->reganch & ROPT_CHECK_ALL)
4637 PerlIO_printf(Perl_debug_log, " isall");
4638 if (r->check_substr || r->check_utf8)
4639 PerlIO_printf(Perl_debug_log, ") ");
4641 if (r->regstclass) {
4642 regprop(sv, r->regstclass);
4643 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
4645 if (r->reganch & ROPT_ANCH) {
4646 PerlIO_printf(Perl_debug_log, "anchored");
4647 if (r->reganch & ROPT_ANCH_BOL)
4648 PerlIO_printf(Perl_debug_log, "(BOL)");
4649 if (r->reganch & ROPT_ANCH_MBOL)
4650 PerlIO_printf(Perl_debug_log, "(MBOL)");
4651 if (r->reganch & ROPT_ANCH_SBOL)
4652 PerlIO_printf(Perl_debug_log, "(SBOL)");
4653 if (r->reganch & ROPT_ANCH_GPOS)
4654 PerlIO_printf(Perl_debug_log, "(GPOS)");
4655 PerlIO_putc(Perl_debug_log, ' ');
4657 if (r->reganch & ROPT_GPOS_SEEN)
4658 PerlIO_printf(Perl_debug_log, "GPOS ");
4659 if (r->reganch & ROPT_SKIP)
4660 PerlIO_printf(Perl_debug_log, "plus ");
4661 if (r->reganch & ROPT_IMPLICIT)
4662 PerlIO_printf(Perl_debug_log, "implicit ");
4663 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
4664 if (r->reganch & ROPT_EVAL_SEEN)
4665 PerlIO_printf(Perl_debug_log, "with eval ");
4666 PerlIO_printf(Perl_debug_log, "\n");
4669 U32 len = r->offsets[0];
4670 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4671 for (i = 1; i <= len; i++)
4672 PerlIO_printf(Perl_debug_log, "%"UVuf"[%"UVuf"] ",
4673 (UV)r->offsets[i*2-1],
4674 (UV)r->offsets[i*2]);
4675 PerlIO_printf(Perl_debug_log, "\n");
4677 #endif /* DEBUGGING */
4683 S_put_byte(pTHX_ SV *sv, int c)
4685 if (isCNTRL(c) || c == 255 || !isPRINT(c))
4686 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
4687 else if (c == '-' || c == ']' || c == '\\' || c == '^')
4688 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
4690 Perl_sv_catpvf(aTHX_ sv, "%c", c);
4693 #endif /* DEBUGGING */
4696 - regprop - printable representation of opcode
4699 Perl_regprop(pTHX_ SV *sv, regnode *o)
4704 sv_setpvn(sv, "", 0);
4705 if (OP(o) >= reg_num) /* regnode.type is unsigned */
4706 /* It would be nice to FAIL() here, but this may be called from
4707 regexec.c, and it would be hard to supply pRExC_state. */
4708 Perl_croak(aTHX_ "Corrupted regexp opcode");
4709 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
4711 k = PL_regkind[(U8)OP(o)];
4714 SV *dsv = sv_2mortal(newSVpvn("", 0));
4715 /* Using is_utf8_string() is a crude hack but it may
4716 * be the best for now since we have no flag "this EXACTish
4717 * node was UTF-8" --jhi */
4718 bool do_utf8 = is_utf8_string((U8*)STRING(o), STR_LEN(o));
4720 pv_uni_display(dsv, (U8*)STRING(o), STR_LEN(o), 60,
4721 UNI_DISPLAY_REGEX) :
4726 Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>",
4731 else if (k == CURLY) {
4732 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
4733 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
4734 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
4736 else if (k == WHILEM && o->flags) /* Ordinal/of */
4737 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
4738 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
4739 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
4740 else if (k == LOGICAL)
4741 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
4742 else if (k == ANYOF) {
4743 int i, rangestart = -1;
4744 U8 flags = ANYOF_FLAGS(o);
4745 const char * const anyofs[] = { /* Should be synchronized with
4746 * ANYOF_ #xdefines in regcomp.h */
4779 if (flags & ANYOF_LOCALE)
4780 sv_catpv(sv, "{loc}");
4781 if (flags & ANYOF_FOLD)
4782 sv_catpv(sv, "{i}");
4783 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
4784 if (flags & ANYOF_INVERT)
4786 for (i = 0; i <= 256; i++) {
4787 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
4788 if (rangestart == -1)
4790 } else if (rangestart != -1) {
4791 if (i <= rangestart + 3)
4792 for (; rangestart < i; rangestart++)
4793 put_byte(sv, rangestart);
4795 put_byte(sv, rangestart);
4797 put_byte(sv, i - 1);
4803 if (o->flags & ANYOF_CLASS)
4804 for (i = 0; i < sizeof(anyofs)/sizeof(char*); i++)
4805 if (ANYOF_CLASS_TEST(o,i))
4806 sv_catpv(sv, anyofs[i]);
4808 if (flags & ANYOF_UNICODE)
4809 sv_catpv(sv, "{unicode}");
4810 else if (flags & ANYOF_UNICODE_ALL)
4811 sv_catpv(sv, "{unicode_all}");
4815 SV *sw = regclass_swash(o, FALSE, &lv, 0);
4819 U8 s[UTF8_MAXLEN+1];
4821 for (i = 0; i <= 256; i++) { /* just the first 256 */
4822 U8 *e = uvchr_to_utf8(s, i);
4824 if (i < 256 && swash_fetch(sw, s, TRUE)) {
4825 if (rangestart == -1)
4827 } else if (rangestart != -1) {
4830 if (i <= rangestart + 3)
4831 for (; rangestart < i; rangestart++) {
4832 for(e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4836 for (e = uvchr_to_utf8(s, rangestart), p = s; p < e; p++)
4839 for (e = uvchr_to_utf8(s, i - 1), p = s; p < e; p++)
4846 sv_catpv(sv, "..."); /* et cetera */
4850 char *s = savepv(SvPVX(lv));
4853 while(*s && *s != '\n') s++;
4874 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
4876 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
4877 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
4878 #endif /* DEBUGGING */
4882 Perl_re_intuit_string(pTHX_ regexp *prog)
4883 { /* Assume that RE_INTUIT is set */
4886 char *s = SvPV(prog->check_substr
4887 ? prog->check_substr : prog->check_utf8, n_a);
4889 if (!PL_colorset) reginitcolors();
4890 PerlIO_printf(Perl_debug_log,
4891 "%sUsing REx %ssubstr:%s `%s%.60s%s%s'\n",
4893 prog->check_substr ? "" : "utf8 ",
4894 PL_colors[5],PL_colors[0],
4897 (strlen(s) > 60 ? "..." : ""));
4900 return prog->check_substr ? prog->check_substr : prog->check_utf8;
4904 Perl_pregfree(pTHX_ struct regexp *r)
4907 SV *dsv = PERL_DEBUG_PAD_ZERO(0);
4910 if (!r || (--r->refcnt > 0))
4916 s = (r->reganch & ROPT_UTF8) ? pv_uni_display(dsv, (U8*)r->precomp,
4917 r->prelen, 60, UNI_DISPLAY_REGEX)
4918 : pv_display(dsv, r->precomp, r->prelen, 0, 60);
4922 PerlIO_printf(Perl_debug_log,
4923 "%sFreeing REx:%s `%s%*.*s%s%s'\n",
4924 PL_colors[4],PL_colors[5],PL_colors[0],
4927 len > 60 ? "..." : "");
4931 Safefree(r->precomp);
4932 if (r->offsets) /* 20010421 MJD */
4933 Safefree(r->offsets);
4934 RX_MATCH_COPY_FREE(r);
4935 #ifdef PERL_COPY_ON_WRITE
4937 SvREFCNT_dec(r->saved_copy);
4940 if (r->anchored_substr)
4941 SvREFCNT_dec(r->anchored_substr);
4942 if (r->anchored_utf8)
4943 SvREFCNT_dec(r->anchored_utf8);
4944 if (r->float_substr)
4945 SvREFCNT_dec(r->float_substr);
4947 SvREFCNT_dec(r->float_utf8);
4948 Safefree(r->substrs);
4951 int n = r->data->count;
4952 PAD* new_comppad = NULL;
4956 /* If you add a ->what type here, update the comment in regcomp.h */
4957 switch (r->data->what[n]) {
4959 SvREFCNT_dec((SV*)r->data->data[n]);
4962 Safefree(r->data->data[n]);
4965 new_comppad = (AV*)r->data->data[n];
4968 if (new_comppad == NULL)
4969 Perl_croak(aTHX_ "panic: pregfree comppad");
4970 PAD_SAVE_LOCAL(old_comppad,
4971 /* Watch out for global destruction's random ordering. */
4972 (SvTYPE(new_comppad) == SVt_PVAV) ?
4973 new_comppad : Null(PAD *)
4975 if (!OpREFCNT_dec((OP_4tree*)r->data->data[n])) {
4976 op_free((OP_4tree*)r->data->data[n]);
4979 PAD_RESTORE_LOCAL(old_comppad);
4980 SvREFCNT_dec((SV*)new_comppad);
4986 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
4989 Safefree(r->data->what);
4992 Safefree(r->startp);
4998 - regnext - dig the "next" pointer out of a node
5000 * [Note, when REGALIGN is defined there are two places in regmatch()
5001 * that bypass this code for speed.]
5004 Perl_regnext(pTHX_ register regnode *p)
5006 register I32 offset;
5008 if (p == &PL_regdummy)
5011 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
5019 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
5022 STRLEN l1 = strlen(pat1);
5023 STRLEN l2 = strlen(pat2);
5032 Copy(pat1, buf, l1 , char);
5033 Copy(pat2, buf + l1, l2 , char);
5034 buf[l1 + l2] = '\n';
5035 buf[l1 + l2 + 1] = '\0';
5037 /* ANSI variant takes additional second argument */
5038 va_start(args, pat2);
5042 msv = vmess(buf, &args);
5044 message = SvPV(msv,l1);
5047 Copy(message, buf, l1 , char);
5048 buf[l1-1] = '\0'; /* Overwrite \n */
5049 Perl_croak(aTHX_ "%s", buf);
5052 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
5055 Perl_save_re_context(pTHX)
5057 SAVEI32(PL_reg_flags); /* from regexec.c */
5059 SAVEPPTR(PL_reginput); /* String-input pointer. */
5060 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
5061 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
5062 SAVEVPTR(PL_regstartp); /* Pointer to startp array. */
5063 SAVEVPTR(PL_regendp); /* Ditto for endp. */
5064 SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */
5065 SAVEVPTR(PL_reglastcloseparen); /* Similarly for lastcloseparen. */
5066 SAVEPPTR(PL_regtill); /* How far we are required to go. */
5067 SAVEGENERICPV(PL_reg_start_tmp); /* from regexec.c */
5068 PL_reg_start_tmp = 0;
5069 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
5070 PL_reg_start_tmpl = 0;
5071 SAVEVPTR(PL_regdata);
5072 SAVEI32(PL_reg_eval_set); /* from regexec.c */
5073 SAVEI32(PL_regnarrate); /* from regexec.c */
5074 SAVEVPTR(PL_regprogram); /* from regexec.c */
5075 SAVEINT(PL_regindent); /* from regexec.c */
5076 SAVEVPTR(PL_regcc); /* from regexec.c */
5077 SAVEVPTR(PL_curcop);
5078 SAVEVPTR(PL_reg_call_cc); /* from regexec.c */
5079 SAVEVPTR(PL_reg_re); /* from regexec.c */
5080 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
5081 SAVESPTR(PL_reg_sv); /* from regexec.c */
5082 SAVEBOOL(PL_reg_match_utf8); /* from regexec.c */
5083 SAVEVPTR(PL_reg_magic); /* from regexec.c */
5084 SAVEI32(PL_reg_oldpos); /* from regexec.c */
5085 SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */
5086 SAVEVPTR(PL_reg_curpm); /* from regexec.c */
5087 SAVEPPTR(PL_reg_oldsaved); /* old saved substr during match */
5088 PL_reg_oldsaved = Nullch;
5089 SAVEI32(PL_reg_oldsavedlen); /* old length of saved substr during match */
5090 PL_reg_oldsavedlen = 0;
5091 #ifdef PERL_COPY_ON_WRITE
5095 SAVEI32(PL_reg_maxiter); /* max wait until caching pos */
5097 SAVEI32(PL_reg_leftiter); /* wait until caching pos */
5098 PL_reg_leftiter = 0;
5099 SAVEGENERICPV(PL_reg_poscache); /* cache of pos of WHILEM */
5100 PL_reg_poscache = Nullch;
5101 SAVEI32(PL_reg_poscache_size); /* size of pos cache of WHILEM */
5102 PL_reg_poscache_size = 0;
5103 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
5104 SAVEI32(PL_regnpar); /* () count. */
5105 SAVEI32(PL_regsize); /* from regexec.c */
5108 /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */
5114 if (PL_curpm && (rx = PM_GETRE(PL_curpm))) {
5115 for (i = 1; i <= rx->nparens; i++) {
5116 sprintf(digits, "%lu", (long)i);
5117 if ((mgv = gv_fetchpv(digits, FALSE, SVt_PV)))
5124 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
5129 clear_re(pTHX_ void *r)
5131 ReREFCNT_dec((regexp *)r);