5 * 'A fair jaw-cracker dwarf-language must be.' --Samwise Gamgee
7 * [p.285 of _The Lord of the Rings_, II/iii: "The Ring Goes South"]
10 /* This file contains functions for compiling a regular expression. See
11 * also regexec.c which funnily enough, contains functions for executing
12 * a regular expression.
14 * This file is also copied at build time to ext/re/re_comp.c, where
15 * it's built with -DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT.
16 * This causes the main functions to be compiled under new names and with
17 * debugging support added, which makes "use re 'debug'" work.
20 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
21 * confused with the original package (see point 3 below). Thanks, Henry!
24 /* Additional note: this code is very heavily munged from Henry's version
25 * in places. In some spots I've traded clarity for efficiency, so don't
26 * blame Henry for some of the lack of readability.
29 /* The names of the functions have been changed from regcomp and
30 * regexec to pregcomp and pregexec in order to avoid conflicts
31 * with the POSIX routines of the same names.
34 #ifdef PERL_EXT_RE_BUILD
39 * pregcomp and pregexec -- regsub and regerror are not used in perl
41 * Copyright (c) 1986 by University of Toronto.
42 * Written by Henry Spencer. Not derived from licensed software.
44 * Permission is granted to anyone to use this software for any
45 * purpose on any computer system, and to redistribute it freely,
46 * subject to the following restrictions:
48 * 1. The author is not responsible for the consequences of use of
49 * this software, no matter how awful, even if they arise
52 * 2. The origin of this software must not be misrepresented, either
53 * by explicit claim or by omission.
55 * 3. Altered versions must be plainly marked as such, and must not
56 * be misrepresented as being the original software.
59 **** Alterations to Henry's code are...
61 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
62 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
63 **** by Larry Wall and others
65 **** You may distribute under the terms of either the GNU General Public
66 **** License or the Artistic License, as specified in the README file.
69 * Beware that some of this code is subtly aware of the way operator
70 * precedence is structured in regular expressions. Serious changes in
71 * regular-expression syntax might require a total rethink.
74 #define PERL_IN_REGCOMP_C
77 #ifndef PERL_IN_XSUB_RE
82 #ifdef PERL_IN_XSUB_RE
84 EXTERN_C const struct regexp_engine my_reg_engine;
89 #include "dquote_inline.h"
90 #include "invlist_inline.h"
91 #include "unicode_constants.h"
93 #define HAS_NONLATIN1_FOLD_CLOSURE(i) \
94 _HAS_NONLATIN1_FOLD_CLOSURE_ONLY_FOR_USE_BY_REGCOMP_DOT_C_AND_REGEXEC_DOT_C(i)
95 #define HAS_NONLATIN1_SIMPLE_FOLD_CLOSURE(i) \
96 _HAS_NONLATIN1_SIMPLE_FOLD_CLOSURE_ONLY_FOR_USE_BY_REGCOMP_DOT_C_AND_REGEXEC_DOT_C(i)
97 #define IS_NON_FINAL_FOLD(c) _IS_NON_FINAL_FOLD_ONLY_FOR_USE_BY_REGCOMP_DOT_C(c)
98 #define IS_IN_SOME_FOLD_L1(c) _IS_IN_SOME_FOLD_ONLY_FOR_USE_BY_REGCOMP_DOT_C(c)
101 #define STATIC static
105 #define MIN(a,b) ((a) < (b) ? (a) : (b))
108 /* this is a chain of data about sub patterns we are processing that
109 need to be handled separately/specially in study_chunk. Its so
110 we can simulate recursion without losing state. */
112 typedef struct scan_frame {
113 regnode *last_regnode; /* last node to process in this frame */
114 regnode *next_regnode; /* next node to process when last is reached */
115 U32 prev_recursed_depth;
116 I32 stopparen; /* what stopparen do we use */
117 U32 is_top_frame; /* what flags do we use? */
119 struct scan_frame *this_prev_frame; /* this previous frame */
120 struct scan_frame *prev_frame; /* previous frame */
121 struct scan_frame *next_frame; /* next frame */
124 /* Certain characters are output as a sequence with the first being a
126 #define isBACKSLASHED_PUNCT(c) \
127 ((c) == '-' || (c) == ']' || (c) == '\\' || (c) == '^')
130 struct RExC_state_t {
131 U32 flags; /* RXf_* are we folding, multilining? */
132 U32 pm_flags; /* PMf_* stuff from the calling PMOP */
133 char *precomp; /* uncompiled string. */
134 REGEXP *rx_sv; /* The SV that is the regexp. */
135 regexp *rx; /* perl core regexp structure */
136 regexp_internal *rxi; /* internal data for regexp object
138 char *start; /* Start of input for compile */
139 char *end; /* End of input for compile */
140 char *parse; /* Input-scan pointer. */
141 SSize_t whilem_seen; /* number of WHILEM in this expr */
142 regnode *emit_start; /* Start of emitted-code area */
143 regnode *emit_bound; /* First regnode outside of the
145 regnode *emit; /* Code-emit pointer; if = &emit_dummy,
146 implies compiling, so don't emit */
147 regnode_ssc emit_dummy; /* placeholder for emit to point to;
148 large enough for the largest
149 non-EXACTish node, so can use it as
151 I32 naughty; /* How bad is this pattern? */
152 I32 sawback; /* Did we see \1, ...? */
154 SSize_t size; /* Code size. */
155 I32 npar; /* Capture buffer count, (OPEN) plus
156 one. ("par" 0 is the whole
158 I32 nestroot; /* root parens we are in - used by
162 regnode **open_parens; /* pointers to open parens */
163 regnode **close_parens; /* pointers to close parens */
164 regnode *opend; /* END node in program */
165 I32 utf8; /* whether the pattern is utf8 or not */
166 I32 orig_utf8; /* whether the pattern was originally in utf8 */
167 /* XXX use this for future optimisation of case
168 * where pattern must be upgraded to utf8. */
169 I32 uni_semantics; /* If a d charset modifier should use unicode
170 rules, even if the pattern is not in
172 HV *paren_names; /* Paren names */
174 regnode **recurse; /* Recurse regops */
175 I32 recurse_count; /* Number of recurse regops */
176 U8 *study_chunk_recursed; /* bitmap of which subs we have moved
178 U32 study_chunk_recursed_bytes; /* bytes in bitmap */
182 I32 override_recoding;
184 I32 recode_x_to_native;
186 I32 in_multi_char_class;
187 struct reg_code_block *code_blocks; /* positions of literal (?{})
189 int num_code_blocks; /* size of code_blocks[] */
190 int code_index; /* next code_blocks[] slot */
191 SSize_t maxlen; /* mininum possible number of chars in string to match */
192 scan_frame *frame_head;
193 scan_frame *frame_last;
196 #ifdef ADD_TO_REGEXEC
197 char *starttry; /* -Dr: where regtry was called. */
198 #define RExC_starttry (pRExC_state->starttry)
200 SV *runtime_code_qr; /* qr with the runtime code blocks */
202 const char *lastparse;
204 AV *paren_name_list; /* idx -> name */
205 U32 study_chunk_recursed_count;
208 #define RExC_lastparse (pRExC_state->lastparse)
209 #define RExC_lastnum (pRExC_state->lastnum)
210 #define RExC_paren_name_list (pRExC_state->paren_name_list)
211 #define RExC_study_chunk_recursed_count (pRExC_state->study_chunk_recursed_count)
212 #define RExC_mysv (pRExC_state->mysv1)
213 #define RExC_mysv1 (pRExC_state->mysv1)
214 #define RExC_mysv2 (pRExC_state->mysv2)
217 bool seen_unfolded_sharp_s;
220 #define RExC_flags (pRExC_state->flags)
221 #define RExC_pm_flags (pRExC_state->pm_flags)
222 #define RExC_precomp (pRExC_state->precomp)
223 #define RExC_rx_sv (pRExC_state->rx_sv)
224 #define RExC_rx (pRExC_state->rx)
225 #define RExC_rxi (pRExC_state->rxi)
226 #define RExC_start (pRExC_state->start)
227 #define RExC_end (pRExC_state->end)
228 #define RExC_parse (pRExC_state->parse)
229 #define RExC_whilem_seen (pRExC_state->whilem_seen)
231 /* Set during the sizing pass when there is a LATIN SMALL LETTER SHARP S in any
232 * EXACTF node, hence was parsed under /di rules. If later in the parse,
233 * something forces the pattern into using /ui rules, the sharp s should be
234 * folded into the sequence 'ss', which takes up more space than previously
235 * calculated. This means that the sizing pass needs to be restarted. (The
236 * node also becomes an EXACTFU_SS.) For all other characters, an EXACTF node
237 * that gets converted to /ui (and EXACTFU) occupies the same amount of space,
238 * so there is no need to resize [perl #125990]. */
239 #define RExC_seen_unfolded_sharp_s (pRExC_state->seen_unfolded_sharp_s)
241 #ifdef RE_TRACK_PATTERN_OFFSETS
242 #define RExC_offsets (pRExC_state->rxi->u.offsets) /* I am not like the
245 #define RExC_emit (pRExC_state->emit)
246 #define RExC_emit_dummy (pRExC_state->emit_dummy)
247 #define RExC_emit_start (pRExC_state->emit_start)
248 #define RExC_emit_bound (pRExC_state->emit_bound)
249 #define RExC_sawback (pRExC_state->sawback)
250 #define RExC_seen (pRExC_state->seen)
251 #define RExC_size (pRExC_state->size)
252 #define RExC_maxlen (pRExC_state->maxlen)
253 #define RExC_npar (pRExC_state->npar)
254 #define RExC_nestroot (pRExC_state->nestroot)
255 #define RExC_extralen (pRExC_state->extralen)
256 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
257 #define RExC_utf8 (pRExC_state->utf8)
258 #define RExC_uni_semantics (pRExC_state->uni_semantics)
259 #define RExC_orig_utf8 (pRExC_state->orig_utf8)
260 #define RExC_open_parens (pRExC_state->open_parens)
261 #define RExC_close_parens (pRExC_state->close_parens)
262 #define RExC_opend (pRExC_state->opend)
263 #define RExC_paren_names (pRExC_state->paren_names)
264 #define RExC_recurse (pRExC_state->recurse)
265 #define RExC_recurse_count (pRExC_state->recurse_count)
266 #define RExC_study_chunk_recursed (pRExC_state->study_chunk_recursed)
267 #define RExC_study_chunk_recursed_bytes \
268 (pRExC_state->study_chunk_recursed_bytes)
269 #define RExC_in_lookbehind (pRExC_state->in_lookbehind)
270 #define RExC_contains_locale (pRExC_state->contains_locale)
271 #define RExC_contains_i (pRExC_state->contains_i)
272 #define RExC_override_recoding (pRExC_state->override_recoding)
274 # define RExC_recode_x_to_native (pRExC_state->recode_x_to_native)
276 #define RExC_in_multi_char_class (pRExC_state->in_multi_char_class)
277 #define RExC_frame_head (pRExC_state->frame_head)
278 #define RExC_frame_last (pRExC_state->frame_last)
279 #define RExC_frame_count (pRExC_state->frame_count)
280 #define RExC_strict (pRExC_state->strict)
282 /* Heuristic check on the complexity of the pattern: if TOO_NAUGHTY, we set
283 * a flag to disable back-off on the fixed/floating substrings - if it's
284 * a high complexity pattern we assume the benefit of avoiding a full match
285 * is worth the cost of checking for the substrings even if they rarely help.
287 #define RExC_naughty (pRExC_state->naughty)
288 #define TOO_NAUGHTY (10)
289 #define MARK_NAUGHTY(add) \
290 if (RExC_naughty < TOO_NAUGHTY) \
291 RExC_naughty += (add)
292 #define MARK_NAUGHTY_EXP(exp, add) \
293 if (RExC_naughty < TOO_NAUGHTY) \
294 RExC_naughty += RExC_naughty / (exp) + (add)
296 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
297 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
298 ((*s) == '{' && regcurly(s)))
301 * Flags to be passed up and down.
303 #define WORST 0 /* Worst case. */
304 #define HASWIDTH 0x01 /* Known to match non-null strings. */
306 /* Simple enough to be STAR/PLUS operand; in an EXACTish node must be a single
307 * character. (There needs to be a case: in the switch statement in regexec.c
308 * for any node marked SIMPLE.) Note that this is not the same thing as
311 #define SPSTART 0x04 /* Starts with * or + */
312 #define POSTPONED 0x08 /* (?1),(?&name), (??{...}) or similar */
313 #define TRYAGAIN 0x10 /* Weeded out a declaration. */
314 #define RESTART_PASS1 0x20 /* Need to restart sizing pass */
315 #define NEED_UTF8 0x40 /* In conjunction with RESTART_PASS1, need to
316 calcuate sizes as UTF-8 */
318 #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
320 /* whether trie related optimizations are enabled */
321 #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
322 #define TRIE_STUDY_OPT
323 #define FULL_TRIE_STUDY
329 #define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3]
330 #define PBITVAL(paren) (1 << ((paren) & 7))
331 #define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren))
332 #define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren)
333 #define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren))
335 #define REQUIRE_UTF8(flagp) STMT_START { \
338 *flagp = RESTART_PASS1|NEED_UTF8; \
343 /* Change from /d into /u rules, and restart the parse if we've already seen
344 * something whose size would increase as a result, by setting *flagp and
345 * returning 'restart_retval'. RExC_uni_semantics is a flag that indicates
346 * we've change to /u during the parse. */
347 #define REQUIRE_UNI_RULES(flagp, restart_retval) \
349 if (DEPENDS_SEMANTICS) { \
351 set_regex_charset(&RExC_flags, REGEX_UNICODE_CHARSET); \
352 RExC_uni_semantics = 1; \
353 if (RExC_seen_unfolded_sharp_s) { \
354 *flagp |= RESTART_PASS1; \
355 return restart_retval; \
360 /* This converts the named class defined in regcomp.h to its equivalent class
361 * number defined in handy.h. */
362 #define namedclass_to_classnum(class) ((int) ((class) / 2))
363 #define classnum_to_namedclass(classnum) ((classnum) * 2)
365 #define _invlist_union_complement_2nd(a, b, output) \
366 _invlist_union_maybe_complement_2nd(a, b, TRUE, output)
367 #define _invlist_intersection_complement_2nd(a, b, output) \
368 _invlist_intersection_maybe_complement_2nd(a, b, TRUE, output)
370 /* About scan_data_t.
372 During optimisation we recurse through the regexp program performing
373 various inplace (keyhole style) optimisations. In addition study_chunk
374 and scan_commit populate this data structure with information about
375 what strings MUST appear in the pattern. We look for the longest
376 string that must appear at a fixed location, and we look for the
377 longest string that may appear at a floating location. So for instance
382 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
383 strings (because they follow a .* construct). study_chunk will identify
384 both FOO and BAR as being the longest fixed and floating strings respectively.
386 The strings can be composites, for instance
390 will result in a composite fixed substring 'foo'.
392 For each string some basic information is maintained:
394 - offset or min_offset
395 This is the position the string must appear at, or not before.
396 It also implicitly (when combined with minlenp) tells us how many
397 characters must match before the string we are searching for.
398 Likewise when combined with minlenp and the length of the string it
399 tells us how many characters must appear after the string we have
403 Only used for floating strings. This is the rightmost point that
404 the string can appear at. If set to SSize_t_MAX it indicates that the
405 string can occur infinitely far to the right.
408 A pointer to the minimum number of characters of the pattern that the
409 string was found inside. This is important as in the case of positive
410 lookahead or positive lookbehind we can have multiple patterns
415 The minimum length of the pattern overall is 3, the minimum length
416 of the lookahead part is 3, but the minimum length of the part that
417 will actually match is 1. So 'FOO's minimum length is 3, but the
418 minimum length for the F is 1. This is important as the minimum length
419 is used to determine offsets in front of and behind the string being
420 looked for. Since strings can be composites this is the length of the
421 pattern at the time it was committed with a scan_commit. Note that
422 the length is calculated by study_chunk, so that the minimum lengths
423 are not known until the full pattern has been compiled, thus the
424 pointer to the value.
428 In the case of lookbehind the string being searched for can be
429 offset past the start point of the final matching string.
430 If this value was just blithely removed from the min_offset it would
431 invalidate some of the calculations for how many chars must match
432 before or after (as they are derived from min_offset and minlen and
433 the length of the string being searched for).
434 When the final pattern is compiled and the data is moved from the
435 scan_data_t structure into the regexp structure the information
436 about lookbehind is factored in, with the information that would
437 have been lost precalculated in the end_shift field for the
440 The fields pos_min and pos_delta are used to store the minimum offset
441 and the delta to the maximum offset at the current point in the pattern.
445 typedef struct scan_data_t {
446 /*I32 len_min; unused */
447 /*I32 len_delta; unused */
451 SSize_t last_end; /* min value, <0 unless valid. */
452 SSize_t last_start_min;
453 SSize_t last_start_max;
454 SV **longest; /* Either &l_fixed, or &l_float. */
455 SV *longest_fixed; /* longest fixed string found in pattern */
456 SSize_t offset_fixed; /* offset where it starts */
457 SSize_t *minlen_fixed; /* pointer to the minlen relevant to the string */
458 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
459 SV *longest_float; /* longest floating string found in pattern */
460 SSize_t offset_float_min; /* earliest point in string it can appear */
461 SSize_t offset_float_max; /* latest point in string it can appear */
462 SSize_t *minlen_float; /* pointer to the minlen relevant to the string */
463 SSize_t lookbehind_float; /* is the pos of the string modified by LB */
466 SSize_t *last_closep;
467 regnode_ssc *start_class;
471 * Forward declarations for pregcomp()'s friends.
474 static const scan_data_t zero_scan_data =
475 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
477 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
478 #define SF_BEFORE_SEOL 0x0001
479 #define SF_BEFORE_MEOL 0x0002
480 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
481 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
483 #define SF_FIX_SHIFT_EOL (+2)
484 #define SF_FL_SHIFT_EOL (+4)
486 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
487 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
489 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
490 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
491 #define SF_IS_INF 0x0040
492 #define SF_HAS_PAR 0x0080
493 #define SF_IN_PAR 0x0100
494 #define SF_HAS_EVAL 0x0200
495 #define SCF_DO_SUBSTR 0x0400
496 #define SCF_DO_STCLASS_AND 0x0800
497 #define SCF_DO_STCLASS_OR 0x1000
498 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
499 #define SCF_WHILEM_VISITED_POS 0x2000
501 #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
502 #define SCF_SEEN_ACCEPT 0x8000
503 #define SCF_TRIE_DOING_RESTUDY 0x10000
504 #define SCF_IN_DEFINE 0x20000
509 #define UTF cBOOL(RExC_utf8)
511 /* The enums for all these are ordered so things work out correctly */
512 #define LOC (get_regex_charset(RExC_flags) == REGEX_LOCALE_CHARSET)
513 #define DEPENDS_SEMANTICS (get_regex_charset(RExC_flags) \
514 == REGEX_DEPENDS_CHARSET)
515 #define UNI_SEMANTICS (get_regex_charset(RExC_flags) == REGEX_UNICODE_CHARSET)
516 #define AT_LEAST_UNI_SEMANTICS (get_regex_charset(RExC_flags) \
517 >= REGEX_UNICODE_CHARSET)
518 #define ASCII_RESTRICTED (get_regex_charset(RExC_flags) \
519 == REGEX_ASCII_RESTRICTED_CHARSET)
520 #define AT_LEAST_ASCII_RESTRICTED (get_regex_charset(RExC_flags) \
521 >= REGEX_ASCII_RESTRICTED_CHARSET)
522 #define ASCII_FOLD_RESTRICTED (get_regex_charset(RExC_flags) \
523 == REGEX_ASCII_MORE_RESTRICTED_CHARSET)
525 #define FOLD cBOOL(RExC_flags & RXf_PMf_FOLD)
527 /* For programs that want to be strictly Unicode compatible by dying if any
528 * attempt is made to match a non-Unicode code point against a Unicode
530 #define ALWAYS_WARN_SUPER ckDEAD(packWARN(WARN_NON_UNICODE))
532 #define OOB_NAMEDCLASS -1
534 /* There is no code point that is out-of-bounds, so this is problematic. But
535 * its only current use is to initialize a variable that is always set before
537 #define OOB_UNICODE 0xDEADBEEF
539 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
540 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
543 /* length of regex to show in messages that don't mark a position within */
544 #define RegexLengthToShowInErrorMessages 127
547 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
548 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
549 * op/pragma/warn/regcomp.
551 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
552 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
554 #define REPORT_LOCATION " in regex; marked by " MARKER1 \
555 " in m/%"UTF8f MARKER2 "%"UTF8f"/"
557 #define REPORT_LOCATION_ARGS(offset) \
558 UTF8fARG(UTF, offset, RExC_precomp), \
559 UTF8fARG(UTF, RExC_end - RExC_precomp - offset, RExC_precomp + offset)
561 /* Used to point after bad bytes for an error message, but avoid skipping
562 * past a nul byte. */
563 #define SKIP_IF_CHAR(s) (!*(s) ? 0 : UTF ? UTF8SKIP(s) : 1)
566 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
567 * arg. Show regex, up to a maximum length. If it's too long, chop and add
570 #define _FAIL(code) STMT_START { \
571 const char *ellipses = ""; \
572 IV len = RExC_end - RExC_precomp; \
575 SAVEFREESV(RExC_rx_sv); \
576 if (len > RegexLengthToShowInErrorMessages) { \
577 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
578 len = RegexLengthToShowInErrorMessages - 10; \
584 #define FAIL(msg) _FAIL( \
585 Perl_croak(aTHX_ "%s in regex m/%"UTF8f"%s/", \
586 msg, UTF8fARG(UTF, len, RExC_precomp), ellipses))
588 #define FAIL2(msg,arg) _FAIL( \
589 Perl_croak(aTHX_ msg " in regex m/%"UTF8f"%s/", \
590 arg, UTF8fARG(UTF, len, RExC_precomp), ellipses))
593 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
595 #define Simple_vFAIL(m) STMT_START { \
597 (RExC_parse > RExC_end ? RExC_end : RExC_parse) - RExC_precomp; \
598 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
599 m, REPORT_LOCATION_ARGS(offset)); \
603 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
605 #define vFAIL(m) STMT_START { \
607 SAVEFREESV(RExC_rx_sv); \
612 * Like Simple_vFAIL(), but accepts two arguments.
614 #define Simple_vFAIL2(m,a1) STMT_START { \
615 const IV offset = RExC_parse - RExC_precomp; \
616 S_re_croak2(aTHX_ UTF, m, REPORT_LOCATION, a1, \
617 REPORT_LOCATION_ARGS(offset)); \
621 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
623 #define vFAIL2(m,a1) STMT_START { \
625 SAVEFREESV(RExC_rx_sv); \
626 Simple_vFAIL2(m, a1); \
631 * Like Simple_vFAIL(), but accepts three arguments.
633 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
634 const IV offset = RExC_parse - RExC_precomp; \
635 S_re_croak2(aTHX_ UTF, m, REPORT_LOCATION, a1, a2, \
636 REPORT_LOCATION_ARGS(offset)); \
640 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
642 #define vFAIL3(m,a1,a2) STMT_START { \
644 SAVEFREESV(RExC_rx_sv); \
645 Simple_vFAIL3(m, a1, a2); \
649 * Like Simple_vFAIL(), but accepts four arguments.
651 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
652 const IV offset = RExC_parse - RExC_precomp; \
653 S_re_croak2(aTHX_ UTF, m, REPORT_LOCATION, a1, a2, a3, \
654 REPORT_LOCATION_ARGS(offset)); \
657 #define vFAIL4(m,a1,a2,a3) STMT_START { \
659 SAVEFREESV(RExC_rx_sv); \
660 Simple_vFAIL4(m, a1, a2, a3); \
663 /* A specialized version of vFAIL2 that works with UTF8f */
664 #define vFAIL2utf8f(m, a1) STMT_START { \
665 const IV offset = RExC_parse - RExC_precomp; \
667 SAVEFREESV(RExC_rx_sv); \
668 S_re_croak2(aTHX_ UTF, m, REPORT_LOCATION, a1, \
669 REPORT_LOCATION_ARGS(offset)); \
672 #define vFAIL3utf8f(m, a1, a2) STMT_START { \
673 const IV offset = RExC_parse - RExC_precomp; \
675 SAVEFREESV(RExC_rx_sv); \
676 S_re_croak2(aTHX_ UTF, m, REPORT_LOCATION, a1, a2, \
677 REPORT_LOCATION_ARGS(offset)); \
680 /* These have asserts in them because of [perl #122671] Many warnings in
681 * regcomp.c can occur twice. If they get output in pass1 and later in that
682 * pass, the pattern has to be converted to UTF-8 and the pass restarted, they
683 * would get output again. So they should be output in pass2, and these
684 * asserts make sure new warnings follow that paradigm. */
686 /* m is not necessarily a "literal string", in this macro */
687 #define reg_warn_non_literal_string(loc, m) STMT_START { \
688 const IV offset = loc - RExC_precomp; \
689 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
690 m, REPORT_LOCATION_ARGS(offset)); \
693 #define ckWARNreg(loc,m) STMT_START { \
694 const IV offset = loc - RExC_precomp; \
695 __ASSERT_(PASS2) Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
696 REPORT_LOCATION_ARGS(offset)); \
699 #define vWARN(loc, m) STMT_START { \
700 const IV offset = loc - RExC_precomp; \
701 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
702 REPORT_LOCATION_ARGS(offset)); \
705 #define vWARN_dep(loc, m) STMT_START { \
706 const IV offset = loc - RExC_precomp; \
707 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), m REPORT_LOCATION, \
708 REPORT_LOCATION_ARGS(offset)); \
711 #define ckWARNdep(loc,m) STMT_START { \
712 const IV offset = loc - RExC_precomp; \
713 __ASSERT_(PASS2) Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), \
715 REPORT_LOCATION_ARGS(offset)); \
718 #define ckWARNregdep(loc,m) STMT_START { \
719 const IV offset = loc - RExC_precomp; \
720 __ASSERT_(PASS2) Perl_ck_warner_d(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
722 REPORT_LOCATION_ARGS(offset)); \
725 #define ckWARN2reg_d(loc,m, a1) STMT_START { \
726 const IV offset = loc - RExC_precomp; \
727 __ASSERT_(PASS2) Perl_ck_warner_d(aTHX_ packWARN(WARN_REGEXP), \
729 a1, REPORT_LOCATION_ARGS(offset)); \
732 #define ckWARN2reg(loc, m, a1) STMT_START { \
733 const IV offset = loc - RExC_precomp; \
734 __ASSERT_(PASS2) Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
735 a1, REPORT_LOCATION_ARGS(offset)); \
738 #define vWARN3(loc, m, a1, a2) STMT_START { \
739 const IV offset = loc - RExC_precomp; \
740 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
741 a1, a2, REPORT_LOCATION_ARGS(offset)); \
744 #define ckWARN3reg(loc, m, a1, a2) STMT_START { \
745 const IV offset = loc - RExC_precomp; \
746 __ASSERT_(PASS2) Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
747 a1, a2, REPORT_LOCATION_ARGS(offset)); \
750 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
751 const IV offset = loc - RExC_precomp; \
752 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
753 a1, a2, a3, REPORT_LOCATION_ARGS(offset)); \
756 #define ckWARN4reg(loc, m, a1, a2, a3) STMT_START { \
757 const IV offset = loc - RExC_precomp; \
758 __ASSERT_(PASS2) Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
759 a1, a2, a3, REPORT_LOCATION_ARGS(offset)); \
762 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
763 const IV offset = loc - RExC_precomp; \
764 __ASSERT_(PASS2) Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
765 a1, a2, a3, a4, REPORT_LOCATION_ARGS(offset)); \
768 /* Macros for recording node offsets. 20001227 mjd@plover.com
769 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
770 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
771 * Element 0 holds the number n.
772 * Position is 1 indexed.
774 #ifndef RE_TRACK_PATTERN_OFFSETS
775 #define Set_Node_Offset_To_R(node,byte)
776 #define Set_Node_Offset(node,byte)
777 #define Set_Cur_Node_Offset
778 #define Set_Node_Length_To_R(node,len)
779 #define Set_Node_Length(node,len)
780 #define Set_Node_Cur_Length(node,start)
781 #define Node_Offset(n)
782 #define Node_Length(n)
783 #define Set_Node_Offset_Length(node,offset,len)
784 #define ProgLen(ri) ri->u.proglen
785 #define SetProgLen(ri,x) ri->u.proglen = x
787 #define ProgLen(ri) ri->u.offsets[0]
788 #define SetProgLen(ri,x) ri->u.offsets[0] = x
789 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
791 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
792 __LINE__, (int)(node), (int)(byte))); \
794 Perl_croak(aTHX_ "value of node is %d in Offset macro", \
797 RExC_offsets[2*(node)-1] = (byte); \
802 #define Set_Node_Offset(node,byte) \
803 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
804 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
806 #define Set_Node_Length_To_R(node,len) STMT_START { \
808 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
809 __LINE__, (int)(node), (int)(len))); \
811 Perl_croak(aTHX_ "value of node is %d in Length macro", \
814 RExC_offsets[2*(node)] = (len); \
819 #define Set_Node_Length(node,len) \
820 Set_Node_Length_To_R((node)-RExC_emit_start, len)
821 #define Set_Node_Cur_Length(node, start) \
822 Set_Node_Length(node, RExC_parse - start)
824 /* Get offsets and lengths */
825 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
826 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
828 #define Set_Node_Offset_Length(node,offset,len) STMT_START { \
829 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
830 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
834 #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
835 #define EXPERIMENTAL_INPLACESCAN
836 #endif /*PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS*/
838 #define DEBUG_RExC_seen() \
839 DEBUG_OPTIMISE_MORE_r({ \
840 PerlIO_printf(Perl_debug_log,"RExC_seen: "); \
842 if (RExC_seen & REG_ZERO_LEN_SEEN) \
843 PerlIO_printf(Perl_debug_log,"REG_ZERO_LEN_SEEN "); \
845 if (RExC_seen & REG_LOOKBEHIND_SEEN) \
846 PerlIO_printf(Perl_debug_log,"REG_LOOKBEHIND_SEEN "); \
848 if (RExC_seen & REG_GPOS_SEEN) \
849 PerlIO_printf(Perl_debug_log,"REG_GPOS_SEEN "); \
851 if (RExC_seen & REG_RECURSE_SEEN) \
852 PerlIO_printf(Perl_debug_log,"REG_RECURSE_SEEN "); \
854 if (RExC_seen & REG_TOP_LEVEL_BRANCHES_SEEN) \
855 PerlIO_printf(Perl_debug_log,"REG_TOP_LEVEL_BRANCHES_SEEN "); \
857 if (RExC_seen & REG_VERBARG_SEEN) \
858 PerlIO_printf(Perl_debug_log,"REG_VERBARG_SEEN "); \
860 if (RExC_seen & REG_CUTGROUP_SEEN) \
861 PerlIO_printf(Perl_debug_log,"REG_CUTGROUP_SEEN "); \
863 if (RExC_seen & REG_RUN_ON_COMMENT_SEEN) \
864 PerlIO_printf(Perl_debug_log,"REG_RUN_ON_COMMENT_SEEN "); \
866 if (RExC_seen & REG_UNFOLDED_MULTI_SEEN) \
867 PerlIO_printf(Perl_debug_log,"REG_UNFOLDED_MULTI_SEEN "); \
869 if (RExC_seen & REG_GOSTART_SEEN) \
870 PerlIO_printf(Perl_debug_log,"REG_GOSTART_SEEN "); \
872 if (RExC_seen & REG_UNBOUNDED_QUANTIFIER_SEEN) \
873 PerlIO_printf(Perl_debug_log,"REG_UNBOUNDED_QUANTIFIER_SEEN "); \
875 PerlIO_printf(Perl_debug_log,"\n"); \
878 #define DEBUG_SHOW_STUDY_FLAG(flags,flag) \
879 if ((flags) & flag) PerlIO_printf(Perl_debug_log, "%s ", #flag)
881 #define DEBUG_SHOW_STUDY_FLAGS(flags,open_str,close_str) \
883 PerlIO_printf(Perl_debug_log, "%s", open_str); \
884 DEBUG_SHOW_STUDY_FLAG(flags,SF_FL_BEFORE_SEOL); \
885 DEBUG_SHOW_STUDY_FLAG(flags,SF_FL_BEFORE_MEOL); \
886 DEBUG_SHOW_STUDY_FLAG(flags,SF_IS_INF); \
887 DEBUG_SHOW_STUDY_FLAG(flags,SF_HAS_PAR); \
888 DEBUG_SHOW_STUDY_FLAG(flags,SF_IN_PAR); \
889 DEBUG_SHOW_STUDY_FLAG(flags,SF_HAS_EVAL); \
890 DEBUG_SHOW_STUDY_FLAG(flags,SCF_DO_SUBSTR); \
891 DEBUG_SHOW_STUDY_FLAG(flags,SCF_DO_STCLASS_AND); \
892 DEBUG_SHOW_STUDY_FLAG(flags,SCF_DO_STCLASS_OR); \
893 DEBUG_SHOW_STUDY_FLAG(flags,SCF_DO_STCLASS); \
894 DEBUG_SHOW_STUDY_FLAG(flags,SCF_WHILEM_VISITED_POS); \
895 DEBUG_SHOW_STUDY_FLAG(flags,SCF_TRIE_RESTUDY); \
896 DEBUG_SHOW_STUDY_FLAG(flags,SCF_SEEN_ACCEPT); \
897 DEBUG_SHOW_STUDY_FLAG(flags,SCF_TRIE_DOING_RESTUDY); \
898 DEBUG_SHOW_STUDY_FLAG(flags,SCF_IN_DEFINE); \
899 PerlIO_printf(Perl_debug_log, "%s", close_str); \
903 #define DEBUG_STUDYDATA(str,data,depth) \
904 DEBUG_OPTIMISE_MORE_r(if(data){ \
905 PerlIO_printf(Perl_debug_log, \
906 "%*s" str "Pos:%"IVdf"/%"IVdf \
908 (int)(depth)*2, "", \
909 (IV)((data)->pos_min), \
910 (IV)((data)->pos_delta), \
911 (UV)((data)->flags) \
913 DEBUG_SHOW_STUDY_FLAGS((data)->flags," [ ","]"); \
914 PerlIO_printf(Perl_debug_log, \
915 " Whilem_c: %"IVdf" Lcp: %"IVdf" %s", \
916 (IV)((data)->whilem_c), \
917 (IV)((data)->last_closep ? *((data)->last_closep) : -1), \
918 is_inf ? "INF " : "" \
920 if ((data)->last_found) \
921 PerlIO_printf(Perl_debug_log, \
922 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
923 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
924 SvPVX_const((data)->last_found), \
925 (IV)((data)->last_end), \
926 (IV)((data)->last_start_min), \
927 (IV)((data)->last_start_max), \
928 ((data)->longest && \
929 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
930 SvPVX_const((data)->longest_fixed), \
931 (IV)((data)->offset_fixed), \
932 ((data)->longest && \
933 (data)->longest==&((data)->longest_float)) ? "*" : "", \
934 SvPVX_const((data)->longest_float), \
935 (IV)((data)->offset_float_min), \
936 (IV)((data)->offset_float_max) \
938 PerlIO_printf(Perl_debug_log,"\n"); \
941 /* is c a control character for which we have a mnemonic? */
942 #define isMNEMONIC_CNTRL(c) _IS_MNEMONIC_CNTRL_ONLY_FOR_USE_BY_REGCOMP_DOT_C(c)
945 S_cntrl_to_mnemonic(const U8 c)
947 /* Returns the mnemonic string that represents character 'c', if one
948 * exists; NULL otherwise. The only ones that exist for the purposes of
949 * this routine are a few control characters */
952 case '\a': return "\\a";
953 case '\b': return "\\b";
954 case ESC_NATIVE: return "\\e";
955 case '\f': return "\\f";
956 case '\n': return "\\n";
957 case '\r': return "\\r";
958 case '\t': return "\\t";
964 /* Mark that we cannot extend a found fixed substring at this point.
965 Update the longest found anchored substring and the longest found
966 floating substrings if needed. */
969 S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data,
970 SSize_t *minlenp, int is_inf)
972 const STRLEN l = CHR_SVLEN(data->last_found);
973 const STRLEN old_l = CHR_SVLEN(*data->longest);
974 GET_RE_DEBUG_FLAGS_DECL;
976 PERL_ARGS_ASSERT_SCAN_COMMIT;
978 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
979 SvSetMagicSV(*data->longest, data->last_found);
980 if (*data->longest == data->longest_fixed) {
981 data->offset_fixed = l ? data->last_start_min : data->pos_min;
982 if (data->flags & SF_BEFORE_EOL)
984 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
986 data->flags &= ~SF_FIX_BEFORE_EOL;
987 data->minlen_fixed=minlenp;
988 data->lookbehind_fixed=0;
990 else { /* *data->longest == data->longest_float */
991 data->offset_float_min = l ? data->last_start_min : data->pos_min;
992 data->offset_float_max = (l
993 ? data->last_start_max
994 : (data->pos_delta > SSize_t_MAX - data->pos_min
996 : data->pos_min + data->pos_delta));
998 || (STRLEN)data->offset_float_max > (STRLEN)SSize_t_MAX)
999 data->offset_float_max = SSize_t_MAX;
1000 if (data->flags & SF_BEFORE_EOL)
1002 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
1004 data->flags &= ~SF_FL_BEFORE_EOL;
1005 data->minlen_float=minlenp;
1006 data->lookbehind_float=0;
1009 SvCUR_set(data->last_found, 0);
1011 SV * const sv = data->last_found;
1012 if (SvUTF8(sv) && SvMAGICAL(sv)) {
1013 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
1018 data->last_end = -1;
1019 data->flags &= ~SF_BEFORE_EOL;
1020 DEBUG_STUDYDATA("commit: ",data,0);
1023 /* An SSC is just a regnode_charclass_posix with an extra field: the inversion
1024 * list that describes which code points it matches */
1027 S_ssc_anything(pTHX_ regnode_ssc *ssc)
1029 /* Set the SSC 'ssc' to match an empty string or any code point */
1031 PERL_ARGS_ASSERT_SSC_ANYTHING;
1033 assert(is_ANYOF_SYNTHETIC(ssc));
1035 ssc->invlist = sv_2mortal(_new_invlist(2)); /* mortalize so won't leak */
1036 _append_range_to_invlist(ssc->invlist, 0, UV_MAX);
1037 ANYOF_FLAGS(ssc) |= SSC_MATCHES_EMPTY_STRING; /* Plus matches empty */
1041 S_ssc_is_anything(const regnode_ssc *ssc)
1043 /* Returns TRUE if the SSC 'ssc' can match the empty string and any code
1044 * point; FALSE otherwise. Thus, this is used to see if using 'ssc' buys
1045 * us anything: if the function returns TRUE, 'ssc' hasn't been restricted
1046 * in any way, so there's no point in using it */
1051 PERL_ARGS_ASSERT_SSC_IS_ANYTHING;
1053 assert(is_ANYOF_SYNTHETIC(ssc));
1055 if (! (ANYOF_FLAGS(ssc) & SSC_MATCHES_EMPTY_STRING)) {
1059 /* See if the list consists solely of the range 0 - Infinity */
1060 invlist_iterinit(ssc->invlist);
1061 ret = invlist_iternext(ssc->invlist, &start, &end)
1065 invlist_iterfinish(ssc->invlist);
1071 /* If e.g., both \w and \W are set, matches everything */
1072 if (ANYOF_POSIXL_SSC_TEST_ANY_SET(ssc)) {
1074 for (i = 0; i < ANYOF_POSIXL_MAX; i += 2) {
1075 if (ANYOF_POSIXL_TEST(ssc, i) && ANYOF_POSIXL_TEST(ssc, i+1)) {
1085 S_ssc_init(pTHX_ const RExC_state_t *pRExC_state, regnode_ssc *ssc)
1087 /* Initializes the SSC 'ssc'. This includes setting it to match an empty
1088 * string, any code point, or any posix class under locale */
1090 PERL_ARGS_ASSERT_SSC_INIT;
1092 Zero(ssc, 1, regnode_ssc);
1093 set_ANYOF_SYNTHETIC(ssc);
1094 ARG_SET(ssc, ANYOF_ONLY_HAS_BITMAP);
1097 /* If any portion of the regex is to operate under locale rules that aren't
1098 * fully known at compile time, initialization includes it. The reason
1099 * this isn't done for all regexes is that the optimizer was written under
1100 * the assumption that locale was all-or-nothing. Given the complexity and
1101 * lack of documentation in the optimizer, and that there are inadequate
1102 * test cases for locale, many parts of it may not work properly, it is
1103 * safest to avoid locale unless necessary. */
1104 if (RExC_contains_locale) {
1105 ANYOF_POSIXL_SETALL(ssc);
1108 ANYOF_POSIXL_ZERO(ssc);
1113 S_ssc_is_cp_posixl_init(const RExC_state_t *pRExC_state,
1114 const regnode_ssc *ssc)
1116 /* Returns TRUE if the SSC 'ssc' is in its initial state with regard only
1117 * to the list of code points matched, and locale posix classes; hence does
1118 * not check its flags) */
1123 PERL_ARGS_ASSERT_SSC_IS_CP_POSIXL_INIT;
1125 assert(is_ANYOF_SYNTHETIC(ssc));
1127 invlist_iterinit(ssc->invlist);
1128 ret = invlist_iternext(ssc->invlist, &start, &end)
1132 invlist_iterfinish(ssc->invlist);
1138 if (RExC_contains_locale && ! ANYOF_POSIXL_SSC_TEST_ALL_SET(ssc)) {
1146 S_get_ANYOF_cp_list_for_ssc(pTHX_ const RExC_state_t *pRExC_state,
1147 const regnode_charclass* const node)
1149 /* Returns a mortal inversion list defining which code points are matched
1150 * by 'node', which is of type ANYOF. Handles complementing the result if
1151 * appropriate. If some code points aren't knowable at this time, the
1152 * returned list must, and will, contain every code point that is a
1155 SV* invlist = sv_2mortal(_new_invlist(0));
1156 SV* only_utf8_locale_invlist = NULL;
1158 const U32 n = ARG(node);
1159 bool new_node_has_latin1 = FALSE;
1161 PERL_ARGS_ASSERT_GET_ANYOF_CP_LIST_FOR_SSC;
1163 /* Look at the data structure created by S_set_ANYOF_arg() */
1164 if (n != ANYOF_ONLY_HAS_BITMAP) {
1165 SV * const rv = MUTABLE_SV(RExC_rxi->data->data[n]);
1166 AV * const av = MUTABLE_AV(SvRV(rv));
1167 SV **const ary = AvARRAY(av);
1168 assert(RExC_rxi->data->what[n] == 's');
1170 if (ary[1] && ary[1] != &PL_sv_undef) { /* Has compile-time swash */
1171 invlist = sv_2mortal(invlist_clone(_get_swash_invlist(ary[1])));
1173 else if (ary[0] && ary[0] != &PL_sv_undef) {
1175 /* Here, no compile-time swash, and there are things that won't be
1176 * known until runtime -- we have to assume it could be anything */
1177 return _add_range_to_invlist(invlist, 0, UV_MAX);
1179 else if (ary[3] && ary[3] != &PL_sv_undef) {
1181 /* Here no compile-time swash, and no run-time only data. Use the
1182 * node's inversion list */
1183 invlist = sv_2mortal(invlist_clone(ary[3]));
1186 /* Get the code points valid only under UTF-8 locales */
1187 if ((ANYOF_FLAGS(node) & ANYOF_LOC_FOLD)
1188 && ary[2] && ary[2] != &PL_sv_undef)
1190 only_utf8_locale_invlist = ary[2];
1194 /* An ANYOF node contains a bitmap for the first NUM_ANYOF_CODE_POINTS
1195 * code points, and an inversion list for the others, but if there are code
1196 * points that should match only conditionally on the target string being
1197 * UTF-8, those are placed in the inversion list, and not the bitmap.
1198 * Since there are circumstances under which they could match, they are
1199 * included in the SSC. But if the ANYOF node is to be inverted, we have
1200 * to exclude them here, so that when we invert below, the end result
1201 * actually does include them. (Think about "\xe0" =~ /[^\xc0]/di;). We
1202 * have to do this here before we add the unconditionally matched code
1204 if (ANYOF_FLAGS(node) & ANYOF_INVERT) {
1205 _invlist_intersection_complement_2nd(invlist,
1210 /* Add in the points from the bit map */
1211 for (i = 0; i < NUM_ANYOF_CODE_POINTS; i++) {
1212 if (ANYOF_BITMAP_TEST(node, i)) {
1213 invlist = add_cp_to_invlist(invlist, i);
1214 new_node_has_latin1 = TRUE;
1218 /* If this can match all upper Latin1 code points, have to add them
1220 if (OP(node) == ANYOFD
1221 && (ANYOF_FLAGS(node) & ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER))
1223 _invlist_union(invlist, PL_UpperLatin1, &invlist);
1226 /* Similarly for these */
1227 if (ANYOF_FLAGS(node) & ANYOF_MATCHES_ALL_ABOVE_BITMAP) {
1228 _invlist_union_complement_2nd(invlist, PL_InBitmap, &invlist);
1231 if (ANYOF_FLAGS(node) & ANYOF_INVERT) {
1232 _invlist_invert(invlist);
1234 else if (new_node_has_latin1 && ANYOF_FLAGS(node) & ANYOF_LOC_FOLD) {
1236 /* Under /li, any 0-255 could fold to any other 0-255, depending on the
1237 * locale. We can skip this if there are no 0-255 at all. */
1238 _invlist_union(invlist, PL_Latin1, &invlist);
1241 /* Similarly add the UTF-8 locale possible matches. These have to be
1242 * deferred until after the non-UTF-8 locale ones are taken care of just
1243 * above, or it leads to wrong results under ANYOF_INVERT */
1244 if (only_utf8_locale_invlist) {
1245 _invlist_union_maybe_complement_2nd(invlist,
1246 only_utf8_locale_invlist,
1247 ANYOF_FLAGS(node) & ANYOF_INVERT,
1254 /* These two functions currently do the exact same thing */
1255 #define ssc_init_zero ssc_init
1257 #define ssc_add_cp(ssc, cp) ssc_add_range((ssc), (cp), (cp))
1258 #define ssc_match_all_cp(ssc) ssc_add_range(ssc, 0, UV_MAX)
1260 /* 'AND' a given class with another one. Can create false positives. 'ssc'
1261 * should not be inverted. 'and_with->flags & ANYOF_MATCHES_POSIXL' should be
1262 * 0 if 'and_with' is a regnode_charclass instead of a regnode_ssc. */
1265 S_ssc_and(pTHX_ const RExC_state_t *pRExC_state, regnode_ssc *ssc,
1266 const regnode_charclass *and_with)
1268 /* Accumulate into SSC 'ssc' its 'AND' with 'and_with', which is either
1269 * another SSC or a regular ANYOF class. Can create false positives. */
1274 PERL_ARGS_ASSERT_SSC_AND;
1276 assert(is_ANYOF_SYNTHETIC(ssc));
1278 /* 'and_with' is used as-is if it too is an SSC; otherwise have to extract
1279 * the code point inversion list and just the relevant flags */
1280 if (is_ANYOF_SYNTHETIC(and_with)) {
1281 anded_cp_list = ((regnode_ssc *)and_with)->invlist;
1282 anded_flags = ANYOF_FLAGS(and_with);
1284 /* XXX This is a kludge around what appears to be deficiencies in the
1285 * optimizer. If we make S_ssc_anything() add in the WARN_SUPER flag,
1286 * there are paths through the optimizer where it doesn't get weeded
1287 * out when it should. And if we don't make some extra provision for
1288 * it like the code just below, it doesn't get added when it should.
1289 * This solution is to add it only when AND'ing, which is here, and
1290 * only when what is being AND'ed is the pristine, original node
1291 * matching anything. Thus it is like adding it to ssc_anything() but
1292 * only when the result is to be AND'ed. Probably the same solution
1293 * could be adopted for the same problem we have with /l matching,
1294 * which is solved differently in S_ssc_init(), and that would lead to
1295 * fewer false positives than that solution has. But if this solution
1296 * creates bugs, the consequences are only that a warning isn't raised
1297 * that should be; while the consequences for having /l bugs is
1298 * incorrect matches */
1299 if (ssc_is_anything((regnode_ssc *)and_with)) {
1300 anded_flags |= ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER;
1304 anded_cp_list = get_ANYOF_cp_list_for_ssc(pRExC_state, and_with);
1305 if (OP(and_with) == ANYOFD) {
1306 anded_flags = ANYOF_FLAGS(and_with) & ANYOF_COMMON_FLAGS;
1309 anded_flags = ANYOF_FLAGS(and_with)
1310 &( ANYOF_COMMON_FLAGS
1311 |ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER
1312 |ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP);
1316 ANYOF_FLAGS(ssc) &= anded_flags;
1318 /* Below, C1 is the list of code points in 'ssc'; P1, its posix classes.
1319 * C2 is the list of code points in 'and-with'; P2, its posix classes.
1320 * 'and_with' may be inverted. When not inverted, we have the situation of
1322 * (C1 | P1) & (C2 | P2)
1323 * = (C1 & (C2 | P2)) | (P1 & (C2 | P2))
1324 * = ((C1 & C2) | (C1 & P2)) | ((P1 & C2) | (P1 & P2))
1325 * <= ((C1 & C2) | P2)) | ( P1 | (P1 & P2))
1326 * <= ((C1 & C2) | P1 | P2)
1327 * Alternatively, the last few steps could be:
1328 * = ((C1 & C2) | (C1 & P2)) | ((P1 & C2) | (P1 & P2))
1329 * <= ((C1 & C2) | C1 ) | ( C2 | (P1 & P2))
1330 * <= (C1 | C2 | (P1 & P2))
1331 * We favor the second approach if either P1 or P2 is non-empty. This is
1332 * because these components are a barrier to doing optimizations, as what
1333 * they match cannot be known until the moment of matching as they are
1334 * dependent on the current locale, 'AND"ing them likely will reduce or
1336 * But we can do better if we know that C1,P1 are in their initial state (a
1337 * frequent occurrence), each matching everything:
1338 * (<everything>) & (C2 | P2) = C2 | P2
1339 * Similarly, if C2,P2 are in their initial state (again a frequent
1340 * occurrence), the result is a no-op
1341 * (C1 | P1) & (<everything>) = C1 | P1
1344 * (C1 | P1) & ~(C2 | P2) = (C1 | P1) & (~C2 & ~P2)
1345 * = (C1 & (~C2 & ~P2)) | (P1 & (~C2 & ~P2))
1346 * <= (C1 & ~C2) | (P1 & ~P2)
1349 if ((ANYOF_FLAGS(and_with) & ANYOF_INVERT)
1350 && ! is_ANYOF_SYNTHETIC(and_with))
1354 ssc_intersection(ssc,
1356 FALSE /* Has already been inverted */
1359 /* If either P1 or P2 is empty, the intersection will be also; can skip
1361 if (! (ANYOF_FLAGS(and_with) & ANYOF_MATCHES_POSIXL)) {
1362 ANYOF_POSIXL_ZERO(ssc);
1364 else if (ANYOF_POSIXL_SSC_TEST_ANY_SET(ssc)) {
1366 /* Note that the Posix class component P from 'and_with' actually
1368 * P = Pa | Pb | ... | Pn
1369 * where each component is one posix class, such as in [\w\s].
1371 * ~P = ~(Pa | Pb | ... | Pn)
1372 * = ~Pa & ~Pb & ... & ~Pn
1373 * <= ~Pa | ~Pb | ... | ~Pn
1374 * The last is something we can easily calculate, but unfortunately
1375 * is likely to have many false positives. We could do better
1376 * in some (but certainly not all) instances if two classes in
1377 * P have known relationships. For example
1378 * :lower: <= :alpha: <= :alnum: <= \w <= :graph: <= :print:
1380 * :lower: & :print: = :lower:
1381 * And similarly for classes that must be disjoint. For example,
1382 * since \s and \w can have no elements in common based on rules in
1383 * the POSIX standard,
1384 * \w & ^\S = nothing
1385 * Unfortunately, some vendor locales do not meet the Posix
1386 * standard, in particular almost everything by Microsoft.
1387 * The loop below just changes e.g., \w into \W and vice versa */
1389 regnode_charclass_posixl temp;
1390 int add = 1; /* To calculate the index of the complement */
1392 ANYOF_POSIXL_ZERO(&temp);
1393 for (i = 0; i < ANYOF_MAX; i++) {
1395 || ! ANYOF_POSIXL_TEST((regnode_charclass_posixl*) and_with, i)
1396 || ! ANYOF_POSIXL_TEST((regnode_charclass_posixl*) and_with, i + 1));
1398 if (ANYOF_POSIXL_TEST((regnode_charclass_posixl*) and_with, i)) {
1399 ANYOF_POSIXL_SET(&temp, i + add);
1401 add = 0 - add; /* 1 goes to -1; -1 goes to 1 */
1403 ANYOF_POSIXL_AND(&temp, ssc);
1405 } /* else ssc already has no posixes */
1406 } /* else: Not inverted. This routine is a no-op if 'and_with' is an SSC
1407 in its initial state */
1408 else if (! is_ANYOF_SYNTHETIC(and_with)
1409 || ! ssc_is_cp_posixl_init(pRExC_state, (regnode_ssc *)and_with))
1411 /* But if 'ssc' is in its initial state, the result is just 'and_with';
1412 * copy it over 'ssc' */
1413 if (ssc_is_cp_posixl_init(pRExC_state, ssc)) {
1414 if (is_ANYOF_SYNTHETIC(and_with)) {
1415 StructCopy(and_with, ssc, regnode_ssc);
1418 ssc->invlist = anded_cp_list;
1419 ANYOF_POSIXL_ZERO(ssc);
1420 if (ANYOF_FLAGS(and_with) & ANYOF_MATCHES_POSIXL) {
1421 ANYOF_POSIXL_OR((regnode_charclass_posixl*) and_with, ssc);
1425 else if (ANYOF_POSIXL_SSC_TEST_ANY_SET(ssc)
1426 || (ANYOF_FLAGS(and_with) & ANYOF_MATCHES_POSIXL))
1428 /* One or the other of P1, P2 is non-empty. */
1429 if (ANYOF_FLAGS(and_with) & ANYOF_MATCHES_POSIXL) {
1430 ANYOF_POSIXL_AND((regnode_charclass_posixl*) and_with, ssc);
1432 ssc_union(ssc, anded_cp_list, FALSE);
1434 else { /* P1 = P2 = empty */
1435 ssc_intersection(ssc, anded_cp_list, FALSE);
1441 S_ssc_or(pTHX_ const RExC_state_t *pRExC_state, regnode_ssc *ssc,
1442 const regnode_charclass *or_with)
1444 /* Accumulate into SSC 'ssc' its 'OR' with 'or_with', which is either
1445 * another SSC or a regular ANYOF class. Can create false positives if
1446 * 'or_with' is to be inverted. */
1451 PERL_ARGS_ASSERT_SSC_OR;
1453 assert(is_ANYOF_SYNTHETIC(ssc));
1455 /* 'or_with' is used as-is if it too is an SSC; otherwise have to extract
1456 * the code point inversion list and just the relevant flags */
1457 if (is_ANYOF_SYNTHETIC(or_with)) {
1458 ored_cp_list = ((regnode_ssc*) or_with)->invlist;
1459 ored_flags = ANYOF_FLAGS(or_with);
1462 ored_cp_list = get_ANYOF_cp_list_for_ssc(pRExC_state, or_with);
1463 ored_flags = ANYOF_FLAGS(or_with) & ANYOF_COMMON_FLAGS;
1464 if (OP(or_with) != ANYOFD) {
1466 |= ANYOF_FLAGS(or_with)
1467 & ( ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER
1468 |ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP);
1472 ANYOF_FLAGS(ssc) |= ored_flags;
1474 /* Below, C1 is the list of code points in 'ssc'; P1, its posix classes.
1475 * C2 is the list of code points in 'or-with'; P2, its posix classes.
1476 * 'or_with' may be inverted. When not inverted, we have the simple
1477 * situation of computing:
1478 * (C1 | P1) | (C2 | P2) = (C1 | C2) | (P1 | P2)
1479 * If P1|P2 yields a situation with both a class and its complement are
1480 * set, like having both \w and \W, this matches all code points, and we
1481 * can delete these from the P component of the ssc going forward. XXX We
1482 * might be able to delete all the P components, but I (khw) am not certain
1483 * about this, and it is better to be safe.
1486 * (C1 | P1) | ~(C2 | P2) = (C1 | P1) | (~C2 & ~P2)
1487 * <= (C1 | P1) | ~C2
1488 * <= (C1 | ~C2) | P1
1489 * (which results in actually simpler code than the non-inverted case)
1492 if ((ANYOF_FLAGS(or_with) & ANYOF_INVERT)
1493 && ! is_ANYOF_SYNTHETIC(or_with))
1495 /* We ignore P2, leaving P1 going forward */
1496 } /* else Not inverted */
1497 else if (ANYOF_FLAGS(or_with) & ANYOF_MATCHES_POSIXL) {
1498 ANYOF_POSIXL_OR((regnode_charclass_posixl*)or_with, ssc);
1499 if (ANYOF_POSIXL_SSC_TEST_ANY_SET(ssc)) {
1501 for (i = 0; i < ANYOF_MAX; i += 2) {
1502 if (ANYOF_POSIXL_TEST(ssc, i) && ANYOF_POSIXL_TEST(ssc, i + 1))
1504 ssc_match_all_cp(ssc);
1505 ANYOF_POSIXL_CLEAR(ssc, i);
1506 ANYOF_POSIXL_CLEAR(ssc, i+1);
1514 FALSE /* Already has been inverted */
1518 PERL_STATIC_INLINE void
1519 S_ssc_union(pTHX_ regnode_ssc *ssc, SV* const invlist, const bool invert2nd)
1521 PERL_ARGS_ASSERT_SSC_UNION;
1523 assert(is_ANYOF_SYNTHETIC(ssc));
1525 _invlist_union_maybe_complement_2nd(ssc->invlist,
1531 PERL_STATIC_INLINE void
1532 S_ssc_intersection(pTHX_ regnode_ssc *ssc,
1534 const bool invert2nd)
1536 PERL_ARGS_ASSERT_SSC_INTERSECTION;
1538 assert(is_ANYOF_SYNTHETIC(ssc));
1540 _invlist_intersection_maybe_complement_2nd(ssc->invlist,
1546 PERL_STATIC_INLINE void
1547 S_ssc_add_range(pTHX_ regnode_ssc *ssc, const UV start, const UV end)
1549 PERL_ARGS_ASSERT_SSC_ADD_RANGE;
1551 assert(is_ANYOF_SYNTHETIC(ssc));
1553 ssc->invlist = _add_range_to_invlist(ssc->invlist, start, end);
1556 PERL_STATIC_INLINE void
1557 S_ssc_cp_and(pTHX_ regnode_ssc *ssc, const UV cp)
1559 /* AND just the single code point 'cp' into the SSC 'ssc' */
1561 SV* cp_list = _new_invlist(2);
1563 PERL_ARGS_ASSERT_SSC_CP_AND;
1565 assert(is_ANYOF_SYNTHETIC(ssc));
1567 cp_list = add_cp_to_invlist(cp_list, cp);
1568 ssc_intersection(ssc, cp_list,
1569 FALSE /* Not inverted */
1571 SvREFCNT_dec_NN(cp_list);
1574 PERL_STATIC_INLINE void
1575 S_ssc_clear_locale(regnode_ssc *ssc)
1577 /* Set the SSC 'ssc' to not match any locale things */
1578 PERL_ARGS_ASSERT_SSC_CLEAR_LOCALE;
1580 assert(is_ANYOF_SYNTHETIC(ssc));
1582 ANYOF_POSIXL_ZERO(ssc);
1583 ANYOF_FLAGS(ssc) &= ~ANYOF_LOCALE_FLAGS;
1586 #define NON_OTHER_COUNT NON_OTHER_COUNT_FOR_USE_ONLY_BY_REGCOMP_DOT_C
1589 S_is_ssc_worth_it(const RExC_state_t * pRExC_state, const regnode_ssc * ssc)
1591 /* The synthetic start class is used to hopefully quickly winnow down
1592 * places where a pattern could start a match in the target string. If it
1593 * doesn't really narrow things down that much, there isn't much point to
1594 * having the overhead of using it. This function uses some very crude
1595 * heuristics to decide if to use the ssc or not.
1597 * It returns TRUE if 'ssc' rules out more than half what it considers to
1598 * be the "likely" possible matches, but of course it doesn't know what the
1599 * actual things being matched are going to be; these are only guesses
1601 * For /l matches, it assumes that the only likely matches are going to be
1602 * in the 0-255 range, uniformly distributed, so half of that is 127
1603 * For /a and /d matches, it assumes that the likely matches will be just
1604 * the ASCII range, so half of that is 63
1605 * For /u and there isn't anything matching above the Latin1 range, it
1606 * assumes that that is the only range likely to be matched, and uses
1607 * half that as the cut-off: 127. If anything matches above Latin1,
1608 * it assumes that all of Unicode could match (uniformly), except for
1609 * non-Unicode code points and things in the General Category "Other"
1610 * (unassigned, private use, surrogates, controls and formats). This
1611 * is a much large number. */
1613 const U32 max_match = (LOC)
1617 : (invlist_highest(ssc->invlist) < 256)
1619 : ((NON_OTHER_COUNT + 1) / 2) - 1;
1620 U32 count = 0; /* Running total of number of code points matched by
1622 UV start, end; /* Start and end points of current range in inversion
1625 PERL_ARGS_ASSERT_IS_SSC_WORTH_IT;
1627 invlist_iterinit(ssc->invlist);
1628 while (invlist_iternext(ssc->invlist, &start, &end)) {
1630 /* /u is the only thing that we expect to match above 255; so if not /u
1631 * and even if there are matches above 255, ignore them. This catches
1632 * things like \d under /d which does match the digits above 255, but
1633 * since the pattern is /d, it is not likely to be expecting them */
1634 if (! UNI_SEMANTICS) {
1638 end = MIN(end, 255);
1640 count += end - start + 1;
1641 if (count > max_match) {
1642 invlist_iterfinish(ssc->invlist);
1652 S_ssc_finalize(pTHX_ RExC_state_t *pRExC_state, regnode_ssc *ssc)
1654 /* The inversion list in the SSC is marked mortal; now we need a more
1655 * permanent copy, which is stored the same way that is done in a regular
1656 * ANYOF node, with the first NUM_ANYOF_CODE_POINTS code points in a bit
1659 SV* invlist = invlist_clone(ssc->invlist);
1661 PERL_ARGS_ASSERT_SSC_FINALIZE;
1663 assert(is_ANYOF_SYNTHETIC(ssc));
1665 /* The code in this file assumes that all but these flags aren't relevant
1666 * to the SSC, except SSC_MATCHES_EMPTY_STRING, which should be cleared
1667 * by the time we reach here */
1668 assert(! (ANYOF_FLAGS(ssc)
1669 & ~( ANYOF_COMMON_FLAGS
1670 |ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER
1671 |ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP)));
1673 populate_ANYOF_from_invlist( (regnode *) ssc, &invlist);
1675 set_ANYOF_arg(pRExC_state, (regnode *) ssc, invlist,
1676 NULL, NULL, NULL, FALSE);
1678 /* Make sure is clone-safe */
1679 ssc->invlist = NULL;
1681 if (ANYOF_POSIXL_SSC_TEST_ANY_SET(ssc)) {
1682 ANYOF_FLAGS(ssc) |= ANYOF_MATCHES_POSIXL;
1685 if (RExC_contains_locale) {
1689 assert(! (ANYOF_FLAGS(ssc) & ANYOF_LOCALE_FLAGS) || RExC_contains_locale);
1692 #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
1693 #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
1694 #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
1695 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list \
1696 ? (TRIE_LIST_CUR( idx ) - 1) \
1702 dump_trie(trie,widecharmap,revcharmap)
1703 dump_trie_interim_list(trie,widecharmap,revcharmap,next_alloc)
1704 dump_trie_interim_table(trie,widecharmap,revcharmap,next_alloc)
1706 These routines dump out a trie in a somewhat readable format.
1707 The _interim_ variants are used for debugging the interim
1708 tables that are used to generate the final compressed
1709 representation which is what dump_trie expects.
1711 Part of the reason for their existence is to provide a form
1712 of documentation as to how the different representations function.
1717 Dumps the final compressed table form of the trie to Perl_debug_log.
1718 Used for debugging make_trie().
1722 S_dump_trie(pTHX_ const struct _reg_trie_data *trie, HV *widecharmap,
1723 AV *revcharmap, U32 depth)
1726 SV *sv=sv_newmortal();
1727 int colwidth= widecharmap ? 6 : 4;
1729 GET_RE_DEBUG_FLAGS_DECL;
1731 PERL_ARGS_ASSERT_DUMP_TRIE;
1733 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
1734 (int)depth * 2 + 2,"",
1735 "Match","Base","Ofs" );
1737 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
1738 SV ** const tmp = av_fetch( revcharmap, state, 0);
1740 PerlIO_printf( Perl_debug_log, "%*s",
1742 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
1743 PL_colors[0], PL_colors[1],
1744 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1745 PERL_PV_ESCAPE_FIRSTCHAR
1750 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
1751 (int)depth * 2 + 2,"");
1753 for( state = 0 ; state < trie->uniquecharcount ; state++ )
1754 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
1755 PerlIO_printf( Perl_debug_log, "\n");
1757 for( state = 1 ; state < trie->statecount ; state++ ) {
1758 const U32 base = trie->states[ state ].trans.base;
1760 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|",
1761 (int)depth * 2 + 2,"", (UV)state);
1763 if ( trie->states[ state ].wordnum ) {
1764 PerlIO_printf( Perl_debug_log, " W%4X",
1765 trie->states[ state ].wordnum );
1767 PerlIO_printf( Perl_debug_log, "%6s", "" );
1770 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
1775 while( ( base + ofs < trie->uniquecharcount ) ||
1776 ( base + ofs - trie->uniquecharcount < trie->lasttrans
1777 && trie->trans[ base + ofs - trie->uniquecharcount ].check
1781 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
1783 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
1784 if ( ( base + ofs >= trie->uniquecharcount )
1785 && ( base + ofs - trie->uniquecharcount
1787 && trie->trans[ base + ofs
1788 - trie->uniquecharcount ].check == state )
1790 PerlIO_printf( Perl_debug_log, "%*"UVXf,
1792 (UV)trie->trans[ base + ofs
1793 - trie->uniquecharcount ].next );
1795 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
1799 PerlIO_printf( Perl_debug_log, "]");
1802 PerlIO_printf( Perl_debug_log, "\n" );
1804 PerlIO_printf(Perl_debug_log, "%*sword_info N:(prev,len)=",
1806 for (word=1; word <= trie->wordcount; word++) {
1807 PerlIO_printf(Perl_debug_log, " %d:(%d,%d)",
1808 (int)word, (int)(trie->wordinfo[word].prev),
1809 (int)(trie->wordinfo[word].len));
1811 PerlIO_printf(Perl_debug_log, "\n" );
1814 Dumps a fully constructed but uncompressed trie in list form.
1815 List tries normally only are used for construction when the number of
1816 possible chars (trie->uniquecharcount) is very high.
1817 Used for debugging make_trie().
1820 S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie,
1821 HV *widecharmap, AV *revcharmap, U32 next_alloc,
1825 SV *sv=sv_newmortal();
1826 int colwidth= widecharmap ? 6 : 4;
1827 GET_RE_DEBUG_FLAGS_DECL;
1829 PERL_ARGS_ASSERT_DUMP_TRIE_INTERIM_LIST;
1831 /* print out the table precompression. */
1832 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
1833 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
1834 "------:-----+-----------------\n" );
1836 for( state=1 ; state < next_alloc ; state ++ ) {
1839 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
1840 (int)depth * 2 + 2,"", (UV)state );
1841 if ( ! trie->states[ state ].wordnum ) {
1842 PerlIO_printf( Perl_debug_log, "%5s| ","");
1844 PerlIO_printf( Perl_debug_log, "W%4x| ",
1845 trie->states[ state ].wordnum
1848 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
1849 SV ** const tmp = av_fetch( revcharmap,
1850 TRIE_LIST_ITEM(state,charid).forid, 0);
1852 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
1854 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp),
1856 PL_colors[0], PL_colors[1],
1857 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)
1858 | PERL_PV_ESCAPE_FIRSTCHAR
1860 TRIE_LIST_ITEM(state,charid).forid,
1861 (UV)TRIE_LIST_ITEM(state,charid).newstate
1864 PerlIO_printf(Perl_debug_log, "\n%*s| ",
1865 (int)((depth * 2) + 14), "");
1868 PerlIO_printf( Perl_debug_log, "\n");
1873 Dumps a fully constructed but uncompressed trie in table form.
1874 This is the normal DFA style state transition table, with a few
1875 twists to facilitate compression later.
1876 Used for debugging make_trie().
1879 S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie,
1880 HV *widecharmap, AV *revcharmap, U32 next_alloc,
1885 SV *sv=sv_newmortal();
1886 int colwidth= widecharmap ? 6 : 4;
1887 GET_RE_DEBUG_FLAGS_DECL;
1889 PERL_ARGS_ASSERT_DUMP_TRIE_INTERIM_TABLE;
1892 print out the table precompression so that we can do a visual check
1893 that they are identical.
1896 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
1898 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1899 SV ** const tmp = av_fetch( revcharmap, charid, 0);
1901 PerlIO_printf( Perl_debug_log, "%*s",
1903 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
1904 PL_colors[0], PL_colors[1],
1905 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1906 PERL_PV_ESCAPE_FIRSTCHAR
1912 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
1914 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
1915 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
1918 PerlIO_printf( Perl_debug_log, "\n" );
1920 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
1922 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
1923 (int)depth * 2 + 2,"",
1924 (UV)TRIE_NODENUM( state ) );
1926 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1927 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
1929 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
1931 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
1933 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
1934 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n",
1935 (UV)trie->trans[ state ].check );
1937 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n",
1938 (UV)trie->trans[ state ].check,
1939 trie->states[ TRIE_NODENUM( state ) ].wordnum );
1947 /* make_trie(startbranch,first,last,tail,word_count,flags,depth)
1948 startbranch: the first branch in the whole branch sequence
1949 first : start branch of sequence of branch-exact nodes.
1950 May be the same as startbranch
1951 last : Thing following the last branch.
1952 May be the same as tail.
1953 tail : item following the branch sequence
1954 count : words in the sequence
1955 flags : currently the OP() type we will be building one of /EXACT(|F|FA|FU|FU_SS|L|FLU8)/
1956 depth : indent depth
1958 Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
1960 A trie is an N'ary tree where the branches are determined by digital
1961 decomposition of the key. IE, at the root node you look up the 1st character and
1962 follow that branch repeat until you find the end of the branches. Nodes can be
1963 marked as "accepting" meaning they represent a complete word. Eg:
1967 would convert into the following structure. Numbers represent states, letters
1968 following numbers represent valid transitions on the letter from that state, if
1969 the number is in square brackets it represents an accepting state, otherwise it
1970 will be in parenthesis.
1972 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1976 (1) +-i->(6)-+-s->[7]
1978 +-s->(3)-+-h->(4)-+-e->[5]
1980 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1982 This shows that when matching against the string 'hers' we will begin at state 1
1983 read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1984 then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1985 is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1986 single traverse. We store a mapping from accepting to state to which word was
1987 matched, and then when we have multiple possibilities we try to complete the
1988 rest of the regex in the order in which they occurred in the alternation.
1990 The only prior NFA like behaviour that would be changed by the TRIE support is
1991 the silent ignoring of duplicate alternations which are of the form:
1993 / (DUPE|DUPE) X? (?{ ... }) Y /x
1995 Thus EVAL blocks following a trie may be called a different number of times with
1996 and without the optimisation. With the optimisations dupes will be silently
1997 ignored. This inconsistent behaviour of EVAL type nodes is well established as
1998 the following demonstrates:
2000 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
2002 which prints out 'word' three times, but
2004 'words'=~/(word|word|word)(?{ print $1 })S/
2006 which doesnt print it out at all. This is due to other optimisations kicking in.
2008 Example of what happens on a structural level:
2010 The regexp /(ac|ad|ab)+/ will produce the following debug output:
2012 1: CURLYM[1] {1,32767}(18)
2023 This would be optimizable with startbranch=5, first=5, last=16, tail=16
2024 and should turn into:
2026 1: CURLYM[1] {1,32767}(18)
2028 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
2036 Cases where tail != last would be like /(?foo|bar)baz/:
2046 which would be optimizable with startbranch=1, first=1, last=7, tail=8
2047 and would end up looking like:
2050 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
2057 d = uvchr_to_utf8_flags(d, uv, 0);
2059 is the recommended Unicode-aware way of saying
2064 #define TRIE_STORE_REVCHAR(val) \
2067 SV *zlopp = newSV(UTF8_MAXBYTES); \
2068 unsigned char *flrbbbbb = (unsigned char *) SvPVX(zlopp); \
2069 unsigned const char *const kapow = uvchr_to_utf8(flrbbbbb, val); \
2070 SvCUR_set(zlopp, kapow - flrbbbbb); \
2073 av_push(revcharmap, zlopp); \
2075 char ooooff = (char)val; \
2076 av_push(revcharmap, newSVpvn(&ooooff, 1)); \
2080 /* This gets the next character from the input, folding it if not already
2082 #define TRIE_READ_CHAR STMT_START { \
2085 /* if it is UTF then it is either already folded, or does not need \
2087 uvc = valid_utf8_to_uvchr( (const U8*) uc, &len); \
2089 else if (folder == PL_fold_latin1) { \
2090 /* This folder implies Unicode rules, which in the range expressible \
2091 * by not UTF is the lower case, with the two exceptions, one of \
2092 * which should have been taken care of before calling this */ \
2093 assert(*uc != LATIN_SMALL_LETTER_SHARP_S); \
2094 uvc = toLOWER_L1(*uc); \
2095 if (UNLIKELY(uvc == MICRO_SIGN)) uvc = GREEK_SMALL_LETTER_MU; \
2098 /* raw data, will be folded later if needed */ \
2106 #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
2107 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
2108 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
2109 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
2111 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
2112 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
2113 TRIE_LIST_CUR( state )++; \
2116 #define TRIE_LIST_NEW(state) STMT_START { \
2117 Newxz( trie->states[ state ].trans.list, \
2118 4, reg_trie_trans_le ); \
2119 TRIE_LIST_CUR( state ) = 1; \
2120 TRIE_LIST_LEN( state ) = 4; \
2123 #define TRIE_HANDLE_WORD(state) STMT_START { \
2124 U16 dupe= trie->states[ state ].wordnum; \
2125 regnode * const noper_next = regnext( noper ); \
2128 /* store the word for dumping */ \
2130 if (OP(noper) != NOTHING) \
2131 tmp = newSVpvn_utf8(STRING(noper), STR_LEN(noper), UTF); \
2133 tmp = newSVpvn_utf8( "", 0, UTF ); \
2134 av_push( trie_words, tmp ); \
2138 trie->wordinfo[curword].prev = 0; \
2139 trie->wordinfo[curword].len = wordlen; \
2140 trie->wordinfo[curword].accept = state; \
2142 if ( noper_next < tail ) { \
2144 trie->jump = (U16 *) PerlMemShared_calloc( word_count + 1, \
2146 trie->jump[curword] = (U16)(noper_next - convert); \
2148 jumper = noper_next; \
2150 nextbranch= regnext(cur); \
2154 /* It's a dupe. Pre-insert into the wordinfo[].prev */\
2155 /* chain, so that when the bits of chain are later */\
2156 /* linked together, the dups appear in the chain */\
2157 trie->wordinfo[curword].prev = trie->wordinfo[dupe].prev; \
2158 trie->wordinfo[dupe].prev = curword; \
2160 /* we haven't inserted this word yet. */ \
2161 trie->states[ state ].wordnum = curword; \
2166 #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
2167 ( ( base + charid >= ucharcount \
2168 && base + charid < ubound \
2169 && state == trie->trans[ base - ucharcount + charid ].check \
2170 && trie->trans[ base - ucharcount + charid ].next ) \
2171 ? trie->trans[ base - ucharcount + charid ].next \
2172 : ( state==1 ? special : 0 ) \
2176 #define MADE_JUMP_TRIE 2
2177 #define MADE_EXACT_TRIE 4
2180 S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch,
2181 regnode *first, regnode *last, regnode *tail,
2182 U32 word_count, U32 flags, U32 depth)
2184 /* first pass, loop through and scan words */
2185 reg_trie_data *trie;
2186 HV *widecharmap = NULL;
2187 AV *revcharmap = newAV();
2193 regnode *jumper = NULL;
2194 regnode *nextbranch = NULL;
2195 regnode *convert = NULL;
2196 U32 *prev_states; /* temp array mapping each state to previous one */
2197 /* we just use folder as a flag in utf8 */
2198 const U8 * folder = NULL;
2201 const U32 data_slot = add_data( pRExC_state, STR_WITH_LEN("tuuu"));
2202 AV *trie_words = NULL;
2203 /* along with revcharmap, this only used during construction but both are
2204 * useful during debugging so we store them in the struct when debugging.
2207 const U32 data_slot = add_data( pRExC_state, STR_WITH_LEN("tu"));
2208 STRLEN trie_charcount=0;
2210 SV *re_trie_maxbuff;
2211 GET_RE_DEBUG_FLAGS_DECL;
2213 PERL_ARGS_ASSERT_MAKE_TRIE;
2215 PERL_UNUSED_ARG(depth);
2219 case EXACT: case EXACTL: break;
2223 case EXACTFLU8: folder = PL_fold_latin1; break;
2224 case EXACTF: folder = PL_fold; break;
2225 default: Perl_croak( aTHX_ "panic! In trie construction, unknown node type %u %s", (unsigned) flags, PL_reg_name[flags] );
2228 trie = (reg_trie_data *) PerlMemShared_calloc( 1, sizeof(reg_trie_data) );
2230 trie->startstate = 1;
2231 trie->wordcount = word_count;
2232 RExC_rxi->data->data[ data_slot ] = (void*)trie;
2233 trie->charmap = (U16 *) PerlMemShared_calloc( 256, sizeof(U16) );
2234 if (flags == EXACT || flags == EXACTL)
2235 trie->bitmap = (char *) PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 );
2236 trie->wordinfo = (reg_trie_wordinfo *) PerlMemShared_calloc(
2237 trie->wordcount+1, sizeof(reg_trie_wordinfo));
2240 trie_words = newAV();
2243 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2244 assert(re_trie_maxbuff);
2245 if (!SvIOK(re_trie_maxbuff)) {
2246 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2248 DEBUG_TRIE_COMPILE_r({
2249 PerlIO_printf( Perl_debug_log,
2250 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
2251 (int)depth * 2 + 2, "",
2252 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
2253 REG_NODE_NUM(last), REG_NODE_NUM(tail), (int)depth);
2256 /* Find the node we are going to overwrite */
2257 if ( first == startbranch && OP( last ) != BRANCH ) {
2258 /* whole branch chain */
2261 /* branch sub-chain */
2262 convert = NEXTOPER( first );
2265 /* -- First loop and Setup --
2267 We first traverse the branches and scan each word to determine if it
2268 contains widechars, and how many unique chars there are, this is
2269 important as we have to build a table with at least as many columns as we
2272 We use an array of integers to represent the character codes 0..255
2273 (trie->charmap) and we use a an HV* to store Unicode characters. We use
2274 the native representation of the character value as the key and IV's for
2277 *TODO* If we keep track of how many times each character is used we can
2278 remap the columns so that the table compression later on is more
2279 efficient in terms of memory by ensuring the most common value is in the
2280 middle and the least common are on the outside. IMO this would be better
2281 than a most to least common mapping as theres a decent chance the most
2282 common letter will share a node with the least common, meaning the node
2283 will not be compressible. With a middle is most common approach the worst
2284 case is when we have the least common nodes twice.
2288 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
2289 regnode *noper = NEXTOPER( cur );
2290 const U8 *uc = (U8*)STRING( noper );
2291 const U8 *e = uc + STR_LEN( noper );
2293 U32 wordlen = 0; /* required init */
2294 STRLEN minchars = 0;
2295 STRLEN maxchars = 0;
2296 bool set_bit = trie->bitmap ? 1 : 0; /*store the first char in the
2299 if (OP(noper) == NOTHING) {
2300 regnode *noper_next= regnext(noper);
2301 if (noper_next != tail && OP(noper_next) == flags) {
2303 uc= (U8*)STRING(noper);
2304 e= uc + STR_LEN(noper);
2305 trie->minlen= STR_LEN(noper);
2312 if ( set_bit ) { /* bitmap only alloced when !(UTF&&Folding) */
2313 TRIE_BITMAP_SET(trie,*uc); /* store the raw first byte
2314 regardless of encoding */
2315 if (OP( noper ) == EXACTFU_SS) {
2316 /* false positives are ok, so just set this */
2317 TRIE_BITMAP_SET(trie, LATIN_SMALL_LETTER_SHARP_S);
2320 for ( ; uc < e ; uc += len ) { /* Look at each char in the current
2322 TRIE_CHARCOUNT(trie)++;
2325 /* TRIE_READ_CHAR returns the current character, or its fold if /i
2326 * is in effect. Under /i, this character can match itself, or
2327 * anything that folds to it. If not under /i, it can match just
2328 * itself. Most folds are 1-1, for example k, K, and KELVIN SIGN
2329 * all fold to k, and all are single characters. But some folds
2330 * expand to more than one character, so for example LATIN SMALL
2331 * LIGATURE FFI folds to the three character sequence 'ffi'. If
2332 * the string beginning at 'uc' is 'ffi', it could be matched by
2333 * three characters, or just by the one ligature character. (It
2334 * could also be matched by two characters: LATIN SMALL LIGATURE FF
2335 * followed by 'i', or by 'f' followed by LATIN SMALL LIGATURE FI).
2336 * (Of course 'I' and/or 'F' instead of 'i' and 'f' can also
2337 * match.) The trie needs to know the minimum and maximum number
2338 * of characters that could match so that it can use size alone to
2339 * quickly reject many match attempts. The max is simple: it is
2340 * the number of folded characters in this branch (since a fold is
2341 * never shorter than what folds to it. */
2345 /* And the min is equal to the max if not under /i (indicated by
2346 * 'folder' being NULL), or there are no multi-character folds. If
2347 * there is a multi-character fold, the min is incremented just
2348 * once, for the character that folds to the sequence. Each
2349 * character in the sequence needs to be added to the list below of
2350 * characters in the trie, but we count only the first towards the
2351 * min number of characters needed. This is done through the
2352 * variable 'foldlen', which is returned by the macros that look
2353 * for these sequences as the number of bytes the sequence
2354 * occupies. Each time through the loop, we decrement 'foldlen' by
2355 * how many bytes the current char occupies. Only when it reaches
2356 * 0 do we increment 'minchars' or look for another multi-character
2358 if (folder == NULL) {
2361 else if (foldlen > 0) {
2362 foldlen -= (UTF) ? UTF8SKIP(uc) : 1;
2367 /* See if *uc is the beginning of a multi-character fold. If
2368 * so, we decrement the length remaining to look at, to account
2369 * for the current character this iteration. (We can use 'uc'
2370 * instead of the fold returned by TRIE_READ_CHAR because for
2371 * non-UTF, the latin1_safe macro is smart enough to account
2372 * for all the unfolded characters, and because for UTF, the
2373 * string will already have been folded earlier in the
2374 * compilation process */
2376 if ((foldlen = is_MULTI_CHAR_FOLD_utf8_safe(uc, e))) {
2377 foldlen -= UTF8SKIP(uc);
2380 else if ((foldlen = is_MULTI_CHAR_FOLD_latin1_safe(uc, e))) {
2385 /* The current character (and any potential folds) should be added
2386 * to the possible matching characters for this position in this
2390 U8 folded= folder[ (U8) uvc ];
2391 if ( !trie->charmap[ folded ] ) {
2392 trie->charmap[ folded ]=( ++trie->uniquecharcount );
2393 TRIE_STORE_REVCHAR( folded );
2396 if ( !trie->charmap[ uvc ] ) {
2397 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
2398 TRIE_STORE_REVCHAR( uvc );
2401 /* store the codepoint in the bitmap, and its folded
2403 TRIE_BITMAP_SET(trie, uvc);
2405 /* store the folded codepoint */
2406 if ( folder ) TRIE_BITMAP_SET(trie, folder[(U8) uvc ]);
2409 /* store first byte of utf8 representation of
2410 variant codepoints */
2411 if (! UVCHR_IS_INVARIANT(uvc)) {
2412 TRIE_BITMAP_SET(trie, UTF8_TWO_BYTE_HI(uvc));
2415 set_bit = 0; /* We've done our bit :-) */
2419 /* XXX We could come up with the list of code points that fold
2420 * to this using PL_utf8_foldclosures, except not for
2421 * multi-char folds, as there may be multiple combinations
2422 * there that could work, which needs to wait until runtime to
2423 * resolve (The comment about LIGATURE FFI above is such an
2428 widecharmap = newHV();
2430 svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 1 );
2433 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
2435 if ( !SvTRUE( *svpp ) ) {
2436 sv_setiv( *svpp, ++trie->uniquecharcount );
2437 TRIE_STORE_REVCHAR(uvc);
2440 } /* end loop through characters in this branch of the trie */
2442 /* We take the min and max for this branch and combine to find the min
2443 * and max for all branches processed so far */
2444 if( cur == first ) {
2445 trie->minlen = minchars;
2446 trie->maxlen = maxchars;
2447 } else if (minchars < trie->minlen) {
2448 trie->minlen = minchars;
2449 } else if (maxchars > trie->maxlen) {
2450 trie->maxlen = maxchars;
2452 } /* end first pass */
2453 DEBUG_TRIE_COMPILE_r(
2454 PerlIO_printf( Perl_debug_log,
2455 "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
2456 (int)depth * 2 + 2,"",
2457 ( widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
2458 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
2459 (int)trie->minlen, (int)trie->maxlen )
2463 We now know what we are dealing with in terms of unique chars and
2464 string sizes so we can calculate how much memory a naive
2465 representation using a flat table will take. If it's over a reasonable
2466 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
2467 conservative but potentially much slower representation using an array
2470 At the end we convert both representations into the same compressed
2471 form that will be used in regexec.c for matching with. The latter
2472 is a form that cannot be used to construct with but has memory
2473 properties similar to the list form and access properties similar
2474 to the table form making it both suitable for fast searches and
2475 small enough that its feasable to store for the duration of a program.
2477 See the comment in the code where the compressed table is produced
2478 inplace from the flat tabe representation for an explanation of how
2479 the compression works.
2484 Newx(prev_states, TRIE_CHARCOUNT(trie) + 2, U32);
2487 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1)
2488 > SvIV(re_trie_maxbuff) )
2491 Second Pass -- Array Of Lists Representation
2493 Each state will be represented by a list of charid:state records
2494 (reg_trie_trans_le) the first such element holds the CUR and LEN
2495 points of the allocated array. (See defines above).
2497 We build the initial structure using the lists, and then convert
2498 it into the compressed table form which allows faster lookups
2499 (but cant be modified once converted).
2502 STRLEN transcount = 1;
2504 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
2505 "%*sCompiling trie using list compiler\n",
2506 (int)depth * 2 + 2, ""));
2508 trie->states = (reg_trie_state *)
2509 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
2510 sizeof(reg_trie_state) );
2514 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
2516 regnode *noper = NEXTOPER( cur );
2517 U8 *uc = (U8*)STRING( noper );
2518 const U8 *e = uc + STR_LEN( noper );
2519 U32 state = 1; /* required init */
2520 U16 charid = 0; /* sanity init */
2521 U32 wordlen = 0; /* required init */
2523 if (OP(noper) == NOTHING) {
2524 regnode *noper_next= regnext(noper);
2525 if (noper_next != tail && OP(noper_next) == flags) {
2527 uc= (U8*)STRING(noper);
2528 e= uc + STR_LEN(noper);
2532 if (OP(noper) != NOTHING) {
2533 for ( ; uc < e ; uc += len ) {
2538 charid = trie->charmap[ uvc ];
2540 SV** const svpp = hv_fetch( widecharmap,
2547 charid=(U16)SvIV( *svpp );
2550 /* charid is now 0 if we dont know the char read, or
2551 * nonzero if we do */
2558 if ( !trie->states[ state ].trans.list ) {
2559 TRIE_LIST_NEW( state );
2562 check <= TRIE_LIST_USED( state );
2565 if ( TRIE_LIST_ITEM( state, check ).forid
2568 newstate = TRIE_LIST_ITEM( state, check ).newstate;
2573 newstate = next_alloc++;
2574 prev_states[newstate] = state;
2575 TRIE_LIST_PUSH( state, charid, newstate );
2580 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
2584 TRIE_HANDLE_WORD(state);
2586 } /* end second pass */
2588 /* next alloc is the NEXT state to be allocated */
2589 trie->statecount = next_alloc;
2590 trie->states = (reg_trie_state *)
2591 PerlMemShared_realloc( trie->states,
2593 * sizeof(reg_trie_state) );
2595 /* and now dump it out before we compress it */
2596 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_list(trie, widecharmap,
2597 revcharmap, next_alloc,
2601 trie->trans = (reg_trie_trans *)
2602 PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) );
2609 for( state=1 ; state < next_alloc ; state ++ ) {
2613 DEBUG_TRIE_COMPILE_MORE_r(
2614 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
2618 if (trie->states[state].trans.list) {
2619 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
2623 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
2624 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
2625 if ( forid < minid ) {
2627 } else if ( forid > maxid ) {
2631 if ( transcount < tp + maxid - minid + 1) {
2633 trie->trans = (reg_trie_trans *)
2634 PerlMemShared_realloc( trie->trans,
2636 * sizeof(reg_trie_trans) );
2637 Zero( trie->trans + (transcount / 2),
2641 base = trie->uniquecharcount + tp - minid;
2642 if ( maxid == minid ) {
2644 for ( ; zp < tp ; zp++ ) {
2645 if ( ! trie->trans[ zp ].next ) {
2646 base = trie->uniquecharcount + zp - minid;
2647 trie->trans[ zp ].next = TRIE_LIST_ITEM( state,
2649 trie->trans[ zp ].check = state;
2655 trie->trans[ tp ].next = TRIE_LIST_ITEM( state,
2657 trie->trans[ tp ].check = state;
2662 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
2663 const U32 tid = base
2664 - trie->uniquecharcount
2665 + TRIE_LIST_ITEM( state, idx ).forid;
2666 trie->trans[ tid ].next = TRIE_LIST_ITEM( state,
2668 trie->trans[ tid ].check = state;
2670 tp += ( maxid - minid + 1 );
2672 Safefree(trie->states[ state ].trans.list);
2675 DEBUG_TRIE_COMPILE_MORE_r(
2676 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
2679 trie->states[ state ].trans.base=base;
2681 trie->lasttrans = tp + 1;
2685 Second Pass -- Flat Table Representation.
2687 we dont use the 0 slot of either trans[] or states[] so we add 1 to
2688 each. We know that we will need Charcount+1 trans at most to store
2689 the data (one row per char at worst case) So we preallocate both
2690 structures assuming worst case.
2692 We then construct the trie using only the .next slots of the entry
2695 We use the .check field of the first entry of the node temporarily
2696 to make compression both faster and easier by keeping track of how
2697 many non zero fields are in the node.
2699 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
2702 There are two terms at use here: state as a TRIE_NODEIDX() which is
2703 a number representing the first entry of the node, and state as a
2704 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1)
2705 and TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3)
2706 if there are 2 entrys per node. eg:
2714 The table is internally in the right hand, idx form. However as we
2715 also have to deal with the states array which is indexed by nodenum
2716 we have to use TRIE_NODENUM() to convert.
2719 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
2720 "%*sCompiling trie using table compiler\n",
2721 (int)depth * 2 + 2, ""));
2723 trie->trans = (reg_trie_trans *)
2724 PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 )
2725 * trie->uniquecharcount + 1,
2726 sizeof(reg_trie_trans) );
2727 trie->states = (reg_trie_state *)
2728 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
2729 sizeof(reg_trie_state) );
2730 next_alloc = trie->uniquecharcount + 1;
2733 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
2735 regnode *noper = NEXTOPER( cur );
2736 const U8 *uc = (U8*)STRING( noper );
2737 const U8 *e = uc + STR_LEN( noper );
2739 U32 state = 1; /* required init */
2741 U16 charid = 0; /* sanity init */
2742 U32 accept_state = 0; /* sanity init */
2744 U32 wordlen = 0; /* required init */
2746 if (OP(noper) == NOTHING) {
2747 regnode *noper_next= regnext(noper);
2748 if (noper_next != tail && OP(noper_next) == flags) {
2750 uc= (U8*)STRING(noper);
2751 e= uc + STR_LEN(noper);
2755 if ( OP(noper) != NOTHING ) {
2756 for ( ; uc < e ; uc += len ) {
2761 charid = trie->charmap[ uvc ];
2763 SV* const * const svpp = hv_fetch( widecharmap,
2767 charid = svpp ? (U16)SvIV(*svpp) : 0;
2771 if ( !trie->trans[ state + charid ].next ) {
2772 trie->trans[ state + charid ].next = next_alloc;
2773 trie->trans[ state ].check++;
2774 prev_states[TRIE_NODENUM(next_alloc)]
2775 = TRIE_NODENUM(state);
2776 next_alloc += trie->uniquecharcount;
2778 state = trie->trans[ state + charid ].next;
2780 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
2782 /* charid is now 0 if we dont know the char read, or
2783 * nonzero if we do */
2786 accept_state = TRIE_NODENUM( state );
2787 TRIE_HANDLE_WORD(accept_state);
2789 } /* end second pass */
2791 /* and now dump it out before we compress it */
2792 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_table(trie, widecharmap,
2794 next_alloc, depth+1));
2798 * Inplace compress the table.*
2800 For sparse data sets the table constructed by the trie algorithm will
2801 be mostly 0/FAIL transitions or to put it another way mostly empty.
2802 (Note that leaf nodes will not contain any transitions.)
2804 This algorithm compresses the tables by eliminating most such
2805 transitions, at the cost of a modest bit of extra work during lookup:
2807 - Each states[] entry contains a .base field which indicates the
2808 index in the state[] array wheres its transition data is stored.
2810 - If .base is 0 there are no valid transitions from that node.
2812 - If .base is nonzero then charid is added to it to find an entry in
2815 -If trans[states[state].base+charid].check!=state then the
2816 transition is taken to be a 0/Fail transition. Thus if there are fail
2817 transitions at the front of the node then the .base offset will point
2818 somewhere inside the previous nodes data (or maybe even into a node
2819 even earlier), but the .check field determines if the transition is
2823 The following process inplace converts the table to the compressed
2824 table: We first do not compress the root node 1,and mark all its
2825 .check pointers as 1 and set its .base pointer as 1 as well. This
2826 allows us to do a DFA construction from the compressed table later,
2827 and ensures that any .base pointers we calculate later are greater
2830 - We set 'pos' to indicate the first entry of the second node.
2832 - We then iterate over the columns of the node, finding the first and
2833 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
2834 and set the .check pointers accordingly, and advance pos
2835 appropriately and repreat for the next node. Note that when we copy
2836 the next pointers we have to convert them from the original
2837 NODEIDX form to NODENUM form as the former is not valid post
2840 - If a node has no transitions used we mark its base as 0 and do not
2841 advance the pos pointer.
2843 - If a node only has one transition we use a second pointer into the
2844 structure to fill in allocated fail transitions from other states.
2845 This pointer is independent of the main pointer and scans forward
2846 looking for null transitions that are allocated to a state. When it
2847 finds one it writes the single transition into the "hole". If the
2848 pointer doesnt find one the single transition is appended as normal.
2850 - Once compressed we can Renew/realloc the structures to release the
2853 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
2854 specifically Fig 3.47 and the associated pseudocode.
2858 const U32 laststate = TRIE_NODENUM( next_alloc );
2861 trie->statecount = laststate;
2863 for ( state = 1 ; state < laststate ; state++ ) {
2865 const U32 stateidx = TRIE_NODEIDX( state );
2866 const U32 o_used = trie->trans[ stateidx ].check;
2867 U32 used = trie->trans[ stateidx ].check;
2868 trie->trans[ stateidx ].check = 0;
2871 used && charid < trie->uniquecharcount;
2874 if ( flag || trie->trans[ stateidx + charid ].next ) {
2875 if ( trie->trans[ stateidx + charid ].next ) {
2877 for ( ; zp < pos ; zp++ ) {
2878 if ( ! trie->trans[ zp ].next ) {
2882 trie->states[ state ].trans.base
2884 + trie->uniquecharcount
2886 trie->trans[ zp ].next
2887 = SAFE_TRIE_NODENUM( trie->trans[ stateidx
2889 trie->trans[ zp ].check = state;
2890 if ( ++zp > pos ) pos = zp;
2897 trie->states[ state ].trans.base
2898 = pos + trie->uniquecharcount - charid ;
2900 trie->trans[ pos ].next
2901 = SAFE_TRIE_NODENUM(
2902 trie->trans[ stateidx + charid ].next );
2903 trie->trans[ pos ].check = state;
2908 trie->lasttrans = pos + 1;
2909 trie->states = (reg_trie_state *)
2910 PerlMemShared_realloc( trie->states, laststate
2911 * sizeof(reg_trie_state) );
2912 DEBUG_TRIE_COMPILE_MORE_r(
2913 PerlIO_printf( Perl_debug_log,
2914 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
2915 (int)depth * 2 + 2,"",
2916 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount
2920 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
2923 } /* end table compress */
2925 DEBUG_TRIE_COMPILE_MORE_r(
2926 PerlIO_printf(Perl_debug_log,
2927 "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n",
2928 (int)depth * 2 + 2, "",
2929 (UV)trie->statecount,
2930 (UV)trie->lasttrans)
2932 /* resize the trans array to remove unused space */
2933 trie->trans = (reg_trie_trans *)
2934 PerlMemShared_realloc( trie->trans, trie->lasttrans
2935 * sizeof(reg_trie_trans) );
2937 { /* Modify the program and insert the new TRIE node */
2938 U8 nodetype =(U8)(flags & 0xFF);
2942 regnode *optimize = NULL;
2943 #ifdef RE_TRACK_PATTERN_OFFSETS
2946 U32 mjd_nodelen = 0;
2947 #endif /* RE_TRACK_PATTERN_OFFSETS */
2948 #endif /* DEBUGGING */
2950 This means we convert either the first branch or the first Exact,
2951 depending on whether the thing following (in 'last') is a branch
2952 or not and whther first is the startbranch (ie is it a sub part of
2953 the alternation or is it the whole thing.)
2954 Assuming its a sub part we convert the EXACT otherwise we convert
2955 the whole branch sequence, including the first.
2957 /* Find the node we are going to overwrite */
2958 if ( first != startbranch || OP( last ) == BRANCH ) {
2959 /* branch sub-chain */
2960 NEXT_OFF( first ) = (U16)(last - first);
2961 #ifdef RE_TRACK_PATTERN_OFFSETS
2963 mjd_offset= Node_Offset((convert));
2964 mjd_nodelen= Node_Length((convert));
2967 /* whole branch chain */
2969 #ifdef RE_TRACK_PATTERN_OFFSETS
2972 const regnode *nop = NEXTOPER( convert );
2973 mjd_offset= Node_Offset((nop));
2974 mjd_nodelen= Node_Length((nop));
2978 PerlIO_printf(Perl_debug_log,
2979 "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
2980 (int)depth * 2 + 2, "",
2981 (UV)mjd_offset, (UV)mjd_nodelen)
2984 /* But first we check to see if there is a common prefix we can
2985 split out as an EXACT and put in front of the TRIE node. */
2986 trie->startstate= 1;
2987 if ( trie->bitmap && !widecharmap && !trie->jump ) {
2989 for ( state = 1 ; state < trie->statecount-1 ; state++ ) {
2993 const U32 base = trie->states[ state ].trans.base;
2995 if ( trie->states[state].wordnum )
2998 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
2999 if ( ( base + ofs >= trie->uniquecharcount ) &&
3000 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
3001 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
3003 if ( ++count > 1 ) {
3004 SV **tmp = av_fetch( revcharmap, ofs, 0);
3005 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
3006 if ( state == 1 ) break;
3008 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
3010 PerlIO_printf(Perl_debug_log,
3011 "%*sNew Start State=%"UVuf" Class: [",
3012 (int)depth * 2 + 2, "",
3015 SV ** const tmp = av_fetch( revcharmap, idx, 0);
3016 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
3018 TRIE_BITMAP_SET(trie,*ch);
3020 TRIE_BITMAP_SET(trie, folder[ *ch ]);
3022 PerlIO_printf(Perl_debug_log, "%s", (char*)ch)
3026 TRIE_BITMAP_SET(trie,*ch);
3028 TRIE_BITMAP_SET(trie,folder[ *ch ]);
3029 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
3035 SV **tmp = av_fetch( revcharmap, idx, 0);
3037 char *ch = SvPV( *tmp, len );
3039 SV *sv=sv_newmortal();
3040 PerlIO_printf( Perl_debug_log,
3041 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
3042 (int)depth * 2 + 2, "",
3044 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6,
3045 PL_colors[0], PL_colors[1],
3046 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
3047 PERL_PV_ESCAPE_FIRSTCHAR
3052 OP( convert ) = nodetype;
3053 str=STRING(convert);
3056 STR_LEN(convert) += len;
3062 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
3067 trie->prefixlen = (state-1);
3069 regnode *n = convert+NODE_SZ_STR(convert);
3070 NEXT_OFF(convert) = NODE_SZ_STR(convert);
3071 trie->startstate = state;
3072 trie->minlen -= (state - 1);
3073 trie->maxlen -= (state - 1);
3075 /* At least the UNICOS C compiler choked on this
3076 * being argument to DEBUG_r(), so let's just have
3079 #ifdef PERL_EXT_RE_BUILD
3085 regnode *fix = convert;
3086 U32 word = trie->wordcount;
3088 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
3089 while( ++fix < n ) {
3090 Set_Node_Offset_Length(fix, 0, 0);
3093 SV ** const tmp = av_fetch( trie_words, word, 0 );
3095 if ( STR_LEN(convert) <= SvCUR(*tmp) )
3096 sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert));
3098 sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp));
3106 NEXT_OFF(convert) = (U16)(tail - convert);
3107 DEBUG_r(optimize= n);
3113 if ( trie->maxlen ) {
3114 NEXT_OFF( convert ) = (U16)(tail - convert);
3115 ARG_SET( convert, data_slot );
3116 /* Store the offset to the first unabsorbed branch in
3117 jump[0], which is otherwise unused by the jump logic.
3118 We use this when dumping a trie and during optimisation. */
3120 trie->jump[0] = (U16)(nextbranch - convert);
3122 /* If the start state is not accepting (meaning there is no empty string/NOTHING)
3123 * and there is a bitmap
3124 * and the first "jump target" node we found leaves enough room
3125 * then convert the TRIE node into a TRIEC node, with the bitmap
3126 * embedded inline in the opcode - this is hypothetically faster.
3128 if ( !trie->states[trie->startstate].wordnum
3130 && ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
3132 OP( convert ) = TRIEC;
3133 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
3134 PerlMemShared_free(trie->bitmap);
3137 OP( convert ) = TRIE;
3139 /* store the type in the flags */
3140 convert->flags = nodetype;
3144 + regarglen[ OP( convert ) ];
3146 /* XXX We really should free up the resource in trie now,
3147 as we won't use them - (which resources?) dmq */
3149 /* needed for dumping*/
3150 DEBUG_r(if (optimize) {
3151 regnode *opt = convert;
3153 while ( ++opt < optimize) {
3154 Set_Node_Offset_Length(opt,0,0);
3157 Try to clean up some of the debris left after the
3160 while( optimize < jumper ) {
3161 mjd_nodelen += Node_Length((optimize));
3162 OP( optimize ) = OPTIMIZED;
3163 Set_Node_Offset_Length(optimize,0,0);
3166 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
3168 } /* end node insert */
3170 /* Finish populating the prev field of the wordinfo array. Walk back
3171 * from each accept state until we find another accept state, and if
3172 * so, point the first word's .prev field at the second word. If the
3173 * second already has a .prev field set, stop now. This will be the
3174 * case either if we've already processed that word's accept state,
3175 * or that state had multiple words, and the overspill words were
3176 * already linked up earlier.
3183 for (word=1; word <= trie->wordcount; word++) {
3185 if (trie->wordinfo[word].prev)
3187 state = trie->wordinfo[word].accept;
3189 state = prev_states[state];
3192 prev = trie->states[state].wordnum;
3196 trie->wordinfo[word].prev = prev;
3198 Safefree(prev_states);
3202 /* and now dump out the compressed format */
3203 DEBUG_TRIE_COMPILE_r(dump_trie(trie, widecharmap, revcharmap, depth+1));
3205 RExC_rxi->data->data[ data_slot + 1 ] = (void*)widecharmap;
3207 RExC_rxi->data->data[ data_slot + TRIE_WORDS_OFFSET ] = (void*)trie_words;
3208 RExC_rxi->data->data[ data_slot + 3 ] = (void*)revcharmap;
3210 SvREFCNT_dec_NN(revcharmap);
3214 : trie->startstate>1
3220 S_construct_ahocorasick_from_trie(pTHX_ RExC_state_t *pRExC_state, regnode *source, U32 depth)
3222 /* The Trie is constructed and compressed now so we can build a fail array if
3225 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and
3227 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi,
3231 We find the fail state for each state in the trie, this state is the longest
3232 proper suffix of the current state's 'word' that is also a proper prefix of
3233 another word in our trie. State 1 represents the word '' and is thus the
3234 default fail state. This allows the DFA not to have to restart after its
3235 tried and failed a word at a given point, it simply continues as though it
3236 had been matching the other word in the first place.
3238 'abcdgu'=~/abcdefg|cdgu/
3239 When we get to 'd' we are still matching the first word, we would encounter
3240 'g' which would fail, which would bring us to the state representing 'd' in
3241 the second word where we would try 'g' and succeed, proceeding to match
3244 /* add a fail transition */
3245 const U32 trie_offset = ARG(source);
3246 reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[trie_offset];
3248 const U32 ucharcount = trie->uniquecharcount;
3249 const U32 numstates = trie->statecount;
3250 const U32 ubound = trie->lasttrans + ucharcount;
3254 U32 base = trie->states[ 1 ].trans.base;
3257 const U32 data_slot = add_data( pRExC_state, STR_WITH_LEN("T"));
3259 GET_RE_DEBUG_FLAGS_DECL;
3261 PERL_ARGS_ASSERT_CONSTRUCT_AHOCORASICK_FROM_TRIE;
3262 PERL_UNUSED_CONTEXT;
3264 PERL_UNUSED_ARG(depth);
3267 if ( OP(source) == TRIE ) {
3268 struct regnode_1 *op = (struct regnode_1 *)
3269 PerlMemShared_calloc(1, sizeof(struct regnode_1));
3270 StructCopy(source,op,struct regnode_1);
3271 stclass = (regnode *)op;
3273 struct regnode_charclass *op = (struct regnode_charclass *)
3274 PerlMemShared_calloc(1, sizeof(struct regnode_charclass));
3275 StructCopy(source,op,struct regnode_charclass);
3276 stclass = (regnode *)op;
3278 OP(stclass)+=2; /* convert the TRIE type to its AHO-CORASICK equivalent */
3280 ARG_SET( stclass, data_slot );
3281 aho = (reg_ac_data *) PerlMemShared_calloc( 1, sizeof(reg_ac_data) );
3282 RExC_rxi->data->data[ data_slot ] = (void*)aho;
3283 aho->trie=trie_offset;
3284 aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) );
3285 Copy( trie->states, aho->states, numstates, reg_trie_state );
3286 Newxz( q, numstates, U32);
3287 aho->fail = (U32 *) PerlMemShared_calloc( numstates, sizeof(U32) );
3290 /* initialize fail[0..1] to be 1 so that we always have
3291 a valid final fail state */
3292 fail[ 0 ] = fail[ 1 ] = 1;
3294 for ( charid = 0; charid < ucharcount ; charid++ ) {
3295 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
3297 q[ q_write ] = newstate;
3298 /* set to point at the root */
3299 fail[ q[ q_write++ ] ]=1;
3302 while ( q_read < q_write) {
3303 const U32 cur = q[ q_read++ % numstates ];
3304 base = trie->states[ cur ].trans.base;
3306 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
3307 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
3309 U32 fail_state = cur;
3312 fail_state = fail[ fail_state ];
3313 fail_base = aho->states[ fail_state ].trans.base;
3314 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
3316 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
3317 fail[ ch_state ] = fail_state;
3318 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
3320 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
3322 q[ q_write++ % numstates] = ch_state;
3326 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
3327 when we fail in state 1, this allows us to use the
3328 charclass scan to find a valid start char. This is based on the principle
3329 that theres a good chance the string being searched contains lots of stuff
3330 that cant be a start char.
3332 fail[ 0 ] = fail[ 1 ] = 0;
3333 DEBUG_TRIE_COMPILE_r({
3334 PerlIO_printf(Perl_debug_log,
3335 "%*sStclass Failtable (%"UVuf" states): 0",
3336 (int)(depth * 2), "", (UV)numstates
3338 for( q_read=1; q_read<numstates; q_read++ ) {
3339 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
3341 PerlIO_printf(Perl_debug_log, "\n");
3344 /*RExC_seen |= REG_TRIEDFA_SEEN;*/
3349 #define DEBUG_PEEP(str,scan,depth) \
3350 DEBUG_OPTIMISE_r({if (scan){ \
3351 regnode *Next = regnext(scan); \
3352 regprop(RExC_rx, RExC_mysv, scan, NULL, pRExC_state); \
3353 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)", \
3354 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(RExC_mysv),\
3355 Next ? (REG_NODE_NUM(Next)) : 0 ); \
3356 DEBUG_SHOW_STUDY_FLAGS(flags," [ ","]");\
3357 PerlIO_printf(Perl_debug_log, "\n"); \
3360 /* The below joins as many adjacent EXACTish nodes as possible into a single
3361 * one. The regop may be changed if the node(s) contain certain sequences that
3362 * require special handling. The joining is only done if:
3363 * 1) there is room in the current conglomerated node to entirely contain the
3365 * 2) they are the exact same node type
3367 * The adjacent nodes actually may be separated by NOTHING-kind nodes, and
3368 * these get optimized out
3370 * If a node is to match under /i (folded), the number of characters it matches
3371 * can be different than its character length if it contains a multi-character
3372 * fold. *min_subtract is set to the total delta number of characters of the
3375 * And *unfolded_multi_char is set to indicate whether or not the node contains
3376 * an unfolded multi-char fold. This happens when whether the fold is valid or
3377 * not won't be known until runtime; namely for EXACTF nodes that contain LATIN
3378 * SMALL LETTER SHARP S, as only if the target string being matched against
3379 * turns out to be UTF-8 is that fold valid; and also for EXACTFL nodes whose
3380 * folding rules depend on the locale in force at runtime. (Multi-char folds
3381 * whose components are all above the Latin1 range are not run-time locale
3382 * dependent, and have already been folded by the time this function is
3385 * This is as good a place as any to discuss the design of handling these
3386 * multi-character fold sequences. It's been wrong in Perl for a very long
3387 * time. There are three code points in Unicode whose multi-character folds
3388 * were long ago discovered to mess things up. The previous designs for
3389 * dealing with these involved assigning a special node for them. This
3390 * approach doesn't always work, as evidenced by this example:
3391 * "\xDFs" =~ /s\xDF/ui # Used to fail before these patches
3392 * Both sides fold to "sss", but if the pattern is parsed to create a node that
3393 * would match just the \xDF, it won't be able to handle the case where a
3394 * successful match would have to cross the node's boundary. The new approach
3395 * that hopefully generally solves the problem generates an EXACTFU_SS node
3396 * that is "sss" in this case.
3398 * It turns out that there are problems with all multi-character folds, and not
3399 * just these three. Now the code is general, for all such cases. The
3400 * approach taken is:
3401 * 1) This routine examines each EXACTFish node that could contain multi-
3402 * character folded sequences. Since a single character can fold into
3403 * such a sequence, the minimum match length for this node is less than
3404 * the number of characters in the node. This routine returns in
3405 * *min_subtract how many characters to subtract from the the actual
3406 * length of the string to get a real minimum match length; it is 0 if
3407 * there are no multi-char foldeds. This delta is used by the caller to
3408 * adjust the min length of the match, and the delta between min and max,
3409 * so that the optimizer doesn't reject these possibilities based on size
3411 * 2) For the sequence involving the Sharp s (\xDF), the node type EXACTFU_SS
3412 * is used for an EXACTFU node that contains at least one "ss" sequence in
3413 * it. For non-UTF-8 patterns and strings, this is the only case where
3414 * there is a possible fold length change. That means that a regular
3415 * EXACTFU node without UTF-8 involvement doesn't have to concern itself
3416 * with length changes, and so can be processed faster. regexec.c takes
3417 * advantage of this. Generally, an EXACTFish node that is in UTF-8 is
3418 * pre-folded by regcomp.c (except EXACTFL, some of whose folds aren't
3419 * known until runtime). This saves effort in regex matching. However,
3420 * the pre-folding isn't done for non-UTF8 patterns because the fold of
3421 * the MICRO SIGN requires UTF-8, and we don't want to slow things down by
3422 * forcing the pattern into UTF8 unless necessary. Also what EXACTF (and,
3423 * again, EXACTFL) nodes fold to isn't known until runtime. The fold
3424 * possibilities for the non-UTF8 patterns are quite simple, except for
3425 * the sharp s. All the ones that don't involve a UTF-8 target string are
3426 * members of a fold-pair, and arrays are set up for all of them so that
3427 * the other member of the pair can be found quickly. Code elsewhere in
3428 * this file makes sure that in EXACTFU nodes, the sharp s gets folded to
3429 * 'ss', even if the pattern isn't UTF-8. This avoids the issues
3430 * described in the next item.
3431 * 3) A problem remains for unfolded multi-char folds. (These occur when the
3432 * validity of the fold won't be known until runtime, and so must remain
3433 * unfolded for now. This happens for the sharp s in EXACTF and EXACTFA
3434 * nodes when the pattern isn't in UTF-8. (Note, BTW, that there cannot
3435 * be an EXACTF node with a UTF-8 pattern.) They also occur for various
3436 * folds in EXACTFL nodes, regardless of the UTF-ness of the pattern.)
3437 * The reason this is a problem is that the optimizer part of regexec.c
3438 * (probably unwittingly, in Perl_regexec_flags()) makes an assumption
3439 * that a character in the pattern corresponds to at most a single
3440 * character in the target string. (And I do mean character, and not byte
3441 * here, unlike other parts of the documentation that have never been
3442 * updated to account for multibyte Unicode.) sharp s in EXACTF and
3443 * EXACTFL nodes can match the two character string 'ss'; in EXACTFA nodes
3444 * it can match "\x{17F}\x{17F}". These, along with other ones in EXACTFL
3445 * nodes, violate the assumption, and they are the only instances where it
3446 * is violated. I'm reluctant to try to change the assumption, as the
3447 * code involved is impenetrable to me (khw), so instead the code here
3448 * punts. This routine examines EXACTFL nodes, and (when the pattern
3449 * isn't UTF-8) EXACTF and EXACTFA for such unfolded folds, and returns a
3450 * boolean indicating whether or not the node contains such a fold. When
3451 * it is true, the caller sets a flag that later causes the optimizer in
3452 * this file to not set values for the floating and fixed string lengths,
3453 * and thus avoids the optimizer code in regexec.c that makes the invalid
3454 * assumption. Thus, there is no optimization based on string lengths for
3455 * EXACTFL nodes that contain these few folds, nor for non-UTF8-pattern
3456 * EXACTF and EXACTFA nodes that contain the sharp s. (The reason the
3457 * assumption is wrong only in these cases is that all other non-UTF-8
3458 * folds are 1-1; and, for UTF-8 patterns, we pre-fold all other folds to
3459 * their expanded versions. (Again, we can't prefold sharp s to 'ss' in
3460 * EXACTF nodes because we don't know at compile time if it actually
3461 * matches 'ss' or not. For EXACTF nodes it will match iff the target
3462 * string is in UTF-8. This is in contrast to EXACTFU nodes, where it
3463 * always matches; and EXACTFA where it never does. In an EXACTFA node in
3464 * a UTF-8 pattern, sharp s is folded to "\x{17F}\x{17F}, avoiding the
3465 * problem; but in a non-UTF8 pattern, folding it to that above-Latin1
3466 * string would require the pattern to be forced into UTF-8, the overhead
3467 * of which we want to avoid. Similarly the unfolded multi-char folds in
3468 * EXACTFL nodes will match iff the locale at the time of match is a UTF-8
3471 * Similarly, the code that generates tries doesn't currently handle
3472 * not-already-folded multi-char folds, and it looks like a pain to change
3473 * that. Therefore, trie generation of EXACTFA nodes with the sharp s
3474 * doesn't work. Instead, such an EXACTFA is turned into a new regnode,
3475 * EXACTFA_NO_TRIE, which the trie code knows not to handle. Most people
3476 * using /iaa matching will be doing so almost entirely with ASCII
3477 * strings, so this should rarely be encountered in practice */
3479 #define JOIN_EXACT(scan,min_subtract,unfolded_multi_char, flags) \
3480 if (PL_regkind[OP(scan)] == EXACT) \
3481 join_exact(pRExC_state,(scan),(min_subtract),unfolded_multi_char, (flags),NULL,depth+1)
3484 S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan,
3485 UV *min_subtract, bool *unfolded_multi_char,
3486 U32 flags,regnode *val, U32 depth)
3488 /* Merge several consecutive EXACTish nodes into one. */
3489 regnode *n = regnext(scan);
3491 regnode *next = scan + NODE_SZ_STR(scan);
3495 regnode *stop = scan;
3496 GET_RE_DEBUG_FLAGS_DECL;
3498 PERL_UNUSED_ARG(depth);
3501 PERL_ARGS_ASSERT_JOIN_EXACT;
3502 #ifndef EXPERIMENTAL_INPLACESCAN
3503 PERL_UNUSED_ARG(flags);
3504 PERL_UNUSED_ARG(val);
3506 DEBUG_PEEP("join",scan,depth);
3508 /* Look through the subsequent nodes in the chain. Skip NOTHING, merge
3509 * EXACT ones that are mergeable to the current one. */
3511 && (PL_regkind[OP(n)] == NOTHING
3512 || (stringok && OP(n) == OP(scan)))
3514 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX)
3517 if (OP(n) == TAIL || n > next)
3519 if (PL_regkind[OP(n)] == NOTHING) {
3520 DEBUG_PEEP("skip:",n,depth);
3521 NEXT_OFF(scan) += NEXT_OFF(n);
3522 next = n + NODE_STEP_REGNODE;
3529 else if (stringok) {
3530 const unsigned int oldl = STR_LEN(scan);
3531 regnode * const nnext = regnext(n);
3533 /* XXX I (khw) kind of doubt that this works on platforms (should
3534 * Perl ever run on one) where U8_MAX is above 255 because of lots
3535 * of other assumptions */
3536 /* Don't join if the sum can't fit into a single node */
3537 if (oldl + STR_LEN(n) > U8_MAX)
3540 DEBUG_PEEP("merg",n,depth);
3543 NEXT_OFF(scan) += NEXT_OFF(n);
3544 STR_LEN(scan) += STR_LEN(n);
3545 next = n + NODE_SZ_STR(n);
3546 /* Now we can overwrite *n : */
3547 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
3555 #ifdef EXPERIMENTAL_INPLACESCAN
3556 if (flags && !NEXT_OFF(n)) {
3557 DEBUG_PEEP("atch", val, depth);
3558 if (reg_off_by_arg[OP(n)]) {
3559 ARG_SET(n, val - n);
3562 NEXT_OFF(n) = val - n;
3570 *unfolded_multi_char = FALSE;
3572 /* Here, all the adjacent mergeable EXACTish nodes have been merged. We
3573 * can now analyze for sequences of problematic code points. (Prior to
3574 * this final joining, sequences could have been split over boundaries, and
3575 * hence missed). The sequences only happen in folding, hence for any
3576 * non-EXACT EXACTish node */
3577 if (OP(scan) != EXACT && OP(scan) != EXACTL) {
3578 U8* s0 = (U8*) STRING(scan);
3580 U8* s_end = s0 + STR_LEN(scan);
3582 int total_count_delta = 0; /* Total delta number of characters that
3583 multi-char folds expand to */
3585 /* One pass is made over the node's string looking for all the
3586 * possibilities. To avoid some tests in the loop, there are two main
3587 * cases, for UTF-8 patterns (which can't have EXACTF nodes) and
3592 if (OP(scan) == EXACTFL) {
3595 /* An EXACTFL node would already have been changed to another
3596 * node type unless there is at least one character in it that
3597 * is problematic; likely a character whose fold definition
3598 * won't be known until runtime, and so has yet to be folded.
3599 * For all but the UTF-8 locale, folds are 1-1 in length, but
3600 * to handle the UTF-8 case, we need to create a temporary
3601 * folded copy using UTF-8 locale rules in order to analyze it.
3602 * This is because our macros that look to see if a sequence is
3603 * a multi-char fold assume everything is folded (otherwise the
3604 * tests in those macros would be too complicated and slow).
3605 * Note that here, the non-problematic folds will have already
3606 * been done, so we can just copy such characters. We actually
3607 * don't completely fold the EXACTFL string. We skip the
3608 * unfolded multi-char folds, as that would just create work
3609 * below to figure out the size they already are */
3611 Newx(folded, UTF8_MAX_FOLD_CHAR_EXPAND * STR_LEN(scan) + 1, U8);
3614 STRLEN s_len = UTF8SKIP(s);
3615 if (! is_PROBLEMATIC_LOCALE_FOLD_utf8(s)) {
3616 Copy(s, d, s_len, U8);
3619 else if (is_FOLDS_TO_MULTI_utf8(s)) {
3620 *unfolded_multi_char = TRUE;
3621 Copy(s, d, s_len, U8);
3624 else if (isASCII(*s)) {
3625 *(d++) = toFOLD(*s);
3629 _to_utf8_fold_flags(s, d, &len, FOLD_FLAGS_FULL);
3635 /* Point the remainder of the routine to look at our temporary
3639 } /* End of creating folded copy of EXACTFL string */
3641 /* Examine the string for a multi-character fold sequence. UTF-8
3642 * patterns have all characters pre-folded by the time this code is
3644 while (s < s_end - 1) /* Can stop 1 before the end, as minimum
3645 length sequence we are looking for is 2 */
3647 int count = 0; /* How many characters in a multi-char fold */
3648 int len = is_MULTI_CHAR_FOLD_utf8_safe(s, s_end);
3649 if (! len) { /* Not a multi-char fold: get next char */
3654 /* Nodes with 'ss' require special handling, except for
3655 * EXACTFA-ish for which there is no multi-char fold to this */
3656 if (len == 2 && *s == 's' && *(s+1) == 's'
3657 && OP(scan) != EXACTFA
3658 && OP(scan) != EXACTFA_NO_TRIE)
3661 if (OP(scan) != EXACTFL) {
3662 OP(scan) = EXACTFU_SS;
3666 else { /* Here is a generic multi-char fold. */
3667 U8* multi_end = s + len;
3669 /* Count how many characters are in it. In the case of
3670 * /aa, no folds which contain ASCII code points are
3671 * allowed, so check for those, and skip if found. */
3672 if (OP(scan) != EXACTFA && OP(scan) != EXACTFA_NO_TRIE) {
3673 count = utf8_length(s, multi_end);
3677 while (s < multi_end) {
3680 goto next_iteration;
3690 /* The delta is how long the sequence is minus 1 (1 is how long
3691 * the character that folds to the sequence is) */
3692 total_count_delta += count - 1;
3696 /* We created a temporary folded copy of the string in EXACTFL
3697 * nodes. Therefore we need to be sure it doesn't go below zero,
3698 * as the real string could be shorter */
3699 if (OP(scan) == EXACTFL) {
3700 int total_chars = utf8_length((U8*) STRING(scan),
3701 (U8*) STRING(scan) + STR_LEN(scan));
3702 if (total_count_delta > total_chars) {
3703 total_count_delta = total_chars;
3707 *min_subtract += total_count_delta;
3710 else if (OP(scan) == EXACTFA) {
3712 /* Non-UTF-8 pattern, EXACTFA node. There can't be a multi-char
3713 * fold to the ASCII range (and there are no existing ones in the
3714 * upper latin1 range). But, as outlined in the comments preceding
3715 * this function, we need to flag any occurrences of the sharp s.
3716 * This character forbids trie formation (because of added
3718 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
3719 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
3720 || UNICODE_DOT_DOT_VERSION > 0)
3722 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
3723 OP(scan) = EXACTFA_NO_TRIE;
3724 *unfolded_multi_char = TRUE;
3732 /* Non-UTF-8 pattern, not EXACTFA node. Look for the multi-char
3733 * folds that are all Latin1. As explained in the comments
3734 * preceding this function, we look also for the sharp s in EXACTF
3735 * and EXACTFL nodes; it can be in the final position. Otherwise
3736 * we can stop looking 1 byte earlier because have to find at least
3737 * two characters for a multi-fold */
3738 const U8* upper = (OP(scan) == EXACTF || OP(scan) == EXACTFL)
3743 int len = is_MULTI_CHAR_FOLD_latin1_safe(s, s_end);
3744 if (! len) { /* Not a multi-char fold. */
3745 if (*s == LATIN_SMALL_LETTER_SHARP_S
3746 && (OP(scan) == EXACTF || OP(scan) == EXACTFL))
3748 *unfolded_multi_char = TRUE;
3755 && isALPHA_FOLD_EQ(*s, 's')
3756 && isALPHA_FOLD_EQ(*(s+1), 's'))
3759 /* EXACTF nodes need to know that the minimum length
3760 * changed so that a sharp s in the string can match this
3761 * ss in the pattern, but they remain EXACTF nodes, as they
3762 * won't match this unless the target string is is UTF-8,
3763 * which we don't know until runtime. EXACTFL nodes can't
3764 * transform into EXACTFU nodes */
3765 if (OP(scan) != EXACTF && OP(scan) != EXACTFL) {
3766 OP(scan) = EXACTFU_SS;
3770 *min_subtract += len - 1;
3778 /* Allow dumping but overwriting the collection of skipped
3779 * ops and/or strings with fake optimized ops */
3780 n = scan + NODE_SZ_STR(scan);
3788 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
3792 /* REx optimizer. Converts nodes into quicker variants "in place".
3793 Finds fixed substrings. */
3795 /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
3796 to the position after last scanned or to NULL. */
3798 #define INIT_AND_WITHP \
3799 assert(!and_withp); \
3800 Newx(and_withp,1, regnode_ssc); \
3801 SAVEFREEPV(and_withp)
3805 S_unwind_scan_frames(pTHX_ const void *p)
3807 scan_frame *f= (scan_frame *)p;
3809 scan_frame *n= f->next_frame;
3817 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
3818 SSize_t *minlenp, SSize_t *deltap,
3823 regnode_ssc *and_withp,
3824 U32 flags, U32 depth)
3825 /* scanp: Start here (read-write). */
3826 /* deltap: Write maxlen-minlen here. */
3827 /* last: Stop before this one. */
3828 /* data: string data about the pattern */
3829 /* stopparen: treat close N as END */
3830 /* recursed: which subroutines have we recursed into */
3831 /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */
3833 /* There must be at least this number of characters to match */
3836 regnode *scan = *scanp, *next;
3838 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
3839 int is_inf_internal = 0; /* The studied chunk is infinite */
3840 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
3841 scan_data_t data_fake;
3842 SV *re_trie_maxbuff = NULL;
3843 regnode *first_non_open = scan;
3844 SSize_t stopmin = SSize_t_MAX;
3845 scan_frame *frame = NULL;
3846 GET_RE_DEBUG_FLAGS_DECL;
3848 PERL_ARGS_ASSERT_STUDY_CHUNK;
3852 while (first_non_open && OP(first_non_open) == OPEN)
3853 first_non_open=regnext(first_non_open);
3859 RExC_study_chunk_recursed_count++;
3861 DEBUG_OPTIMISE_MORE_r(
3863 PerlIO_printf(Perl_debug_log,
3864 "%*sstudy_chunk stopparen=%ld recursed_count=%lu depth=%lu recursed_depth=%lu scan=%p last=%p",
3865 (int)(depth*2), "", (long)stopparen,
3866 (unsigned long)RExC_study_chunk_recursed_count,
3867 (unsigned long)depth, (unsigned long)recursed_depth,
3870 if (recursed_depth) {
3873 for ( j = 0 ; j < recursed_depth ; j++ ) {
3874 for ( i = 0 ; i < (U32)RExC_npar ; i++ ) {
3876 PAREN_TEST(RExC_study_chunk_recursed +
3877 ( j * RExC_study_chunk_recursed_bytes), i )
3880 !PAREN_TEST(RExC_study_chunk_recursed +
3881 (( j - 1 ) * RExC_study_chunk_recursed_bytes), i)
3884 PerlIO_printf(Perl_debug_log," %d",(int)i);
3888 if ( j + 1 < recursed_depth ) {
3889 PerlIO_printf(Perl_debug_log, ",");
3893 PerlIO_printf(Perl_debug_log,"\n");
3896 while ( scan && OP(scan) != END && scan < last ){
3897 UV min_subtract = 0; /* How mmany chars to subtract from the minimum
3898 node length to get a real minimum (because
3899 the folded version may be shorter) */
3900 bool unfolded_multi_char = FALSE;
3901 /* Peephole optimizer: */
3902 DEBUG_STUDYDATA("Peep:", data, depth);
3903 DEBUG_PEEP("Peep", scan, depth);
3906 /* The reason we do this here we need to deal with things like /(?:f)(?:o)(?:o)/
3907 * which cant be dealt with by the normal EXACT parsing code, as each (?:..) is handled
3908 * by a different invocation of reg() -- Yves
3910 JOIN_EXACT(scan,&min_subtract, &unfolded_multi_char, 0);
3912 /* Follow the next-chain of the current node and optimize
3913 away all the NOTHINGs from it. */
3914 if (OP(scan) != CURLYX) {
3915 const int max = (reg_off_by_arg[OP(scan)]
3917 /* I32 may be smaller than U16 on CRAYs! */
3918 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
3919 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
3923 /* Skip NOTHING and LONGJMP. */
3924 while ((n = regnext(n))
3925 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
3926 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
3927 && off + noff < max)
3929 if (reg_off_by_arg[OP(scan)])
3932 NEXT_OFF(scan) = off;
3935 /* The principal pseudo-switch. Cannot be a switch, since we
3936 look into several different things. */
3937 if ( OP(scan) == DEFINEP ) {
3939 SSize_t deltanext = 0;
3940 SSize_t fake_last_close = 0;
3941 I32 f = SCF_IN_DEFINE;
3943 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
3944 scan = regnext(scan);
3945 assert( OP(scan) == IFTHEN );
3946 DEBUG_PEEP("expect IFTHEN", scan, depth);
3948 data_fake.last_closep= &fake_last_close;
3950 next = regnext(scan);
3951 scan = NEXTOPER(NEXTOPER(scan));
3952 DEBUG_PEEP("scan", scan, depth);
3953 DEBUG_PEEP("next", next, depth);
3955 /* we suppose the run is continuous, last=next...
3956 * NOTE we dont use the return here! */
3957 (void)study_chunk(pRExC_state, &scan, &minlen,
3958 &deltanext, next, &data_fake, stopparen,
3959 recursed_depth, NULL, f, depth+1);
3964 OP(scan) == BRANCH ||
3965 OP(scan) == BRANCHJ ||
3968 next = regnext(scan);
https://perl5.git.perl.org / perl5.git / blob