5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
8 /* This file contains functions for compiling a regular expression. See
9 * also regexec.c which funnily enough, contains functions for executing
10 * a regular expression.
12 * This file is also copied at build time to ext/re/re_comp.c, where
13 * it's built with -DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT.
14 * This causes the main functions to be compiled under new names and with
15 * debugging support added, which makes "use re 'debug'" work.
18 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
19 * confused with the original package (see point 3 below). Thanks, Henry!
22 /* Additional note: this code is very heavily munged from Henry's version
23 * in places. In some spots I've traded clarity for efficiency, so don't
24 * blame Henry for some of the lack of readability.
27 /* The names of the functions have been changed from regcomp and
28 * regexec to pregcomp and pregexec in order to avoid conflicts
29 * with the POSIX routines of the same names.
32 #ifdef PERL_EXT_RE_BUILD
37 * pregcomp and pregexec -- regsub and regerror are not used in perl
39 * Copyright (c) 1986 by University of Toronto.
40 * Written by Henry Spencer. Not derived from licensed software.
42 * Permission is granted to anyone to use this software for any
43 * purpose on any computer system, and to redistribute it freely,
44 * subject to the following restrictions:
46 * 1. The author is not responsible for the consequences of use of
47 * this software, no matter how awful, even if they arise
50 * 2. The origin of this software must not be misrepresented, either
51 * by explicit claim or by omission.
53 * 3. Altered versions must be plainly marked as such, and must not
54 * be misrepresented as being the original software.
57 **** Alterations to Henry's code are...
59 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
60 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
62 **** You may distribute under the terms of either the GNU General Public
63 **** License or the Artistic License, as specified in the README file.
66 * Beware that some of this code is subtly aware of the way operator
67 * precedence is structured in regular expressions. Serious changes in
68 * regular-expression syntax might require a total rethink.
71 #define PERL_IN_REGCOMP_C
74 #ifndef PERL_IN_XSUB_RE
79 #ifdef PERL_IN_XSUB_RE
90 # if defined(BUGGY_MSC6)
91 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
92 # pragma optimize("a",off)
93 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
94 # pragma optimize("w",on )
95 # endif /* BUGGY_MSC6 */
102 typedef struct RExC_state_t {
103 U32 flags; /* are we folding, multilining? */
104 char *precomp; /* uncompiled string. */
106 char *start; /* Start of input for compile */
107 char *end; /* End of input for compile */
108 char *parse; /* Input-scan pointer. */
109 I32 whilem_seen; /* number of WHILEM in this expr */
110 regnode *emit_start; /* Start of emitted-code area */
111 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
112 I32 naughty; /* How bad is this pattern? */
113 I32 sawback; /* Did we see \1, ...? */
115 I32 size; /* Code size. */
116 I32 npar; /* () count. */
120 regnode **parens; /* offsets of each paren */
122 HV *charnames; /* cache of named sequences */
123 HV *paren_names; /* Paren names */
125 char *starttry; /* -Dr: where regtry was called. */
126 #define RExC_starttry (pRExC_state->starttry)
129 const char *lastparse;
131 #define RExC_lastparse (pRExC_state->lastparse)
132 #define RExC_lastnum (pRExC_state->lastnum)
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)
155 #define RExC_charnames (pRExC_state->charnames)
156 #define RExC_parens (pRExC_state->parens)
157 #define RExC_paren_names (pRExC_state->paren_names)
159 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
160 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
161 ((*s) == '{' && regcurly(s)))
164 #undef SPSTART /* dratted cpp namespace... */
167 * Flags to be passed up and down.
169 #define WORST 0 /* Worst case. */
170 #define HASWIDTH 0x1 /* Known to match non-null strings. */
171 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
172 #define SPSTART 0x4 /* Starts with * or +. */
173 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
175 #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
177 /* whether trie related optimizations are enabled */
178 #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
179 #define TRIE_STUDY_OPT
180 #define FULL_TRIE_STUDY
185 /* About scan_data_t.
187 During optimisation we recurse through the regexp program performing
188 various inplace (keyhole style) optimisations. In addition study_chunk
189 and scan_commit populate this data structure with information about
190 what strings MUST appear in the pattern. We look for the longest
191 string that must appear for at a fixed location, and we look for the
192 longest string that may appear at a floating location. So for instance
197 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
198 strings (because they follow a .* construct). study_chunk will identify
199 both FOO and BAR as being the longest fixed and floating strings respectively.
201 The strings can be composites, for instance
205 will result in a composite fixed substring 'foo'.
207 For each string some basic information is maintained:
209 - offset or min_offset
210 This is the position the string must appear at, or not before.
211 It also implicitly (when combined with minlenp) tells us how many
212 character must match before the string we are searching.
213 Likewise when combined with minlenp and the length of the string
214 tells us how many characters must appear after the string we have
218 Only used for floating strings. This is the rightmost point that
219 the string can appear at. Ifset to I32 max it indicates that the
220 string can occur infinitely far to the right.
223 A pointer to the minimum length of the pattern that the string
224 was found inside. This is important as in the case of positive
225 lookahead or positive lookbehind we can have multiple patterns
230 The minimum length of the pattern overall is 3, the minimum length
231 of the lookahead part is 3, but the minimum length of the part that
232 will actually match is 1. So 'FOO's minimum length is 3, but the
233 minimum length for the F is 1. This is important as the minimum length
234 is used to determine offsets in front of and behind the string being
235 looked for. Since strings can be composites this is the length of the
236 pattern at the time it was commited with a scan_commit. Note that
237 the length is calculated by study_chunk, so that the minimum lengths
238 are not known until the full pattern has been compiled, thus the
239 pointer to the value.
243 In the case of lookbehind the string being searched for can be
244 offset past the start point of the final matching string.
245 If this value was just blithely removed from the min_offset it would
246 invalidate some of the calculations for how many chars must match
247 before or after (as they are derived from min_offset and minlen and
248 the length of the string being searched for).
249 When the final pattern is compiled and the data is moved from the
250 scan_data_t structure into the regexp structure the information
251 about lookbehind is factored in, with the information that would
252 have been lost precalculated in the end_shift field for the
255 The fields pos_min and pos_delta are used to store the minimum offset
256 and the delta to the maximum offset at the current point in the pattern.
260 typedef struct scan_data_t {
261 /*I32 len_min; unused */
262 /*I32 len_delta; unused */
266 I32 last_end; /* min value, <0 unless valid. */
269 SV **longest; /* Either &l_fixed, or &l_float. */
270 SV *longest_fixed; /* longest fixed string found in pattern */
271 I32 offset_fixed; /* offset where it starts */
272 I32 *minlen_fixed; /* pointer to the minlen relevent to the string */
273 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
274 SV *longest_float; /* longest floating string found in pattern */
275 I32 offset_float_min; /* earliest point in string it can appear */
276 I32 offset_float_max; /* latest point in string it can appear */
277 I32 *minlen_float; /* pointer to the minlen relevent to the string */
278 I32 lookbehind_float; /* is the position of the string modified by LB */
282 struct regnode_charclass_class *start_class;
286 * Forward declarations for pregcomp()'s friends.
289 static const scan_data_t zero_scan_data =
290 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
292 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
293 #define SF_BEFORE_SEOL 0x0001
294 #define SF_BEFORE_MEOL 0x0002
295 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
296 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
299 # define SF_FIX_SHIFT_EOL (0+2)
300 # define SF_FL_SHIFT_EOL (0+4)
302 # define SF_FIX_SHIFT_EOL (+2)
303 # define SF_FL_SHIFT_EOL (+4)
306 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
307 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
309 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
310 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
311 #define SF_IS_INF 0x0040
312 #define SF_HAS_PAR 0x0080
313 #define SF_IN_PAR 0x0100
314 #define SF_HAS_EVAL 0x0200
315 #define SCF_DO_SUBSTR 0x0400
316 #define SCF_DO_STCLASS_AND 0x0800
317 #define SCF_DO_STCLASS_OR 0x1000
318 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
319 #define SCF_WHILEM_VISITED_POS 0x2000
321 #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
324 #define UTF (RExC_utf8 != 0)
325 #define LOC ((RExC_flags & PMf_LOCALE) != 0)
326 #define FOLD ((RExC_flags & PMf_FOLD) != 0)
328 #define OOB_UNICODE 12345678
329 #define OOB_NAMEDCLASS -1
331 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
332 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
335 /* length of regex to show in messages that don't mark a position within */
336 #define RegexLengthToShowInErrorMessages 127
339 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
340 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
341 * op/pragma/warn/regcomp.
343 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
344 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
346 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
349 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
350 * arg. Show regex, up to a maximum length. If it's too long, chop and add
353 #define FAIL(msg) STMT_START { \
354 const char *ellipses = ""; \
355 IV len = RExC_end - RExC_precomp; \
358 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
359 if (len > RegexLengthToShowInErrorMessages) { \
360 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
361 len = RegexLengthToShowInErrorMessages - 10; \
364 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
365 msg, (int)len, RExC_precomp, ellipses); \
369 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
371 #define Simple_vFAIL(m) STMT_START { \
372 const IV offset = RExC_parse - RExC_precomp; \
373 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
374 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
378 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
380 #define vFAIL(m) STMT_START { \
382 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
387 * Like Simple_vFAIL(), but accepts two arguments.
389 #define Simple_vFAIL2(m,a1) STMT_START { \
390 const IV offset = RExC_parse - RExC_precomp; \
391 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
392 (int)offset, RExC_precomp, RExC_precomp + offset); \
396 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
398 #define vFAIL2(m,a1) STMT_START { \
400 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
401 Simple_vFAIL2(m, a1); \
406 * Like Simple_vFAIL(), but accepts three arguments.
408 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
409 const IV offset = RExC_parse - RExC_precomp; \
410 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
411 (int)offset, RExC_precomp, RExC_precomp + offset); \
415 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
417 #define vFAIL3(m,a1,a2) STMT_START { \
419 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
420 Simple_vFAIL3(m, a1, a2); \
424 * Like Simple_vFAIL(), but accepts four arguments.
426 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
427 const IV offset = RExC_parse - RExC_precomp; \
428 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
429 (int)offset, RExC_precomp, RExC_precomp + offset); \
432 #define vWARN(loc,m) STMT_START { \
433 const IV offset = loc - RExC_precomp; \
434 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
435 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
438 #define vWARNdep(loc,m) STMT_START { \
439 const IV offset = loc - RExC_precomp; \
440 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
441 "%s" REPORT_LOCATION, \
442 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
446 #define vWARN2(loc, m, a1) STMT_START { \
447 const IV offset = loc - RExC_precomp; \
448 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
449 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
452 #define vWARN3(loc, m, a1, a2) STMT_START { \
453 const IV offset = loc - RExC_precomp; \
454 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
455 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
458 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
459 const IV offset = loc - RExC_precomp; \
460 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
461 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
464 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
465 const IV offset = loc - RExC_precomp; \
466 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
467 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
471 /* Allow for side effects in s */
472 #define REGC(c,s) STMT_START { \
473 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
476 /* Macros for recording node offsets. 20001227 mjd@plover.com
477 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
478 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
479 * Element 0 holds the number n.
480 * Position is 1 indexed.
483 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
485 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
486 __LINE__, (node), (int)(byte))); \
488 Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \
490 RExC_offsets[2*(node)-1] = (byte); \
495 #define Set_Node_Offset(node,byte) \
496 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
497 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
499 #define Set_Node_Length_To_R(node,len) STMT_START { \
501 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
502 __LINE__, (int)(node), (int)(len))); \
504 Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \
506 RExC_offsets[2*(node)] = (len); \
511 #define Set_Node_Length(node,len) \
512 Set_Node_Length_To_R((node)-RExC_emit_start, len)
513 #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
514 #define Set_Node_Cur_Length(node) \
515 Set_Node_Length(node, RExC_parse - parse_start)
517 /* Get offsets and lengths */
518 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
519 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
521 #define Set_Node_Offset_Length(node,offset,len) STMT_START { \
522 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
523 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
527 #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
528 #define EXPERIMENTAL_INPLACESCAN
531 #define DEBUG_STUDYDATA(data,depth) \
532 DEBUG_OPTIMISE_MORE_r(if(data){ \
533 PerlIO_printf(Perl_debug_log, \
534 "%*s"/* Len:%"IVdf"/%"IVdf" */" Pos:%"IVdf"/%"IVdf \
535 " Flags: %"IVdf" Whilem_c: %"IVdf" Lcp: %"IVdf" ", \
536 (int)(depth)*2, "", \
537 (IV)((data)->pos_min), \
538 (IV)((data)->pos_delta), \
539 (IV)((data)->flags), \
540 (IV)((data)->whilem_c), \
541 (IV)((data)->last_closep ? *((data)->last_closep) : -1) \
543 if ((data)->last_found) \
544 PerlIO_printf(Perl_debug_log, \
545 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
546 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
547 SvPVX_const((data)->last_found), \
548 (IV)((data)->last_end), \
549 (IV)((data)->last_start_min), \
550 (IV)((data)->last_start_max), \
551 ((data)->longest && \
552 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
553 SvPVX_const((data)->longest_fixed), \
554 (IV)((data)->offset_fixed), \
555 ((data)->longest && \
556 (data)->longest==&((data)->longest_float)) ? "*" : "", \
557 SvPVX_const((data)->longest_float), \
558 (IV)((data)->offset_float_min), \
559 (IV)((data)->offset_float_max) \
561 PerlIO_printf(Perl_debug_log,"\n"); \
564 static void clear_re(pTHX_ void *r);
566 /* Mark that we cannot extend a found fixed substring at this point.
567 Update the longest found anchored substring and the longest found
568 floating substrings if needed. */
571 S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp)
573 const STRLEN l = CHR_SVLEN(data->last_found);
574 const STRLEN old_l = CHR_SVLEN(*data->longest);
575 GET_RE_DEBUG_FLAGS_DECL;
577 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
578 SvSetMagicSV(*data->longest, data->last_found);
579 if (*data->longest == data->longest_fixed) {
580 data->offset_fixed = l ? data->last_start_min : data->pos_min;
581 if (data->flags & SF_BEFORE_EOL)
583 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
585 data->flags &= ~SF_FIX_BEFORE_EOL;
586 data->minlen_fixed=minlenp;
587 data->lookbehind_fixed=0;
590 data->offset_float_min = l ? data->last_start_min : data->pos_min;
591 data->offset_float_max = (l
592 ? data->last_start_max
593 : data->pos_min + data->pos_delta);
594 if ((U32)data->offset_float_max > (U32)I32_MAX)
595 data->offset_float_max = I32_MAX;
596 if (data->flags & SF_BEFORE_EOL)
598 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
600 data->flags &= ~SF_FL_BEFORE_EOL;
601 data->minlen_float=minlenp;
602 data->lookbehind_float=0;
605 SvCUR_set(data->last_found, 0);
607 SV * const sv = data->last_found;
608 if (SvUTF8(sv) && SvMAGICAL(sv)) {
609 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
615 data->flags &= ~SF_BEFORE_EOL;
616 DEBUG_STUDYDATA(data,0);
619 /* Can match anything (initialization) */
621 S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
623 ANYOF_CLASS_ZERO(cl);
624 ANYOF_BITMAP_SETALL(cl);
625 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
627 cl->flags |= ANYOF_LOCALE;
630 /* Can match anything (initialization) */
632 S_cl_is_anything(const struct regnode_charclass_class *cl)
636 for (value = 0; value <= ANYOF_MAX; value += 2)
637 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
639 if (!(cl->flags & ANYOF_UNICODE_ALL))
641 if (!ANYOF_BITMAP_TESTALLSET((const void*)cl))
646 /* Can match anything (initialization) */
648 S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
650 Zero(cl, 1, struct regnode_charclass_class);
652 cl_anything(pRExC_state, cl);
656 S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
658 Zero(cl, 1, struct regnode_charclass_class);
660 cl_anything(pRExC_state, cl);
662 cl->flags |= ANYOF_LOCALE;
665 /* 'And' a given class with another one. Can create false positives */
666 /* We assume that cl is not inverted */
668 S_cl_and(struct regnode_charclass_class *cl,
669 const struct regnode_charclass_class *and_with)
671 if (!(and_with->flags & ANYOF_CLASS)
672 && !(cl->flags & ANYOF_CLASS)
673 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
674 && !(and_with->flags & ANYOF_FOLD)
675 && !(cl->flags & ANYOF_FOLD)) {
678 if (and_with->flags & ANYOF_INVERT)
679 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
680 cl->bitmap[i] &= ~and_with->bitmap[i];
682 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
683 cl->bitmap[i] &= and_with->bitmap[i];
684 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
685 if (!(and_with->flags & ANYOF_EOS))
686 cl->flags &= ~ANYOF_EOS;
688 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE &&
689 !(and_with->flags & ANYOF_INVERT)) {
690 cl->flags &= ~ANYOF_UNICODE_ALL;
691 cl->flags |= ANYOF_UNICODE;
692 ARG_SET(cl, ARG(and_with));
694 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
695 !(and_with->flags & ANYOF_INVERT))
696 cl->flags &= ~ANYOF_UNICODE_ALL;
697 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) &&
698 !(and_with->flags & ANYOF_INVERT))
699 cl->flags &= ~ANYOF_UNICODE;
702 /* 'OR' a given class with another one. Can create false positives */
703 /* We assume that cl is not inverted */
705 S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with)
707 if (or_with->flags & ANYOF_INVERT) {
709 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
710 * <= (B1 | !B2) | (CL1 | !CL2)
711 * which is wasteful if CL2 is small, but we ignore CL2:
712 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
713 * XXXX Can we handle case-fold? Unclear:
714 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
715 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
717 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
718 && !(or_with->flags & ANYOF_FOLD)
719 && !(cl->flags & ANYOF_FOLD) ) {
722 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
723 cl->bitmap[i] |= ~or_with->bitmap[i];
724 } /* XXXX: logic is complicated otherwise */
726 cl_anything(pRExC_state, cl);
729 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
730 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
731 && (!(or_with->flags & ANYOF_FOLD)
732 || (cl->flags & ANYOF_FOLD)) ) {
735 /* OR char bitmap and class bitmap separately */
736 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
737 cl->bitmap[i] |= or_with->bitmap[i];
738 if (or_with->flags & ANYOF_CLASS) {
739 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
740 cl->classflags[i] |= or_with->classflags[i];
741 cl->flags |= ANYOF_CLASS;
744 else { /* XXXX: logic is complicated, leave it along for a moment. */
745 cl_anything(pRExC_state, cl);
748 if (or_with->flags & ANYOF_EOS)
749 cl->flags |= ANYOF_EOS;
751 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
752 ARG(cl) != ARG(or_with)) {
753 cl->flags |= ANYOF_UNICODE_ALL;
754 cl->flags &= ~ANYOF_UNICODE;
756 if (or_with->flags & ANYOF_UNICODE_ALL) {
757 cl->flags |= ANYOF_UNICODE_ALL;
758 cl->flags &= ~ANYOF_UNICODE;
762 #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
763 #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
764 #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
765 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 )
771 dump_trie_interim_list(trie,next_alloc)
772 dump_trie_interim_table(trie,next_alloc)
774 These routines dump out a trie in a somewhat readable format.
775 The _interim_ variants are used for debugging the interim
776 tables that are used to generate the final compressed
777 representation which is what dump_trie expects.
779 Part of the reason for their existance is to provide a form
780 of documentation as to how the different representations function.
786 Dumps the final compressed table form of the trie to Perl_debug_log.
787 Used for debugging make_trie().
791 S_dump_trie(pTHX_ const struct _reg_trie_data *trie,U32 depth)
794 SV *sv=sv_newmortal();
795 int colwidth= trie->widecharmap ? 6 : 4;
796 GET_RE_DEBUG_FLAGS_DECL;
799 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
800 (int)depth * 2 + 2,"",
801 "Match","Base","Ofs" );
803 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
804 SV ** const tmp = av_fetch( trie->revcharmap, state, 0);
806 PerlIO_printf( Perl_debug_log, "%*s",
808 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
809 PL_colors[0], PL_colors[1],
810 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
811 PERL_PV_ESCAPE_FIRSTCHAR
816 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
817 (int)depth * 2 + 2,"");
819 for( state = 0 ; state < trie->uniquecharcount ; state++ )
820 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
821 PerlIO_printf( Perl_debug_log, "\n");
823 for( state = 1 ; state < trie->laststate ; state++ ) {
824 const U32 base = trie->states[ state ].trans.base;
826 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state);
828 if ( trie->states[ state ].wordnum ) {
829 PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum );
831 PerlIO_printf( Perl_debug_log, "%6s", "" );
834 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
839 while( ( base + ofs < trie->uniquecharcount ) ||
840 ( base + ofs - trie->uniquecharcount < trie->lasttrans
841 && trie->trans[ base + ofs - trie->uniquecharcount ].check != state))
844 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
846 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
847 if ( ( base + ofs >= trie->uniquecharcount ) &&
848 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
849 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
851 PerlIO_printf( Perl_debug_log, "%*"UVXf,
853 (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next );
855 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
859 PerlIO_printf( Perl_debug_log, "]");
862 PerlIO_printf( Perl_debug_log, "\n" );
866 dump_trie_interim_list(trie,next_alloc)
867 Dumps a fully constructed but uncompressed trie in list form.
868 List tries normally only are used for construction when the number of
869 possible chars (trie->uniquecharcount) is very high.
870 Used for debugging make_trie().
873 S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie, U32 next_alloc,U32 depth)
876 SV *sv=sv_newmortal();
877 int colwidth= trie->widecharmap ? 6 : 4;
878 GET_RE_DEBUG_FLAGS_DECL;
879 /* print out the table precompression. */
880 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
881 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
882 "------:-----+-----------------\n" );
884 for( state=1 ; state < next_alloc ; state ++ ) {
887 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
888 (int)depth * 2 + 2,"", (UV)state );
889 if ( ! trie->states[ state ].wordnum ) {
890 PerlIO_printf( Perl_debug_log, "%5s| ","");
892 PerlIO_printf( Perl_debug_log, "W%4x| ",
893 trie->states[ state ].wordnum
896 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
897 SV ** const tmp = av_fetch( trie->revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0);
899 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
901 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
902 PL_colors[0], PL_colors[1],
903 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
904 PERL_PV_ESCAPE_FIRSTCHAR
906 TRIE_LIST_ITEM(state,charid).forid,
907 (UV)TRIE_LIST_ITEM(state,charid).newstate
911 PerlIO_printf( Perl_debug_log, "\n");
916 dump_trie_interim_table(trie,next_alloc)
917 Dumps a fully constructed but uncompressed trie in table form.
918 This is the normal DFA style state transition table, with a few
919 twists to facilitate compression later.
920 Used for debugging make_trie().
923 S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie, U32 next_alloc, U32 depth)
927 SV *sv=sv_newmortal();
928 int colwidth= trie->widecharmap ? 6 : 4;
929 GET_RE_DEBUG_FLAGS_DECL;
932 print out the table precompression so that we can do a visual check
933 that they are identical.
936 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
938 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
939 SV ** const tmp = av_fetch( trie->revcharmap, charid, 0);
941 PerlIO_printf( Perl_debug_log, "%*s",
943 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
944 PL_colors[0], PL_colors[1],
945 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
946 PERL_PV_ESCAPE_FIRSTCHAR
952 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
954 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
955 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
958 PerlIO_printf( Perl_debug_log, "\n" );
960 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
962 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
963 (int)depth * 2 + 2,"",
964 (UV)TRIE_NODENUM( state ) );
966 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
967 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
969 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
971 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
973 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
974 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check );
976 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check,
977 trie->states[ TRIE_NODENUM( state ) ].wordnum );
984 /* make_trie(startbranch,first,last,tail,word_count,flags,depth)
985 startbranch: the first branch in the whole branch sequence
986 first : start branch of sequence of branch-exact nodes.
987 May be the same as startbranch
988 last : Thing following the last branch.
989 May be the same as tail.
990 tail : item following the branch sequence
991 count : words in the sequence
992 flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/
995 Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
997 A trie is an N'ary tree where the branches are determined by digital
998 decomposition of the key. IE, at the root node you look up the 1st character and
999 follow that branch repeat until you find the end of the branches. Nodes can be
1000 marked as "accepting" meaning they represent a complete word. Eg:
1004 would convert into the following structure. Numbers represent states, letters
1005 following numbers represent valid transitions on the letter from that state, if
1006 the number is in square brackets it represents an accepting state, otherwise it
1007 will be in parenthesis.
1009 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1013 (1) +-i->(6)-+-s->[7]
1015 +-s->(3)-+-h->(4)-+-e->[5]
1017 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1019 This shows that when matching against the string 'hers' we will begin at state 1
1020 read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1021 then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1022 is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1023 single traverse. We store a mapping from accepting to state to which word was
1024 matched, and then when we have multiple possibilities we try to complete the
1025 rest of the regex in the order in which they occured in the alternation.
1027 The only prior NFA like behaviour that would be changed by the TRIE support is
1028 the silent ignoring of duplicate alternations which are of the form:
1030 / (DUPE|DUPE) X? (?{ ... }) Y /x
1032 Thus EVAL blocks follwing a trie may be called a different number of times with
1033 and without the optimisation. With the optimisations dupes will be silently
1034 ignored. This inconsistant behaviour of EVAL type nodes is well established as
1035 the following demonstrates:
1037 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
1039 which prints out 'word' three times, but
1041 'words'=~/(word|word|word)(?{ print $1 })S/
1043 which doesnt print it out at all. This is due to other optimisations kicking in.
1045 Example of what happens on a structural level:
1047 The regexp /(ac|ad|ab)+/ will produce the folowing debug output:
1049 1: CURLYM[1] {1,32767}(18)
1060 This would be optimizable with startbranch=5, first=5, last=16, tail=16
1061 and should turn into:
1063 1: CURLYM[1] {1,32767}(18)
1065 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
1073 Cases where tail != last would be like /(?foo|bar)baz/:
1083 which would be optimizable with startbranch=1, first=1, last=7, tail=8
1084 and would end up looking like:
1087 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
1094 d = uvuni_to_utf8_flags(d, uv, 0);
1096 is the recommended Unicode-aware way of saying
1101 #define TRIE_STORE_REVCHAR \
1103 SV *tmp = Perl_newSVpvf_nocontext( "%c", (int)uvc ); \
1104 if (UTF) SvUTF8_on(tmp); \
1105 av_push( TRIE_REVCHARMAP(trie), tmp ); \
1108 #define TRIE_READ_CHAR STMT_START { \
1112 if ( foldlen > 0 ) { \
1113 uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \
1118 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1119 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1120 foldlen -= UNISKIP( uvc ); \
1121 scan = foldbuf + UNISKIP( uvc ); \
1124 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1134 #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
1135 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
1136 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
1137 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
1139 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
1140 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
1141 TRIE_LIST_CUR( state )++; \
1144 #define TRIE_LIST_NEW(state) STMT_START { \
1145 Newxz( trie->states[ state ].trans.list, \
1146 4, reg_trie_trans_le ); \
1147 TRIE_LIST_CUR( state ) = 1; \
1148 TRIE_LIST_LEN( state ) = 4; \
1151 #define TRIE_HANDLE_WORD(state) STMT_START { \
1152 U16 dupe= trie->states[ state ].wordnum; \
1153 regnode * const noper_next = regnext( noper ); \
1155 if (trie->wordlen) \
1156 trie->wordlen[ curword ] = wordlen; \
1158 /* store the word for dumping */ \
1160 if (OP(noper) != NOTHING) \
1161 tmp = newSVpvn(STRING(noper), STR_LEN(noper)); \
1163 tmp = newSVpvn( "", 0 ); \
1164 if ( UTF ) SvUTF8_on( tmp ); \
1165 av_push( trie->words, tmp ); \
1170 if ( noper_next < tail ) { \
1172 Newxz( trie->jump, word_count + 1, U16); \
1173 trie->jump[curword] = (U16)(tail - noper_next); \
1175 jumper = noper_next; \
1177 nextbranch= regnext(cur); \
1181 /* So it's a dupe. This means we need to maintain a */\
1182 /* linked-list from the first to the next. */\
1183 /* we only allocate the nextword buffer when there */\
1184 /* a dupe, so first time we have to do the allocation */\
1185 if (!trie->nextword) \
1186 Newxz( trie->nextword, word_count + 1, U16); \
1187 while ( trie->nextword[dupe] ) \
1188 dupe= trie->nextword[dupe]; \
1189 trie->nextword[dupe]= curword; \
1191 /* we haven't inserted this word yet. */ \
1192 trie->states[ state ].wordnum = curword; \
1197 #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
1198 ( ( base + charid >= ucharcount \
1199 && base + charid < ubound \
1200 && state == trie->trans[ base - ucharcount + charid ].check \
1201 && trie->trans[ base - ucharcount + charid ].next ) \
1202 ? trie->trans[ base - ucharcount + charid ].next \
1203 : ( state==1 ? special : 0 ) \
1207 #define MADE_JUMP_TRIE 2
1208 #define MADE_EXACT_TRIE 4
1211 S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth)
1214 /* first pass, loop through and scan words */
1215 reg_trie_data *trie;
1217 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1222 regnode *jumper = NULL;
1223 regnode *nextbranch = NULL;
1224 /* we just use folder as a flag in utf8 */
1225 const U8 * const folder = ( flags == EXACTF
1227 : ( flags == EXACTFL
1233 const U32 data_slot = add_data( pRExC_state, 1, "t" );
1234 SV *re_trie_maxbuff;
1236 /* these are only used during construction but are useful during
1237 * debugging so we store them in the struct when debugging.
1239 STRLEN trie_charcount=0;
1240 AV *trie_revcharmap;
1242 GET_RE_DEBUG_FLAGS_DECL;
1244 PERL_UNUSED_ARG(depth);
1247 Newxz( trie, 1, reg_trie_data );
1249 trie->startstate = 1;
1250 trie->wordcount = word_count;
1251 RExC_rx->data->data[ data_slot ] = (void*)trie;
1252 Newxz( trie->charmap, 256, U16 );
1253 if (!(UTF && folder))
1254 Newxz( trie->bitmap, ANYOF_BITMAP_SIZE, char );
1256 trie->words = newAV();
1258 TRIE_REVCHARMAP(trie) = newAV();
1260 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
1261 if (!SvIOK(re_trie_maxbuff)) {
1262 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
1265 PerlIO_printf( Perl_debug_log,
1266 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
1267 (int)depth * 2 + 2, "",
1268 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
1269 REG_NODE_NUM(last), REG_NODE_NUM(tail),
1272 /* -- First loop and Setup --
1274 We first traverse the branches and scan each word to determine if it
1275 contains widechars, and how many unique chars there are, this is
1276 important as we have to build a table with at least as many columns as we
1279 We use an array of integers to represent the character codes 0..255
1280 (trie->charmap) and we use a an HV* to store unicode characters. We use the
1281 native representation of the character value as the key and IV's for the
1284 *TODO* If we keep track of how many times each character is used we can
1285 remap the columns so that the table compression later on is more
1286 efficient in terms of memory by ensuring most common value is in the
1287 middle and the least common are on the outside. IMO this would be better
1288 than a most to least common mapping as theres a decent chance the most
1289 common letter will share a node with the least common, meaning the node
1290 will not be compressable. With a middle is most common approach the worst
1291 case is when we have the least common nodes twice.
1295 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1296 regnode * const noper = NEXTOPER( cur );
1297 const U8 *uc = (U8*)STRING( noper );
1298 const U8 * const e = uc + STR_LEN( noper );
1300 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1301 const U8 *scan = (U8*)NULL;
1302 U32 wordlen = 0; /* required init */
1305 if (OP(noper) == NOTHING) {
1310 TRIE_BITMAP_SET(trie,*uc);
1311 if ( folder ) TRIE_BITMAP_SET(trie,folder[ *uc ]);
1313 for ( ; uc < e ; uc += len ) {
1314 TRIE_CHARCOUNT(trie)++;
1318 if ( !trie->charmap[ uvc ] ) {
1319 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
1321 trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ];
1326 if ( !trie->widecharmap )
1327 trie->widecharmap = newHV();
1329 svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 1 );
1332 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
1334 if ( !SvTRUE( *svpp ) ) {
1335 sv_setiv( *svpp, ++trie->uniquecharcount );
1340 if( cur == first ) {
1343 } else if (chars < trie->minlen) {
1345 } else if (chars > trie->maxlen) {
1349 } /* end first pass */
1350 DEBUG_TRIE_COMPILE_r(
1351 PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
1352 (int)depth * 2 + 2,"",
1353 ( trie->widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
1354 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
1355 (int)trie->minlen, (int)trie->maxlen )
1357 Newxz( trie->wordlen, word_count, U32 );
1360 We now know what we are dealing with in terms of unique chars and
1361 string sizes so we can calculate how much memory a naive
1362 representation using a flat table will take. If it's over a reasonable
1363 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
1364 conservative but potentially much slower representation using an array
1367 At the end we convert both representations into the same compressed
1368 form that will be used in regexec.c for matching with. The latter
1369 is a form that cannot be used to construct with but has memory
1370 properties similar to the list form and access properties similar
1371 to the table form making it both suitable for fast searches and
1372 small enough that its feasable to store for the duration of a program.
1374 See the comment in the code where the compressed table is produced
1375 inplace from the flat tabe representation for an explanation of how
1376 the compression works.
1381 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) {
1383 Second Pass -- Array Of Lists Representation
1385 Each state will be represented by a list of charid:state records
1386 (reg_trie_trans_le) the first such element holds the CUR and LEN
1387 points of the allocated array. (See defines above).
1389 We build the initial structure using the lists, and then convert
1390 it into the compressed table form which allows faster lookups
1391 (but cant be modified once converted).
1394 STRLEN transcount = 1;
1396 Newxz( trie->states, TRIE_CHARCOUNT(trie) + 2, reg_trie_state );
1400 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1402 regnode * const noper = NEXTOPER( cur );
1403 U8 *uc = (U8*)STRING( noper );
1404 const U8 * const e = uc + STR_LEN( noper );
1405 U32 state = 1; /* required init */
1406 U16 charid = 0; /* sanity init */
1407 U8 *scan = (U8*)NULL; /* sanity init */
1408 STRLEN foldlen = 0; /* required init */
1409 U32 wordlen = 0; /* required init */
1410 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1412 if (OP(noper) != NOTHING) {
1413 for ( ; uc < e ; uc += len ) {
1418 charid = trie->charmap[ uvc ];
1420 SV** const svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 0);
1424 charid=(U16)SvIV( *svpp );
1427 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1434 if ( !trie->states[ state ].trans.list ) {
1435 TRIE_LIST_NEW( state );
1437 for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) {
1438 if ( TRIE_LIST_ITEM( state, check ).forid == charid ) {
1439 newstate = TRIE_LIST_ITEM( state, check ).newstate;
1444 newstate = next_alloc++;
1445 TRIE_LIST_PUSH( state, charid, newstate );
1450 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1454 TRIE_HANDLE_WORD(state);
1456 } /* end second pass */
1458 trie->laststate = next_alloc;
1459 Renew( trie->states, next_alloc, reg_trie_state );
1461 /* and now dump it out before we compress it */
1462 DEBUG_TRIE_COMPILE_MORE_r(
1463 dump_trie_interim_list(trie,next_alloc,depth+1)
1466 Newxz( trie->trans, transcount ,reg_trie_trans );
1473 for( state=1 ; state < next_alloc ; state ++ ) {
1477 DEBUG_TRIE_COMPILE_MORE_r(
1478 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
1482 if (trie->states[state].trans.list) {
1483 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
1487 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1488 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
1489 if ( forid < minid ) {
1491 } else if ( forid > maxid ) {
1495 if ( transcount < tp + maxid - minid + 1) {
1497 Renew( trie->trans, transcount, reg_trie_trans );
1498 Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans );
1500 base = trie->uniquecharcount + tp - minid;
1501 if ( maxid == minid ) {
1503 for ( ; zp < tp ; zp++ ) {
1504 if ( ! trie->trans[ zp ].next ) {
1505 base = trie->uniquecharcount + zp - minid;
1506 trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1507 trie->trans[ zp ].check = state;
1513 trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1514 trie->trans[ tp ].check = state;
1519 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1520 const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid;
1521 trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate;
1522 trie->trans[ tid ].check = state;
1524 tp += ( maxid - minid + 1 );
1526 Safefree(trie->states[ state ].trans.list);
1529 DEBUG_TRIE_COMPILE_MORE_r(
1530 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
1533 trie->states[ state ].trans.base=base;
1535 trie->lasttrans = tp + 1;
1539 Second Pass -- Flat Table Representation.
1541 we dont use the 0 slot of either trans[] or states[] so we add 1 to each.
1542 We know that we will need Charcount+1 trans at most to store the data
1543 (one row per char at worst case) So we preallocate both structures
1544 assuming worst case.
1546 We then construct the trie using only the .next slots of the entry
1549 We use the .check field of the first entry of the node temporarily to
1550 make compression both faster and easier by keeping track of how many non
1551 zero fields are in the node.
1553 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
1556 There are two terms at use here: state as a TRIE_NODEIDX() which is a
1557 number representing the first entry of the node, and state as a
1558 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and
1559 TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there
1560 are 2 entrys per node. eg:
1568 The table is internally in the right hand, idx form. However as we also
1569 have to deal with the states array which is indexed by nodenum we have to
1570 use TRIE_NODENUM() to convert.
1575 Newxz( trie->trans, ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1,
1577 Newxz( trie->states, TRIE_CHARCOUNT(trie) + 2, reg_trie_state );
1578 next_alloc = trie->uniquecharcount + 1;
1581 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1583 regnode * const noper = NEXTOPER( cur );
1584 const U8 *uc = (U8*)STRING( noper );
1585 const U8 * const e = uc + STR_LEN( noper );
1587 U32 state = 1; /* required init */
1589 U16 charid = 0; /* sanity init */
1590 U32 accept_state = 0; /* sanity init */
1591 U8 *scan = (U8*)NULL; /* sanity init */
1593 STRLEN foldlen = 0; /* required init */
1594 U32 wordlen = 0; /* required init */
1595 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1597 if ( OP(noper) != NOTHING ) {
1598 for ( ; uc < e ; uc += len ) {
1603 charid = trie->charmap[ uvc ];
1605 SV* const * const svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 0);
1606 charid = svpp ? (U16)SvIV(*svpp) : 0;
1610 if ( !trie->trans[ state + charid ].next ) {
1611 trie->trans[ state + charid ].next = next_alloc;
1612 trie->trans[ state ].check++;
1613 next_alloc += trie->uniquecharcount;
1615 state = trie->trans[ state + charid ].next;
1617 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1619 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1622 accept_state = TRIE_NODENUM( state );
1623 TRIE_HANDLE_WORD(accept_state);
1625 } /* end second pass */
1627 /* and now dump it out before we compress it */
1628 DEBUG_TRIE_COMPILE_MORE_r(
1629 dump_trie_interim_table(trie,next_alloc,depth+1)
1634 * Inplace compress the table.*
1636 For sparse data sets the table constructed by the trie algorithm will
1637 be mostly 0/FAIL transitions or to put it another way mostly empty.
1638 (Note that leaf nodes will not contain any transitions.)
1640 This algorithm compresses the tables by eliminating most such
1641 transitions, at the cost of a modest bit of extra work during lookup:
1643 - Each states[] entry contains a .base field which indicates the
1644 index in the state[] array wheres its transition data is stored.
1646 - If .base is 0 there are no valid transitions from that node.
1648 - If .base is nonzero then charid is added to it to find an entry in
1651 -If trans[states[state].base+charid].check!=state then the
1652 transition is taken to be a 0/Fail transition. Thus if there are fail
1653 transitions at the front of the node then the .base offset will point
1654 somewhere inside the previous nodes data (or maybe even into a node
1655 even earlier), but the .check field determines if the transition is
1659 The following process inplace converts the table to the compressed
1660 table: We first do not compress the root node 1,and mark its all its
1661 .check pointers as 1 and set its .base pointer as 1 as well. This
1662 allows to do a DFA construction from the compressed table later, and
1663 ensures that any .base pointers we calculate later are greater than
1666 - We set 'pos' to indicate the first entry of the second node.
1668 - We then iterate over the columns of the node, finding the first and
1669 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
1670 and set the .check pointers accordingly, and advance pos
1671 appropriately and repreat for the next node. Note that when we copy
1672 the next pointers we have to convert them from the original
1673 NODEIDX form to NODENUM form as the former is not valid post
1676 - If a node has no transitions used we mark its base as 0 and do not
1677 advance the pos pointer.
1679 - If a node only has one transition we use a second pointer into the
1680 structure to fill in allocated fail transitions from other states.
1681 This pointer is independent of the main pointer and scans forward
1682 looking for null transitions that are allocated to a state. When it
1683 finds one it writes the single transition into the "hole". If the
1684 pointer doesnt find one the single transition is appended as normal.
1686 - Once compressed we can Renew/realloc the structures to release the
1689 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
1690 specifically Fig 3.47 and the associated pseudocode.
1694 const U32 laststate = TRIE_NODENUM( next_alloc );
1697 trie->laststate = laststate;
1699 for ( state = 1 ; state < laststate ; state++ ) {
1701 const U32 stateidx = TRIE_NODEIDX( state );
1702 const U32 o_used = trie->trans[ stateidx ].check;
1703 U32 used = trie->trans[ stateidx ].check;
1704 trie->trans[ stateidx ].check = 0;
1706 for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) {
1707 if ( flag || trie->trans[ stateidx + charid ].next ) {
1708 if ( trie->trans[ stateidx + charid ].next ) {
1710 for ( ; zp < pos ; zp++ ) {
1711 if ( ! trie->trans[ zp ].next ) {
1715 trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ;
1716 trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1717 trie->trans[ zp ].check = state;
1718 if ( ++zp > pos ) pos = zp;
1725 trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ;
1727 trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1728 trie->trans[ pos ].check = state;
1733 trie->lasttrans = pos + 1;
1734 Renew( trie->states, laststate + 1, reg_trie_state);
1735 DEBUG_TRIE_COMPILE_MORE_r(
1736 PerlIO_printf( Perl_debug_log,
1737 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
1738 (int)depth * 2 + 2,"",
1739 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ),
1742 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
1745 } /* end table compress */
1747 /* resize the trans array to remove unused space */
1748 Renew( trie->trans, trie->lasttrans, reg_trie_trans);
1750 /* and now dump out the compressed format */
1751 DEBUG_TRIE_COMPILE_r(
1752 dump_trie(trie,depth+1)
1755 { /* Modify the program and insert the new TRIE node*/
1757 U8 nodetype =(U8)(flags & 0xFF);
1761 regnode *optimize = NULL;
1763 U32 mjd_nodelen = 0;
1766 This means we convert either the first branch or the first Exact,
1767 depending on whether the thing following (in 'last') is a branch
1768 or not and whther first is the startbranch (ie is it a sub part of
1769 the alternation or is it the whole thing.)
1770 Assuming its a sub part we conver the EXACT otherwise we convert
1771 the whole branch sequence, including the first.
1773 /* Find the node we are going to overwrite */
1774 if ( first == startbranch && OP( last ) != BRANCH ) {
1775 /* whole branch chain */
1778 const regnode *nop = NEXTOPER( convert );
1779 mjd_offset= Node_Offset((nop));
1780 mjd_nodelen= Node_Length((nop));
1783 /* branch sub-chain */
1784 convert = NEXTOPER( first );
1785 NEXT_OFF( first ) = (U16)(last - first);
1787 mjd_offset= Node_Offset((convert));
1788 mjd_nodelen= Node_Length((convert));
1792 PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
1793 (int)depth * 2 + 2, "",
1794 (UV)mjd_offset, (UV)mjd_nodelen)
1797 /* But first we check to see if there is a common prefix we can
1798 split out as an EXACT and put in front of the TRIE node. */
1799 trie->startstate= 1;
1800 if ( trie->bitmap && !trie->widecharmap && !trie->jump ) {
1803 PerlIO_printf(Perl_debug_log, "%*sLaststate:%"UVuf"\n",
1804 (int)depth * 2 + 2, "",
1805 (UV)trie->laststate)
1807 for ( state = 1 ; state < trie->laststate-1 ; state++ ) {
1811 const U32 base = trie->states[ state ].trans.base;
1813 if ( trie->states[state].wordnum )
1816 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
1817 if ( ( base + ofs >= trie->uniquecharcount ) &&
1818 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
1819 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
1821 if ( ++count > 1 ) {
1822 SV **tmp = av_fetch( TRIE_REVCHARMAP(trie), ofs, 0);
1823 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
1824 if ( state == 1 ) break;
1826 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
1828 PerlIO_printf(Perl_debug_log,
1829 "%*sNew Start State=%"UVuf" Class: [",
1830 (int)depth * 2 + 2, "",
1833 SV ** const tmp = av_fetch( TRIE_REVCHARMAP(trie), idx, 0);
1834 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
1836 TRIE_BITMAP_SET(trie,*ch);
1838 TRIE_BITMAP_SET(trie, folder[ *ch ]);
1840 PerlIO_printf(Perl_debug_log, (char*)ch)
1844 TRIE_BITMAP_SET(trie,*ch);
1846 TRIE_BITMAP_SET(trie,folder[ *ch ]);
1847 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
1853 SV **tmp = av_fetch( TRIE_REVCHARMAP(trie), idx, 0);
1854 const char *ch = SvPV_nolen_const( *tmp );
1856 PerlIO_printf( Perl_debug_log,
1857 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
1858 (int)depth * 2 + 2, "",
1859 (UV)state, (UV)idx, ch)
1862 OP( convert ) = nodetype;
1863 str=STRING(convert);
1872 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
1878 regnode *n = convert+NODE_SZ_STR(convert);
1879 NEXT_OFF(convert) = NODE_SZ_STR(convert);
1880 trie->startstate = state;
1881 trie->minlen -= (state - 1);
1882 trie->maxlen -= (state - 1);
1884 regnode *fix = convert;
1886 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
1887 while( ++fix < n ) {
1888 Set_Node_Offset_Length(fix, 0, 0);
1894 NEXT_OFF(convert) = (U16)(tail - convert);
1895 DEBUG_r(optimize= n);
1901 if ( trie->maxlen ) {
1902 NEXT_OFF( convert ) = (U16)(tail - convert);
1903 ARG_SET( convert, data_slot );
1904 /* Store the offset to the first unabsorbed branch in
1905 jump[0], which is otherwise unused by the jump logic.
1906 We use this when dumping a trie and during optimisation. */
1908 trie->jump[0] = (U16)(tail - nextbranch);
1911 if ( !trie->states[trie->startstate].wordnum && trie->bitmap &&
1912 ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
1914 OP( convert ) = TRIEC;
1915 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
1916 Safefree(trie->bitmap);
1919 OP( convert ) = TRIE;
1921 /* store the type in the flags */
1922 convert->flags = nodetype;
1926 + regarglen[ OP( convert ) ];
1928 /* XXX We really should free up the resource in trie now,
1929 as we won't use them - (which resources?) dmq */
1931 /* needed for dumping*/
1932 DEBUG_r(if (optimize) {
1933 regnode *opt = convert;
1934 while ( ++opt < optimize) {
1935 Set_Node_Offset_Length(opt,0,0);
1938 Try to clean up some of the debris left after the
1941 while( optimize < jumper ) {
1942 mjd_nodelen += Node_Length((optimize));
1943 OP( optimize ) = OPTIMIZED;
1944 Set_Node_Offset_Length(optimize,0,0);
1947 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
1949 } /* end node insert */
1951 SvREFCNT_dec(TRIE_REVCHARMAP(trie));
1955 : trie->startstate>1
1961 S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth)
1963 /* The Trie is constructed and compressed now so we can build a fail array now if its needed
1965 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the
1966 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88
1969 We find the fail state for each state in the trie, this state is the longest proper
1970 suffix of the current states 'word' that is also a proper prefix of another word in our
1971 trie. State 1 represents the word '' and is the thus the default fail state. This allows
1972 the DFA not to have to restart after its tried and failed a word at a given point, it
1973 simply continues as though it had been matching the other word in the first place.
1975 'abcdgu'=~/abcdefg|cdgu/
1976 When we get to 'd' we are still matching the first word, we would encounter 'g' which would
1977 fail, which would bring use to the state representing 'd' in the second word where we would
1978 try 'g' and succeed, prodceding to match 'cdgu'.
1980 /* add a fail transition */
1981 reg_trie_data *trie=(reg_trie_data *)RExC_rx->data->data[ARG(source)];
1983 const U32 ucharcount = trie->uniquecharcount;
1984 const U32 numstates = trie->laststate;
1985 const U32 ubound = trie->lasttrans + ucharcount;
1989 U32 base = trie->states[ 1 ].trans.base;
1992 const U32 data_slot = add_data( pRExC_state, 1, "T" );
1993 GET_RE_DEBUG_FLAGS_DECL;
1995 PERL_UNUSED_ARG(depth);
1999 ARG_SET( stclass, data_slot );
2000 Newxz( aho, 1, reg_ac_data );
2001 RExC_rx->data->data[ data_slot ] = (void*)aho;
2003 aho->states=(reg_trie_state *)savepvn((const char*)trie->states,
2004 (trie->laststate+1)*sizeof(reg_trie_state));
2005 Newxz( q, numstates, U32);
2006 Newxz( aho->fail, numstates, U32 );
2009 /* initialize fail[0..1] to be 1 so that we always have
2010 a valid final fail state */
2011 fail[ 0 ] = fail[ 1 ] = 1;
2013 for ( charid = 0; charid < ucharcount ; charid++ ) {
2014 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
2016 q[ q_write ] = newstate;
2017 /* set to point at the root */
2018 fail[ q[ q_write++ ] ]=1;
2021 while ( q_read < q_write) {
2022 const U32 cur = q[ q_read++ % numstates ];
2023 base = trie->states[ cur ].trans.base;
2025 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
2026 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
2028 U32 fail_state = cur;
2031 fail_state = fail[ fail_state ];
2032 fail_base = aho->states[ fail_state ].trans.base;
2033 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
2035 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
2036 fail[ ch_state ] = fail_state;
2037 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
2039 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
2041 q[ q_write++ % numstates] = ch_state;
2045 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
2046 when we fail in state 1, this allows us to use the
2047 charclass scan to find a valid start char. This is based on the principle
2048 that theres a good chance the string being searched contains lots of stuff
2049 that cant be a start char.
2051 fail[ 0 ] = fail[ 1 ] = 0;
2052 DEBUG_TRIE_COMPILE_r({
2053 PerlIO_printf(Perl_debug_log, "%*sStclass Failtable: 0", (int)(depth * 2), "");
2054 for( q_read=1; q_read<numstates; q_read++ ) {
2055 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
2057 PerlIO_printf(Perl_debug_log, "\n");
2060 /*RExC_seen |= REG_SEEN_TRIEDFA;*/
2065 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
2066 * These need to be revisited when a newer toolchain becomes available.
2068 #if defined(__sparc64__) && defined(__GNUC__)
2069 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
2070 # undef SPARC64_GCC_WORKAROUND
2071 # define SPARC64_GCC_WORKAROUND 1
2075 #define DEBUG_PEEP(str,scan,depth) \
2076 DEBUG_OPTIMISE_r({ \
2077 SV * const mysv=sv_newmortal(); \
2078 regnode *Next = regnext(scan); \
2079 regprop(RExC_rx, mysv, scan); \
2080 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s [%d]\n", \
2081 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\
2082 Next ? (REG_NODE_NUM(Next)) : 0 ); \
2089 #define JOIN_EXACT(scan,min,flags) \
2090 if (PL_regkind[OP(scan)] == EXACT) \
2091 join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1)
2094 S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) {
2095 /* Merge several consecutive EXACTish nodes into one. */
2096 regnode *n = regnext(scan);
2098 regnode *next = scan + NODE_SZ_STR(scan);
2102 regnode *stop = scan;
2103 GET_RE_DEBUG_FLAGS_DECL;
2105 PERL_UNUSED_ARG(depth);
2107 #ifndef EXPERIMENTAL_INPLACESCAN
2108 PERL_UNUSED_ARG(flags);
2109 PERL_UNUSED_ARG(val);
2111 DEBUG_PEEP("join",scan,depth);
2113 /* Skip NOTHING, merge EXACT*. */
2115 ( PL_regkind[OP(n)] == NOTHING ||
2116 (stringok && (OP(n) == OP(scan))))
2118 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
2120 if (OP(n) == TAIL || n > next)
2122 if (PL_regkind[OP(n)] == NOTHING) {
2123 DEBUG_PEEP("skip:",n,depth);
2124 NEXT_OFF(scan) += NEXT_OFF(n);
2125 next = n + NODE_STEP_REGNODE;
2132 else if (stringok) {
2133 const unsigned int oldl = STR_LEN(scan);
2134 regnode * const nnext = regnext(n);
2136 DEBUG_PEEP("merg",n,depth);
2139 if (oldl + STR_LEN(n) > U8_MAX)
2141 NEXT_OFF(scan) += NEXT_OFF(n);
2142 STR_LEN(scan) += STR_LEN(n);
2143 next = n + NODE_SZ_STR(n);
2144 /* Now we can overwrite *n : */
2145 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
2153 #ifdef EXPERIMENTAL_INPLACESCAN
2154 if (flags && !NEXT_OFF(n)) {
2155 DEBUG_PEEP("atch", val, depth);
2156 if (reg_off_by_arg[OP(n)]) {
2157 ARG_SET(n, val - n);
2160 NEXT_OFF(n) = val - n;
2167 if (UTF && ( OP(scan) == EXACTF ) && ( STR_LEN(scan) >= 6 ) ) {
2169 Two problematic code points in Unicode casefolding of EXACT nodes:
2171 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
2172 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
2178 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
2179 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
2181 This means that in case-insensitive matching (or "loose matching",
2182 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
2183 length of the above casefolded versions) can match a target string
2184 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
2185 This would rather mess up the minimum length computation.
2187 What we'll do is to look for the tail four bytes, and then peek
2188 at the preceding two bytes to see whether we need to decrease
2189 the minimum length by four (six minus two).
2191 Thanks to the design of UTF-8, there cannot be false matches:
2192 A sequence of valid UTF-8 bytes cannot be a subsequence of
2193 another valid sequence of UTF-8 bytes.
2196 char * const s0 = STRING(scan), *s, *t;
2197 char * const s1 = s0 + STR_LEN(scan) - 1;
2198 char * const s2 = s1 - 4;
2199 #ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */
2200 const char t0[] = "\xaf\x49\xaf\x42";
2202 const char t0[] = "\xcc\x88\xcc\x81";
2204 const char * const t1 = t0 + 3;
2207 s < s2 && (t = ninstr(s, s1, t0, t1));
2210 if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) ||
2211 ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5))
2213 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
2214 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
2222 n = scan + NODE_SZ_STR(scan);
2224 if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) {
2231 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
2235 /* REx optimizer. Converts nodes into quickier variants "in place".
2236 Finds fixed substrings. */
2238 /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
2239 to the position after last scanned or to NULL. */
2244 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
2245 I32 *minlenp, I32 *deltap,
2246 regnode *last, scan_data_t *data, U32 flags, U32 depth)
2247 /* scanp: Start here (read-write). */
2248 /* deltap: Write maxlen-minlen here. */
2249 /* last: Stop before this one. */
2252 I32 min = 0, pars = 0, code;
2253 regnode *scan = *scanp, *next;
2255 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
2256 int is_inf_internal = 0; /* The studied chunk is infinite */
2257 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
2258 scan_data_t data_fake;
2259 struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */
2260 SV *re_trie_maxbuff = NULL;
2261 regnode *first_non_open = scan;
2264 GET_RE_DEBUG_FLAGS_DECL;
2266 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
2269 while (first_non_open && OP(first_non_open) == OPEN)
2270 first_non_open=regnext(first_non_open);
2274 while (scan && OP(scan) != END && scan < last) {
2275 /* Peephole optimizer: */
2276 DEBUG_STUDYDATA(data,depth);
2277 DEBUG_PEEP("Peep",scan,depth);
2278 JOIN_EXACT(scan,&min,0);
2280 /* Follow the next-chain of the current node and optimize
2281 away all the NOTHINGs from it. */
2282 if (OP(scan) != CURLYX) {
2283 const int max = (reg_off_by_arg[OP(scan)]
2285 /* I32 may be smaller than U16 on CRAYs! */
2286 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
2287 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
2291 /* Skip NOTHING and LONGJMP. */
2292 while ((n = regnext(n))
2293 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
2294 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
2295 && off + noff < max)
2297 if (reg_off_by_arg[OP(scan)])
2300 NEXT_OFF(scan) = off;
2305 /* The principal pseudo-switch. Cannot be a switch, since we
2306 look into several different things. */
2307 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
2308 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
2309 next = regnext(scan);
2311 /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */
2313 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
2314 /* NOTE - There is similar code to this block below for handling
2315 TRIE nodes on a re-study. If you change stuff here check there
2317 I32 max1 = 0, min1 = I32_MAX, num = 0;
2318 struct regnode_charclass_class accum;
2319 regnode * const startbranch=scan;
2321 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
2322 scan_commit(pRExC_state, data, minlenp); /* Cannot merge strings after this. */
2323 if (flags & SCF_DO_STCLASS)
2324 cl_init_zero(pRExC_state, &accum);
2326 while (OP(scan) == code) {
2327 I32 deltanext, minnext, f = 0, fake;
2328 struct regnode_charclass_class this_class;
2331 data_fake.flags = 0;
2333 data_fake.whilem_c = data->whilem_c;
2334 data_fake.last_closep = data->last_closep;
2337 data_fake.last_closep = &fake;
2338 next = regnext(scan);
2339 scan = NEXTOPER(scan);
2341 scan = NEXTOPER(scan);
2342 if (flags & SCF_DO_STCLASS) {
2343 cl_init(pRExC_state, &this_class);
2344 data_fake.start_class = &this_class;
2345 f = SCF_DO_STCLASS_AND;
2347 if (flags & SCF_WHILEM_VISITED_POS)
2348 f |= SCF_WHILEM_VISITED_POS;
2350 /* we suppose the run is continuous, last=next...*/
2351 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2352 next, &data_fake, f,depth+1);
2355 if (max1 < minnext + deltanext)
2356 max1 = minnext + deltanext;
2357 if (deltanext == I32_MAX)
2358 is_inf = is_inf_internal = 1;
2360 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
2363 if (data_fake.flags & SF_HAS_EVAL)
2364 data->flags |= SF_HAS_EVAL;
2365 data->whilem_c = data_fake.whilem_c;
2367 if (flags & SCF_DO_STCLASS)
2368 cl_or(pRExC_state, &accum, &this_class);
2369 if (code == SUSPEND)
2372 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
2374 if (flags & SCF_DO_SUBSTR) {
2375 data->pos_min += min1;
2376 data->pos_delta += max1 - min1;
2377 if (max1 != min1 || is_inf)
2378 data->longest = &(data->longest_float);
2381 delta += max1 - min1;
2382 if (flags & SCF_DO_STCLASS_OR) {
2383 cl_or(pRExC_state, data->start_class, &accum);
2385 cl_and(data->start_class, &and_with);
2386 flags &= ~SCF_DO_STCLASS;
2389 else if (flags & SCF_DO_STCLASS_AND) {
2391 cl_and(data->start_class, &accum);
2392 flags &= ~SCF_DO_STCLASS;
2395 /* Switch to OR mode: cache the old value of
2396 * data->start_class */
2397 StructCopy(data->start_class, &and_with,
2398 struct regnode_charclass_class);
2399 flags &= ~SCF_DO_STCLASS_AND;
2400 StructCopy(&accum, data->start_class,
2401 struct regnode_charclass_class);
2402 flags |= SCF_DO_STCLASS_OR;
2403 data->start_class->flags |= ANYOF_EOS;
2407 if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) {
2410 Assuming this was/is a branch we are dealing with: 'scan' now
2411 points at the item that follows the branch sequence, whatever
2412 it is. We now start at the beginning of the sequence and look
2419 which would be constructed from a pattern like /A|LIST|OF|WORDS/
2421 If we can find such a subseqence we need to turn the first
2422 element into a trie and then add the subsequent branch exact
2423 strings to the trie.
2427 1. patterns where the whole set of branch can be converted.
2429 2. patterns where only a subset can be converted.
2431 In case 1 we can replace the whole set with a single regop
2432 for the trie. In case 2 we need to keep the start and end
2435 'BRANCH EXACT; BRANCH EXACT; BRANCH X'
2436 becomes BRANCH TRIE; BRANCH X;
2438 There is an additional case, that being where there is a
2439 common prefix, which gets split out into an EXACT like node
2440 preceding the TRIE node.
2442 If x(1..n)==tail then we can do a simple trie, if not we make
2443 a "jump" trie, such that when we match the appropriate word
2444 we "jump" to the appopriate tail node. Essentailly we turn
2445 a nested if into a case structure of sorts.
2450 if (!re_trie_maxbuff) {
2451 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2452 if (!SvIOK(re_trie_maxbuff))
2453 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2455 if ( SvIV(re_trie_maxbuff)>=0 ) {
2457 regnode *first = (regnode *)NULL;
2458 regnode *last = (regnode *)NULL;
2459 regnode *tail = scan;
2464 SV * const mysv = sv_newmortal(); /* for dumping */
2466 /* var tail is used because there may be a TAIL
2467 regop in the way. Ie, the exacts will point to the
2468 thing following the TAIL, but the last branch will
2469 point at the TAIL. So we advance tail. If we
2470 have nested (?:) we may have to move through several
2474 while ( OP( tail ) == TAIL ) {
2475 /* this is the TAIL generated by (?:) */
2476 tail = regnext( tail );
2481 regprop(RExC_rx, mysv, tail );
2482 PerlIO_printf( Perl_debug_log, "%*s%s%s\n",
2483 (int)depth * 2 + 2, "",
2484 "Looking for TRIE'able sequences. Tail node is: ",
2485 SvPV_nolen_const( mysv )
2491 step through the branches, cur represents each
2492 branch, noper is the first thing to be matched
2493 as part of that branch and noper_next is the
2494 regnext() of that node. if noper is an EXACT
2495 and noper_next is the same as scan (our current
2496 position in the regex) then the EXACT branch is
2497 a possible optimization target. Once we have
2498 two or more consequetive such branches we can
2499 create a trie of the EXACT's contents and stich
2500 it in place. If the sequence represents all of
2501 the branches we eliminate the whole thing and
2502 replace it with a single TRIE. If it is a
2503 subsequence then we need to stitch it in. This
2504 means the first branch has to remain, and needs
2505 to be repointed at the item on the branch chain
2506 following the last branch optimized. This could
2507 be either a BRANCH, in which case the
2508 subsequence is internal, or it could be the
2509 item following the branch sequence in which
2510 case the subsequence is at the end.
2514 /* dont use tail as the end marker for this traverse */
2515 for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) {
2516 regnode * const noper = NEXTOPER( cur );
2517 #if defined(DEBUGGING) || defined(NOJUMPTRIE)
2518 regnode * const noper_next = regnext( noper );
2522 regprop(RExC_rx, mysv, cur);
2523 PerlIO_printf( Perl_debug_log, "%*s- %s (%d)",
2524 (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) );
2526 regprop(RExC_rx, mysv, noper);
2527 PerlIO_printf( Perl_debug_log, " -> %s",
2528 SvPV_nolen_const(mysv));
2531 regprop(RExC_rx, mysv, noper_next );
2532 PerlIO_printf( Perl_debug_log,"\t=> %s\t",
2533 SvPV_nolen_const(mysv));
2535 PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n",
2536 REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) );
2538 if ( (((first && optype!=NOTHING) ? OP( noper ) == optype
2539 : PL_regkind[ OP( noper ) ] == EXACT )
2540 || OP(noper) == NOTHING )
2542 && noper_next == tail
2547 if ( !first || optype == NOTHING ) {
2548 if (!first) first = cur;
2549 optype = OP( noper );
2555 make_trie( pRExC_state,
2556 startbranch, first, cur, tail, count,
2559 if ( PL_regkind[ OP( noper ) ] == EXACT
2561 && noper_next == tail
2566 optype = OP( noper );
2576 regprop(RExC_rx, mysv, cur);
2577 PerlIO_printf( Perl_debug_log,
2578 "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2,
2579 "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur));
2583 made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 );
2584 #ifdef TRIE_STUDY_OPT
2585 if ( ((made == MADE_EXACT_TRIE &&
2586 startbranch == first)
2587 || ( first_non_open == first )) &&
2589 flags |= SCF_TRIE_RESTUDY;
2597 else if ( code == BRANCHJ ) { /* single branch is optimized. */
2598 scan = NEXTOPER(NEXTOPER(scan));
2599 } else /* single branch is optimized. */
2600 scan = NEXTOPER(scan);
2603 else if (OP(scan) == EXACT) {
2604 I32 l = STR_LEN(scan);
2607 const U8 * const s = (U8*)STRING(scan);
2608 l = utf8_length(s, s + l);
2609 uc = utf8_to_uvchr(s, NULL);
2611 uc = *((U8*)STRING(scan));
2614 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
2615 /* The code below prefers earlier match for fixed
2616 offset, later match for variable offset. */
2617 if (data->last_end == -1) { /* Update the start info. */
2618 data->last_start_min = data->pos_min;
2619 data->last_start_max = is_inf
2620 ? I32_MAX : data->pos_min + data->pos_delta;
2622 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
2624 SvUTF8_on(data->last_found);
2626 SV * const sv = data->last_found;
2627 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
2628 mg_find(sv, PERL_MAGIC_utf8) : NULL;
2629 if (mg && mg->mg_len >= 0)
2630 mg->mg_len += utf8_length((U8*)STRING(scan),
2631 (U8*)STRING(scan)+STR_LEN(scan));
2633 data->last_end = data->pos_min + l;
2634 data->pos_min += l; /* As in the first entry. */
2635 data->flags &= ~SF_BEFORE_EOL;
2637 if (flags & SCF_DO_STCLASS_AND) {
2638 /* Check whether it is compatible with what we know already! */
2642 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2643 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2644 && (!(data->start_class->flags & ANYOF_FOLD)
2645 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2648 ANYOF_CLASS_ZERO(data->start_class);
2649 ANYOF_BITMAP_ZERO(data->start_class);
2651 ANYOF_BITMAP_SET(data->start_class, uc);
2652 data->start_class->flags &= ~ANYOF_EOS;
2654 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
2656 else if (flags & SCF_DO_STCLASS_OR) {
2657 /* false positive possible if the class is case-folded */
2659 ANYOF_BITMAP_SET(data->start_class, uc);
2661 data->start_class->flags |= ANYOF_UNICODE_ALL;
2662 data->start_class->flags &= ~ANYOF_EOS;
2663 cl_and(data->start_class, &and_with);
2665 flags &= ~SCF_DO_STCLASS;
2667 else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */
2668 I32 l = STR_LEN(scan);
2669 UV uc = *((U8*)STRING(scan));
2671 /* Search for fixed substrings supports EXACT only. */
2672 if (flags & SCF_DO_SUBSTR) {
2674 scan_commit(pRExC_state, data, minlenp);
2677 const U8 * const s = (U8 *)STRING(scan);
2678 l = utf8_length(s, s + l);
2679 uc = utf8_to_uvchr(s, NULL);
2682 if (flags & SCF_DO_SUBSTR)
2684 if (flags & SCF_DO_STCLASS_AND) {
2685 /* Check whether it is compatible with what we know already! */
2689 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2690 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2691 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2693 ANYOF_CLASS_ZERO(data->start_class);
2694 ANYOF_BITMAP_ZERO(data->start_class);
2696 ANYOF_BITMAP_SET(data->start_class, uc);
2697 data->start_class->flags &= ~ANYOF_EOS;
2698 data->start_class->flags |= ANYOF_FOLD;
2699 if (OP(scan) == EXACTFL)
2700 data->start_class->flags |= ANYOF_LOCALE;
2703 else if (flags & SCF_DO_STCLASS_OR) {
2704 if (data->start_class->flags & ANYOF_FOLD) {
2705 /* false positive possible if the class is case-folded.
2706 Assume that the locale settings are the same... */
2708 ANYOF_BITMAP_SET(data->start_class, uc);
2709 data->start_class->flags &= ~ANYOF_EOS;
2711 cl_and(data->start_class, &and_with);
2713 flags &= ~SCF_DO_STCLASS;
2715 else if (strchr((const char*)PL_varies,OP(scan))) {
2716 I32 mincount, maxcount, minnext, deltanext, fl = 0;
2717 I32 f = flags, pos_before = 0;
2718 regnode * const oscan = scan;
2719 struct regnode_charclass_class this_class;
2720 struct regnode_charclass_class *oclass = NULL;
2721 I32 next_is_eval = 0;
2723 switch (PL_regkind[OP(scan)]) {
2724 case WHILEM: /* End of (?:...)* . */
2725 scan = NEXTOPER(scan);
2728 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
2729 next = NEXTOPER(scan);
2730 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
2732 maxcount = REG_INFTY;
2733 next = regnext(scan);
2734 scan = NEXTOPER(scan);
2738 if (flags & SCF_DO_SUBSTR)
2743 if (flags & SCF_DO_STCLASS) {
2745 maxcount = REG_INFTY;
2746 next = regnext(scan);
2747 scan = NEXTOPER(scan);
2750 is_inf = is_inf_internal = 1;
2751 scan = regnext(scan);
2752 if (flags & SCF_DO_SUBSTR) {
2753 scan_commit(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */
2754 data->longest = &(data->longest_float);
2756 goto optimize_curly_tail;
2758 mincount = ARG1(scan);
2759 maxcount = ARG2(scan);
2760 next = regnext(scan);
2761 if (OP(scan) == CURLYX) {
2762 I32 lp = (data ? *(data->last_closep) : 0);
2763 scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX);
2765 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
2766 next_is_eval = (OP(scan) == EVAL);
2768 if (flags & SCF_DO_SUBSTR) {
2769 if (mincount == 0) scan_commit(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */
2770 pos_before = data->pos_min;
2774 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
2776 data->flags |= SF_IS_INF;
2778 if (flags & SCF_DO_STCLASS) {
2779 cl_init(pRExC_state, &this_class);
2780 oclass = data->start_class;
2781 data->start_class = &this_class;
2782 f |= SCF_DO_STCLASS_AND;
2783 f &= ~SCF_DO_STCLASS_OR;
2785 /* These are the cases when once a subexpression
2786 fails at a particular position, it cannot succeed
2787 even after backtracking at the enclosing scope.
2789 XXXX what if minimal match and we are at the
2790 initial run of {n,m}? */
2791 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
2792 f &= ~SCF_WHILEM_VISITED_POS;
2794 /* This will finish on WHILEM, setting scan, or on NULL: */
2795 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext, last, data,
2797 ? (f & ~SCF_DO_SUBSTR) : f),depth+1);
2799 if (flags & SCF_DO_STCLASS)
2800 data->start_class = oclass;
2801 if (mincount == 0 || minnext == 0) {
2802 if (flags & SCF_DO_STCLASS_OR) {
2803 cl_or(pRExC_state, data->start_class, &this_class);
2805 else if (flags & SCF_DO_STCLASS_AND) {
2806 /* Switch to OR mode: cache the old value of
2807 * data->start_class */
2808 StructCopy(data->start_class, &and_with,
2809 struct regnode_charclass_class);
2810 flags &= ~SCF_DO_STCLASS_AND;
2811 StructCopy(&this_class, data->start_class,
2812 struct regnode_charclass_class);
2813 flags |= SCF_DO_STCLASS_OR;
2814 data->start_class->flags |= ANYOF_EOS;
2816 } else { /* Non-zero len */
2817 if (flags & SCF_DO_STCLASS_OR) {
2818 cl_or(pRExC_state, data->start_class, &this_class);
2819 cl_and(data->start_class, &and_with);
2821 else if (flags & SCF_DO_STCLASS_AND)
2822 cl_and(data->start_class, &this_class);
2823 flags &= ~SCF_DO_STCLASS;
2825 if (!scan) /* It was not CURLYX, but CURLY. */
2827 if ( /* ? quantifier ok, except for (?{ ... }) */
2828 (next_is_eval || !(mincount == 0 && maxcount == 1))
2829 && (minnext == 0) && (deltanext == 0)
2830 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
2831 && maxcount <= REG_INFTY/3 /* Complement check for big count */
2832 && ckWARN(WARN_REGEXP))
2835 "Quantifier unexpected on zero-length expression");
2838 min += minnext * mincount;
2839 is_inf_internal |= ((maxcount == REG_INFTY
2840 && (minnext + deltanext) > 0)
2841 || deltanext == I32_MAX);
2842 is_inf |= is_inf_internal;
2843 delta += (minnext + deltanext) * maxcount - minnext * mincount;
2845 /* Try powerful optimization CURLYX => CURLYN. */
2846 if ( OP(oscan) == CURLYX && data
2847 && data->flags & SF_IN_PAR
2848 && !(data->flags & SF_HAS_EVAL)
2849 && !deltanext && minnext == 1 ) {
2850 /* Try to optimize to CURLYN. */
2851 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
2852 regnode * const nxt1 = nxt;
2859 if (!strchr((const char*)PL_simple,OP(nxt))
2860 && !(PL_regkind[OP(nxt)] == EXACT
2861 && STR_LEN(nxt) == 1))
2867 if (OP(nxt) != CLOSE)
2869 /* Now we know that nxt2 is the only contents: */
2870 oscan->flags = (U8)ARG(nxt);
2872 OP(nxt1) = NOTHING; /* was OPEN. */
2874 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
2875 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
2876 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
2877 OP(nxt) = OPTIMIZED; /* was CLOSE. */
2878 OP(nxt + 1) = OPTIMIZED; /* was count. */
2879 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
2884 /* Try optimization CURLYX => CURLYM. */
2885 if ( OP(oscan) == CURLYX && data
2886 && !(data->flags & SF_HAS_PAR)
2887 && !(data->flags & SF_HAS_EVAL)
2888 && !deltanext /* atom is fixed width */
2889 && minnext != 0 /* CURLYM can't handle zero width */
2891 /* XXXX How to optimize if data == 0? */
2892 /* Optimize to a simpler form. */
2893 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
2897 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
2898 && (OP(nxt2) != WHILEM))
2900 OP(nxt2) = SUCCEED; /* Whas WHILEM */
2901 /* Need to optimize away parenths. */
2902 if (data->flags & SF_IN_PAR) {
2903 /* Set the parenth number. */
2904 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
2906 if (OP(nxt) != CLOSE)
2907 FAIL("Panic opt close");
2908 oscan->flags = (U8)ARG(nxt);
2909 OP(nxt1) = OPTIMIZED; /* was OPEN. */
2910 OP(nxt) = OPTIMIZED; /* was CLOSE. */
2912 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
2913 OP(nxt + 1) = OPTIMIZED; /* was count. */
2914 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
2915 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
2918 while ( nxt1 && (OP(nxt1) != WHILEM)) {
2919 regnode *nnxt = regnext(nxt1);
2922 if (reg_off_by_arg[OP(nxt1)])
2923 ARG_SET(nxt1, nxt2 - nxt1);
2924 else if (nxt2 - nxt1 < U16_MAX)
2925 NEXT_OFF(nxt1) = nxt2 - nxt1;
2927 OP(nxt) = NOTHING; /* Cannot beautify */
2932 /* Optimize again: */
2933 study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt,
2939 else if ((OP(oscan) == CURLYX)
2940 && (flags & SCF_WHILEM_VISITED_POS)
2941 /* See the comment on a similar expression above.
2942 However, this time it not a subexpression
2943 we care about, but the expression itself. */
2944 && (maxcount == REG_INFTY)
2945 && data && ++data->whilem_c < 16) {
2946 /* This stays as CURLYX, we can put the count/of pair. */
2947 /* Find WHILEM (as in regexec.c) */
2948 regnode *nxt = oscan + NEXT_OFF(oscan);
2950 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
2952 PREVOPER(nxt)->flags = (U8)(data->whilem_c
2953 | (RExC_whilem_seen << 4)); /* On WHILEM */
2955 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
2957 if (flags & SCF_DO_SUBSTR) {
2958 SV *last_str = NULL;
2959 int counted = mincount != 0;
2961 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
2962 #if defined(SPARC64_GCC_WORKAROUND)
2965 const char *s = NULL;
2968 if (pos_before >= data->last_start_min)
2971 b = data->last_start_min;
2974 s = SvPV_const(data->last_found, l);
2975 old = b - data->last_start_min;
2978 I32 b = pos_before >= data->last_start_min
2979 ? pos_before : data->last_start_min;
2981 const char * const s = SvPV_const(data->last_found, l);
2982 I32 old = b - data->last_start_min;
2986 old = utf8_hop((U8*)s, old) - (U8*)s;
2989 /* Get the added string: */
2990 last_str = newSVpvn(s + old, l);
2992 SvUTF8_on(last_str);
2993 if (deltanext == 0 && pos_before == b) {
2994 /* What was added is a constant string */
2996 SvGROW(last_str, (mincount * l) + 1);
2997 repeatcpy(SvPVX(last_str) + l,
2998 SvPVX_const(last_str), l, mincount - 1);
2999 SvCUR_set(last_str, SvCUR(last_str) * mincount);
3000 /* Add additional parts. */
3001 SvCUR_set(data->last_found,
3002 SvCUR(data->last_found) - l);
3003 sv_catsv(data->last_found, last_str);
3005 SV * sv = data->last_found;
3007 SvUTF8(sv) && SvMAGICAL(sv) ?
3008 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3009 if (mg && mg->mg_len >= 0)
3010 mg->mg_len += CHR_SVLEN(last_str);
3012 data->last_end += l * (mincount - 1);
3015 /* start offset must point into the last copy */
3016 data->last_start_min += minnext * (mincount - 1);
3017 data->last_start_max += is_inf ? I32_MAX
3018 : (maxcount - 1) * (minnext + data->pos_delta);
3021 /* It is counted once already... */
3022 data->pos_min += minnext * (mincount - counted);
3023 data->pos_delta += - counted * deltanext +
3024 (minnext + deltanext) * maxcount - minnext * mincount;
3025 if (mincount != maxcount) {
3026 /* Cannot extend fixed substrings found inside
3028 scan_commit(pRExC_state,data,minlenp);
3029 if (mincount && last_str) {
3030 SV * const sv = data->last_found;
3031 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3032 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3036 sv_setsv(sv, last_str);
3037 data->last_end = data->pos_min;
3038 data->last_start_min =
3039 data->pos_min - CHR_SVLEN(last_str);
3040 data->last_start_max = is_inf
3042 : data->pos_min + data->pos_delta
3043 - CHR_SVLEN(last_str);
3045 data->longest = &(data->longest_float);
3047 SvREFCNT_dec(last_str);
3049 if (data && (fl & SF_HAS_EVAL))
3050 data->flags |= SF_HAS_EVAL;
3051 optimize_curly_tail:
3052 if (OP(oscan) != CURLYX) {
3053 while (PL_regkind[OP(next = regnext(oscan))] == NOTHING
3055 NEXT_OFF(oscan) += NEXT_OFF(next);
3058 default: /* REF and CLUMP only? */
3059 if (flags & SCF_DO_SUBSTR) {
3060 scan_commit(pRExC_state,data,minlenp); /* Cannot expect anything... */
3061 data->longest = &(data->longest_float);
3063 is_inf = is_inf_internal = 1;
3064 if (flags & SCF_DO_STCLASS_OR)
3065 cl_anything(pRExC_state, data->start_class);
3066 flags &= ~SCF_DO_STCLASS;
3070 else if (strchr((const char*)PL_simple,OP(scan))) {
3073 if (flags & SCF_DO_SUBSTR) {
3074 scan_commit(pRExC_state,data,minlenp);
3078 if (flags & SCF_DO_STCLASS) {
3079 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3081 /* Some of the logic below assumes that switching
3082 locale on will only add false positives. */
3083 switch (PL_regkind[OP(scan)]) {
3087 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
3088 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3089 cl_anything(pRExC_state, data->start_class);
3092 if (OP(scan) == SANY)
3094 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
3095 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
3096 || (data->start_class->flags & ANYOF_CLASS));
3097 cl_anything(pRExC_state, data->start_class);
3099 if (flags & SCF_DO_STCLASS_AND || !value)
3100 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
3103 if (flags & SCF_DO_STCLASS_AND)
3104 cl_and(data->start_class,
3105 (struct regnode_charclass_class*)scan);
3107 cl_or(pRExC_state, data->start_class,
3108 (struct regnode_charclass_class*)scan);
3111 if (flags & SCF_DO_STCLASS_AND) {
3112 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3113 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3114 for (value = 0; value < 256; value++)
3115 if (!isALNUM(value))
3116 ANYOF_BITMAP_CLEAR(data->start_class, value);
3120 if (data->start_class->flags & ANYOF_LOCALE)
3121 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3123 for (value = 0; value < 256; value++)
3125 ANYOF_BITMAP_SET(data->start_class, value);
3130 if (flags & SCF_DO_STCLASS_AND) {
3131 if (data->start_class->flags & ANYOF_LOCALE)
3132 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3135 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3136 data->start_class->flags |= ANYOF_LOCALE;
3140 if (flags & SCF_DO_STCLASS_AND) {
3141 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3142 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3143 for (value = 0; value < 256; value++)
3145 ANYOF_BITMAP_CLEAR(data->start_class, value);
3149 if (data->start_class->flags & ANYOF_LOCALE)
3150 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3152 for (value = 0; value < 256; value++)
3153 if (!isALNUM(value))
3154 ANYOF_BITMAP_SET(data->start_class, value);
3159 if (flags & SCF_DO_STCLASS_AND) {
3160 if (data->start_class->flags & ANYOF_LOCALE)
3161 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3164 data->start_class->flags |= ANYOF_LOCALE;
3165 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3169 if (flags & SCF_DO_STCLASS_AND) {
3170 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3171 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3172 for (value = 0; value < 256; value++)
3173 if (!isSPACE(value))
3174 ANYOF_BITMAP_CLEAR(data->start_class, value);
3178 if (data->start_class->flags & ANYOF_LOCALE)
3179 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3181 for (value = 0; value < 256; value++)
3183 ANYOF_BITMAP_SET(data->start_class, value);
3188 if (flags & SCF_DO_STCLASS_AND) {
3189 if (data->start_class->flags & ANYOF_LOCALE)
3190 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3193 data->start_class->flags |= ANYOF_LOCALE;
3194 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3198 if (flags & SCF_DO_STCLASS_AND) {
3199 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3200 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3201 for (value = 0; value < 256; value++)
3203 ANYOF_BITMAP_CLEAR(data->start_class, value);
3207 if (data->start_class->flags & ANYOF_LOCALE)
3208 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3210 for (value = 0; value < 256; value++)
3211 if (!isSPACE(value))
3212 ANYOF_BITMAP_SET(data->start_class, value);
3217 if (flags & SCF_DO_STCLASS_AND) {
3218 if (data->start_class->flags & ANYOF_LOCALE) {
3219 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3220 for (value = 0; value < 256; value++)
3221 if (!isSPACE(value))
3222 ANYOF_BITMAP_CLEAR(data->start_class, value);
3226 data->start_class->flags |= ANYOF_LOCALE;
3227 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3231 if (flags & SCF_DO_STCLASS_AND) {
3232 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
3233 for (value = 0; value < 256; value++)
3234 if (!isDIGIT(value))
3235 ANYOF_BITMAP_CLEAR(data->start_class, value);
3238 if (data->start_class->flags & ANYOF_LOCALE)
3239 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
3241 for (value = 0; value < 256; value++)
3243 ANYOF_BITMAP_SET(data->start_class, value);
3248 if (flags & SCF_DO_STCLASS_AND) {
3249 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
3250 for (value = 0; value < 256; value++)
3252 ANYOF_BITMAP_CLEAR(data->start_class, value);
3255 if (data->start_class->flags & ANYOF_LOCALE)
3256 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
3258 for (value = 0; value < 256; value++)
3259 if (!isDIGIT(value))
3260 ANYOF_BITMAP_SET(data->start_class, value);
3265 if (flags & SCF_DO_STCLASS_OR)
3266 cl_and(data->start_class, &and_with);
3267 flags &= ~SCF_DO_STCLASS;
3270 else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
3271 data->flags |= (OP(scan) == MEOL
3275 else if ( PL_regkind[OP(scan)] == BRANCHJ
3276 /* Lookbehind, or need to calculate parens/evals/stclass: */
3277 && (scan->flags || data || (flags & SCF_DO_STCLASS))
3278 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
3279 if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3280 || OP(scan) == UNLESSM )
3282 /* Negative Lookahead/lookbehind
3283 In this case we can't do fixed string optimisation.
3286 I32 deltanext, minnext, fake = 0;
3288 struct regnode_charclass_class intrnl;
3291 data_fake.flags = 0;
3293 data_fake.whilem_c = data->whilem_c;
3294 data_fake.last_closep = data->last_closep;
3297 data_fake.last_closep = &fake;
3298 if ( flags & SCF_DO_STCLASS && !scan->flags
3299 && OP(scan) == IFMATCH ) { /* Lookahead */
3300 cl_init(pRExC_state, &intrnl);
3301 data_fake.start_class = &intrnl;
3302 f |= SCF_DO_STCLASS_AND;
3304 if (flags & SCF_WHILEM_VISITED_POS)
3305 f |= SCF_WHILEM_VISITED_POS;
3306 next = regnext(scan);
3307 nscan = NEXTOPER(NEXTOPER(scan));
3308 minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext, last, &data_fake, f,depth+1);
3311 vFAIL("Variable length lookbehind not implemented");
3313 else if (minnext > (I32)U8_MAX) {
3314 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3316 scan->flags = (U8)minnext;
3319 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3321 if (data_fake.flags & SF_HAS_EVAL)
3322 data->flags |= SF_HAS_EVAL;
3323 data->whilem_c = data_fake.whilem_c;
3325 if (f & SCF_DO_STCLASS_AND) {
3326 const int was = (data->start_class->flags & ANYOF_EOS);
3328 cl_and(data->start_class, &intrnl);
3330 data->start_class->flags |= ANYOF_EOS;
3333 #if PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3335 /* Positive Lookahead/lookbehind
3336 In this case we can do fixed string optimisation,
3337 but we must be careful about it. Note in the case of
3338 lookbehind the positions will be offset by the minimum
3339 length of the pattern, something we won't know about
3340 until after the recurse.
3342 I32 deltanext, fake = 0;
3344 struct regnode_charclass_class intrnl;
3346 /* We use SAVEFREEPV so that when the full compile
3347 is finished perl will clean up the allocated
3348 minlens when its all done. This was we don't
3349 have to worry about freeing them when we know
3350 they wont be used, which would be a pain.
3353 Newx( minnextp, 1, I32 );
3354 SAVEFREEPV(minnextp);
3357 StructCopy(data, &data_fake, scan_data_t);
3358 if ((flags & SCF_DO_SUBSTR) && data->last_found) {
3361 scan_commit(pRExC_state, &data_fake,minlenp);
3362 data_fake.last_found=newSVsv(data->last_found);
3366 data_fake.last_closep = &fake;
3367 data_fake.flags = 0;
3369 data_fake.flags |= SF_IS_INF;
3370 if ( flags & SCF_DO_STCLASS && !scan->flags
3371 && OP(scan) == IFMATCH ) { /* Lookahead */
3372 cl_init(pRExC_state, &intrnl);
3373 data_fake.start_class = &intrnl;
3374 f |= SCF_DO_STCLASS_AND;
3376 if (flags & SCF_WHILEM_VISITED_POS)
3377 f |= SCF_WHILEM_VISITED_POS;
3378 next = regnext(scan);
3379 nscan = NEXTOPER(NEXTOPER(scan));
3381 *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext, last, &data_fake, f,depth+1);
3384 vFAIL("Variable length lookbehind not implemented");
3386 else if (*minnextp > (I32)U8_MAX) {
3387 vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3389 scan->flags = (U8)*minnextp;
3395 if (f & SCF_DO_STCLASS_AND) {
3396 const int was = (data->start_class->flags & ANYOF_EOS);
3398 cl_and(data->start_class, &intrnl);
3400 data->start_class->flags |= ANYOF_EOS;
3403 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3405 if (data_fake.flags & SF_HAS_EVAL)
3406 data->flags |= SF_HAS_EVAL;
3407 data->whilem_c = data_fake.whilem_c;
3408 if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) {
3409 if (RExC_rx->minlen<*minnextp)
3410 RExC_rx->minlen=*minnextp;
3411 scan_commit(pRExC_state, &data_fake, minnextp);
3412 SvREFCNT_dec(data_fake.last_found);
3414 if ( data_fake.minlen_fixed != minlenp )
3416 data->offset_fixed= data_fake.offset_fixed;
3417 data->minlen_fixed= data_fake.minlen_fixed;
3418 data->lookbehind_fixed+= scan->flags;
3420 if ( data_fake.minlen_float != minlenp )
3422 data->minlen_float= data_fake.minlen_float;
3423 data->offset_float_min=data_fake.offset_float_min;
3424 data->offset_float_max=data_fake.offset_float_max;
3425 data->lookbehind_float+= scan->flags;
3434 else if (OP(scan) == OPEN) {
3437 else if (OP(scan) == CLOSE) {
3438 if ((I32)ARG(scan) == is_par) {
3439 next = regnext(scan);
3441 if ( next && (OP(next) != WHILEM) && next < last)
3442 is_par = 0; /* Disable optimization */
3445 *(data->last_closep) = ARG(scan);
3447 else if (OP(scan) == EVAL) {
3449 data->flags |= SF_HAS_EVAL;
3451 else if ( (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */
3452 || OP(scan)==RECURSE) /* recursion */
3454 if (OP(scan)==RECURSE) {
3455 ARG2L_SET( scan, RExC_parens[ARG(scan)-1] - scan );
3457 if (flags & SCF_DO_SUBSTR) {
3458 scan_commit(pRExC_state,data,minlenp);
3459 data->longest = &(data->longest_float);
3461 is_inf = is_inf_internal = 1;
3462 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3463 cl_anything(pRExC_state, data->start_class);
3464 flags &= ~SCF_DO_STCLASS;
3466 #ifdef TRIE_STUDY_OPT
3467 #ifdef FULL_TRIE_STUDY
3468 else if (PL_regkind[OP(scan)] == TRIE) {
3469 /* NOTE - There is similar code to this block above for handling
3470 BRANCH nodes on the initial study. If you change stuff here
3472 regnode *tail= regnext(scan);
3473 reg_trie_data *trie = (reg_trie_data*)RExC_rx->data->data[ ARG(scan) ];
3474 I32 max1 = 0, min1 = I32_MAX;
3475 struct regnode_charclass_class accum;
3477 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
3478 scan_commit(pRExC_state, data,minlenp); /* Cannot merge strings after this. */
3479 if (flags & SCF_DO_STCLASS)
3480 cl_init_zero(pRExC_state, &accum);
3486 const regnode *nextbranch= NULL;
3489 for ( word=1 ; word <= trie->wordcount ; word++)
3491 I32 deltanext=0, minnext=0, f = 0, fake;
3492 struct regnode_charclass_class this_class;
3494 data_fake.flags = 0;
3496 data_fake.whilem_c = data->whilem_c;
3497 data_fake.last_closep = data->last_closep;
3500 data_fake.last_closep = &fake;
3502 if (flags & SCF_DO_STCLASS) {
3503 cl_init(pRExC_state, &this_class);
3504 data_fake.start_class = &this_class;
3505 f = SCF_DO_STCLASS_AND;
3507 if (flags & SCF_WHILEM_VISITED_POS)
3508 f |= SCF_WHILEM_VISITED_POS;
3510 if (trie->jump[word]) {
3512 nextbranch = tail - trie->jump[0];
3513 scan= tail - trie->jump[word];
3514 /* We go from the jump point to the branch that follows
3515 it. Note this means we need the vestigal unused branches
3516 even though they arent otherwise used.
3518 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
3519 (regnode *)nextbranch, &data_fake, f,depth+1);
3521 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
3522 nextbranch= regnext((regnode*)nextbranch);
3524 if (min1 > (I32)(minnext + trie->minlen))
3525 min1 = minnext + trie->minlen;
3526 if (max1 < (I32)(minnext + deltanext + trie->maxlen))
3527 max1 = minnext + deltanext + trie->maxlen;
3528 if (deltanext == I32_MAX)
3529 is_inf = is_inf_internal = 1;
3531 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3535 if (data_fake.flags & SF_HAS_EVAL)
3536 data->flags |= SF_HAS_EVAL;
3537 data->whilem_c = data_fake.whilem_c;
3539 if (flags & SCF_DO_STCLASS)
3540 cl_or(pRExC_state, &accum, &this_class);
3543 if (flags & SCF_DO_SUBSTR) {
3544 data->pos_min += min1;
3545 data->pos_delta += max1 - min1;
3546 if (max1 != min1 || is_inf)
3547 data->longest = &(data->longest_float);
3550 delta += max1 - min1;
3551 if (flags & SCF_DO_STCLASS_OR) {
3552 cl_or(pRExC_state, data->start_class, &accum);
3554 cl_and(data->start_class, &and_with);
3555 flags &= ~SCF_DO_STCLASS;
3558 else if (flags & SCF_DO_STCLASS_AND) {
3560 cl_and(data->start_class, &accum);
3561 flags &= ~SCF_DO_STCLASS;
3564 /* Switch to OR mode: cache the old value of
3565 * data->start_class */
3566 StructCopy(data->start_class, &and_with,
3567 struct regnode_charclass_class);
3568 flags &= ~SCF_DO_STCLASS_AND;
3569 StructCopy(&accum, data->start_class,
3570 struct regnode_charclass_class);
3571 flags |= SCF_DO_STCLASS_OR;
3572 data->start_class->flags |= ANYOF_EOS;
3579 else if (PL_regkind[OP(scan)] == TRIE) {
3580 reg_trie_data *trie = (reg_trie_data*)RExC_rx->data->data[ ARG(scan) ];
3583 min += trie->minlen;
3584 delta += (trie->maxlen - trie->minlen);
3585 flags &= ~SCF_DO_STCLASS; /* xxx */
3586 if (flags & SCF_DO_SUBSTR) {
3587 scan_commit(pRExC_state,data,minlenp); /* Cannot expect anything... */
3588 data->pos_min += trie->minlen;
3589 data->pos_delta += (trie->maxlen - trie->minlen);
3590 if (trie->maxlen != trie->minlen)
3591 data->longest = &(data->longest_float);
3593 if (trie->jump) /* no more substrings -- for now /grr*/
3594 flags &= ~SCF_DO_SUBSTR;
3596 #endif /* old or new */
3597 #endif /* TRIE_STUDY_OPT */
3598 /* Else: zero-length, ignore. */
3599 scan = regnext(scan);
3604 *deltap = is_inf_internal ? I32_MAX : delta;
3605 if (flags & SCF_DO_SUBSTR && is_inf)
3606 data->pos_delta = I32_MAX - data->pos_min;
3607 if (is_par > (I32)U8_MAX)
3609 if (is_par && pars==1 && data) {
3610 data->flags |= SF_IN_PAR;
3611 data->flags &= ~SF_HAS_PAR;
3613 else if (pars && data) {
3614 data->flags |= SF_HAS_PAR;
3615 data->flags &= ~SF_IN_PAR;
3617 if (flags & SCF_DO_STCLASS_OR)
3618 cl_and(data->start_class, &and_with);
3619 if (flags & SCF_TRIE_RESTUDY)
3620 data->flags |= SCF_TRIE_RESTUDY;
3622 DEBUG_STUDYDATA(data,depth);
3628 S_add_data(RExC_state_t *pRExC_state, I32 n, const char *s)
3630 if (RExC_rx->data) {
3631 const U32 count = RExC_rx->data->count;
3632 Renewc(RExC_rx->data,
3633 sizeof(*RExC_rx->data) + sizeof(void*) * (count + n - 1),
3634 char, struct reg_data);
3635 Renew(RExC_rx->data->what, count + n, U8);
3636 RExC_rx->data->count += n;
3639 Newxc(RExC_rx->data, sizeof(*RExC_rx->data) + sizeof(void*) * (n - 1),
3640 char, struct reg_data);
3641 Newx(RExC_rx->data->what, n, U8);
3642 RExC_rx->data->count = n;
3644 Copy(s, RExC_rx->data->what + RExC_rx->data->count - n, n, U8);
3645 return RExC_rx->data->count - n;
3648 #ifndef PERL_IN_XSUB_RE
3650 Perl_reginitcolors(pTHX)
3653 const char * const s = PerlEnv_getenv("PERL_RE_COLORS");
3655 char *t = savepv(s);
3659 t = strchr(t, '\t');
3665 PL_colors[i] = t = (char *)"";
3670 PL_colors[i++] = (char *)"";
3677 #ifdef TRIE_STUDY_OPT
3678 #define CHECK_RESTUDY_GOTO \
3680 (data.flags & SCF_TRIE_RESTUDY) \
3684 #define CHECK_RESTUDY_GOTO
3688 - pregcomp - compile a regular expression into internal code
3690 * We can't allocate space until we know how big the compiled form will be,
3691 * but we can't compile it (and thus know how big it is) until we've got a
3692 * place to put the code. So we cheat: we compile it twice, once with code
3693 * generation turned off and size counting turned on, and once "for real".
3694 * This also means that we don't allocate space until we are sure that the
3695 * thing really will compile successfully, and we never have to move the
3696 * code and thus invalidate pointers into it. (Note that it has to be in
3697 * one piece because free() must be able to free it all.) [NB: not true in perl]
3699 * Beware that the optimization-preparation code in here knows about some
3700 * of the structure of the compiled regexp. [I'll say.]
3705 #ifndef PERL_IN_XSUB_RE
3706 #define RE_ENGINE_PTR &PL_core_reg_engine
3708 extern const struct regexp_engine my_reg_engine;
3709 #define RE_ENGINE_PTR &my_reg_engine
3711 /* these make a few things look better, to avoid indentation */
3712 #define BEGIN_BLOCK {
3716 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
3719 GET_RE_DEBUG_FLAGS_DECL;
3720 DEBUG_r(if (!PL_colorset) reginitcolors());
3721 #ifndef PERL_IN_XSUB_RE
3723 /* Dispatch a request to compile a regexp to correct
3725 HV * const table = GvHV(PL_hintgv);
3727 SV **ptr= hv_fetchs(table, "regcomp", FALSE);
3728 if (ptr && SvIOK(*ptr)) {
3729 const regexp_engine *eng=INT2PTR(regexp_engine*,SvIV(*ptr));
3731 PerlIO_printf(Perl_debug_log, "Using engine %"UVxf"\n",
3734 return CALLREGCOMP_ENG(eng, exp, xend, pm);
3748 RExC_state_t RExC_state;
3749 RExC_state_t * const pRExC_state = &RExC_state;
3750 #ifdef TRIE_STUDY_OPT
3752 RExC_state_t copyRExC_state;
3755 FAIL("NULL regexp argument");
3757 RExC_utf8 = pm->op_pmdynflags & PMdf_CMP_UTF8;
3761 SV *dsv= sv_newmortal();
3762 RE_PV_QUOTED_DECL(s, RExC_utf8,
3763 dsv, RExC_precomp, (xend - exp), 60);
3764 PerlIO_printf(Perl_debug_log, "%sCompiling REx%s %s\n",
3765 PL_colors[4],PL_colors[5],s);
3767 RExC_flags = pm->op_pmflags;
3771 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
3772 RExC_seen_evals = 0;
3775 /* First pass: determine size, legality. */
3782 RExC_emit = &PL_regdummy;
3783 RExC_whilem_seen = 0;
3784 RExC_charnames = NULL;
3786 RExC_paren_names = NULL;
3788 #if 0 /* REGC() is (currently) a NOP at the first pass.
3789 * Clever compilers notice this and complain. --jhi */
3790 REGC((U8)REG_MAGIC, (char*)RExC_emit);
3792 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "Starting first pass (sizing)\n"));
3793 if (reg(pRExC_state, 0, &flags,1) == NULL) {
3794 RExC_precomp = NULL;
3798 PerlIO_printf(Perl_debug_log,
3799 "Required size %"IVdf" nodes\n"
3800 "Starting second pass (creation)\n",
3803 RExC_lastparse=NULL;
3805 /* Small enough for pointer-storage convention?
3806 If extralen==0, this means that we will not need long jumps. */
3807 if (RExC_size >= 0x10000L && RExC_extralen)
3808 RExC_size += RExC_extralen;
3811 if (RExC_whilem_seen > 15)
3812 RExC_whilem_seen = 15;
3814 /* Allocate space and zero-initialize. Note, the two step process
3815 of zeroing when in debug mode, thus anything assigned has to
3816 happen after that */
3817 Newxc(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode),
3820 FAIL("Regexp out of space");
3822 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
3823 Zero(r, sizeof(regexp) + (unsigned)RExC_size * sizeof(regnode), char);
3825 /* initialization begins here */
3826 r->engine= RE_ENGINE_PTR;
3828 r->prelen = xend - exp;
3829 r->precomp = savepvn(RExC_precomp, r->prelen);
3831 #ifdef PERL_OLD_COPY_ON_WRITE
3832 r->saved_copy = NULL;
3834 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
3835 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
3836 r->lastparen = 0; /* mg.c reads this. */
3838 r->substrs = 0; /* Useful during FAIL. */
3839 r->startp = 0; /* Useful during FAIL. */
3843 if (RExC_seen & REG_SEEN_RECURSE) {
3844 Newx(RExC_parens, RExC_npar,regnode *);
3845 SAVEFREEPV(RExC_parens);
3848 /* Useful during FAIL. */
3849 Newxz(r->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
3851 r->offsets[0] = RExC_size;
3853 DEBUG_OFFSETS_r(PerlIO_printf(Perl_debug_log,
3854 "%s %"UVuf" bytes for offset annotations.\n",
3855 r->offsets ? "Got" : "Couldn't get",
3856 (UV)((2*RExC_size+1) * sizeof(U32))));
3860 /* Second pass: emit code. */
3861 RExC_flags = pm->op_pmflags; /* don't let top level (?i) bleed */
3866 RExC_emit_start = r->program;
3867 RExC_emit = r->program;
3868 /* Store the count of eval-groups for security checks: */
3869 RExC_emit->next_off = (RExC_seen_evals > (I32)U16_MAX) ? U16_MAX : (U16)RExC_seen_evals;
3870 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
3872 if (reg(pRExC_state, 0, &flags,1) == NULL)
3875 /* XXXX To minimize changes to RE engine we always allocate
3876 3-units-long substrs field. */
3877 Newx(r->substrs, 1, struct reg_substr_data);
3880 r->minlen = minlen = sawplus = sawopen = 0;
3881 Zero(r->substrs, 1, struct reg_substr_data);
3882 StructCopy(&zero_scan_data, &data, scan_data_t);
3884 #ifdef TRIE_STUDY_OPT
3886 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log,"Restudying\n"));
3887 RExC_state=copyRExC_state;
3888 if (data.last_found) {
3889 SvREFCNT_dec(data.longest_fixed);
3890 SvREFCNT_dec(data.longest_float);
3891 SvREFCNT_dec(data.last_found);
3894 copyRExC_state=RExC_state;
3898 /* Dig out information for optimizations. */
3899 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
3900 pm->op_pmflags = RExC_flags;
3902 r->reganch |= ROPT_UTF8; /* Unicode in it? */
3903 r->regstclass = NULL;
3904 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
3905 r->reganch |= ROPT_NAUGHTY;
3906 scan = r->program + 1; /* First BRANCH. */
3908 /* testing for BRANCH here tells us whether there is "must appear"
3909 data in the pattern. If there is then we can use it for optimisations */
3910 if (!(RExC_seen & REG_TOP_LEVEL_BRANCHES)) { /* Only one top-level choice. */
3912 STRLEN longest_float_length, longest_fixed_length;
3913 struct regnode_charclass_class ch_class; /* pointed to by data */
3915 I32 last_close = 0; /* pointed to by data */
3918 /* Skip introductions and multiplicators >= 1. */
3919 while ((OP(first) == OPEN && (sawopen = 1)) ||
3920 /* An OR of *one* alternative - should not happen now. */
3921 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
3922 /* for now we can't handle lookbehind IFMATCH*/
3923 (OP(first) == IFMATCH && !first->flags) ||
3924 (OP(first) == PLUS) ||
3925 (OP(first) == MINMOD) ||
3926 /* An {n,m} with n>0 */
3927 (PL_regkind[OP(first)] == CURLY && ARG1(first) > 0) )
3930 if (OP(first) == PLUS)
3933 first += regarglen[OP(first)];
3934 if (OP(first) == IFMATCH) {
3935 first = NEXTOPER(first);
3936 first += EXTRA_STEP_2ARGS;
3937 } else /* XXX possible optimisation for /(?=)/ */
3938 first = NEXTOPER(first);
3941 /* Starting-point info. */
3943 DEBUG_PEEP("first:",first,0);
3944 /* Ignore EXACT as we deal with it later. */
3945 if (PL_regkind[OP(first)] == EXACT) {
3946 if (OP(first) == EXACT)
3947 NOOP; /* Empty, get anchored substr later. */
3948 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
3949 r->regstclass = first;
3952 else if (PL_regkind[OP(first)] == TRIE &&
3953 ((reg_trie_data *)r->data->data[ ARG(first) ])->minlen>0)
3956 /* this can happen only on restudy */
3957 if ( OP(first) == TRIE ) {
3958 struct regnode_1 *trieop;
3959 Newxz(trieop,1,struct regnode_1);
3960 StructCopy(first,trieop,struct regnode_1);
3961 trie_op=(regnode *)trieop;
3963 struct regnode_charclass *trieop;
3964 Newxz(trieop,1,struct regnode_charclass);
3965 StructCopy(first,trieop,struct regnode_charclass);
3966 trie_op=(regnode *)trieop;
3969 make_trie_failtable(pRExC_state, (regnode *)first, trie_op, 0);
3970 r->regstclass = trie_op;
3973 else if (strchr((const char*)PL_simple,OP(first)))
3974 r->regstclass = first;
3975 else if (PL_regkind[OP(first)] == BOUND ||
3976 PL_regkind[OP(first)] == NBOUND)
3977 r->regstclass = first;
3978 else if (PL_regkind[OP(first)] == BOL) {
3979 r->reganch |= (OP(first) == MBOL
3981 : (OP(first) == SBOL
3984 first = NEXTOPER(first);
3987 else if (OP(first) == GPOS) {
3988 r->reganch |= ROPT_ANCH_GPOS;
3989 first = NEXTOPER(first);
3992 else if (!sawopen && (OP(first) == STAR &&
3993 PL_regkind[OP(NEXTOPER(first))] == REG_ANY) &&
3994 !(r->reganch & ROPT_ANCH) )
3996 /* turn .* into ^.* with an implied $*=1 */
3998 (OP(NEXTOPER(first)) == REG_ANY)
4001 r->reganch |= type | ROPT_IMPLICIT;
4002 first = NEXTOPER(first);
4005 if (sawplus && (!sawopen || !RExC_sawback)
4006 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
4007 /* x+ must match at the 1st pos of run of x's */
4008 r->reganch |= ROPT_SKIP;
4010 /* Scan is after the zeroth branch, first is atomic matcher. */
4011 #ifdef TRIE_STUDY_OPT
4014 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4015 (IV)(first - scan + 1))
4019 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4020 (IV)(first - scan + 1))
4026 * If there's something expensive in the r.e., find the
4027 * longest literal string that must appear and make it the
4028 * regmust. Resolve ties in favor of later strings, since
4029 * the regstart check works with the beginning of the r.e.
4030 * and avoiding duplication strengthens checking. Not a
4031 * strong reason, but sufficient in the absence of others.
4032 * [Now we resolve ties in favor of the earlier string if
4033 * it happens that c_offset_min has been invalidated, since the
4034 * earlier string may buy us something the later one won't.]
4038 data.longest_fixed = newSVpvs("");
4039 data.longest_float = newSVpvs("");
4040 data.last_found = newSVpvs("");
4041 data.longest = &(data.longest_fixed);
4043 if (!r->regstclass) {
4044 cl_init(pRExC_state, &ch_class);
4045 data.start_class = &ch_class;
4046 stclass_flag = SCF_DO_STCLASS_AND;
4047 } else /* XXXX Check for BOUND? */
4049 data.last_closep = &last_close;
4051 minlen = study_chunk(pRExC_state, &first, &minlen, &fake, scan + RExC_size, /* Up to end */
4052 &data, SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag,0);
4058 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
4059 && data.last_start_min == 0 && data.last_end > 0
4060 && !RExC_seen_zerolen
4061 && (!(RExC_seen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
4062 r->reganch |= ROPT_CHECK_ALL;
4063 scan_commit(pRExC_state, &data,&minlen);
4064 SvREFCNT_dec(data.last_found);
4066 /* Note that code very similar to this but for anchored string
4067 follows immediately below, changes may need to be made to both.
4070 longest_float_length = CHR_SVLEN(data.longest_float);
4071 if (longest_float_length
4072 || (data.flags & SF_FL_BEFORE_EOL
4073 && (!(data.flags & SF_FL_BEFORE_MEOL)
4074 || (RExC_flags & PMf_MULTILINE))))
4078 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
4079 && data.offset_fixed == data.offset_float_min
4080 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
4081 goto remove_float; /* As in (a)+. */
4083 /* copy the information about the longest float from the reg_scan_data
4084 over to the program. */
4085 if (SvUTF8(data.longest_float)) {
4086 r->float_utf8 = data.longest_float;
4087 r->float_substr = NULL;
4089 r->float_substr = data.longest_float;
4090 r->float_utf8 = NULL;
4092 /* float_end_shift is how many chars that must be matched that
4093 follow this item. We calculate it ahead of time as once the
4094 lookbehind offset is added in we lose the ability to correctly
4096 ml = data.minlen_float ? *(data.minlen_float)
4097 : (I32)longest_float_length;
4098 r->float_end_shift = ml - data.offset_float_min
4099 - longest_float_length + (SvTAIL(data.longest_float) != 0)
4100 + data.lookbehind_float;
4101 r->float_min_offset = data.offset_float_min - data.lookbehind_float;
4102 r->float_max_offset = data.offset_float_max;
4103 if (data.offset_float_max < I32_MAX) /* Don't offset infinity */
4104 r->float_max_offset -= data.lookbehind_float;
4106 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
4107 && (!(data.flags & SF_FL_BEFORE_MEOL)
4108 || (RExC_flags & PMf_MULTILINE)));
4109 fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0);
4113 r->float_substr = r->float_utf8 = NULL;
4114 SvREFCNT_dec(data.longest_float);
4115 longest_float_length = 0;
4118 /* Note that code very similar to this but for floating string
4119 is immediately above, changes may need to be made to both.
4122 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
4123 if (longest_fixed_length
4124 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
4125 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4126 || (RExC_flags & PMf_MULTILINE))))
4130 /* copy the information about the longest fixed
4131 from the reg_scan_data over to the program. */
4132 if (SvUTF8(data.longest_fixed)) {
4133 r->anchored_utf8 = data.longest_fixed;
4134 r->anchored_substr = NULL;
4136 r->anchored_substr = data.longest_fixed;
4137 r->anchored_utf8 = NULL;
4139 /* fixed_end_shift is how many chars that must be matched that
4140 follow this item. We calculate it ahead of time as once the
4141 lookbehind offset is added in we lose the ability to correctly
4143 ml = data.minlen_fixed ? *(data.minlen_fixed)
4144 : (I32)longest_fixed_length;
4145 r->anchored_end_shift = ml - data.offset_fixed
4146 - longest_fixed_length + (SvTAIL(data.longest_fixed) != 0)
4147 + data.lookbehind_fixed;
4148 r->anchored_offset = data.offset_fixed - data.lookbehind_fixed;
4150 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
4151 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4152 || (RExC_flags & PMf_MULTILINE)));
4153 fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0);
4156 r->anchored_substr = r->anchored_utf8 = NULL;
4157 SvREFCNT_dec(data.longest_fixed);
4158 longest_fixed_length = 0;
4161 && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == SANY))
4162 r->regstclass = NULL;
4163 if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset)
4165 && !(data.start_class->flags & ANYOF_EOS)
4166 && !cl_is_anything(data.start_class))
4168 const I32 n = add_data(pRExC_state, 1, "f");
4170 Newx(RExC_rx->data->data[n], 1,
4171 struct regnode_charclass_class);
4172 StructCopy(data.start_class,
4173 (struct regnode_charclass_class*)RExC_rx->data->data[n],
4174 struct regnode_charclass_class);
4175 r->regstclass = (regnode*)RExC_rx->data->data[n];
4176 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
4177 DEBUG_COMPILE_r({ SV *sv = sv_newmortal();
4178 regprop(r, sv, (regnode*)data.start_class);
4179 PerlIO_printf(Perl_debug_log,
4180 "synthetic stclass \"%s\".\n",
4181 SvPVX_const(sv));});
4184 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
4185 if (longest_fixed_length > longest_float_length) {
4186 r->check_end_shift = r->anchored_end_shift;
4187 r->check_substr = r->anchored_substr;
4188 r->check_utf8 = r->anchored_utf8;
4189 r->check_offset_min = r->check_offset_max = r->anchored_offset;
4190 if (r->reganch & ROPT_ANCH_SINGLE)
4191 r->reganch |= ROPT_NOSCAN;
4194 r->check_end_shift = r->float_end_shift;
4195 r->check_substr = r->float_substr;
4196 r->check_utf8 = r->float_utf8;
4197 r->check_offset_min = r->float_min_offset;
4198 r->check_offset_max = r->float_max_offset;
4200 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
4201 This should be changed ASAP! */
4202 if ((r->check_substr || r->check_utf8) && !(r->reganch & ROPT_ANCH_GPOS)) {
4203 r->reganch |= RE_USE_INTUIT;
4204 if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8))
4205 r->reganch |= RE_INTUIT_TAIL;
4207 /* XXX Unneeded? dmq (shouldn't as this is handled elsewhere)
4208 if ( (STRLEN)minlen < longest_float_length )
4209 minlen= longest_float_length;
4210 if ( (STRLEN)minlen < longest_fixed_length )
4211 minlen= longest_fixed_length;
4215 /* Several toplevels. Best we can is to set minlen. */
4217 struct regnode_charclass_class ch_class;
4220 DEBUG_COMPILE_r(PerlIO_printf(Perl_debug_log, "\n"));
4222 scan = r->program + 1;
4223 cl_init(pRExC_state, &ch_class);
4224 data.start_class = &ch_class;
4225 data.last_closep = &last_close;
4227 minlen = study_chunk(pRExC_state, &scan, &minlen, &fake, scan + RExC_size,
4228 &data, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS,0);
4232 r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8
4233 = r->float_substr = r->float_utf8 = NULL;
4234 if (!(data.start_class->flags & ANYOF_EOS)
4235 && !cl_is_anything(data.start_class))
4237 const I32 n = add_data(pRExC_state, 1, "f");
4239 Newx(RExC_rx->data->data[n], 1,
4240 struct regnode_charclass_class);
4241 StructCopy(data.start_class,
4242 (struct regnode_charclass_class*)RExC_rx->data->data[n],
4243 struct regnode_charclass_class);
4244 r->regstclass = (regnode*)RExC_rx->data->data[n];
4245 r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */
4246 DEBUG_COMPILE_r({ SV* sv = sv_newmortal();
4247 regprop(r, sv, (regnode*)data.start_class);
4248 PerlIO_printf(Perl_debug_log,
4249 "synthetic stclass \"%s\".\n",
4250 SvPVX_const(sv));});
4254 /* Guard against an embedded (?=) or (?<=) with a longer minlen than
4255 the "real" pattern. */
4256 if (r->minlen < minlen)
4259 if (RExC_seen & REG_SEEN_GPOS)
4260 r->reganch |= ROPT_GPOS_SEEN;
4261 if (RExC_seen & REG_SEEN_LOOKBEHIND)
4262 r->reganch |= ROPT_LOOKBEHIND_SEEN;
4263 if (RExC_seen & REG_SEEN_EVAL)
4264 r->reganch |= ROPT_EVAL_SEEN;
4265 if (RExC_seen & REG_SEEN_CANY)
4266 r->reganch |= ROPT_CANY_SEEN;
4267 if (RExC_paren_names)
4268 r->paren_names = (HV*)SvREFCNT_inc(RExC_paren_names);
4270 r->paren_names = NULL;
4272 Newxz(r->startp, RExC_npar, I32);
4273 Newxz(r->endp, RExC_npar, I32);
4275 DEBUG_r( RX_DEBUG_on(r) );
4277 PerlIO_printf(Perl_debug_log,"Final program:\n");
4280 DEBUG_OFFSETS_r(if (r->offsets) {
4281 const U32 len = r->offsets[0];
4283 GET_RE_DEBUG_FLAGS_DECL;
4284 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)r->offsets[0]);
4285 for (i = 1; i <= len; i++) {
4286 if (r->offsets[i*2-1] || r->offsets[i*2])
4287 PerlIO_printf(Perl_debug_log, "%"UVuf":%"UVuf"[%"UVuf"] ",
4288 (UV)i, (UV)r->offsets[i*2-1], (UV)r->offsets[i*2]);
4290 PerlIO_printf(Perl_debug_log, "\n");
4296 #undef CORE_ONLY_BLOCK
4298 #undef RE_ENGINE_PTR
4300 #ifndef PERL_IN_XSUB_RE
4302 Perl_reg_named_buff_sv(pTHX_ SV* namesv)
4304 I32 parno = 0; /* no match */
4306 const REGEXP * const rx = PM_GETRE(PL_curpm);
4307 if (rx && rx->paren_names) {
4308 HE *he_str = hv_fetch_ent( rx->paren_names, namesv, 0, 0 );
4311 SV* sv_dat=HeVAL(he_str);
4312 I32 *nums=(I32*)SvPVX(sv_dat);
4313 for ( i=0; i<SvIVX(sv_dat); i++ ) {
4314 if ((I32)(rx->lastparen) >= nums[i] &&
4315 rx->endp[nums[i]] != -1)
4328 SV *sv= sv_newmortal();
4329 Perl_sv_setpvf(aTHX_ sv, "%"IVdf,(IV)parno);
4330 gv_paren= Perl_gv_fetchsv(aTHX_ sv, GV_ADD, SVt_PVGV);
4331 return GvSVn(gv_paren);
4336 /* Scans the name of a named buffer from the pattern.
4337 * If flags is REG_RSN_RETURN_NULL returns null.
4338 * If flags is REG_RSN_RETURN_NAME returns an SV* containing the name
4339 * If flags is REG_RSN_RETURN_DATA returns the data SV* corresponding
4340 * to the parsed name as looked up in the RExC_paren_names hash.
4341 * If there is an error throws a vFAIL().. type exception.
4344 #define REG_RSN_RETURN_NULL 0
4345 #define REG_RSN_RETURN_NAME 1
4346 #define REG_RSN_RETURN_DATA 2
4349 S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags) {
4350 char *name_start = RExC_parse;
4353 while( isIDFIRST_uni(utf8n_to_uvchr((U8*)RExC_parse,
4354 RExC_end - RExC_parse, &numlen, UTF8_ALLOW_DEFAULT)))
4356 RExC_parse += numlen;
4359 while( isIDFIRST(*RExC_parse) )
4363 SV* sv_name = sv_2mortal(Perl_newSVpvn(aTHX_ name_start,
4364 (int)(RExC_parse - name_start)));
4367 if ( flags == REG_RSN_RETURN_NAME)
4369 else if (flags==REG_RSN_RETURN_DATA) {
4372 if ( ! sv_name ) /* should not happen*/
4373 Perl_croak(aTHX_ "panic: no svname in reg_scan_name");
4374 if (RExC_paren_names)
4375 he_str = hv_fetch_ent( RExC_paren_names, sv_name, 0, 0 );
4377 sv_dat = HeVAL(he_str);
4379 vFAIL("Reference to nonexistent named group");
4383 Perl_croak(aTHX_ "panic: bad flag in reg_scan_name");
4390 #define DEBUG_PARSE_MSG(funcname) DEBUG_PARSE_r({ \
4391 int rem=(int)(RExC_end - RExC_parse); \
4400 if (RExC_lastparse!=RExC_parse) \
4401 PerlIO_printf(Perl_debug_log," >%.*s%-*s", \
4404 iscut ? "..." : "<" \
4407 PerlIO_printf(Perl_debug_log,"%16s",""); \
4412 num=REG_NODE_NUM(RExC_emit); \
4413 if (RExC_lastnum!=num) \
4414 PerlIO_printf(Perl_debug_log,"|%4d",num); \
4416 PerlIO_printf(Perl_debug_log,"|%4s",""); \
4417 PerlIO_printf(Perl_debug_log,"|%*s%-4s", \
4418 (int)((depth*2)), "", \
4422 RExC_lastparse=RExC_parse; \
4427 #define DEBUG_PARSE(funcname) DEBUG_PARSE_r({ \
4428 DEBUG_PARSE_MSG((funcname)); \
4429 PerlIO_printf(Perl_debug_log,"%4s","\n"); \
4431 #define DEBUG_PARSE_FMT(funcname,fmt,args) DEBUG_PARSE_r({ \
4432 DEBUG_PARSE_MSG((funcname)); \
4433 PerlIO_printf(Perl_debug_log,fmt "\n",args); \
4436 - reg - regular expression, i.e. main body or parenthesized thing
4438 * Caller must absorb opening parenthesis.
4440 * Combining parenthesis handling with the base level of regular expression
4441 * is a trifle forced, but the need to tie the tails of the branches to what
4442 * follows makes it hard to avoid.
4444 #define REGTAIL(x,y,z) regtail((x),(y),(z),depth+1)
4446 #define REGTAIL_STUDY(x,y,z) regtail_study((x),(y),(z),depth+1)
4448 #define REGTAIL_STUDY(x,y,z) regtail((x),(y),(z),depth+1)
4452 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp,U32 depth)
4453 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
4456 register regnode *ret; /* Will be the head of the group. */
4457 register regnode *br;
4458 register regnode *lastbr;
4459 register regnode *ender = NULL;
4460 register I32 parno = 0;
4462 const I32 oregflags = RExC_flags;
4463 bool have_branch = 0;
4466 /* for (?g), (?gc), and (?o) warnings; warning
4467 about (?c) will warn about (?g) -- japhy */
4469 #define WASTED_O 0x01
4470 #define WASTED_G 0x02
4471 #define WASTED_C 0x04
4472 #define WASTED_GC (0x02|0x04)
4473 I32 wastedflags = 0x00;
4475 char * parse_start = RExC_parse; /* MJD */
4476 char * const oregcomp_parse = RExC_parse;
4478 GET_RE_DEBUG_FLAGS_DECL;
4479 DEBUG_PARSE("reg ");
4482 *flagp = 0; /* Tentatively. */
4485 /* Make an OPEN node, if parenthesized. */
4487 if (*RExC_parse == '?') { /* (?...) */
4488 U32 posflags = 0, negflags = 0;
4489 U32 *flagsp = &posflags;
4490 bool is_logical = 0;
4491 const char * const seqstart = RExC_parse;
4494 paren = *RExC_parse++;
4495 ret = NULL; /* For look-ahead/behind. */
4498 case '<': /* (?<...) */
4499 if (*RExC_parse == '!')
4501 else if (*RExC_parse != '=')
4506 case '\'': /* (?'...') */
4507 name_start= RExC_parse;
4508 svname = reg_scan_name(pRExC_state,
4509 SIZE_ONLY ? /* reverse test from the others */
4510 REG_RSN_RETURN_NAME :
4511 REG_RSN_RETURN_NULL);
4512 if (RExC_parse == name_start)
4514 if (*RExC_parse != paren)
4515 vFAIL2("Sequence (?%c... not terminated",
4516 paren=='>' ? '<' : paren);
4520 if (!svname) /* shouldnt happen */
4522 "panic: reg_scan_name returned NULL");
4523 if (!RExC_paren_names) {
4524 RExC_paren_names= newHV();
4525 sv_2mortal((SV*)RExC_paren_names);
4527 he_str = hv_fetch_ent( RExC_paren_names, svname, 1, 0 );
4529 sv_dat = HeVAL(he_str);
4531 /* croak baby croak */
4533 "panic: paren_name hash element allocation failed");
4534 } else if ( SvPOK(sv_dat) ) {
4535 IV count=SvIV(sv_dat);
4536 I32 *pv=(I32*)SvGROW(sv_dat,SvCUR(sv_dat)+sizeof(I32)+1);
4537 SvCUR_set(sv_dat,SvCUR(sv_dat)+sizeof(I32));
4538 pv[count]=RExC_npar;
4541 (void)SvUPGRADE(sv_dat,SVt_PVNV);
4542 sv_setpvn(sv_dat, (char *)&(RExC_npar), sizeof(I32));
4547 /*sv_dump(sv_dat);*/
4549 nextchar(pRExC_state);
4551 goto capturing_parens;
4553 RExC_seen |= REG_SEEN_LOOKBEHIND;
4555 case '=': /* (?=...) */
4556 case '!': /* (?!...) */
4557 RExC_seen_zerolen++;
4558 case ':': /* (?:...) */
4559 case '>': /* (?>...) */
4561 case '$': /* (?$...) */
4562 case '@': /* (?@...) */
4563 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
4565 case '#': /* (?#...) */
4566 while (*RExC_parse && *RExC_parse != ')')
4568 if (*RExC_parse != ')')
4569 FAIL("Sequence (?#... not terminated");
4570 nextchar(pRExC_state);
4573 case '0' : /* (?0) */
4574 case 'R' : /* (?R) */
4575 if (*RExC_parse != ')')
4576 FAIL("Sequence (?R) not terminated");
4577 reg_node(pRExC_state, SRECURSE);
4578 break; /* (?PARNO) */
4579 { /* named and numeric backreferences */
4582 case '&': /* (?&NAME) */
4583 parse_start = RExC_parse - 1;
4585 SV *sv_dat = reg_scan_name(pRExC_state,
4586 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
4587 num = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
4589 goto gen_recurse_regop;
4591 case '1': case '2': case '3': case '4': /* (?1) */
4592 case '5': case '6': case '7': case '8': case '9':
4594 num = atoi(RExC_parse);
4595 parse_start = RExC_parse - 1; /* MJD */
4596 while (isDIGIT(*RExC_parse))
4598 if (*RExC_parse!=')')
4599 vFAIL("Expecting close bracket");
4602 ret = reganode(pRExC_state, RECURSE, num);
4604 if (num > (I32)RExC_rx->nparens) {
4606 vFAIL("Reference to nonexistent group");
4610 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
4611 "Recurse #%"UVuf" to %"IVdf"\n", (UV)ARG(ret), (IV)ARG2L(ret)));
4615 RExC_seen |= REG_SEEN_RECURSE;
4616 Set_Node_Length(ret, 1 + regarglen[OP(ret)]); /* MJD */
4617 Set_Node_Offset(ret, parse_start); /* MJD */
4619 nextchar(pRExC_state);
4621 } /* named and numeric backreferences */
4624 case 'p': /* (?p...) */
4625 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
4626 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
4628 case '?': /* (??...) */
4630 if (*RExC_parse != '{')
4632 paren = *RExC_parse++;
4634 case '{': /* (?{...}) */
4636 I32 count = 1, n = 0;
4638 char *s = RExC_parse;
4640 RExC_seen_zerolen++;
4641 RExC_seen |= REG_SEEN_EVAL;
4642 while (count && (c = *RExC_parse)) {
4653 if (*RExC_parse != ')') {
4655 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
4659 OP_4tree *sop, *rop;
4660 SV * const sv = newSVpvn(s, RExC_parse - 1 - s);
4663 Perl_save_re_context(aTHX);
4664 rop = sv_compile_2op(sv, &sop, "re", &pad);
4665 sop->op_private |= OPpREFCOUNTED;
4666 /* re_dup will OpREFCNT_inc */
4667 OpREFCNT_set(sop, 1);
4670 n = add_data(pRExC_state, 3, "nop");
4671 RExC_rx->data->data[n] = (void*)rop;
4672 RExC_rx->data->data[n+1] = (void*)sop;
4673 RExC_rx->data->data[n+2] = (void*)pad;
4676 else { /* First pass */
4677 if (PL_reginterp_cnt < ++RExC_seen_evals
4679 /* No compiled RE interpolated, has runtime
4680 components ===> unsafe. */
4681 FAIL("Eval-group not allowed at runtime, use re 'eval'");
4682 if (PL_tainting && PL_tainted)
4683 FAIL("Eval-group in insecure regular expression");
4684 #if PERL_VERSION > 8
4685 if (IN_PERL_COMPILETIME)
4690 nextchar(pRExC_state);
4692 ret = reg_node(pRExC_state, LOGICAL);
4695 REGTAIL(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
4696 /* deal with the length of this later - MJD */
4699 ret = reganode(pRExC_state, EVAL, n);
4700 Set_Node_Length(ret, RExC_parse - parse_start + 1);
4701 Set_Node_Offset(ret, parse_start);
4704 case '(': /* (?(?{...})...) and (?(?=...)...) */
4707 if (RExC_parse[0] == '?') { /* (?(?...)) */
4708 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
4709 || RExC_parse[1] == '<'
4710 || RExC_parse[1] == '{') { /* Lookahead or eval. */
4713 ret = reg_node(pRExC_state, LOGICAL);
4716 REGTAIL(pRExC_state, ret, reg(pRExC_state, 1, &flag,depth+1));
4720 else if ( RExC_parse[0] == '<' /* (?(<NAME>)...) */
4721 || RExC_parse[0] == '\'' ) /* (?('NAME')...) */
4723 char ch = RExC_parse[0] == '<' ? '>' : '\'';
4724 char *name_start= RExC_parse++;
4726 SV *sv_dat=reg_scan_name(pRExC_state,
4727 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
4728 if (RExC_parse == name_start || *RExC_parse != ch)
4729 vFAIL2("Sequence (?(%c... not terminated",
4730 (ch == '>' ? '<' : ch));
4733 num = add_data( pRExC_state, 1, "S" );
4734 RExC_rx->data->data[num]=(void*)sv_dat;
4735 SvREFCNT_inc(sv_dat);
4737 ret = reganode(pRExC_state,NGROUPP,num);
4738 goto insert_if_check_paren;
4740 else if (RExC_parse[0] == 'D' &&
4741 RExC_parse[1] == 'E' &&
4742 RExC_parse[2] == 'F' &&
4743 RExC_parse[3] == 'I' &&
4744 RExC_parse[4] == 'N' &&
4745 RExC_parse[5] == 'E')
4747 ret = reganode(pRExC_state,DEFINEP,0);
4750 goto insert_if_check_paren;
4752 else if (RExC_parse[0] == 'R') {
4755 if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
4756 parno = atoi(RExC_parse++);
4757 while (isDIGIT(*RExC_parse))
4759 } else if (RExC_parse[0] == '&') {
4762 sv_dat = reg_scan_name(pRExC_state,
4763 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
4764 parno = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
4766 ret = reganode(pRExC_state,RECURSEP,parno);
4767 goto insert_if_check_paren;
4769 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
4772 parno = atoi(RExC_parse++);
4774 while (isDIGIT(*RExC_parse))
4776 ret = reganode(pRExC_state, GROUPP, parno);
4778 insert_if_check_paren:
4779 if ((c = *nextchar(pRExC_state)) != ')')
4780 vFAIL("Switch condition not recognized");
4782 REGTAIL(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
4783 br = regbranch(pRExC_state, &flags, 1,depth+1);
4785 br = reganode(pRExC_state, LONGJMP, 0);
4787 REGTAIL(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
4788 c = *nextchar(pRExC_state);
4793 vFAIL("(?(DEFINE)....) does not allow branches");
4794 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
4795 regbranch(pRExC_state, &flags, 1,depth+1);
4796 REGTAIL(pRExC_state, ret, lastbr);
4799 c = *nextchar(pRExC_state);
4804 vFAIL("Switch (?(condition)... contains too many branches");
4805 ender = reg_node(pRExC_state, TAIL);
4806 REGTAIL(pRExC_state, br, ender);
4808 REGTAIL(pRExC_state, lastbr, ender);
4809 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
4812 REGTAIL(pRExC_state, ret, ender);
4816 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
4820 RExC_parse--; /* for vFAIL to print correctly */
4821 vFAIL("Sequence (? incomplete");
4825 parse_flags: /* (?i) */
4826 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
4827 /* (?g), (?gc) and (?o) are useless here
4828 and must be globally applied -- japhy */
4830 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
4831 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
4832 const I32 wflagbit = *RExC_parse == 'o' ? WASTED_O : WASTED_G;
4833 if (! (wastedflags & wflagbit) ) {
4834 wastedflags |= wflagbit;
4837 "Useless (%s%c) - %suse /%c modifier",
4838 flagsp == &negflags ? "?-" : "?",
4840 flagsp == &negflags ? "don't " : "",
4846 else if (*RExC_parse == 'c') {
4847 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
4848 if (! (wastedflags & WASTED_C) ) {
4849 wastedflags |= WASTED_GC;
4852 "Useless (%sc) - %suse /gc modifier",
4853 flagsp == &negflags ? "?-" : "?",
4854 flagsp == &negflags ? "don't " : ""
4859 else { pmflag(flagsp, *RExC_parse); }
4863 if (*RExC_parse == '-') {
4865 wastedflags = 0; /* reset so (?g-c) warns twice */
4869 RExC_flags |= posflags;
4870 RExC_flags &= ~negflags;
4871 if (*RExC_parse == ':') {
4877 if (*RExC_parse != ')') {
4879 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
4881 nextchar(pRExC_state);
4890 ret = reganode(pRExC_state, OPEN, parno);
4891 if (!SIZE_ONLY && RExC_seen & REG_SEEN_RECURSE) {
4892 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
4893 "Setting paren #%"IVdf" to %d\n", (IV)parno, REG_NODE_NUM(ret)));
4894 RExC_parens[parno-1]= ret;
4897 Set_Node_Length(ret, 1); /* MJD */
4898 Set_Node_Offset(ret, RExC_parse); /* MJD */
4905 /* Pick up the branches, linking them together. */
4906 parse_start = RExC_parse; /* MJD */
4907 br = regbranch(pRExC_state, &flags, 1,depth+1);
4908 /* branch_len = (paren != 0); */
4912 if (*RExC_parse == '|') {
4913 if (!SIZE_ONLY && RExC_extralen) {
4914 reginsert(pRExC_state, BRANCHJ, br, depth+1);
4917 reginsert(pRExC_state, BRANCH, br, depth+1);
4918 Set_Node_Length(br, paren != 0);
4919 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
4923 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
4925 else if (paren == ':') {
4926 *flagp |= flags&SIMPLE;
4928 if (is_open) { /* Starts with OPEN. */
4929 REGTAIL(pRExC_state, ret, br); /* OPEN -> first. */
4931 else if (paren != '?') /* Not Conditional */
4933 *flagp |= flags & (SPSTART | HASWIDTH);
4935 while (*RExC_parse == '|') {
4936 if (!SIZE_ONLY && RExC_extralen) {
4937 ender = reganode(pRExC_state, LONGJMP,0);
4938 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
4941 RExC_extralen += 2; /* Account for LONGJMP. */
4942 nextchar(pRExC_state);
4943 br = regbranch(pRExC_state, &flags, 0, depth+1);
4947 REGTAIL(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
4951 *flagp |= flags&SPSTART;
4954 if (have_branch || paren != ':') {
4955 /* Make a closing node, and hook it on the end. */
4958 ender = reg_node(pRExC_state, TAIL);
4961 ender = reganode(pRExC_state, CLOSE, parno);
4962 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
4963 Set_Node_Length(ender,1); /* MJD */
4969 *flagp &= ~HASWIDTH;
4972 ender = reg_node(pRExC_state, SUCCEED);
4975 ender = reg_node(pRExC_state, END);
4978 REGTAIL(pRExC_state, lastbr, ender);
4980 if (have_branch && !SIZE_ONLY) {
4982 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
4984 /* Hook the tails of the branches to the closing node. */
4985 for (br = ret; br; br = regnext(br)) {
4986 const U8 op = PL_regkind[OP(br)];
4988 REGTAIL_STUDY(pRExC_state, NEXTOPER(br), ender);
4990 else if (op == BRANCHJ) {
4991 REGTAIL_STUDY(pRExC_state, NEXTOPER(NEXTOPER(br)), ender);
4999 static const char parens[] = "=!<,>";
5001 if (paren && (p = strchr(parens, paren))) {
5002 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
5003 int flag = (p - parens) > 1;
5006 node = SUSPEND, flag = 0;
5007 reginsert(pRExC_state, node,ret, depth+1);
5008 Set_Node_Cur_Length(ret);
5009 Set_Node_Offset(ret, parse_start + 1);
5011 REGTAIL_STUDY(pRExC_state, ret, reg_node(pRExC_state, TAIL));
5015 /* Check for proper termination. */
5017 RExC_flags = oregflags;
5018 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
5019 RExC_parse = oregcomp_parse;
5020 vFAIL("Unmatched (");
5023 else if (!paren && RExC_parse < RExC_end) {
5024 if (*RExC_parse == ')') {
5026 vFAIL("Unmatched )");
5029 FAIL("Junk on end of regexp"); /* "Can't happen". */
5037 - regbranch - one alternative of an | operator
5039 * Implements the concatenation operator.
5042 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth)
5045 register regnode *ret;
5046 register regnode *chain = NULL;
5047 register regnode *latest;
5048 I32 flags = 0, c = 0;
5049 GET_RE_DEBUG_FLAGS_DECL;
5050 DEBUG_PARSE("brnc");
5054 if (!SIZE_ONLY && RExC_extralen)
5055 ret = reganode(pRExC_state, BRANCHJ,0);
5057 ret = reg_node(pRExC_state, BRANCH);
5058 Set_Node_Length(ret, 1);
5062 if (!first && SIZE_ONLY)
5063 RExC_extralen += 1; /* BRANCHJ */
5065 *flagp = WORST; /* Tentatively. */
5068 nextchar(pRExC_state);
5069 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
5071 latest = regpiece(pRExC_state, &flags,depth+1);
5072 if (latest == NULL) {
5073 if (flags & TRYAGAIN)
5077 else if (ret == NULL)
5079 *flagp |= flags&HASWIDTH;
5080 if (chain == NULL) /* First piece. */
5081 *flagp |= flags&SPSTART;
5084 REGTAIL(pRExC_state, chain, latest);
5089 if (chain == NULL) { /* Loop ran zero times. */
5090 chain = reg_node(pRExC_state, NOTHING);
5095 *flagp |= flags&SIMPLE;
5102 - regpiece - something followed by possible [*+?]
5104 * Note that the branching code sequences used for ? and the general cases
5105 * of * and + are somewhat optimized: they use the same NOTHING node as
5106 * both the endmarker for their branch list and the body of the last branch.
5107 * It might seem that this node could be dispensed with entirely, but the
5108 * endmarker role is not redundant.
5111 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
5114 register regnode *ret;
5116 register char *next;
5118 const char * const origparse = RExC_parse;
5120 I32 max = REG_INFTY;
5122 const char *maxpos = NULL;
5123 GET_RE_DEBUG_FLAGS_DECL;
5124 DEBUG_PARSE("piec");
5126 ret = regatom(pRExC_state, &flags,depth+1);
5128 if (flags & TRYAGAIN)
5135 if (op == '{' && regcurly(RExC_parse)) {
5137 parse_start = RExC_parse; /* MJD */
5138 next = RExC_parse + 1;
5139 while (isDIGIT(*next) || *next == ',') {
5148 if (*next == '}') { /* got one */
5152 min = atoi(RExC_parse);
5156 maxpos = RExC_parse;
5158 if (!max && *maxpos != '0')
5159 max = REG_INFTY; /* meaning "infinity" */
5160 else if (max >= REG_INFTY)
5161 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
5163 nextchar(pRExC_state);
5166 if ((flags&SIMPLE)) {
5167 RExC_naughty += 2 + RExC_naughty / 2;
5168 reginsert(pRExC_state, CURLY, ret, depth+1);
5169 Set_Node_Offset(ret, parse_start+1); /* MJD */
5170 Set_Node_Cur_Length(ret);
5173 regnode * const w = reg_node(pRExC_state, WHILEM);
5176 REGTAIL(pRExC_state, ret, w);
5177 if (!SIZE_ONLY && RExC_extralen) {
5178 reginsert(pRExC_state, LONGJMP,ret, depth+1);
5179 reginsert(pRExC_state, NOTHING,ret, depth+1);
5180 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
5182 reginsert(pRExC_state, CURLYX,ret, depth+1);
5184 Set_Node_Offset(ret, parse_start+1);
5185 Set_Node_Length(ret,
5186 op == '{' ? (RExC_parse - parse_start) : 1);
5188 if (!SIZE_ONLY && RExC_extralen)
5189 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
5190 REGTAIL(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
5192 RExC_whilem_seen++, RExC_extralen += 3;
5193 RExC_naughty += 4 + RExC_naughty; /* compound interest */
5201 if (max && max < min)
5202 vFAIL("Can't do {n,m} with n > m");
5204 ARG1_SET(ret, (U16)min);
5205 ARG2_SET(ret, (U16)max);
5217 #if 0 /* Now runtime fix should be reliable. */
5219 /* if this is reinstated, don't forget to put this back into perldiag:
5221 =item Regexp *+ operand could be empty at {#} in regex m/%s/
5223 (F) The part of the regexp subject to either the * or + quantifier
5224 could match an empty string. The {#} shows in the regular
5225 expression about where the problem was discovered.
5229 if (!(flags&HASWIDTH) && op != '?')
5230 vFAIL("Regexp *+ operand could be empty");
5233 parse_start = RExC_parse;
5234 nextchar(pRExC_state);
5236 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
5238 if (op == '*' && (flags&SIMPLE)) {
5239 reginsert(pRExC_state, STAR, ret, depth+1);
5243 else if (op == '*') {
5247 else if (op == '+' && (flags&SIMPLE)) {
5248 reginsert(pRExC_state, PLUS, ret, depth+1);
5252 else if (op == '+') {
5256 else if (op == '?') {
5261 if (!SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3 && ckWARN(WARN_REGEXP)) {
5263 "%.*s matches null string many times",
5264 (int)(RExC_parse >= origparse ? RExC_parse - origparse : 0),
5268 if (RExC_parse < RExC_end && *RExC_parse == '?') {
5269 nextchar(pRExC_state);
5270 reginsert(pRExC_state, MINMOD, ret, depth+1);
5271 REGTAIL(pRExC_state, ret, ret + NODE_STEP_REGNODE);
5273 #ifndef REG_ALLOW_MINMOD_SUSPEND
5276 if (RExC_parse < RExC_end && *RExC_parse == '+') {
5278 nextchar(pRExC_state);
5279 ender = reg_node(pRExC_state, SUCCEED);
5280 REGTAIL(pRExC_state, ret, ender);
5281 reginsert(pRExC_state, SUSPEND, ret, depth+1);
5283 ender = reg_node(pRExC_state, TAIL);
5284 REGTAIL(pRExC_state, ret, ender);
5288 if (RExC_parse < RExC_end && ISMULT2(RExC_parse)) {
5290 vFAIL("Nested quantifiers");
5297 /* reg_namedseq(pRExC_state,UVp)
5299 This is expected to be called by a parser routine that has
5300 recognized'\N' and needs to handle the rest. RExC_parse is
5301 expected to point at the first char following the N at the time
5304 If valuep is non-null then it is assumed that we are parsing inside
5305 of a charclass definition and the first codepoint in the resolved
5306 string is returned via *valuep and the routine will return NULL.
5307 In this mode if a multichar string is returned from the charnames
5308 handler a warning will be issued, and only the first char in the
5309 sequence will be examined. If the string returned is zero length
5310 then the value of *valuep is undefined and NON-NULL will
5311 be returned to indicate failure. (This will NOT be a valid pointer
5314 If value is null then it is assumed that we are parsing normal text
5315 and inserts a new EXACT node into the program containing the resolved
5316 string and returns a pointer to the new node. If the string is
5317 zerolength a NOTHING node is emitted.
5319 On success RExC_parse is set to the char following the endbrace.
5320 Parsing failures will generate a fatal errorvia vFAIL(...)
5322 NOTE: We cache all results from the charnames handler locally in
5323 the RExC_charnames hash (created on first use) to prevent a charnames
5324 handler from playing silly-buggers and returning a short string and
5325 then a long string for a given pattern. Since the regexp program
5326 size is calculated during an initial parse this would result
5327 in a buffer overrun so we cache to prevent the charname result from
5328 changing during the course of the parse.
5332 S_reg_namedseq(pTHX_ RExC_state_t *pRExC_state, UV *valuep)
5334 char * name; /* start of the content of the name */
5335 char * endbrace; /* endbrace following the name */
5338 STRLEN len; /* this has various purposes throughout the code */
5339 bool cached = 0; /* if this is true then we shouldn't refcount dev sv_str */
5340 regnode *ret = NULL;
5342 if (*RExC_parse != '{') {
5343 vFAIL("Missing braces on \\N{}");
5345 name = RExC_parse+1;
5346 endbrace = strchr(RExC_parse, '}');
5349 vFAIL("Missing right brace on \\N{}");
5351 RExC_parse = endbrace + 1;
5354 /* RExC_parse points at the beginning brace,
5355 endbrace points at the last */
5356 if ( name[0]=='U' && name[1]=='+' ) {
5357 /* its a "unicode hex" notation {U+89AB} */
5358 I32 fl = PERL_SCAN_ALLOW_UNDERSCORES
5359 | PERL_SCAN_DISALLOW_PREFIX
5360 | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0);
5362 len = (STRLEN)(endbrace - name - 2);
5363 cp = grok_hex(name + 2, &len, &fl, NULL);
5364 if ( len != (STRLEN)(endbrace - name - 2) ) {
5373 sv_str= Perl_newSVpvf_nocontext("%c",(int)cp);
5375 /* fetch the charnames handler for this scope */
5376 HV * const table = GvHV(PL_hintgv);
5378 hv_fetchs(table, "charnames", FALSE) :
5380 SV *cv= cvp ? *cvp : NULL;
5383 /* create an SV with the name as argument */
5384 sv_name = newSVpvn(name, endbrace - name);
5386 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5387 vFAIL2("Constant(\\N{%s}) unknown: "
5388 "(possibly a missing \"use charnames ...\")",
5391 if (!cvp || !SvOK(*cvp)) { /* when $^H{charnames} = undef; */
5392 vFAIL2("Constant(\\N{%s}): "
5393 "$^H{charnames} is not defined",SvPVX(sv_name));
5398 if (!RExC_charnames) {
5399 /* make sure our cache is allocated */
5400 RExC_charnames = newHV();
5401 sv_2mortal((SV*)RExC_charnames);
5403 /* see if we have looked this one up before */
5404 he_str = hv_fetch_ent( RExC_charnames, sv_name, 0, 0 );
5406 sv_str = HeVAL(he_str);
5419 count= call_sv(cv, G_SCALAR);
5421 if (count == 1) { /* XXXX is this right? dmq */
5423 SvREFCNT_inc_simple_void(sv_str);
5431 if ( !sv_str || !SvOK(sv_str) ) {
5432 vFAIL2("Constant(\\N{%s}): Call to &{$^H{charnames}} "
5433 "did not return a defined value",SvPVX(sv_name));
5435 if (hv_store_ent( RExC_charnames, sv_name, sv_str, 0))
5440 char *p = SvPV(sv_str, len);
5443 if ( SvUTF8(sv_str) ) {
5444 *valuep = utf8_to_uvchr((U8*)p, &numlen);
5448 We have to turn on utf8 for high bit chars otherwise
5449 we get failures with
5451 "ss" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5452 "SS" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5454 This is different from what \x{} would do with the same
5455 codepoint, where the condition is > 0xFF.
5462 /* warn if we havent used the whole string? */
5464 if (numlen<len && SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5466 "Ignoring excess chars from \\N{%s} in character class",
5470 } else if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5472 "Ignoring zero length \\N{%s} in character class",
5477 SvREFCNT_dec(sv_name);
5479 SvREFCNT_dec(sv_str);
5480 return len ? NULL : (regnode *)&len;
5481 } else if(SvCUR(sv_str)) {
5486 char * parse_start = name-3; /* needed for the offsets */
5487 GET_RE_DEBUG_FLAGS_DECL; /* needed for the offsets */
5489 ret = reg_node(pRExC_state,
5490 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
5493 if ( RExC_utf8 && !SvUTF8(sv_str) ) {
5494 sv_utf8_upgrade(sv_str);
5495 } else if ( !RExC_utf8 && SvUTF8(sv_str) ) {
5499 p = SvPV(sv_str, len);
5501 /* len is the length written, charlen is the size the char read */
5502 for ( len = 0; p < pend; p += charlen ) {
5504 UV uvc = utf8_to_uvchr((U8*)p, &charlen);
5506 STRLEN foldlen,numlen;
5507 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
5508 uvc = toFOLD_uni(uvc, tmpbuf, &foldlen);
5509 /* Emit all the Unicode characters. */
5511 for (foldbuf = tmpbuf;
5515 uvc = utf8_to_uvchr(foldbuf, &numlen);
5517 const STRLEN unilen = reguni(pRExC_state, uvc, s);
5520 /* In EBCDIC the numlen
5521 * and unilen can differ. */
5523 if (numlen >= foldlen)
5527 break; /* "Can't happen." */
5530 const STRLEN unilen = reguni(pRExC_state, uvc, s);
5542 RExC_size += STR_SZ(len);
5545 RExC_emit += STR_SZ(len);
5547 Set_Node_Cur_Length(ret); /* MJD */
5549 nextchar(pRExC_state);
5551 ret = reg_node(pRExC_state,NOTHING);
5554 SvREFCNT_dec(sv_str);
5557 SvREFCNT_dec(sv_name);
5566 - regatom - the lowest level
5568 * Optimization: gobbles an entire sequence of ordinary characters so that
5569 * it can turn them into a single node, which is smaller to store and
5570 * faster to run. Backslashed characters are exceptions, each becoming a
5571 * separate node; the code is simpler that way and it's not worth fixing.
5573 * [Yes, it is worth fixing, some scripts can run twice the speed.]
5574 * [It looks like its ok, as in S_study_chunk we merge adjacent EXACT nodes]
5577 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
5580 register regnode *ret = NULL;
5582 char *parse_start = RExC_parse;
5583 GET_RE_DEBUG_FLAGS_DECL;
5584 DEBUG_PARSE("atom");
5585 *flagp = WORST; /* Tentatively. */
5588 switch (*RExC_parse) {
5590 RExC_seen_zerolen++;
5591 nextchar(pRExC_state);
5592 if (RExC_flags & PMf_MULTILINE)
5593 ret = reg_node(pRExC_state, MBOL);
5594 else if (RExC_flags & PMf_SINGLELINE)
5595 ret = reg_node(pRExC_state, SBOL);
5597 ret = reg_node(pRExC_state, BOL);
5598 Set_Node_Length(ret, 1); /* MJD */
5601 nextchar(pRExC_state);
5603 RExC_seen_zerolen++;
5604 if (RExC_flags & PMf_MULTILINE)
5605 ret = reg_node(pRExC_state, MEOL);
5606 else if (RExC_flags & PMf_SINGLELINE)
5607 ret = reg_node(pRExC_state, SEOL);
5609 ret = reg_node(pRExC_state, EOL);
5610 Set_Node_Length(ret, 1); /* MJD */
5613 nextchar(pRExC_state);
5614 if (RExC_flags & PMf_SINGLELINE)
5615 ret = reg_node(pRExC_state, SANY);
5617 ret = reg_node(pRExC_state, REG_ANY);
5618 *flagp |= HASWIDTH|SIMPLE;
5620 Set_Node_Length(ret, 1); /* MJD */
5624 char * const oregcomp_parse = ++RExC_parse;
5625 ret = regclass(pRExC_state,depth+1);
5626 if (*RExC_parse != ']') {
5627 RExC_parse = oregcomp_parse;
5628 vFAIL("Unmatched [");
5630 nextchar(pRExC_state);
5631 *flagp |= HASWIDTH|SIMPLE;
5632 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
5636 nextchar(pRExC_state);
5637 ret = reg(pRExC_state, 1, &flags,depth+1);
5639 if (flags & TRYAGAIN) {
5640 if (RExC_parse == RExC_end) {
5641 /* Make parent create an empty node if needed. */
5649 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
5653 if (flags & TRYAGAIN) {
5657 vFAIL("Internal urp");
5658 /* Supposed to be caught earlier. */
5661 if (!regcurly(RExC_parse)) {
5670 vFAIL("Quantifier follows nothing");
5673 switch (*++RExC_parse) {
5675 RExC_seen_zerolen++;
5676 ret = reg_node(pRExC_state, SBOL);
5678 nextchar(pRExC_state);
5679 Set_Node_Length(ret, 2); /* MJD */
5682 ret = reg_node(pRExC_state, GPOS);
5683 RExC_seen |= REG_SEEN_GPOS;
5685 nextchar(pRExC_state);
5686 Set_Node_Length(ret, 2); /* MJD */
5689 ret = reg_node(pRExC_state, SEOL);
5691 RExC_seen_zerolen++; /* Do not optimize RE away */
5692 nextchar(pRExC_state);
5695 ret = reg_node(pRExC_state, EOS);
5697 RExC_seen_zerolen++; /* Do not optimize RE away */
5698 nextchar(pRExC_state);
5699 Set_Node_Length(ret, 2); /* MJD */
5702 ret = reg_node(pRExC_state, CANY);
5703 RExC_seen |= REG_SEEN_CANY;
5704 *flagp |= HASWIDTH|SIMPLE;
5705 nextchar(pRExC_state);
5706 Set_Node_Length(ret, 2); /* MJD */
5709 ret = reg_node(pRExC_state, CLUMP);
5711 nextchar(pRExC_state);
5712 Set_Node_Length(ret, 2); /* MJD */
5715 ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM));
5716 *flagp |= HASWIDTH|SIMPLE;
5717 nextchar(pRExC_state);
5718 Set_Node_Length(ret, 2); /* MJD */
5721 ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM));
5722 *flagp |= HASWIDTH|SIMPLE;
5723 nextchar(pRExC_state);
5724 Set_Node_Length(ret, 2); /* MJD */
5727 RExC_seen_zerolen++;
5728 RExC_seen |= REG_SEEN_LOOKBEHIND;
5729 ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND));
5731 nextchar(pRExC_state);
5732 Set_Node_Length(ret, 2); /* MJD */
5735 RExC_seen_zerolen++;
5736 RExC_seen |= REG_SEEN_LOOKBEHIND;
5737 ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND));
5739 nextchar(pRExC_state);
5740 Set_Node_Length(ret, 2); /* MJD */
5743 ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE));
5744 *flagp |= HASWIDTH|SIMPLE;
5745 nextchar(pRExC_state);
5746 Set_Node_Length(ret, 2); /* MJD */
5749 ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE));
5750 *flagp |= HASWIDTH|SIMPLE;
5751 nextchar(pRExC_state);
5752 Set_Node_Length(ret, 2); /* MJD */
5755 ret = reg_node(pRExC_state, DIGIT);
5756 *flagp |= HASWIDTH|SIMPLE;
5757 nextchar(pRExC_state);
5758 Set_Node_Length(ret, 2); /* MJD */
5761 ret = reg_node(pRExC_state, NDIGIT);
5762 *flagp |= HASWIDTH|SIMPLE;
5763 nextchar(pRExC_state);
5764 Set_Node_Length(ret, 2); /* MJD */
5769 char* const oldregxend = RExC_end;
5770 char* parse_start = RExC_parse - 2;
5772 if (RExC_parse[1] == '{') {
5773 /* a lovely hack--pretend we saw [\pX] instead */
5774 RExC_end = strchr(RExC_parse, '}');
5776 const U8 c = (U8)*RExC_parse;
5778 RExC_end = oldregxend;
5779 vFAIL2("Missing right brace on \\%c{}", c);
5784 RExC_end = RExC_parse + 2;
5785 if (RExC_end > oldregxend)
5786 RExC_end = oldregxend;
5790 ret = regclass(pRExC_state,depth+1);
5792 RExC_end = oldregxend;
5795 Set_Node_Offset(ret, parse_start + 2);
5796 Set_Node_Cur_Length(ret);
5797 nextchar(pRExC_state);
5798 *flagp |= HASWIDTH|SIMPLE;
5802 /* Handle \N{NAME} here and not below because it can be
5803 multicharacter. join_exact() will join them up later on.
5804 Also this makes sure that things like /\N{BLAH}+/ and
5805 \N{BLAH} being multi char Just Happen. dmq*/
5807 ret= reg_namedseq(pRExC_state, NULL);
5809 case 'k': /* Handle \k<NAME> and \k'NAME' */
5811 char ch= RExC_parse[1];
5812 if (ch != '<' && ch != '\'') {
5814 vWARN( RExC_parse + 1,
5815 "Possible broken named back reference treated as literal k");
5819 char* name_start = (RExC_parse += 2);
5821 SV *sv_dat = reg_scan_name(pRExC_state,
5822 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5823 ch= (ch == '<') ? '>' : '\'';
5825 if (RExC_parse == name_start || *RExC_parse != ch)
5826 vFAIL2("Sequence \\k%c... not terminated",
5827 (ch == '>' ? '<' : ch));
5830 ret = reganode(pRExC_state,
5831 (U8)(FOLD ? (LOC ? NREFFL : NREFF) : NREF),
5837 num = add_data( pRExC_state, 1, "S" );
5839 RExC_rx->data->data[num]=(void*)sv_dat;
5840 SvREFCNT_inc(sv_dat);
5842 /* override incorrect value set in reganode MJD */
5843 Set_Node_Offset(ret, parse_start+1);
5844 Set_Node_Cur_Length(ret); /* MJD */
5845 nextchar(pRExC_state);
5860 case '1': case '2': case '3': case '4':
5861 case '5': case '6': case '7': case '8': case '9':
5863 const I32 num = atoi(RExC_parse);
5865 if (num > 9 && num >= RExC_npar)
5868 char * const parse_start = RExC_parse - 1; /* MJD */
5869 while (isDIGIT(*RExC_parse))
5872 if (!SIZE_ONLY && num > (I32)RExC_rx->nparens)
5873 vFAIL("Reference to nonexistent group");
5875 ret = reganode(pRExC_state,
5876 (U8)(FOLD ? (LOC ? REFFL : REFF) : REF),
5880 /* override incorrect value set in reganode MJD */
5881 Set_Node_Offset(ret, parse_start+1);
5882 Set_Node_Cur_Length(ret); /* MJD */
5884 nextchar(pRExC_state);
5889 if (RExC_parse >= RExC_end)
5890 FAIL("Trailing \\");
5893 /* Do not generate "unrecognized" warnings here, we fall
5894 back into the quick-grab loop below */
5901 if (RExC_flags & PMf_EXTENDED) {
5902 while (RExC_parse < RExC_end && *RExC_parse != '\n')
5904 if (RExC_parse < RExC_end)
5910 register STRLEN len;
5915 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
5917 parse_start = RExC_parse - 1;
5923 ret = reg_node(pRExC_state,
5924 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
5926 for (len = 0, p = RExC_parse - 1;
5927 len < 127 && p < RExC_end;
5930 char * const oldp = p;
5932 if (RExC_flags & PMf_EXTENDED)
5933 p = regwhite(p, RExC_end);
5981 ender = ASCII_TO_NATIVE('\033');
5985 ender = ASCII_TO_NATIVE('\007');
5990 char* const e = strchr(p, '}');
5994 vFAIL("Missing right brace on \\x{}");
5997 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
5998 | PERL_SCAN_DISALLOW_PREFIX;
5999 STRLEN numlen = e - p - 1;
6000 ender = grok_hex(p + 1, &numlen, &flags, NULL);
6007 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
6009 ender = grok_hex(p, &numlen, &flags, NULL);
6015 ender = UCHARAT(p++);
6016 ender = toCTRL(ender);
6018 case '0': case '1': case '2': case '3':case '4':
6019 case '5': case '6': case '7': case '8':case '9':
6021 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
6024 ender = grok_oct(p, &numlen, &flags, NULL);
6034 FAIL("Trailing \\");
6037 if (!SIZE_ONLY&& isALPHA(*p) && ckWARN(WARN_REGEXP))
6038 vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
6039 goto normal_default;
6044 if (UTF8_IS_START(*p) && UTF) {
6046 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
6047 &numlen, UTF8_ALLOW_DEFAULT);
6054 if (RExC_flags & PMf_EXTENDED)
6055 p = regwhite(p, RExC_end);
6057 /* Prime the casefolded buffer. */
6058 ender = toFOLD_uni(ender, tmpbuf, &foldlen);
6060 if (ISMULT2(p)) { /* Back off on ?+*. */
6065 /* Emit all the Unicode characters. */
6067 for (foldbuf = tmpbuf;
6069 foldlen -= numlen) {
6070 ender = utf8_to_uvchr(foldbuf, &numlen);
6072 const STRLEN unilen = reguni(pRExC_state, ender, s);
6075 /* In EBCDIC the numlen
6076 * and unilen can differ. */
6078 if (numlen >= foldlen)
6082 break; /* "Can't happen." */
6086 const STRLEN unilen = reguni(pRExC_state, ender, s);
6095 REGC((char)ender, s++);
6101 /* Emit all the Unicode characters. */
6103 for (foldbuf = tmpbuf;
6105 foldlen -= numlen) {
6106 ender = utf8_to_uvchr(foldbuf, &numlen);
6108 const STRLEN unilen = reguni(pRExC_state, ender, s);
6111 /* In EBCDIC the numlen
6112 * and unilen can differ. */
6114 if (numlen >= foldlen)
6122 const STRLEN unilen = reguni(pRExC_state, ender, s);
6131 REGC((char)ender, s++);
6135 Set_Node_Cur_Length(ret); /* MJD */
6136 nextchar(pRExC_state);
6138 /* len is STRLEN which is unsigned, need to copy to signed */
6141 vFAIL("Internal disaster");
6145 if (len == 1 && UNI_IS_INVARIANT(ender))
6149 RExC_size += STR_SZ(len);
6152 RExC_emit += STR_SZ(len);
6158 /* If the encoding pragma is in effect recode the text of
6159 * any EXACT-kind nodes. */
6160 if (ret && PL_encoding && PL_regkind[OP(ret)] == EXACT) {
6161 const STRLEN oldlen = STR_LEN(ret);
6162 SV * const sv = sv_2mortal(newSVpvn(STRING(ret), oldlen));
6166 if (sv_utf8_downgrade(sv, TRUE)) {
6167 const char * const s = sv_recode_to_utf8(sv, PL_encoding);
6168 const STRLEN newlen = SvCUR(sv);
6173 GET_RE_DEBUG_FLAGS_DECL;
6174 DEBUG_COMPILE_r(PerlIO_printf(Perl_debug_log, "recode %*s to %*s\n",
6175 (int)oldlen, STRING(ret),
6177 Copy(s, STRING(ret), newlen, char);
6178 STR_LEN(ret) += newlen - oldlen;
6179 RExC_emit += STR_SZ(newlen) - STR_SZ(oldlen);
6181 RExC_size += STR_SZ(newlen) - STR_SZ(oldlen);
6189 S_regwhite(char *p, const char *e)
6194 else if (*p == '#') {
6197 } while (p < e && *p != '\n');
6205 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
6206 Character classes ([:foo:]) can also be negated ([:^foo:]).
6207 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
6208 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
6209 but trigger failures because they are currently unimplemented. */
6211 #define POSIXCC_DONE(c) ((c) == ':')
6212 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
6213 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
6216 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
6219 I32 namedclass = OOB_NAMEDCLASS;
6221 if (value == '[' && RExC_parse + 1 < RExC_end &&
6222 /* I smell either [: or [= or [. -- POSIX has been here, right? */
6223 POSIXCC(UCHARAT(RExC_parse))) {
6224 const char c = UCHARAT(RExC_parse);
6225 char* const s = RExC_parse++;
6227 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
6229 if (RExC_parse == RExC_end)
6230 /* Grandfather lone [:, [=, [. */
6233 const char* const t = RExC_parse++; /* skip over the c */
6236 if (UCHARAT(RExC_parse) == ']') {
6237 const char *posixcc = s + 1;
6238 RExC_parse++; /* skip over the ending ] */
6241 const I32 complement = *posixcc == '^' ? *posixcc++ : 0;
6242 const I32 skip = t - posixcc;
6244 /* Initially switch on the length of the name. */
6247 if (memEQ(posixcc, "word", 4)) /* this is not POSIX, this is the Perl \w */
6248 namedclass = complement ? ANYOF_NALNUM : ANYOF_ALNUM;
6251 /* Names all of length 5. */
6252 /* alnum alpha ascii blank cntrl digit graph lower
6253 print punct space upper */
6254 /* Offset 4 gives the best switch position. */
6255 switch (posixcc[4]) {
6257 if (memEQ(posixcc, "alph", 4)) /* alpha */
6258 namedclass = complement ? ANYOF_NALPHA : ANYOF_ALPHA;
6261 if (memEQ(posixcc, "spac", 4)) /* space */
6262 namedclass = complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
6265 if (memEQ(posixcc, "grap", 4)) /* graph */
6266 namedclass = complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
6269 if (memEQ(posixcc, "asci", 4)) /* ascii */
6270 namedclass = complement ? ANYOF_NASCII : ANYOF_ASCII;
6273 if (memEQ(posixcc, "blan", 4)) /* blank */
6274 namedclass = complement ? ANYOF_NBLANK : ANYOF_BLANK;
6277 if (memEQ(posixcc, "cntr", 4)) /* cntrl */
6278 namedclass = complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
6281 if (memEQ(posixcc, "alnu", 4)) /* alnum */
6282 namedclass = complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
6285 if (memEQ(posixcc, "lowe", 4)) /* lower */
6286 namedclass = complement ? ANYOF_NLOWER : ANYOF_LOWER;
6287 else if (memEQ(posixcc, "uppe", 4)) /* upper */
6288 namedclass = complement ? ANYOF_NUPPER : ANYOF_UPPER;
6291 if (memEQ(posixcc, "digi", 4)) /* digit */
6292 namedclass = complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
6293 else if (memEQ(posixcc, "prin", 4)) /* print */
6294 namedclass = complement ? ANYOF_NPRINT : ANYOF_PRINT;
6295 else if (memEQ(posixcc, "punc", 4)) /* punct */
6296 namedclass = complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
6301 if (memEQ(posixcc, "xdigit", 6))
6302 namedclass = complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
6306 if (namedclass == OOB_NAMEDCLASS)
6307 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
6309 assert (posixcc[skip] == ':');
6310 assert (posixcc[skip+1] == ']');
6311 } else if (!SIZE_ONLY) {
6312 /* [[=foo=]] and [[.foo.]] are still future. */
6314 /* adjust RExC_parse so the warning shows after
6316 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
6318 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6321 /* Maternal grandfather:
6322 * "[:" ending in ":" but not in ":]" */
6332 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
6335 if (POSIXCC(UCHARAT(RExC_parse))) {
6336 const char *s = RExC_parse;
6337 const char c = *s++;
6341 if (*s && c == *s && s[1] == ']') {
6342 if (ckWARN(WARN_REGEXP))
6344 "POSIX syntax [%c %c] belongs inside character classes",
6347 /* [[=foo=]] and [[.foo.]] are still future. */
6348 if (POSIXCC_NOTYET(c)) {
6349 /* adjust RExC_parse so the error shows after
6351 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
6353 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6361 parse a class specification and produce either an ANYOF node that
6362 matches the pattern. If the pattern matches a single char only and
6363 that char is < 256 then we produce an EXACT node instead.
6366 S_regclass(pTHX_ RExC_state_t *pRExC_state, U32 depth)
6369 register UV value = 0;
6370 register UV nextvalue;
6371 register IV prevvalue = OOB_UNICODE;
6372 register IV range = 0;
6373 register regnode *ret;
6376 char *rangebegin = NULL;
6377 bool need_class = 0;
6380 bool optimize_invert = TRUE;
6381 AV* unicode_alternate = NULL;
6383 UV literal_endpoint = 0;
6385 UV stored = 0; /* number of chars stored in the class */
6387 regnode * const orig_emit = RExC_emit; /* Save the original RExC_emit in
6388 case we need to change the emitted regop to an EXACT. */
6389 const char * orig_parse = RExC_parse;
6390 GET_RE_DEBUG_FLAGS_DECL;
6392 PERL_UNUSED_ARG(depth);
6395 DEBUG_PARSE("clas");
6397 /* Assume we are going to generate an ANYOF node. */
6398 ret = reganode(pRExC_state, ANYOF, 0);
6401 ANYOF_FLAGS(ret) = 0;
6403 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
6407 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
6411 RExC_size += ANYOF_SKIP;
6412 listsv = &PL_sv_undef; /* For code scanners: listsv always non-NULL. */
6415 RExC_emit += ANYOF_SKIP;
6417 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
6419 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
6420 ANYOF_BITMAP_ZERO(ret);
6421 listsv = newSVpvs("# comment\n");
6424 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6426 if (!SIZE_ONLY && POSIXCC(nextvalue))
6427 checkposixcc(pRExC_state);
6429 /* allow 1st char to be ] (allowing it to be - is dealt with later) */
6430 if (UCHARAT(RExC_parse) == ']')
6434 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
6438 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
6441 rangebegin = RExC_parse;
6443 value = utf8n_to_uvchr((U8*)RExC_parse,
6444 RExC_end - RExC_parse,
6445 &numlen, UTF8_ALLOW_DEFAULT);
6446 RExC_parse += numlen;
6449 value = UCHARAT(RExC_parse++);
6451 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6452 if (value == '[' && POSIXCC(nextvalue))
6453 namedclass = regpposixcc(pRExC_state, value);
6454 else if (value == '\\') {
6456 value = utf8n_to_uvchr((U8*)RExC_parse,
6457 RExC_end - RExC_parse,
6458 &numlen, UTF8_ALLOW_DEFAULT);
6459 RExC_parse += numlen;
6462 value = UCHARAT(RExC_parse++);
6463 /* Some compilers cannot handle switching on 64-bit integer
6464 * values, therefore value cannot be an UV. Yes, this will
6465 * be a problem later if we want switch on Unicode.
6466 * A similar issue a little bit later when switching on
6467 * namedclass. --jhi */
6468 switch ((I32)value) {
6469 case 'w': namedclass = ANYOF_ALNUM; break;
6470 case 'W': namedclass = ANYOF_NALNUM; break;
6471 case 's': namedclass = ANYOF_SPACE; break;
6472 case 'S': namedclass = ANYOF_NSPACE; break;
6473 case 'd': namedclass = ANYOF_DIGIT; break;
6474 case 'D': namedclass = ANYOF_NDIGIT; break;
6475 case 'N': /* Handle \N{NAME} in class */
6477 /* We only pay attention to the first char of
6478 multichar strings being returned. I kinda wonder
6479 if this makes sense as it does change the behaviour
6480 from earlier versions, OTOH that behaviour was broken
6482 UV v; /* value is register so we cant & it /grrr */
6483 if (reg_namedseq(pRExC_state, &v)) {
6493 if (RExC_parse >= RExC_end)
6494 vFAIL2("Empty \\%c{}", (U8)value);
6495 if (*RExC_parse == '{') {
6496 const U8 c = (U8)value;
6497 e = strchr(RExC_parse++, '}');
6499 vFAIL2("Missing right brace on \\%c{}", c);
6500 while (isSPACE(UCHARAT(RExC_parse)))
6502 if (e == RExC_parse)
6503 vFAIL2("Empty \\%c{}", c);
6505 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
6513 if (UCHARAT(RExC_parse) == '^') {
6516 value = value == 'p' ? 'P' : 'p'; /* toggle */
6517 while (isSPACE(UCHARAT(RExC_parse))) {
6522 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::%.*s\n",
6523 (value=='p' ? '+' : '!'), (int)n, RExC_parse);
6526 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
6527 namedclass = ANYOF_MAX; /* no official name, but it's named */
6530 case 'n': value = '\n'; break;
6531 case 'r': value = '\r'; break;
6532 case 't': value = '\t'; break;
6533 case 'f': value = '\f'; break;
6534 case 'b': value = '\b'; break;
6535 case 'e': value = ASCII_TO_NATIVE('\033');break;
6536 case 'a': value = ASCII_TO_NATIVE('\007');break;
6538 if (*RExC_parse == '{') {
6539 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
6540 | PERL_SCAN_DISALLOW_PREFIX;
6541 char * const e = strchr(RExC_parse++, '}');
6543 vFAIL("Missing right brace on \\x{}");
6545 numlen = e - RExC_parse;
6546 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
6550 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
6552 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
6553 RExC_parse += numlen;
6557 value = UCHARAT(RExC_parse++);
6558 value = toCTRL(value);
6560 case '0': case '1': case '2': case '3': case '4':
6561 case '5': case '6': case '7': case '8': case '9':
6565 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
6566 RExC_parse += numlen;
6570 if (!SIZE_ONLY && isALPHA(value) && ckWARN(WARN_REGEXP))
6572 "Unrecognized escape \\%c in character class passed through",
6576 } /* end of \blah */
6582 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
6584 if (!SIZE_ONLY && !need_class)
6585 ANYOF_CLASS_ZERO(ret);
6589 /* a bad range like a-\d, a-[:digit:] ? */
6592 if (ckWARN(WARN_REGEXP)) {
6594 RExC_parse >= rangebegin ?
6595 RExC_parse - rangebegin : 0;
6597 "False [] range \"%*.*s\"",
6600 if (prevvalue < 256) {
6601 ANYOF_BITMAP_SET(ret, prevvalue);
6602 ANYOF_BITMAP_SET(ret, '-');
6605 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
6606 Perl_sv_catpvf(aTHX_ listsv,
6607 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
6611 range = 0; /* this was not a true range */
6615 const char *what = NULL;
6618 if (namedclass > OOB_NAMEDCLASS)
6619 optimize_invert = FALSE;
6620 /* Possible truncation here but in some 64-bit environments
6621 * the compiler gets heartburn about switch on 64-bit values.
6622 * A similar issue a little earlier when switching on value.
6624 switch ((I32)namedclass) {
6627 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
6629 for (value = 0; value < 256; value++)
6631 ANYOF_BITMAP_SET(ret, value);
6638 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
6640 for (value = 0; value < 256; value++)
6641 if (!isALNUM(value))
6642 ANYOF_BITMAP_SET(ret, value);
6649 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
6651 for (value = 0; value < 256; value++)
6652 if (isALNUMC(value))
6653 ANYOF_BITMAP_SET(ret, value);
6660 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
6662 for (value = 0; value < 256; value++)
6663 if (!isALNUMC(value))
6664 ANYOF_BITMAP_SET(ret, value);
6671 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
6673 for (value = 0; value < 256; value++)
6675 ANYOF_BITMAP_SET(ret, value);
6682 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
6684 for (value = 0; value < 256; value++)
6685 if (!isALPHA(value))
6686 ANYOF_BITMAP_SET(ret, value);
6693 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
6696 for (value = 0; value < 128; value++)
6697 ANYOF_BITMAP_SET(ret, value);
6699 for (value = 0; value < 256; value++) {
6701 ANYOF_BITMAP_SET(ret, value);
6710 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
6713 for (value = 128; value < 256; value++)
6714 ANYOF_BITMAP_SET(ret, value);
6716 for (value = 0; value < 256; value++) {
6717 if (!isASCII(value))
6718 ANYOF_BITMAP_SET(ret, value);
6727 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
6729 for (value = 0; value < 256; value++)
6731 ANYOF_BITMAP_SET(ret, value);
6738 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
6740 for (value = 0; value < 256; value++)
6741 if (!isBLANK(value))
6742 ANYOF_BITMAP_SET(ret, value);
6749 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
6751 for (value = 0; value < 256; value++)
6753 ANYOF_BITMAP_SET(ret, value);
6760 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
6762 for (value = 0; value < 256; value++)
6763 if (!isCNTRL(value))
6764 ANYOF_BITMAP_SET(ret, value);
6771 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
6773 /* consecutive digits assumed */
6774 for (value = '0'; value <= '9'; value++)
6775 ANYOF_BITMAP_SET(ret, value);
6782 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
6784 /* consecutive digits assumed */
6785 for (value = 0; value < '0'; value++)
6786 ANYOF_BITMAP_SET(ret, value);
6787 for (value = '9' + 1; value < 256; value++)
6788 ANYOF_BITMAP_SET(ret, value);
6795 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
6797 for (value = 0; value < 256; value++)
6799 ANYOF_BITMAP_SET(ret, value);
6806 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
6808 for (value = 0; value < 256; value++)
6809 if (!isGRAPH(value))
6810 ANYOF_BITMAP_SET(ret, value);
6817 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
6819 for (value = 0; value < 256; value++)
6821 ANYOF_BITMAP_SET(ret, value);
6828 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
6830 for (value = 0; value < 256; value++)
6831 if (!isLOWER(value))
6832 ANYOF_BITMAP_SET(ret, value);
6839 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
6841 for (value = 0; value < 256; value++)
6843 ANYOF_BITMAP_SET(ret, value);
6850 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
6852 for (value = 0; value < 256; value++)
6853 if (!isPRINT(value))
6854 ANYOF_BITMAP_SET(ret, value);
6861 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
6863 for (value = 0; value < 256; value++)
6864 if (isPSXSPC(value))
6865 ANYOF_BITMAP_SET(ret, value);
6872 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
6874 for (value = 0; value < 256; value++)
6875 if (!isPSXSPC(value))
6876 ANYOF_BITMAP_SET(ret, value);
6883 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
6885 for (value = 0; value < 256; value++)
6887 ANYOF_BITMAP_SET(ret, value);
6894 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
6896 for (value = 0; value < 256; value++)
6897 if (!isPUNCT(value))
6898 ANYOF_BITMAP_SET(ret, value);
6905 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
6907 for (value = 0; value < 256; value++)
6909 ANYOF_BITMAP_SET(ret, value);
6916 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
6918 for (value = 0; value < 256; value++)
6919 if (!isSPACE(value))
6920 ANYOF_BITMAP_SET(ret, value);
6927 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
6929 for (value = 0; value < 256; value++)
6931 ANYOF_BITMAP_SET(ret, value);
6938 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
6940 for (value = 0; value < 256; value++)
6941 if (!isUPPER(value))
6942 ANYOF_BITMAP_SET(ret, value);
6949 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
6951 for (value = 0; value < 256; value++)
6952 if (isXDIGIT(value))
6953 ANYOF_BITMAP_SET(ret, value);
6960 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
6962 for (value = 0; value < 256; value++)
6963 if (!isXDIGIT(value))
6964 ANYOF_BITMAP_SET(ret, value);
6970 /* this is to handle \p and \P */
6973 vFAIL("Invalid [::] class");
6977 /* Strings such as "+utf8::isWord\n" */
6978 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::Is%s\n", yesno, what);
6981 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
6984 } /* end of namedclass \blah */
6987 if (prevvalue > (IV)value) /* b-a */ {
6988 const int w = RExC_parse - rangebegin;
6989 Simple_vFAIL4("Invalid [] range \"%*.*s\"", w, w, rangebegin);
6990 range = 0; /* not a valid range */
6994 prevvalue = value; /* save the beginning of the range */
6995 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
6996 RExC_parse[1] != ']') {
6999 /* a bad range like \w-, [:word:]- ? */
7000 if (namedclass > OOB_NAMEDCLASS) {
7001 if (ckWARN(WARN_REGEXP)) {
7003 RExC_parse >= rangebegin ?
7004 RExC_parse - rangebegin : 0;
7006 "False [] range \"%*.*s\"",
7010 ANYOF_BITMAP_SET(ret, '-');
7012 range = 1; /* yeah, it's a range! */
7013 continue; /* but do it the next time */
7017 /* now is the next time */
7018 /*stored += (value - prevvalue + 1);*/
7020 if (prevvalue < 256) {
7021 const IV ceilvalue = value < 256 ? value : 255;
7024 /* In EBCDIC [\x89-\x91] should include
7025 * the \x8e but [i-j] should not. */
7026 if (literal_endpoint == 2 &&
7027 ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
7028 (isUPPER(prevvalue) && isUPPER(ceilvalue))))
7030 if (isLOWER(prevvalue)) {
7031 for (i = prevvalue; i <= ceilvalue; i++)
7033 ANYOF_BITMAP_SET(ret, i);
7035 for (i = prevvalue; i <= ceilvalue; i++)
7037 ANYOF_BITMAP_SET(ret, i);
7042 for (i = prevvalue; i <= ceilvalue; i++) {
7043 if (!ANYOF_BITMAP_TEST(ret,i)) {
7045 ANYOF_BITMAP_SET(ret, i);
7049 if (value > 255 || UTF) {
7050 const UV prevnatvalue = NATIVE_TO_UNI(prevvalue);
7051 const UV natvalue = NATIVE_TO_UNI(value);
7052 stored+=2; /* can't optimize this class */
7053 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7054 if (prevnatvalue < natvalue) { /* what about > ? */
7055 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
7056 prevnatvalue, natvalue);
7058 else if (prevnatvalue == natvalue) {
7059 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue);
7061 U8 foldbuf[UTF8_MAXBYTES_CASE+1];
7063 const UV f = to_uni_fold(natvalue, foldbuf, &foldlen);
7065 #ifdef EBCDIC /* RD t/uni/fold ff and 6b */
7066 if (RExC_precomp[0] == ':' &&
7067 RExC_precomp[1] == '[' &&
7068 (f == 0xDF || f == 0x92)) {
7069 f = NATIVE_TO_UNI(f);
7072 /* If folding and foldable and a single
7073 * character, insert also the folded version
7074 * to the charclass. */
7076 #ifdef EBCDIC /* RD tunifold ligatures s,t fb05, fb06 */
7077 if ((RExC_precomp[0] == ':' &&
7078 RExC_precomp[1] == '[' &&
7080 (value == 0xFB05 || value == 0xFB06))) ?
7081 foldlen == ((STRLEN)UNISKIP(f) - 1) :
7082 foldlen == (STRLEN)UNISKIP(f) )
7084 if (foldlen == (STRLEN)UNISKIP(f))
7086 Perl_sv_catpvf(aTHX_ listsv,
7089 /* Any multicharacter foldings
7090 * require the following transform:
7091 * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst)
7092 * where E folds into "pq" and F folds
7093 * into "rst", all other characters
7094 * fold to single characters. We save
7095 * away these multicharacter foldings,
7096 * to be later saved as part of the
7097 * additional "s" data. */
7100 if (!unicode_alternate)
7101 unicode_alternate = newAV();
7102 sv = newSVpvn((char*)foldbuf, foldlen);
7104 av_push(unicode_alternate, sv);
7108 /* If folding and the value is one of the Greek
7109 * sigmas insert a few more sigmas to make the
7110 * folding rules of the sigmas to work right.
7111 * Note that not all the possible combinations
7112 * are handled here: some of them are handled
7113 * by the standard folding rules, and some of
7114 * them (literal or EXACTF cases) are handled
7115 * during runtime in regexec.c:S_find_byclass(). */
7116 if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) {
7117 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7118 (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA);
7119 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7120 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7122 else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA)
7123 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7124 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7129 literal_endpoint = 0;
7133 range = 0; /* this range (if it was one) is done now */
7137 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
7139 RExC_size += ANYOF_CLASS_ADD_SKIP;
7141 RExC_emit += ANYOF_CLASS_ADD_SKIP;
7147 /****** !SIZE_ONLY AFTER HERE *********/
7149 if( stored == 1 && value < 256
7150 && !( ANYOF_FLAGS(ret) & ( ANYOF_FLAGS_ALL ^ ANYOF_FOLD ) )
7152 /* optimize single char class to an EXACT node
7153 but *only* when its not a UTF/high char */
7154 const char * cur_parse= RExC_parse;
7155 RExC_emit = (regnode *)orig_emit;
7156 RExC_parse = (char *)orig_parse;
7157 ret = reg_node(pRExC_state,
7158 (U8)((ANYOF_FLAGS(ret) & ANYOF_FOLD) ? EXACTF : EXACT));
7159 RExC_parse = (char *)cur_parse;
7160 *STRING(ret)= (char)value;
7162 RExC_emit += STR_SZ(1);
7165 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
7166 if ( /* If the only flag is folding (plus possibly inversion). */
7167 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
7169 for (value = 0; value < 256; ++value) {
7170 if (ANYOF_BITMAP_TEST(ret, value)) {
7171 UV fold = PL_fold[value];
7174 ANYOF_BITMAP_SET(ret, fold);
7177 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
7180 /* optimize inverted simple patterns (e.g. [^a-z]) */
7181 if (optimize_invert &&
7182 /* If the only flag is inversion. */
7183 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
7184 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
7185 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
7186 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
7189 AV * const av = newAV();
7191 /* The 0th element stores the character class description
7192 * in its textual form: used later (regexec.c:Perl_regclass_swash())
7193 * to initialize the appropriate swash (which gets stored in
7194 * the 1st element), and also useful for dumping the regnode.
7195 * The 2nd element stores the multicharacter foldings,
7196 * used later (regexec.c:S_reginclass()). */
7197 av_store(av, 0, listsv);
7198 av_store(av, 1, NULL);
7199 av_store(av, 2, (SV*)unicode_alternate);
7200 rv = newRV_noinc((SV*)av);
7201 n = add_data(pRExC_state, 1, "s");
7202 RExC_rx->data->data[n] = (void*)rv;
7209 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
7211 char* const retval = RExC_parse++;
7214 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
7215 RExC_parse[2] == '#') {
7216 while (*RExC_parse != ')') {
7217 if (RExC_parse == RExC_end)
7218 FAIL("Sequence (?#... not terminated");
7224 if (RExC_flags & PMf_EXTENDED) {
7225 if (isSPACE(*RExC_parse)) {
7229 else if (*RExC_parse == '#') {
7230 while (RExC_parse < RExC_end)
7231 if (*RExC_parse++ == '\n') break;
7240 - reg_node - emit a node
7242 STATIC regnode * /* Location. */
7243 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
7246 register regnode *ptr;
7247 regnode * const ret = RExC_emit;
7248 GET_RE_DEBUG_FLAGS_DECL;
7251 SIZE_ALIGN(RExC_size);
7255 NODE_ALIGN_FILL(ret);
7257 FILL_ADVANCE_NODE(ptr, op);
7258 if (RExC_offsets) { /* MJD */
7259 MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n",
7260 "reg_node", __LINE__,
7262 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0]
7263 ? "Overwriting end of array!\n" : "OK",
7264 (UV)(RExC_emit - RExC_emit_start),
7265 (UV)(RExC_parse - RExC_start),
7266 (UV)RExC_offsets[0]));
7267 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
7276 - reganode - emit a node with an argument
7278 STATIC regnode * /* Location. */
7279 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
7282 register regnode *ptr;
7283 regnode * const ret = RExC_emit;
7284 GET_RE_DEBUG_FLAGS_DECL;
7287 SIZE_ALIGN(RExC_size);
7292 assert(2==regarglen[op]+1);
7294 Anything larger than this has to allocate the extra amount.
7295 If we changed this to be:
7297 RExC_size += (1 + regarglen[op]);
7299 then it wouldn't matter. Its not clear what side effect
7300 might come from that so its not done so far.
7306 NODE_ALIGN_FILL(ret);
7308 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
7309 if (RExC_offsets) { /* MJD */
7310 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7314 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] ?
7315 "Overwriting end of array!\n" : "OK",
7316 (UV)(RExC_emit - RExC_emit_start),
7317 (UV)(RExC_parse - RExC_start),
7318 (UV)RExC_offsets[0]));
7319 Set_Cur_Node_Offset;
7328 - reguni - emit (if appropriate) a Unicode character
7331 S_reguni(pTHX_ const RExC_state_t *pRExC_state, UV uv, char* s)
7334 return SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
7338 - reginsert - insert an operator in front of already-emitted operand
7340 * Means relocating the operand.
7343 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd, U32 depth)
7346 register regnode *src;
7347 register regnode *dst;
7348 register regnode *place;
7349 const int offset = regarglen[(U8)op];
7350 const int size = NODE_STEP_REGNODE + offset;
7351 GET_RE_DEBUG_FLAGS_DECL;
7352 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
7353 DEBUG_PARSE_FMT("inst"," - %s",reg_name[op]);
7364 for ( paren=0 ; paren < RExC_npar ; paren++ ) {
7365 if ( RExC_parens[paren] >= src )
7366 RExC_parens[paren] += size;
7370 while (src > opnd) {
7371 StructCopy(--src, --dst, regnode);
7372 if (RExC_offsets) { /* MJD 20010112 */
7373 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %"UVuf" -> %"UVuf" (max %"UVuf").\n",
7377 (UV)(dst - RExC_emit_start) > RExC_offsets[0]
7378 ? "Overwriting end of array!\n" : "OK",
7379 (UV)(src - RExC_emit_start),
7380 (UV)(dst - RExC_emit_start),
7381 (UV)RExC_offsets[0]));
7382 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
7383 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
7388 place = opnd; /* Op node, where operand used to be. */
7389 if (RExC_offsets) { /* MJD */
7390 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7394 (UV)(place - RExC_emit_start) > RExC_offsets[0]
7395 ? "Overwriting end of array!\n" : "OK",
7396 (UV)(place - RExC_emit_start),
7397 (UV)(RExC_parse - RExC_start),
7398 (UV)RExC_offsets[0]));
7399 Set_Node_Offset(place, RExC_parse);
7400 Set_Node_Length(place, 1);
7402 src = NEXTOPER(place);
7403 FILL_ADVANCE_NODE(place, op);
7404 Zero(src, offset, regnode);
7408 - regtail - set the next-pointer at the end of a node chain of p to val.
7409 - SEE ALSO: regtail_study
7411 /* TODO: All three parms should be const */
7413 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
7416 register regnode *scan;
7417 GET_RE_DEBUG_FLAGS_DECL;
7419 PERL_UNUSED_ARG(depth);
7425 /* Find last node. */
7428 regnode * const temp = regnext(scan);
7430 SV * const mysv=sv_newmortal();
7431 DEBUG_PARSE_MSG((scan==p ? "tail" : ""));
7432 regprop(RExC_rx, mysv, scan);
7433 PerlIO_printf(Perl_debug_log, "~ %s (%d) %s %s\n",
7434 SvPV_nolen_const(mysv), REG_NODE_NUM(scan),
7435 (temp == NULL ? "->" : ""),
7436 (temp == NULL ? reg_name[OP(val)] : "")
7444 if (reg_off_by_arg[OP(scan)]) {
7445 ARG_SET(scan, val - scan);
7448 NEXT_OFF(scan) = val - scan;
7454 - regtail_study - set the next-pointer at the end of a node chain of p to val.
7455 - Look for optimizable sequences at the same time.
7456 - currently only looks for EXACT chains.
7458 This is expermental code. The idea is to use this routine to perform
7459 in place optimizations on branches and groups as they are constructed,
7460 with the long term intention of removing optimization from study_chunk so
7461 that it is purely analytical.
7463 Currently only used when in DEBUG mode. The macro REGTAIL_STUDY() is used
7464 to control which is which.
7467 /* TODO: All four parms should be const */
7470 S_regtail_study(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
7473 register regnode *scan;
7475 #ifdef EXPERIMENTAL_INPLACESCAN
7479 GET_RE_DEBUG_FLAGS_DECL;
7485 /* Find last node. */
7489 regnode * const temp = regnext(scan);
7490 #ifdef EXPERIMENTAL_INPLACESCAN
7491 if (PL_regkind[OP(scan)] == EXACT)
7492 if (join_exact(pRExC_state,scan,&min,1,val,depth+1))
7500 if( exact == PSEUDO )
7502 else if ( exact != OP(scan) )
7511 SV * const mysv=sv_newmortal();
7512 DEBUG_PARSE_MSG((scan==p ? "tsdy" : ""));
7513 regprop(RExC_rx, mysv, scan);
7514 PerlIO_printf(Perl_debug_log, "~ %s (%d) -> %s\n",
7515 SvPV_nolen_const(mysv),
7524 SV * const mysv_val=sv_newmortal();
7525 DEBUG_PARSE_MSG("");
7526 regprop(RExC_rx, mysv_val, val);
7527 PerlIO_printf(Perl_debug_log, "~ attach to %s (%d) offset to %d\n",
7528 SvPV_nolen_const(mysv_val),
7533 if (reg_off_by_arg[OP(scan)]) {
7534 ARG_SET(scan, val - scan);
7537 NEXT_OFF(scan) = val - scan;
7545 - regcurly - a little FSA that accepts {\d+,?\d*}
7548 S_regcurly(register const char *s)
7567 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
7570 Perl_regdump(pTHX_ const regexp *r)
7574 SV * const sv = sv_newmortal();
7575 SV *dsv= sv_newmortal();
7577 (void)dumpuntil(r, r->program, r->program + 1, NULL, NULL, sv, 0, 0);
7579 /* Header fields of interest. */
7580 if (r->anchored_substr) {
7581 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->anchored_substr),
7582 RE_SV_DUMPLEN(r->anchored_substr), 30);
7583 PerlIO_printf(Perl_debug_log,
7584 "anchored %s%s at %"IVdf" ",
7585 s, RE_SV_TAIL(r->anchored_substr),
7586 (IV)r->anchored_offset);
7587 } else if (r->anchored_utf8) {
7588 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->anchored_utf8),
7589 RE_SV_DUMPLEN(r->anchored_utf8), 30);
7590 PerlIO_printf(Perl_debug_log,
7591 "anchored utf8 %s%s at %"IVdf" ",
7592 s, RE_SV_TAIL(r->anchored_utf8),
7593 (IV)r->anchored_offset);
7595 if (r->float_substr) {
7596 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->float_substr),
7597 RE_SV_DUMPLEN(r->float_substr), 30);
7598 PerlIO_printf(Perl_debug_log,
7599 "floating %s%s at %"IVdf"..%"UVuf" ",
7600 s, RE_SV_TAIL(r->float_substr),
7601 (IV)r->float_min_offset, (UV)r->float_max_offset);
7602 } else if (r->float_utf8) {
7603 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->float_utf8),
7604 RE_SV_DUMPLEN(r->float_utf8), 30);
7605 PerlIO_printf(Perl_debug_log,
7606 "floating utf8 %s%s at %"IVdf"..%"UVuf" ",
7607 s, RE_SV_TAIL(r->float_utf8),
7608 (IV)r->float_min_offset, (UV)r->float_max_offset);
7610 if (r->check_substr || r->check_utf8)
7611 PerlIO_printf(Perl_debug_log,
7613 (r->check_substr == r->float_substr
7614 && r->check_utf8 == r->float_utf8
7615 ? "(checking floating" : "(checking anchored"));
7616 if (r->reganch & ROPT_NOSCAN)
7617 PerlIO_printf(Perl_debug_log, " noscan");
7618 if (r->reganch & ROPT_CHECK_ALL)
7619 PerlIO_printf(Perl_debug_log, " isall");
7620 if (r->check_substr || r->check_utf8)
7621 PerlIO_printf(Perl_debug_log, ") ");
7623 if (r->regstclass) {
7624 regprop(r, sv, r->regstclass);
7625 PerlIO_printf(Perl_debug_log, "stclass %s ", SvPVX_const(sv));
7627 if (r->reganch & ROPT_ANCH) {
7628 PerlIO_printf(Perl_debug_log, "anchored");
7629 if (r->reganch & ROPT_ANCH_BOL)
7630 PerlIO_printf(Perl_debug_log, "(BOL)");
7631 if (r->reganch & ROPT_ANCH_MBOL)
7632 PerlIO_printf(Perl_debug_log, "(MBOL)");
7633 if (r->reganch & ROPT_ANCH_SBOL)
7634 PerlIO_printf(Perl_debug_log, "(SBOL)");
7635 if (r->reganch & ROPT_ANCH_GPOS)
7636 PerlIO_printf(Perl_debug_log, "(GPOS)");
7637 PerlIO_putc(Perl_debug_log, ' ');
7639 if (r->reganch & ROPT_GPOS_SEEN)
7640 PerlIO_printf(Perl_debug_log, "GPOS ");
7641 if (r->reganch & ROPT_SKIP)
7642 PerlIO_printf(Perl_debug_log, "plus ");
7643 if (r->reganch & ROPT_IMPLICIT)
7644 PerlIO_printf(Perl_debug_log, "implicit ");
7645 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
7646 if (r->reganch & ROPT_EVAL_SEEN)
7647 PerlIO_printf(Perl_debug_log, "with eval ");
7648 PerlIO_printf(Perl_debug_log, "\n");
7650 PERL_UNUSED_CONTEXT;
7652 #endif /* DEBUGGING */
7656 - regprop - printable representation of opcode
7659 Perl_regprop(pTHX_ const regexp *prog, SV *sv, const regnode *o)
7664 GET_RE_DEBUG_FLAGS_DECL;
7666 sv_setpvn(sv, "", 0);
7667 if (OP(o) > REGNODE_MAX) /* regnode.type is unsigned */
7668 /* It would be nice to FAIL() here, but this may be called from
7669 regexec.c, and it would be hard to supply pRExC_state. */
7670 Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(o), (int)REGNODE_MAX);
7671 sv_catpv(sv, reg_name[OP(o)]); /* Take off const! */
7673 k = PL_regkind[OP(o)];
7676 SV * const dsv = sv_2mortal(newSVpvs(""));
7677 /* Using is_utf8_string() (via PERL_PV_UNI_DETECT)
7678 * is a crude hack but it may be the best for now since
7679 * we have no flag "this EXACTish node was UTF-8"
7681 const char * const s =
7682 pv_pretty(dsv, STRING(o), STR_LEN(o), 60,
7683 PL_colors[0], PL_colors[1],
7684 PERL_PV_ESCAPE_UNI_DETECT |
7685 PERL_PV_PRETTY_ELIPSES |
7688 Perl_sv_catpvf(aTHX_ sv, " %s", s );
7689 } else if (k == TRIE) {
7690 /* print the details of the trie in dumpuntil instead, as
7691 * prog->data isn't available here */
7692 const char op = OP(o);
7693 const I32 n = ARG(o);
7694 const reg_ac_data * const ac = IS_TRIE_AC(op) ?
7695 (reg_ac_data *)prog->data->data[n] :
7697 const reg_trie_data * const trie = !IS_TRIE_AC(op) ?
7698 (reg_trie_data*)prog->data->data[n] :
7701 Perl_sv_catpvf(aTHX_ sv, "-%s",reg_name[o->flags]);
7702 DEBUG_TRIE_COMPILE_r(
7703 Perl_sv_catpvf(aTHX_ sv,
7704 "<S:%"UVuf"/%"IVdf" W:%"UVuf" L:%"UVuf"/%"UVuf" C:%"UVuf"/%"UVuf">",
7705 (UV)trie->startstate,
7706 (IV)trie->laststate-1,
7707 (UV)trie->wordcount,
7710 (UV)TRIE_CHARCOUNT(trie),
7711 (UV)trie->uniquecharcount
7714 if ( IS_ANYOF_TRIE(op) || trie->bitmap ) {
7716 int rangestart = -1;
7717 U8* bitmap = IS_ANYOF_TRIE(op) ? (U8*)ANYOF_BITMAP(o) : (U8*)TRIE_BITMAP(trie);
7718 Perl_sv_catpvf(aTHX_ sv, "[");
7719 for (i = 0; i <= 256; i++) {
7720 if (i < 256 && BITMAP_TEST(bitmap,i)) {
7721 if (rangestart == -1)
7723 } else if (rangestart != -1) {
7724 if (i <= rangestart + 3)
7725 for (; rangestart < i; rangestart++)
7726 put_byte(sv, rangestart);
7728 put_byte(sv, rangestart);
7730 put_byte(sv, i - 1);
7735 Perl_sv_catpvf(aTHX_ sv, "]");
7738 } else if (k == CURLY) {
7739 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
7740 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
7741 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
7743 else if (k == WHILEM && o->flags) /* Ordinal/of */
7744 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
7745 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP)
7746 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
7747 else if (k == RECURSE)
7748 Perl_sv_catpvf(aTHX_ sv, "%d[%+d]", (int)ARG(o),(int)ARG2L(o)); /* Paren and offset */
7749 else if (k == LOGICAL)
7750 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
7751 else if (k == ANYOF) {
7752 int i, rangestart = -1;
7753 const U8 flags = ANYOF_FLAGS(o);
7755 /* Should be synchronized with * ANYOF_ #xdefines in regcomp.h */
7756 static const char * const anyofs[] = {
7789 if (flags & ANYOF_LOCALE)
7790 sv_catpvs(sv, "{loc}");
7791 if (flags & ANYOF_FOLD)
7792 sv_catpvs(sv, "{i}");
7793 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
7794 if (flags & ANYOF_INVERT)
7796 for (i = 0; i <= 256; i++) {
7797 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
7798 if (rangestart == -1)
7800 } else if (rangestart != -1) {
7801 if (i <= rangestart + 3)
7802 for (; rangestart < i; rangestart++)
7803 put_byte(sv, rangestart);
7805 put_byte(sv, rangestart);
7807 put_byte(sv, i - 1);
7813 if (o->flags & ANYOF_CLASS)
7814 for (i = 0; i < (int)(sizeof(anyofs)/sizeof(char*)); i++)
7815 if (ANYOF_CLASS_TEST(o,i))
7816 sv_catpv(sv, anyofs[i]);
7818 if (flags & ANYOF_UNICODE)
7819 sv_catpvs(sv, "{unicode}");
7820 else if (flags & ANYOF_UNICODE_ALL)
7821 sv_catpvs(sv, "{unicode_all}");
7825 SV * const sw = regclass_swash(prog, o, FALSE, &lv, 0);
7829 U8 s[UTF8_MAXBYTES_CASE+1];
7831 for (i = 0; i <= 256; i++) { /* just the first 256 */
7832 uvchr_to_utf8(s, i);
7834 if (i < 256 && swash_fetch(sw, s, TRUE)) {
7835 if (rangestart == -1)
7837 } else if (rangestart != -1) {
7838 if (i <= rangestart + 3)
7839 for (; rangestart < i; rangestart++) {
7840 const U8 * const e = uvchr_to_utf8(s,rangestart);
7842 for(p = s; p < e; p++)
7846 const U8 *e = uvchr_to_utf8(s,rangestart);
7848 for (p = s; p < e; p++)
7851 e = uvchr_to_utf8(s, i-1);
7852 for (p = s; p < e; p++)
7859 sv_catpvs(sv, "..."); /* et cetera */
7863 char *s = savesvpv(lv);
7864 char * const origs = s;
7866 while (*s && *s != '\n')
7870 const char * const t = ++s;
7888 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
7890 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
7891 Perl_sv_catpvf(aTHX_ sv, "[%d]", -(o->flags));
7893 PERL_UNUSED_CONTEXT;
7894 PERL_UNUSED_ARG(sv);
7896 PERL_UNUSED_ARG(prog);
7897 #endif /* DEBUGGING */
7901 Perl_re_intuit_string(pTHX_ regexp *prog)
7902 { /* Assume that RE_INTUIT is set */
7904 GET_RE_DEBUG_FLAGS_DECL;
7905 PERL_UNUSED_CONTEXT;
7909 const char * const s = SvPV_nolen_const(prog->check_substr
7910 ? prog->check_substr : prog->check_utf8);
7912 if (!PL_colorset) reginitcolors();
7913 PerlIO_printf(Perl_debug_log,
7914 "%sUsing REx %ssubstr:%s \"%s%.60s%s%s\"\n",
7916 prog->check_substr ? "" : "utf8 ",
7917 PL_colors[5],PL_colors[0],
7920 (strlen(s) > 60 ? "..." : ""));
7923 return prog->check_substr ? prog->check_substr : prog->check_utf8;
7927 pregfree - free a regexp
7929 See regdupe below if you change anything here.
7933 Perl_pregfree(pTHX_ struct regexp *r)
7937 GET_RE_DEBUG_FLAGS_DECL;
7939 if (!r || (--r->refcnt > 0))
7945 SV *dsv= sv_newmortal();
7946 RE_PV_QUOTED_DECL(s, (r->reganch & ROPT_UTF8),
7947 dsv, r->precomp, r->prelen, 60);
7948 PerlIO_printf(Perl_debug_log,"%sFreeing REx:%s %s\n",
7949 PL_colors[4],PL_colors[5],s);
7953 /* gcov results gave these as non-null 100% of the time, so there's no
7954 optimisation in checking them before calling Safefree */
7955 Safefree(r->precomp);
7956 Safefree(r->offsets); /* 20010421 MJD */
7957 RX_MATCH_COPY_FREE(r);
7958 #ifdef PERL_OLD_COPY_ON_WRITE
7960 SvREFCNT_dec(r->saved_copy);
7963 if (r->anchored_substr)
7964 SvREFCNT_dec(r->anchored_substr);
7965 if (r->anchored_utf8)
7966 SvREFCNT_dec(r->anchored_utf8);
7967 if (r->float_substr)
7968 SvREFCNT_dec(r->float_substr);
7970 SvREFCNT_dec(r->float_utf8);
7971 Safefree(r->substrs);
7974 SvREFCNT_dec(r->paren_names);
7976 int n = r->data->count;
7977 PAD* new_comppad = NULL;
7982 /* If you add a ->what type here, update the comment in regcomp.h */
7983 switch (r->data->what[n]) {
7986 SvREFCNT_dec((SV*)r->data->data[n]);
7989 Safefree(r->data->data[n]);
7992 new_comppad = (AV*)r->data->data[n];
7995 if (new_comppad == NULL)
7996 Perl_croak(aTHX_ "panic: pregfree comppad");
7997 PAD_SAVE_LOCAL(old_comppad,
7998 /* Watch out for global destruction's random ordering. */
7999 (SvTYPE(new_comppad) == SVt_PVAV) ? new_comppad : NULL
8002 refcnt = OpREFCNT_dec((OP_4tree*)r->data->data[n]);
8005 op_free((OP_4tree*)r->data->data[n]);
8007 PAD_RESTORE_LOCAL(old_comppad);
8008 SvREFCNT_dec((SV*)new_comppad);
8014 { /* Aho Corasick add-on structure for a trie node.
8015 Used in stclass optimization only */
8017 reg_ac_data *aho=(reg_ac_data*)r->data->data[n];
8019 refcount = --aho->refcount;
8022 Safefree(aho->states);
8023 Safefree(aho->fail);
8024 aho->trie=NULL; /* not necessary to free this as it is
8025 handled by the 't' case */
8026 Safefree(r->data->data[n]); /* do this last!!!! */
8027 Safefree(r->regstclass);
8033 /* trie structure. */
8035 reg_trie_data *trie=(reg_trie_data*)r->data->data[n];
8037 refcount = --trie->refcount;
8040 Safefree(trie->charmap);
8041 if (trie->widecharmap)
8042 SvREFCNT_dec((SV*)trie->widecharmap);
8043 Safefree(trie->states);
8044 Safefree(trie->trans);
8046 Safefree(trie->bitmap);
8048 Safefree(trie->wordlen);
8050 Safefree(trie->jump);
8052 Safefree(trie->nextword);
8056 SvREFCNT_dec((SV*)trie->words);
8057 if (trie->revcharmap)
8058 SvREFCNT_dec((SV*)trie->revcharmap);
8061 Safefree(r->data->data[n]); /* do this last!!!! */
8066 Perl_croak(aTHX_ "panic: regfree data code '%c'", r->data->what[n]);
8069 Safefree(r->data->what);
8072 Safefree(r->startp);
8077 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8078 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8079 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8080 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
8083 regdupe - duplicate a regexp.
8085 This routine is called by sv.c's re_dup and is expected to clone a
8086 given regexp structure. It is a no-op when not under USE_ITHREADS.
8087 (Originally this *was* re_dup() for change history see sv.c)
8089 See pregfree() above if you change anything here.
8091 #if defined(USE_ITHREADS)
8093 Perl_regdupe(pTHX_ const regexp *r, CLONE_PARAMS *param)
8098 struct reg_substr_datum *s;
8101 return (REGEXP *)NULL;
8103 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8106 len = r->offsets[0];
8107 npar = r->nparens+1;
8109 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8110 Copy(r->program, ret->program, len+1, regnode);
8112 Newx(ret->startp, npar, I32);
8113 Copy(r->startp, ret->startp, npar, I32);
8114 Newx(ret->endp, npar, I32);
8115 Copy(r->startp, ret->startp, npar, I32);
8117 Newx(ret->substrs, 1, struct reg_substr_data);
8118 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8119 s->min_offset = r->substrs->data[i].min_offset;
8120 s->max_offset = r->substrs->data[i].max_offset;
8121 s->end_shift = r->substrs->data[i].end_shift;
8122 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8123 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8126 ret->regstclass = NULL;
8129 const int count = r->data->count;
8132 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
8133 char, struct reg_data);
8134 Newx(d->what, count, U8);
8137 for (i = 0; i < count; i++) {
8138 d->what[i] = r->data->what[i];
8139 switch (d->what[i]) {
8140 /* legal options are one of: sfpont
8141 see also regcomp.h and pregfree() */
8144 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8147 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8150 /* This is cheating. */
8151 Newx(d->data[i], 1, struct regnode_charclass_class);
8152 StructCopy(r->data->data[i], d->data[i],
8153 struct regnode_charclass_class);
8154 ret->regstclass = (regnode*)d->data[i];
8157 /* Compiled op trees are readonly, and can thus be
8158 shared without duplication. */
8160 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8164 d->data[i] = r->data->data[i];
8167 d->data[i] = r->data->data[i];
8169 ((reg_trie_data*)d->data[i])->refcount++;
8173 d->data[i] = r->data->data[i];
8175 ((reg_ac_data*)d->data[i])->refcount++;
8177 /* Trie stclasses are readonly and can thus be shared
8178 * without duplication. We free the stclass in pregfree
8179 * when the corresponding reg_ac_data struct is freed.
8181 ret->regstclass= r->regstclass;
8184 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
8193 Newx(ret->offsets, 2*len+1, U32);
8194 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8196 ret->precomp = SAVEPVN(r->precomp, r->prelen);
8197 ret->refcnt = r->refcnt;
8198 ret->minlen = r->minlen;
8199 ret->prelen = r->prelen;
8200 ret->nparens = r->nparens;
8201 ret->lastparen = r->lastparen;
8202 ret->lastcloseparen = r->lastcloseparen;
8203 ret->reganch = r->reganch;
8205 ret->sublen = r->sublen;
8207 ret->engine = r->engine;
8209 ret->paren_names = hv_dup_inc(r->paren_names, param);
8211 if (RX_MATCH_COPIED(ret))
8212 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
8215 #ifdef PERL_OLD_COPY_ON_WRITE
8216 ret->saved_copy = NULL;
8219 ptr_table_store(PL_ptr_table, r, ret);
8224 #ifndef PERL_IN_XSUB_RE
8226 - regnext - dig the "next" pointer out of a node
8229 Perl_regnext(pTHX_ register regnode *p)
8232 register I32 offset;
8234 if (p == &PL_regdummy)
8237 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
8246 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
8249 STRLEN l1 = strlen(pat1);
8250 STRLEN l2 = strlen(pat2);
8253 const char *message;
8259 Copy(pat1, buf, l1 , char);
8260 Copy(pat2, buf + l1, l2 , char);
8261 buf[l1 + l2] = '\n';
8262 buf[l1 + l2 + 1] = '\0';
8264 /* ANSI variant takes additional second argument */
8265 va_start(args, pat2);
8269 msv = vmess(buf, &args);
8271 message = SvPV_const(msv,l1);
8274 Copy(message, buf, l1 , char);
8275 buf[l1-1] = '\0'; /* Overwrite \n */
8276 Perl_croak(aTHX_ "%s", buf);
8279 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
8281 #ifndef PERL_IN_XSUB_RE
8283 Perl_save_re_context(pTHX)
8287 struct re_save_state *state;
8289 SAVEVPTR(PL_curcop);
8290 SSGROW(SAVESTACK_ALLOC_FOR_RE_SAVE_STATE + 1);
8292 state = (struct re_save_state *)(PL_savestack + PL_savestack_ix);
8293 PL_savestack_ix += SAVESTACK_ALLOC_FOR_RE_SAVE_STATE;
8294 SSPUSHINT(SAVEt_RE_STATE);
8296 Copy(&PL_reg_state, state, 1, struct re_save_state);
8298 PL_reg_start_tmp = 0;
8299 PL_reg_start_tmpl = 0;
8300 PL_reg_oldsaved = NULL;
8301 PL_reg_oldsavedlen = 0;
8303 PL_reg_leftiter = 0;
8304 PL_reg_poscache = NULL;
8305 PL_reg_poscache_size = 0;
8306 #ifdef PERL_OLD_COPY_ON_WRITE
8310 /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */
8312 const REGEXP * const rx = PM_GETRE(PL_curpm);
8315 for (i = 1; i <= rx->nparens; i++) {
8316 char digits[TYPE_CHARS(long)];
8317 const STRLEN len = my_snprintf(digits, sizeof(digits), "%lu", (long)i);
8318 GV *const *const gvp
8319 = (GV**)hv_fetch(PL_defstash, digits, len, 0);
8322 GV * const gv = *gvp;
8323 if (SvTYPE(gv) == SVt_PVGV && GvSV(gv))
8333 clear_re(pTHX_ void *r)
8336 ReREFCNT_dec((regexp *)r);
8342 S_put_byte(pTHX_ SV *sv, int c)
8344 if (isCNTRL(c) || c == 255 || !isPRINT(c))
8345 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
8346 else if (c == '-' || c == ']' || c == '\\' || c == '^')
8347 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
8349 Perl_sv_catpvf(aTHX_ sv, "%c", c);
8353 #define CLEAR_OPTSTART \
8354 if (optstart) STMT_START { \
8355 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log, " (%d nodes)\n", node - optstart)); \
8359 #define DUMPUNTIL(b,e) CLEAR_OPTSTART; node=dumpuntil(r,start,(b),(e),last,sv,indent+1,depth+1);
8361 STATIC const regnode *
8362 S_dumpuntil(pTHX_ const regexp *r, const regnode *start, const regnode *node,
8363 const regnode *last, const regnode *plast,
8364 SV* sv, I32 indent, U32 depth)
8367 register U8 op = PSEUDO; /* Arbitrary non-END op. */
8368 register const regnode *next;
8369 const regnode *optstart= NULL;
8370 GET_RE_DEBUG_FLAGS_DECL;
8372 #ifdef DEBUG_DUMPUNTIL
8373 PerlIO_printf(Perl_debug_log, "--- %d : %d - %d - %d\n",indent,node-start,
8374 last ? last-start : 0,plast ? plast-start : 0);
8377 if (plast && plast < last)
8380 while (PL_regkind[op] != END && (!last || node < last)) {
8381 /* While that wasn't END last time... */
8387 next = regnext((regnode *)node);
8390 if (OP(node) == OPTIMIZED) {
8391 if (!optstart && RE_DEBUG_FLAG(RE_DEBUG_COMPILE_OPTIMISE))
8398 regprop(r, sv, node);
8399 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
8400 (int)(2*indent + 1), "", SvPVX_const(sv));
8402 if (OP(node) != OPTIMIZED) {
8403 if (next == NULL) /* Next ptr. */
8404 PerlIO_printf(Perl_debug_log, "(0)");
8405 else if (PL_regkind[(U8)op] == BRANCH && PL_regkind[OP(next)] != BRANCH )
8406 PerlIO_printf(Perl_debug_log, "(FAIL)");
8408 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
8410 /*if (PL_regkind[(U8)op] != TRIE)*/
8411 (void)PerlIO_putc(Perl_debug_log, '\n');
8415 if (PL_regkind[(U8)op] == BRANCHJ) {
8418 register const regnode *nnode = (OP(next) == LONGJMP
8419 ? regnext((regnode *)next)
8421 if (last && nnode > last)
8423 DUMPUNTIL(NEXTOPER(NEXTOPER(node)), nnode);
8426 else if (PL_regkind[(U8)op] == BRANCH) {
8428 DUMPUNTIL(NEXTOPER(node), next);
8430 else if ( PL_regkind[(U8)op] == TRIE ) {
8431 const char op = OP(node);
8432 const I32 n = ARG(node);
8433 const reg_ac_data * const ac = op>=AHOCORASICK ?
8434 (reg_ac_data *)r->data->data[n] :
8436 const reg_trie_data * const trie = op<AHOCORASICK ?
8437 (reg_trie_data*)r->data->data[n] :
8439 const regnode *nextbranch= NULL;
8441 sv_setpvn(sv, "", 0);
8442 for (word_idx= 0; word_idx < (I32)trie->wordcount; word_idx++) {
8443 SV ** const elem_ptr = av_fetch(trie->words,word_idx,0);
8445 PerlIO_printf(Perl_debug_log, "%*s%s ",
8446 (int)(2*(indent+3)), "",
8447 elem_ptr ? pv_pretty(sv, SvPV_nolen_const(*elem_ptr), SvCUR(*elem_ptr), 60,
8448 PL_colors[0], PL_colors[1],
8449 (SvUTF8(*elem_ptr) ? PERL_PV_ESCAPE_UNI : 0) |
8450 PERL_PV_PRETTY_ELIPSES |
8456 U16 dist= trie->jump[word_idx+1];
8457 PerlIO_printf(Perl_debug_log, "(%u)\n",(next - dist) - start);
8460 nextbranch= next - trie->jump[0];
8461 DUMPUNTIL(next - dist, nextbranch);
8463 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
8464 nextbranch= regnext((regnode *)nextbranch);
8466 PerlIO_printf(Perl_debug_log, "\n");
8469 if (last && next > last)
8474 else if ( op == CURLY ) { /* "next" might be very big: optimizer */
8475 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS,
8476 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1);
8478 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
8480 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, next);
8482 else if ( op == PLUS || op == STAR) {
8483 DUMPUNTIL(NEXTOPER(node), NEXTOPER(node) + 1);
8485 else if (op == ANYOF) {
8486 /* arglen 1 + class block */
8487 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
8488 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
8489 node = NEXTOPER(node);
8491 else if (PL_regkind[(U8)op] == EXACT) {
8492 /* Literal string, where present. */
8493 node += NODE_SZ_STR(node) - 1;
8494 node = NEXTOPER(node);
8497 node = NEXTOPER(node);
8498 node += regarglen[(U8)op];
8500 if (op == CURLYX || op == OPEN)
8502 else if (op == WHILEM)
8506 #ifdef DEBUG_DUMPUNTIL
8507 PerlIO_printf(Perl_debug_log, "--- %d\n",indent);
8512 #endif /* DEBUGGING */
8516 * c-indentation-style: bsd
8518 * indent-tabs-mode: t
8521 * ex: set ts=8 sts=4 sw=4 noet: