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. */
105 regexp *rx; /* perl core regexp structure */
106 regexp_internal *rxi; /* internal data for regexp object pprivate field */
107 char *start; /* Start of input for compile */
108 char *end; /* End of input for compile */
109 char *parse; /* Input-scan pointer. */
110 I32 whilem_seen; /* number of WHILEM in this expr */
111 regnode *emit_start; /* Start of emitted-code area */
112 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
113 I32 naughty; /* How bad is this pattern? */
114 I32 sawback; /* Did we see \1, ...? */
116 I32 size; /* Code size. */
117 I32 npar; /* Capture buffer count, (OPEN). */
118 I32 cpar; /* Capture buffer count, (CLOSE). */
119 I32 nestroot; /* root parens we are in - used by accept */
123 regnode **open_parens; /* pointers to open parens */
124 regnode **close_parens; /* pointers to close parens */
125 regnode *opend; /* END node in program */
127 HV *charnames; /* cache of named sequences */
128 HV *paren_names; /* Paren names */
129 regnode **recurse; /* Recurse regops */
130 I32 recurse_count; /* Number of recurse regops */
132 char *starttry; /* -Dr: where regtry was called. */
133 #define RExC_starttry (pRExC_state->starttry)
136 const char *lastparse;
138 #define RExC_lastparse (pRExC_state->lastparse)
139 #define RExC_lastnum (pRExC_state->lastnum)
143 #define RExC_flags (pRExC_state->flags)
144 #define RExC_precomp (pRExC_state->precomp)
145 #define RExC_rx (pRExC_state->rx)
146 #define RExC_rxi (pRExC_state->rxi)
147 #define RExC_start (pRExC_state->start)
148 #define RExC_end (pRExC_state->end)
149 #define RExC_parse (pRExC_state->parse)
150 #define RExC_whilem_seen (pRExC_state->whilem_seen)
151 #define RExC_offsets (pRExC_state->rxi->offsets) /* I am not like the others */
152 #define RExC_emit (pRExC_state->emit)
153 #define RExC_emit_start (pRExC_state->emit_start)
154 #define RExC_naughty (pRExC_state->naughty)
155 #define RExC_sawback (pRExC_state->sawback)
156 #define RExC_seen (pRExC_state->seen)
157 #define RExC_size (pRExC_state->size)
158 #define RExC_npar (pRExC_state->npar)
159 #define RExC_nestroot (pRExC_state->nestroot)
160 #define RExC_extralen (pRExC_state->extralen)
161 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
162 #define RExC_seen_evals (pRExC_state->seen_evals)
163 #define RExC_utf8 (pRExC_state->utf8)
164 #define RExC_charnames (pRExC_state->charnames)
165 #define RExC_open_parens (pRExC_state->open_parens)
166 #define RExC_close_parens (pRExC_state->close_parens)
167 #define RExC_opend (pRExC_state->opend)
168 #define RExC_paren_names (pRExC_state->paren_names)
169 #define RExC_recurse (pRExC_state->recurse)
170 #define RExC_recurse_count (pRExC_state->recurse_count)
172 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
173 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
174 ((*s) == '{' && regcurly(s)))
177 #undef SPSTART /* dratted cpp namespace... */
180 * Flags to be passed up and down.
182 #define WORST 0 /* Worst case. */
183 #define HASWIDTH 0x1 /* Known to match non-null strings. */
184 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
185 #define SPSTART 0x4 /* Starts with * or +. */
186 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
188 #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
190 /* whether trie related optimizations are enabled */
191 #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
192 #define TRIE_STUDY_OPT
193 #define FULL_TRIE_STUDY
199 #define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3]
200 #define PBITVAL(paren) (1 << ((paren) & 7))
201 #define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren))
202 #define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren)
203 #define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren))
206 /* About scan_data_t.
208 During optimisation we recurse through the regexp program performing
209 various inplace (keyhole style) optimisations. In addition study_chunk
210 and scan_commit populate this data structure with information about
211 what strings MUST appear in the pattern. We look for the longest
212 string that must appear for at a fixed location, and we look for the
213 longest string that may appear at a floating location. So for instance
218 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
219 strings (because they follow a .* construct). study_chunk will identify
220 both FOO and BAR as being the longest fixed and floating strings respectively.
222 The strings can be composites, for instance
226 will result in a composite fixed substring 'foo'.
228 For each string some basic information is maintained:
230 - offset or min_offset
231 This is the position the string must appear at, or not before.
232 It also implicitly (when combined with minlenp) tells us how many
233 character must match before the string we are searching.
234 Likewise when combined with minlenp and the length of the string
235 tells us how many characters must appear after the string we have
239 Only used for floating strings. This is the rightmost point that
240 the string can appear at. Ifset to I32 max it indicates that the
241 string can occur infinitely far to the right.
244 A pointer to the minimum length of the pattern that the string
245 was found inside. This is important as in the case of positive
246 lookahead or positive lookbehind we can have multiple patterns
251 The minimum length of the pattern overall is 3, the minimum length
252 of the lookahead part is 3, but the minimum length of the part that
253 will actually match is 1. So 'FOO's minimum length is 3, but the
254 minimum length for the F is 1. This is important as the minimum length
255 is used to determine offsets in front of and behind the string being
256 looked for. Since strings can be composites this is the length of the
257 pattern at the time it was commited with a scan_commit. Note that
258 the length is calculated by study_chunk, so that the minimum lengths
259 are not known until the full pattern has been compiled, thus the
260 pointer to the value.
264 In the case of lookbehind the string being searched for can be
265 offset past the start point of the final matching string.
266 If this value was just blithely removed from the min_offset it would
267 invalidate some of the calculations for how many chars must match
268 before or after (as they are derived from min_offset and minlen and
269 the length of the string being searched for).
270 When the final pattern is compiled and the data is moved from the
271 scan_data_t structure into the regexp structure the information
272 about lookbehind is factored in, with the information that would
273 have been lost precalculated in the end_shift field for the
276 The fields pos_min and pos_delta are used to store the minimum offset
277 and the delta to the maximum offset at the current point in the pattern.
281 typedef struct scan_data_t {
282 /*I32 len_min; unused */
283 /*I32 len_delta; unused */
287 I32 last_end; /* min value, <0 unless valid. */
290 SV **longest; /* Either &l_fixed, or &l_float. */
291 SV *longest_fixed; /* longest fixed string found in pattern */
292 I32 offset_fixed; /* offset where it starts */
293 I32 *minlen_fixed; /* pointer to the minlen relevent to the string */
294 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
295 SV *longest_float; /* longest floating string found in pattern */
296 I32 offset_float_min; /* earliest point in string it can appear */
297 I32 offset_float_max; /* latest point in string it can appear */
298 I32 *minlen_float; /* pointer to the minlen relevent to the string */
299 I32 lookbehind_float; /* is the position of the string modified by LB */
303 struct regnode_charclass_class *start_class;
307 * Forward declarations for pregcomp()'s friends.
310 static const scan_data_t zero_scan_data =
311 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
313 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
314 #define SF_BEFORE_SEOL 0x0001
315 #define SF_BEFORE_MEOL 0x0002
316 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
317 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
320 # define SF_FIX_SHIFT_EOL (0+2)
321 # define SF_FL_SHIFT_EOL (0+4)
323 # define SF_FIX_SHIFT_EOL (+2)
324 # define SF_FL_SHIFT_EOL (+4)
327 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
328 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
330 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
331 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
332 #define SF_IS_INF 0x0040
333 #define SF_HAS_PAR 0x0080
334 #define SF_IN_PAR 0x0100
335 #define SF_HAS_EVAL 0x0200
336 #define SCF_DO_SUBSTR 0x0400
337 #define SCF_DO_STCLASS_AND 0x0800
338 #define SCF_DO_STCLASS_OR 0x1000
339 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
340 #define SCF_WHILEM_VISITED_POS 0x2000
342 #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
343 #define SCF_SEEN_ACCEPT 0x8000
345 #define UTF (RExC_utf8 != 0)
346 #define LOC ((RExC_flags & RXf_PMf_LOCALE) != 0)
347 #define FOLD ((RExC_flags & RXf_PMf_FOLD) != 0)
349 #define OOB_UNICODE 12345678
350 #define OOB_NAMEDCLASS -1
352 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
353 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
356 /* length of regex to show in messages that don't mark a position within */
357 #define RegexLengthToShowInErrorMessages 127
360 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
361 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
362 * op/pragma/warn/regcomp.
364 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
365 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
367 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
370 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
371 * arg. Show regex, up to a maximum length. If it's too long, chop and add
374 #define _FAIL(code) STMT_START { \
375 const char *ellipses = ""; \
376 IV len = RExC_end - RExC_precomp; \
379 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
380 if (len > RegexLengthToShowInErrorMessages) { \
381 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
382 len = RegexLengthToShowInErrorMessages - 10; \
388 #define FAIL(msg) _FAIL( \
389 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
390 msg, (int)len, RExC_precomp, ellipses))
392 #define FAIL2(msg,arg) _FAIL( \
393 Perl_croak(aTHX_ msg " in regex m/%.*s%s/", \
394 arg, (int)len, RExC_precomp, ellipses))
397 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
399 #define Simple_vFAIL(m) STMT_START { \
400 const IV offset = RExC_parse - RExC_precomp; \
401 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
402 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
406 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
408 #define vFAIL(m) STMT_START { \
410 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
415 * Like Simple_vFAIL(), but accepts two arguments.
417 #define Simple_vFAIL2(m,a1) STMT_START { \
418 const IV offset = RExC_parse - RExC_precomp; \
419 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
420 (int)offset, RExC_precomp, RExC_precomp + offset); \
424 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
426 #define vFAIL2(m,a1) STMT_START { \
428 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
429 Simple_vFAIL2(m, a1); \
434 * Like Simple_vFAIL(), but accepts three arguments.
436 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
437 const IV offset = RExC_parse - RExC_precomp; \
438 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
439 (int)offset, RExC_precomp, RExC_precomp + offset); \
443 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
445 #define vFAIL3(m,a1,a2) STMT_START { \
447 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
448 Simple_vFAIL3(m, a1, a2); \
452 * Like Simple_vFAIL(), but accepts four arguments.
454 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
455 const IV offset = RExC_parse - RExC_precomp; \
456 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
457 (int)offset, RExC_precomp, RExC_precomp + offset); \
460 #define vWARN(loc,m) STMT_START { \
461 const IV offset = loc - RExC_precomp; \
462 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
463 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
466 #define vWARNdep(loc,m) STMT_START { \
467 const IV offset = loc - RExC_precomp; \
468 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
469 "%s" REPORT_LOCATION, \
470 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
474 #define vWARN2(loc, m, a1) STMT_START { \
475 const IV offset = loc - RExC_precomp; \
476 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
477 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
480 #define vWARN3(loc, m, a1, a2) STMT_START { \
481 const IV offset = loc - RExC_precomp; \
482 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
483 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
486 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
487 const IV offset = loc - RExC_precomp; \
488 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
489 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
492 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
493 const IV offset = loc - RExC_precomp; \
494 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
495 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
499 /* Allow for side effects in s */
500 #define REGC(c,s) STMT_START { \
501 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
504 /* Macros for recording node offsets. 20001227 mjd@plover.com
505 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
506 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
507 * Element 0 holds the number n.
508 * Position is 1 indexed.
511 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
513 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
514 __LINE__, (int)(node), (int)(byte))); \
516 Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \
518 RExC_offsets[2*(node)-1] = (byte); \
523 #define Set_Node_Offset(node,byte) \
524 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
525 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
527 #define Set_Node_Length_To_R(node,len) STMT_START { \
529 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
530 __LINE__, (int)(node), (int)(len))); \
532 Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \
534 RExC_offsets[2*(node)] = (len); \
539 #define Set_Node_Length(node,len) \
540 Set_Node_Length_To_R((node)-RExC_emit_start, len)
541 #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
542 #define Set_Node_Cur_Length(node) \
543 Set_Node_Length(node, RExC_parse - parse_start)
545 /* Get offsets and lengths */
546 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
547 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
549 #define Set_Node_Offset_Length(node,offset,len) STMT_START { \
550 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
551 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
555 #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
556 #define EXPERIMENTAL_INPLACESCAN
559 #define DEBUG_STUDYDATA(str,data,depth) \
560 DEBUG_OPTIMISE_MORE_r(if(data){ \
561 PerlIO_printf(Perl_debug_log, \
562 "%*s" str "Pos:%"IVdf"/%"IVdf \
563 " Flags: 0x%"UVXf" Whilem_c: %"IVdf" Lcp: %"IVdf" %s", \
564 (int)(depth)*2, "", \
565 (IV)((data)->pos_min), \
566 (IV)((data)->pos_delta), \
567 (UV)((data)->flags), \
568 (IV)((data)->whilem_c), \
569 (IV)((data)->last_closep ? *((data)->last_closep) : -1), \
570 is_inf ? "INF " : "" \
572 if ((data)->last_found) \
573 PerlIO_printf(Perl_debug_log, \
574 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
575 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
576 SvPVX_const((data)->last_found), \
577 (IV)((data)->last_end), \
578 (IV)((data)->last_start_min), \
579 (IV)((data)->last_start_max), \
580 ((data)->longest && \
581 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
582 SvPVX_const((data)->longest_fixed), \
583 (IV)((data)->offset_fixed), \
584 ((data)->longest && \
585 (data)->longest==&((data)->longest_float)) ? "*" : "", \
586 SvPVX_const((data)->longest_float), \
587 (IV)((data)->offset_float_min), \
588 (IV)((data)->offset_float_max) \
590 PerlIO_printf(Perl_debug_log,"\n"); \
593 static void clear_re(pTHX_ void *r);
595 /* Mark that we cannot extend a found fixed substring at this point.
596 Update the longest found anchored substring and the longest found
597 floating substrings if needed. */
600 S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp, int is_inf)
602 const STRLEN l = CHR_SVLEN(data->last_found);
603 const STRLEN old_l = CHR_SVLEN(*data->longest);
604 GET_RE_DEBUG_FLAGS_DECL;
606 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
607 SvSetMagicSV(*data->longest, data->last_found);
608 if (*data->longest == data->longest_fixed) {
609 data->offset_fixed = l ? data->last_start_min : data->pos_min;
610 if (data->flags & SF_BEFORE_EOL)
612 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
614 data->flags &= ~SF_FIX_BEFORE_EOL;
615 data->minlen_fixed=minlenp;
616 data->lookbehind_fixed=0;
618 else { /* *data->longest == data->longest_float */
619 data->offset_float_min = l ? data->last_start_min : data->pos_min;
620 data->offset_float_max = (l
621 ? data->last_start_max
622 : data->pos_min + data->pos_delta);
623 if (is_inf || (U32)data->offset_float_max > (U32)I32_MAX)
624 data->offset_float_max = I32_MAX;
625 if (data->flags & SF_BEFORE_EOL)
627 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
629 data->flags &= ~SF_FL_BEFORE_EOL;
630 data->minlen_float=minlenp;
631 data->lookbehind_float=0;
634 SvCUR_set(data->last_found, 0);
636 SV * const sv = data->last_found;
637 if (SvUTF8(sv) && SvMAGICAL(sv)) {
638 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
644 data->flags &= ~SF_BEFORE_EOL;
645 DEBUG_STUDYDATA("cl_anything: ",data,0);
648 /* Can match anything (initialization) */
650 S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
652 ANYOF_CLASS_ZERO(cl);
653 ANYOF_BITMAP_SETALL(cl);
654 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
656 cl->flags |= ANYOF_LOCALE;
659 /* Can match anything (initialization) */
661 S_cl_is_anything(const struct regnode_charclass_class *cl)
665 for (value = 0; value <= ANYOF_MAX; value += 2)
666 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
668 if (!(cl->flags & ANYOF_UNICODE_ALL))
670 if (!ANYOF_BITMAP_TESTALLSET((const void*)cl))
675 /* Can match anything (initialization) */
677 S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
679 Zero(cl, 1, struct regnode_charclass_class);
681 cl_anything(pRExC_state, cl);
685 S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
687 Zero(cl, 1, struct regnode_charclass_class);
689 cl_anything(pRExC_state, cl);
691 cl->flags |= ANYOF_LOCALE;
694 /* 'And' a given class with another one. Can create false positives */
695 /* We assume that cl is not inverted */
697 S_cl_and(struct regnode_charclass_class *cl,
698 const struct regnode_charclass_class *and_with)
701 assert(and_with->type == ANYOF);
702 if (!(and_with->flags & ANYOF_CLASS)
703 && !(cl->flags & ANYOF_CLASS)
704 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
705 && !(and_with->flags & ANYOF_FOLD)
706 && !(cl->flags & ANYOF_FOLD)) {
709 if (and_with->flags & ANYOF_INVERT)
710 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
711 cl->bitmap[i] &= ~and_with->bitmap[i];
713 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
714 cl->bitmap[i] &= and_with->bitmap[i];
715 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
716 if (!(and_with->flags & ANYOF_EOS))
717 cl->flags &= ~ANYOF_EOS;
719 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE &&
720 !(and_with->flags & ANYOF_INVERT)) {
721 cl->flags &= ~ANYOF_UNICODE_ALL;
722 cl->flags |= ANYOF_UNICODE;
723 ARG_SET(cl, ARG(and_with));
725 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
726 !(and_with->flags & ANYOF_INVERT))
727 cl->flags &= ~ANYOF_UNICODE_ALL;
728 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) &&
729 !(and_with->flags & ANYOF_INVERT))
730 cl->flags &= ~ANYOF_UNICODE;
733 /* 'OR' a given class with another one. Can create false positives */
734 /* We assume that cl is not inverted */
736 S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with)
738 if (or_with->flags & ANYOF_INVERT) {
740 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
741 * <= (B1 | !B2) | (CL1 | !CL2)
742 * which is wasteful if CL2 is small, but we ignore CL2:
743 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
744 * XXXX Can we handle case-fold? Unclear:
745 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
746 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
748 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
749 && !(or_with->flags & ANYOF_FOLD)
750 && !(cl->flags & ANYOF_FOLD) ) {
753 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
754 cl->bitmap[i] |= ~or_with->bitmap[i];
755 } /* XXXX: logic is complicated otherwise */
757 cl_anything(pRExC_state, cl);
760 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
761 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
762 && (!(or_with->flags & ANYOF_FOLD)
763 || (cl->flags & ANYOF_FOLD)) ) {
766 /* OR char bitmap and class bitmap separately */
767 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
768 cl->bitmap[i] |= or_with->bitmap[i];
769 if (or_with->flags & ANYOF_CLASS) {
770 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
771 cl->classflags[i] |= or_with->classflags[i];
772 cl->flags |= ANYOF_CLASS;
775 else { /* XXXX: logic is complicated, leave it along for a moment. */
776 cl_anything(pRExC_state, cl);
779 if (or_with->flags & ANYOF_EOS)
780 cl->flags |= ANYOF_EOS;
782 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
783 ARG(cl) != ARG(or_with)) {
784 cl->flags |= ANYOF_UNICODE_ALL;
785 cl->flags &= ~ANYOF_UNICODE;
787 if (or_with->flags & ANYOF_UNICODE_ALL) {
788 cl->flags |= ANYOF_UNICODE_ALL;
789 cl->flags &= ~ANYOF_UNICODE;
793 #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
794 #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
795 #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
796 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 )
801 dump_trie(trie,widecharmap,revcharmap)
802 dump_trie_interim_list(trie,widecharmap,revcharmap,next_alloc)
803 dump_trie_interim_table(trie,widecharmap,revcharmap,next_alloc)
805 These routines dump out a trie in a somewhat readable format.
806 The _interim_ variants are used for debugging the interim
807 tables that are used to generate the final compressed
808 representation which is what dump_trie expects.
810 Part of the reason for their existance is to provide a form
811 of documentation as to how the different representations function.
816 Dumps the final compressed table form of the trie to Perl_debug_log.
817 Used for debugging make_trie().
821 S_dump_trie(pTHX_ const struct _reg_trie_data *trie, HV *widecharmap,
822 AV *revcharmap, U32 depth)
825 SV *sv=sv_newmortal();
826 int colwidth= widecharmap ? 6 : 4;
827 GET_RE_DEBUG_FLAGS_DECL;
830 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
831 (int)depth * 2 + 2,"",
832 "Match","Base","Ofs" );
834 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
835 SV ** const tmp = av_fetch( revcharmap, state, 0);
837 PerlIO_printf( Perl_debug_log, "%*s",
839 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
840 PL_colors[0], PL_colors[1],
841 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
842 PERL_PV_ESCAPE_FIRSTCHAR
847 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
848 (int)depth * 2 + 2,"");
850 for( state = 0 ; state < trie->uniquecharcount ; state++ )
851 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
852 PerlIO_printf( Perl_debug_log, "\n");
854 for( state = 1 ; state < trie->statecount ; state++ ) {
855 const U32 base = trie->states[ state ].trans.base;
857 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state);
859 if ( trie->states[ state ].wordnum ) {
860 PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum );
862 PerlIO_printf( Perl_debug_log, "%6s", "" );
865 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
870 while( ( base + ofs < trie->uniquecharcount ) ||
871 ( base + ofs - trie->uniquecharcount < trie->lasttrans
872 && trie->trans[ base + ofs - trie->uniquecharcount ].check != state))
875 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
877 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
878 if ( ( base + ofs >= trie->uniquecharcount ) &&
879 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
880 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
882 PerlIO_printf( Perl_debug_log, "%*"UVXf,
884 (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next );
886 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
890 PerlIO_printf( Perl_debug_log, "]");
893 PerlIO_printf( Perl_debug_log, "\n" );
897 Dumps a fully constructed but uncompressed trie in list form.
898 List tries normally only are used for construction when the number of
899 possible chars (trie->uniquecharcount) is very high.
900 Used for debugging make_trie().
903 S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie,
904 HV *widecharmap, AV *revcharmap, U32 next_alloc,
908 SV *sv=sv_newmortal();
909 int colwidth= widecharmap ? 6 : 4;
910 GET_RE_DEBUG_FLAGS_DECL;
911 /* print out the table precompression. */
912 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
913 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
914 "------:-----+-----------------\n" );
916 for( state=1 ; state < next_alloc ; state ++ ) {
919 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
920 (int)depth * 2 + 2,"", (UV)state );
921 if ( ! trie->states[ state ].wordnum ) {
922 PerlIO_printf( Perl_debug_log, "%5s| ","");
924 PerlIO_printf( Perl_debug_log, "W%4x| ",
925 trie->states[ state ].wordnum
928 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
929 SV ** const tmp = av_fetch( revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0);
931 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
933 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
934 PL_colors[0], PL_colors[1],
935 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
936 PERL_PV_ESCAPE_FIRSTCHAR
938 TRIE_LIST_ITEM(state,charid).forid,
939 (UV)TRIE_LIST_ITEM(state,charid).newstate
942 PerlIO_printf(Perl_debug_log, "\n%*s| ",
943 (int)((depth * 2) + 14), "");
946 PerlIO_printf( Perl_debug_log, "\n");
951 Dumps a fully constructed but uncompressed trie in table form.
952 This is the normal DFA style state transition table, with a few
953 twists to facilitate compression later.
954 Used for debugging make_trie().
957 S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie,
958 HV *widecharmap, AV *revcharmap, U32 next_alloc,
963 SV *sv=sv_newmortal();
964 int colwidth= widecharmap ? 6 : 4;
965 GET_RE_DEBUG_FLAGS_DECL;
968 print out the table precompression so that we can do a visual check
969 that they are identical.
972 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
974 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
975 SV ** const tmp = av_fetch( revcharmap, charid, 0);
977 PerlIO_printf( Perl_debug_log, "%*s",
979 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
980 PL_colors[0], PL_colors[1],
981 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
982 PERL_PV_ESCAPE_FIRSTCHAR
988 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
990 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
991 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
994 PerlIO_printf( Perl_debug_log, "\n" );
996 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
998 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
999 (int)depth * 2 + 2,"",
1000 (UV)TRIE_NODENUM( state ) );
1002 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1003 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
1005 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
1007 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
1009 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
1010 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check );
1012 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check,
1013 trie->states[ TRIE_NODENUM( state ) ].wordnum );
1020 /* make_trie(startbranch,first,last,tail,word_count,flags,depth)
1021 startbranch: the first branch in the whole branch sequence
1022 first : start branch of sequence of branch-exact nodes.
1023 May be the same as startbranch
1024 last : Thing following the last branch.
1025 May be the same as tail.
1026 tail : item following the branch sequence
1027 count : words in the sequence
1028 flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/
1029 depth : indent depth
1031 Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
1033 A trie is an N'ary tree where the branches are determined by digital
1034 decomposition of the key. IE, at the root node you look up the 1st character and
1035 follow that branch repeat until you find the end of the branches. Nodes can be
1036 marked as "accepting" meaning they represent a complete word. Eg:
1040 would convert into the following structure. Numbers represent states, letters
1041 following numbers represent valid transitions on the letter from that state, if
1042 the number is in square brackets it represents an accepting state, otherwise it
1043 will be in parenthesis.
1045 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1049 (1) +-i->(6)-+-s->[7]
1051 +-s->(3)-+-h->(4)-+-e->[5]
1053 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1055 This shows that when matching against the string 'hers' we will begin at state 1
1056 read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1057 then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1058 is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1059 single traverse. We store a mapping from accepting to state to which word was
1060 matched, and then when we have multiple possibilities we try to complete the
1061 rest of the regex in the order in which they occured in the alternation.
1063 The only prior NFA like behaviour that would be changed by the TRIE support is
1064 the silent ignoring of duplicate alternations which are of the form:
1066 / (DUPE|DUPE) X? (?{ ... }) Y /x
1068 Thus EVAL blocks follwing a trie may be called a different number of times with
1069 and without the optimisation. With the optimisations dupes will be silently
1070 ignored. This inconsistant behaviour of EVAL type nodes is well established as
1071 the following demonstrates:
1073 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
1075 which prints out 'word' three times, but
1077 'words'=~/(word|word|word)(?{ print $1 })S/
1079 which doesnt print it out at all. This is due to other optimisations kicking in.
1081 Example of what happens on a structural level:
1083 The regexp /(ac|ad|ab)+/ will produce the folowing debug output:
1085 1: CURLYM[1] {1,32767}(18)
1096 This would be optimizable with startbranch=5, first=5, last=16, tail=16
1097 and should turn into:
1099 1: CURLYM[1] {1,32767}(18)
1101 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
1109 Cases where tail != last would be like /(?foo|bar)baz/:
1119 which would be optimizable with startbranch=1, first=1, last=7, tail=8
1120 and would end up looking like:
1123 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
1130 d = uvuni_to_utf8_flags(d, uv, 0);
1132 is the recommended Unicode-aware way of saying
1137 #define TRIE_STORE_REVCHAR \
1139 SV *tmp = newSVpvs(""); \
1140 if (UTF) SvUTF8_on(tmp); \
1141 Perl_sv_catpvf( aTHX_ tmp, "%c", (int)uvc ); \
1142 av_push( revcharmap, tmp ); \
1145 #define TRIE_READ_CHAR STMT_START { \
1149 if ( foldlen > 0 ) { \
1150 uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \
1155 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1156 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1157 foldlen -= UNISKIP( uvc ); \
1158 scan = foldbuf + UNISKIP( uvc ); \
1161 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1171 #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
1172 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
1173 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
1174 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
1176 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
1177 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
1178 TRIE_LIST_CUR( state )++; \
1181 #define TRIE_LIST_NEW(state) STMT_START { \
1182 Newxz( trie->states[ state ].trans.list, \
1183 4, reg_trie_trans_le ); \
1184 TRIE_LIST_CUR( state ) = 1; \
1185 TRIE_LIST_LEN( state ) = 4; \
1188 #define TRIE_HANDLE_WORD(state) STMT_START { \
1189 U16 dupe= trie->states[ state ].wordnum; \
1190 regnode * const noper_next = regnext( noper ); \
1192 if (trie->wordlen) \
1193 trie->wordlen[ curword ] = wordlen; \
1195 /* store the word for dumping */ \
1197 if (OP(noper) != NOTHING) \
1198 tmp = newSVpvn(STRING(noper), STR_LEN(noper)); \
1200 tmp = newSVpvn( "", 0 ); \
1201 if ( UTF ) SvUTF8_on( tmp ); \
1202 av_push( trie_words, tmp ); \
1207 if ( noper_next < tail ) { \
1209 trie->jump = PerlMemShared_calloc( word_count + 1, sizeof(U16) ); \
1210 trie->jump[curword] = (U16)(noper_next - convert); \
1212 jumper = noper_next; \
1214 nextbranch= regnext(cur); \
1218 /* So it's a dupe. This means we need to maintain a */\
1219 /* linked-list from the first to the next. */\
1220 /* we only allocate the nextword buffer when there */\
1221 /* a dupe, so first time we have to do the allocation */\
1222 if (!trie->nextword) \
1224 PerlMemShared_calloc( word_count + 1, sizeof(U16)); \
1225 while ( trie->nextword[dupe] ) \
1226 dupe= trie->nextword[dupe]; \
1227 trie->nextword[dupe]= curword; \
1229 /* we haven't inserted this word yet. */ \
1230 trie->states[ state ].wordnum = curword; \
1235 #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
1236 ( ( base + charid >= ucharcount \
1237 && base + charid < ubound \
1238 && state == trie->trans[ base - ucharcount + charid ].check \
1239 && trie->trans[ base - ucharcount + charid ].next ) \
1240 ? trie->trans[ base - ucharcount + charid ].next \
1241 : ( state==1 ? special : 0 ) \
1245 #define MADE_JUMP_TRIE 2
1246 #define MADE_EXACT_TRIE 4
1249 S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth)
1252 /* first pass, loop through and scan words */
1253 reg_trie_data *trie;
1254 HV *widecharmap = NULL;
1255 AV *revcharmap = newAV();
1257 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1262 regnode *jumper = NULL;
1263 regnode *nextbranch = NULL;
1264 regnode *convert = NULL;
1265 /* we just use folder as a flag in utf8 */
1266 const U8 * const folder = ( flags == EXACTF
1268 : ( flags == EXACTFL
1275 const U32 data_slot = add_data( pRExC_state, 4, "tuuu" );
1276 AV *trie_words = NULL;
1277 /* along with revcharmap, this only used during construction but both are
1278 * useful during debugging so we store them in the struct when debugging.
1281 const U32 data_slot = add_data( pRExC_state, 2, "tu" );
1282 STRLEN trie_charcount=0;
1284 SV *re_trie_maxbuff;
1285 GET_RE_DEBUG_FLAGS_DECL;
1287 PERL_UNUSED_ARG(depth);
1290 trie = PerlMemShared_calloc( 1, sizeof(reg_trie_data) );
1292 trie->startstate = 1;
1293 trie->wordcount = word_count;
1294 RExC_rxi->data->data[ data_slot ] = (void*)trie;
1295 trie->charmap = PerlMemShared_calloc( 256, sizeof(U16) );
1296 if (!(UTF && folder))
1297 trie->bitmap = PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 );
1299 trie_words = newAV();
1302 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
1303 if (!SvIOK(re_trie_maxbuff)) {
1304 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
1307 PerlIO_printf( Perl_debug_log,
1308 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
1309 (int)depth * 2 + 2, "",
1310 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
1311 REG_NODE_NUM(last), REG_NODE_NUM(tail),
1315 /* Find the node we are going to overwrite */
1316 if ( first == startbranch && OP( last ) != BRANCH ) {
1317 /* whole branch chain */
1320 /* branch sub-chain */
1321 convert = NEXTOPER( first );
1324 /* -- First loop and Setup --
1326 We first traverse the branches and scan each word to determine if it
1327 contains widechars, and how many unique chars there are, this is
1328 important as we have to build a table with at least as many columns as we
1331 We use an array of integers to represent the character codes 0..255
1332 (trie->charmap) and we use a an HV* to store unicode characters. We use the
1333 native representation of the character value as the key and IV's for the
1336 *TODO* If we keep track of how many times each character is used we can
1337 remap the columns so that the table compression later on is more
1338 efficient in terms of memory by ensuring most common value is in the
1339 middle and the least common are on the outside. IMO this would be better
1340 than a most to least common mapping as theres a decent chance the most
1341 common letter will share a node with the least common, meaning the node
1342 will not be compressable. With a middle is most common approach the worst
1343 case is when we have the least common nodes twice.
1347 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1348 regnode * const noper = NEXTOPER( cur );
1349 const U8 *uc = (U8*)STRING( noper );
1350 const U8 * const e = uc + STR_LEN( noper );
1352 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1353 const U8 *scan = (U8*)NULL;
1354 U32 wordlen = 0; /* required init */
1357 if (OP(noper) == NOTHING) {
1362 TRIE_BITMAP_SET(trie,*uc);
1363 if ( folder ) TRIE_BITMAP_SET(trie,folder[ *uc ]);
1365 for ( ; uc < e ; uc += len ) {
1366 TRIE_CHARCOUNT(trie)++;
1370 if ( !trie->charmap[ uvc ] ) {
1371 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
1373 trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ];
1379 widecharmap = newHV();
1381 svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 1 );
1384 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
1386 if ( !SvTRUE( *svpp ) ) {
1387 sv_setiv( *svpp, ++trie->uniquecharcount );
1392 if( cur == first ) {
1395 } else if (chars < trie->minlen) {
1397 } else if (chars > trie->maxlen) {
1401 } /* end first pass */
1402 DEBUG_TRIE_COMPILE_r(
1403 PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
1404 (int)depth * 2 + 2,"",
1405 ( widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
1406 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
1407 (int)trie->minlen, (int)trie->maxlen )
1409 trie->wordlen = PerlMemShared_calloc( word_count, sizeof(U32) );
1412 We now know what we are dealing with in terms of unique chars and
1413 string sizes so we can calculate how much memory a naive
1414 representation using a flat table will take. If it's over a reasonable
1415 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
1416 conservative but potentially much slower representation using an array
1419 At the end we convert both representations into the same compressed
1420 form that will be used in regexec.c for matching with. The latter
1421 is a form that cannot be used to construct with but has memory
1422 properties similar to the list form and access properties similar
1423 to the table form making it both suitable for fast searches and
1424 small enough that its feasable to store for the duration of a program.
1426 See the comment in the code where the compressed table is produced
1427 inplace from the flat tabe representation for an explanation of how
1428 the compression works.
1433 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) {
1435 Second Pass -- Array Of Lists Representation
1437 Each state will be represented by a list of charid:state records
1438 (reg_trie_trans_le) the first such element holds the CUR and LEN
1439 points of the allocated array. (See defines above).
1441 We build the initial structure using the lists, and then convert
1442 it into the compressed table form which allows faster lookups
1443 (but cant be modified once converted).
1446 STRLEN transcount = 1;
1448 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1449 "%*sCompiling trie using list compiler\n",
1450 (int)depth * 2 + 2, ""));
1452 trie->states = PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1453 sizeof(reg_trie_state) );
1457 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1459 regnode * const noper = NEXTOPER( cur );
1460 U8 *uc = (U8*)STRING( noper );
1461 const U8 * const e = uc + STR_LEN( noper );
1462 U32 state = 1; /* required init */
1463 U16 charid = 0; /* sanity init */
1464 U8 *scan = (U8*)NULL; /* sanity init */
1465 STRLEN foldlen = 0; /* required init */
1466 U32 wordlen = 0; /* required init */
1467 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1469 if (OP(noper) != NOTHING) {
1470 for ( ; uc < e ; uc += len ) {
1475 charid = trie->charmap[ uvc ];
1477 SV** const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
1481 charid=(U16)SvIV( *svpp );
1484 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1491 if ( !trie->states[ state ].trans.list ) {
1492 TRIE_LIST_NEW( state );
1494 for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) {
1495 if ( TRIE_LIST_ITEM( state, check ).forid == charid ) {
1496 newstate = TRIE_LIST_ITEM( state, check ).newstate;
1501 newstate = next_alloc++;
1502 TRIE_LIST_PUSH( state, charid, newstate );
1507 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1511 TRIE_HANDLE_WORD(state);
1513 } /* end second pass */
1515 /* next alloc is the NEXT state to be allocated */
1516 trie->statecount = next_alloc;
1517 trie->states = PerlMemShared_realloc( trie->states, next_alloc
1518 * sizeof(reg_trie_state) );
1520 /* and now dump it out before we compress it */
1521 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_list(trie, widecharmap,
1522 revcharmap, next_alloc,
1527 = PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) );
1534 for( state=1 ; state < next_alloc ; state ++ ) {
1538 DEBUG_TRIE_COMPILE_MORE_r(
1539 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
1543 if (trie->states[state].trans.list) {
1544 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
1548 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1549 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
1550 if ( forid < minid ) {
1552 } else if ( forid > maxid ) {
1556 if ( transcount < tp + maxid - minid + 1) {
1559 = PerlMemShared_realloc( trie->trans,
1561 * sizeof(reg_trie_trans) );
1562 Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans );
1564 base = trie->uniquecharcount + tp - minid;
1565 if ( maxid == minid ) {
1567 for ( ; zp < tp ; zp++ ) {
1568 if ( ! trie->trans[ zp ].next ) {
1569 base = trie->uniquecharcount + zp - minid;
1570 trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1571 trie->trans[ zp ].check = state;
1577 trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1578 trie->trans[ tp ].check = state;
1583 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1584 const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid;
1585 trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate;
1586 trie->trans[ tid ].check = state;
1588 tp += ( maxid - minid + 1 );
1590 Safefree(trie->states[ state ].trans.list);
1593 DEBUG_TRIE_COMPILE_MORE_r(
1594 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
1597 trie->states[ state ].trans.base=base;
1599 trie->lasttrans = tp + 1;
1603 Second Pass -- Flat Table Representation.
1605 we dont use the 0 slot of either trans[] or states[] so we add 1 to each.
1606 We know that we will need Charcount+1 trans at most to store the data
1607 (one row per char at worst case) So we preallocate both structures
1608 assuming worst case.
1610 We then construct the trie using only the .next slots of the entry
1613 We use the .check field of the first entry of the node temporarily to
1614 make compression both faster and easier by keeping track of how many non
1615 zero fields are in the node.
1617 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
1620 There are two terms at use here: state as a TRIE_NODEIDX() which is a
1621 number representing the first entry of the node, and state as a
1622 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and
1623 TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there
1624 are 2 entrys per node. eg:
1632 The table is internally in the right hand, idx form. However as we also
1633 have to deal with the states array which is indexed by nodenum we have to
1634 use TRIE_NODENUM() to convert.
1637 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1638 "%*sCompiling trie using table compiler\n",
1639 (int)depth * 2 + 2, ""));
1641 trie->trans = PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 )
1642 * trie->uniquecharcount + 1,
1643 sizeof(reg_trie_trans) );
1644 trie->states = PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1645 sizeof(reg_trie_state) );
1646 next_alloc = trie->uniquecharcount + 1;
1649 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1651 regnode * const noper = NEXTOPER( cur );
1652 const U8 *uc = (U8*)STRING( noper );
1653 const U8 * const e = uc + STR_LEN( noper );
1655 U32 state = 1; /* required init */
1657 U16 charid = 0; /* sanity init */
1658 U32 accept_state = 0; /* sanity init */
1659 U8 *scan = (U8*)NULL; /* sanity init */
1661 STRLEN foldlen = 0; /* required init */
1662 U32 wordlen = 0; /* required init */
1663 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1665 if ( OP(noper) != NOTHING ) {
1666 for ( ; uc < e ; uc += len ) {
1671 charid = trie->charmap[ uvc ];
1673 SV* const * const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
1674 charid = svpp ? (U16)SvIV(*svpp) : 0;
1678 if ( !trie->trans[ state + charid ].next ) {
1679 trie->trans[ state + charid ].next = next_alloc;
1680 trie->trans[ state ].check++;
1681 next_alloc += trie->uniquecharcount;
1683 state = trie->trans[ state + charid ].next;
1685 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1687 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1690 accept_state = TRIE_NODENUM( state );
1691 TRIE_HANDLE_WORD(accept_state);
1693 } /* end second pass */
1695 /* and now dump it out before we compress it */
1696 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_table(trie, widecharmap,
1698 next_alloc, depth+1));
1702 * Inplace compress the table.*
1704 For sparse data sets the table constructed by the trie algorithm will
1705 be mostly 0/FAIL transitions or to put it another way mostly empty.
1706 (Note that leaf nodes will not contain any transitions.)
1708 This algorithm compresses the tables by eliminating most such
1709 transitions, at the cost of a modest bit of extra work during lookup:
1711 - Each states[] entry contains a .base field which indicates the
1712 index in the state[] array wheres its transition data is stored.
1714 - If .base is 0 there are no valid transitions from that node.
1716 - If .base is nonzero then charid is added to it to find an entry in
1719 -If trans[states[state].base+charid].check!=state then the
1720 transition is taken to be a 0/Fail transition. Thus if there are fail
1721 transitions at the front of the node then the .base offset will point
1722 somewhere inside the previous nodes data (or maybe even into a node
1723 even earlier), but the .check field determines if the transition is
1727 The following process inplace converts the table to the compressed
1728 table: We first do not compress the root node 1,and mark its all its
1729 .check pointers as 1 and set its .base pointer as 1 as well. This
1730 allows to do a DFA construction from the compressed table later, and
1731 ensures that any .base pointers we calculate later are greater than
1734 - We set 'pos' to indicate the first entry of the second node.
1736 - We then iterate over the columns of the node, finding the first and
1737 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
1738 and set the .check pointers accordingly, and advance pos
1739 appropriately and repreat for the next node. Note that when we copy
1740 the next pointers we have to convert them from the original
1741 NODEIDX form to NODENUM form as the former is not valid post
1744 - If a node has no transitions used we mark its base as 0 and do not
1745 advance the pos pointer.
1747 - If a node only has one transition we use a second pointer into the
1748 structure to fill in allocated fail transitions from other states.
1749 This pointer is independent of the main pointer and scans forward
1750 looking for null transitions that are allocated to a state. When it
1751 finds one it writes the single transition into the "hole". If the
1752 pointer doesnt find one the single transition is appended as normal.
1754 - Once compressed we can Renew/realloc the structures to release the
1757 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
1758 specifically Fig 3.47 and the associated pseudocode.
1762 const U32 laststate = TRIE_NODENUM( next_alloc );
1765 trie->statecount = laststate;
1767 for ( state = 1 ; state < laststate ; state++ ) {
1769 const U32 stateidx = TRIE_NODEIDX( state );
1770 const U32 o_used = trie->trans[ stateidx ].check;
1771 U32 used = trie->trans[ stateidx ].check;
1772 trie->trans[ stateidx ].check = 0;
1774 for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) {
1775 if ( flag || trie->trans[ stateidx + charid ].next ) {
1776 if ( trie->trans[ stateidx + charid ].next ) {
1778 for ( ; zp < pos ; zp++ ) {
1779 if ( ! trie->trans[ zp ].next ) {
1783 trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ;
1784 trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1785 trie->trans[ zp ].check = state;
1786 if ( ++zp > pos ) pos = zp;
1793 trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ;
1795 trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1796 trie->trans[ pos ].check = state;
1801 trie->lasttrans = pos + 1;
1802 trie->states = PerlMemShared_realloc( trie->states, laststate
1803 * sizeof(reg_trie_state) );
1804 DEBUG_TRIE_COMPILE_MORE_r(
1805 PerlIO_printf( Perl_debug_log,
1806 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
1807 (int)depth * 2 + 2,"",
1808 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ),
1811 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
1814 } /* end table compress */
1816 DEBUG_TRIE_COMPILE_MORE_r(
1817 PerlIO_printf(Perl_debug_log, "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n",
1818 (int)depth * 2 + 2, "",
1819 (UV)trie->statecount,
1820 (UV)trie->lasttrans)
1822 /* resize the trans array to remove unused space */
1823 trie->trans = PerlMemShared_realloc( trie->trans, trie->lasttrans
1824 * sizeof(reg_trie_trans) );
1826 /* and now dump out the compressed format */
1827 DEBUG_TRIE_COMPILE_r(dump_trie(trie, widecharmap, revcharmap, depth+1));
1829 { /* Modify the program and insert the new TRIE node*/
1830 U8 nodetype =(U8)(flags & 0xFF);
1834 regnode *optimize = NULL;
1836 U32 mjd_nodelen = 0;
1839 This means we convert either the first branch or the first Exact,
1840 depending on whether the thing following (in 'last') is a branch
1841 or not and whther first is the startbranch (ie is it a sub part of
1842 the alternation or is it the whole thing.)
1843 Assuming its a sub part we conver the EXACT otherwise we convert
1844 the whole branch sequence, including the first.
1846 /* Find the node we are going to overwrite */
1847 if ( first != startbranch || OP( last ) == BRANCH ) {
1848 /* branch sub-chain */
1849 NEXT_OFF( first ) = (U16)(last - first);
1851 mjd_offset= Node_Offset((convert));
1852 mjd_nodelen= Node_Length((convert));
1854 /* whole branch chain */
1857 const regnode *nop = NEXTOPER( convert );
1858 mjd_offset= Node_Offset((nop));
1859 mjd_nodelen= Node_Length((nop));
1864 PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
1865 (int)depth * 2 + 2, "",
1866 (UV)mjd_offset, (UV)mjd_nodelen)
1869 /* But first we check to see if there is a common prefix we can
1870 split out as an EXACT and put in front of the TRIE node. */
1871 trie->startstate= 1;
1872 if ( trie->bitmap && !widecharmap && !trie->jump ) {
1874 for ( state = 1 ; state < trie->statecount-1 ; state++ ) {
1878 const U32 base = trie->states[ state ].trans.base;
1880 if ( trie->states[state].wordnum )
1883 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
1884 if ( ( base + ofs >= trie->uniquecharcount ) &&
1885 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
1886 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
1888 if ( ++count > 1 ) {
1889 SV **tmp = av_fetch( revcharmap, ofs, 0);
1890 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
1891 if ( state == 1 ) break;
1893 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
1895 PerlIO_printf(Perl_debug_log,
1896 "%*sNew Start State=%"UVuf" Class: [",
1897 (int)depth * 2 + 2, "",
1900 SV ** const tmp = av_fetch( revcharmap, idx, 0);
1901 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
1903 TRIE_BITMAP_SET(trie,*ch);
1905 TRIE_BITMAP_SET(trie, folder[ *ch ]);
1907 PerlIO_printf(Perl_debug_log, (char*)ch)
1911 TRIE_BITMAP_SET(trie,*ch);
1913 TRIE_BITMAP_SET(trie,folder[ *ch ]);
1914 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
1920 SV **tmp = av_fetch( revcharmap, idx, 0);
1921 char *ch = SvPV_nolen( *tmp );
1923 SV *sv=sv_newmortal();
1924 PerlIO_printf( Perl_debug_log,
1925 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
1926 (int)depth * 2 + 2, "",
1928 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6,
1929 PL_colors[0], PL_colors[1],
1930 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1931 PERL_PV_ESCAPE_FIRSTCHAR
1936 OP( convert ) = nodetype;
1937 str=STRING(convert);
1948 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
1954 regnode *n = convert+NODE_SZ_STR(convert);
1955 NEXT_OFF(convert) = NODE_SZ_STR(convert);
1956 trie->startstate = state;
1957 trie->minlen -= (state - 1);
1958 trie->maxlen -= (state - 1);
1960 regnode *fix = convert;
1961 U32 word = trie->wordcount;
1963 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
1964 while( ++fix < n ) {
1965 Set_Node_Offset_Length(fix, 0, 0);
1968 SV ** const tmp = av_fetch( trie_words, word, 0 );
1970 if ( STR_LEN(convert) <= SvCUR(*tmp) )
1971 sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert));
1973 sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp));
1980 NEXT_OFF(convert) = (U16)(tail - convert);
1981 DEBUG_r(optimize= n);
1987 if ( trie->maxlen ) {
1988 NEXT_OFF( convert ) = (U16)(tail - convert);
1989 ARG_SET( convert, data_slot );
1990 /* Store the offset to the first unabsorbed branch in
1991 jump[0], which is otherwise unused by the jump logic.
1992 We use this when dumping a trie and during optimisation. */
1994 trie->jump[0] = (U16)(nextbranch - convert);
1997 if ( !trie->states[trie->startstate].wordnum && trie->bitmap &&
1998 ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
2000 OP( convert ) = TRIEC;
2001 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
2002 PerlMemShared_free(trie->bitmap);
2005 OP( convert ) = TRIE;
2007 /* store the type in the flags */
2008 convert->flags = nodetype;
2012 + regarglen[ OP( convert ) ];
2014 /* XXX We really should free up the resource in trie now,
2015 as we won't use them - (which resources?) dmq */
2017 /* needed for dumping*/
2018 DEBUG_r(if (optimize) {
2019 regnode *opt = convert;
2020 while ( ++opt < optimize) {
2021 Set_Node_Offset_Length(opt,0,0);
2024 Try to clean up some of the debris left after the
2027 while( optimize < jumper ) {
2028 mjd_nodelen += Node_Length((optimize));
2029 OP( optimize ) = OPTIMIZED;
2030 Set_Node_Offset_Length(optimize,0,0);
2033 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
2035 } /* end node insert */
2036 RExC_rxi->data->data[ data_slot + 1 ] = (void*)widecharmap;
2038 RExC_rxi->data->data[ data_slot + TRIE_WORDS_OFFSET ] = (void*)trie_words;
2039 RExC_rxi->data->data[ data_slot + 3 ] = (void*)revcharmap;
2041 SvREFCNT_dec(revcharmap);
2045 : trie->startstate>1
2051 S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth)
2053 /* The Trie is constructed and compressed now so we can build a fail array now if its needed
2055 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the
2056 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88
2059 We find the fail state for each state in the trie, this state is the longest proper
2060 suffix of the current states 'word' that is also a proper prefix of another word in our
2061 trie. State 1 represents the word '' and is the thus the default fail state. This allows
2062 the DFA not to have to restart after its tried and failed a word at a given point, it
2063 simply continues as though it had been matching the other word in the first place.
2065 'abcdgu'=~/abcdefg|cdgu/
2066 When we get to 'd' we are still matching the first word, we would encounter 'g' which would
2067 fail, which would bring use to the state representing 'd' in the second word where we would
2068 try 'g' and succeed, prodceding to match 'cdgu'.
2070 /* add a fail transition */
2071 const U32 trie_offset = ARG(source);
2072 reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[trie_offset];
2074 const U32 ucharcount = trie->uniquecharcount;
2075 const U32 numstates = trie->statecount;
2076 const U32 ubound = trie->lasttrans + ucharcount;
2080 U32 base = trie->states[ 1 ].trans.base;
2083 const U32 data_slot = add_data( pRExC_state, 1, "T" );
2084 GET_RE_DEBUG_FLAGS_DECL;
2086 PERL_UNUSED_ARG(depth);
2090 ARG_SET( stclass, data_slot );
2091 aho = PerlMemShared_calloc( 1, sizeof(reg_ac_data) );
2092 RExC_rxi->data->data[ data_slot ] = (void*)aho;
2093 aho->trie=trie_offset;
2094 aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) );
2095 Copy( trie->states, aho->states, numstates, reg_trie_state );
2096 Newxz( q, numstates, U32);
2097 aho->fail = PerlMemShared_calloc( numstates, sizeof(U32) );
2100 /* initialize fail[0..1] to be 1 so that we always have
2101 a valid final fail state */
2102 fail[ 0 ] = fail[ 1 ] = 1;
2104 for ( charid = 0; charid < ucharcount ; charid++ ) {
2105 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
2107 q[ q_write ] = newstate;
2108 /* set to point at the root */
2109 fail[ q[ q_write++ ] ]=1;
2112 while ( q_read < q_write) {
2113 const U32 cur = q[ q_read++ % numstates ];
2114 base = trie->states[ cur ].trans.base;
2116 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
2117 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
2119 U32 fail_state = cur;
2122 fail_state = fail[ fail_state ];
2123 fail_base = aho->states[ fail_state ].trans.base;
2124 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
2126 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
2127 fail[ ch_state ] = fail_state;
2128 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
2130 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
2132 q[ q_write++ % numstates] = ch_state;
2136 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
2137 when we fail in state 1, this allows us to use the
2138 charclass scan to find a valid start char. This is based on the principle
2139 that theres a good chance the string being searched contains lots of stuff
2140 that cant be a start char.
2142 fail[ 0 ] = fail[ 1 ] = 0;
2143 DEBUG_TRIE_COMPILE_r({
2144 PerlIO_printf(Perl_debug_log,
2145 "%*sStclass Failtable (%"UVuf" states): 0",
2146 (int)(depth * 2), "", (UV)numstates
2148 for( q_read=1; q_read<numstates; q_read++ ) {
2149 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
2151 PerlIO_printf(Perl_debug_log, "\n");
2154 /*RExC_seen |= REG_SEEN_TRIEDFA;*/
2159 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
2160 * These need to be revisited when a newer toolchain becomes available.
2162 #if defined(__sparc64__) && defined(__GNUC__)
2163 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
2164 # undef SPARC64_GCC_WORKAROUND
2165 # define SPARC64_GCC_WORKAROUND 1
2169 #define DEBUG_PEEP(str,scan,depth) \
2170 DEBUG_OPTIMISE_r({if (scan){ \
2171 SV * const mysv=sv_newmortal(); \
2172 regnode *Next = regnext(scan); \
2173 regprop(RExC_rx, mysv, scan); \
2174 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)\n", \
2175 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\
2176 Next ? (REG_NODE_NUM(Next)) : 0 ); \
2183 #define JOIN_EXACT(scan,min,flags) \
2184 if (PL_regkind[OP(scan)] == EXACT) \
2185 join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1)
2188 S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) {
2189 /* Merge several consecutive EXACTish nodes into one. */
2190 regnode *n = regnext(scan);
2192 regnode *next = scan + NODE_SZ_STR(scan);
2196 regnode *stop = scan;
2197 GET_RE_DEBUG_FLAGS_DECL;
2199 PERL_UNUSED_ARG(depth);
2201 #ifndef EXPERIMENTAL_INPLACESCAN
2202 PERL_UNUSED_ARG(flags);
2203 PERL_UNUSED_ARG(val);
2205 DEBUG_PEEP("join",scan,depth);
2207 /* Skip NOTHING, merge EXACT*. */
2209 ( PL_regkind[OP(n)] == NOTHING ||
2210 (stringok && (OP(n) == OP(scan))))
2212 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
2214 if (OP(n) == TAIL || n > next)
2216 if (PL_regkind[OP(n)] == NOTHING) {
2217 DEBUG_PEEP("skip:",n,depth);
2218 NEXT_OFF(scan) += NEXT_OFF(n);
2219 next = n + NODE_STEP_REGNODE;
2226 else if (stringok) {
2227 const unsigned int oldl = STR_LEN(scan);
2228 regnode * const nnext = regnext(n);
2230 DEBUG_PEEP("merg",n,depth);
2233 if (oldl + STR_LEN(n) > U8_MAX)
2235 NEXT_OFF(scan) += NEXT_OFF(n);
2236 STR_LEN(scan) += STR_LEN(n);
2237 next = n + NODE_SZ_STR(n);
2238 /* Now we can overwrite *n : */
2239 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
2247 #ifdef EXPERIMENTAL_INPLACESCAN
2248 if (flags && !NEXT_OFF(n)) {
2249 DEBUG_PEEP("atch", val, depth);
2250 if (reg_off_by_arg[OP(n)]) {
2251 ARG_SET(n, val - n);
2254 NEXT_OFF(n) = val - n;
2261 if (UTF && ( OP(scan) == EXACTF ) && ( STR_LEN(scan) >= 6 ) ) {
2263 Two problematic code points in Unicode casefolding of EXACT nodes:
2265 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
2266 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
2272 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
2273 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
2275 This means that in case-insensitive matching (or "loose matching",
2276 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
2277 length of the above casefolded versions) can match a target string
2278 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
2279 This would rather mess up the minimum length computation.
2281 What we'll do is to look for the tail four bytes, and then peek
2282 at the preceding two bytes to see whether we need to decrease
2283 the minimum length by four (six minus two).
2285 Thanks to the design of UTF-8, there cannot be false matches:
2286 A sequence of valid UTF-8 bytes cannot be a subsequence of
2287 another valid sequence of UTF-8 bytes.
2290 char * const s0 = STRING(scan), *s, *t;
2291 char * const s1 = s0 + STR_LEN(scan) - 1;
2292 char * const s2 = s1 - 4;
2293 #ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */
2294 const char t0[] = "\xaf\x49\xaf\x42";
2296 const char t0[] = "\xcc\x88\xcc\x81";
2298 const char * const t1 = t0 + 3;
2301 s < s2 && (t = ninstr(s, s1, t0, t1));
2304 if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) ||
2305 ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5))
2307 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
2308 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
2316 n = scan + NODE_SZ_STR(scan);
2318 if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) {
2325 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
2329 /* REx optimizer. Converts nodes into quickier variants "in place".
2330 Finds fixed substrings. */
2332 /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
2333 to the position after last scanned or to NULL. */
2335 #define INIT_AND_WITHP \
2336 assert(!and_withp); \
2337 Newx(and_withp,1,struct regnode_charclass_class); \
2338 SAVEFREEPV(and_withp)
2340 /* this is a chain of data about sub patterns we are processing that
2341 need to be handled seperately/specially in study_chunk. Its so
2342 we can simulate recursion without losing state. */
2344 typedef struct scan_frame {
2345 regnode *last; /* last node to process in this frame */
2346 regnode *next; /* next node to process when last is reached */
2347 struct scan_frame *prev; /*previous frame*/
2348 I32 stop; /* what stopparen do we use */
2352 #define SCAN_COMMIT(s, data, m) scan_commit(s, data, m, is_inf)
2355 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
2356 I32 *minlenp, I32 *deltap,
2361 struct regnode_charclass_class *and_withp,
2362 U32 flags, U32 depth)
2363 /* scanp: Start here (read-write). */
2364 /* deltap: Write maxlen-minlen here. */
2365 /* last: Stop before this one. */
2366 /* data: string data about the pattern */
2367 /* stopparen: treat close N as END */
2368 /* recursed: which subroutines have we recursed into */
2369 /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */
2372 I32 min = 0, pars = 0, code;
2373 regnode *scan = *scanp, *next;
2375 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
2376 int is_inf_internal = 0; /* The studied chunk is infinite */
2377 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
2378 scan_data_t data_fake;
2379 SV *re_trie_maxbuff = NULL;
2380 regnode *first_non_open = scan;
2381 I32 stopmin = I32_MAX;
2382 scan_frame *frame = NULL;
2384 GET_RE_DEBUG_FLAGS_DECL;
2387 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
2391 while (first_non_open && OP(first_non_open) == OPEN)
2392 first_non_open=regnext(first_non_open);
2397 while ( scan && OP(scan) != END && scan < last ){
2398 /* Peephole optimizer: */
2399 DEBUG_STUDYDATA("Peep:", data,depth);
2400 DEBUG_PEEP("Peep",scan,depth);
2401 JOIN_EXACT(scan,&min,0);
2403 /* Follow the next-chain of the current node and optimize
2404 away all the NOTHINGs from it. */
2405 if (OP(scan) != CURLYX) {
2406 const int max = (reg_off_by_arg[OP(scan)]
2408 /* I32 may be smaller than U16 on CRAYs! */
2409 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
2410 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
2414 /* Skip NOTHING and LONGJMP. */
2415 while ((n = regnext(n))
2416 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
2417 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
2418 && off + noff < max)
2420 if (reg_off_by_arg[OP(scan)])
2423 NEXT_OFF(scan) = off;
2428 /* The principal pseudo-switch. Cannot be a switch, since we
2429 look into several different things. */
2430 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
2431 || OP(scan) == IFTHEN) {
2432 next = regnext(scan);
2434 /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */
2436 if (OP(next) == code || code == IFTHEN) {
2437 /* NOTE - There is similar code to this block below for handling
2438 TRIE nodes on a re-study. If you change stuff here check there
2440 I32 max1 = 0, min1 = I32_MAX, num = 0;
2441 struct regnode_charclass_class accum;
2442 regnode * const startbranch=scan;
2444 if (flags & SCF_DO_SUBSTR)
2445 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot merge strings after this. */
2446 if (flags & SCF_DO_STCLASS)
2447 cl_init_zero(pRExC_state, &accum);
2449 while (OP(scan) == code) {
2450 I32 deltanext, minnext, f = 0, fake;
2451 struct regnode_charclass_class this_class;
2454 data_fake.flags = 0;
2456 data_fake.whilem_c = data->whilem_c;
2457 data_fake.last_closep = data->last_closep;
2460 data_fake.last_closep = &fake;
2462 data_fake.pos_delta = delta;
2463 next = regnext(scan);
2464 scan = NEXTOPER(scan);
2466 scan = NEXTOPER(scan);
2467 if (flags & SCF_DO_STCLASS) {
2468 cl_init(pRExC_state, &this_class);
2469 data_fake.start_class = &this_class;
2470 f = SCF_DO_STCLASS_AND;
2472 if (flags & SCF_WHILEM_VISITED_POS)
2473 f |= SCF_WHILEM_VISITED_POS;
2475 /* we suppose the run is continuous, last=next...*/
2476 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2478 stopparen, recursed, NULL, f,depth+1);
2481 if (max1 < minnext + deltanext)
2482 max1 = minnext + deltanext;
2483 if (deltanext == I32_MAX)
2484 is_inf = is_inf_internal = 1;
2486 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
2488 if (data_fake.flags & SCF_SEEN_ACCEPT) {
2489 if ( stopmin > minnext)
2490 stopmin = min + min1;
2491 flags &= ~SCF_DO_SUBSTR;
2493 data->flags |= SCF_SEEN_ACCEPT;
2496 if (data_fake.flags & SF_HAS_EVAL)
2497 data->flags |= SF_HAS_EVAL;
2498 data->whilem_c = data_fake.whilem_c;
2500 if (flags & SCF_DO_STCLASS)
2501 cl_or(pRExC_state, &accum, &this_class);
2503 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
2505 if (flags & SCF_DO_SUBSTR) {
2506 data->pos_min += min1;
2507 data->pos_delta += max1 - min1;
2508 if (max1 != min1 || is_inf)
2509 data->longest = &(data->longest_float);
2512 delta += max1 - min1;
2513 if (flags & SCF_DO_STCLASS_OR) {
2514 cl_or(pRExC_state, data->start_class, &accum);
2516 cl_and(data->start_class, and_withp);
2517 flags &= ~SCF_DO_STCLASS;
2520 else if (flags & SCF_DO_STCLASS_AND) {
2522 cl_and(data->start_class, &accum);
2523 flags &= ~SCF_DO_STCLASS;
2526 /* Switch to OR mode: cache the old value of
2527 * data->start_class */
2529 StructCopy(data->start_class, and_withp,
2530 struct regnode_charclass_class);
2531 flags &= ~SCF_DO_STCLASS_AND;
2532 StructCopy(&accum, data->start_class,
2533 struct regnode_charclass_class);
2534 flags |= SCF_DO_STCLASS_OR;
2535 data->start_class->flags |= ANYOF_EOS;
2539 if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) {
2542 Assuming this was/is a branch we are dealing with: 'scan' now
2543 points at the item that follows the branch sequence, whatever
2544 it is. We now start at the beginning of the sequence and look
2551 which would be constructed from a pattern like /A|LIST|OF|WORDS/
2553 If we can find such a subseqence we need to turn the first
2554 element into a trie and then add the subsequent branch exact
2555 strings to the trie.
2559 1. patterns where the whole set of branch can be converted.
2561 2. patterns where only a subset can be converted.
2563 In case 1 we can replace the whole set with a single regop
2564 for the trie. In case 2 we need to keep the start and end
2567 'BRANCH EXACT; BRANCH EXACT; BRANCH X'
2568 becomes BRANCH TRIE; BRANCH X;
2570 There is an additional case, that being where there is a
2571 common prefix, which gets split out into an EXACT like node
2572 preceding the TRIE node.
2574 If x(1..n)==tail then we can do a simple trie, if not we make
2575 a "jump" trie, such that when we match the appropriate word
2576 we "jump" to the appopriate tail node. Essentailly we turn
2577 a nested if into a case structure of sorts.
2582 if (!re_trie_maxbuff) {
2583 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2584 if (!SvIOK(re_trie_maxbuff))
2585 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2587 if ( SvIV(re_trie_maxbuff)>=0 ) {
2589 regnode *first = (regnode *)NULL;
2590 regnode *last = (regnode *)NULL;
2591 regnode *tail = scan;
2596 SV * const mysv = sv_newmortal(); /* for dumping */
2598 /* var tail is used because there may be a TAIL
2599 regop in the way. Ie, the exacts will point to the
2600 thing following the TAIL, but the last branch will
2601 point at the TAIL. So we advance tail. If we
2602 have nested (?:) we may have to move through several
2606 while ( OP( tail ) == TAIL ) {
2607 /* this is the TAIL generated by (?:) */
2608 tail = regnext( tail );
2613 regprop(RExC_rx, mysv, tail );
2614 PerlIO_printf( Perl_debug_log, "%*s%s%s\n",
2615 (int)depth * 2 + 2, "",
2616 "Looking for TRIE'able sequences. Tail node is: ",
2617 SvPV_nolen_const( mysv )
2623 step through the branches, cur represents each
2624 branch, noper is the first thing to be matched
2625 as part of that branch and noper_next is the
2626 regnext() of that node. if noper is an EXACT
2627 and noper_next is the same as scan (our current
2628 position in the regex) then the EXACT branch is
2629 a possible optimization target. Once we have
2630 two or more consequetive such branches we can
2631 create a trie of the EXACT's contents and stich
2632 it in place. If the sequence represents all of
2633 the branches we eliminate the whole thing and
2634 replace it with a single TRIE. If it is a
2635 subsequence then we need to stitch it in. This
2636 means the first branch has to remain, and needs
2637 to be repointed at the item on the branch chain
2638 following the last branch optimized. This could
2639 be either a BRANCH, in which case the
2640 subsequence is internal, or it could be the
2641 item following the branch sequence in which
2642 case the subsequence is at the end.
2646 /* dont use tail as the end marker for this traverse */
2647 for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) {
2648 regnode * const noper = NEXTOPER( cur );
2649 #if defined(DEBUGGING) || defined(NOJUMPTRIE)
2650 regnode * const noper_next = regnext( noper );
2654 regprop(RExC_rx, mysv, cur);
2655 PerlIO_printf( Perl_debug_log, "%*s- %s (%d)",
2656 (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) );
2658 regprop(RExC_rx, mysv, noper);
2659 PerlIO_printf( Perl_debug_log, " -> %s",
2660 SvPV_nolen_const(mysv));
2663 regprop(RExC_rx, mysv, noper_next );
2664 PerlIO_printf( Perl_debug_log,"\t=> %s\t",
2665 SvPV_nolen_const(mysv));
2667 PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n",
2668 REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) );
2670 if ( (((first && optype!=NOTHING) ? OP( noper ) == optype
2671 : PL_regkind[ OP( noper ) ] == EXACT )
2672 || OP(noper) == NOTHING )
2674 && noper_next == tail
2679 if ( !first || optype == NOTHING ) {
2680 if (!first) first = cur;
2681 optype = OP( noper );
2687 make_trie( pRExC_state,
2688 startbranch, first, cur, tail, count,
2691 if ( PL_regkind[ OP( noper ) ] == EXACT
2693 && noper_next == tail
2698 optype = OP( noper );
2708 regprop(RExC_rx, mysv, cur);
2709 PerlIO_printf( Perl_debug_log,
2710 "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2,
2711 "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur));
2715 made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 );
2716 #ifdef TRIE_STUDY_OPT
2717 if ( ((made == MADE_EXACT_TRIE &&
2718 startbranch == first)
2719 || ( first_non_open == first )) &&
2721 flags |= SCF_TRIE_RESTUDY;
2722 if ( startbranch == first
2725 RExC_seen &=~REG_TOP_LEVEL_BRANCHES;
2735 else if ( code == BRANCHJ ) { /* single branch is optimized. */
2736 scan = NEXTOPER(NEXTOPER(scan));
2737 } else /* single branch is optimized. */
2738 scan = NEXTOPER(scan);
2740 } else if (OP(scan) == SUSPEND || OP(scan) == GOSUB || OP(scan) == GOSTART) {
2741 scan_frame *newframe = NULL;
2746 if (OP(scan) != SUSPEND) {
2747 /* set the pointer */
2748 if (OP(scan) == GOSUB) {
2750 RExC_recurse[ARG2L(scan)] = scan;
2751 start = RExC_open_parens[paren-1];
2752 end = RExC_close_parens[paren-1];
2755 start = RExC_rxi->program + 1;
2759 Newxz(recursed, (((RExC_npar)>>3) +1), U8);
2760 SAVEFREEPV(recursed);
2762 if (!PAREN_TEST(recursed,paren+1)) {
2763 PAREN_SET(recursed,paren+1);
2764 Newx(newframe,1,scan_frame);
2766 if (flags & SCF_DO_SUBSTR) {
2767 SCAN_COMMIT(pRExC_state,data,minlenp);
2768 data->longest = &(data->longest_float);
2770 is_inf = is_inf_internal = 1;
2771 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
2772 cl_anything(pRExC_state, data->start_class);
2773 flags &= ~SCF_DO_STCLASS;
2776 Newx(newframe,1,scan_frame);
2779 end = regnext(scan);
2784 SAVEFREEPV(newframe);
2785 newframe->next = regnext(scan);
2786 newframe->last = last;
2787 newframe->stop = stopparen;
2788 newframe->prev = frame;
2798 else if (OP(scan) == EXACT) {
2799 I32 l = STR_LEN(scan);
2802 const U8 * const s = (U8*)STRING(scan);
2803 l = utf8_length(s, s + l);
2804 uc = utf8_to_uvchr(s, NULL);
2806 uc = *((U8*)STRING(scan));
2809 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
2810 /* The code below prefers earlier match for fixed
2811 offset, later match for variable offset. */
2812 if (data->last_end == -1) { /* Update the start info. */
2813 data->last_start_min = data->pos_min;
2814 data->last_start_max = is_inf
2815 ? I32_MAX : data->pos_min + data->pos_delta;
2817 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
2819 SvUTF8_on(data->last_found);
2821 SV * const sv = data->last_found;
2822 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
2823 mg_find(sv, PERL_MAGIC_utf8) : NULL;
2824 if (mg && mg->mg_len >= 0)
2825 mg->mg_len += utf8_length((U8*)STRING(scan),
2826 (U8*)STRING(scan)+STR_LEN(scan));
2828 data->last_end = data->pos_min + l;
2829 data->pos_min += l; /* As in the first entry. */
2830 data->flags &= ~SF_BEFORE_EOL;
2832 if (flags & SCF_DO_STCLASS_AND) {
2833 /* Check whether it is compatible with what we know already! */
2837 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2838 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2839 && (!(data->start_class->flags & ANYOF_FOLD)
2840 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2843 ANYOF_CLASS_ZERO(data->start_class);
2844 ANYOF_BITMAP_ZERO(data->start_class);
2846 ANYOF_BITMAP_SET(data->start_class, uc);
2847 data->start_class->flags &= ~ANYOF_EOS;
2849 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
2851 else if (flags & SCF_DO_STCLASS_OR) {
2852 /* false positive possible if the class is case-folded */
2854 ANYOF_BITMAP_SET(data->start_class, uc);
2856 data->start_class->flags |= ANYOF_UNICODE_ALL;
2857 data->start_class->flags &= ~ANYOF_EOS;
2858 cl_and(data->start_class, and_withp);
2860 flags &= ~SCF_DO_STCLASS;
2862 else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */
2863 I32 l = STR_LEN(scan);
2864 UV uc = *((U8*)STRING(scan));
2866 /* Search for fixed substrings supports EXACT only. */
2867 if (flags & SCF_DO_SUBSTR) {
2869 SCAN_COMMIT(pRExC_state, data, minlenp);
2872 const U8 * const s = (U8 *)STRING(scan);
2873 l = utf8_length(s, s + l);
2874 uc = utf8_to_uvchr(s, NULL);
2877 if (flags & SCF_DO_SUBSTR)
2879 if (flags & SCF_DO_STCLASS_AND) {
2880 /* Check whether it is compatible with what we know already! */
2884 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2885 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2886 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2888 ANYOF_CLASS_ZERO(data->start_class);
2889 ANYOF_BITMAP_ZERO(data->start_class);
2891 ANYOF_BITMAP_SET(data->start_class, uc);
2892 data->start_class->flags &= ~ANYOF_EOS;
2893 data->start_class->flags |= ANYOF_FOLD;
2894 if (OP(scan) == EXACTFL)
2895 data->start_class->flags |= ANYOF_LOCALE;
2898 else if (flags & SCF_DO_STCLASS_OR) {
2899 if (data->start_class->flags & ANYOF_FOLD) {
2900 /* false positive possible if the class is case-folded.
2901 Assume that the locale settings are the same... */
2903 ANYOF_BITMAP_SET(data->start_class, uc);
2904 data->start_class->flags &= ~ANYOF_EOS;
2906 cl_and(data->start_class, and_withp);
2908 flags &= ~SCF_DO_STCLASS;
2910 else if (strchr((const char*)PL_varies,OP(scan))) {
2911 I32 mincount, maxcount, minnext, deltanext, fl = 0;
2912 I32 f = flags, pos_before = 0;
2913 regnode * const oscan = scan;
2914 struct regnode_charclass_class this_class;
2915 struct regnode_charclass_class *oclass = NULL;
2916 I32 next_is_eval = 0;
2918 switch (PL_regkind[OP(scan)]) {
2919 case WHILEM: /* End of (?:...)* . */
2920 scan = NEXTOPER(scan);
2923 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
2924 next = NEXTOPER(scan);
2925 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
2927 maxcount = REG_INFTY;
2928 next = regnext(scan);
2929 scan = NEXTOPER(scan);
2933 if (flags & SCF_DO_SUBSTR)
2938 if (flags & SCF_DO_STCLASS) {
2940 maxcount = REG_INFTY;
2941 next = regnext(scan);
2942 scan = NEXTOPER(scan);
2945 is_inf = is_inf_internal = 1;
2946 scan = regnext(scan);
2947 if (flags & SCF_DO_SUBSTR) {
2948 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */
2949 data->longest = &(data->longest_float);
2951 goto optimize_curly_tail;
2953 if (stopparen>0 && (OP(scan)==CURLYN || OP(scan)==CURLYM)
2954 && (scan->flags == stopparen))
2959 mincount = ARG1(scan);
2960 maxcount = ARG2(scan);
2962 next = regnext(scan);
2963 if (OP(scan) == CURLYX) {
2964 I32 lp = (data ? *(data->last_closep) : 0);
2965 scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX);
2967 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
2968 next_is_eval = (OP(scan) == EVAL);
2970 if (flags & SCF_DO_SUBSTR) {
2971 if (mincount == 0) SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */
2972 pos_before = data->pos_min;
2976 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
2978 data->flags |= SF_IS_INF;
2980 if (flags & SCF_DO_STCLASS) {
2981 cl_init(pRExC_state, &this_class);
2982 oclass = data->start_class;
2983 data->start_class = &this_class;
2984 f |= SCF_DO_STCLASS_AND;
2985 f &= ~SCF_DO_STCLASS_OR;
2987 /* These are the cases when once a subexpression
2988 fails at a particular position, it cannot succeed
2989 even after backtracking at the enclosing scope.
2991 XXXX what if minimal match and we are at the
2992 initial run of {n,m}? */
2993 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
2994 f &= ~SCF_WHILEM_VISITED_POS;
2996 /* This will finish on WHILEM, setting scan, or on NULL: */
2997 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2998 last, data, stopparen, recursed, NULL,
3000 ? (f & ~SCF_DO_SUBSTR) : f),depth+1);
3002 if (flags & SCF_DO_STCLASS)
3003 data->start_class = oclass;
3004 if (mincount == 0 || minnext == 0) {
3005 if (flags & SCF_DO_STCLASS_OR) {
3006 cl_or(pRExC_state, data->start_class, &this_class);
3008 else if (flags & SCF_DO_STCLASS_AND) {
3009 /* Switch to OR mode: cache the old value of
3010 * data->start_class */
3012 StructCopy(data->start_class, and_withp,
3013 struct regnode_charclass_class);
3014 flags &= ~SCF_DO_STCLASS_AND;
3015 StructCopy(&this_class, data->start_class,
3016 struct regnode_charclass_class);
3017 flags |= SCF_DO_STCLASS_OR;
3018 data->start_class->flags |= ANYOF_EOS;
3020 } else { /* Non-zero len */
3021 if (flags & SCF_DO_STCLASS_OR) {
3022 cl_or(pRExC_state, data->start_class, &this_class);
3023 cl_and(data->start_class, and_withp);
3025 else if (flags & SCF_DO_STCLASS_AND)
3026 cl_and(data->start_class, &this_class);
3027 flags &= ~SCF_DO_STCLASS;
3029 if (!scan) /* It was not CURLYX, but CURLY. */
3031 if ( /* ? quantifier ok, except for (?{ ... }) */
3032 (next_is_eval || !(mincount == 0 && maxcount == 1))
3033 && (minnext == 0) && (deltanext == 0)
3034 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
3035 && maxcount <= REG_INFTY/3 /* Complement check for big count */
3036 && ckWARN(WARN_REGEXP))
3039 "Quantifier unexpected on zero-length expression");
3042 min += minnext * mincount;
3043 is_inf_internal |= ((maxcount == REG_INFTY
3044 && (minnext + deltanext) > 0)
3045 || deltanext == I32_MAX);
3046 is_inf |= is_inf_internal;
3047 delta += (minnext + deltanext) * maxcount - minnext * mincount;
3049 /* Try powerful optimization CURLYX => CURLYN. */
3050 if ( OP(oscan) == CURLYX && data
3051 && data->flags & SF_IN_PAR
3052 && !(data->flags & SF_HAS_EVAL)
3053 && !deltanext && minnext == 1 ) {
3054 /* Try to optimize to CURLYN. */
3055 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
3056 regnode * const nxt1 = nxt;
3063 if (!strchr((const char*)PL_simple,OP(nxt))
3064 && !(PL_regkind[OP(nxt)] == EXACT
3065 && STR_LEN(nxt) == 1))
3071 if (OP(nxt) != CLOSE)
3073 if (RExC_open_parens) {
3074 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3075 RExC_close_parens[ARG(nxt1)-1]=nxt+2; /*close->while*/
3077 /* Now we know that nxt2 is the only contents: */
3078 oscan->flags = (U8)ARG(nxt);
3080 OP(nxt1) = NOTHING; /* was OPEN. */
3083 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3084 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
3085 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
3086 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3087 OP(nxt + 1) = OPTIMIZED; /* was count. */
3088 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
3093 /* Try optimization CURLYX => CURLYM. */
3094 if ( OP(oscan) == CURLYX && data
3095 && !(data->flags & SF_HAS_PAR)
3096 && !(data->flags & SF_HAS_EVAL)
3097 && !deltanext /* atom is fixed width */
3098 && minnext != 0 /* CURLYM can't handle zero width */
3100 /* XXXX How to optimize if data == 0? */
3101 /* Optimize to a simpler form. */
3102 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
3106 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
3107 && (OP(nxt2) != WHILEM))
3109 OP(nxt2) = SUCCEED; /* Whas WHILEM */
3110 /* Need to optimize away parenths. */
3111 if (data->flags & SF_IN_PAR) {
3112 /* Set the parenth number. */
3113 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
3115 if (OP(nxt) != CLOSE)
3116 FAIL("Panic opt close");
3117 oscan->flags = (U8)ARG(nxt);
3118 if (RExC_open_parens) {
3119 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3120 RExC_close_parens[ARG(nxt1)-1]=nxt2+1; /*close->NOTHING*/
3122 OP(nxt1) = OPTIMIZED; /* was OPEN. */
3123 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3126 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3127 OP(nxt + 1) = OPTIMIZED; /* was count. */
3128 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
3129 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
3132 while ( nxt1 && (OP(nxt1) != WHILEM)) {
3133 regnode *nnxt = regnext(nxt1);
3136 if (reg_off_by_arg[OP(nxt1)])
3137 ARG_SET(nxt1, nxt2 - nxt1);
3138 else if (nxt2 - nxt1 < U16_MAX)
3139 NEXT_OFF(nxt1) = nxt2 - nxt1;
3141 OP(nxt) = NOTHING; /* Cannot beautify */
3146 /* Optimize again: */
3147 study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt,
3148 NULL, stopparen, recursed, NULL, 0,depth+1);
3153 else if ((OP(oscan) == CURLYX)
3154 && (flags & SCF_WHILEM_VISITED_POS)
3155 /* See the comment on a similar expression above.
3156 However, this time it not a subexpression
3157 we care about, but the expression itself. */
3158 && (maxcount == REG_INFTY)
3159 && data && ++data->whilem_c < 16) {
3160 /* This stays as CURLYX, we can put the count/of pair. */
3161 /* Find WHILEM (as in regexec.c) */
3162 regnode *nxt = oscan + NEXT_OFF(oscan);
3164 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
3166 PREVOPER(nxt)->flags = (U8)(data->whilem_c
3167 | (RExC_whilem_seen << 4)); /* On WHILEM */
3169 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
3171 if (flags & SCF_DO_SUBSTR) {
3172 SV *last_str = NULL;
3173 int counted = mincount != 0;
3175 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
3176 #if defined(SPARC64_GCC_WORKAROUND)
3179 const char *s = NULL;
3182 if (pos_before >= data->last_start_min)
3185 b = data->last_start_min;
3188 s = SvPV_const(data->last_found, l);
3189 old = b - data->last_start_min;
3192 I32 b = pos_before >= data->last_start_min
3193 ? pos_before : data->last_start_min;
3195 const char * const s = SvPV_const(data->last_found, l);
3196 I32 old = b - data->last_start_min;
3200 old = utf8_hop((U8*)s, old) - (U8*)s;
3203 /* Get the added string: */
3204 last_str = newSVpvn(s + old, l);
3206 SvUTF8_on(last_str);
3207 if (deltanext == 0 && pos_before == b) {
3208 /* What was added is a constant string */
3210 SvGROW(last_str, (mincount * l) + 1);
3211 repeatcpy(SvPVX(last_str) + l,
3212 SvPVX_const(last_str), l, mincount - 1);
3213 SvCUR_set(last_str, SvCUR(last_str) * mincount);
3214 /* Add additional parts. */
3215 SvCUR_set(data->last_found,
3216 SvCUR(data->last_found) - l);
3217 sv_catsv(data->last_found, last_str);
3219 SV * sv = data->last_found;
3221 SvUTF8(sv) && SvMAGICAL(sv) ?
3222 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3223 if (mg && mg->mg_len >= 0)
3224 mg->mg_len += CHR_SVLEN(last_str);
3226 data->last_end += l * (mincount - 1);
3229 /* start offset must point into the last copy */
3230 data->last_start_min += minnext * (mincount - 1);
3231 data->last_start_max += is_inf ? I32_MAX
3232 : (maxcount - 1) * (minnext + data->pos_delta);
3235 /* It is counted once already... */
3236 data->pos_min += minnext * (mincount - counted);
3237 data->pos_delta += - counted * deltanext +
3238 (minnext + deltanext) * maxcount - minnext * mincount;
3239 if (mincount != maxcount) {
3240 /* Cannot extend fixed substrings found inside
3242 SCAN_COMMIT(pRExC_state,data,minlenp);
3243 if (mincount && last_str) {
3244 SV * const sv = data->last_found;
3245 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3246 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3250 sv_setsv(sv, last_str);
3251 data->last_end = data->pos_min;
3252 data->last_start_min =
3253 data->pos_min - CHR_SVLEN(last_str);
3254 data->last_start_max = is_inf
3256 : data->pos_min + data->pos_delta
3257 - CHR_SVLEN(last_str);
3259 data->longest = &(data->longest_float);
3261 SvREFCNT_dec(last_str);
3263 if (data && (fl & SF_HAS_EVAL))
3264 data->flags |= SF_HAS_EVAL;
3265 optimize_curly_tail:
3266 if (OP(oscan) != CURLYX) {
3267 while (PL_regkind[OP(next = regnext(oscan))] == NOTHING
3269 NEXT_OFF(oscan) += NEXT_OFF(next);
3272 default: /* REF and CLUMP only? */
3273 if (flags & SCF_DO_SUBSTR) {
3274 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3275 data->longest = &(data->longest_float);
3277 is_inf = is_inf_internal = 1;
3278 if (flags & SCF_DO_STCLASS_OR)
3279 cl_anything(pRExC_state, data->start_class);
3280 flags &= ~SCF_DO_STCLASS;
3284 else if (strchr((const char*)PL_simple,OP(scan))) {
3287 if (flags & SCF_DO_SUBSTR) {
3288 SCAN_COMMIT(pRExC_state,data,minlenp);
3292 if (flags & SCF_DO_STCLASS) {
3293 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3295 /* Some of the logic below assumes that switching
3296 locale on will only add false positives. */
3297 switch (PL_regkind[OP(scan)]) {
3301 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
3302 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3303 cl_anything(pRExC_state, data->start_class);
3306 if (OP(scan) == SANY)
3308 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
3309 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
3310 || (data->start_class->flags & ANYOF_CLASS));
3311 cl_anything(pRExC_state, data->start_class);
3313 if (flags & SCF_DO_STCLASS_AND || !value)
3314 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
3317 if (flags & SCF_DO_STCLASS_AND)
3318 cl_and(data->start_class,
3319 (struct regnode_charclass_class*)scan);
3321 cl_or(pRExC_state, data->start_class,
3322 (struct regnode_charclass_class*)scan);
3325 if (flags & SCF_DO_STCLASS_AND) {
3326 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3327 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3328 for (value = 0; value < 256; value++)
3329 if (!isALNUM(value))
3330 ANYOF_BITMAP_CLEAR(data->start_class, value);
3334 if (data->start_class->flags & ANYOF_LOCALE)
3335 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3337 for (value = 0; value < 256; value++)
3339 ANYOF_BITMAP_SET(data->start_class, value);
3344 if (flags & SCF_DO_STCLASS_AND) {
3345 if (data->start_class->flags & ANYOF_LOCALE)
3346 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3349 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3350 data->start_class->flags |= ANYOF_LOCALE;
3354 if (flags & SCF_DO_STCLASS_AND) {
3355 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3356 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3357 for (value = 0; value < 256; value++)
3359 ANYOF_BITMAP_CLEAR(data->start_class, value);
3363 if (data->start_class->flags & ANYOF_LOCALE)
3364 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3366 for (value = 0; value < 256; value++)
3367 if (!isALNUM(value))
3368 ANYOF_BITMAP_SET(data->start_class, value);
3373 if (flags & SCF_DO_STCLASS_AND) {
3374 if (data->start_class->flags & ANYOF_LOCALE)
3375 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3378 data->start_class->flags |= ANYOF_LOCALE;
3379 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3383 if (flags & SCF_DO_STCLASS_AND) {
3384 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3385 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3386 for (value = 0; value < 256; value++)
3387 if (!isSPACE(value))
3388 ANYOF_BITMAP_CLEAR(data->start_class, value);
3392 if (data->start_class->flags & ANYOF_LOCALE)
3393 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3395 for (value = 0; value < 256; value++)
3397 ANYOF_BITMAP_SET(data->start_class, value);
3402 if (flags & SCF_DO_STCLASS_AND) {
3403 if (data->start_class->flags & ANYOF_LOCALE)
3404 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3407 data->start_class->flags |= ANYOF_LOCALE;
3408 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3412 if (flags & SCF_DO_STCLASS_AND) {
3413 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3414 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3415 for (value = 0; value < 256; value++)
3417 ANYOF_BITMAP_CLEAR(data->start_class, value);
3421 if (data->start_class->flags & ANYOF_LOCALE)
3422 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3424 for (value = 0; value < 256; value++)
3425 if (!isSPACE(value))
3426 ANYOF_BITMAP_SET(data->start_class, value);
3431 if (flags & SCF_DO_STCLASS_AND) {
3432 if (data->start_class->flags & ANYOF_LOCALE) {
3433 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3434 for (value = 0; value < 256; value++)
3435 if (!isSPACE(value))
3436 ANYOF_BITMAP_CLEAR(data->start_class, value);
3440 data->start_class->flags |= ANYOF_LOCALE;
3441 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3445 if (flags & SCF_DO_STCLASS_AND) {
3446 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
3447 for (value = 0; value < 256; value++)
3448 if (!isDIGIT(value))
3449 ANYOF_BITMAP_CLEAR(data->start_class, value);
3452 if (data->start_class->flags & ANYOF_LOCALE)
3453 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
3455 for (value = 0; value < 256; value++)
3457 ANYOF_BITMAP_SET(data->start_class, value);
3462 if (flags & SCF_DO_STCLASS_AND) {
3463 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
3464 for (value = 0; value < 256; value++)
3466 ANYOF_BITMAP_CLEAR(data->start_class, value);
3469 if (data->start_class->flags & ANYOF_LOCALE)
3470 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
3472 for (value = 0; value < 256; value++)
3473 if (!isDIGIT(value))
3474 ANYOF_BITMAP_SET(data->start_class, value);
3479 if (flags & SCF_DO_STCLASS_OR)
3480 cl_and(data->start_class, and_withp);
3481 flags &= ~SCF_DO_STCLASS;
3484 else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
3485 data->flags |= (OP(scan) == MEOL
3489 else if ( PL_regkind[OP(scan)] == BRANCHJ
3490 /* Lookbehind, or need to calculate parens/evals/stclass: */
3491 && (scan->flags || data || (flags & SCF_DO_STCLASS))
3492 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
3493 if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3494 || OP(scan) == UNLESSM )
3496 /* Negative Lookahead/lookbehind
3497 In this case we can't do fixed string optimisation.
3500 I32 deltanext, minnext, fake = 0;
3502 struct regnode_charclass_class intrnl;
3505 data_fake.flags = 0;
3507 data_fake.whilem_c = data->whilem_c;
3508 data_fake.last_closep = data->last_closep;
3511 data_fake.last_closep = &fake;
3512 data_fake.pos_delta = delta;
3513 if ( flags & SCF_DO_STCLASS && !scan->flags
3514 && OP(scan) == IFMATCH ) { /* Lookahead */
3515 cl_init(pRExC_state, &intrnl);
3516 data_fake.start_class = &intrnl;
3517 f |= SCF_DO_STCLASS_AND;
3519 if (flags & SCF_WHILEM_VISITED_POS)
3520 f |= SCF_WHILEM_VISITED_POS;
3521 next = regnext(scan);
3522 nscan = NEXTOPER(NEXTOPER(scan));
3523 minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext,
3524 last, &data_fake, stopparen, recursed, NULL, f, depth+1);
3527 FAIL("Variable length lookbehind not implemented");
3529 else if (minnext > (I32)U8_MAX) {
3530 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3532 scan->flags = (U8)minnext;
3535 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3537 if (data_fake.flags & SF_HAS_EVAL)
3538 data->flags |= SF_HAS_EVAL;
3539 data->whilem_c = data_fake.whilem_c;
3541 if (f & SCF_DO_STCLASS_AND) {
3542 const int was = (data->start_class->flags & ANYOF_EOS);
3544 cl_and(data->start_class, &intrnl);
3546 data->start_class->flags |= ANYOF_EOS;
3549 #if PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3551 /* Positive Lookahead/lookbehind
3552 In this case we can do fixed string optimisation,
3553 but we must be careful about it. Note in the case of
3554 lookbehind the positions will be offset by the minimum
3555 length of the pattern, something we won't know about
3556 until after the recurse.
3558 I32 deltanext, fake = 0;
3560 struct regnode_charclass_class intrnl;
3562 /* We use SAVEFREEPV so that when the full compile
3563 is finished perl will clean up the allocated
3564 minlens when its all done. This was we don't
3565 have to worry about freeing them when we know
3566 they wont be used, which would be a pain.
3569 Newx( minnextp, 1, I32 );
3570 SAVEFREEPV(minnextp);
3573 StructCopy(data, &data_fake, scan_data_t);
3574 if ((flags & SCF_DO_SUBSTR) && data->last_found) {
3577 SCAN_COMMIT(pRExC_state, &data_fake,minlenp);
3578 data_fake.last_found=newSVsv(data->last_found);
3582 data_fake.last_closep = &fake;
3583 data_fake.flags = 0;
3584 data_fake.pos_delta = delta;
3586 data_fake.flags |= SF_IS_INF;
3587 if ( flags & SCF_DO_STCLASS && !scan->flags
3588 && OP(scan) == IFMATCH ) { /* Lookahead */
3589 cl_init(pRExC_state, &intrnl);
3590 data_fake.start_class = &intrnl;
3591 f |= SCF_DO_STCLASS_AND;
3593 if (flags & SCF_WHILEM_VISITED_POS)
3594 f |= SCF_WHILEM_VISITED_POS;
3595 next = regnext(scan);
3596 nscan = NEXTOPER(NEXTOPER(scan));
3598 *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext,
3599 last, &data_fake, stopparen, recursed, NULL, f,depth+1);
3602 FAIL("Variable length lookbehind not implemented");
3604 else if (*minnextp > (I32)U8_MAX) {
3605 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3607 scan->flags = (U8)*minnextp;
3612 if (f & SCF_DO_STCLASS_AND) {
3613 const int was = (data->start_class->flags & ANYOF_EOS);
3615 cl_and(data->start_class, &intrnl);
3617 data->start_class->flags |= ANYOF_EOS;
3620 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3622 if (data_fake.flags & SF_HAS_EVAL)
3623 data->flags |= SF_HAS_EVAL;
3624 data->whilem_c = data_fake.whilem_c;
3625 if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) {
3626 if (RExC_rx->minlen<*minnextp)
3627 RExC_rx->minlen=*minnextp;
3628 SCAN_COMMIT(pRExC_state, &data_fake, minnextp);
3629 SvREFCNT_dec(data_fake.last_found);
3631 if ( data_fake.minlen_fixed != minlenp )
3633 data->offset_fixed= data_fake.offset_fixed;
3634 data->minlen_fixed= data_fake.minlen_fixed;
3635 data->lookbehind_fixed+= scan->flags;
3637 if ( data_fake.minlen_float != minlenp )
3639 data->minlen_float= data_fake.minlen_float;
3640 data->offset_float_min=data_fake.offset_float_min;
3641 data->offset_float_max=data_fake.offset_float_max;
3642 data->lookbehind_float+= scan->flags;
3651 else if (OP(scan) == OPEN) {
3652 if (stopparen != (I32)ARG(scan))
3655 else if (OP(scan) == CLOSE) {
3656 if (stopparen == (I32)ARG(scan)) {
3659 if ((I32)ARG(scan) == is_par) {
3660 next = regnext(scan);
3662 if ( next && (OP(next) != WHILEM) && next < last)
3663 is_par = 0; /* Disable optimization */
3666 *(data->last_closep) = ARG(scan);
3668 else if (OP(scan) == EVAL) {
3670 data->flags |= SF_HAS_EVAL;
3672 else if ( PL_regkind[OP(scan)] == ENDLIKE ) {
3673 if (flags & SCF_DO_SUBSTR) {
3674 SCAN_COMMIT(pRExC_state,data,minlenp);
3675 flags &= ~SCF_DO_SUBSTR;
3677 if (data && OP(scan)==ACCEPT) {
3678 data->flags |= SCF_SEEN_ACCEPT;
3683 else if (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */
3685 if (flags & SCF_DO_SUBSTR) {
3686 SCAN_COMMIT(pRExC_state,data,minlenp);
3687 data->longest = &(data->longest_float);
3689 is_inf = is_inf_internal = 1;
3690 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3691 cl_anything(pRExC_state, data->start_class);
3692 flags &= ~SCF_DO_STCLASS;
3694 else if (OP(scan) == GPOS) {
3695 if (!(RExC_rx->extflags & RXf_GPOS_FLOAT) &&
3696 !(delta || is_inf || (data && data->pos_delta)))
3698 if (!(RExC_rx->extflags & RXf_ANCH) && (flags & SCF_DO_SUBSTR))
3699 RExC_rx->extflags |= RXf_ANCH_GPOS;
3700 if (RExC_rx->gofs < (U32)min)
3701 RExC_rx->gofs = min;
3703 RExC_rx->extflags |= RXf_GPOS_FLOAT;
3707 #ifdef TRIE_STUDY_OPT
3708 #ifdef FULL_TRIE_STUDY
3709 else if (PL_regkind[OP(scan)] == TRIE) {
3710 /* NOTE - There is similar code to this block above for handling
3711 BRANCH nodes on the initial study. If you change stuff here
3713 regnode *trie_node= scan;
3714 regnode *tail= regnext(scan);
3715 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
3716 I32 max1 = 0, min1 = I32_MAX;
3717 struct regnode_charclass_class accum;
3719 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
3720 SCAN_COMMIT(pRExC_state, data,minlenp); /* Cannot merge strings after this. */
3721 if (flags & SCF_DO_STCLASS)
3722 cl_init_zero(pRExC_state, &accum);
3728 const regnode *nextbranch= NULL;
3731 for ( word=1 ; word <= trie->wordcount ; word++)
3733 I32 deltanext=0, minnext=0, f = 0, fake;
3734 struct regnode_charclass_class this_class;
3736 data_fake.flags = 0;
3738 data_fake.whilem_c = data->whilem_c;
3739 data_fake.last_closep = data->last_closep;
3742 data_fake.last_closep = &fake;
3743 data_fake.pos_delta = delta;
3744 if (flags & SCF_DO_STCLASS) {
3745 cl_init(pRExC_state, &this_class);
3746 data_fake.start_class = &this_class;
3747 f = SCF_DO_STCLASS_AND;
3749 if (flags & SCF_WHILEM_VISITED_POS)
3750 f |= SCF_WHILEM_VISITED_POS;
3752 if (trie->jump[word]) {
3754 nextbranch = trie_node + trie->jump[0];
3755 scan= trie_node + trie->jump[word];
3756 /* We go from the jump point to the branch that follows
3757 it. Note this means we need the vestigal unused branches
3758 even though they arent otherwise used.
3760 minnext = study_chunk(pRExC_state, &scan, minlenp,
3761 &deltanext, (regnode *)nextbranch, &data_fake,
3762 stopparen, recursed, NULL, f,depth+1);
3764 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
3765 nextbranch= regnext((regnode*)nextbranch);
3767 if (min1 > (I32)(minnext + trie->minlen))
3768 min1 = minnext + trie->minlen;
3769 if (max1 < (I32)(minnext + deltanext + trie->maxlen))
3770 max1 = minnext + deltanext + trie->maxlen;
3771 if (deltanext == I32_MAX)
3772 is_inf = is_inf_internal = 1;
3774 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3776 if (data_fake.flags & SCF_SEEN_ACCEPT) {
3777 if ( stopmin > min + min1)
3778 stopmin = min + min1;
3779 flags &= ~SCF_DO_SUBSTR;
3781 data->flags |= SCF_SEEN_ACCEPT;
3784 if (data_fake.flags & SF_HAS_EVAL)
3785 data->flags |= SF_HAS_EVAL;
3786 data->whilem_c = data_fake.whilem_c;
3788 if (flags & SCF_DO_STCLASS)
3789 cl_or(pRExC_state, &accum, &this_class);
3792 if (flags & SCF_DO_SUBSTR) {
3793 data->pos_min += min1;
3794 data->pos_delta += max1 - min1;
3795 if (max1 != min1 || is_inf)
3796 data->longest = &(data->longest_float);
3799 delta += max1 - min1;
3800 if (flags & SCF_DO_STCLASS_OR) {
3801 cl_or(pRExC_state, data->start_class, &accum);
3803 cl_and(data->start_class, and_withp);
3804 flags &= ~SCF_DO_STCLASS;
3807 else if (flags & SCF_DO_STCLASS_AND) {
3809 cl_and(data->start_class, &accum);
3810 flags &= ~SCF_DO_STCLASS;
3813 /* Switch to OR mode: cache the old value of
3814 * data->start_class */
3816 StructCopy(data->start_class, and_withp,
3817 struct regnode_charclass_class);
3818 flags &= ~SCF_DO_STCLASS_AND;
3819 StructCopy(&accum, data->start_class,
3820 struct regnode_charclass_class);
3821 flags |= SCF_DO_STCLASS_OR;
3822 data->start_class->flags |= ANYOF_EOS;
3829 else if (PL_regkind[OP(scan)] == TRIE) {
3830 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
3833 min += trie->minlen;
3834 delta += (trie->maxlen - trie->minlen);
3835 flags &= ~SCF_DO_STCLASS; /* xxx */
3836 if (flags & SCF_DO_SUBSTR) {
3837 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3838 data->pos_min += trie->minlen;
3839 data->pos_delta += (trie->maxlen - trie->minlen);
3840 if (trie->maxlen != trie->minlen)
3841 data->longest = &(data->longest_float);
3843 if (trie->jump) /* no more substrings -- for now /grr*/
3844 flags &= ~SCF_DO_SUBSTR;
3846 #endif /* old or new */
3847 #endif /* TRIE_STUDY_OPT */
3848 /* Else: zero-length, ignore. */
3849 scan = regnext(scan);
3854 stopparen = frame->stop;
3855 frame = frame->prev;
3856 goto fake_study_recurse;
3861 DEBUG_STUDYDATA("pre-fin:",data,depth);
3864 *deltap = is_inf_internal ? I32_MAX : delta;
3865 if (flags & SCF_DO_SUBSTR && is_inf)
3866 data->pos_delta = I32_MAX - data->pos_min;
3867 if (is_par > (I32)U8_MAX)
3869 if (is_par && pars==1 && data) {
3870 data->flags |= SF_IN_PAR;
3871 data->flags &= ~SF_HAS_PAR;
3873 else if (pars && data) {
3874 data->flags |= SF_HAS_PAR;
3875 data->flags &= ~SF_IN_PAR;
3877 if (flags & SCF_DO_STCLASS_OR)
3878 cl_and(data->start_class, and_withp);
3879 if (flags & SCF_TRIE_RESTUDY)
3880 data->flags |= SCF_TRIE_RESTUDY;
3882 DEBUG_STUDYDATA("post-fin:",data,depth);
3884 return min < stopmin ? min : stopmin;
3888 S_add_data(RExC_state_t *pRExC_state, U32 n, const char *s)
3890 U32 count = RExC_rxi->data ? RExC_rxi->data->count : 0;
3892 Renewc(RExC_rxi->data,
3893 sizeof(*RExC_rxi->data) + sizeof(void*) * (count + n - 1),
3894 char, struct reg_data);
3896 Renew(RExC_rxi->data->what, count + n, U8);
3898 Newx(RExC_rxi->data->what, n, U8);
3899 RExC_rxi->data->count = count + n;
3900 Copy(s, RExC_rxi->data->what + count, n, U8);
3904 /*XXX: todo make this not included in a non debugging perl */
3905 #ifndef PERL_IN_XSUB_RE
3907 Perl_reginitcolors(pTHX)
3910 const char * const s = PerlEnv_getenv("PERL_RE_COLORS");
3912 char *t = savepv(s);
3916 t = strchr(t, '\t');
3922 PL_colors[i] = t = (char *)"";
3927 PL_colors[i++] = (char *)"";
3934 #ifdef TRIE_STUDY_OPT
3935 #define CHECK_RESTUDY_GOTO \
3937 (data.flags & SCF_TRIE_RESTUDY) \
3941 #define CHECK_RESTUDY_GOTO
3945 - pregcomp - compile a regular expression into internal code
3947 * We can't allocate space until we know how big the compiled form will be,
3948 * but we can't compile it (and thus know how big it is) until we've got a
3949 * place to put the code. So we cheat: we compile it twice, once with code
3950 * generation turned off and size counting turned on, and once "for real".
3951 * This also means that we don't allocate space until we are sure that the
3952 * thing really will compile successfully, and we never have to move the
3953 * code and thus invalidate pointers into it. (Note that it has to be in
3954 * one piece because free() must be able to free it all.) [NB: not true in perl]
3956 * Beware that the optimization-preparation code in here knows about some
3957 * of the structure of the compiled regexp. [I'll say.]
3962 #ifndef PERL_IN_XSUB_RE
3963 #define RE_ENGINE_PTR &PL_core_reg_engine
3965 extern const struct regexp_engine my_reg_engine;
3966 #define RE_ENGINE_PTR &my_reg_engine
3970 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
3973 GET_RE_DEBUG_FLAGS_DECL;
3974 DEBUG_r(if (!PL_colorset) reginitcolors());
3975 #ifndef PERL_IN_XSUB_RE
3977 /* Dispatch a request to compile a regexp to correct
3979 HV * const table = GvHV(PL_hintgv);
3981 SV **ptr= hv_fetchs(table, "regcomp", FALSE);
3982 if (ptr && SvIOK(*ptr) && SvIV(*ptr)) {
3983 const regexp_engine *eng=INT2PTR(regexp_engine*,SvIV(*ptr));
3985 PerlIO_printf(Perl_debug_log, "Using engine %"UVxf"\n",
3988 return CALLREGCOMP_ENG(eng, exp, xend, pm);
3993 return Perl_re_compile(aTHX_ exp, xend, pm);
3997 Perl_re_compile(pTHX_ char *exp, char *xend, PMOP *pm)
4001 register regexp_internal *ri;
4009 RExC_state_t RExC_state;
4010 RExC_state_t * const pRExC_state = &RExC_state;
4011 #ifdef TRIE_STUDY_OPT
4013 RExC_state_t copyRExC_state;
4015 GET_RE_DEBUG_FLAGS_DECL;
4017 FAIL("NULL regexp argument");
4019 RExC_utf8 = pm->op_pmdynflags & PMdf_CMP_UTF8;
4023 SV *dsv= sv_newmortal();
4024 RE_PV_QUOTED_DECL(s, RExC_utf8,
4025 dsv, RExC_precomp, (xend - exp), 60);
4026 PerlIO_printf(Perl_debug_log, "%sCompiling REx%s %s\n",
4027 PL_colors[4],PL_colors[5],s);
4029 RExC_flags = pm->op_pmflags;
4033 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
4034 RExC_seen_evals = 0;
4037 /* First pass: determine size, legality. */
4045 RExC_emit = &PL_regdummy;
4046 RExC_whilem_seen = 0;
4047 RExC_charnames = NULL;
4048 RExC_open_parens = NULL;
4049 RExC_close_parens = NULL;
4051 RExC_paren_names = NULL;
4052 RExC_recurse = NULL;
4053 RExC_recurse_count = 0;
4055 #if 0 /* REGC() is (currently) a NOP at the first pass.
4056 * Clever compilers notice this and complain. --jhi */
4057 REGC((U8)REG_MAGIC, (char*)RExC_emit);
4059 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "Starting first pass (sizing)\n"));
4060 if (reg(pRExC_state, 0, &flags,1) == NULL) {
4061 RExC_precomp = NULL;
4065 PerlIO_printf(Perl_debug_log,
4066 "Required size %"IVdf" nodes\n"
4067 "Starting second pass (creation)\n",
4070 RExC_lastparse=NULL;
4072 /* Small enough for pointer-storage convention?
4073 If extralen==0, this means that we will not need long jumps. */
4074 if (RExC_size >= 0x10000L && RExC_extralen)
4075 RExC_size += RExC_extralen;
4078 if (RExC_whilem_seen > 15)
4079 RExC_whilem_seen = 15;
4082 /* Make room for a sentinel value at the end of the program */
4086 /* Allocate space and zero-initialize. Note, the two step process
4087 of zeroing when in debug mode, thus anything assigned has to
4088 happen after that */
4089 Newxz(r, 1, regexp);
4090 Newxc(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode),
4091 char, regexp_internal);
4092 if ( r == NULL || ri == NULL )
4093 FAIL("Regexp out of space");
4095 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
4096 Zero(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode), char);
4098 /* bulk initialize base fields with 0. */
4099 Zero(ri, sizeof(regexp_internal), char);
4102 /* non-zero initialization begins here */
4104 r->engine= RE_ENGINE_PTR;
4106 r->prelen = xend - exp;
4107 r->precomp = savepvn(RExC_precomp, r->prelen);
4108 r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4110 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
4112 if (RExC_seen & REG_SEEN_RECURSE) {
4113 Newxz(RExC_open_parens, RExC_npar,regnode *);
4114 SAVEFREEPV(RExC_open_parens);
4115 Newxz(RExC_close_parens,RExC_npar,regnode *);
4116 SAVEFREEPV(RExC_close_parens);
4119 /* Useful during FAIL. */
4120 Newxz(ri->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
4122 ri->offsets[0] = RExC_size;
4124 DEBUG_OFFSETS_r(PerlIO_printf(Perl_debug_log,
4125 "%s %"UVuf" bytes for offset annotations.\n",
4126 ri->offsets ? "Got" : "Couldn't get",
4127 (UV)((2*RExC_size+1) * sizeof(U32))));
4132 /* Second pass: emit code. */
4133 RExC_flags = pm->op_pmflags; /* don't let top level (?i) bleed */
4138 RExC_emit_start = ri->program;
4139 RExC_emit = ri->program;
4141 /* put a sentinal on the end of the program so we can check for
4143 ri->program[RExC_size].type = 255;
4145 /* Store the count of eval-groups for security checks: */
4146 RExC_rx->seen_evals = RExC_seen_evals;
4147 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
4148 if (reg(pRExC_state, 0, &flags,1) == NULL)
4151 /* XXXX To minimize changes to RE engine we always allocate
4152 3-units-long substrs field. */
4153 Newx(r->substrs, 1, struct reg_substr_data);
4154 if (RExC_recurse_count) {
4155 Newxz(RExC_recurse,RExC_recurse_count,regnode *);
4156 SAVEFREEPV(RExC_recurse);
4160 r->minlen = minlen = sawplus = sawopen = 0;
4161 Zero(r->substrs, 1, struct reg_substr_data);
4163 #ifdef TRIE_STUDY_OPT
4166 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log,"Restudying\n"));
4168 RExC_state = copyRExC_state;
4169 if (seen & REG_TOP_LEVEL_BRANCHES)
4170 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
4172 RExC_seen &= ~REG_TOP_LEVEL_BRANCHES;
4173 if (data.last_found) {
4174 SvREFCNT_dec(data.longest_fixed);
4175 SvREFCNT_dec(data.longest_float);
4176 SvREFCNT_dec(data.last_found);
4178 StructCopy(&zero_scan_data, &data, scan_data_t);
4180 StructCopy(&zero_scan_data, &data, scan_data_t);
4181 copyRExC_state = RExC_state;
4184 StructCopy(&zero_scan_data, &data, scan_data_t);
4187 /* Dig out information for optimizations. */
4188 r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME; /* Again? */
4189 pm->op_pmflags = RExC_flags;
4191 r->extflags |= RXf_UTF8; /* Unicode in it? */
4192 ri->regstclass = NULL;
4193 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
4194 r->intflags |= PREGf_NAUGHTY;
4195 scan = ri->program + 1; /* First BRANCH. */
4197 /* testing for BRANCH here tells us whether there is "must appear"
4198 data in the pattern. If there is then we can use it for optimisations */
4199 if (!(RExC_seen & REG_TOP_LEVEL_BRANCHES)) { /* Only one top-level choice. */
4201 STRLEN longest_float_length, longest_fixed_length;
4202 struct regnode_charclass_class ch_class; /* pointed to by data */
4204 I32 last_close = 0; /* pointed to by data */
4207 /* Skip introductions and multiplicators >= 1. */
4208 while ((OP(first) == OPEN && (sawopen = 1)) ||
4209 /* An OR of *one* alternative - should not happen now. */
4210 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
4211 /* for now we can't handle lookbehind IFMATCH*/
4212 (OP(first) == IFMATCH && !first->flags) ||
4213 (OP(first) == PLUS) ||
4214 (OP(first) == MINMOD) ||
4215 /* An {n,m} with n>0 */
4216 (PL_regkind[OP(first)] == CURLY && ARG1(first) > 0) )
4219 if (OP(first) == PLUS)
4222 first += regarglen[OP(first)];
4223 if (OP(first) == IFMATCH) {
4224 first = NEXTOPER(first);
4225 first += EXTRA_STEP_2ARGS;
4226 } else /* XXX possible optimisation for /(?=)/ */
4227 first = NEXTOPER(first);
4230 /* Starting-point info. */
4232 DEBUG_PEEP("first:",first,0);
4233 /* Ignore EXACT as we deal with it later. */
4234 if (PL_regkind[OP(first)] == EXACT) {
4235 if (OP(first) == EXACT)
4236 NOOP; /* Empty, get anchored substr later. */
4237 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
4238 ri->regstclass = first;
4241 else if (PL_regkind[OP(first)] == TRIE &&
4242 ((reg_trie_data *)ri->data->data[ ARG(first) ])->minlen>0)
4245 /* this can happen only on restudy */
4246 if ( OP(first) == TRIE ) {
4247 struct regnode_1 *trieop =
4248 PerlMemShared_calloc(1, sizeof(struct regnode_1));
4249 StructCopy(first,trieop,struct regnode_1);
4250 trie_op=(regnode *)trieop;
4252 struct regnode_charclass *trieop =
4253 PerlMemShared_calloc(1, sizeof(struct regnode_charclass));
4254 StructCopy(first,trieop,struct regnode_charclass);
4255 trie_op=(regnode *)trieop;
4258 make_trie_failtable(pRExC_state, (regnode *)first, trie_op, 0);
4259 ri->regstclass = trie_op;
4262 else if (strchr((const char*)PL_simple,OP(first)))
4263 ri->regstclass = first;
4264 else if (PL_regkind[OP(first)] == BOUND ||
4265 PL_regkind[OP(first)] == NBOUND)
4266 ri->regstclass = first;
4267 else if (PL_regkind[OP(first)] == BOL) {
4268 r->extflags |= (OP(first) == MBOL
4270 : (OP(first) == SBOL
4273 first = NEXTOPER(first);
4276 else if (OP(first) == GPOS) {
4277 r->extflags |= RXf_ANCH_GPOS;
4278 first = NEXTOPER(first);
4281 else if ((!sawopen || !RExC_sawback) &&
4282 (OP(first) == STAR &&
4283 PL_regkind[OP(NEXTOPER(first))] == REG_ANY) &&
4284 !(r->extflags & RXf_ANCH) && !(RExC_seen & REG_SEEN_EVAL))
4286 /* turn .* into ^.* with an implied $*=1 */
4288 (OP(NEXTOPER(first)) == REG_ANY)
4291 r->extflags |= type;
4292 r->intflags |= PREGf_IMPLICIT;
4293 first = NEXTOPER(first);
4296 if (sawplus && (!sawopen || !RExC_sawback)
4297 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
4298 /* x+ must match at the 1st pos of run of x's */
4299 r->intflags |= PREGf_SKIP;
4301 /* Scan is after the zeroth branch, first is atomic matcher. */
4302 #ifdef TRIE_STUDY_OPT
4305 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4306 (IV)(first - scan + 1))
4310 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4311 (IV)(first - scan + 1))
4317 * If there's something expensive in the r.e., find the
4318 * longest literal string that must appear and make it the
4319 * regmust. Resolve ties in favor of later strings, since
4320 * the regstart check works with the beginning of the r.e.
4321 * and avoiding duplication strengthens checking. Not a
4322 * strong reason, but sufficient in the absence of others.
4323 * [Now we resolve ties in favor of the earlier string if
4324 * it happens that c_offset_min has been invalidated, since the
4325 * earlier string may buy us something the later one won't.]
4328 data.longest_fixed = newSVpvs("");
4329 data.longest_float = newSVpvs("");
4330 data.last_found = newSVpvs("");
4331 data.longest = &(data.longest_fixed);
4333 if (!ri->regstclass) {
4334 cl_init(pRExC_state, &ch_class);
4335 data.start_class = &ch_class;
4336 stclass_flag = SCF_DO_STCLASS_AND;
4337 } else /* XXXX Check for BOUND? */
4339 data.last_closep = &last_close;
4341 minlen = study_chunk(pRExC_state, &first, &minlen, &fake, scan + RExC_size, /* Up to end */
4342 &data, -1, NULL, NULL,
4343 SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag,0);
4349 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
4350 && data.last_start_min == 0 && data.last_end > 0
4351 && !RExC_seen_zerolen
4352 && !(RExC_seen & REG_SEEN_VERBARG)
4353 && (!(RExC_seen & REG_SEEN_GPOS) || (r->extflags & RXf_ANCH_GPOS)))
4354 r->extflags |= RXf_CHECK_ALL;
4355 scan_commit(pRExC_state, &data,&minlen,0);
4356 SvREFCNT_dec(data.last_found);
4358 /* Note that code very similar to this but for anchored string
4359 follows immediately below, changes may need to be made to both.
4362 longest_float_length = CHR_SVLEN(data.longest_float);
4363 if (longest_float_length
4364 || (data.flags & SF_FL_BEFORE_EOL
4365 && (!(data.flags & SF_FL_BEFORE_MEOL)
4366 || (RExC_flags & RXf_PMf_MULTILINE))))
4370 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
4371 && data.offset_fixed == data.offset_float_min
4372 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
4373 goto remove_float; /* As in (a)+. */
4375 /* copy the information about the longest float from the reg_scan_data
4376 over to the program. */
4377 if (SvUTF8(data.longest_float)) {
4378 r->float_utf8 = data.longest_float;
4379 r->float_substr = NULL;
4381 r->float_substr = data.longest_float;
4382 r->float_utf8 = NULL;
4384 /* float_end_shift is how many chars that must be matched that
4385 follow this item. We calculate it ahead of time as once the
4386 lookbehind offset is added in we lose the ability to correctly
4388 ml = data.minlen_float ? *(data.minlen_float)
4389 : (I32)longest_float_length;
4390 r->float_end_shift = ml - data.offset_float_min
4391 - longest_float_length + (SvTAIL(data.longest_float) != 0)
4392 + data.lookbehind_float;
4393 r->float_min_offset = data.offset_float_min - data.lookbehind_float;
4394 r->float_max_offset = data.offset_float_max;
4395 if (data.offset_float_max < I32_MAX) /* Don't offset infinity */
4396 r->float_max_offset -= data.lookbehind_float;
4398 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
4399 && (!(data.flags & SF_FL_BEFORE_MEOL)
4400 || (RExC_flags & RXf_PMf_MULTILINE)));
4401 fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0);
4405 r->float_substr = r->float_utf8 = NULL;
4406 SvREFCNT_dec(data.longest_float);
4407 longest_float_length = 0;
4410 /* Note that code very similar to this but for floating string
4411 is immediately above, changes may need to be made to both.
4414 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
4415 if (longest_fixed_length
4416 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
4417 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4418 || (RExC_flags & RXf_PMf_MULTILINE))))
4422 /* copy the information about the longest fixed
4423 from the reg_scan_data over to the program. */
4424 if (SvUTF8(data.longest_fixed)) {
4425 r->anchored_utf8 = data.longest_fixed;
4426 r->anchored_substr = NULL;
4428 r->anchored_substr = data.longest_fixed;
4429 r->anchored_utf8 = NULL;
4431 /* fixed_end_shift is how many chars that must be matched that
4432 follow this item. We calculate it ahead of time as once the
4433 lookbehind offset is added in we lose the ability to correctly
4435 ml = data.minlen_fixed ? *(data.minlen_fixed)
4436 : (I32)longest_fixed_length;
4437 r->anchored_end_shift = ml - data.offset_fixed
4438 - longest_fixed_length + (SvTAIL(data.longest_fixed) != 0)
4439 + data.lookbehind_fixed;
4440 r->anchored_offset = data.offset_fixed - data.lookbehind_fixed;
4442 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
4443 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4444 || (RExC_flags & RXf_PMf_MULTILINE)));
4445 fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0);
4448 r->anchored_substr = r->anchored_utf8 = NULL;
4449 SvREFCNT_dec(data.longest_fixed);
4450 longest_fixed_length = 0;
4453 && (OP(ri->regstclass) == REG_ANY || OP(ri->regstclass) == SANY))
4454 ri->regstclass = NULL;
4455 if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset)
4457 && !(data.start_class->flags & ANYOF_EOS)
4458 && !cl_is_anything(data.start_class))
4460 const U32 n = add_data(pRExC_state, 1, "f");
4462 Newx(RExC_rxi->data->data[n], 1,
4463 struct regnode_charclass_class);
4464 StructCopy(data.start_class,
4465 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
4466 struct regnode_charclass_class);
4467 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
4468 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
4469 DEBUG_COMPILE_r({ SV *sv = sv_newmortal();
4470 regprop(r, sv, (regnode*)data.start_class);
4471 PerlIO_printf(Perl_debug_log,
4472 "synthetic stclass \"%s\".\n",
4473 SvPVX_const(sv));});
4476 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
4477 if (longest_fixed_length > longest_float_length) {
4478 r->check_end_shift = r->anchored_end_shift;
4479 r->check_substr = r->anchored_substr;
4480 r->check_utf8 = r->anchored_utf8;
4481 r->check_offset_min = r->check_offset_max = r->anchored_offset;
4482 if (r->extflags & RXf_ANCH_SINGLE)
4483 r->extflags |= RXf_NOSCAN;
4486 r->check_end_shift = r->float_end_shift;
4487 r->check_substr = r->float_substr;
4488 r->check_utf8 = r->float_utf8;
4489 r->check_offset_min = r->float_min_offset;
4490 r->check_offset_max = r->float_max_offset;
4492 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
4493 This should be changed ASAP! */
4494 if ((r->check_substr || r->check_utf8) && !(r->extflags & RXf_ANCH_GPOS)) {
4495 r->extflags |= RXf_USE_INTUIT;
4496 if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8))
4497 r->extflags |= RXf_INTUIT_TAIL;
4499 /* XXX Unneeded? dmq (shouldn't as this is handled elsewhere)
4500 if ( (STRLEN)minlen < longest_float_length )
4501 minlen= longest_float_length;
4502 if ( (STRLEN)minlen < longest_fixed_length )
4503 minlen= longest_fixed_length;
4507 /* Several toplevels. Best we can is to set minlen. */
4509 struct regnode_charclass_class ch_class;
4512 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "\nMulti Top Level\n"));
4514 scan = ri->program + 1;
4515 cl_init(pRExC_state, &ch_class);
4516 data.start_class = &ch_class;
4517 data.last_closep = &last_close;
4520 minlen = study_chunk(pRExC_state, &scan, &minlen, &fake, scan + RExC_size,
4521 &data, -1, NULL, NULL, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS,0);
4525 r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8
4526 = r->float_substr = r->float_utf8 = NULL;
4527 if (!(data.start_class->flags & ANYOF_EOS)
4528 && !cl_is_anything(data.start_class))
4530 const U32 n = add_data(pRExC_state, 1, "f");
4532 Newx(RExC_rxi->data->data[n], 1,
4533 struct regnode_charclass_class);
4534 StructCopy(data.start_class,
4535 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
4536 struct regnode_charclass_class);
4537 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
4538 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
4539 DEBUG_COMPILE_r({ SV* sv = sv_newmortal();
4540 regprop(r, sv, (regnode*)data.start_class);
4541 PerlIO_printf(Perl_debug_log,
4542 "synthetic stclass \"%s\".\n",
4543 SvPVX_const(sv));});
4547 /* Guard against an embedded (?=) or (?<=) with a longer minlen than
4548 the "real" pattern. */
4550 PerlIO_printf(Perl_debug_log,"minlen: %"IVdf" r->minlen:%"IVdf"\n",
4551 (IV)minlen, (IV)r->minlen);
4553 r->minlenret = minlen;
4554 if (r->minlen < minlen)
4557 if (RExC_seen & REG_SEEN_GPOS)
4558 r->extflags |= RXf_GPOS_SEEN;
4559 if (RExC_seen & REG_SEEN_LOOKBEHIND)
4560 r->extflags |= RXf_LOOKBEHIND_SEEN;
4561 if (RExC_seen & REG_SEEN_EVAL)
4562 r->extflags |= RXf_EVAL_SEEN;
4563 if (RExC_seen & REG_SEEN_CANY)
4564 r->extflags |= RXf_CANY_SEEN;
4565 if (RExC_seen & REG_SEEN_VERBARG)
4566 r->intflags |= PREGf_VERBARG_SEEN;
4567 if (RExC_seen & REG_SEEN_CUTGROUP)
4568 r->intflags |= PREGf_CUTGROUP_SEEN;
4569 if (RExC_paren_names)
4570 r->paren_names = (HV*)SvREFCNT_inc(RExC_paren_names);
4572 r->paren_names = NULL;
4574 if (RExC_recurse_count) {
4575 for ( ; RExC_recurse_count ; RExC_recurse_count-- ) {
4576 const regnode *scan = RExC_recurse[RExC_recurse_count-1];
4577 ARG2L_SET( scan, RExC_open_parens[ARG(scan)-1] - scan );
4580 Newxz(r->startp, RExC_npar, I32);
4581 Newxz(r->endp, RExC_npar, I32);
4582 /* assume we don't need to swap parens around before we match */
4585 PerlIO_printf(Perl_debug_log,"Final program:\n");
4588 DEBUG_OFFSETS_r(if (ri->offsets) {
4589 const U32 len = ri->offsets[0];
4591 GET_RE_DEBUG_FLAGS_DECL;
4592 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)ri->offsets[0]);
4593 for (i = 1; i <= len; i++) {
4594 if (ri->offsets[i*2-1] || ri->offsets[i*2])
4595 PerlIO_printf(Perl_debug_log, "%"UVuf":%"UVuf"[%"UVuf"] ",
4596 (UV)i, (UV)ri->offsets[i*2-1], (UV)ri->offsets[i*2]);
4598 PerlIO_printf(Perl_debug_log, "\n");
4603 #undef CORE_ONLY_BLOCK
4604 #undef RE_ENGINE_PTR
4606 #ifndef PERL_IN_XSUB_RE
4608 Perl_reg_named_buff_sv(pTHX_ SV* namesv)
4610 I32 parno = 0; /* no match */
4612 const REGEXP * const rx = PM_GETRE(PL_curpm);
4613 if (rx && rx->paren_names) {
4614 HE *he_str = hv_fetch_ent( rx->paren_names, namesv, 0, 0 );
4617 SV* sv_dat=HeVAL(he_str);
4618 I32 *nums=(I32*)SvPVX(sv_dat);
4619 for ( i=0; i<SvIVX(sv_dat); i++ ) {
4620 if ((I32)(rx->lastparen) >= nums[i] &&
4621 rx->endp[nums[i]] != -1)
4634 SV *sv= sv_newmortal();
4635 Perl_sv_setpvf(aTHX_ sv, "%"IVdf,(IV)parno);
4636 gv_paren= Perl_gv_fetchsv(aTHX_ sv, GV_ADD, SVt_PVGV);
4637 return GvSVn(gv_paren);
4642 /* Scans the name of a named buffer from the pattern.
4643 * If flags is REG_RSN_RETURN_NULL returns null.
4644 * If flags is REG_RSN_RETURN_NAME returns an SV* containing the name
4645 * If flags is REG_RSN_RETURN_DATA returns the data SV* corresponding
4646 * to the parsed name as looked up in the RExC_paren_names hash.
4647 * If there is an error throws a vFAIL().. type exception.
4650 #define REG_RSN_RETURN_NULL 0
4651 #define REG_RSN_RETURN_NAME 1
4652 #define REG_RSN_RETURN_DATA 2
4655 S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags) {
4656 char *name_start = RExC_parse;
4659 while( isIDFIRST_uni(utf8n_to_uvchr((U8*)RExC_parse,
4660 RExC_end - RExC_parse, &numlen, UTF8_ALLOW_DEFAULT)))
4662 RExC_parse += numlen;
4665 while( isIDFIRST(*RExC_parse) )
4669 SV* sv_name = sv_2mortal(Perl_newSVpvn(aTHX_ name_start,
4670 (int)(RExC_parse - name_start)));
4673 if ( flags == REG_RSN_RETURN_NAME)
4675 else if (flags==REG_RSN_RETURN_DATA) {
4678 if ( ! sv_name ) /* should not happen*/
4679 Perl_croak(aTHX_ "panic: no svname in reg_scan_name");
4680 if (RExC_paren_names)
4681 he_str = hv_fetch_ent( RExC_paren_names, sv_name, 0, 0 );
4683 sv_dat = HeVAL(he_str);
4685 vFAIL("Reference to nonexistent named group");
4689 Perl_croak(aTHX_ "panic: bad flag in reg_scan_name");
4696 #define DEBUG_PARSE_MSG(funcname) DEBUG_PARSE_r({ \
4697 int rem=(int)(RExC_end - RExC_parse); \
4706 if (RExC_lastparse!=RExC_parse) \
4707 PerlIO_printf(Perl_debug_log," >%.*s%-*s", \
4710 iscut ? "..." : "<" \
4713 PerlIO_printf(Perl_debug_log,"%16s",""); \
4718 num=REG_NODE_NUM(RExC_emit); \
4719 if (RExC_lastnum!=num) \
4720 PerlIO_printf(Perl_debug_log,"|%4d",num); \
4722 PerlIO_printf(Perl_debug_log,"|%4s",""); \
4723 PerlIO_printf(Perl_debug_log,"|%*s%-4s", \
4724 (int)((depth*2)), "", \
4728 RExC_lastparse=RExC_parse; \
4733 #define DEBUG_PARSE(funcname) DEBUG_PARSE_r({ \
4734 DEBUG_PARSE_MSG((funcname)); \
4735 PerlIO_printf(Perl_debug_log,"%4s","\n"); \
4737 #define DEBUG_PARSE_FMT(funcname,fmt,args) DEBUG_PARSE_r({ \
4738 DEBUG_PARSE_MSG((funcname)); \
4739 PerlIO_printf(Perl_debug_log,fmt "\n",args); \
4742 - reg - regular expression, i.e. main body or parenthesized thing
4744 * Caller must absorb opening parenthesis.
4746 * Combining parenthesis handling with the base level of regular expression
4747 * is a trifle forced, but the need to tie the tails of the branches to what
4748 * follows makes it hard to avoid.
4750 #define REGTAIL(x,y,z) regtail((x),(y),(z),depth+1)
4752 #define REGTAIL_STUDY(x,y,z) regtail_study((x),(y),(z),depth+1)
4754 #define REGTAIL_STUDY(x,y,z) regtail((x),(y),(z),depth+1)
4757 /* this idea is borrowed from STR_WITH_LEN in handy.h */
4758 #define CHECK_WORD(s,v,l) \
4759 (((sizeof(s)-1)==(l)) && (strnEQ(start_verb, (s ""), (sizeof(s)-1))))
4762 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp,U32 depth)
4763 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
4766 register regnode *ret; /* Will be the head of the group. */
4767 register regnode *br;
4768 register regnode *lastbr;
4769 register regnode *ender = NULL;
4770 register I32 parno = 0;
4772 const I32 oregflags = RExC_flags;
4773 bool have_branch = 0;
4776 /* for (?g), (?gc), and (?o) warnings; warning
4777 about (?c) will warn about (?g) -- japhy */
4779 #define WASTED_O 0x01
4780 #define WASTED_G 0x02
4781 #define WASTED_C 0x04
4782 #define WASTED_GC (0x02|0x04)
4783 I32 wastedflags = 0x00;
4785 char * parse_start = RExC_parse; /* MJD */
4786 char * const oregcomp_parse = RExC_parse;
4788 GET_RE_DEBUG_FLAGS_DECL;
4789 DEBUG_PARSE("reg ");
4792 *flagp = 0; /* Tentatively. */
4795 /* Make an OPEN node, if parenthesized. */
4797 if ( *RExC_parse == '*') { /* (*VERB:ARG) */
4798 char *start_verb = RExC_parse;
4799 STRLEN verb_len = 0;
4800 char *start_arg = NULL;
4801 unsigned char op = 0;
4803 int internal_argval = 0; /* internal_argval is only useful if !argok */
4804 while ( *RExC_parse && *RExC_parse != ')' ) {
4805 if ( *RExC_parse == ':' ) {
4806 start_arg = RExC_parse + 1;
4812 verb_len = RExC_parse - start_verb;
4815 while ( *RExC_parse && *RExC_parse != ')' )
4817 if ( *RExC_parse != ')' )
4818 vFAIL("Unterminated verb pattern argument");
4819 if ( RExC_parse == start_arg )
4822 if ( *RExC_parse != ')' )
4823 vFAIL("Unterminated verb pattern");
4826 switch ( *start_verb ) {
4827 case 'A': /* (*ACCEPT) */
4828 if ( CHECK_WORD("ACCEPT",start_verb,verb_len) ) {
4830 internal_argval = RExC_nestroot;
4833 case 'C': /* (*COMMIT) */
4834 if ( CHECK_WORD("COMMIT",start_verb,verb_len) )
4837 case 'F': /* (*FAIL) */
4838 if ( verb_len==1 || CHECK_WORD("FAIL",start_verb,verb_len) ) {
4843 case ':': /* (*:NAME) */
4844 case 'M': /* (*MARK:NAME) */
4845 if ( verb_len==0 || CHECK_WORD("MARK",start_verb,verb_len) ) {
4850 case 'P': /* (*PRUNE) */
4851 if ( CHECK_WORD("PRUNE",start_verb,verb_len) )
4854 case 'S': /* (*SKIP) */
4855 if ( CHECK_WORD("SKIP",start_verb,verb_len) )
4858 case 'T': /* (*THEN) */
4859 /* [19:06] <TimToady> :: is then */
4860 if ( CHECK_WORD("THEN",start_verb,verb_len) ) {
4862 RExC_seen |= REG_SEEN_CUTGROUP;
4868 vFAIL3("Unknown verb pattern '%.*s'",
4869 verb_len, start_verb);
4872 if ( start_arg && internal_argval ) {
4873 vFAIL3("Verb pattern '%.*s' may not have an argument",
4874 verb_len, start_verb);
4875 } else if ( argok < 0 && !start_arg ) {
4876 vFAIL3("Verb pattern '%.*s' has a mandatory argument",
4877 verb_len, start_verb);
4879 ret = reganode(pRExC_state, op, internal_argval);
4880 if ( ! internal_argval && ! SIZE_ONLY ) {
4882 SV *sv = newSVpvn( start_arg, RExC_parse - start_arg);
4883 ARG(ret) = add_data( pRExC_state, 1, "S" );
4884 RExC_rxi->data->data[ARG(ret)]=(void*)sv;
4891 if (!internal_argval)
4892 RExC_seen |= REG_SEEN_VERBARG;
4893 } else if ( start_arg ) {
4894 vFAIL3("Verb pattern '%.*s' may not have an argument",
4895 verb_len, start_verb);
4897 ret = reg_node(pRExC_state, op);
4899 nextchar(pRExC_state);
4902 if (*RExC_parse == '?') { /* (?...) */
4903 U32 posflags = 0, negflags = 0;
4904 U32 *flagsp = &posflags;
4905 bool is_logical = 0;
4906 const char * const seqstart = RExC_parse;
4909 paren = *RExC_parse++;
4910 ret = NULL; /* For look-ahead/behind. */
4913 case '<': /* (?<...) */
4914 if (*RExC_parse == '!')
4916 else if (*RExC_parse != '=')
4921 case '\'': /* (?'...') */
4922 name_start= RExC_parse;
4923 svname = reg_scan_name(pRExC_state,
4924 SIZE_ONLY ? /* reverse test from the others */
4925 REG_RSN_RETURN_NAME :
4926 REG_RSN_RETURN_NULL);
4927 if (RExC_parse == name_start)
4929 if (*RExC_parse != paren)
4930 vFAIL2("Sequence (?%c... not terminated",
4931 paren=='>' ? '<' : paren);
4935 if (!svname) /* shouldnt happen */
4937 "panic: reg_scan_name returned NULL");
4938 if (!RExC_paren_names) {
4939 RExC_paren_names= newHV();
4940 sv_2mortal((SV*)RExC_paren_names);
4942 he_str = hv_fetch_ent( RExC_paren_names, svname, 1, 0 );
4944 sv_dat = HeVAL(he_str);
4946 /* croak baby croak */
4948 "panic: paren_name hash element allocation failed");
4949 } else if ( SvPOK(sv_dat) ) {
4950 IV count=SvIV(sv_dat);
4951 I32 *pv=(I32*)SvGROW(sv_dat,SvCUR(sv_dat)+sizeof(I32)+1);
4952 SvCUR_set(sv_dat,SvCUR(sv_dat)+sizeof(I32));
4953 pv[count]=RExC_npar;
4956 (void)SvUPGRADE(sv_dat,SVt_PVNV);
4957 sv_setpvn(sv_dat, (char *)&(RExC_npar), sizeof(I32));
4962 /*sv_dump(sv_dat);*/
4964 nextchar(pRExC_state);
4966 goto capturing_parens;
4968 RExC_seen |= REG_SEEN_LOOKBEHIND;
4970 case '=': /* (?=...) */
4971 case '!': /* (?!...) */
4972 RExC_seen_zerolen++;
4973 if (*RExC_parse == ')') {
4974 ret=reg_node(pRExC_state, OPFAIL);
4975 nextchar(pRExC_state);
4978 case ':': /* (?:...) */
4979 case '>': /* (?>...) */
4981 case '$': /* (?$...) */
4982 case '@': /* (?@...) */
4983 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
4985 case '#': /* (?#...) */
4986 while (*RExC_parse && *RExC_parse != ')')
4988 if (*RExC_parse != ')')
4989 FAIL("Sequence (?#... not terminated");
4990 nextchar(pRExC_state);
4993 case '0' : /* (?0) */
4994 case 'R' : /* (?R) */
4995 if (*RExC_parse != ')')
4996 FAIL("Sequence (?R) not terminated");
4997 ret = reg_node(pRExC_state, GOSTART);
4998 nextchar(pRExC_state);
5001 { /* named and numeric backreferences */
5004 case '&': /* (?&NAME) */
5005 parse_start = RExC_parse - 1;
5007 SV *sv_dat = reg_scan_name(pRExC_state,
5008 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5009 num = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
5011 goto gen_recurse_regop;
5014 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
5016 vFAIL("Illegal pattern");
5018 goto parse_recursion;
5020 case '-': /* (?-1) */
5021 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
5022 RExC_parse--; /* rewind to let it be handled later */
5026 case '1': case '2': case '3': case '4': /* (?1) */
5027 case '5': case '6': case '7': case '8': case '9':
5030 num = atoi(RExC_parse);
5031 parse_start = RExC_parse - 1; /* MJD */
5032 if (*RExC_parse == '-')
5034 while (isDIGIT(*RExC_parse))
5036 if (*RExC_parse!=')')
5037 vFAIL("Expecting close bracket");
5040 if ( paren == '-' ) {
5042 Diagram of capture buffer numbering.
5043 Top line is the normal capture buffer numbers
5044 Botton line is the negative indexing as from
5048 /(a(x)y)(a(b(c(?-2)d)e)f)(g(h))/
5052 num = RExC_npar + num;
5055 vFAIL("Reference to nonexistent group");
5057 } else if ( paren == '+' ) {
5058 num = RExC_npar + num - 1;
5061 ret = reganode(pRExC_state, GOSUB, num);
5063 if (num > (I32)RExC_rx->nparens) {
5065 vFAIL("Reference to nonexistent group");
5067 ARG2L_SET( ret, RExC_recurse_count++);
5069 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5070 "Recurse #%"UVuf" to %"IVdf"\n", (UV)ARG(ret), (IV)ARG2L(ret)));
5074 RExC_seen |= REG_SEEN_RECURSE;
5075 Set_Node_Length(ret, 1 + regarglen[OP(ret)]); /* MJD */
5076 Set_Node_Offset(ret, parse_start); /* MJD */
5078 nextchar(pRExC_state);
5080 } /* named and numeric backreferences */
5083 case 'p': /* (?p...) */
5084 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
5085 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
5087 case '?': /* (??...) */
5089 if (*RExC_parse != '{')
5091 paren = *RExC_parse++;
5093 case '{': /* (?{...}) */
5098 char *s = RExC_parse;
5100 RExC_seen_zerolen++;
5101 RExC_seen |= REG_SEEN_EVAL;
5102 while (count && (c = *RExC_parse)) {
5113 if (*RExC_parse != ')') {
5115 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
5119 OP_4tree *sop, *rop;
5120 SV * const sv = newSVpvn(s, RExC_parse - 1 - s);
5123 Perl_save_re_context(aTHX);
5124 rop = sv_compile_2op(sv, &sop, "re", &pad);
5125 sop->op_private |= OPpREFCOUNTED;
5126 /* re_dup will OpREFCNT_inc */
5127 OpREFCNT_set(sop, 1);
5130 n = add_data(pRExC_state, 3, "nop");
5131 RExC_rxi->data->data[n] = (void*)rop;
5132 RExC_rxi->data->data[n+1] = (void*)sop;
5133 RExC_rxi->data->data[n+2] = (void*)pad;
5136 else { /* First pass */
5137 if (PL_reginterp_cnt < ++RExC_seen_evals
5139 /* No compiled RE interpolated, has runtime
5140 components ===> unsafe. */
5141 FAIL("Eval-group not allowed at runtime, use re 'eval'");
5142 if (PL_tainting && PL_tainted)
5143 FAIL("Eval-group in insecure regular expression");
5144 #if PERL_VERSION > 8
5145 if (IN_PERL_COMPILETIME)
5150 nextchar(pRExC_state);
5152 ret = reg_node(pRExC_state, LOGICAL);
5155 REGTAIL(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
5156 /* deal with the length of this later - MJD */
5159 ret = reganode(pRExC_state, EVAL, n);
5160 Set_Node_Length(ret, RExC_parse - parse_start + 1);
5161 Set_Node_Offset(ret, parse_start);
5164 case '(': /* (?(?{...})...) and (?(?=...)...) */
5167 if (RExC_parse[0] == '?') { /* (?(?...)) */
5168 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
5169 || RExC_parse[1] == '<'
5170 || RExC_parse[1] == '{') { /* Lookahead or eval. */
5173 ret = reg_node(pRExC_state, LOGICAL);
5176 REGTAIL(pRExC_state, ret, reg(pRExC_state, 1, &flag,depth+1));
5180 else if ( RExC_parse[0] == '<' /* (?(<NAME>)...) */
5181 || RExC_parse[0] == '\'' ) /* (?('NAME')...) */
5183 char ch = RExC_parse[0] == '<' ? '>' : '\'';
5184 char *name_start= RExC_parse++;
5186 SV *sv_dat=reg_scan_name(pRExC_state,
5187 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5188 if (RExC_parse == name_start || *RExC_parse != ch)
5189 vFAIL2("Sequence (?(%c... not terminated",
5190 (ch == '>' ? '<' : ch));
5193 num = add_data( pRExC_state, 1, "S" );
5194 RExC_rxi->data->data[num]=(void*)sv_dat;
5195 SvREFCNT_inc(sv_dat);
5197 ret = reganode(pRExC_state,NGROUPP,num);
5198 goto insert_if_check_paren;
5200 else if (RExC_parse[0] == 'D' &&
5201 RExC_parse[1] == 'E' &&
5202 RExC_parse[2] == 'F' &&
5203 RExC_parse[3] == 'I' &&
5204 RExC_parse[4] == 'N' &&
5205 RExC_parse[5] == 'E')
5207 ret = reganode(pRExC_state,DEFINEP,0);
5210 goto insert_if_check_paren;
5212 else if (RExC_parse[0] == 'R') {
5215 if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
5216 parno = atoi(RExC_parse++);
5217 while (isDIGIT(*RExC_parse))
5219 } else if (RExC_parse[0] == '&') {
5222 sv_dat = reg_scan_name(pRExC_state,
5223 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5224 parno = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
5226 ret = reganode(pRExC_state,INSUBP,parno);
5227 goto insert_if_check_paren;
5229 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
5232 parno = atoi(RExC_parse++);
5234 while (isDIGIT(*RExC_parse))
5236 ret = reganode(pRExC_state, GROUPP, parno);
5238 insert_if_check_paren:
5239 if ((c = *nextchar(pRExC_state)) != ')')
5240 vFAIL("Switch condition not recognized");
5242 REGTAIL(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
5243 br = regbranch(pRExC_state, &flags, 1,depth+1);
5245 br = reganode(pRExC_state, LONGJMP, 0);
5247 REGTAIL(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
5248 c = *nextchar(pRExC_state);
5253 vFAIL("(?(DEFINE)....) does not allow branches");
5254 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
5255 regbranch(pRExC_state, &flags, 1,depth+1);
5256 REGTAIL(pRExC_state, ret, lastbr);
5259 c = *nextchar(pRExC_state);
5264 vFAIL("Switch (?(condition)... contains too many branches");
5265 ender = reg_node(pRExC_state, TAIL);
5266 REGTAIL(pRExC_state, br, ender);
5268 REGTAIL(pRExC_state, lastbr, ender);
5269 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
5272 REGTAIL(pRExC_state, ret, ender);
5276 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
5280 RExC_parse--; /* for vFAIL to print correctly */
5281 vFAIL("Sequence (? incomplete");
5285 parse_flags: /* (?i) */
5286 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
5287 /* (?g), (?gc) and (?o) are useless here
5288 and must be globally applied -- japhy */
5290 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
5291 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5292 const I32 wflagbit = *RExC_parse == 'o' ? WASTED_O : WASTED_G;
5293 if (! (wastedflags & wflagbit) ) {
5294 wastedflags |= wflagbit;
5297 "Useless (%s%c) - %suse /%c modifier",
5298 flagsp == &negflags ? "?-" : "?",
5300 flagsp == &negflags ? "don't " : "",
5306 else if (*RExC_parse == 'c') {
5307 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5308 if (! (wastedflags & WASTED_C) ) {
5309 wastedflags |= WASTED_GC;
5312 "Useless (%sc) - %suse /gc modifier",
5313 flagsp == &negflags ? "?-" : "?",
5314 flagsp == &negflags ? "don't " : ""
5319 else { pmflag(flagsp, *RExC_parse); }
5323 if (*RExC_parse == '-') {
5325 wastedflags = 0; /* reset so (?g-c) warns twice */
5329 RExC_flags |= posflags;
5330 RExC_flags &= ~negflags;
5331 if (*RExC_parse == ':') {
5337 if (*RExC_parse != ')') {
5339 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
5341 nextchar(pRExC_state);
5351 ret = reganode(pRExC_state, OPEN, parno);
5354 RExC_nestroot = parno;
5355 if (RExC_seen & REG_SEEN_RECURSE) {
5356 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5357 "Setting open paren #%"IVdf" to %d\n",
5358 (IV)parno, REG_NODE_NUM(ret)));
5359 RExC_open_parens[parno-1]= ret;
5362 Set_Node_Length(ret, 1); /* MJD */
5363 Set_Node_Offset(ret, RExC_parse); /* MJD */
5370 /* Pick up the branches, linking them together. */
5371 parse_start = RExC_parse; /* MJD */
5372 br = regbranch(pRExC_state, &flags, 1,depth+1);
5373 /* branch_len = (paren != 0); */
5377 if (*RExC_parse == '|') {
5378 if (!SIZE_ONLY && RExC_extralen) {
5379 reginsert(pRExC_state, BRANCHJ, br, depth+1);
5382 reginsert(pRExC_state, BRANCH, br, depth+1);
5383 Set_Node_Length(br, paren != 0);
5384 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
5388 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
5390 else if (paren == ':') {
5391 *flagp |= flags&SIMPLE;
5393 if (is_open) { /* Starts with OPEN. */
5394 REGTAIL(pRExC_state, ret, br); /* OPEN -> first. */
5396 else if (paren != '?') /* Not Conditional */
5398 *flagp |= flags & (SPSTART | HASWIDTH);
5400 while (*RExC_parse == '|') {
5401 if (!SIZE_ONLY && RExC_extralen) {
5402 ender = reganode(pRExC_state, LONGJMP,0);
5403 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
5406 RExC_extralen += 2; /* Account for LONGJMP. */
5407 nextchar(pRExC_state);
5408 br = regbranch(pRExC_state, &flags, 0, depth+1);
5412 REGTAIL(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
5416 *flagp |= flags&SPSTART;
5419 if (have_branch || paren != ':') {
5420 /* Make a closing node, and hook it on the end. */
5423 ender = reg_node(pRExC_state, TAIL);
5426 ender = reganode(pRExC_state, CLOSE, parno);
5427 if (!SIZE_ONLY && RExC_seen & REG_SEEN_RECURSE) {
5428 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5429 "Setting close paren #%"IVdf" to %d\n",
5430 (IV)parno, REG_NODE_NUM(ender)));
5431 RExC_close_parens[parno-1]= ender;
5432 if (RExC_nestroot == parno)
5435 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
5436 Set_Node_Length(ender,1); /* MJD */
5442 *flagp &= ~HASWIDTH;
5445 ender = reg_node(pRExC_state, SUCCEED);
5448 ender = reg_node(pRExC_state, END);
5450 assert(!RExC_opend); /* there can only be one! */
5455 REGTAIL(pRExC_state, lastbr, ender);
5457 if (have_branch && !SIZE_ONLY) {
5459 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
5461 /* Hook the tails of the branches to the closing node. */
5462 for (br = ret; br; br = regnext(br)) {
5463 const U8 op = PL_regkind[OP(br)];
5465 REGTAIL_STUDY(pRExC_state, NEXTOPER(br), ender);
5467 else if (op == BRANCHJ) {
5468 REGTAIL_STUDY(pRExC_state, NEXTOPER(NEXTOPER(br)), ender);
5476 static const char parens[] = "=!<,>";
5478 if (paren && (p = strchr(parens, paren))) {
5479 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
5480 int flag = (p - parens) > 1;
5483 node = SUSPEND, flag = 0;
5484 reginsert(pRExC_state, node,ret, depth+1);
5485 Set_Node_Cur_Length(ret);
5486 Set_Node_Offset(ret, parse_start + 1);
5488 REGTAIL_STUDY(pRExC_state, ret, reg_node(pRExC_state, TAIL));
5492 /* Check for proper termination. */
5494 RExC_flags = oregflags;
5495 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
5496 RExC_parse = oregcomp_parse;
5497 vFAIL("Unmatched (");
5500 else if (!paren && RExC_parse < RExC_end) {
5501 if (*RExC_parse == ')') {
5503 vFAIL("Unmatched )");
5506 FAIL("Junk on end of regexp"); /* "Can't happen". */
5514 - regbranch - one alternative of an | operator
5516 * Implements the concatenation operator.
5519 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth)
5522 register regnode *ret;
5523 register regnode *chain = NULL;
5524 register regnode *latest;
5525 I32 flags = 0, c = 0;
5526 GET_RE_DEBUG_FLAGS_DECL;
5527 DEBUG_PARSE("brnc");
5531 if (!SIZE_ONLY && RExC_extralen)
5532 ret = reganode(pRExC_state, BRANCHJ,0);
5534 ret = reg_node(pRExC_state, BRANCH);
5535 Set_Node_Length(ret, 1);
5539 if (!first && SIZE_ONLY)
5540 RExC_extralen += 1; /* BRANCHJ */
5542 *flagp = WORST; /* Tentatively. */
5545 nextchar(pRExC_state);
5546 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
5548 latest = regpiece(pRExC_state, &flags,depth+1);
5549 if (latest == NULL) {
5550 if (flags & TRYAGAIN)
5554 else if (ret == NULL)
5556 *flagp |= flags&HASWIDTH;
5557 if (chain == NULL) /* First piece. */
5558 *flagp |= flags&SPSTART;
5561 REGTAIL(pRExC_state, chain, latest);
5566 if (chain == NULL) { /* Loop ran zero times. */
5567 chain = reg_node(pRExC_state, NOTHING);
5572 *flagp |= flags&SIMPLE;
5579 - regpiece - something followed by possible [*+?]
5581 * Note that the branching code sequences used for ? and the general cases
5582 * of * and + are somewhat optimized: they use the same NOTHING node as
5583 * both the endmarker for their branch list and the body of the last branch.
5584 * It might seem that this node could be dispensed with entirely, but the
5585 * endmarker role is not redundant.
5588 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
5591 register regnode *ret;
5593 register char *next;
5595 const char * const origparse = RExC_parse;
5597 I32 max = REG_INFTY;
5599 const char *maxpos = NULL;
5600 GET_RE_DEBUG_FLAGS_DECL;
5601 DEBUG_PARSE("piec");
5603 ret = regatom(pRExC_state, &flags,depth+1);
5605 if (flags & TRYAGAIN)
5612 if (op == '{' && regcurly(RExC_parse)) {
5614 parse_start = RExC_parse; /* MJD */
5615 next = RExC_parse + 1;
5616 while (isDIGIT(*next) || *next == ',') {
5625 if (*next == '}') { /* got one */
5629 min = atoi(RExC_parse);
5633 maxpos = RExC_parse;
5635 if (!max && *maxpos != '0')
5636 max = REG_INFTY; /* meaning "infinity" */
5637 else if (max >= REG_INFTY)
5638 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
5640 nextchar(pRExC_state);
5643 if ((flags&SIMPLE)) {
5644 RExC_naughty += 2 + RExC_naughty / 2;
5645 reginsert(pRExC_state, CURLY, ret, depth+1);
5646 Set_Node_Offset(ret, parse_start+1); /* MJD */
5647 Set_Node_Cur_Length(ret);
5650 regnode * const w = reg_node(pRExC_state, WHILEM);
5653 REGTAIL(pRExC_state, ret, w);
5654 if (!SIZE_ONLY && RExC_extralen) {
5655 reginsert(pRExC_state, LONGJMP,ret, depth+1);
5656 reginsert(pRExC_state, NOTHING,ret, depth+1);
5657 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
5659 reginsert(pRExC_state, CURLYX,ret, depth+1);
5661 Set_Node_Offset(ret, parse_start+1);
5662 Set_Node_Length(ret,
5663 op == '{' ? (RExC_parse - parse_start) : 1);
5665 if (!SIZE_ONLY && RExC_extralen)
5666 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
5667 REGTAIL(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
5669 RExC_whilem_seen++, RExC_extralen += 3;
5670 RExC_naughty += 4 + RExC_naughty; /* compound interest */
5678 if (max && max < min)
5679 vFAIL("Can't do {n,m} with n > m");
5681 ARG1_SET(ret, (U16)min);
5682 ARG2_SET(ret, (U16)max);
5694 #if 0 /* Now runtime fix should be reliable. */
5696 /* if this is reinstated, don't forget to put this back into perldiag:
5698 =item Regexp *+ operand could be empty at {#} in regex m/%s/
5700 (F) The part of the regexp subject to either the * or + quantifier
5701 could match an empty string. The {#} shows in the regular
5702 expression about where the problem was discovered.
5706 if (!(flags&HASWIDTH) && op != '?')
5707 vFAIL("Regexp *+ operand could be empty");
5710 parse_start = RExC_parse;
5711 nextchar(pRExC_state);
5713 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
5715 if (op == '*' && (flags&SIMPLE)) {
5716 reginsert(pRExC_state, STAR, ret, depth+1);
5720 else if (op == '*') {
5724 else if (op == '+' && (flags&SIMPLE)) {
5725 reginsert(pRExC_state, PLUS, ret, depth+1);
5729 else if (op == '+') {
5733 else if (op == '?') {
5738 if (!SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3 && ckWARN(WARN_REGEXP)) {
5740 "%.*s matches null string many times",
5741 (int)(RExC_parse >= origparse ? RExC_parse - origparse : 0),
5745 if (RExC_parse < RExC_end && *RExC_parse == '?') {
5746 nextchar(pRExC_state);
5747 reginsert(pRExC_state, MINMOD, ret, depth+1);
5748 REGTAIL(pRExC_state, ret, ret + NODE_STEP_REGNODE);
5750 #ifndef REG_ALLOW_MINMOD_SUSPEND
5753 if (RExC_parse < RExC_end && *RExC_parse == '+') {
5755 nextchar(pRExC_state);
5756 ender = reg_node(pRExC_state, SUCCEED);
5757 REGTAIL(pRExC_state, ret, ender);
5758 reginsert(pRExC_state, SUSPEND, ret, depth+1);
5760 ender = reg_node(pRExC_state, TAIL);
5761 REGTAIL(pRExC_state, ret, ender);
5765 if (RExC_parse < RExC_end && ISMULT2(RExC_parse)) {
5767 vFAIL("Nested quantifiers");
5774 /* reg_namedseq(pRExC_state,UVp)
5776 This is expected to be called by a parser routine that has
5777 recognized'\N' and needs to handle the rest. RExC_parse is
5778 expected to point at the first char following the N at the time
5781 If valuep is non-null then it is assumed that we are parsing inside
5782 of a charclass definition and the first codepoint in the resolved
5783 string is returned via *valuep and the routine will return NULL.
5784 In this mode if a multichar string is returned from the charnames
5785 handler a warning will be issued, and only the first char in the
5786 sequence will be examined. If the string returned is zero length
5787 then the value of *valuep is undefined and NON-NULL will
5788 be returned to indicate failure. (This will NOT be a valid pointer
5791 If value is null then it is assumed that we are parsing normal text
5792 and inserts a new EXACT node into the program containing the resolved
5793 string and returns a pointer to the new node. If the string is
5794 zerolength a NOTHING node is emitted.
5796 On success RExC_parse is set to the char following the endbrace.
5797 Parsing failures will generate a fatal errorvia vFAIL(...)
5799 NOTE: We cache all results from the charnames handler locally in
5800 the RExC_charnames hash (created on first use) to prevent a charnames
5801 handler from playing silly-buggers and returning a short string and
5802 then a long string for a given pattern. Since the regexp program
5803 size is calculated during an initial parse this would result
5804 in a buffer overrun so we cache to prevent the charname result from
5805 changing during the course of the parse.
5809 S_reg_namedseq(pTHX_ RExC_state_t *pRExC_state, UV *valuep)
5811 char * name; /* start of the content of the name */
5812 char * endbrace; /* endbrace following the name */
5815 STRLEN len; /* this has various purposes throughout the code */
5816 bool cached = 0; /* if this is true then we shouldn't refcount dev sv_str */
5817 regnode *ret = NULL;
5819 if (*RExC_parse != '{') {
5820 vFAIL("Missing braces on \\N{}");
5822 name = RExC_parse+1;
5823 endbrace = strchr(RExC_parse, '}');
5826 vFAIL("Missing right brace on \\N{}");
5828 RExC_parse = endbrace + 1;
5831 /* RExC_parse points at the beginning brace,
5832 endbrace points at the last */
5833 if ( name[0]=='U' && name[1]=='+' ) {
5834 /* its a "unicode hex" notation {U+89AB} */
5835 I32 fl = PERL_SCAN_ALLOW_UNDERSCORES
5836 | PERL_SCAN_DISALLOW_PREFIX
5837 | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0);
5839 len = (STRLEN)(endbrace - name - 2);
5840 cp = grok_hex(name + 2, &len, &fl, NULL);
5841 if ( len != (STRLEN)(endbrace - name - 2) ) {
5850 sv_str= Perl_newSVpvf_nocontext("%c",(int)cp);
5852 /* fetch the charnames handler for this scope */
5853 HV * const table = GvHV(PL_hintgv);
5855 hv_fetchs(table, "charnames", FALSE) :
5857 SV *cv= cvp ? *cvp : NULL;
5860 /* create an SV with the name as argument */
5861 sv_name = newSVpvn(name, endbrace - name);
5863 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5864 vFAIL2("Constant(\\N{%s}) unknown: "
5865 "(possibly a missing \"use charnames ...\")",
5868 if (!cvp || !SvOK(*cvp)) { /* when $^H{charnames} = undef; */
5869 vFAIL2("Constant(\\N{%s}): "
5870 "$^H{charnames} is not defined",SvPVX(sv_name));
5875 if (!RExC_charnames) {
5876 /* make sure our cache is allocated */
5877 RExC_charnames = newHV();
5878 sv_2mortal((SV*)RExC_charnames);
5880 /* see if we have looked this one up before */
5881 he_str = hv_fetch_ent( RExC_charnames, sv_name, 0, 0 );
5883 sv_str = HeVAL(he_str);
5896 count= call_sv(cv, G_SCALAR);
5898 if (count == 1) { /* XXXX is this right? dmq */
5900 SvREFCNT_inc_simple_void(sv_str);
5908 if ( !sv_str || !SvOK(sv_str) ) {
5909 vFAIL2("Constant(\\N{%s}): Call to &{$^H{charnames}} "
5910 "did not return a defined value",SvPVX(sv_name));
5912 if (hv_store_ent( RExC_charnames, sv_name, sv_str, 0))
5917 char *p = SvPV(sv_str, len);
5920 if ( SvUTF8(sv_str) ) {
5921 *valuep = utf8_to_uvchr((U8*)p, &numlen);
5925 We have to turn on utf8 for high bit chars otherwise
5926 we get failures with
5928 "ss" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5929 "SS" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5931 This is different from what \x{} would do with the same
5932 codepoint, where the condition is > 0xFF.
5939 /* warn if we havent used the whole string? */
5941 if (numlen<len && SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5943 "Ignoring excess chars from \\N{%s} in character class",
5947 } else if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5949 "Ignoring zero length \\N{%s} in character class",
5954 SvREFCNT_dec(sv_name);
5956 SvREFCNT_dec(sv_str);
5957 return len ? NULL : (regnode *)&len;
5958 } else if(SvCUR(sv_str)) {
5963 char * parse_start = name-3; /* needed for the offsets */
5964 GET_RE_DEBUG_FLAGS_DECL; /* needed for the offsets */
5966 ret = reg_node(pRExC_state,
5967 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
5970 if ( RExC_utf8 && !SvUTF8(sv_str) ) {
5971 sv_utf8_upgrade(sv_str);
5972 } else if ( !RExC_utf8 && SvUTF8(sv_str) ) {
5976 p = SvPV(sv_str, len);
5978 /* len is the length written, charlen is the size the char read */
5979 for ( len = 0; p < pend; p += charlen ) {
5981 UV uvc = utf8_to_uvchr((U8*)p, &charlen);
5983 STRLEN foldlen,numlen;
5984 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
5985 uvc = toFOLD_uni(uvc, tmpbuf, &foldlen);
5986 /* Emit all the Unicode characters. */
5988 for (foldbuf = tmpbuf;
5992 uvc = utf8_to_uvchr(foldbuf, &numlen);
5994 const STRLEN unilen = reguni(pRExC_state, uvc, s);
5997 /* In EBCDIC the numlen
5998 * and unilen can differ. */
6000 if (numlen >= foldlen)
6004 break; /* "Can't happen." */
6007 const STRLEN unilen = reguni(pRExC_state, uvc, s);
6019 RExC_size += STR_SZ(len);
6022 RExC_emit += STR_SZ(len);
6024 Set_Node_Cur_Length(ret); /* MJD */
6026 nextchar(pRExC_state);
6028 ret = reg_node(pRExC_state,NOTHING);
6031 SvREFCNT_dec(sv_str);
6034 SvREFCNT_dec(sv_name);
6044 * It returns the code point in utf8 for the value in *encp.
6045 * value: a code value in the source encoding
6046 * encp: a pointer to an Encode object
6048 * If the result from Encode is not a single character,
6049 * it returns U+FFFD (Replacement character) and sets *encp to NULL.
6052 S_reg_recode(pTHX_ const char value, SV **encp)
6055 SV * const sv = sv_2mortal(newSVpvn(&value, numlen));
6056 const char * const s = encp && *encp ? sv_recode_to_utf8(sv, *encp)
6058 const STRLEN newlen = SvCUR(sv);
6059 UV uv = UNICODE_REPLACEMENT;
6063 ? utf8n_to_uvchr((U8*)s, newlen, &numlen, UTF8_ALLOW_DEFAULT)
6066 if (!newlen || numlen != newlen) {
6067 uv = UNICODE_REPLACEMENT;
6076 - regatom - the lowest level
6078 * Optimization: gobbles an entire sequence of ordinary characters so that
6079 * it can turn them into a single node, which is smaller to store and
6080 * faster to run. Backslashed characters are exceptions, each becoming a
6081 * separate node; the code is simpler that way and it's not worth fixing.
6083 * [Yes, it is worth fixing, some scripts can run twice the speed.]
6084 * [It looks like its ok, as in S_study_chunk we merge adjacent EXACT nodes]
6087 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
6090 register regnode *ret = NULL;
6092 char *parse_start = RExC_parse;
6093 GET_RE_DEBUG_FLAGS_DECL;
6094 DEBUG_PARSE("atom");
6095 *flagp = WORST; /* Tentatively. */
6098 switch (*RExC_parse) {
6100 RExC_seen_zerolen++;
6101 nextchar(pRExC_state);
6102 if (RExC_flags & RXf_PMf_MULTILINE)
6103 ret = reg_node(pRExC_state, MBOL);
6104 else if (RExC_flags & RXf_PMf_SINGLELINE)
6105 ret = reg_node(pRExC_state, SBOL);
6107 ret = reg_node(pRExC_state, BOL);
6108 Set_Node_Length(ret, 1); /* MJD */
6111 nextchar(pRExC_state);
6113 RExC_seen_zerolen++;
6114 if (RExC_flags & RXf_PMf_MULTILINE)
6115 ret = reg_node(pRExC_state, MEOL);
6116 else if (RExC_flags & RXf_PMf_SINGLELINE)
6117 ret = reg_node(pRExC_state, SEOL);
6119 ret = reg_node(pRExC_state, EOL);
6120 Set_Node_Length(ret, 1); /* MJD */
6123 nextchar(pRExC_state);
6124 if (RExC_flags & RXf_PMf_SINGLELINE)
6125 ret = reg_node(pRExC_state, SANY);
6127 ret = reg_node(pRExC_state, REG_ANY);
6128 *flagp |= HASWIDTH|SIMPLE;
6130 Set_Node_Length(ret, 1); /* MJD */
6134 char * const oregcomp_parse = ++RExC_parse;
6135 ret = regclass(pRExC_state,depth+1);
6136 if (*RExC_parse != ']') {
6137 RExC_parse = oregcomp_parse;
6138 vFAIL("Unmatched [");
6140 nextchar(pRExC_state);
6141 *flagp |= HASWIDTH|SIMPLE;
6142 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
6146 nextchar(pRExC_state);
6147 ret = reg(pRExC_state, 1, &flags,depth+1);
6149 if (flags & TRYAGAIN) {
6150 if (RExC_parse == RExC_end) {
6151 /* Make parent create an empty node if needed. */
6159 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
6163 if (flags & TRYAGAIN) {
6167 vFAIL("Internal urp");
6168 /* Supposed to be caught earlier. */
6171 if (!regcurly(RExC_parse)) {
6180 vFAIL("Quantifier follows nothing");
6183 switch (*++RExC_parse) {
6185 RExC_seen_zerolen++;
6186 ret = reg_node(pRExC_state, SBOL);
6188 nextchar(pRExC_state);
6189 Set_Node_Length(ret, 2); /* MJD */
6192 ret = reg_node(pRExC_state, GPOS);
6193 RExC_seen |= REG_SEEN_GPOS;
6195 nextchar(pRExC_state);
6196 Set_Node_Length(ret, 2); /* MJD */
6199 ret = reg_node(pRExC_state, SEOL);
6201 RExC_seen_zerolen++; /* Do not optimize RE away */
6202 nextchar(pRExC_state);
6205 ret = reg_node(pRExC_state, EOS);
6207 RExC_seen_zerolen++; /* Do not optimize RE away */
6208 nextchar(pRExC_state);
6209 Set_Node_Length(ret, 2); /* MJD */
6212 ret = reg_node(pRExC_state, CANY);
6213 RExC_seen |= REG_SEEN_CANY;
6214 *flagp |= HASWIDTH|SIMPLE;
6215 nextchar(pRExC_state);
6216 Set_Node_Length(ret, 2); /* MJD */
6219 ret = reg_node(pRExC_state, CLUMP);
6221 nextchar(pRExC_state);
6222 Set_Node_Length(ret, 2); /* MJD */
6225 ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM));
6226 *flagp |= HASWIDTH|SIMPLE;
6227 nextchar(pRExC_state);
6228 Set_Node_Length(ret, 2); /* MJD */
6231 ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM));
6232 *flagp |= HASWIDTH|SIMPLE;
6233 nextchar(pRExC_state);
6234 Set_Node_Length(ret, 2); /* MJD */
6237 RExC_seen_zerolen++;
6238 RExC_seen |= REG_SEEN_LOOKBEHIND;
6239 ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND));
6241 nextchar(pRExC_state);
6242 Set_Node_Length(ret, 2); /* MJD */
6245 RExC_seen_zerolen++;
6246 RExC_seen |= REG_SEEN_LOOKBEHIND;
6247 ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND));
6249 nextchar(pRExC_state);
6250 Set_Node_Length(ret, 2); /* MJD */
6253 ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE));
6254 *flagp |= HASWIDTH|SIMPLE;
6255 nextchar(pRExC_state);
6256 Set_Node_Length(ret, 2); /* MJD */
6259 ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE));
6260 *flagp |= HASWIDTH|SIMPLE;
6261 nextchar(pRExC_state);
6262 Set_Node_Length(ret, 2); /* MJD */
6265 ret = reg_node(pRExC_state, DIGIT);
6266 *flagp |= HASWIDTH|SIMPLE;
6267 nextchar(pRExC_state);
6268 Set_Node_Length(ret, 2); /* MJD */
6271 ret = reg_node(pRExC_state, NDIGIT);
6272 *flagp |= HASWIDTH|SIMPLE;
6273 nextchar(pRExC_state);
6274 Set_Node_Length(ret, 2); /* MJD */
6279 char* const oldregxend = RExC_end;
6280 char* parse_start = RExC_parse - 2;
6282 if (RExC_parse[1] == '{') {
6283 /* a lovely hack--pretend we saw [\pX] instead */
6284 RExC_end = strchr(RExC_parse, '}');
6286 const U8 c = (U8)*RExC_parse;
6288 RExC_end = oldregxend;
6289 vFAIL2("Missing right brace on \\%c{}", c);
6294 RExC_end = RExC_parse + 2;
6295 if (RExC_end > oldregxend)
6296 RExC_end = oldregxend;
6300 ret = regclass(pRExC_state,depth+1);
6302 RExC_end = oldregxend;
6305 Set_Node_Offset(ret, parse_start + 2);
6306 Set_Node_Cur_Length(ret);
6307 nextchar(pRExC_state);
6308 *flagp |= HASWIDTH|SIMPLE;
6312 /* Handle \N{NAME} here and not below because it can be
6313 multicharacter. join_exact() will join them up later on.
6314 Also this makes sure that things like /\N{BLAH}+/ and
6315 \N{BLAH} being multi char Just Happen. dmq*/
6317 ret= reg_namedseq(pRExC_state, NULL);
6319 case 'k': /* Handle \k<NAME> and \k'NAME' */
6321 char ch= RExC_parse[1];
6322 if (ch != '<' && ch != '\'') {
6324 vWARN( RExC_parse + 1,
6325 "Possible broken named back reference treated as literal k");
6329 char* name_start = (RExC_parse += 2);
6331 SV *sv_dat = reg_scan_name(pRExC_state,
6332 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
6333 ch= (ch == '<') ? '>' : '\'';
6335 if (RExC_parse == name_start || *RExC_parse != ch)
6336 vFAIL2("Sequence \\k%c... not terminated",
6337 (ch == '>' ? '<' : ch));
6340 ret = reganode(pRExC_state,
6341 (U8)(FOLD ? (LOC ? NREFFL : NREFF) : NREF),
6347 num = add_data( pRExC_state, 1, "S" );
6349 RExC_rxi->data->data[num]=(void*)sv_dat;
6350 SvREFCNT_inc(sv_dat);
6352 /* override incorrect value set in reganode MJD */
6353 Set_Node_Offset(ret, parse_start+1);
6354 Set_Node_Cur_Length(ret); /* MJD */
6355 nextchar(pRExC_state);
6371 case '1': case '2': case '3': case '4':
6372 case '5': case '6': case '7': case '8': case '9':
6375 bool isg = *RExC_parse == 'g';
6380 if (*RExC_parse == '{') {
6384 if (*RExC_parse == '-') {
6389 num = atoi(RExC_parse);
6391 num = RExC_npar - num;
6393 vFAIL("Reference to nonexistent or unclosed group");
6395 if (!isg && num > 9 && num >= RExC_npar)
6398 char * const parse_start = RExC_parse - 1; /* MJD */
6399 while (isDIGIT(*RExC_parse))
6402 if (*RExC_parse != '}')
6403 vFAIL("Unterminated \\g{...} pattern");
6407 if (num > (I32)RExC_rx->nparens)
6408 vFAIL("Reference to nonexistent group");
6411 ret = reganode(pRExC_state,
6412 (U8)(FOLD ? (LOC ? REFFL : REFF) : REF),
6416 /* override incorrect value set in reganode MJD */
6417 Set_Node_Offset(ret, parse_start+1);
6418 Set_Node_Cur_Length(ret); /* MJD */
6420 nextchar(pRExC_state);
6425 if (RExC_parse >= RExC_end)
6426 FAIL("Trailing \\");
6429 /* Do not generate "unrecognized" warnings here, we fall
6430 back into the quick-grab loop below */
6437 if (RExC_flags & RXf_PMf_EXTENDED) {
6438 while (RExC_parse < RExC_end && *RExC_parse != '\n')
6440 if (RExC_parse < RExC_end)
6446 register STRLEN len;
6451 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
6453 parse_start = RExC_parse - 1;
6459 ret = reg_node(pRExC_state,
6460 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
6462 for (len = 0, p = RExC_parse - 1;
6463 len < 127 && p < RExC_end;
6466 char * const oldp = p;
6468 if (RExC_flags & RXf_PMf_EXTENDED)
6469 p = regwhite(p, RExC_end);
6520 ender = ASCII_TO_NATIVE('\033');
6524 ender = ASCII_TO_NATIVE('\007');
6529 char* const e = strchr(p, '}');
6533 vFAIL("Missing right brace on \\x{}");
6536 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
6537 | PERL_SCAN_DISALLOW_PREFIX;
6538 STRLEN numlen = e - p - 1;
6539 ender = grok_hex(p + 1, &numlen, &flags, NULL);
6546 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
6548 ender = grok_hex(p, &numlen, &flags, NULL);
6551 if (PL_encoding && ender < 0x100)
6552 goto recode_encoding;
6556 ender = UCHARAT(p++);
6557 ender = toCTRL(ender);
6559 case '0': case '1': case '2': case '3':case '4':
6560 case '5': case '6': case '7': case '8':case '9':
6562 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
6565 ender = grok_oct(p, &numlen, &flags, NULL);
6572 if (PL_encoding && ender < 0x100)
6573 goto recode_encoding;
6577 SV* enc = PL_encoding;
6578 ender = reg_recode((const char)(U8)ender, &enc);
6579 if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP))
6580 vWARN(p, "Invalid escape in the specified encoding");
6586 FAIL("Trailing \\");
6589 if (!SIZE_ONLY&& isALPHA(*p) && ckWARN(WARN_REGEXP))
6590 vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
6591 goto normal_default;
6596 if (UTF8_IS_START(*p) && UTF) {
6598 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
6599 &numlen, UTF8_ALLOW_DEFAULT);
6606 if (RExC_flags & RXf_PMf_EXTENDED)
6607 p = regwhite(p, RExC_end);
6609 /* Prime the casefolded buffer. */
6610 ender = toFOLD_uni(ender, tmpbuf, &foldlen);
6612 if (ISMULT2(p)) { /* Back off on ?+*. */
6617 /* Emit all the Unicode characters. */
6619 for (foldbuf = tmpbuf;
6621 foldlen -= numlen) {
6622 ender = utf8_to_uvchr(foldbuf, &numlen);
6624 const STRLEN unilen = reguni(pRExC_state, ender, s);
6627 /* In EBCDIC the numlen
6628 * and unilen can differ. */
6630 if (numlen >= foldlen)
6634 break; /* "Can't happen." */
6638 const STRLEN unilen = reguni(pRExC_state, ender, s);
6647 REGC((char)ender, s++);
6653 /* Emit all the Unicode characters. */
6655 for (foldbuf = tmpbuf;
6657 foldlen -= numlen) {
6658 ender = utf8_to_uvchr(foldbuf, &numlen);
6660 const STRLEN unilen = reguni(pRExC_state, ender, s);
6663 /* In EBCDIC the numlen
6664 * and unilen can differ. */
6666 if (numlen >= foldlen)
6674 const STRLEN unilen = reguni(pRExC_state, ender, s);
6683 REGC((char)ender, s++);
6687 Set_Node_Cur_Length(ret); /* MJD */
6688 nextchar(pRExC_state);
6690 /* len is STRLEN which is unsigned, need to copy to signed */
6693 vFAIL("Internal disaster");
6697 if (len == 1 && UNI_IS_INVARIANT(ender))
6701 RExC_size += STR_SZ(len);
6704 RExC_emit += STR_SZ(len);
6714 S_regwhite(char *p, const char *e)
6719 else if (*p == '#') {
6722 } while (p < e && *p != '\n');
6730 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
6731 Character classes ([:foo:]) can also be negated ([:^foo:]).
6732 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
6733 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
6734 but trigger failures because they are currently unimplemented. */
6736 #define POSIXCC_DONE(c) ((c) == ':')
6737 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
6738 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
6741 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
6744 I32 namedclass = OOB_NAMEDCLASS;
6746 if (value == '[' && RExC_parse + 1 < RExC_end &&
6747 /* I smell either [: or [= or [. -- POSIX has been here, right? */
6748 POSIXCC(UCHARAT(RExC_parse))) {
6749 const char c = UCHARAT(RExC_parse);
6750 char* const s = RExC_parse++;
6752 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
6754 if (RExC_parse == RExC_end)
6755 /* Grandfather lone [:, [=, [. */
6758 const char* const t = RExC_parse++; /* skip over the c */
6761 if (UCHARAT(RExC_parse) == ']') {
6762 const char *posixcc = s + 1;
6763 RExC_parse++; /* skip over the ending ] */
6766 const I32 complement = *posixcc == '^' ? *posixcc++ : 0;
6767 const I32 skip = t - posixcc;
6769 /* Initially switch on the length of the name. */
6772 if (memEQ(posixcc, "word", 4)) /* this is not POSIX, this is the Perl \w */
6773 namedclass = complement ? ANYOF_NALNUM : ANYOF_ALNUM;
6776 /* Names all of length 5. */
6777 /* alnum alpha ascii blank cntrl digit graph lower
6778 print punct space upper */
6779 /* Offset 4 gives the best switch position. */
6780 switch (posixcc[4]) {
6782 if (memEQ(posixcc, "alph", 4)) /* alpha */
6783 namedclass = complement ? ANYOF_NALPHA : ANYOF_ALPHA;
6786 if (memEQ(posixcc, "spac", 4)) /* space */
6787 namedclass = complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
6790 if (memEQ(posixcc, "grap", 4)) /* graph */
6791 namedclass = complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
6794 if (memEQ(posixcc, "asci", 4)) /* ascii */
6795 namedclass = complement ? ANYOF_NASCII : ANYOF_ASCII;
6798 if (memEQ(posixcc, "blan", 4)) /* blank */
6799 namedclass = complement ? ANYOF_NBLANK : ANYOF_BLANK;
6802 if (memEQ(posixcc, "cntr", 4)) /* cntrl */
6803 namedclass = complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
6806 if (memEQ(posixcc, "alnu", 4)) /* alnum */
6807 namedclass = complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
6810 if (memEQ(posixcc, "lowe", 4)) /* lower */
6811 namedclass = complement ? ANYOF_NLOWER : ANYOF_LOWER;
6812 else if (memEQ(posixcc, "uppe", 4)) /* upper */
6813 namedclass = complement ? ANYOF_NUPPER : ANYOF_UPPER;
6816 if (memEQ(posixcc, "digi", 4)) /* digit */
6817 namedclass = complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
6818 else if (memEQ(posixcc, "prin", 4)) /* print */
6819 namedclass = complement ? ANYOF_NPRINT : ANYOF_PRINT;
6820 else if (memEQ(posixcc, "punc", 4)) /* punct */
6821 namedclass = complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
6826 if (memEQ(posixcc, "xdigit", 6))
6827 namedclass = complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
6831 if (namedclass == OOB_NAMEDCLASS)
6832 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
6834 assert (posixcc[skip] == ':');
6835 assert (posixcc[skip+1] == ']');
6836 } else if (!SIZE_ONLY) {
6837 /* [[=foo=]] and [[.foo.]] are still future. */
6839 /* adjust RExC_parse so the warning shows after
6841 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
6843 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6846 /* Maternal grandfather:
6847 * "[:" ending in ":" but not in ":]" */
6857 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
6860 if (POSIXCC(UCHARAT(RExC_parse))) {
6861 const char *s = RExC_parse;
6862 const char c = *s++;
6866 if (*s && c == *s && s[1] == ']') {
6867 if (ckWARN(WARN_REGEXP))
6869 "POSIX syntax [%c %c] belongs inside character classes",
6872 /* [[=foo=]] and [[.foo.]] are still future. */
6873 if (POSIXCC_NOTYET(c)) {
6874 /* adjust RExC_parse so the error shows after
6876 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
6878 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6886 parse a class specification and produce either an ANYOF node that
6887 matches the pattern. If the pattern matches a single char only and
6888 that char is < 256 then we produce an EXACT node instead.
6891 S_regclass(pTHX_ RExC_state_t *pRExC_state, U32 depth)
6894 register UV value = 0;
6895 register UV nextvalue;
6896 register IV prevvalue = OOB_UNICODE;
6897 register IV range = 0;
6898 register regnode *ret;
6901 char *rangebegin = NULL;
6902 bool need_class = 0;
6905 bool optimize_invert = TRUE;
6906 AV* unicode_alternate = NULL;
6908 UV literal_endpoint = 0;
6910 UV stored = 0; /* number of chars stored in the class */
6912 regnode * const orig_emit = RExC_emit; /* Save the original RExC_emit in
6913 case we need to change the emitted regop to an EXACT. */
6914 const char * orig_parse = RExC_parse;
6915 GET_RE_DEBUG_FLAGS_DECL;
6917 PERL_UNUSED_ARG(depth);
6920 DEBUG_PARSE("clas");
6922 /* Assume we are going to generate an ANYOF node. */
6923 ret = reganode(pRExC_state, ANYOF, 0);
6926 ANYOF_FLAGS(ret) = 0;
6928 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
6932 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
6936 RExC_size += ANYOF_SKIP;
6937 listsv = &PL_sv_undef; /* For code scanners: listsv always non-NULL. */
6940 RExC_emit += ANYOF_SKIP;
6942 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
6944 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
6945 ANYOF_BITMAP_ZERO(ret);
6946 listsv = newSVpvs("# comment\n");
6949 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6951 if (!SIZE_ONLY && POSIXCC(nextvalue))
6952 checkposixcc(pRExC_state);
6954 /* allow 1st char to be ] (allowing it to be - is dealt with later) */
6955 if (UCHARAT(RExC_parse) == ']')
6959 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
6963 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
6966 rangebegin = RExC_parse;
6968 value = utf8n_to_uvchr((U8*)RExC_parse,
6969 RExC_end - RExC_parse,
6970 &numlen, UTF8_ALLOW_DEFAULT);
6971 RExC_parse += numlen;
6974 value = UCHARAT(RExC_parse++);
6976 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6977 if (value == '[' && POSIXCC(nextvalue))
6978 namedclass = regpposixcc(pRExC_state, value);
6979 else if (value == '\\') {
6981 value = utf8n_to_uvchr((U8*)RExC_parse,
6982 RExC_end - RExC_parse,
6983 &numlen, UTF8_ALLOW_DEFAULT);
6984 RExC_parse += numlen;
6987 value = UCHARAT(RExC_parse++);
6988 /* Some compilers cannot handle switching on 64-bit integer
6989 * values, therefore value cannot be an UV. Yes, this will
6990 * be a problem later if we want switch on Unicode.
6991 * A similar issue a little bit later when switching on
6992 * namedclass. --jhi */
6993 switch ((I32)value) {
6994 case 'w': namedclass = ANYOF_ALNUM; break;
6995 case 'W': namedclass = ANYOF_NALNUM; break;
6996 case 's': namedclass = ANYOF_SPACE; break;
6997 case 'S': namedclass = ANYOF_NSPACE; break;
6998 case 'd': namedclass = ANYOF_DIGIT; break;
6999 case 'D': namedclass = ANYOF_NDIGIT; break;
7000 case 'N': /* Handle \N{NAME} in class */
7002 /* We only pay attention to the first char of
7003 multichar strings being returned. I kinda wonder
7004 if this makes sense as it does change the behaviour
7005 from earlier versions, OTOH that behaviour was broken
7007 UV v; /* value is register so we cant & it /grrr */
7008 if (reg_namedseq(pRExC_state, &v)) {
7018 if (RExC_parse >= RExC_end)
7019 vFAIL2("Empty \\%c{}", (U8)value);
7020 if (*RExC_parse == '{') {
7021 const U8 c = (U8)value;
7022 e = strchr(RExC_parse++, '}');
7024 vFAIL2("Missing right brace on \\%c{}", c);
7025 while (isSPACE(UCHARAT(RExC_parse)))
7027 if (e == RExC_parse)
7028 vFAIL2("Empty \\%c{}", c);
7030 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
7038 if (UCHARAT(RExC_parse) == '^') {
7041 value = value == 'p' ? 'P' : 'p'; /* toggle */
7042 while (isSPACE(UCHARAT(RExC_parse))) {
7047 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::%.*s\n",
7048 (value=='p' ? '+' : '!'), (int)n, RExC_parse);
7051 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7052 namedclass = ANYOF_MAX; /* no official name, but it's named */
7055 case 'n': value = '\n'; break;
7056 case 'r': value = '\r'; break;
7057 case 't': value = '\t'; break;
7058 case 'f': value = '\f'; break;
7059 case 'b': value = '\b'; break;
7060 case 'e': value = ASCII_TO_NATIVE('\033');break;
7061 case 'a': value = ASCII_TO_NATIVE('\007');break;
7063 if (*RExC_parse == '{') {
7064 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
7065 | PERL_SCAN_DISALLOW_PREFIX;
7066 char * const e = strchr(RExC_parse++, '}');
7068 vFAIL("Missing right brace on \\x{}");
7070 numlen = e - RExC_parse;
7071 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
7075 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
7077 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
7078 RExC_parse += numlen;
7080 if (PL_encoding && value < 0x100)
7081 goto recode_encoding;
7084 value = UCHARAT(RExC_parse++);
7085 value = toCTRL(value);
7087 case '0': case '1': case '2': case '3': case '4':
7088 case '5': case '6': case '7': case '8': case '9':
7092 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
7093 RExC_parse += numlen;
7094 if (PL_encoding && value < 0x100)
7095 goto recode_encoding;
7100 SV* enc = PL_encoding;
7101 value = reg_recode((const char)(U8)value, &enc);
7102 if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP))
7104 "Invalid escape in the specified encoding");
7108 if (!SIZE_ONLY && isALPHA(value) && ckWARN(WARN_REGEXP))
7110 "Unrecognized escape \\%c in character class passed through",
7114 } /* end of \blah */
7120 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
7122 if (!SIZE_ONLY && !need_class)
7123 ANYOF_CLASS_ZERO(ret);
7127 /* a bad range like a-\d, a-[:digit:] ? */
7130 if (ckWARN(WARN_REGEXP)) {
7132 RExC_parse >= rangebegin ?
7133 RExC_parse - rangebegin : 0;
7135 "False [] range \"%*.*s\"",
7138 if (prevvalue < 256) {
7139 ANYOF_BITMAP_SET(ret, prevvalue);
7140 ANYOF_BITMAP_SET(ret, '-');
7143 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7144 Perl_sv_catpvf(aTHX_ listsv,
7145 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
7149 range = 0; /* this was not a true range */
7153 const char *what = NULL;
7156 if (namedclass > OOB_NAMEDCLASS)
7157 optimize_invert = FALSE;
7158 /* Possible truncation here but in some 64-bit environments
7159 * the compiler gets heartburn about switch on 64-bit values.
7160 * A similar issue a little earlier when switching on value.
7162 switch ((I32)namedclass) {
7165 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
7167 for (value = 0; value < 256; value++)
7169 ANYOF_BITMAP_SET(ret, value);
7176 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
7178 for (value = 0; value < 256; value++)
7179 if (!isALNUM(value))
7180 ANYOF_BITMAP_SET(ret, value);
7187 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
7189 for (value = 0; value < 256; value++)
7190 if (isALNUMC(value))
7191 ANYOF_BITMAP_SET(ret, value);
7198 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
7200 for (value = 0; value < 256; value++)
7201 if (!isALNUMC(value))
7202 ANYOF_BITMAP_SET(ret, value);
7209 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
7211 for (value = 0; value < 256; value++)
7213 ANYOF_BITMAP_SET(ret, value);
7220 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
7222 for (value = 0; value < 256; value++)
7223 if (!isALPHA(value))
7224 ANYOF_BITMAP_SET(ret, value);
7231 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
7234 for (value = 0; value < 128; value++)
7235 ANYOF_BITMAP_SET(ret, value);
7237 for (value = 0; value < 256; value++) {
7239 ANYOF_BITMAP_SET(ret, value);
7248 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
7251 for (value = 128; value < 256; value++)
7252 ANYOF_BITMAP_SET(ret, value);
7254 for (value = 0; value < 256; value++) {
7255 if (!isASCII(value))
7256 ANYOF_BITMAP_SET(ret, value);
7265 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
7267 for (value = 0; value < 256; value++)
7269 ANYOF_BITMAP_SET(ret, value);
7276 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
7278 for (value = 0; value < 256; value++)
7279 if (!isBLANK(value))
7280 ANYOF_BITMAP_SET(ret, value);
7287 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
7289 for (value = 0; value < 256; value++)
7291 ANYOF_BITMAP_SET(ret, value);
7298 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
7300 for (value = 0; value < 256; value++)
7301 if (!isCNTRL(value))
7302 ANYOF_BITMAP_SET(ret, value);
7309 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
7311 /* consecutive digits assumed */
7312 for (value = '0'; value <= '9'; value++)
7313 ANYOF_BITMAP_SET(ret, value);
7320 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
7322 /* consecutive digits assumed */
7323 for (value = 0; value < '0'; value++)
7324 ANYOF_BITMAP_SET(ret, value);
7325 for (value = '9' + 1; value < 256; value++)
7326 ANYOF_BITMAP_SET(ret, value);
7333 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
7335 for (value = 0; value < 256; value++)
7337 ANYOF_BITMAP_SET(ret, value);
7344 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
7346 for (value = 0; value < 256; value++)
7347 if (!isGRAPH(value))
7348 ANYOF_BITMAP_SET(ret, value);
7355 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
7357 for (value = 0; value < 256; value++)
7359 ANYOF_BITMAP_SET(ret, value);
7366 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
7368 for (value = 0; value < 256; value++)
7369 if (!isLOWER(value))
7370 ANYOF_BITMAP_SET(ret, value);
7377 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
7379 for (value = 0; value < 256; value++)
7381 ANYOF_BITMAP_SET(ret, value);
7388 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
7390 for (value = 0; value < 256; value++)
7391 if (!isPRINT(value))
7392 ANYOF_BITMAP_SET(ret, value);
7399 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
7401 for (value = 0; value < 256; value++)
7402 if (isPSXSPC(value))
7403 ANYOF_BITMAP_SET(ret, value);
7410 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
7412 for (value = 0; value < 256; value++)
7413 if (!isPSXSPC(value))
7414 ANYOF_BITMAP_SET(ret, value);
7421 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
7423 for (value = 0; value < 256; value++)
7425 ANYOF_BITMAP_SET(ret, value);
7432 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
7434 for (value = 0; value < 256; value++)
7435 if (!isPUNCT(value))
7436 ANYOF_BITMAP_SET(ret, value);
7443 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
7445 for (value = 0; value < 256; value++)
7447 ANYOF_BITMAP_SET(ret, value);
7454 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
7456 for (value = 0; value < 256; value++)
7457 if (!isSPACE(value))
7458 ANYOF_BITMAP_SET(ret, value);
7465 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
7467 for (value = 0; value < 256; value++)
7469 ANYOF_BITMAP_SET(ret, value);
7476 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
7478 for (value = 0; value < 256; value++)
7479 if (!isUPPER(value))
7480 ANYOF_BITMAP_SET(ret, value);
7487 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
7489 for (value = 0; value < 256; value++)
7490 if (isXDIGIT(value))
7491 ANYOF_BITMAP_SET(ret, value);
7498 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
7500 for (value = 0; value < 256; value++)
7501 if (!isXDIGIT(value))
7502 ANYOF_BITMAP_SET(ret, value);
7508 /* this is to handle \p and \P */
7511 vFAIL("Invalid [::] class");
7515 /* Strings such as "+utf8::isWord\n" */
7516 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::Is%s\n", yesno, what);
7519 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
7522 } /* end of namedclass \blah */
7525 if (prevvalue > (IV)value) /* b-a */ {
7526 const int w = RExC_parse - rangebegin;
7527 Simple_vFAIL4("Invalid [] range \"%*.*s\"", w, w, rangebegin);
7528 range = 0; /* not a valid range */
7532 prevvalue = value; /* save the beginning of the range */
7533 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
7534 RExC_parse[1] != ']') {
7537 /* a bad range like \w-, [:word:]- ? */
7538 if (namedclass > OOB_NAMEDCLASS) {
7539 if (ckWARN(WARN_REGEXP)) {
7541 RExC_parse >= rangebegin ?
7542 RExC_parse - rangebegin : 0;
7544 "False [] range \"%*.*s\"",
7548 ANYOF_BITMAP_SET(ret, '-');
7550 range = 1; /* yeah, it's a range! */
7551 continue; /* but do it the next time */
7555 /* now is the next time */
7556 /*stored += (value - prevvalue + 1);*/
7558 if (prevvalue < 256) {
7559 const IV ceilvalue = value < 256 ? value : 255;
7562 /* In EBCDIC [\x89-\x91] should include
7563 * the \x8e but [i-j] should not. */
7564 if (literal_endpoint == 2 &&
7565 ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
7566 (isUPPER(prevvalue) && isUPPER(ceilvalue))))
7568 if (isLOWER(prevvalue)) {
7569 for (i = prevvalue; i <= ceilvalue; i++)
7571 ANYOF_BITMAP_SET(ret, i);
7573 for (i = prevvalue; i <= ceilvalue; i++)
7575 ANYOF_BITMAP_SET(ret, i);
7580 for (i = prevvalue; i <= ceilvalue; i++) {
7581 if (!ANYOF_BITMAP_TEST(ret,i)) {
7583 ANYOF_BITMAP_SET(ret, i);
7587 if (value > 255 || UTF) {
7588 const UV prevnatvalue = NATIVE_TO_UNI(prevvalue);
7589 const UV natvalue = NATIVE_TO_UNI(value);
7590 stored+=2; /* can't optimize this class */
7591 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7592 if (prevnatvalue < natvalue) { /* what about > ? */
7593 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
7594 prevnatvalue, natvalue);
7596 else if (prevnatvalue == natvalue) {
7597 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue);
7599 U8 foldbuf[UTF8_MAXBYTES_CASE+1];
7601 const UV f = to_uni_fold(natvalue, foldbuf, &foldlen);
7603 #ifdef EBCDIC /* RD t/uni/fold ff and 6b */
7604 if (RExC_precomp[0] == ':' &&
7605 RExC_precomp[1] == '[' &&
7606 (f == 0xDF || f == 0x92)) {
7607 f = NATIVE_TO_UNI(f);
7610 /* If folding and foldable and a single
7611 * character, insert also the folded version
7612 * to the charclass. */
7614 #ifdef EBCDIC /* RD tunifold ligatures s,t fb05, fb06 */
7615 if ((RExC_precomp[0] == ':' &&
7616 RExC_precomp[1] == '[' &&
7618 (value == 0xFB05 || value == 0xFB06))) ?
7619 foldlen == ((STRLEN)UNISKIP(f) - 1) :
7620 foldlen == (STRLEN)UNISKIP(f) )
7622 if (foldlen == (STRLEN)UNISKIP(f))
7624 Perl_sv_catpvf(aTHX_ listsv,
7627 /* Any multicharacter foldings
7628 * require the following transform:
7629 * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst)
7630 * where E folds into "pq" and F folds
7631 * into "rst", all other characters
7632 * fold to single characters. We save
7633 * away these multicharacter foldings,
7634 * to be later saved as part of the
7635 * additional "s" data. */
7638 if (!unicode_alternate)
7639 unicode_alternate = newAV();
7640 sv = newSVpvn((char*)foldbuf, foldlen);
7642 av_push(unicode_alternate, sv);
7646 /* If folding and the value is one of the Greek
7647 * sigmas insert a few more sigmas to make the
7648 * folding rules of the sigmas to work right.
7649 * Note that not all the possible combinations
7650 * are handled here: some of them are handled
7651 * by the standard folding rules, and some of
7652 * them (literal or EXACTF cases) are handled
7653 * during runtime in regexec.c:S_find_byclass(). */
7654 if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) {
7655 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7656 (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA);
7657 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7658 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7660 else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA)
7661 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7662 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7667 literal_endpoint = 0;
7671 range = 0; /* this range (if it was one) is done now */
7675 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
7677 RExC_size += ANYOF_CLASS_ADD_SKIP;
7679 RExC_emit += ANYOF_CLASS_ADD_SKIP;
7685 /****** !SIZE_ONLY AFTER HERE *********/
7687 if( stored == 1 && value < 256
7688 && !( ANYOF_FLAGS(ret) & ( ANYOF_FLAGS_ALL ^ ANYOF_FOLD ) )
7690 /* optimize single char class to an EXACT node
7691 but *only* when its not a UTF/high char */
7692 const char * cur_parse= RExC_parse;
7693 RExC_emit = (regnode *)orig_emit;
7694 RExC_parse = (char *)orig_parse;
7695 ret = reg_node(pRExC_state,
7696 (U8)((ANYOF_FLAGS(ret) & ANYOF_FOLD) ? EXACTF : EXACT));
7697 RExC_parse = (char *)cur_parse;
7698 *STRING(ret)= (char)value;
7700 RExC_emit += STR_SZ(1);
7703 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
7704 if ( /* If the only flag is folding (plus possibly inversion). */
7705 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
7707 for (value = 0; value < 256; ++value) {
7708 if (ANYOF_BITMAP_TEST(ret, value)) {
7709 UV fold = PL_fold[value];
7712 ANYOF_BITMAP_SET(ret, fold);
7715 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
7718 /* optimize inverted simple patterns (e.g. [^a-z]) */
7719 if (optimize_invert &&
7720 /* If the only flag is inversion. */
7721 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
7722 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
7723 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
7724 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
7727 AV * const av = newAV();
7729 /* The 0th element stores the character class description
7730 * in its textual form: used later (regexec.c:Perl_regclass_swash())
7731 * to initialize the appropriate swash (which gets stored in
7732 * the 1st element), and also useful for dumping the regnode.
7733 * The 2nd element stores the multicharacter foldings,
7734 * used later (regexec.c:S_reginclass()). */
7735 av_store(av, 0, listsv);
7736 av_store(av, 1, NULL);
7737 av_store(av, 2, (SV*)unicode_alternate);
7738 rv = newRV_noinc((SV*)av);
7739 n = add_data(pRExC_state, 1, "s");
7740 RExC_rxi->data->data[n] = (void*)rv;
7747 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
7749 char* const retval = RExC_parse++;
7752 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
7753 RExC_parse[2] == '#') {
7754 while (*RExC_parse != ')') {
7755 if (RExC_parse == RExC_end)
7756 FAIL("Sequence (?#... not terminated");
7762 if (RExC_flags & RXf_PMf_EXTENDED) {
7763 if (isSPACE(*RExC_parse)) {
7767 else if (*RExC_parse == '#') {
7768 while (RExC_parse < RExC_end)
7769 if (*RExC_parse++ == '\n') break;
7778 - reg_node - emit a node
7780 STATIC regnode * /* Location. */
7781 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
7784 register regnode *ptr;
7785 regnode * const ret = RExC_emit;
7786 GET_RE_DEBUG_FLAGS_DECL;
7789 SIZE_ALIGN(RExC_size);
7794 if (OP(RExC_emit) == 255)
7795 Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %s: %d ",
7796 reg_name[op], OP(RExC_emit));
7798 NODE_ALIGN_FILL(ret);
7800 FILL_ADVANCE_NODE(ptr, op);
7801 if (RExC_offsets) { /* MJD */
7802 MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n",
7803 "reg_node", __LINE__,
7805 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0]
7806 ? "Overwriting end of array!\n" : "OK",
7807 (UV)(RExC_emit - RExC_emit_start),
7808 (UV)(RExC_parse - RExC_start),
7809 (UV)RExC_offsets[0]));
7810 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
7818 - reganode - emit a node with an argument
7820 STATIC regnode * /* Location. */
7821 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
7824 register regnode *ptr;
7825 regnode * const ret = RExC_emit;
7826 GET_RE_DEBUG_FLAGS_DECL;
7829 SIZE_ALIGN(RExC_size);
7834 assert(2==regarglen[op]+1);
7836 Anything larger than this has to allocate the extra amount.
7837 If we changed this to be:
7839 RExC_size += (1 + regarglen[op]);
7841 then it wouldn't matter. Its not clear what side effect
7842 might come from that so its not done so far.
7848 if (OP(RExC_emit) == 255)
7849 Perl_croak(aTHX_ "panic: reganode overwriting end of allocated program space");
7851 NODE_ALIGN_FILL(ret);
7853 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
7854 if (RExC_offsets) { /* MJD */
7855 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7859 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] ?
7860 "Overwriting end of array!\n" : "OK",
7861 (UV)(RExC_emit - RExC_emit_start),
7862 (UV)(RExC_parse - RExC_start),
7863 (UV)RExC_offsets[0]));
7864 Set_Cur_Node_Offset;
7872 - reguni - emit (if appropriate) a Unicode character
7875 S_reguni(pTHX_ const RExC_state_t *pRExC_state, UV uv, char* s)
7878 return SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
7882 - reginsert - insert an operator in front of already-emitted operand
7884 * Means relocating the operand.
7887 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd, U32 depth)
7890 register regnode *src;
7891 register regnode *dst;
7892 register regnode *place;
7893 const int offset = regarglen[(U8)op];
7894 const int size = NODE_STEP_REGNODE + offset;
7895 GET_RE_DEBUG_FLAGS_DECL;
7896 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
7897 DEBUG_PARSE_FMT("inst"," - %s",reg_name[op]);
7906 if (RExC_open_parens) {
7908 DEBUG_PARSE_FMT("inst"," - %"IVdf, (IV)RExC_npar);
7909 for ( paren=0 ; paren < RExC_npar ; paren++ ) {
7910 if ( RExC_open_parens[paren] >= opnd ) {
7911 DEBUG_PARSE_FMT("open"," - %d",size);
7912 RExC_open_parens[paren] += size;
7914 DEBUG_PARSE_FMT("open"," - %s","ok");
7916 if ( RExC_close_parens[paren] >= opnd ) {
7917 DEBUG_PARSE_FMT("close"," - %d",size);
7918 RExC_close_parens[paren] += size;
7920 DEBUG_PARSE_FMT("close"," - %s","ok");
7925 while (src > opnd) {
7926 StructCopy(--src, --dst, regnode);
7927 if (RExC_offsets) { /* MJD 20010112 */
7928 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %"UVuf" -> %"UVuf" (max %"UVuf").\n",
7932 (UV)(dst - RExC_emit_start) > RExC_offsets[0]
7933 ? "Overwriting end of array!\n" : "OK",
7934 (UV)(src - RExC_emit_start),
7935 (UV)(dst - RExC_emit_start),
7936 (UV)RExC_offsets[0]));
7937 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
7938 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
7943 place = opnd; /* Op node, where operand used to be. */
7944 if (RExC_offsets) { /* MJD */
7945 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7949 (UV)(place - RExC_emit_start) > RExC_offsets[0]
7950 ? "Overwriting end of array!\n" : "OK",
7951 (UV)(place - RExC_emit_start),
7952 (UV)(RExC_parse - RExC_start),
7953 (UV)RExC_offsets[0]));
7954 Set_Node_Offset(place, RExC_parse);
7955 Set_Node_Length(place, 1);
7957 src = NEXTOPER(place);
7958 FILL_ADVANCE_NODE(place, op);
7959 Zero(src, offset, regnode);
7963 - regtail - set the next-pointer at the end of a node chain of p to val.
7964 - SEE ALSO: regtail_study
7966 /* TODO: All three parms should be const */
7968 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
7971 register regnode *scan;
7972 GET_RE_DEBUG_FLAGS_DECL;
7974 PERL_UNUSED_ARG(depth);
7980 /* Find last node. */
7983 regnode * const temp = regnext(scan);
7985 SV * const mysv=sv_newmortal();
7986 DEBUG_PARSE_MSG((scan==p ? "tail" : ""));
7987 regprop(RExC_rx, mysv, scan);
7988 PerlIO_printf(Perl_debug_log, "~ %s (%d) %s %s\n",
7989 SvPV_nolen_const(mysv), REG_NODE_NUM(scan),
7990 (temp == NULL ? "->" : ""),
7991 (temp == NULL ? reg_name[OP(val)] : "")
7999 if (reg_off_by_arg[OP(scan)]) {
8000 ARG_SET(scan, val - scan);
8003 NEXT_OFF(scan) = val - scan;
8009 - regtail_study - set the next-pointer at the end of a node chain of p to val.
8010 - Look for optimizable sequences at the same time.
8011 - currently only looks for EXACT chains.
8013 This is expermental code. The idea is to use this routine to perform
8014 in place optimizations on branches and groups as they are constructed,
8015 with the long term intention of removing optimization from study_chunk so
8016 that it is purely analytical.
8018 Currently only used when in DEBUG mode. The macro REGTAIL_STUDY() is used
8019 to control which is which.
8022 /* TODO: All four parms should be const */
8025 S_regtail_study(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
8028 register regnode *scan;
8030 #ifdef EXPERIMENTAL_INPLACESCAN
8034 GET_RE_DEBUG_FLAGS_DECL;
8040 /* Find last node. */
8044 regnode * const temp = regnext(scan);
8045 #ifdef EXPERIMENTAL_INPLACESCAN
8046 if (PL_regkind[OP(scan)] == EXACT)
8047 if (join_exact(pRExC_state,scan,&min,1,val,depth+1))
8055 if( exact == PSEUDO )
8057 else if ( exact != OP(scan) )
8066 SV * const mysv=sv_newmortal();
8067 DEBUG_PARSE_MSG((scan==p ? "tsdy" : ""));
8068 regprop(RExC_rx, mysv, scan);
8069 PerlIO_printf(Perl_debug_log, "~ %s (%d) -> %s\n",
8070 SvPV_nolen_const(mysv),
8079 SV * const mysv_val=sv_newmortal();
8080 DEBUG_PARSE_MSG("");
8081 regprop(RExC_rx, mysv_val, val);
8082 PerlIO_printf(Perl_debug_log, "~ attach to %s (%"IVdf") offset to %"IVdf"\n",
8083 SvPV_nolen_const(mysv_val),
8084 (IV)REG_NODE_NUM(val),
8088 if (reg_off_by_arg[OP(scan)]) {
8089 ARG_SET(scan, val - scan);
8092 NEXT_OFF(scan) = val - scan;
8100 - regcurly - a little FSA that accepts {\d+,?\d*}
8103 S_regcurly(register const char *s)
8122 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
8125 Perl_regdump(pTHX_ const regexp *r)
8129 SV * const sv = sv_newmortal();
8130 SV *dsv= sv_newmortal();
8133 (void)dumpuntil(r, ri->program, ri->program + 1, NULL, NULL, sv, 0, 0);
8135 /* Header fields of interest. */
8136 if (r->anchored_substr) {
8137 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->anchored_substr),
8138 RE_SV_DUMPLEN(r->anchored_substr), 30);
8139 PerlIO_printf(Perl_debug_log,
8140 "anchored %s%s at %"IVdf" ",
8141 s, RE_SV_TAIL(r->anchored_substr),
8142 (IV)r->anchored_offset);
8143 } else if (r->anchored_utf8) {
8144 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->anchored_utf8),
8145 RE_SV_DUMPLEN(r->anchored_utf8), 30);
8146 PerlIO_printf(Perl_debug_log,
8147 "anchored utf8 %s%s at %"IVdf" ",
8148 s, RE_SV_TAIL(r->anchored_utf8),
8149 (IV)r->anchored_offset);
8151 if (r->float_substr) {
8152 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->float_substr),
8153 RE_SV_DUMPLEN(r->float_substr), 30);
8154 PerlIO_printf(Perl_debug_log,
8155 "floating %s%s at %"IVdf"..%"UVuf" ",
8156 s, RE_SV_TAIL(r->float_substr),
8157 (IV)r->float_min_offset, (UV)r->float_max_offset);
8158 } else if (r->float_utf8) {
8159 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->float_utf8),
8160 RE_SV_DUMPLEN(r->float_utf8), 30);
8161 PerlIO_printf(Perl_debug_log,
8162 "floating utf8 %s%s at %"IVdf"..%"UVuf" ",
8163 s, RE_SV_TAIL(r->float_utf8),
8164 (IV)r->float_min_offset, (UV)r->float_max_offset);
8166 if (r->check_substr || r->check_utf8)
8167 PerlIO_printf(Perl_debug_log,
8169 (r->check_substr == r->float_substr
8170 && r->check_utf8 == r->float_utf8
8171 ? "(checking floating" : "(checking anchored"));
8172 if (r->extflags & RXf_NOSCAN)
8173 PerlIO_printf(Perl_debug_log, " noscan");
8174 if (r->extflags & RXf_CHECK_ALL)
8175 PerlIO_printf(Perl_debug_log, " isall");
8176 if (r->check_substr || r->check_utf8)
8177 PerlIO_printf(Perl_debug_log, ") ");
8179 if (ri->regstclass) {
8180 regprop(r, sv, ri->regstclass);
8181 PerlIO_printf(Perl_debug_log, "stclass %s ", SvPVX_const(sv));
8183 if (r->extflags & RXf_ANCH) {
8184 PerlIO_printf(Perl_debug_log, "anchored");
8185 if (r->extflags & RXf_ANCH_BOL)
8186 PerlIO_printf(Perl_debug_log, "(BOL)");
8187 if (r->extflags & RXf_ANCH_MBOL)
8188 PerlIO_printf(Perl_debug_log, "(MBOL)");
8189 if (r->extflags & RXf_ANCH_SBOL)
8190 PerlIO_printf(Perl_debug_log, "(SBOL)");
8191 if (r->extflags & RXf_ANCH_GPOS)
8192 PerlIO_printf(Perl_debug_log, "(GPOS)");
8193 PerlIO_putc(Perl_debug_log, ' ');
8195 if (r->extflags & RXf_GPOS_SEEN)
8196 PerlIO_printf(Perl_debug_log, "GPOS:%"UVuf" ", (UV)r->gofs);
8197 if (r->intflags & PREGf_SKIP)
8198 PerlIO_printf(Perl_debug_log, "plus ");
8199 if (r->intflags & PREGf_IMPLICIT)
8200 PerlIO_printf(Perl_debug_log, "implicit ");
8201 PerlIO_printf(Perl_debug_log, "minlen %"IVdf" ", (IV)r->minlen);
8202 if (r->extflags & RXf_EVAL_SEEN)
8203 PerlIO_printf(Perl_debug_log, "with eval ");
8204 PerlIO_printf(Perl_debug_log, "\n");
8206 PERL_UNUSED_CONTEXT;
8208 #endif /* DEBUGGING */
8212 - regprop - printable representation of opcode
8215 Perl_regprop(pTHX_ const regexp *prog, SV *sv, const regnode *o)
8220 RXi_GET_DECL(prog,progi);
8221 GET_RE_DEBUG_FLAGS_DECL;
8224 sv_setpvn(sv, "", 0);
8226 if (OP(o) > REGNODE_MAX) /* regnode.type is unsigned */
8227 /* It would be nice to FAIL() here, but this may be called from
8228 regexec.c, and it would be hard to supply pRExC_state. */
8229 Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(o), (int)REGNODE_MAX);
8230 sv_catpv(sv, reg_name[OP(o)]); /* Take off const! */
8232 k = PL_regkind[OP(o)];
8235 SV * const dsv = sv_2mortal(newSVpvs(""));
8236 /* Using is_utf8_string() (via PERL_PV_UNI_DETECT)
8237 * is a crude hack but it may be the best for now since
8238 * we have no flag "this EXACTish node was UTF-8"
8240 const char * const s =
8241 pv_pretty(dsv, STRING(o), STR_LEN(o), 60,
8242 PL_colors[0], PL_colors[1],
8243 PERL_PV_ESCAPE_UNI_DETECT |
8244 PERL_PV_PRETTY_ELIPSES |
8247 Perl_sv_catpvf(aTHX_ sv, " %s", s );
8248 } else if (k == TRIE) {
8249 /* print the details of the trie in dumpuntil instead, as
8250 * progi->data isn't available here */
8251 const char op = OP(o);
8252 const I32 n = ARG(o);
8253 const reg_ac_data * const ac = IS_TRIE_AC(op) ?
8254 (reg_ac_data *)progi->data->data[n] :
8256 const reg_trie_data * const trie
8257 = (reg_trie_data*)progi->data->data[!IS_TRIE_AC(op) ? n : ac->trie];
8259 Perl_sv_catpvf(aTHX_ sv, "-%s",reg_name[o->flags]);
8260 DEBUG_TRIE_COMPILE_r(
8261 Perl_sv_catpvf(aTHX_ sv,
8262 "<S:%"UVuf"/%"IVdf" W:%"UVuf" L:%"UVuf"/%"UVuf" C:%"UVuf"/%"UVuf">",
8263 (UV)trie->startstate,
8264 (IV)trie->statecount-1, /* -1 because of the unused 0 element */
8265 (UV)trie->wordcount,
8268 (UV)TRIE_CHARCOUNT(trie),
8269 (UV)trie->uniquecharcount
8272 if ( IS_ANYOF_TRIE(op) || trie->bitmap ) {
8274 int rangestart = -1;
8275 U8* bitmap = IS_ANYOF_TRIE(op) ? (U8*)ANYOF_BITMAP(o) : (U8*)TRIE_BITMAP(trie);
8276 Perl_sv_catpvf(aTHX_ sv, "[");
8277 for (i = 0; i <= 256; i++) {
8278 if (i < 256 && BITMAP_TEST(bitmap,i)) {
8279 if (rangestart == -1)
8281 } else if (rangestart != -1) {
8282 if (i <= rangestart + 3)
8283 for (; rangestart < i; rangestart++)
8284 put_byte(sv, rangestart);
8286 put_byte(sv, rangestart);
8288 put_byte(sv, i - 1);
8293 Perl_sv_catpvf(aTHX_ sv, "]");
8296 } else if (k == CURLY) {
8297 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
8298 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
8299 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
8301 else if (k == WHILEM && o->flags) /* Ordinal/of */
8302 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
8303 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP || OP(o)==ACCEPT)
8304 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
8305 else if (k == GOSUB)
8306 Perl_sv_catpvf(aTHX_ sv, "%d[%+d]", (int)ARG(o),(int)ARG2L(o)); /* Paren and offset */
8307 else if (k == VERB) {
8309 Perl_sv_catpvf(aTHX_ sv, ":%"SVf,
8310 (SV*)progi->data->data[ ARG( o ) ]);
8311 } else if (k == LOGICAL)
8312 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
8313 else if (k == ANYOF) {
8314 int i, rangestart = -1;
8315 const U8 flags = ANYOF_FLAGS(o);
8317 /* Should be synchronized with * ANYOF_ #xdefines in regcomp.h */
8318 static const char * const anyofs[] = {
8351 if (flags & ANYOF_LOCALE)
8352 sv_catpvs(sv, "{loc}");
8353 if (flags & ANYOF_FOLD)
8354 sv_catpvs(sv, "{i}");
8355 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
8356 if (flags & ANYOF_INVERT)
8358 for (i = 0; i <= 256; i++) {
8359 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
8360 if (rangestart == -1)
8362 } else if (rangestart != -1) {
8363 if (i <= rangestart + 3)
8364 for (; rangestart < i; rangestart++)
8365 put_byte(sv, rangestart);
8367 put_byte(sv, rangestart);
8369 put_byte(sv, i - 1);
8375 if (o->flags & ANYOF_CLASS)
8376 for (i = 0; i < (int)(sizeof(anyofs)/sizeof(char*)); i++)
8377 if (ANYOF_CLASS_TEST(o,i))
8378 sv_catpv(sv, anyofs[i]);
8380 if (flags & ANYOF_UNICODE)
8381 sv_catpvs(sv, "{unicode}");
8382 else if (flags & ANYOF_UNICODE_ALL)
8383 sv_catpvs(sv, "{unicode_all}");
8387 SV * const sw = regclass_swash(prog, o, FALSE, &lv, 0);
8391 U8 s[UTF8_MAXBYTES_CASE+1];
8393 for (i = 0; i <= 256; i++) { /* just the first 256 */
8394 uvchr_to_utf8(s, i);
8396 if (i < 256 && swash_fetch(sw, s, TRUE)) {
8397 if (rangestart == -1)
8399 } else if (rangestart != -1) {
8400 if (i <= rangestart + 3)
8401 for (; rangestart < i; rangestart++) {
8402 const U8 * const e = uvchr_to_utf8(s,rangestart);
8404 for(p = s; p < e; p++)
8408 const U8 *e = uvchr_to_utf8(s,rangestart);
8410 for (p = s; p < e; p++)
8413 e = uvchr_to_utf8(s, i-1);
8414 for (p = s; p < e; p++)
8421 sv_catpvs(sv, "..."); /* et cetera */
8425 char *s = savesvpv(lv);
8426 char * const origs = s;
8428 while (*s && *s != '\n')
8432 const char * const t = ++s;
8450 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
8452 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
8453 Perl_sv_catpvf(aTHX_ sv, "[%d]", -(o->flags));
8455 PERL_UNUSED_CONTEXT;
8456 PERL_UNUSED_ARG(sv);
8458 PERL_UNUSED_ARG(prog);
8459 #endif /* DEBUGGING */
8463 Perl_re_intuit_string(pTHX_ regexp *prog)
8464 { /* Assume that RE_INTUIT is set */
8466 GET_RE_DEBUG_FLAGS_DECL;
8467 PERL_UNUSED_CONTEXT;
8471 const char * const s = SvPV_nolen_const(prog->check_substr
8472 ? prog->check_substr : prog->check_utf8);
8474 if (!PL_colorset) reginitcolors();
8475 PerlIO_printf(Perl_debug_log,
8476 "%sUsing REx %ssubstr:%s \"%s%.60s%s%s\"\n",
8478 prog->check_substr ? "" : "utf8 ",
8479 PL_colors[5],PL_colors[0],
8482 (strlen(s) > 60 ? "..." : ""));
8485 return prog->check_substr ? prog->check_substr : prog->check_utf8;
8491 handles refcounting and freeing the perl core regexp structure. When
8492 it is necessary to actually free the structure the first thing it
8493 does is call the 'free' method of the regexp_engine associated to to
8494 the regexp, allowing the handling of the void *pprivate; member
8495 first. (This routine is not overridable by extensions, which is why
8496 the extensions free is called first.)
8498 See regdupe and regdupe_internal if you change anything here.
8500 #ifndef PERL_IN_XSUB_RE
8502 Perl_pregfree(pTHX_ struct regexp *r)
8505 GET_RE_DEBUG_FLAGS_DECL;
8507 if (!r || (--r->refcnt > 0))
8510 CALLREGFREE_PVT(r); /* free the private data */
8512 /* gcov results gave these as non-null 100% of the time, so there's no
8513 optimisation in checking them before calling Safefree */
8514 Safefree(r->precomp);
8515 RX_MATCH_COPY_FREE(r);
8516 #ifdef PERL_OLD_COPY_ON_WRITE
8518 SvREFCNT_dec(r->saved_copy);
8521 if (r->anchored_substr)
8522 SvREFCNT_dec(r->anchored_substr);
8523 if (r->anchored_utf8)
8524 SvREFCNT_dec(r->anchored_utf8);
8525 if (r->float_substr)
8526 SvREFCNT_dec(r->float_substr);
8528 SvREFCNT_dec(r->float_utf8);
8529 Safefree(r->substrs);
8532 SvREFCNT_dec(r->paren_names);
8534 Safefree(r->startp);
8540 /* regfree_internal()
8542 Free the private data in a regexp. This is overloadable by
8543 extensions. Perl takes care of the regexp structure in pregfree(),
8544 this covers the *pprivate pointer which technically perldoesnt
8545 know about, however of course we have to handle the
8546 regexp_internal structure when no extension is in use.
8548 Note this is called before freeing anything in the regexp
8553 Perl_regfree_internal(pTHX_ struct regexp *r)
8557 GET_RE_DEBUG_FLAGS_DECL;
8563 SV *dsv= sv_newmortal();
8564 RE_PV_QUOTED_DECL(s, (r->extflags & RXf_UTF8),
8565 dsv, r->precomp, r->prelen, 60);
8566 PerlIO_printf(Perl_debug_log,"%sFreeing REx:%s %s\n",
8567 PL_colors[4],PL_colors[5],s);
8571 Safefree(ri->offsets); /* 20010421 MJD */
8573 int n = ri->data->count;
8574 PAD* new_comppad = NULL;
8579 /* If you add a ->what type here, update the comment in regcomp.h */
8580 switch (ri->data->what[n]) {
8584 SvREFCNT_dec((SV*)ri->data->data[n]);
8587 Safefree(ri->data->data[n]);
8590 new_comppad = (AV*)ri->data->data[n];
8593 if (new_comppad == NULL)
8594 Perl_croak(aTHX_ "panic: pregfree comppad");
8595 PAD_SAVE_LOCAL(old_comppad,
8596 /* Watch out for global destruction's random ordering. */
8597 (SvTYPE(new_comppad) == SVt_PVAV) ? new_comppad : NULL
8600 refcnt = OpREFCNT_dec((OP_4tree*)ri->data->data[n]);
8603 op_free((OP_4tree*)ri->data->data[n]);
8605 PAD_RESTORE_LOCAL(old_comppad);
8606 SvREFCNT_dec((SV*)new_comppad);
8612 { /* Aho Corasick add-on structure for a trie node.
8613 Used in stclass optimization only */
8615 reg_ac_data *aho=(reg_ac_data*)ri->data->data[n];
8617 refcount = --aho->refcount;
8620 PerlMemShared_free(aho->states);
8621 PerlMemShared_free(aho->fail);
8622 /* do this last!!!! */
8623 PerlMemShared_free(ri->data->data[n]);
8624 PerlMemShared_free(ri->regstclass);
8630 /* trie structure. */
8632 reg_trie_data *trie=(reg_trie_data*)ri->data->data[n];
8634 refcount = --trie->refcount;
8637 PerlMemShared_free(trie->charmap);
8638 PerlMemShared_free(trie->states);
8639 PerlMemShared_free(trie->trans);
8641 PerlMemShared_free(trie->bitmap);
8643 PerlMemShared_free(trie->wordlen);
8645 PerlMemShared_free(trie->jump);
8647 PerlMemShared_free(trie->nextword);
8648 /* do this last!!!! */
8649 PerlMemShared_free(ri->data->data[n]);
8654 Perl_croak(aTHX_ "panic: regfree data code '%c'", ri->data->what[n]);
8657 Safefree(ri->data->what);
8661 Safefree(ri->swap->startp);
8662 Safefree(ri->swap->endp);
8668 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8669 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8670 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8671 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
8674 regdupe - duplicate a regexp.
8676 This routine is called by sv.c's re_dup and is expected to clone a
8677 given regexp structure. It is a no-op when not under USE_ITHREADS.
8678 (Originally this *was* re_dup() for change history see sv.c)
8680 After all of the core data stored in struct regexp is duplicated
8681 the regexp_engine.dupe method is used to copy any private data
8682 stored in the *pprivate pointer. This allows extensions to handle
8683 any duplication it needs to do.
8685 See pregfree() and regfree_internal() if you change anything here.
8687 #if defined(USE_ITHREADS)
8688 #ifndef PERL_IN_XSUB_RE
8690 Perl_re_dup(pTHX_ const regexp *r, CLONE_PARAMS *param)
8695 struct reg_substr_datum *s;
8698 return (REGEXP *)NULL;
8700 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8704 npar = r->nparens+1;
8705 Newxz(ret, 1, regexp);
8706 Newx(ret->startp, npar, I32);
8707 Copy(r->startp, ret->startp, npar, I32);
8708 Newx(ret->endp, npar, I32);
8709 Copy(r->endp, ret->endp, npar, I32);
8711 Newx(ret->substrs, 1, struct reg_substr_data);
8712 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8713 s->min_offset = r->substrs->data[i].min_offset;
8714 s->max_offset = r->substrs->data[i].max_offset;
8715 s->end_shift = r->substrs->data[i].end_shift;
8716 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8717 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8721 ret->precomp = SAVEPVN(r->precomp, r->prelen);
8722 ret->refcnt = r->refcnt;
8723 ret->minlen = r->minlen;
8724 ret->minlenret = r->minlenret;
8725 ret->prelen = r->prelen;
8726 ret->nparens = r->nparens;
8727 ret->lastparen = r->lastparen;
8728 ret->lastcloseparen = r->lastcloseparen;
8729 ret->intflags = r->intflags;
8730 ret->extflags = r->extflags;
8732 ret->sublen = r->sublen;
8734 ret->engine = r->engine;
8736 ret->paren_names = hv_dup_inc(r->paren_names, param);
8738 if (RX_MATCH_COPIED(ret))
8739 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
8742 #ifdef PERL_OLD_COPY_ON_WRITE
8743 ret->saved_copy = NULL;
8746 ret->pprivate = r->pprivate;
8747 RXi_SET(ret,CALLREGDUPE_PVT(ret,param));
8749 ptr_table_store(PL_ptr_table, r, ret);
8752 #endif /* PERL_IN_XSUB_RE */
8757 This is the internal complement to regdupe() which is used to copy
8758 the structure pointed to by the *pprivate pointer in the regexp.
8759 This is the core version of the extension overridable cloning hook.
8760 The regexp structure being duplicated will be copied by perl prior
8761 to this and will be provided as the regexp *r argument, however
8762 with the /old/ structures pprivate pointer value. Thus this routine
8763 may override any copying normally done by perl.
8765 It returns a pointer to the new regexp_internal structure.
8769 Perl_regdupe_internal(pTHX_ const regexp *r, CLONE_PARAMS *param)
8772 regexp_internal *reti;
8776 npar = r->nparens+1;
8777 len = ri->offsets[0];
8779 Newxc(reti, sizeof(regexp_internal) + (len+1)*sizeof(regnode), char, regexp_internal);
8780 Copy(ri->program, reti->program, len+1, regnode);
8783 Newx(reti->swap, 1, regexp_paren_ofs);
8784 /* no need to copy these */
8785 Newx(reti->swap->startp, npar, I32);
8786 Newx(reti->swap->endp, npar, I32);
8792 reti->regstclass = NULL;
8795 const int count = ri->data->count;
8798 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
8799 char, struct reg_data);
8800 Newx(d->what, count, U8);
8803 for (i = 0; i < count; i++) {
8804 d->what[i] = ri->data->what[i];
8805 switch (d->what[i]) {
8806 /* legal options are one of: sSfpontTu
8807 see also regcomp.h and pregfree() */
8810 case 'p': /* actually an AV, but the dup function is identical. */
8811 case 'u': /* actually an HV, but the dup function is identical. */
8812 d->data[i] = sv_dup_inc((SV *)ri->data->data[i], param);
8815 /* This is cheating. */
8816 Newx(d->data[i], 1, struct regnode_charclass_class);
8817 StructCopy(ri->data->data[i], d->data[i],
8818 struct regnode_charclass_class);
8819 reti->regstclass = (regnode*)d->data[i];
8822 /* Compiled op trees are readonly and in shared memory,
8823 and can thus be shared without duplication. */
8825 d->data[i] = (void*)OpREFCNT_inc((OP*)ri->data->data[i]);
8829 /* Trie stclasses are readonly and can thus be shared
8830 * without duplication. We free the stclass in pregfree
8831 * when the corresponding reg_ac_data struct is freed.
8833 reti->regstclass= ri->regstclass;
8837 ((reg_trie_data*)ri->data->data[i])->refcount++;
8841 d->data[i] = ri->data->data[i];
8844 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", ri->data->what[i]);
8853 Newx(reti->offsets, 2*len+1, U32);
8854 Copy(ri->offsets, reti->offsets, 2*len+1, U32);
8859 #endif /* USE_ITHREADS */
8864 converts a regexp embedded in a MAGIC struct to its stringified form,
8865 caching the converted form in the struct and returns the cached
8868 If lp is nonnull then it is used to return the length of the
8871 If flags is nonnull and the returned string contains UTF8 then
8872 (*flags & 1) will be true.
8874 If haseval is nonnull then it is used to return whether the pattern
8877 Normally called via macro:
8879 CALLREG_STRINGIFY(mg,&len,&utf8);
8883 CALLREG_AS_STR(mg,&lp,&flags,&haseval)
8885 See sv_2pv_flags() in sv.c for an example of internal usage.
8888 #ifndef PERL_IN_XSUB_RE
8890 Perl_reg_stringify(pTHX_ MAGIC *mg, STRLEN *lp, U32 *flags, I32 *haseval ) {
8892 const regexp * const re = (regexp *)mg->mg_obj;
8895 const char *fptr = "msix";
8900 bool need_newline = 0;
8901 U16 reganch = (U16)((re->extflags & RXf_PMf_COMPILETIME) >> 12);
8903 while((ch = *fptr++)) {
8905 reflags[left++] = ch;
8908 reflags[right--] = ch;
8913 reflags[left] = '-';
8917 mg->mg_len = re->prelen + 4 + left;
8919 * If /x was used, we have to worry about a regex ending with a
8920 * comment later being embedded within another regex. If so, we don't
8921 * want this regex's "commentization" to leak out to the right part of
8922 * the enclosing regex, we must cap it with a newline.
8924 * So, if /x was used, we scan backwards from the end of the regex. If
8925 * we find a '#' before we find a newline, we need to add a newline
8926 * ourself. If we find a '\n' first (or if we don't find '#' or '\n'),
8927 * we don't need to add anything. -jfriedl
8929 if (PMf_EXTENDED & re->extflags) {
8930 const char *endptr = re->precomp + re->prelen;
8931 while (endptr >= re->precomp) {
8932 const char c = *(endptr--);
8934 break; /* don't need another */
8936 /* we end while in a comment, so we need a newline */
8937 mg->mg_len++; /* save space for it */
8938 need_newline = 1; /* note to add it */
8944 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
8945 mg->mg_ptr[0] = '(';
8946 mg->mg_ptr[1] = '?';
8947 Copy(reflags, mg->mg_ptr+2, left, char);
8948 *(mg->mg_ptr+left+2) = ':';
8949 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
8951 mg->mg_ptr[mg->mg_len - 2] = '\n';
8952 mg->mg_ptr[mg->mg_len - 1] = ')';
8953 mg->mg_ptr[mg->mg_len] = 0;
8956 *haseval = re->seen_evals;
8958 *flags = ((re->extflags & RXf_UTF8) ? 1 : 0);
8966 - regnext - dig the "next" pointer out of a node
8969 Perl_regnext(pTHX_ register regnode *p)
8972 register I32 offset;
8977 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
8986 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
8989 STRLEN l1 = strlen(pat1);
8990 STRLEN l2 = strlen(pat2);
8993 const char *message;
8999 Copy(pat1, buf, l1 , char);
9000 Copy(pat2, buf + l1, l2 , char);
9001 buf[l1 + l2] = '\n';
9002 buf[l1 + l2 + 1] = '\0';
9004 /* ANSI variant takes additional second argument */
9005 va_start(args, pat2);
9009 msv = vmess(buf, &args);
9011 message = SvPV_const(msv,l1);
9014 Copy(message, buf, l1 , char);
9015 buf[l1-1] = '\0'; /* Overwrite \n */
9016 Perl_croak(aTHX_ "%s", buf);
9019 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
9021 #ifndef PERL_IN_XSUB_RE
9023 Perl_save_re_context(pTHX)
9027 struct re_save_state *state;
9029 SAVEVPTR(PL_curcop);
9030 SSGROW(SAVESTACK_ALLOC_FOR_RE_SAVE_STATE + 1);
9032 state = (struct re_save_state *)(PL_savestack + PL_savestack_ix);
9033 PL_savestack_ix += SAVESTACK_ALLOC_FOR_RE_SAVE_STATE;
9034 SSPUSHINT(SAVEt_RE_STATE);
9036 Copy(&PL_reg_state, state, 1, struct re_save_state);
9038 PL_reg_start_tmp = 0;
9039 PL_reg_start_tmpl = 0;
9040 PL_reg_oldsaved = NULL;
9041 PL_reg_oldsavedlen = 0;
9043 PL_reg_leftiter = 0;
9044 PL_reg_poscache = NULL;
9045 PL_reg_poscache_size = 0;
9046 #ifdef PERL_OLD_COPY_ON_WRITE
9050 /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */
9052 const REGEXP * const rx = PM_GETRE(PL_curpm);
9055 for (i = 1; i <= rx->nparens; i++) {
9056 char digits[TYPE_CHARS(long)];
9057 const STRLEN len = my_snprintf(digits, sizeof(digits), "%lu", (long)i);
9058 GV *const *const gvp
9059 = (GV**)hv_fetch(PL_defstash, digits, len, 0);
9062 GV * const gv = *gvp;
9063 if (SvTYPE(gv) == SVt_PVGV && GvSV(gv))
9073 clear_re(pTHX_ void *r)
9076 ReREFCNT_dec((regexp *)r);
9082 S_put_byte(pTHX_ SV *sv, int c)
9084 if (isCNTRL(c) || c == 255 || !isPRINT(c))
9085 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
9086 else if (c == '-' || c == ']' || c == '\\' || c == '^')
9087 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
9089 Perl_sv_catpvf(aTHX_ sv, "%c", c);
9093 #define CLEAR_OPTSTART \
9094 if (optstart) STMT_START { \
9095 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log, " (%"IVdf" nodes)\n", (IV)(node - optstart))); \
9099 #define DUMPUNTIL(b,e) CLEAR_OPTSTART; node=dumpuntil(r,start,(b),(e),last,sv,indent+1,depth+1);
9101 STATIC const regnode *
9102 S_dumpuntil(pTHX_ const regexp *r, const regnode *start, const regnode *node,
9103 const regnode *last, const regnode *plast,
9104 SV* sv, I32 indent, U32 depth)
9107 register U8 op = PSEUDO; /* Arbitrary non-END op. */
9108 register const regnode *next;
9109 const regnode *optstart= NULL;
9111 GET_RE_DEBUG_FLAGS_DECL;
9113 #ifdef DEBUG_DUMPUNTIL
9114 PerlIO_printf(Perl_debug_log, "--- %d : %d - %d - %d\n",indent,node-start,
9115 last ? last-start : 0,plast ? plast-start : 0);
9118 if (plast && plast < last)
9121 while (PL_regkind[op] != END && (!last || node < last)) {
9122 /* While that wasn't END last time... */
9126 if (op == CLOSE || op == WHILEM)
9128 next = regnext((regnode *)node);
9131 if (OP(node) == OPTIMIZED) {
9132 if (!optstart && RE_DEBUG_FLAG(RE_DEBUG_COMPILE_OPTIMISE))
9139 regprop(r, sv, node);
9140 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
9141 (int)(2*indent + 1), "", SvPVX_const(sv));
9143 if (OP(node) != OPTIMIZED) {
9144 if (next == NULL) /* Next ptr. */
9145 PerlIO_printf(Perl_debug_log, "(0)");
9146 else if (PL_regkind[(U8)op] == BRANCH && PL_regkind[OP(next)] != BRANCH )
9147 PerlIO_printf(Perl_debug_log, "(FAIL)");
9149 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
9151 /*if (PL_regkind[(U8)op] != TRIE)*/
9152 (void)PerlIO_putc(Perl_debug_log, '\n');
9156 if (PL_regkind[(U8)op] == BRANCHJ) {
9159 register const regnode *nnode = (OP(next) == LONGJMP
9160 ? regnext((regnode *)next)
9162 if (last && nnode > last)
9164 DUMPUNTIL(NEXTOPER(NEXTOPER(node)), nnode);
9167 else if (PL_regkind[(U8)op] == BRANCH) {
9169 DUMPUNTIL(NEXTOPER(node), next);
9171 else if ( PL_regkind[(U8)op] == TRIE ) {
9172 const regnode *this_trie = node;
9173 const char op = OP(node);
9174 const I32 n = ARG(node);
9175 const reg_ac_data * const ac = op>=AHOCORASICK ?
9176 (reg_ac_data *)ri->data->data[n] :
9178 const reg_trie_data * const trie =
9179 (reg_trie_data*)ri->data->data[op<AHOCORASICK ? n : ac->trie];
9181 AV *const trie_words = (AV *) ri->data->data[n + TRIE_WORDS_OFFSET];
9183 const regnode *nextbranch= NULL;
9185 sv_setpvn(sv, "", 0);
9186 for (word_idx= 0; word_idx < (I32)trie->wordcount; word_idx++) {
9187 SV ** const elem_ptr = av_fetch(trie_words,word_idx,0);
9189 PerlIO_printf(Perl_debug_log, "%*s%s ",
9190 (int)(2*(indent+3)), "",
9191 elem_ptr ? pv_pretty(sv, SvPV_nolen_const(*elem_ptr), SvCUR(*elem_ptr), 60,
9192 PL_colors[0], PL_colors[1],
9193 (SvUTF8(*elem_ptr) ? PERL_PV_ESCAPE_UNI : 0) |
9194 PERL_PV_PRETTY_ELIPSES |
9200 U16 dist= trie->jump[word_idx+1];
9201 PerlIO_printf(Perl_debug_log, "(%"UVuf")\n",
9202 (UV)((dist ? this_trie + dist : next) - start));
9205 nextbranch= this_trie + trie->jump[0];
9206 DUMPUNTIL(this_trie + dist, nextbranch);
9208 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
9209 nextbranch= regnext((regnode *)nextbranch);
9211 PerlIO_printf(Perl_debug_log, "\n");
9214 if (last && next > last)
9219 else if ( op == CURLY ) { /* "next" might be very big: optimizer */
9220 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS,
9221 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1);
9223 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
9225 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, next);
9227 else if ( op == PLUS || op == STAR) {
9228 DUMPUNTIL(NEXTOPER(node), NEXTOPER(node) + 1);
9230 else if (op == ANYOF) {
9231 /* arglen 1 + class block */
9232 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
9233 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
9234 node = NEXTOPER(node);
9236 else if (PL_regkind[(U8)op] == EXACT) {
9237 /* Literal string, where present. */
9238 node += NODE_SZ_STR(node) - 1;
9239 node = NEXTOPER(node);
9242 node = NEXTOPER(node);
9243 node += regarglen[(U8)op];
9245 if (op == CURLYX || op == OPEN)
9249 #ifdef DEBUG_DUMPUNTIL
9250 PerlIO_printf(Perl_debug_log, "--- %d\n", (int)indent);
9255 #endif /* DEBUGGING */
9259 * c-indentation-style: bsd
9261 * indent-tabs-mode: t
9264 * ex: set ts=8 sts=4 sw=4 noet:
projects / p5sagit/p5-mst-13.2.git / blob