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
88 #include "dquote_static.c"
95 # if defined(BUGGY_MSC6)
96 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
97 # pragma optimize("a",off)
98 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
99 # pragma optimize("w",on )
100 # endif /* BUGGY_MSC6 */
104 #define STATIC static
107 typedef struct RExC_state_t {
108 U32 flags; /* are we folding, multilining? */
109 char *precomp; /* uncompiled string. */
110 REGEXP *rx_sv; /* The SV that is the regexp. */
111 regexp *rx; /* perl core regexp structure */
112 regexp_internal *rxi; /* internal data for regexp object pprivate field */
113 char *start; /* Start of input for compile */
114 char *end; /* End of input for compile */
115 char *parse; /* Input-scan pointer. */
116 I32 whilem_seen; /* number of WHILEM in this expr */
117 regnode *emit_start; /* Start of emitted-code area */
118 regnode *emit_bound; /* First regnode outside of the allocated space */
119 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
120 I32 naughty; /* How bad is this pattern? */
121 I32 sawback; /* Did we see \1, ...? */
123 I32 size; /* Code size. */
124 I32 npar; /* Capture buffer count, (OPEN). */
125 I32 cpar; /* Capture buffer count, (CLOSE). */
126 I32 nestroot; /* root parens we are in - used by accept */
130 regnode **open_parens; /* pointers to open parens */
131 regnode **close_parens; /* pointers to close parens */
132 regnode *opend; /* END node in program */
133 I32 utf8; /* whether the pattern is utf8 or not */
134 I32 orig_utf8; /* whether the pattern was originally in utf8 */
135 /* XXX use this for future optimisation of case
136 * where pattern must be upgraded to utf8. */
137 HV *paren_names; /* Paren names */
139 regnode **recurse; /* Recurse regops */
140 I32 recurse_count; /* Number of recurse regops */
142 char *starttry; /* -Dr: where regtry was called. */
143 #define RExC_starttry (pRExC_state->starttry)
146 const char *lastparse;
148 AV *paren_name_list; /* idx -> name */
149 #define RExC_lastparse (pRExC_state->lastparse)
150 #define RExC_lastnum (pRExC_state->lastnum)
151 #define RExC_paren_name_list (pRExC_state->paren_name_list)
155 #define RExC_flags (pRExC_state->flags)
156 #define RExC_precomp (pRExC_state->precomp)
157 #define RExC_rx_sv (pRExC_state->rx_sv)
158 #define RExC_rx (pRExC_state->rx)
159 #define RExC_rxi (pRExC_state->rxi)
160 #define RExC_start (pRExC_state->start)
161 #define RExC_end (pRExC_state->end)
162 #define RExC_parse (pRExC_state->parse)
163 #define RExC_whilem_seen (pRExC_state->whilem_seen)
164 #ifdef RE_TRACK_PATTERN_OFFSETS
165 #define RExC_offsets (pRExC_state->rxi->u.offsets) /* I am not like the others */
167 #define RExC_emit (pRExC_state->emit)
168 #define RExC_emit_start (pRExC_state->emit_start)
169 #define RExC_emit_bound (pRExC_state->emit_bound)
170 #define RExC_naughty (pRExC_state->naughty)
171 #define RExC_sawback (pRExC_state->sawback)
172 #define RExC_seen (pRExC_state->seen)
173 #define RExC_size (pRExC_state->size)
174 #define RExC_npar (pRExC_state->npar)
175 #define RExC_nestroot (pRExC_state->nestroot)
176 #define RExC_extralen (pRExC_state->extralen)
177 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
178 #define RExC_seen_evals (pRExC_state->seen_evals)
179 #define RExC_utf8 (pRExC_state->utf8)
180 #define RExC_orig_utf8 (pRExC_state->orig_utf8)
181 #define RExC_open_parens (pRExC_state->open_parens)
182 #define RExC_close_parens (pRExC_state->close_parens)
183 #define RExC_opend (pRExC_state->opend)
184 #define RExC_paren_names (pRExC_state->paren_names)
185 #define RExC_recurse (pRExC_state->recurse)
186 #define RExC_recurse_count (pRExC_state->recurse_count)
189 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
190 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
191 ((*s) == '{' && regcurly(s)))
194 #undef SPSTART /* dratted cpp namespace... */
197 * Flags to be passed up and down.
199 #define WORST 0 /* Worst case. */
200 #define HASWIDTH 0x01 /* Known to match non-null strings. */
202 /* Simple enough to be STAR/PLUS operand, in an EXACT node must be a single
203 * character, and if utf8, must be invariant. */
205 #define SPSTART 0x04 /* Starts with * or +. */
206 #define TRYAGAIN 0x08 /* Weeded out a declaration. */
207 #define POSTPONED 0x10 /* (?1),(?&name), (??{...}) or similar */
209 #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
211 /* whether trie related optimizations are enabled */
212 #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
213 #define TRIE_STUDY_OPT
214 #define FULL_TRIE_STUDY
220 #define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3]
221 #define PBITVAL(paren) (1 << ((paren) & 7))
222 #define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren))
223 #define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren)
224 #define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren))
226 /* If not already in utf8, do a longjmp back to the beginning */
227 #define UTF8_LONGJMP 42 /* Choose a value not likely to ever conflict */
228 #define REQUIRE_UTF8 STMT_START { \
229 if (! UTF) JMPENV_JUMP(UTF8_LONGJMP); \
232 /* About scan_data_t.
234 During optimisation we recurse through the regexp program performing
235 various inplace (keyhole style) optimisations. In addition study_chunk
236 and scan_commit populate this data structure with information about
237 what strings MUST appear in the pattern. We look for the longest
238 string that must appear at a fixed location, and we look for the
239 longest string that may appear at a floating location. So for instance
244 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
245 strings (because they follow a .* construct). study_chunk will identify
246 both FOO and BAR as being the longest fixed and floating strings respectively.
248 The strings can be composites, for instance
252 will result in a composite fixed substring 'foo'.
254 For each string some basic information is maintained:
256 - offset or min_offset
257 This is the position the string must appear at, or not before.
258 It also implicitly (when combined with minlenp) tells us how many
259 characters must match before the string we are searching for.
260 Likewise when combined with minlenp and the length of the string it
261 tells us how many characters must appear after the string we have
265 Only used for floating strings. This is the rightmost point that
266 the string can appear at. If set to I32 max it indicates that the
267 string can occur infinitely far to the right.
270 A pointer to the minimum length of the pattern that the string
271 was found inside. This is important as in the case of positive
272 lookahead or positive lookbehind we can have multiple patterns
277 The minimum length of the pattern overall is 3, the minimum length
278 of the lookahead part is 3, but the minimum length of the part that
279 will actually match is 1. So 'FOO's minimum length is 3, but the
280 minimum length for the F is 1. This is important as the minimum length
281 is used to determine offsets in front of and behind the string being
282 looked for. Since strings can be composites this is the length of the
283 pattern at the time it was commited with a scan_commit. Note that
284 the length is calculated by study_chunk, so that the minimum lengths
285 are not known until the full pattern has been compiled, thus the
286 pointer to the value.
290 In the case of lookbehind the string being searched for can be
291 offset past the start point of the final matching string.
292 If this value was just blithely removed from the min_offset it would
293 invalidate some of the calculations for how many chars must match
294 before or after (as they are derived from min_offset and minlen and
295 the length of the string being searched for).
296 When the final pattern is compiled and the data is moved from the
297 scan_data_t structure into the regexp structure the information
298 about lookbehind is factored in, with the information that would
299 have been lost precalculated in the end_shift field for the
302 The fields pos_min and pos_delta are used to store the minimum offset
303 and the delta to the maximum offset at the current point in the pattern.
307 typedef struct scan_data_t {
308 /*I32 len_min; unused */
309 /*I32 len_delta; unused */
313 I32 last_end; /* min value, <0 unless valid. */
316 SV **longest; /* Either &l_fixed, or &l_float. */
317 SV *longest_fixed; /* longest fixed string found in pattern */
318 I32 offset_fixed; /* offset where it starts */
319 I32 *minlen_fixed; /* pointer to the minlen relevent to the string */
320 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
321 SV *longest_float; /* longest floating string found in pattern */
322 I32 offset_float_min; /* earliest point in string it can appear */
323 I32 offset_float_max; /* latest point in string it can appear */
324 I32 *minlen_float; /* pointer to the minlen relevent to the string */
325 I32 lookbehind_float; /* is the position of the string modified by LB */
329 struct regnode_charclass_class *start_class;
333 * Forward declarations for pregcomp()'s friends.
336 static const scan_data_t zero_scan_data =
337 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
339 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
340 #define SF_BEFORE_SEOL 0x0001
341 #define SF_BEFORE_MEOL 0x0002
342 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
343 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
346 # define SF_FIX_SHIFT_EOL (0+2)
347 # define SF_FL_SHIFT_EOL (0+4)
349 # define SF_FIX_SHIFT_EOL (+2)
350 # define SF_FL_SHIFT_EOL (+4)
353 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
354 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
356 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
357 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
358 #define SF_IS_INF 0x0040
359 #define SF_HAS_PAR 0x0080
360 #define SF_IN_PAR 0x0100
361 #define SF_HAS_EVAL 0x0200
362 #define SCF_DO_SUBSTR 0x0400
363 #define SCF_DO_STCLASS_AND 0x0800
364 #define SCF_DO_STCLASS_OR 0x1000
365 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
366 #define SCF_WHILEM_VISITED_POS 0x2000
368 #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
369 #define SCF_SEEN_ACCEPT 0x8000
371 #define UTF cBOOL(RExC_utf8)
372 #define LOC cBOOL(RExC_flags & RXf_PMf_LOCALE)
373 #define UNI_SEMANTICS cBOOL(RExC_flags & RXf_PMf_UNICODE)
374 #define FOLD cBOOL(RExC_flags & RXf_PMf_FOLD)
376 #define OOB_UNICODE 12345678
377 #define OOB_NAMEDCLASS -1
379 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
380 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
383 /* length of regex to show in messages that don't mark a position within */
384 #define RegexLengthToShowInErrorMessages 127
387 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
388 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
389 * op/pragma/warn/regcomp.
391 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
392 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
394 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
397 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
398 * arg. Show regex, up to a maximum length. If it's too long, chop and add
401 #define _FAIL(code) STMT_START { \
402 const char *ellipses = ""; \
403 IV len = RExC_end - RExC_precomp; \
406 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx_sv); \
407 if (len > RegexLengthToShowInErrorMessages) { \
408 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
409 len = RegexLengthToShowInErrorMessages - 10; \
415 #define FAIL(msg) _FAIL( \
416 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
417 msg, (int)len, RExC_precomp, ellipses))
419 #define FAIL2(msg,arg) _FAIL( \
420 Perl_croak(aTHX_ msg " in regex m/%.*s%s/", \
421 arg, (int)len, RExC_precomp, ellipses))
424 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
426 #define Simple_vFAIL(m) STMT_START { \
427 const IV offset = RExC_parse - RExC_precomp; \
428 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
429 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
433 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
435 #define vFAIL(m) STMT_START { \
437 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx_sv); \
442 * Like Simple_vFAIL(), but accepts two arguments.
444 #define Simple_vFAIL2(m,a1) STMT_START { \
445 const IV offset = RExC_parse - RExC_precomp; \
446 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
447 (int)offset, RExC_precomp, RExC_precomp + offset); \
451 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
453 #define vFAIL2(m,a1) STMT_START { \
455 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx_sv); \
456 Simple_vFAIL2(m, a1); \
461 * Like Simple_vFAIL(), but accepts three arguments.
463 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
464 const IV offset = RExC_parse - RExC_precomp; \
465 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
466 (int)offset, RExC_precomp, RExC_precomp + offset); \
470 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
472 #define vFAIL3(m,a1,a2) STMT_START { \
474 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx_sv); \
475 Simple_vFAIL3(m, a1, a2); \
479 * Like Simple_vFAIL(), but accepts four arguments.
481 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
482 const IV offset = RExC_parse - RExC_precomp; \
483 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
484 (int)offset, RExC_precomp, RExC_precomp + offset); \
487 #define ckWARNreg(loc,m) STMT_START { \
488 const IV offset = loc - RExC_precomp; \
489 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
490 (int)offset, RExC_precomp, RExC_precomp + offset); \
493 #define ckWARNregdep(loc,m) STMT_START { \
494 const IV offset = loc - RExC_precomp; \
495 Perl_ck_warner_d(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
497 (int)offset, RExC_precomp, RExC_precomp + offset); \
500 #define ckWARN2reg(loc, m, a1) STMT_START { \
501 const IV offset = loc - RExC_precomp; \
502 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
503 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
506 #define vWARN3(loc, m, a1, a2) STMT_START { \
507 const IV offset = loc - RExC_precomp; \
508 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
509 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
512 #define ckWARN3reg(loc, m, a1, a2) STMT_START { \
513 const IV offset = loc - RExC_precomp; \
514 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
515 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
518 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
519 const IV offset = loc - RExC_precomp; \
520 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
521 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
524 #define ckWARN4reg(loc, m, a1, a2, a3) STMT_START { \
525 const IV offset = loc - RExC_precomp; \
526 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
527 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
530 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
531 const IV offset = loc - RExC_precomp; \
532 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
533 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
537 /* Allow for side effects in s */
538 #define REGC(c,s) STMT_START { \
539 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
542 /* Macros for recording node offsets. 20001227 mjd@plover.com
543 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
544 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
545 * Element 0 holds the number n.
546 * Position is 1 indexed.
548 #ifndef RE_TRACK_PATTERN_OFFSETS
549 #define Set_Node_Offset_To_R(node,byte)
550 #define Set_Node_Offset(node,byte)
551 #define Set_Cur_Node_Offset
552 #define Set_Node_Length_To_R(node,len)
553 #define Set_Node_Length(node,len)
554 #define Set_Node_Cur_Length(node)
555 #define Node_Offset(n)
556 #define Node_Length(n)
557 #define Set_Node_Offset_Length(node,offset,len)
558 #define ProgLen(ri) ri->u.proglen
559 #define SetProgLen(ri,x) ri->u.proglen = x
561 #define ProgLen(ri) ri->u.offsets[0]
562 #define SetProgLen(ri,x) ri->u.offsets[0] = x
563 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
565 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
566 __LINE__, (int)(node), (int)(byte))); \
568 Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \
570 RExC_offsets[2*(node)-1] = (byte); \
575 #define Set_Node_Offset(node,byte) \
576 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
577 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
579 #define Set_Node_Length_To_R(node,len) STMT_START { \
581 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
582 __LINE__, (int)(node), (int)(len))); \
584 Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \
586 RExC_offsets[2*(node)] = (len); \
591 #define Set_Node_Length(node,len) \
592 Set_Node_Length_To_R((node)-RExC_emit_start, len)
593 #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
594 #define Set_Node_Cur_Length(node) \
595 Set_Node_Length(node, RExC_parse - parse_start)
597 /* Get offsets and lengths */
598 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
599 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
601 #define Set_Node_Offset_Length(node,offset,len) STMT_START { \
602 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
603 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
607 #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
608 #define EXPERIMENTAL_INPLACESCAN
609 #endif /*PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS*/
611 #define DEBUG_STUDYDATA(str,data,depth) \
612 DEBUG_OPTIMISE_MORE_r(if(data){ \
613 PerlIO_printf(Perl_debug_log, \
614 "%*s" str "Pos:%"IVdf"/%"IVdf \
615 " Flags: 0x%"UVXf" Whilem_c: %"IVdf" Lcp: %"IVdf" %s", \
616 (int)(depth)*2, "", \
617 (IV)((data)->pos_min), \
618 (IV)((data)->pos_delta), \
619 (UV)((data)->flags), \
620 (IV)((data)->whilem_c), \
621 (IV)((data)->last_closep ? *((data)->last_closep) : -1), \
622 is_inf ? "INF " : "" \
624 if ((data)->last_found) \
625 PerlIO_printf(Perl_debug_log, \
626 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
627 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
628 SvPVX_const((data)->last_found), \
629 (IV)((data)->last_end), \
630 (IV)((data)->last_start_min), \
631 (IV)((data)->last_start_max), \
632 ((data)->longest && \
633 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
634 SvPVX_const((data)->longest_fixed), \
635 (IV)((data)->offset_fixed), \
636 ((data)->longest && \
637 (data)->longest==&((data)->longest_float)) ? "*" : "", \
638 SvPVX_const((data)->longest_float), \
639 (IV)((data)->offset_float_min), \
640 (IV)((data)->offset_float_max) \
642 PerlIO_printf(Perl_debug_log,"\n"); \
645 static void clear_re(pTHX_ void *r);
647 /* Mark that we cannot extend a found fixed substring at this point.
648 Update the longest found anchored substring and the longest found
649 floating substrings if needed. */
652 S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp, int is_inf)
654 const STRLEN l = CHR_SVLEN(data->last_found);
655 const STRLEN old_l = CHR_SVLEN(*data->longest);
656 GET_RE_DEBUG_FLAGS_DECL;
658 PERL_ARGS_ASSERT_SCAN_COMMIT;
660 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
661 SvSetMagicSV(*data->longest, data->last_found);
662 if (*data->longest == data->longest_fixed) {
663 data->offset_fixed = l ? data->last_start_min : data->pos_min;
664 if (data->flags & SF_BEFORE_EOL)
666 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
668 data->flags &= ~SF_FIX_BEFORE_EOL;
669 data->minlen_fixed=minlenp;
670 data->lookbehind_fixed=0;
672 else { /* *data->longest == data->longest_float */
673 data->offset_float_min = l ? data->last_start_min : data->pos_min;
674 data->offset_float_max = (l
675 ? data->last_start_max
676 : data->pos_min + data->pos_delta);
677 if (is_inf || (U32)data->offset_float_max > (U32)I32_MAX)
678 data->offset_float_max = I32_MAX;
679 if (data->flags & SF_BEFORE_EOL)
681 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
683 data->flags &= ~SF_FL_BEFORE_EOL;
684 data->minlen_float=minlenp;
685 data->lookbehind_float=0;
688 SvCUR_set(data->last_found, 0);
690 SV * const sv = data->last_found;
691 if (SvUTF8(sv) && SvMAGICAL(sv)) {
692 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
698 data->flags &= ~SF_BEFORE_EOL;
699 DEBUG_STUDYDATA("commit: ",data,0);
702 /* Can match anything (initialization) */
704 S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
706 PERL_ARGS_ASSERT_CL_ANYTHING;
708 ANYOF_CLASS_ZERO(cl);
709 ANYOF_BITMAP_SETALL(cl);
710 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
712 cl->flags |= ANYOF_LOCALE;
713 cl->flags |= ANYOF_LOC_NONBITMAP_FOLD;
716 /* Can match anything (initialization) */
718 S_cl_is_anything(const struct regnode_charclass_class *cl)
722 PERL_ARGS_ASSERT_CL_IS_ANYTHING;
724 for (value = 0; value <= ANYOF_MAX; value += 2)
725 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
727 if (!(cl->flags & ANYOF_UNICODE_ALL))
729 if (!ANYOF_BITMAP_TESTALLSET((const void*)cl))
734 /* Can match anything (initialization) */
736 S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
738 PERL_ARGS_ASSERT_CL_INIT;
740 Zero(cl, 1, struct regnode_charclass_class);
742 cl_anything(pRExC_state, cl);
746 S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
748 PERL_ARGS_ASSERT_CL_INIT_ZERO;
750 Zero(cl, 1, struct regnode_charclass_class);
752 cl_anything(pRExC_state, cl);
754 cl->flags |= ANYOF_LOCALE;
757 /* 'And' a given class with another one. Can create false positives */
758 /* We assume that cl is not inverted */
760 S_cl_and(struct regnode_charclass_class *cl,
761 const struct regnode_charclass_class *and_with)
763 PERL_ARGS_ASSERT_CL_AND;
765 assert(and_with->type == ANYOF);
767 if (!(ANYOF_CLASS_TEST_ANY_SET(and_with))
768 && !(ANYOF_CLASS_TEST_ANY_SET(cl))
769 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
770 && !(and_with->flags & ANYOF_LOC_NONBITMAP_FOLD)
771 && !(cl->flags & ANYOF_LOC_NONBITMAP_FOLD)) {
774 if (and_with->flags & ANYOF_INVERT)
775 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
776 cl->bitmap[i] &= ~and_with->bitmap[i];
778 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
779 cl->bitmap[i] &= and_with->bitmap[i];
780 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
781 if (!(and_with->flags & ANYOF_EOS))
782 cl->flags &= ~ANYOF_EOS;
784 if (!(and_with->flags & ANYOF_LOC_NONBITMAP_FOLD))
785 cl->flags &= ~ANYOF_LOC_NONBITMAP_FOLD;
787 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_NONBITMAP &&
788 !(and_with->flags & ANYOF_INVERT)) {
789 cl->flags &= ~ANYOF_UNICODE_ALL;
790 cl->flags |= and_with->flags & ANYOF_NONBITMAP; /* field is 2 bits; use
793 ARG_SET(cl, ARG(and_with));
795 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
796 !(and_with->flags & ANYOF_INVERT))
797 cl->flags &= ~ANYOF_UNICODE_ALL;
798 if (!(and_with->flags & (ANYOF_NONBITMAP|ANYOF_UNICODE_ALL)) &&
799 !(and_with->flags & ANYOF_INVERT))
800 cl->flags &= ~ANYOF_NONBITMAP;
803 /* 'OR' a given class with another one. Can create false positives */
804 /* We assume that cl is not inverted */
806 S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with)
808 PERL_ARGS_ASSERT_CL_OR;
810 if (or_with->flags & ANYOF_INVERT) {
812 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
813 * <= (B1 | !B2) | (CL1 | !CL2)
814 * which is wasteful if CL2 is small, but we ignore CL2:
815 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
816 * XXXX Can we handle case-fold? Unclear:
817 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
818 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
820 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
821 && !(or_with->flags & ANYOF_LOC_NONBITMAP_FOLD)
822 && !(cl->flags & ANYOF_LOC_NONBITMAP_FOLD) ) {
825 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
826 cl->bitmap[i] |= ~or_with->bitmap[i];
827 } /* XXXX: logic is complicated otherwise */
829 cl_anything(pRExC_state, cl);
832 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
833 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
834 && (!(or_with->flags & ANYOF_LOC_NONBITMAP_FOLD)
835 || (cl->flags & ANYOF_LOC_NONBITMAP_FOLD)) ) {
838 /* OR char bitmap and class bitmap separately */
839 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
840 cl->bitmap[i] |= or_with->bitmap[i];
841 if (ANYOF_CLASS_TEST_ANY_SET(or_with)) {
842 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
843 cl->classflags[i] |= or_with->classflags[i];
844 cl->flags |= ANYOF_CLASS;
847 else { /* XXXX: logic is complicated, leave it along for a moment. */
848 cl_anything(pRExC_state, cl);
851 if (or_with->flags & ANYOF_EOS)
852 cl->flags |= ANYOF_EOS;
854 if (or_with->flags & ANYOF_LOC_NONBITMAP_FOLD)
855 cl->flags |= ANYOF_LOC_NONBITMAP_FOLD;
857 /* If both nodes match something outside the bitmap, but what they match
858 * outside is not the same pointer, and hence not easily compared, give up
859 * and allow the start class to match everything outside the bitmap */
860 if (cl->flags & ANYOF_NONBITMAP && or_with->flags & ANYOF_NONBITMAP &&
861 ARG(cl) != ARG(or_with)) {
862 cl->flags |= ANYOF_UNICODE_ALL;
865 if (or_with->flags & ANYOF_UNICODE_ALL) {
866 cl->flags |= ANYOF_UNICODE_ALL;
870 #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
871 #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
872 #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
873 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 )
878 dump_trie(trie,widecharmap,revcharmap)
879 dump_trie_interim_list(trie,widecharmap,revcharmap,next_alloc)
880 dump_trie_interim_table(trie,widecharmap,revcharmap,next_alloc)
882 These routines dump out a trie in a somewhat readable format.
883 The _interim_ variants are used for debugging the interim
884 tables that are used to generate the final compressed
885 representation which is what dump_trie expects.
887 Part of the reason for their existance is to provide a form
888 of documentation as to how the different representations function.
893 Dumps the final compressed table form of the trie to Perl_debug_log.
894 Used for debugging make_trie().
898 S_dump_trie(pTHX_ const struct _reg_trie_data *trie, HV *widecharmap,
899 AV *revcharmap, U32 depth)
902 SV *sv=sv_newmortal();
903 int colwidth= widecharmap ? 6 : 4;
905 GET_RE_DEBUG_FLAGS_DECL;
907 PERL_ARGS_ASSERT_DUMP_TRIE;
909 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
910 (int)depth * 2 + 2,"",
911 "Match","Base","Ofs" );
913 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
914 SV ** const tmp = av_fetch( revcharmap, state, 0);
916 PerlIO_printf( Perl_debug_log, "%*s",
918 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
919 PL_colors[0], PL_colors[1],
920 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
921 PERL_PV_ESCAPE_FIRSTCHAR
926 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
927 (int)depth * 2 + 2,"");
929 for( state = 0 ; state < trie->uniquecharcount ; state++ )
930 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
931 PerlIO_printf( Perl_debug_log, "\n");
933 for( state = 1 ; state < trie->statecount ; state++ ) {
934 const U32 base = trie->states[ state ].trans.base;
936 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state);
938 if ( trie->states[ state ].wordnum ) {
939 PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum );
941 PerlIO_printf( Perl_debug_log, "%6s", "" );
944 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
949 while( ( base + ofs < trie->uniquecharcount ) ||
950 ( base + ofs - trie->uniquecharcount < trie->lasttrans
951 && trie->trans[ base + ofs - trie->uniquecharcount ].check != state))
954 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
956 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
957 if ( ( base + ofs >= trie->uniquecharcount ) &&
958 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
959 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
961 PerlIO_printf( Perl_debug_log, "%*"UVXf,
963 (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next );
965 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
969 PerlIO_printf( Perl_debug_log, "]");
972 PerlIO_printf( Perl_debug_log, "\n" );
974 PerlIO_printf(Perl_debug_log, "%*sword_info N:(prev,len)=", (int)depth*2, "");
975 for (word=1; word <= trie->wordcount; word++) {
976 PerlIO_printf(Perl_debug_log, " %d:(%d,%d)",
977 (int)word, (int)(trie->wordinfo[word].prev),
978 (int)(trie->wordinfo[word].len));
980 PerlIO_printf(Perl_debug_log, "\n" );
983 Dumps a fully constructed but uncompressed trie in list form.
984 List tries normally only are used for construction when the number of
985 possible chars (trie->uniquecharcount) is very high.
986 Used for debugging make_trie().
989 S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie,
990 HV *widecharmap, AV *revcharmap, U32 next_alloc,
994 SV *sv=sv_newmortal();
995 int colwidth= widecharmap ? 6 : 4;
996 GET_RE_DEBUG_FLAGS_DECL;
998 PERL_ARGS_ASSERT_DUMP_TRIE_INTERIM_LIST;
1000 /* print out the table precompression. */
1001 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
1002 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
1003 "------:-----+-----------------\n" );
1005 for( state=1 ; state < next_alloc ; state ++ ) {
1008 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
1009 (int)depth * 2 + 2,"", (UV)state );
1010 if ( ! trie->states[ state ].wordnum ) {
1011 PerlIO_printf( Perl_debug_log, "%5s| ","");
1013 PerlIO_printf( Perl_debug_log, "W%4x| ",
1014 trie->states[ state ].wordnum
1017 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
1018 SV ** const tmp = av_fetch( revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0);
1020 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
1022 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
1023 PL_colors[0], PL_colors[1],
1024 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1025 PERL_PV_ESCAPE_FIRSTCHAR
1027 TRIE_LIST_ITEM(state,charid).forid,
1028 (UV)TRIE_LIST_ITEM(state,charid).newstate
1031 PerlIO_printf(Perl_debug_log, "\n%*s| ",
1032 (int)((depth * 2) + 14), "");
1035 PerlIO_printf( Perl_debug_log, "\n");
1040 Dumps a fully constructed but uncompressed trie in table form.
1041 This is the normal DFA style state transition table, with a few
1042 twists to facilitate compression later.
1043 Used for debugging make_trie().
1046 S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie,
1047 HV *widecharmap, AV *revcharmap, U32 next_alloc,
1052 SV *sv=sv_newmortal();
1053 int colwidth= widecharmap ? 6 : 4;
1054 GET_RE_DEBUG_FLAGS_DECL;
1056 PERL_ARGS_ASSERT_DUMP_TRIE_INTERIM_TABLE;
1059 print out the table precompression so that we can do a visual check
1060 that they are identical.
1063 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
1065 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1066 SV ** const tmp = av_fetch( revcharmap, charid, 0);
1068 PerlIO_printf( Perl_debug_log, "%*s",
1070 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
1071 PL_colors[0], PL_colors[1],
1072 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1073 PERL_PV_ESCAPE_FIRSTCHAR
1079 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
1081 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
1082 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
1085 PerlIO_printf( Perl_debug_log, "\n" );
1087 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
1089 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
1090 (int)depth * 2 + 2,"",
1091 (UV)TRIE_NODENUM( state ) );
1093 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1094 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
1096 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
1098 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
1100 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
1101 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check );
1103 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check,
1104 trie->states[ TRIE_NODENUM( state ) ].wordnum );
1112 /* make_trie(startbranch,first,last,tail,word_count,flags,depth)
1113 startbranch: the first branch in the whole branch sequence
1114 first : start branch of sequence of branch-exact nodes.
1115 May be the same as startbranch
1116 last : Thing following the last branch.
1117 May be the same as tail.
1118 tail : item following the branch sequence
1119 count : words in the sequence
1120 flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/
1121 depth : indent depth
1123 Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
1125 A trie is an N'ary tree where the branches are determined by digital
1126 decomposition of the key. IE, at the root node you look up the 1st character and
1127 follow that branch repeat until you find the end of the branches. Nodes can be
1128 marked as "accepting" meaning they represent a complete word. Eg:
1132 would convert into the following structure. Numbers represent states, letters
1133 following numbers represent valid transitions on the letter from that state, if
1134 the number is in square brackets it represents an accepting state, otherwise it
1135 will be in parenthesis.
1137 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1141 (1) +-i->(6)-+-s->[7]
1143 +-s->(3)-+-h->(4)-+-e->[5]
1145 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1147 This shows that when matching against the string 'hers' we will begin at state 1
1148 read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1149 then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1150 is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1151 single traverse. We store a mapping from accepting to state to which word was
1152 matched, and then when we have multiple possibilities we try to complete the
1153 rest of the regex in the order in which they occured in the alternation.
1155 The only prior NFA like behaviour that would be changed by the TRIE support is
1156 the silent ignoring of duplicate alternations which are of the form:
1158 / (DUPE|DUPE) X? (?{ ... }) Y /x
1160 Thus EVAL blocks following a trie may be called a different number of times with
1161 and without the optimisation. With the optimisations dupes will be silently
1162 ignored. This inconsistant behaviour of EVAL type nodes is well established as
1163 the following demonstrates:
1165 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
1167 which prints out 'word' three times, but
1169 'words'=~/(word|word|word)(?{ print $1 })S/
1171 which doesnt print it out at all. This is due to other optimisations kicking in.
1173 Example of what happens on a structural level:
1175 The regexp /(ac|ad|ab)+/ will produce the folowing debug output:
1177 1: CURLYM[1] {1,32767}(18)
1188 This would be optimizable with startbranch=5, first=5, last=16, tail=16
1189 and should turn into:
1191 1: CURLYM[1] {1,32767}(18)
1193 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
1201 Cases where tail != last would be like /(?foo|bar)baz/:
1211 which would be optimizable with startbranch=1, first=1, last=7, tail=8
1212 and would end up looking like:
1215 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
1222 d = uvuni_to_utf8_flags(d, uv, 0);
1224 is the recommended Unicode-aware way of saying
1229 #define TRIE_STORE_REVCHAR \
1232 SV *zlopp = newSV(2); \
1233 unsigned char *flrbbbbb = (unsigned char *) SvPVX(zlopp); \
1234 unsigned const char *const kapow = uvuni_to_utf8(flrbbbbb, uvc & 0xFF); \
1235 SvCUR_set(zlopp, kapow - flrbbbbb); \
1238 av_push(revcharmap, zlopp); \
1240 char ooooff = (char)uvc; \
1241 av_push(revcharmap, newSVpvn(&ooooff, 1)); \
1245 #define TRIE_READ_CHAR STMT_START { \
1249 if ( foldlen > 0 ) { \
1250 uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \
1255 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1256 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1257 foldlen -= UNISKIP( uvc ); \
1258 scan = foldbuf + UNISKIP( uvc ); \
1261 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1271 #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
1272 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
1273 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
1274 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
1276 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
1277 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
1278 TRIE_LIST_CUR( state )++; \
1281 #define TRIE_LIST_NEW(state) STMT_START { \
1282 Newxz( trie->states[ state ].trans.list, \
1283 4, reg_trie_trans_le ); \
1284 TRIE_LIST_CUR( state ) = 1; \
1285 TRIE_LIST_LEN( state ) = 4; \
1288 #define TRIE_HANDLE_WORD(state) STMT_START { \
1289 U16 dupe= trie->states[ state ].wordnum; \
1290 regnode * const noper_next = regnext( noper ); \
1293 /* store the word for dumping */ \
1295 if (OP(noper) != NOTHING) \
1296 tmp = newSVpvn_utf8(STRING(noper), STR_LEN(noper), UTF); \
1298 tmp = newSVpvn_utf8( "", 0, UTF ); \
1299 av_push( trie_words, tmp ); \
1303 trie->wordinfo[curword].prev = 0; \
1304 trie->wordinfo[curword].len = wordlen; \
1305 trie->wordinfo[curword].accept = state; \
1307 if ( noper_next < tail ) { \
1309 trie->jump = (U16 *) PerlMemShared_calloc( word_count + 1, sizeof(U16) ); \
1310 trie->jump[curword] = (U16)(noper_next - convert); \
1312 jumper = noper_next; \
1314 nextbranch= regnext(cur); \
1318 /* It's a dupe. Pre-insert into the wordinfo[].prev */\
1319 /* chain, so that when the bits of chain are later */\
1320 /* linked together, the dups appear in the chain */\
1321 trie->wordinfo[curword].prev = trie->wordinfo[dupe].prev; \
1322 trie->wordinfo[dupe].prev = curword; \
1324 /* we haven't inserted this word yet. */ \
1325 trie->states[ state ].wordnum = curword; \
1330 #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
1331 ( ( base + charid >= ucharcount \
1332 && base + charid < ubound \
1333 && state == trie->trans[ base - ucharcount + charid ].check \
1334 && trie->trans[ base - ucharcount + charid ].next ) \
1335 ? trie->trans[ base - ucharcount + charid ].next \
1336 : ( state==1 ? special : 0 ) \
1340 #define MADE_JUMP_TRIE 2
1341 #define MADE_EXACT_TRIE 4
1344 S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth)
1347 /* first pass, loop through and scan words */
1348 reg_trie_data *trie;
1349 HV *widecharmap = NULL;
1350 AV *revcharmap = newAV();
1352 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1357 regnode *jumper = NULL;
1358 regnode *nextbranch = NULL;
1359 regnode *convert = NULL;
1360 U32 *prev_states; /* temp array mapping each state to previous one */
1361 /* we just use folder as a flag in utf8 */
1362 const U8 * folder = NULL;
1365 const U32 data_slot = add_data( pRExC_state, 4, "tuuu" );
1366 AV *trie_words = NULL;
1367 /* along with revcharmap, this only used during construction but both are
1368 * useful during debugging so we store them in the struct when debugging.
1371 const U32 data_slot = add_data( pRExC_state, 2, "tu" );
1372 STRLEN trie_charcount=0;
1374 SV *re_trie_maxbuff;
1375 GET_RE_DEBUG_FLAGS_DECL;
1377 PERL_ARGS_ASSERT_MAKE_TRIE;
1379 PERL_UNUSED_ARG(depth);
1383 case EXACTFU: folder = PL_fold_latin1; break;
1384 case EXACTF: folder = PL_fold; break;
1385 case EXACTFL: folder = PL_fold_locale; break;
1388 trie = (reg_trie_data *) PerlMemShared_calloc( 1, sizeof(reg_trie_data) );
1390 trie->startstate = 1;
1391 trie->wordcount = word_count;
1392 RExC_rxi->data->data[ data_slot ] = (void*)trie;
1393 trie->charmap = (U16 *) PerlMemShared_calloc( 256, sizeof(U16) );
1394 if (!(UTF && folder))
1395 trie->bitmap = (char *) PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 );
1396 trie->wordinfo = (reg_trie_wordinfo *) PerlMemShared_calloc(
1397 trie->wordcount+1, sizeof(reg_trie_wordinfo));
1400 trie_words = newAV();
1403 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
1404 if (!SvIOK(re_trie_maxbuff)) {
1405 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
1408 PerlIO_printf( Perl_debug_log,
1409 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
1410 (int)depth * 2 + 2, "",
1411 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
1412 REG_NODE_NUM(last), REG_NODE_NUM(tail),
1416 /* Find the node we are going to overwrite */
1417 if ( first == startbranch && OP( last ) != BRANCH ) {
1418 /* whole branch chain */
1421 /* branch sub-chain */
1422 convert = NEXTOPER( first );
1425 /* -- First loop and Setup --
1427 We first traverse the branches and scan each word to determine if it
1428 contains widechars, and how many unique chars there are, this is
1429 important as we have to build a table with at least as many columns as we
1432 We use an array of integers to represent the character codes 0..255
1433 (trie->charmap) and we use a an HV* to store Unicode characters. We use the
1434 native representation of the character value as the key and IV's for the
1437 *TODO* If we keep track of how many times each character is used we can
1438 remap the columns so that the table compression later on is more
1439 efficient in terms of memory by ensuring the most common value is in the
1440 middle and the least common are on the outside. IMO this would be better
1441 than a most to least common mapping as theres a decent chance the most
1442 common letter will share a node with the least common, meaning the node
1443 will not be compressable. With a middle is most common approach the worst
1444 case is when we have the least common nodes twice.
1448 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1449 regnode * const noper = NEXTOPER( cur );
1450 const U8 *uc = (U8*)STRING( noper );
1451 const U8 * const e = uc + STR_LEN( noper );
1453 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1454 const U8 *scan = (U8*)NULL;
1455 U32 wordlen = 0; /* required init */
1457 bool set_bit = trie->bitmap ? 1 : 0; /*store the first char in the bitmap?*/
1459 if (OP(noper) == NOTHING) {
1463 if ( set_bit ) /* bitmap only alloced when !(UTF&&Folding) */
1464 TRIE_BITMAP_SET(trie,*uc); /* store the raw first byte
1465 regardless of encoding */
1467 for ( ; uc < e ; uc += len ) {
1468 TRIE_CHARCOUNT(trie)++;
1472 if ( !trie->charmap[ uvc ] ) {
1473 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
1475 trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ];
1479 /* store the codepoint in the bitmap, and its folded
1481 TRIE_BITMAP_SET(trie,uvc);
1483 /* store the folded codepoint */
1484 if ( folder ) TRIE_BITMAP_SET(trie,folder[ uvc ]);
1487 /* store first byte of utf8 representation of
1488 variant codepoints */
1489 if (! UNI_IS_INVARIANT(uvc)) {
1490 TRIE_BITMAP_SET(trie, UTF8_TWO_BYTE_HI(uvc));
1493 set_bit = 0; /* We've done our bit :-) */
1498 widecharmap = newHV();
1500 svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 1 );
1503 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
1505 if ( !SvTRUE( *svpp ) ) {
1506 sv_setiv( *svpp, ++trie->uniquecharcount );
1511 if( cur == first ) {
1514 } else if (chars < trie->minlen) {
1516 } else if (chars > trie->maxlen) {
1520 } /* end first pass */
1521 DEBUG_TRIE_COMPILE_r(
1522 PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
1523 (int)depth * 2 + 2,"",
1524 ( widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
1525 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
1526 (int)trie->minlen, (int)trie->maxlen )
1530 We now know what we are dealing with in terms of unique chars and
1531 string sizes so we can calculate how much memory a naive
1532 representation using a flat table will take. If it's over a reasonable
1533 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
1534 conservative but potentially much slower representation using an array
1537 At the end we convert both representations into the same compressed
1538 form that will be used in regexec.c for matching with. The latter
1539 is a form that cannot be used to construct with but has memory
1540 properties similar to the list form and access properties similar
1541 to the table form making it both suitable for fast searches and
1542 small enough that its feasable to store for the duration of a program.
1544 See the comment in the code where the compressed table is produced
1545 inplace from the flat tabe representation for an explanation of how
1546 the compression works.
1551 Newx(prev_states, TRIE_CHARCOUNT(trie) + 2, U32);
1554 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) {
1556 Second Pass -- Array Of Lists Representation
1558 Each state will be represented by a list of charid:state records
1559 (reg_trie_trans_le) the first such element holds the CUR and LEN
1560 points of the allocated array. (See defines above).
1562 We build the initial structure using the lists, and then convert
1563 it into the compressed table form which allows faster lookups
1564 (but cant be modified once converted).
1567 STRLEN transcount = 1;
1569 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1570 "%*sCompiling trie using list compiler\n",
1571 (int)depth * 2 + 2, ""));
1573 trie->states = (reg_trie_state *)
1574 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1575 sizeof(reg_trie_state) );
1579 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1581 regnode * const noper = NEXTOPER( cur );
1582 U8 *uc = (U8*)STRING( noper );
1583 const U8 * const e = uc + STR_LEN( noper );
1584 U32 state = 1; /* required init */
1585 U16 charid = 0; /* sanity init */
1586 U8 *scan = (U8*)NULL; /* sanity init */
1587 STRLEN foldlen = 0; /* required init */
1588 U32 wordlen = 0; /* required init */
1589 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1591 if (OP(noper) != NOTHING) {
1592 for ( ; uc < e ; uc += len ) {
1597 charid = trie->charmap[ uvc ];
1599 SV** const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
1603 charid=(U16)SvIV( *svpp );
1606 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1613 if ( !trie->states[ state ].trans.list ) {
1614 TRIE_LIST_NEW( state );
1616 for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) {
1617 if ( TRIE_LIST_ITEM( state, check ).forid == charid ) {
1618 newstate = TRIE_LIST_ITEM( state, check ).newstate;
1623 newstate = next_alloc++;
1624 prev_states[newstate] = state;
1625 TRIE_LIST_PUSH( state, charid, newstate );
1630 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1634 TRIE_HANDLE_WORD(state);
1636 } /* end second pass */
1638 /* next alloc is the NEXT state to be allocated */
1639 trie->statecount = next_alloc;
1640 trie->states = (reg_trie_state *)
1641 PerlMemShared_realloc( trie->states,
1643 * sizeof(reg_trie_state) );
1645 /* and now dump it out before we compress it */
1646 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_list(trie, widecharmap,
1647 revcharmap, next_alloc,
1651 trie->trans = (reg_trie_trans *)
1652 PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) );
1659 for( state=1 ; state < next_alloc ; state ++ ) {
1663 DEBUG_TRIE_COMPILE_MORE_r(
1664 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
1668 if (trie->states[state].trans.list) {
1669 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
1673 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1674 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
1675 if ( forid < minid ) {
1677 } else if ( forid > maxid ) {
1681 if ( transcount < tp + maxid - minid + 1) {
1683 trie->trans = (reg_trie_trans *)
1684 PerlMemShared_realloc( trie->trans,
1686 * sizeof(reg_trie_trans) );
1687 Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans );
1689 base = trie->uniquecharcount + tp - minid;
1690 if ( maxid == minid ) {
1692 for ( ; zp < tp ; zp++ ) {
1693 if ( ! trie->trans[ zp ].next ) {
1694 base = trie->uniquecharcount + zp - minid;
1695 trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1696 trie->trans[ zp ].check = state;
1702 trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1703 trie->trans[ tp ].check = state;
1708 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1709 const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid;
1710 trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate;
1711 trie->trans[ tid ].check = state;
1713 tp += ( maxid - minid + 1 );
1715 Safefree(trie->states[ state ].trans.list);
1718 DEBUG_TRIE_COMPILE_MORE_r(
1719 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
1722 trie->states[ state ].trans.base=base;
1724 trie->lasttrans = tp + 1;
1728 Second Pass -- Flat Table Representation.
1730 we dont use the 0 slot of either trans[] or states[] so we add 1 to each.
1731 We know that we will need Charcount+1 trans at most to store the data
1732 (one row per char at worst case) So we preallocate both structures
1733 assuming worst case.
1735 We then construct the trie using only the .next slots of the entry
1738 We use the .check field of the first entry of the node temporarily to
1739 make compression both faster and easier by keeping track of how many non
1740 zero fields are in the node.
1742 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
1745 There are two terms at use here: state as a TRIE_NODEIDX() which is a
1746 number representing the first entry of the node, and state as a
1747 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and
1748 TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there
1749 are 2 entrys per node. eg:
1757 The table is internally in the right hand, idx form. However as we also
1758 have to deal with the states array which is indexed by nodenum we have to
1759 use TRIE_NODENUM() to convert.
1762 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1763 "%*sCompiling trie using table compiler\n",
1764 (int)depth * 2 + 2, ""));
1766 trie->trans = (reg_trie_trans *)
1767 PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 )
1768 * trie->uniquecharcount + 1,
1769 sizeof(reg_trie_trans) );
1770 trie->states = (reg_trie_state *)
1771 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1772 sizeof(reg_trie_state) );
1773 next_alloc = trie->uniquecharcount + 1;
1776 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1778 regnode * const noper = NEXTOPER( cur );
1779 const U8 *uc = (U8*)STRING( noper );
1780 const U8 * const e = uc + STR_LEN( noper );
1782 U32 state = 1; /* required init */
1784 U16 charid = 0; /* sanity init */
1785 U32 accept_state = 0; /* sanity init */
1786 U8 *scan = (U8*)NULL; /* sanity init */
1788 STRLEN foldlen = 0; /* required init */
1789 U32 wordlen = 0; /* required init */
1790 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1792 if ( OP(noper) != NOTHING ) {
1793 for ( ; uc < e ; uc += len ) {
1798 charid = trie->charmap[ uvc ];
1800 SV* const * const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
1801 charid = svpp ? (U16)SvIV(*svpp) : 0;
1805 if ( !trie->trans[ state + charid ].next ) {
1806 trie->trans[ state + charid ].next = next_alloc;
1807 trie->trans[ state ].check++;
1808 prev_states[TRIE_NODENUM(next_alloc)]
1809 = TRIE_NODENUM(state);
1810 next_alloc += trie->uniquecharcount;
1812 state = trie->trans[ state + charid ].next;
1814 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1816 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1819 accept_state = TRIE_NODENUM( state );
1820 TRIE_HANDLE_WORD(accept_state);
1822 } /* end second pass */
1824 /* and now dump it out before we compress it */
1825 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_table(trie, widecharmap,
1827 next_alloc, depth+1));
1831 * Inplace compress the table.*
1833 For sparse data sets the table constructed by the trie algorithm will
1834 be mostly 0/FAIL transitions or to put it another way mostly empty.
1835 (Note that leaf nodes will not contain any transitions.)
1837 This algorithm compresses the tables by eliminating most such
1838 transitions, at the cost of a modest bit of extra work during lookup:
1840 - Each states[] entry contains a .base field which indicates the
1841 index in the state[] array wheres its transition data is stored.
1843 - If .base is 0 there are no valid transitions from that node.
1845 - If .base is nonzero then charid is added to it to find an entry in
1848 -If trans[states[state].base+charid].check!=state then the
1849 transition is taken to be a 0/Fail transition. Thus if there are fail
1850 transitions at the front of the node then the .base offset will point
1851 somewhere inside the previous nodes data (or maybe even into a node
1852 even earlier), but the .check field determines if the transition is
1856 The following process inplace converts the table to the compressed
1857 table: We first do not compress the root node 1,and mark all its
1858 .check pointers as 1 and set its .base pointer as 1 as well. This
1859 allows us to do a DFA construction from the compressed table later,
1860 and ensures that any .base pointers we calculate later are greater
1863 - We set 'pos' to indicate the first entry of the second node.
1865 - We then iterate over the columns of the node, finding the first and
1866 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
1867 and set the .check pointers accordingly, and advance pos
1868 appropriately and repreat for the next node. Note that when we copy
1869 the next pointers we have to convert them from the original
1870 NODEIDX form to NODENUM form as the former is not valid post
1873 - If a node has no transitions used we mark its base as 0 and do not
1874 advance the pos pointer.
1876 - If a node only has one transition we use a second pointer into the
1877 structure to fill in allocated fail transitions from other states.
1878 This pointer is independent of the main pointer and scans forward
1879 looking for null transitions that are allocated to a state. When it
1880 finds one it writes the single transition into the "hole". If the
1881 pointer doesnt find one the single transition is appended as normal.
1883 - Once compressed we can Renew/realloc the structures to release the
1886 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
1887 specifically Fig 3.47 and the associated pseudocode.
1891 const U32 laststate = TRIE_NODENUM( next_alloc );
1894 trie->statecount = laststate;
1896 for ( state = 1 ; state < laststate ; state++ ) {
1898 const U32 stateidx = TRIE_NODEIDX( state );
1899 const U32 o_used = trie->trans[ stateidx ].check;
1900 U32 used = trie->trans[ stateidx ].check;
1901 trie->trans[ stateidx ].check = 0;
1903 for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) {
1904 if ( flag || trie->trans[ stateidx + charid ].next ) {
1905 if ( trie->trans[ stateidx + charid ].next ) {
1907 for ( ; zp < pos ; zp++ ) {
1908 if ( ! trie->trans[ zp ].next ) {
1912 trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ;
1913 trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1914 trie->trans[ zp ].check = state;
1915 if ( ++zp > pos ) pos = zp;
1922 trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ;
1924 trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1925 trie->trans[ pos ].check = state;
1930 trie->lasttrans = pos + 1;
1931 trie->states = (reg_trie_state *)
1932 PerlMemShared_realloc( trie->states, laststate
1933 * sizeof(reg_trie_state) );
1934 DEBUG_TRIE_COMPILE_MORE_r(
1935 PerlIO_printf( Perl_debug_log,
1936 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
1937 (int)depth * 2 + 2,"",
1938 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ),
1941 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
1944 } /* end table compress */
1946 DEBUG_TRIE_COMPILE_MORE_r(
1947 PerlIO_printf(Perl_debug_log, "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n",
1948 (int)depth * 2 + 2, "",
1949 (UV)trie->statecount,
1950 (UV)trie->lasttrans)
1952 /* resize the trans array to remove unused space */
1953 trie->trans = (reg_trie_trans *)
1954 PerlMemShared_realloc( trie->trans, trie->lasttrans
1955 * sizeof(reg_trie_trans) );
1957 { /* Modify the program and insert the new TRIE node */
1958 U8 nodetype =(U8)(flags & 0xFF);
1962 regnode *optimize = NULL;
1963 #ifdef RE_TRACK_PATTERN_OFFSETS
1966 U32 mjd_nodelen = 0;
1967 #endif /* RE_TRACK_PATTERN_OFFSETS */
1968 #endif /* DEBUGGING */
1970 This means we convert either the first branch or the first Exact,
1971 depending on whether the thing following (in 'last') is a branch
1972 or not and whther first is the startbranch (ie is it a sub part of
1973 the alternation or is it the whole thing.)
1974 Assuming its a sub part we convert the EXACT otherwise we convert
1975 the whole branch sequence, including the first.
1977 /* Find the node we are going to overwrite */
1978 if ( first != startbranch || OP( last ) == BRANCH ) {
1979 /* branch sub-chain */
1980 NEXT_OFF( first ) = (U16)(last - first);
1981 #ifdef RE_TRACK_PATTERN_OFFSETS
1983 mjd_offset= Node_Offset((convert));
1984 mjd_nodelen= Node_Length((convert));
1987 /* whole branch chain */
1989 #ifdef RE_TRACK_PATTERN_OFFSETS
1992 const regnode *nop = NEXTOPER( convert );
1993 mjd_offset= Node_Offset((nop));
1994 mjd_nodelen= Node_Length((nop));
1998 PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
1999 (int)depth * 2 + 2, "",
2000 (UV)mjd_offset, (UV)mjd_nodelen)
2003 /* But first we check to see if there is a common prefix we can
2004 split out as an EXACT and put in front of the TRIE node. */
2005 trie->startstate= 1;
2006 if ( trie->bitmap && !widecharmap && !trie->jump ) {
2008 for ( state = 1 ; state < trie->statecount-1 ; state++ ) {
2012 const U32 base = trie->states[ state ].trans.base;
2014 if ( trie->states[state].wordnum )
2017 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
2018 if ( ( base + ofs >= trie->uniquecharcount ) &&
2019 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
2020 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
2022 if ( ++count > 1 ) {
2023 SV **tmp = av_fetch( revcharmap, ofs, 0);
2024 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
2025 if ( state == 1 ) break;
2027 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
2029 PerlIO_printf(Perl_debug_log,
2030 "%*sNew Start State=%"UVuf" Class: [",
2031 (int)depth * 2 + 2, "",
2034 SV ** const tmp = av_fetch( revcharmap, idx, 0);
2035 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
2037 TRIE_BITMAP_SET(trie,*ch);
2039 TRIE_BITMAP_SET(trie, folder[ *ch ]);
2041 PerlIO_printf(Perl_debug_log, "%s", (char*)ch)
2045 TRIE_BITMAP_SET(trie,*ch);
2047 TRIE_BITMAP_SET(trie,folder[ *ch ]);
2048 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
2054 SV **tmp = av_fetch( revcharmap, idx, 0);
2056 char *ch = SvPV( *tmp, len );
2058 SV *sv=sv_newmortal();
2059 PerlIO_printf( Perl_debug_log,
2060 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
2061 (int)depth * 2 + 2, "",
2063 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6,
2064 PL_colors[0], PL_colors[1],
2065 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
2066 PERL_PV_ESCAPE_FIRSTCHAR
2071 OP( convert ) = nodetype;
2072 str=STRING(convert);
2075 STR_LEN(convert) += len;
2081 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
2086 trie->prefixlen = (state-1);
2088 regnode *n = convert+NODE_SZ_STR(convert);
2089 NEXT_OFF(convert) = NODE_SZ_STR(convert);
2090 trie->startstate = state;
2091 trie->minlen -= (state - 1);
2092 trie->maxlen -= (state - 1);
2094 /* At least the UNICOS C compiler choked on this
2095 * being argument to DEBUG_r(), so let's just have
2098 #ifdef PERL_EXT_RE_BUILD
2104 regnode *fix = convert;
2105 U32 word = trie->wordcount;
2107 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
2108 while( ++fix < n ) {
2109 Set_Node_Offset_Length(fix, 0, 0);
2112 SV ** const tmp = av_fetch( trie_words, word, 0 );
2114 if ( STR_LEN(convert) <= SvCUR(*tmp) )
2115 sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert));
2117 sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp));
2125 NEXT_OFF(convert) = (U16)(tail - convert);
2126 DEBUG_r(optimize= n);
2132 if ( trie->maxlen ) {
2133 NEXT_OFF( convert ) = (U16)(tail - convert);
2134 ARG_SET( convert, data_slot );
2135 /* Store the offset to the first unabsorbed branch in
2136 jump[0], which is otherwise unused by the jump logic.
2137 We use this when dumping a trie and during optimisation. */
2139 trie->jump[0] = (U16)(nextbranch - convert);
2141 /* If the start state is not accepting (meaning there is no empty string/NOTHING)
2142 * and there is a bitmap
2143 * and the first "jump target" node we found leaves enough room
2144 * then convert the TRIE node into a TRIEC node, with the bitmap
2145 * embedded inline in the opcode - this is hypothetically faster.
2147 if ( !trie->states[trie->startstate].wordnum
2149 && ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
2151 OP( convert ) = TRIEC;
2152 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
2153 PerlMemShared_free(trie->bitmap);
2156 OP( convert ) = TRIE;
2158 /* store the type in the flags */
2159 convert->flags = nodetype;
2163 + regarglen[ OP( convert ) ];
2165 /* XXX We really should free up the resource in trie now,
2166 as we won't use them - (which resources?) dmq */
2168 /* needed for dumping*/
2169 DEBUG_r(if (optimize) {
2170 regnode *opt = convert;
2172 while ( ++opt < optimize) {
2173 Set_Node_Offset_Length(opt,0,0);
2176 Try to clean up some of the debris left after the
2179 while( optimize < jumper ) {
2180 mjd_nodelen += Node_Length((optimize));
2181 OP( optimize ) = OPTIMIZED;
2182 Set_Node_Offset_Length(optimize,0,0);
2185 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
2187 } /* end node insert */
2189 /* Finish populating the prev field of the wordinfo array. Walk back
2190 * from each accept state until we find another accept state, and if
2191 * so, point the first word's .prev field at the second word. If the
2192 * second already has a .prev field set, stop now. This will be the
2193 * case either if we've already processed that word's accept state,
2194 * or that state had multiple words, and the overspill words were
2195 * already linked up earlier.
2202 for (word=1; word <= trie->wordcount; word++) {
2204 if (trie->wordinfo[word].prev)
2206 state = trie->wordinfo[word].accept;
2208 state = prev_states[state];
2211 prev = trie->states[state].wordnum;
2215 trie->wordinfo[word].prev = prev;
2217 Safefree(prev_states);
2221 /* and now dump out the compressed format */
2222 DEBUG_TRIE_COMPILE_r(dump_trie(trie, widecharmap, revcharmap, depth+1));
2224 RExC_rxi->data->data[ data_slot + 1 ] = (void*)widecharmap;
2226 RExC_rxi->data->data[ data_slot + TRIE_WORDS_OFFSET ] = (void*)trie_words;
2227 RExC_rxi->data->data[ data_slot + 3 ] = (void*)revcharmap;
2229 SvREFCNT_dec(revcharmap);
2233 : trie->startstate>1
2239 S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth)
2241 /* The Trie is constructed and compressed now so we can build a fail array if it's needed
2243 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the
2244 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88
2247 We find the fail state for each state in the trie, this state is the longest proper
2248 suffix of the current state's 'word' that is also a proper prefix of another word in our
2249 trie. State 1 represents the word '' and is thus the default fail state. This allows
2250 the DFA not to have to restart after its tried and failed a word at a given point, it
2251 simply continues as though it had been matching the other word in the first place.
2253 'abcdgu'=~/abcdefg|cdgu/
2254 When we get to 'd' we are still matching the first word, we would encounter 'g' which would
2255 fail, which would bring us to the state representing 'd' in the second word where we would
2256 try 'g' and succeed, proceeding to match 'cdgu'.
2258 /* add a fail transition */
2259 const U32 trie_offset = ARG(source);
2260 reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[trie_offset];
2262 const U32 ucharcount = trie->uniquecharcount;
2263 const U32 numstates = trie->statecount;
2264 const U32 ubound = trie->lasttrans + ucharcount;
2268 U32 base = trie->states[ 1 ].trans.base;
2271 const U32 data_slot = add_data( pRExC_state, 1, "T" );
2272 GET_RE_DEBUG_FLAGS_DECL;
2274 PERL_ARGS_ASSERT_MAKE_TRIE_FAILTABLE;
2276 PERL_UNUSED_ARG(depth);
2280 ARG_SET( stclass, data_slot );
2281 aho = (reg_ac_data *) PerlMemShared_calloc( 1, sizeof(reg_ac_data) );
2282 RExC_rxi->data->data[ data_slot ] = (void*)aho;
2283 aho->trie=trie_offset;
2284 aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) );
2285 Copy( trie->states, aho->states, numstates, reg_trie_state );
2286 Newxz( q, numstates, U32);
2287 aho->fail = (U32 *) PerlMemShared_calloc( numstates, sizeof(U32) );
2290 /* initialize fail[0..1] to be 1 so that we always have
2291 a valid final fail state */
2292 fail[ 0 ] = fail[ 1 ] = 1;
2294 for ( charid = 0; charid < ucharcount ; charid++ ) {
2295 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
2297 q[ q_write ] = newstate;
2298 /* set to point at the root */
2299 fail[ q[ q_write++ ] ]=1;
2302 while ( q_read < q_write) {
2303 const U32 cur = q[ q_read++ % numstates ];
2304 base = trie->states[ cur ].trans.base;
2306 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
2307 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
2309 U32 fail_state = cur;
2312 fail_state = fail[ fail_state ];
2313 fail_base = aho->states[ fail_state ].trans.base;
2314 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
2316 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
2317 fail[ ch_state ] = fail_state;
2318 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
2320 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
2322 q[ q_write++ % numstates] = ch_state;
2326 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
2327 when we fail in state 1, this allows us to use the
2328 charclass scan to find a valid start char. This is based on the principle
2329 that theres a good chance the string being searched contains lots of stuff
2330 that cant be a start char.
2332 fail[ 0 ] = fail[ 1 ] = 0;
2333 DEBUG_TRIE_COMPILE_r({
2334 PerlIO_printf(Perl_debug_log,
2335 "%*sStclass Failtable (%"UVuf" states): 0",
2336 (int)(depth * 2), "", (UV)numstates
2338 for( q_read=1; q_read<numstates; q_read++ ) {
2339 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
2341 PerlIO_printf(Perl_debug_log, "\n");
2344 /*RExC_seen |= REG_SEEN_TRIEDFA;*/
2349 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
2350 * These need to be revisited when a newer toolchain becomes available.
2352 #if defined(__sparc64__) && defined(__GNUC__)
2353 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
2354 # undef SPARC64_GCC_WORKAROUND
2355 # define SPARC64_GCC_WORKAROUND 1
2359 #define DEBUG_PEEP(str,scan,depth) \
2360 DEBUG_OPTIMISE_r({if (scan){ \
2361 SV * const mysv=sv_newmortal(); \
2362 regnode *Next = regnext(scan); \
2363 regprop(RExC_rx, mysv, scan); \
2364 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)\n", \
2365 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\
2366 Next ? (REG_NODE_NUM(Next)) : 0 ); \
2373 #define JOIN_EXACT(scan,min,flags) \
2374 if (PL_regkind[OP(scan)] == EXACT) \
2375 join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1)
2378 S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) {
2379 /* Merge several consecutive EXACTish nodes into one. */
2380 regnode *n = regnext(scan);
2382 regnode *next = scan + NODE_SZ_STR(scan);
2386 regnode *stop = scan;
2387 GET_RE_DEBUG_FLAGS_DECL;
2389 PERL_UNUSED_ARG(depth);
2392 PERL_ARGS_ASSERT_JOIN_EXACT;
2393 #ifndef EXPERIMENTAL_INPLACESCAN
2394 PERL_UNUSED_ARG(flags);
2395 PERL_UNUSED_ARG(val);
2397 DEBUG_PEEP("join",scan,depth);
2399 /* Skip NOTHING, merge EXACT*. */
2401 ( PL_regkind[OP(n)] == NOTHING ||
2402 (stringok && (OP(n) == OP(scan))))
2404 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
2406 if (OP(n) == TAIL || n > next)
2408 if (PL_regkind[OP(n)] == NOTHING) {
2409 DEBUG_PEEP("skip:",n,depth);
2410 NEXT_OFF(scan) += NEXT_OFF(n);
2411 next = n + NODE_STEP_REGNODE;
2418 else if (stringok) {
2419 const unsigned int oldl = STR_LEN(scan);
2420 regnode * const nnext = regnext(n);
2422 DEBUG_PEEP("merg",n,depth);
2425 if (oldl + STR_LEN(n) > U8_MAX)
2427 NEXT_OFF(scan) += NEXT_OFF(n);
2428 STR_LEN(scan) += STR_LEN(n);
2429 next = n + NODE_SZ_STR(n);
2430 /* Now we can overwrite *n : */
2431 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
2439 #ifdef EXPERIMENTAL_INPLACESCAN
2440 if (flags && !NEXT_OFF(n)) {
2441 DEBUG_PEEP("atch", val, depth);
2442 if (reg_off_by_arg[OP(n)]) {
2443 ARG_SET(n, val - n);
2446 NEXT_OFF(n) = val - n;
2452 #define GREEK_SMALL_LETTER_IOTA_WITH_DIALYTIKA_AND_TONOS 0x0390
2453 #define IOTA_D_T GREEK_SMALL_LETTER_IOTA_WITH_DIALYTIKA_AND_TONOS
2454 #define GREEK_SMALL_LETTER_UPSILON_WITH_DIALYTIKA_AND_TONOS 0x03B0
2455 #define UPSILON_D_T GREEK_SMALL_LETTER_UPSILON_WITH_DIALYTIKA_AND_TONOS
2458 && ( OP(scan) == EXACTF || OP(scan) == EXACTFU)
2459 && ( STR_LEN(scan) >= 6 ) )
2462 Two problematic code points in Unicode casefolding of EXACT nodes:
2464 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
2465 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
2471 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
2472 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
2474 This means that in case-insensitive matching (or "loose matching",
2475 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
2476 length of the above casefolded versions) can match a target string
2477 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
2478 This would rather mess up the minimum length computation.
2480 What we'll do is to look for the tail four bytes, and then peek
2481 at the preceding two bytes to see whether we need to decrease
2482 the minimum length by four (six minus two).
2484 Thanks to the design of UTF-8, there cannot be false matches:
2485 A sequence of valid UTF-8 bytes cannot be a subsequence of
2486 another valid sequence of UTF-8 bytes.
2489 char * const s0 = STRING(scan), *s, *t;
2490 char * const s1 = s0 + STR_LEN(scan) - 1;
2491 char * const s2 = s1 - 4;
2492 #ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */
2493 const char t0[] = "\xaf\x49\xaf\x42";
2495 const char t0[] = "\xcc\x88\xcc\x81";
2497 const char * const t1 = t0 + 3;
2500 s < s2 && (t = ninstr(s, s1, t0, t1));
2503 if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) ||
2504 ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5))
2506 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
2507 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
2515 n = scan + NODE_SZ_STR(scan);
2517 if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) {
2524 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
2528 /* REx optimizer. Converts nodes into quickier variants "in place".
2529 Finds fixed substrings. */
2531 /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
2532 to the position after last scanned or to NULL. */
2534 #define INIT_AND_WITHP \
2535 assert(!and_withp); \
2536 Newx(and_withp,1,struct regnode_charclass_class); \
2537 SAVEFREEPV(and_withp)
2539 /* this is a chain of data about sub patterns we are processing that
2540 need to be handled seperately/specially in study_chunk. Its so
2541 we can simulate recursion without losing state. */
2543 typedef struct scan_frame {
2544 regnode *last; /* last node to process in this frame */
2545 regnode *next; /* next node to process when last is reached */
2546 struct scan_frame *prev; /*previous frame*/
2547 I32 stop; /* what stopparen do we use */
2551 #define SCAN_COMMIT(s, data, m) scan_commit(s, data, m, is_inf)
2553 #define CASE_SYNST_FNC(nAmE) \
2555 if (flags & SCF_DO_STCLASS_AND) { \
2556 for (value = 0; value < 256; value++) \
2557 if (!is_ ## nAmE ## _cp(value)) \
2558 ANYOF_BITMAP_CLEAR(data->start_class, value); \
2561 for (value = 0; value < 256; value++) \
2562 if (is_ ## nAmE ## _cp(value)) \
2563 ANYOF_BITMAP_SET(data->start_class, value); \
2567 if (flags & SCF_DO_STCLASS_AND) { \
2568 for (value = 0; value < 256; value++) \
2569 if (is_ ## nAmE ## _cp(value)) \
2570 ANYOF_BITMAP_CLEAR(data->start_class, value); \
2573 for (value = 0; value < 256; value++) \
2574 if (!is_ ## nAmE ## _cp(value)) \
2575 ANYOF_BITMAP_SET(data->start_class, value); \
2582 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
2583 I32 *minlenp, I32 *deltap,
2588 struct regnode_charclass_class *and_withp,
2589 U32 flags, U32 depth)
2590 /* scanp: Start here (read-write). */
2591 /* deltap: Write maxlen-minlen here. */
2592 /* last: Stop before this one. */
2593 /* data: string data about the pattern */
2594 /* stopparen: treat close N as END */
2595 /* recursed: which subroutines have we recursed into */
2596 /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */
2599 I32 min = 0, pars = 0, code;
2600 regnode *scan = *scanp, *next;
2602 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
2603 int is_inf_internal = 0; /* The studied chunk is infinite */
2604 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
2605 scan_data_t data_fake;
2606 SV *re_trie_maxbuff = NULL;
2607 regnode *first_non_open = scan;
2608 I32 stopmin = I32_MAX;
2609 scan_frame *frame = NULL;
2610 GET_RE_DEBUG_FLAGS_DECL;
2612 PERL_ARGS_ASSERT_STUDY_CHUNK;
2615 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
2619 while (first_non_open && OP(first_non_open) == OPEN)
2620 first_non_open=regnext(first_non_open);
2625 while ( scan && OP(scan) != END && scan < last ){
2626 /* Peephole optimizer: */
2627 DEBUG_STUDYDATA("Peep:", data,depth);
2628 DEBUG_PEEP("Peep",scan,depth);
2629 JOIN_EXACT(scan,&min,0);
2631 /* Follow the next-chain of the current node and optimize
2632 away all the NOTHINGs from it. */
2633 if (OP(scan) != CURLYX) {
2634 const int max = (reg_off_by_arg[OP(scan)]
2636 /* I32 may be smaller than U16 on CRAYs! */
2637 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
2638 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
2642 /* Skip NOTHING and LONGJMP. */
2643 while ((n = regnext(n))
2644 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
2645 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
2646 && off + noff < max)
2648 if (reg_off_by_arg[OP(scan)])
2651 NEXT_OFF(scan) = off;
2656 /* The principal pseudo-switch. Cannot be a switch, since we
2657 look into several different things. */
2658 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
2659 || OP(scan) == IFTHEN) {
2660 next = regnext(scan);
2662 /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */
2664 if (OP(next) == code || code == IFTHEN) {
2665 /* NOTE - There is similar code to this block below for handling
2666 TRIE nodes on a re-study. If you change stuff here check there
2668 I32 max1 = 0, min1 = I32_MAX, num = 0;
2669 struct regnode_charclass_class accum;
2670 regnode * const startbranch=scan;
2672 if (flags & SCF_DO_SUBSTR)
2673 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot merge strings after this. */
2674 if (flags & SCF_DO_STCLASS)
2675 cl_init_zero(pRExC_state, &accum);
2677 while (OP(scan) == code) {
2678 I32 deltanext, minnext, f = 0, fake;
2679 struct regnode_charclass_class this_class;
2682 data_fake.flags = 0;
2684 data_fake.whilem_c = data->whilem_c;
2685 data_fake.last_closep = data->last_closep;
2688 data_fake.last_closep = &fake;
2690 data_fake.pos_delta = delta;
2691 next = regnext(scan);
2692 scan = NEXTOPER(scan);
2694 scan = NEXTOPER(scan);
2695 if (flags & SCF_DO_STCLASS) {
2696 cl_init(pRExC_state, &this_class);
2697 data_fake.start_class = &this_class;
2698 f = SCF_DO_STCLASS_AND;
2700 if (flags & SCF_WHILEM_VISITED_POS)
2701 f |= SCF_WHILEM_VISITED_POS;
2703 /* we suppose the run is continuous, last=next...*/
2704 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2706 stopparen, recursed, NULL, f,depth+1);
2709 if (max1 < minnext + deltanext)
2710 max1 = minnext + deltanext;
2711 if (deltanext == I32_MAX)
2712 is_inf = is_inf_internal = 1;
2714 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
2716 if (data_fake.flags & SCF_SEEN_ACCEPT) {
2717 if ( stopmin > minnext)
2718 stopmin = min + min1;
2719 flags &= ~SCF_DO_SUBSTR;
2721 data->flags |= SCF_SEEN_ACCEPT;
2724 if (data_fake.flags & SF_HAS_EVAL)
2725 data->flags |= SF_HAS_EVAL;
2726 data->whilem_c = data_fake.whilem_c;
2728 if (flags & SCF_DO_STCLASS)
2729 cl_or(pRExC_state, &accum, &this_class);
2731 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
2733 if (flags & SCF_DO_SUBSTR) {
2734 data->pos_min += min1;
2735 data->pos_delta += max1 - min1;
2736 if (max1 != min1 || is_inf)
2737 data->longest = &(data->longest_float);
2740 delta += max1 - min1;
2741 if (flags & SCF_DO_STCLASS_OR) {
2742 cl_or(pRExC_state, data->start_class, &accum);
2744 cl_and(data->start_class, and_withp);
2745 flags &= ~SCF_DO_STCLASS;
2748 else if (flags & SCF_DO_STCLASS_AND) {
2750 cl_and(data->start_class, &accum);
2751 flags &= ~SCF_DO_STCLASS;
2754 /* Switch to OR mode: cache the old value of
2755 * data->start_class */
2757 StructCopy(data->start_class, and_withp,
2758 struct regnode_charclass_class);
2759 flags &= ~SCF_DO_STCLASS_AND;
2760 StructCopy(&accum, data->start_class,
2761 struct regnode_charclass_class);
2762 flags |= SCF_DO_STCLASS_OR;
2763 data->start_class->flags |= ANYOF_EOS;
2767 if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) {
2770 Assuming this was/is a branch we are dealing with: 'scan' now
2771 points at the item that follows the branch sequence, whatever
2772 it is. We now start at the beginning of the sequence and look
2779 which would be constructed from a pattern like /A|LIST|OF|WORDS/
2781 If we can find such a subseqence we need to turn the first
2782 element into a trie and then add the subsequent branch exact
2783 strings to the trie.
2787 1. patterns where the whole set of branches can be converted.
2789 2. patterns where only a subset can be converted.
2791 In case 1 we can replace the whole set with a single regop
2792 for the trie. In case 2 we need to keep the start and end
2795 'BRANCH EXACT; BRANCH EXACT; BRANCH X'
2796 becomes BRANCH TRIE; BRANCH X;
2798 There is an additional case, that being where there is a
2799 common prefix, which gets split out into an EXACT like node
2800 preceding the TRIE node.
2802 If x(1..n)==tail then we can do a simple trie, if not we make
2803 a "jump" trie, such that when we match the appropriate word
2804 we "jump" to the appopriate tail node. Essentailly we turn
2805 a nested if into a case structure of sorts.
2810 if (!re_trie_maxbuff) {
2811 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2812 if (!SvIOK(re_trie_maxbuff))
2813 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2815 if ( SvIV(re_trie_maxbuff)>=0 ) {
2817 regnode *first = (regnode *)NULL;
2818 regnode *last = (regnode *)NULL;
2819 regnode *tail = scan;
2824 SV * const mysv = sv_newmortal(); /* for dumping */
2826 /* var tail is used because there may be a TAIL
2827 regop in the way. Ie, the exacts will point to the
2828 thing following the TAIL, but the last branch will
2829 point at the TAIL. So we advance tail. If we
2830 have nested (?:) we may have to move through several
2834 while ( OP( tail ) == TAIL ) {
2835 /* this is the TAIL generated by (?:) */
2836 tail = regnext( tail );
2841 regprop(RExC_rx, mysv, tail );
2842 PerlIO_printf( Perl_debug_log, "%*s%s%s\n",
2843 (int)depth * 2 + 2, "",
2844 "Looking for TRIE'able sequences. Tail node is: ",
2845 SvPV_nolen_const( mysv )
2851 step through the branches, cur represents each
2852 branch, noper is the first thing to be matched
2853 as part of that branch and noper_next is the
2854 regnext() of that node. if noper is an EXACT
2855 and noper_next is the same as scan (our current
2856 position in the regex) then the EXACT branch is
2857 a possible optimization target. Once we have
2858 two or more consequetive such branches we can
2859 create a trie of the EXACT's contents and stich
2860 it in place. If the sequence represents all of
2861 the branches we eliminate the whole thing and
2862 replace it with a single TRIE. If it is a
2863 subsequence then we need to stitch it in. This
2864 means the first branch has to remain, and needs
2865 to be repointed at the item on the branch chain
2866 following the last branch optimized. This could
2867 be either a BRANCH, in which case the
2868 subsequence is internal, or it could be the
2869 item following the branch sequence in which
2870 case the subsequence is at the end.
2874 /* dont use tail as the end marker for this traverse */
2875 for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) {
2876 regnode * const noper = NEXTOPER( cur );
2877 #if defined(DEBUGGING) || defined(NOJUMPTRIE)
2878 regnode * const noper_next = regnext( noper );
2882 regprop(RExC_rx, mysv, cur);
2883 PerlIO_printf( Perl_debug_log, "%*s- %s (%d)",
2884 (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) );
2886 regprop(RExC_rx, mysv, noper);
2887 PerlIO_printf( Perl_debug_log, " -> %s",
2888 SvPV_nolen_const(mysv));
2891 regprop(RExC_rx, mysv, noper_next );
2892 PerlIO_printf( Perl_debug_log,"\t=> %s\t",
2893 SvPV_nolen_const(mysv));
2895 PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n",
2896 REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) );
2898 if ( (((first && optype!=NOTHING) ? OP( noper ) == optype
2899 : PL_regkind[ OP( noper ) ] == EXACT )
2900 || OP(noper) == NOTHING )
2902 && noper_next == tail
2907 if ( !first || optype == NOTHING ) {
2908 if (!first) first = cur;
2909 optype = OP( noper );
2915 Currently we do not believe that the trie logic can
2916 handle case insensitive matching properly when the
2917 pattern is not unicode (thus forcing unicode semantics).
2919 If/when this is fixed the following define can be swapped
2920 in below to fully enable trie logic.
2922 #define TRIE_TYPE_IS_SAFE 1
2925 #define TRIE_TYPE_IS_SAFE (UTF || optype==EXACT)
2927 if ( last && TRIE_TYPE_IS_SAFE ) {
2928 make_trie( pRExC_state,
2929 startbranch, first, cur, tail, count,
2932 if ( PL_regkind[ OP( noper ) ] == EXACT
2934 && noper_next == tail
2939 optype = OP( noper );
2949 regprop(RExC_rx, mysv, cur);
2950 PerlIO_printf( Perl_debug_log,
2951 "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2,
2952 "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur));
2956 if ( last && TRIE_TYPE_IS_SAFE ) {
2957 made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 );
2958 #ifdef TRIE_STUDY_OPT
2959 if ( ((made == MADE_EXACT_TRIE &&
2960 startbranch == first)
2961 || ( first_non_open == first )) &&
2963 flags |= SCF_TRIE_RESTUDY;
2964 if ( startbranch == first
2967 RExC_seen &=~REG_TOP_LEVEL_BRANCHES;
2977 else if ( code == BRANCHJ ) { /* single branch is optimized. */
2978 scan = NEXTOPER(NEXTOPER(scan));
2979 } else /* single branch is optimized. */
2980 scan = NEXTOPER(scan);
2982 } else if (OP(scan) == SUSPEND || OP(scan) == GOSUB || OP(scan) == GOSTART) {
2983 scan_frame *newframe = NULL;
2988 if (OP(scan) != SUSPEND) {
2989 /* set the pointer */
2990 if (OP(scan) == GOSUB) {
2992 RExC_recurse[ARG2L(scan)] = scan;
2993 start = RExC_open_parens[paren-1];
2994 end = RExC_close_parens[paren-1];
2997 start = RExC_rxi->program + 1;
3001 Newxz(recursed, (((RExC_npar)>>3) +1), U8);
3002 SAVEFREEPV(recursed);
3004 if (!PAREN_TEST(recursed,paren+1)) {
3005 PAREN_SET(recursed,paren+1);
3006 Newx(newframe,1,scan_frame);
3008 if (flags & SCF_DO_SUBSTR) {
3009 SCAN_COMMIT(pRExC_state,data,minlenp);
3010 data->longest = &(data->longest_float);
3012 is_inf = is_inf_internal = 1;
3013 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3014 cl_anything(pRExC_state, data->start_class);
3015 flags &= ~SCF_DO_STCLASS;
3018 Newx(newframe,1,scan_frame);
3021 end = regnext(scan);
3026 SAVEFREEPV(newframe);
3027 newframe->next = regnext(scan);
3028 newframe->last = last;
3029 newframe->stop = stopparen;
3030 newframe->prev = frame;
3040 else if (OP(scan) == EXACT) {
3041 I32 l = STR_LEN(scan);
3044 const U8 * const s = (U8*)STRING(scan);
3045 l = utf8_length(s, s + l);
3046 uc = utf8_to_uvchr(s, NULL);
3048 uc = *((U8*)STRING(scan));
3051 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
3052 /* The code below prefers earlier match for fixed
3053 offset, later match for variable offset. */
3054 if (data->last_end == -1) { /* Update the start info. */
3055 data->last_start_min = data->pos_min;
3056 data->last_start_max = is_inf
3057 ? I32_MAX : data->pos_min + data->pos_delta;
3059 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
3061 SvUTF8_on(data->last_found);
3063 SV * const sv = data->last_found;
3064 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3065 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3066 if (mg && mg->mg_len >= 0)
3067 mg->mg_len += utf8_length((U8*)STRING(scan),
3068 (U8*)STRING(scan)+STR_LEN(scan));
3070 data->last_end = data->pos_min + l;
3071 data->pos_min += l; /* As in the first entry. */
3072 data->flags &= ~SF_BEFORE_EOL;
3074 if (flags & SCF_DO_STCLASS_AND) {
3075 /* Check whether it is compatible with what we know already! */
3079 /* If compatibile, we or it in below. It is compatible if is
3080 * in the bitmp and either 1) its bit or its fold is set, or 2)
3081 * it's for a locale. Even if there isn't unicode semantics
3082 * here, at runtime there may be because of matching against a
3083 * utf8 string, so accept a possible false positive for
3084 * latin1-range folds */
3086 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
3087 && !ANYOF_BITMAP_TEST(data->start_class, uc)
3088 && (!(data->start_class->flags & ANYOF_LOC_NONBITMAP_FOLD)
3089 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold_latin1[uc])))
3092 ANYOF_CLASS_ZERO(data->start_class);
3093 ANYOF_BITMAP_ZERO(data->start_class);
3095 ANYOF_BITMAP_SET(data->start_class, uc);
3096 data->start_class->flags &= ~ANYOF_EOS;
3098 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
3100 else if (flags & SCF_DO_STCLASS_OR) {
3101 /* false positive possible if the class is case-folded */
3103 ANYOF_BITMAP_SET(data->start_class, uc);
3105 data->start_class->flags |= ANYOF_UNICODE_ALL;
3106 data->start_class->flags &= ~ANYOF_EOS;
3107 cl_and(data->start_class, and_withp);
3109 flags &= ~SCF_DO_STCLASS;
3111 else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */
3112 I32 l = STR_LEN(scan);
3113 UV uc = *((U8*)STRING(scan));
3115 /* Search for fixed substrings supports EXACT only. */
3116 if (flags & SCF_DO_SUBSTR) {
3118 SCAN_COMMIT(pRExC_state, data, minlenp);
3121 const U8 * const s = (U8 *)STRING(scan);
3122 l = utf8_length(s, s + l);
3123 uc = utf8_to_uvchr(s, NULL);
3126 if (flags & SCF_DO_SUBSTR)
3128 if (flags & SCF_DO_STCLASS_AND) {
3129 /* Check whether it is compatible with what we know already! */
3132 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
3133 && !ANYOF_BITMAP_TEST(data->start_class, uc)
3134 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold_latin1[uc])))
3138 ANYOF_CLASS_ZERO(data->start_class);
3139 ANYOF_BITMAP_ZERO(data->start_class);
3141 ANYOF_BITMAP_SET(data->start_class, uc);
3142 data->start_class->flags &= ~ANYOF_EOS;
3143 data->start_class->flags |= ANYOF_LOC_NONBITMAP_FOLD;
3144 if (OP(scan) == EXACTFL) {
3145 data->start_class->flags |= ANYOF_LOCALE;
3149 /* Also set the other member of the fold pair. In case
3150 * that unicode semantics is called for at runtime, use
3151 * the full latin1 fold. (Can't do this for locale,
3152 * because not known until runtime */
3153 ANYOF_BITMAP_SET(data->start_class, PL_fold_latin1[uc]);
3157 else if (flags & SCF_DO_STCLASS_OR) {
3158 if (data->start_class->flags & ANYOF_LOC_NONBITMAP_FOLD) {
3159 /* false positive possible if the class is case-folded.
3160 Assume that the locale settings are the same... */
3162 ANYOF_BITMAP_SET(data->start_class, uc);
3163 if (OP(scan) != EXACTFL) {
3165 /* And set the other member of the fold pair, but
3166 * can't do that in locale because not known until
3168 ANYOF_BITMAP_SET(data->start_class,
3169 PL_fold_latin1[uc]);
3172 data->start_class->flags &= ~ANYOF_EOS;
3174 cl_and(data->start_class, and_withp);
3176 flags &= ~SCF_DO_STCLASS;
3178 else if (REGNODE_VARIES(OP(scan))) {
3179 I32 mincount, maxcount, minnext, deltanext, fl = 0;
3180 I32 f = flags, pos_before = 0;
3181 regnode * const oscan = scan;
3182 struct regnode_charclass_class this_class;
3183 struct regnode_charclass_class *oclass = NULL;
3184 I32 next_is_eval = 0;
3186 switch (PL_regkind[OP(scan)]) {
3187 case WHILEM: /* End of (?:...)* . */
3188 scan = NEXTOPER(scan);
3191 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
3192 next = NEXTOPER(scan);
3193 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
3195 maxcount = REG_INFTY;
3196 next = regnext(scan);
3197 scan = NEXTOPER(scan);
3201 if (flags & SCF_DO_SUBSTR)
3206 if (flags & SCF_DO_STCLASS) {
3208 maxcount = REG_INFTY;
3209 next = regnext(scan);
3210 scan = NEXTOPER(scan);
3213 is_inf = is_inf_internal = 1;
3214 scan = regnext(scan);
3215 if (flags & SCF_DO_SUBSTR) {
3216 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */
3217 data->longest = &(data->longest_float);
3219 goto optimize_curly_tail;
3221 if (stopparen>0 && (OP(scan)==CURLYN || OP(scan)==CURLYM)
3222 && (scan->flags == stopparen))
3227 mincount = ARG1(scan);
3228 maxcount = ARG2(scan);
3230 next = regnext(scan);
3231 if (OP(scan) == CURLYX) {
3232 I32 lp = (data ? *(data->last_closep) : 0);
3233 scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX);
3235 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
3236 next_is_eval = (OP(scan) == EVAL);
3238 if (flags & SCF_DO_SUBSTR) {
3239 if (mincount == 0) SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */
3240 pos_before = data->pos_min;
3244 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
3246 data->flags |= SF_IS_INF;
3248 if (flags & SCF_DO_STCLASS) {
3249 cl_init(pRExC_state, &this_class);
3250 oclass = data->start_class;
3251 data->start_class = &this_class;
3252 f |= SCF_DO_STCLASS_AND;
3253 f &= ~SCF_DO_STCLASS_OR;
3255 /* Exclude from super-linear cache processing any {n,m}
3256 regops for which the combination of input pos and regex
3257 pos is not enough information to determine if a match
3260 For example, in the regex /foo(bar\s*){4,8}baz/ with the
3261 regex pos at the \s*, the prospects for a match depend not
3262 only on the input position but also on how many (bar\s*)
3263 repeats into the {4,8} we are. */
3264 if ((mincount > 1) || (maxcount > 1 && maxcount != REG_INFTY))
3265 f &= ~SCF_WHILEM_VISITED_POS;
3267 /* This will finish on WHILEM, setting scan, or on NULL: */
3268 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
3269 last, data, stopparen, recursed, NULL,
3271 ? (f & ~SCF_DO_SUBSTR) : f),depth+1);
3273 if (flags & SCF_DO_STCLASS)
3274 data->start_class = oclass;
3275 if (mincount == 0 || minnext == 0) {
3276 if (flags & SCF_DO_STCLASS_OR) {
3277 cl_or(pRExC_state, data->start_class, &this_class);
3279 else if (flags & SCF_DO_STCLASS_AND) {
3280 /* Switch to OR mode: cache the old value of
3281 * data->start_class */
3283 StructCopy(data->start_class, and_withp,
3284 struct regnode_charclass_class);
3285 flags &= ~SCF_DO_STCLASS_AND;
3286 StructCopy(&this_class, data->start_class,
3287 struct regnode_charclass_class);
3288 flags |= SCF_DO_STCLASS_OR;
3289 data->start_class->flags |= ANYOF_EOS;
3291 } else { /* Non-zero len */
3292 if (flags & SCF_DO_STCLASS_OR) {
3293 cl_or(pRExC_state, data->start_class, &this_class);
3294 cl_and(data->start_class, and_withp);
3296 else if (flags & SCF_DO_STCLASS_AND)
3297 cl_and(data->start_class, &this_class);
3298 flags &= ~SCF_DO_STCLASS;
3300 if (!scan) /* It was not CURLYX, but CURLY. */
3302 if ( /* ? quantifier ok, except for (?{ ... }) */
3303 (next_is_eval || !(mincount == 0 && maxcount == 1))
3304 && (minnext == 0) && (deltanext == 0)
3305 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
3306 && maxcount <= REG_INFTY/3) /* Complement check for big count */
3308 ckWARNreg(RExC_parse,
3309 "Quantifier unexpected on zero-length expression");
3312 min += minnext * mincount;
3313 is_inf_internal |= ((maxcount == REG_INFTY
3314 && (minnext + deltanext) > 0)
3315 || deltanext == I32_MAX);
3316 is_inf |= is_inf_internal;
3317 delta += (minnext + deltanext) * maxcount - minnext * mincount;
3319 /* Try powerful optimization CURLYX => CURLYN. */
3320 if ( OP(oscan) == CURLYX && data
3321 && data->flags & SF_IN_PAR
3322 && !(data->flags & SF_HAS_EVAL)
3323 && !deltanext && minnext == 1 ) {
3324 /* Try to optimize to CURLYN. */
3325 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
3326 regnode * const nxt1 = nxt;
3333 if (!REGNODE_SIMPLE(OP(nxt))
3334 && !(PL_regkind[OP(nxt)] == EXACT
3335 && STR_LEN(nxt) == 1))
3341 if (OP(nxt) != CLOSE)
3343 if (RExC_open_parens) {
3344 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3345 RExC_close_parens[ARG(nxt1)-1]=nxt+2; /*close->while*/
3347 /* Now we know that nxt2 is the only contents: */
3348 oscan->flags = (U8)ARG(nxt);
3350 OP(nxt1) = NOTHING; /* was OPEN. */
3353 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3354 NEXT_OFF(nxt1+ 1) = 0; /* just for consistency. */
3355 NEXT_OFF(nxt2) = 0; /* just for consistency with CURLY. */
3356 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3357 OP(nxt + 1) = OPTIMIZED; /* was count. */
3358 NEXT_OFF(nxt+ 1) = 0; /* just for consistency. */
3363 /* Try optimization CURLYX => CURLYM. */
3364 if ( OP(oscan) == CURLYX && data
3365 && !(data->flags & SF_HAS_PAR)
3366 && !(data->flags & SF_HAS_EVAL)
3367 && !deltanext /* atom is fixed width */
3368 && minnext != 0 /* CURLYM can't handle zero width */
3370 /* XXXX How to optimize if data == 0? */
3371 /* Optimize to a simpler form. */
3372 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
3376 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
3377 && (OP(nxt2) != WHILEM))
3379 OP(nxt2) = SUCCEED; /* Whas WHILEM */
3380 /* Need to optimize away parenths. */
3381 if ((data->flags & SF_IN_PAR) && OP(nxt) == CLOSE) {
3382 /* Set the parenth number. */
3383 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
3385 oscan->flags = (U8)ARG(nxt);
3386 if (RExC_open_parens) {
3387 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3388 RExC_close_parens[ARG(nxt1)-1]=nxt2+1; /*close->NOTHING*/
3390 OP(nxt1) = OPTIMIZED; /* was OPEN. */
3391 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3394 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3395 OP(nxt + 1) = OPTIMIZED; /* was count. */
3396 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
3397 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
3400 while ( nxt1 && (OP(nxt1) != WHILEM)) {
3401 regnode *nnxt = regnext(nxt1);
3403 if (reg_off_by_arg[OP(nxt1)])
3404 ARG_SET(nxt1, nxt2 - nxt1);
3405 else if (nxt2 - nxt1 < U16_MAX)
3406 NEXT_OFF(nxt1) = nxt2 - nxt1;
3408 OP(nxt) = NOTHING; /* Cannot beautify */
3413 /* Optimize again: */
3414 study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt,
3415 NULL, stopparen, recursed, NULL, 0,depth+1);
3420 else if ((OP(oscan) == CURLYX)
3421 && (flags & SCF_WHILEM_VISITED_POS)
3422 /* See the comment on a similar expression above.
3423 However, this time it's not a subexpression
3424 we care about, but the expression itself. */
3425 && (maxcount == REG_INFTY)
3426 && data && ++data->whilem_c < 16) {
3427 /* This stays as CURLYX, we can put the count/of pair. */
3428 /* Find WHILEM (as in regexec.c) */
3429 regnode *nxt = oscan + NEXT_OFF(oscan);
3431 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
3433 PREVOPER(nxt)->flags = (U8)(data->whilem_c
3434 | (RExC_whilem_seen << 4)); /* On WHILEM */
3436 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
3438 if (flags & SCF_DO_SUBSTR) {
3439 SV *last_str = NULL;
3440 int counted = mincount != 0;
3442 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
3443 #if defined(SPARC64_GCC_WORKAROUND)
3446 const char *s = NULL;
3449 if (pos_before >= data->last_start_min)
3452 b = data->last_start_min;
3455 s = SvPV_const(data->last_found, l);
3456 old = b - data->last_start_min;
3459 I32 b = pos_before >= data->last_start_min
3460 ? pos_before : data->last_start_min;
3462 const char * const s = SvPV_const(data->last_found, l);
3463 I32 old = b - data->last_start_min;
3467 old = utf8_hop((U8*)s, old) - (U8*)s;
3469 /* Get the added string: */
3470 last_str = newSVpvn_utf8(s + old, l, UTF);
3471 if (deltanext == 0 && pos_before == b) {
3472 /* What was added is a constant string */
3474 SvGROW(last_str, (mincount * l) + 1);
3475 repeatcpy(SvPVX(last_str) + l,
3476 SvPVX_const(last_str), l, mincount - 1);
3477 SvCUR_set(last_str, SvCUR(last_str) * mincount);
3478 /* Add additional parts. */
3479 SvCUR_set(data->last_found,
3480 SvCUR(data->last_found) - l);
3481 sv_catsv(data->last_found, last_str);
3483 SV * sv = data->last_found;
3485 SvUTF8(sv) && SvMAGICAL(sv) ?
3486 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3487 if (mg && mg->mg_len >= 0)
3488 mg->mg_len += CHR_SVLEN(last_str) - l;
3490 data->last_end += l * (mincount - 1);
3493 /* start offset must point into the last copy */
3494 data->last_start_min += minnext * (mincount - 1);
3495 data->last_start_max += is_inf ? I32_MAX
3496 : (maxcount - 1) * (minnext + data->pos_delta);
3499 /* It is counted once already... */
3500 data->pos_min += minnext * (mincount - counted);
3501 data->pos_delta += - counted * deltanext +
3502 (minnext + deltanext) * maxcount - minnext * mincount;
3503 if (mincount != maxcount) {
3504 /* Cannot extend fixed substrings found inside
3506 SCAN_COMMIT(pRExC_state,data,minlenp);
3507 if (mincount && last_str) {
3508 SV * const sv = data->last_found;
3509 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3510 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3514 sv_setsv(sv, last_str);
3515 data->last_end = data->pos_min;
3516 data->last_start_min =
3517 data->pos_min - CHR_SVLEN(last_str);
3518 data->last_start_max = is_inf
3520 : data->pos_min + data->pos_delta
3521 - CHR_SVLEN(last_str);
3523 data->longest = &(data->longest_float);
3525 SvREFCNT_dec(last_str);
3527 if (data && (fl & SF_HAS_EVAL))
3528 data->flags |= SF_HAS_EVAL;
3529 optimize_curly_tail:
3530 if (OP(oscan) != CURLYX) {
3531 while (PL_regkind[OP(next = regnext(oscan))] == NOTHING
3533 NEXT_OFF(oscan) += NEXT_OFF(next);
3536 default: /* REF and CLUMP only? */
3537 if (flags & SCF_DO_SUBSTR) {
3538 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3539 data->longest = &(data->longest_float);
3541 is_inf = is_inf_internal = 1;
3542 if (flags & SCF_DO_STCLASS_OR)
3543 cl_anything(pRExC_state, data->start_class);
3544 flags &= ~SCF_DO_STCLASS;
3548 else if (OP(scan) == LNBREAK) {
3549 if (flags & SCF_DO_STCLASS) {
3551 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3552 if (flags & SCF_DO_STCLASS_AND) {
3553 for (value = 0; value < 256; value++)
3554 if (!is_VERTWS_cp(value))
3555 ANYOF_BITMAP_CLEAR(data->start_class, value);
3558 for (value = 0; value < 256; value++)
3559 if (is_VERTWS_cp(value))
3560 ANYOF_BITMAP_SET(data->start_class, value);
3562 if (flags & SCF_DO_STCLASS_OR)
3563 cl_and(data->start_class, and_withp);
3564 flags &= ~SCF_DO_STCLASS;
3568 if (flags & SCF_DO_SUBSTR) {
3569 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3571 data->pos_delta += 1;
3572 data->longest = &(data->longest_float);
3575 else if (OP(scan) == FOLDCHAR) {
3576 int d = ARG(scan) == LATIN_SMALL_LETTER_SHARP_S ? 1 : 2;
3577 flags &= ~SCF_DO_STCLASS;
3580 if (flags & SCF_DO_SUBSTR) {
3581 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3583 data->pos_delta += d;
3584 data->longest = &(data->longest_float);
3587 else if (REGNODE_SIMPLE(OP(scan))) {
3590 if (flags & SCF_DO_SUBSTR) {
3591 SCAN_COMMIT(pRExC_state,data,minlenp);
3595 if (flags & SCF_DO_STCLASS) {
3596 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3598 /* Some of the logic below assumes that switching
3599 locale on will only add false positives. */
3600 switch (PL_regkind[OP(scan)]) {
3604 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
3605 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3606 cl_anything(pRExC_state, data->start_class);
3609 if (OP(scan) == SANY)
3611 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
3612 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
3613 || ANYOF_CLASS_TEST_ANY_SET(data->start_class));
3614 cl_anything(pRExC_state, data->start_class);
3616 if (flags & SCF_DO_STCLASS_AND || !value)
3617 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
3620 if (flags & SCF_DO_STCLASS_AND)
3621 cl_and(data->start_class,
3622 (struct regnode_charclass_class*)scan);
3624 cl_or(pRExC_state, data->start_class,
3625 (struct regnode_charclass_class*)scan);
3628 if (flags & SCF_DO_STCLASS_AND) {
3629 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3630 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3631 if (FLAGS(scan) & USE_UNI) {
3632 for (value = 0; value < 256; value++) {
3633 if (!isWORDCHAR_L1(value)) {
3634 ANYOF_BITMAP_CLEAR(data->start_class, value);
3638 for (value = 0; value < 256; value++) {
3639 if (!isALNUM(value)) {
3640 ANYOF_BITMAP_CLEAR(data->start_class, value);
3647 if (data->start_class->flags & ANYOF_LOCALE)
3648 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3649 else if (FLAGS(scan) & USE_UNI) {
3650 for (value = 0; value < 256; value++) {
3651 if (isWORDCHAR_L1(value)) {
3652 ANYOF_BITMAP_SET(data->start_class, value);
3656 for (value = 0; value < 256; value++) {
3657 if (isALNUM(value)) {
3658 ANYOF_BITMAP_SET(data->start_class, value);
3665 if (flags & SCF_DO_STCLASS_AND) {
3666 if (data->start_class->flags & ANYOF_LOCALE)
3667 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3670 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3671 data->start_class->flags |= ANYOF_LOCALE;
3675 if (flags & SCF_DO_STCLASS_AND) {
3676 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3677 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3678 if (FLAGS(scan) & USE_UNI) {
3679 for (value = 0; value < 256; value++) {
3680 if (isWORDCHAR_L1(value)) {
3681 ANYOF_BITMAP_CLEAR(data->start_class, value);
3685 for (value = 0; value < 256; value++) {
3686 if (isALNUM(value)) {
3687 ANYOF_BITMAP_CLEAR(data->start_class, value);
3694 if (data->start_class->flags & ANYOF_LOCALE)
3695 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3697 for (value = 0; value < 256; value++)
3698 if (!isALNUM(value))
3699 ANYOF_BITMAP_SET(data->start_class, value);
3704 if (flags & SCF_DO_STCLASS_AND) {
3705 if (data->start_class->flags & ANYOF_LOCALE)
3706 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3709 data->start_class->flags |= ANYOF_LOCALE;
3710 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3714 if (flags & SCF_DO_STCLASS_AND) {
3715 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3716 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3717 if (FLAGS(scan) & USE_UNI) {
3718 for (value = 0; value < 256; value++) {
3719 if (!isSPACE_L1(value)) {
3720 ANYOF_BITMAP_CLEAR(data->start_class, value);
3724 for (value = 0; value < 256; value++) {
3725 if (!isSPACE(value)) {
3726 ANYOF_BITMAP_CLEAR(data->start_class, value);
3733 if (data->start_class->flags & ANYOF_LOCALE) {
3734 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3736 else if (FLAGS(scan) & USE_UNI) {
3737 for (value = 0; value < 256; value++) {
3738 if (isSPACE_L1(value)) {
3739 ANYOF_BITMAP_SET(data->start_class, value);
3743 for (value = 0; value < 256; value++) {
3744 if (isSPACE(value)) {
3745 ANYOF_BITMAP_SET(data->start_class, value);
3752 if (flags & SCF_DO_STCLASS_AND) {
3753 if (data->start_class->flags & ANYOF_LOCALE)
3754 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3757 data->start_class->flags |= ANYOF_LOCALE;
3758 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3762 if (flags & SCF_DO_STCLASS_AND) {
3763 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3764 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3765 if (FLAGS(scan) & USE_UNI) {
3766 for (value = 0; value < 256; value++) {
3767 if (isSPACE_L1(value)) {
3768 ANYOF_BITMAP_CLEAR(data->start_class, value);
3772 for (value = 0; value < 256; value++) {
3773 if (isSPACE(value)) {
3774 ANYOF_BITMAP_CLEAR(data->start_class, value);
3781 if (data->start_class->flags & ANYOF_LOCALE)
3782 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3783 else if (FLAGS(scan) & USE_UNI) {
3784 for (value = 0; value < 256; value++) {
3785 if (!isSPACE_L1(value)) {
3786 ANYOF_BITMAP_SET(data->start_class, value);
3791 for (value = 0; value < 256; value++) {
3792 if (!isSPACE(value)) {
3793 ANYOF_BITMAP_SET(data->start_class, value);
3800 if (flags & SCF_DO_STCLASS_AND) {
3801 if (data->start_class->flags & ANYOF_LOCALE) {
3802 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3803 for (value = 0; value < 256; value++)
3804 if (!isSPACE(value))
3805 ANYOF_BITMAP_CLEAR(data->start_class, value);
3809 data->start_class->flags |= ANYOF_LOCALE;
3810 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3814 if (flags & SCF_DO_STCLASS_AND) {
3815 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
3816 for (value = 0; value < 256; value++)
3817 if (!isDIGIT(value))
3818 ANYOF_BITMAP_CLEAR(data->start_class, value);
3821 if (data->start_class->flags & ANYOF_LOCALE)
3822 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
3824 for (value = 0; value < 256; value++)
3826 ANYOF_BITMAP_SET(data->start_class, value);
3831 if (flags & SCF_DO_STCLASS_AND) {
3832 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
3833 for (value = 0; value < 256; value++)
3835 ANYOF_BITMAP_CLEAR(data->start_class, value);
3838 if (data->start_class->flags & ANYOF_LOCALE)
3839 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
3841 for (value = 0; value < 256; value++)
3842 if (!isDIGIT(value))
3843 ANYOF_BITMAP_SET(data->start_class, value);
3847 CASE_SYNST_FNC(VERTWS);
3848 CASE_SYNST_FNC(HORIZWS);
3851 if (flags & SCF_DO_STCLASS_OR)
3852 cl_and(data->start_class, and_withp);
3853 flags &= ~SCF_DO_STCLASS;
3856 else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
3857 data->flags |= (OP(scan) == MEOL
3861 else if ( PL_regkind[OP(scan)] == BRANCHJ
3862 /* Lookbehind, or need to calculate parens/evals/stclass: */
3863 && (scan->flags || data || (flags & SCF_DO_STCLASS))
3864 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
3865 if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3866 || OP(scan) == UNLESSM )
3868 /* Negative Lookahead/lookbehind
3869 In this case we can't do fixed string optimisation.
3872 I32 deltanext, minnext, fake = 0;
3874 struct regnode_charclass_class intrnl;
3877 data_fake.flags = 0;
3879 data_fake.whilem_c = data->whilem_c;
3880 data_fake.last_closep = data->last_closep;
3883 data_fake.last_closep = &fake;
3884 data_fake.pos_delta = delta;
3885 if ( flags & SCF_DO_STCLASS && !scan->flags
3886 && OP(scan) == IFMATCH ) { /* Lookahead */
3887 cl_init(pRExC_state, &intrnl);
3888 data_fake.start_class = &intrnl;
3889 f |= SCF_DO_STCLASS_AND;
3891 if (flags & SCF_WHILEM_VISITED_POS)
3892 f |= SCF_WHILEM_VISITED_POS;
3893 next = regnext(scan);
3894 nscan = NEXTOPER(NEXTOPER(scan));
3895 minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext,
3896 last, &data_fake, stopparen, recursed, NULL, f, depth+1);
3899 FAIL("Variable length lookbehind not implemented");
3901 else if (minnext > (I32)U8_MAX) {
3902 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3904 scan->flags = (U8)minnext;
3907 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3909 if (data_fake.flags & SF_HAS_EVAL)
3910 data->flags |= SF_HAS_EVAL;
3911 data->whilem_c = data_fake.whilem_c;
3913 if (f & SCF_DO_STCLASS_AND) {
3914 if (flags & SCF_DO_STCLASS_OR) {
3915 /* OR before, AND after: ideally we would recurse with
3916 * data_fake to get the AND applied by study of the
3917 * remainder of the pattern, and then derecurse;
3918 * *** HACK *** for now just treat as "no information".
3919 * See [perl #56690].
3921 cl_init(pRExC_state, data->start_class);
3923 /* AND before and after: combine and continue */
3924 const int was = (data->start_class->flags & ANYOF_EOS);
3926 cl_and(data->start_class, &intrnl);
3928 data->start_class->flags |= ANYOF_EOS;
3932 #if PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3934 /* Positive Lookahead/lookbehind
3935 In this case we can do fixed string optimisation,
3936 but we must be careful about it. Note in the case of
3937 lookbehind the positions will be offset by the minimum
3938 length of the pattern, something we won't know about
3939 until after the recurse.
3941 I32 deltanext, fake = 0;
3943 struct regnode_charclass_class intrnl;
3945 /* We use SAVEFREEPV so that when the full compile
3946 is finished perl will clean up the allocated
3947 minlens when it's all done. This way we don't
3948 have to worry about freeing them when we know
3949 they wont be used, which would be a pain.
3952 Newx( minnextp, 1, I32 );
3953 SAVEFREEPV(minnextp);
3956 StructCopy(data, &data_fake, scan_data_t);
3957 if ((flags & SCF_DO_SUBSTR) && data->last_found) {
3960 SCAN_COMMIT(pRExC_state, &data_fake,minlenp);
3961 data_fake.last_found=newSVsv(data->last_found);
3965 data_fake.last_closep = &fake;
3966 data_fake.flags = 0;
3967 data_fake.pos_delta = delta;
3969 data_fake.flags |= SF_IS_INF;
3970 if ( flags & SCF_DO_STCLASS && !scan->flags
3971 && OP(scan) == IFMATCH ) { /* Lookahead */
3972 cl_init(pRExC_state, &intrnl);
3973 data_fake.start_class = &intrnl;
3974 f |= SCF_DO_STCLASS_AND;
3976 if (flags & SCF_WHILEM_VISITED_POS)
3977 f |= SCF_WHILEM_VISITED_POS;
3978 next = regnext(scan);
3979 nscan = NEXTOPER(NEXTOPER(scan));
3981 *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext,
3982 last, &data_fake, stopparen, recursed, NULL, f,depth+1);
3985 FAIL("Variable length lookbehind not implemented");
3987 else if (*minnextp > (I32)U8_MAX) {
3988 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3990 scan->flags = (U8)*minnextp;
3995 if (f & SCF_DO_STCLASS_AND) {
3996 const int was = (data->start_class->flags & ANYOF_EOS);
3998 cl_and(data->start_class, &intrnl);
4000 data->start_class->flags |= ANYOF_EOS;
4003 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
4005 if (data_fake.flags & SF_HAS_EVAL)
4006 data->flags |= SF_HAS_EVAL;
4007 data->whilem_c = data_fake.whilem_c;
4008 if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) {
4009 if (RExC_rx->minlen<*minnextp)
4010 RExC_rx->minlen=*minnextp;
4011 SCAN_COMMIT(pRExC_state, &data_fake, minnextp);
4012 SvREFCNT_dec(data_fake.last_found);
4014 if ( data_fake.minlen_fixed != minlenp )
4016 data->offset_fixed= data_fake.offset_fixed;
4017 data->minlen_fixed= data_fake.minlen_fixed;
4018 data->lookbehind_fixed+= scan->flags;
4020 if ( data_fake.minlen_float != minlenp )
4022 data->minlen_float= data_fake.minlen_float;
4023 data->offset_float_min=data_fake.offset_float_min;
4024 data->offset_float_max=data_fake.offset_float_max;
4025 data->lookbehind_float+= scan->flags;
4034 else if (OP(scan) == OPEN) {
4035 if (stopparen != (I32)ARG(scan))
4038 else if (OP(scan) == CLOSE) {
4039 if (stopparen == (I32)ARG(scan)) {
4042 if ((I32)ARG(scan) == is_par) {
4043 next = regnext(scan);
4045 if ( next && (OP(next) != WHILEM) && next < last)
4046 is_par = 0; /* Disable optimization */
4049 *(data->last_closep) = ARG(scan);
4051 else if (OP(scan) == EVAL) {
4053 data->flags |= SF_HAS_EVAL;
4055 else if ( PL_regkind[OP(scan)] == ENDLIKE ) {
4056 if (flags & SCF_DO_SUBSTR) {
4057 SCAN_COMMIT(pRExC_state,data,minlenp);
4058 flags &= ~SCF_DO_SUBSTR;
4060 if (data && OP(scan)==ACCEPT) {
4061 data->flags |= SCF_SEEN_ACCEPT;
4066 else if (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */
4068 if (flags & SCF_DO_SUBSTR) {
4069 SCAN_COMMIT(pRExC_state,data,minlenp);
4070 data->longest = &(data->longest_float);
4072 is_inf = is_inf_internal = 1;
4073 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
4074 cl_anything(pRExC_state, data->start_class);
4075 flags &= ~SCF_DO_STCLASS;
4077 else if (OP(scan) == GPOS) {
4078 if (!(RExC_rx->extflags & RXf_GPOS_FLOAT) &&
4079 !(delta || is_inf || (data && data->pos_delta)))
4081 if (!(RExC_rx->extflags & RXf_ANCH) && (flags & SCF_DO_SUBSTR))
4082 RExC_rx->extflags |= RXf_ANCH_GPOS;
4083 if (RExC_rx->gofs < (U32)min)
4084 RExC_rx->gofs = min;
4086 RExC_rx->extflags |= RXf_GPOS_FLOAT;
4090 #ifdef TRIE_STUDY_OPT
4091 #ifdef FULL_TRIE_STUDY
4092 else if (PL_regkind[OP(scan)] == TRIE) {
4093 /* NOTE - There is similar code to this block above for handling
4094 BRANCH nodes on the initial study. If you change stuff here
4096 regnode *trie_node= scan;
4097 regnode *tail= regnext(scan);
4098 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
4099 I32 max1 = 0, min1 = I32_MAX;
4100 struct regnode_charclass_class accum;
4102 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
4103 SCAN_COMMIT(pRExC_state, data,minlenp); /* Cannot merge strings after this. */
4104 if (flags & SCF_DO_STCLASS)
4105 cl_init_zero(pRExC_state, &accum);
4111 const regnode *nextbranch= NULL;
4114 for ( word=1 ; word <= trie->wordcount ; word++)
4116 I32 deltanext=0, minnext=0, f = 0, fake;
4117 struct regnode_charclass_class this_class;
4119 data_fake.flags = 0;
4121 data_fake.whilem_c = data->whilem_c;
4122 data_fake.last_closep = data->last_closep;
4125 data_fake.last_closep = &fake;
4126 data_fake.pos_delta = delta;
4127 if (flags & SCF_DO_STCLASS) {
4128 cl_init(pRExC_state, &this_class);
4129 data_fake.start_class = &this_class;
4130 f = SCF_DO_STCLASS_AND;
4132 if (flags & SCF_WHILEM_VISITED_POS)
4133 f |= SCF_WHILEM_VISITED_POS;
4135 if (trie->jump[word]) {
4137 nextbranch = trie_node + trie->jump[0];
4138 scan= trie_node + trie->jump[word];
4139 /* We go from the jump point to the branch that follows
4140 it. Note this means we need the vestigal unused branches
4141 even though they arent otherwise used.
4143 minnext = study_chunk(pRExC_state, &scan, minlenp,
4144 &deltanext, (regnode *)nextbranch, &data_fake,
4145 stopparen, recursed, NULL, f,depth+1);
4147 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
4148 nextbranch= regnext((regnode*)nextbranch);
4150 if (min1 > (I32)(minnext + trie->minlen))
4151 min1 = minnext + trie->minlen;
4152 if (max1 < (I32)(minnext + deltanext + trie->maxlen))
4153 max1 = minnext + deltanext + trie->maxlen;
4154 if (deltanext == I32_MAX)
4155 is_inf = is_inf_internal = 1;
4157 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
4159 if (data_fake.flags & SCF_SEEN_ACCEPT) {
4160 if ( stopmin > min + min1)
4161 stopmin = min + min1;
4162 flags &= ~SCF_DO_SUBSTR;
4164 data->flags |= SCF_SEEN_ACCEPT;
4167 if (data_fake.flags & SF_HAS_EVAL)
4168 data->flags |= SF_HAS_EVAL;
4169 data->whilem_c = data_fake.whilem_c;
4171 if (flags & SCF_DO_STCLASS)
4172 cl_or(pRExC_state, &accum, &this_class);
4175 if (flags & SCF_DO_SUBSTR) {
4176 data->pos_min += min1;
4177 data->pos_delta += max1 - min1;
4178 if (max1 != min1 || is_inf)
4179 data->longest = &(data->longest_float);
4182 delta += max1 - min1;
4183 if (flags & SCF_DO_STCLASS_OR) {
4184 cl_or(pRExC_state, data->start_class, &accum);
4186 cl_and(data->start_class, and_withp);
4187 flags &= ~SCF_DO_STCLASS;
4190 else if (flags & SCF_DO_STCLASS_AND) {
4192 cl_and(data->start_class, &accum);
4193 flags &= ~SCF_DO_STCLASS;
4196 /* Switch to OR mode: cache the old value of
4197 * data->start_class */
4199 StructCopy(data->start_class, and_withp,
4200 struct regnode_charclass_class);
4201 flags &= ~SCF_DO_STCLASS_AND;
4202 StructCopy(&accum, data->start_class,
4203 struct regnode_charclass_class);
4204 flags |= SCF_DO_STCLASS_OR;
4205 data->start_class->flags |= ANYOF_EOS;
4212 else if (PL_regkind[OP(scan)] == TRIE) {
4213 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
4216 min += trie->minlen;
4217 delta += (trie->maxlen - trie->minlen);
4218 flags &= ~SCF_DO_STCLASS; /* xxx */
4219 if (flags & SCF_DO_SUBSTR) {
4220 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
4221 data->pos_min += trie->minlen;
4222 data->pos_delta += (trie->maxlen - trie->minlen);
4223 if (trie->maxlen != trie->minlen)
4224 data->longest = &(data->longest_float);
4226 if (trie->jump) /* no more substrings -- for now /grr*/
4227 flags &= ~SCF_DO_SUBSTR;
4229 #endif /* old or new */
4230 #endif /* TRIE_STUDY_OPT */
4232 /* Else: zero-length, ignore. */
4233 scan = regnext(scan);
4238 stopparen = frame->stop;
4239 frame = frame->prev;
4240 goto fake_study_recurse;
4245 DEBUG_STUDYDATA("pre-fin:",data,depth);
4248 *deltap = is_inf_internal ? I32_MAX : delta;
4249 if (flags & SCF_DO_SUBSTR && is_inf)
4250 data->pos_delta = I32_MAX - data->pos_min;
4251 if (is_par > (I32)U8_MAX)
4253 if (is_par && pars==1 && data) {
4254 data->flags |= SF_IN_PAR;
4255 data->flags &= ~SF_HAS_PAR;
4257 else if (pars && data) {
4258 data->flags |= SF_HAS_PAR;
4259 data->flags &= ~SF_IN_PAR;
4261 if (flags & SCF_DO_STCLASS_OR)
4262 cl_and(data->start_class, and_withp);
4263 if (flags & SCF_TRIE_RESTUDY)
4264 data->flags |= SCF_TRIE_RESTUDY;
4266 DEBUG_STUDYDATA("post-fin:",data,depth);
4268 return min < stopmin ? min : stopmin;
4272 S_add_data(RExC_state_t *pRExC_state, U32 n, const char *s)
4274 U32 count = RExC_rxi->data ? RExC_rxi->data->count : 0;
4276 PERL_ARGS_ASSERT_ADD_DATA;
4278 Renewc(RExC_rxi->data,
4279 sizeof(*RExC_rxi->data) + sizeof(void*) * (count + n - 1),
4280 char, struct reg_data);
4282 Renew(RExC_rxi->data->what, count + n, U8);
4284 Newx(RExC_rxi->data->what, n, U8);
4285 RExC_rxi->data->count = count + n;
4286 Copy(s, RExC_rxi->data->what + count, n, U8);
4290 /*XXX: todo make this not included in a non debugging perl */
4291 #ifndef PERL_IN_XSUB_RE
4293 Perl_reginitcolors(pTHX)
4296 const char * const s = PerlEnv_getenv("PERL_RE_COLORS");
4298 char *t = savepv(s);
4302 t = strchr(t, '\t');
4308 PL_colors[i] = t = (char *)"";
4313 PL_colors[i++] = (char *)"";
4320 #ifdef TRIE_STUDY_OPT
4321 #define CHECK_RESTUDY_GOTO \
4323 (data.flags & SCF_TRIE_RESTUDY) \
4327 #define CHECK_RESTUDY_GOTO
4331 - pregcomp - compile a regular expression into internal code
4333 * We can't allocate space until we know how big the compiled form will be,
4334 * but we can't compile it (and thus know how big it is) until we've got a
4335 * place to put the code. So we cheat: we compile it twice, once with code
4336 * generation turned off and size counting turned on, and once "for real".
4337 * This also means that we don't allocate space until we are sure that the
4338 * thing really will compile successfully, and we never have to move the
4339 * code and thus invalidate pointers into it. (Note that it has to be in
4340 * one piece because free() must be able to free it all.) [NB: not true in perl]
4342 * Beware that the optimization-preparation code in here knows about some
4343 * of the structure of the compiled regexp. [I'll say.]
4348 #ifndef PERL_IN_XSUB_RE
4349 #define RE_ENGINE_PTR &PL_core_reg_engine
4351 extern const struct regexp_engine my_reg_engine;
4352 #define RE_ENGINE_PTR &my_reg_engine
4355 #ifndef PERL_IN_XSUB_RE
4357 Perl_pregcomp(pTHX_ SV * const pattern, const U32 flags)
4360 HV * const table = GvHV(PL_hintgv);
4362 PERL_ARGS_ASSERT_PREGCOMP;
4364 /* Dispatch a request to compile a regexp to correct
4367 SV **ptr= hv_fetchs(table, "regcomp", FALSE);
4368 GET_RE_DEBUG_FLAGS_DECL;
4369 if (ptr && SvIOK(*ptr) && SvIV(*ptr)) {
4370 const regexp_engine *eng=INT2PTR(regexp_engine*,SvIV(*ptr));
4372 PerlIO_printf(Perl_debug_log, "Using engine %"UVxf"\n",
4375 return CALLREGCOMP_ENG(eng, pattern, flags);
4378 return Perl_re_compile(aTHX_ pattern, flags);
4383 Perl_re_compile(pTHX_ SV * const pattern, U32 orig_pm_flags)
4388 register regexp_internal *ri;
4397 /* these are all flags - maybe they should be turned
4398 * into a single int with different bit masks */
4399 I32 sawlookahead = 0;
4402 bool used_setjump = FALSE;
4407 RExC_state_t RExC_state;
4408 RExC_state_t * const pRExC_state = &RExC_state;
4409 #ifdef TRIE_STUDY_OPT
4411 RExC_state_t copyRExC_state;
4413 GET_RE_DEBUG_FLAGS_DECL;
4415 PERL_ARGS_ASSERT_RE_COMPILE;
4417 DEBUG_r(if (!PL_colorset) reginitcolors());
4419 RExC_utf8 = RExC_orig_utf8 = SvUTF8(pattern);
4421 /****************** LONG JUMP TARGET HERE***********************/
4422 /* Longjmp back to here if have to switch in midstream to utf8 */
4423 if (! RExC_orig_utf8) {
4424 JMPENV_PUSH(jump_ret);
4425 used_setjump = TRUE;
4428 if (jump_ret == 0) { /* First time through */
4429 exp = SvPV(pattern, plen);
4431 /* ignore the utf8ness if the pattern is 0 length */
4433 RExC_utf8 = RExC_orig_utf8 = 0;
4437 SV *dsv= sv_newmortal();
4438 RE_PV_QUOTED_DECL(s, RExC_utf8,
4439 dsv, exp, plen, 60);
4440 PerlIO_printf(Perl_debug_log, "%sCompiling REx%s %s\n",
4441 PL_colors[4],PL_colors[5],s);
4444 else { /* longjumped back */
4447 /* If the cause for the longjmp was other than changing to utf8, pop
4448 * our own setjmp, and longjmp to the correct handler */
4449 if (jump_ret != UTF8_LONGJMP) {
4451 JMPENV_JUMP(jump_ret);
4456 /* It's possible to write a regexp in ascii that represents Unicode
4457 codepoints outside of the byte range, such as via \x{100}. If we
4458 detect such a sequence we have to convert the entire pattern to utf8
4459 and then recompile, as our sizing calculation will have been based
4460 on 1 byte == 1 character, but we will need to use utf8 to encode
4461 at least some part of the pattern, and therefore must convert the whole
4464 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log,
4465 "UTF8 mismatch! Converting to utf8 for resizing and compile\n"));
4466 exp = (char*)Perl_bytes_to_utf8(aTHX_ (U8*)SvPV(pattern, plen), &len);
4468 RExC_orig_utf8 = RExC_utf8 = 1;
4472 #ifdef TRIE_STUDY_OPT
4476 /* Set to use unicode semantics if the pattern is in utf8 and has the
4477 * 'dual' charset specified, as it means unicode when utf8 */
4478 pm_flags = orig_pm_flags;
4479 if (RExC_utf8 && ! (pm_flags & (RXf_PMf_LOCALE|RXf_PMf_UNICODE))) {
4480 pm_flags |= RXf_PMf_UNICODE;
4484 RExC_flags = pm_flags;
4488 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
4489 RExC_seen_evals = 0;
4492 /* First pass: determine size, legality. */
4500 RExC_emit = &PL_regdummy;
4501 RExC_whilem_seen = 0;
4502 RExC_open_parens = NULL;
4503 RExC_close_parens = NULL;
4505 RExC_paren_names = NULL;
4507 RExC_paren_name_list = NULL;
4509 RExC_recurse = NULL;
4510 RExC_recurse_count = 0;
4512 #if 0 /* REGC() is (currently) a NOP at the first pass.
4513 * Clever compilers notice this and complain. --jhi */
4514 REGC((U8)REG_MAGIC, (char*)RExC_emit);
4516 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "Starting first pass (sizing)\n"));
4517 if (reg(pRExC_state, 0, &flags,1) == NULL) {
4518 RExC_precomp = NULL;
4522 /* Here, finished first pass. Get rid of any added setjmp */
4527 PerlIO_printf(Perl_debug_log,
4528 "Required size %"IVdf" nodes\n"
4529 "Starting second pass (creation)\n",
4532 RExC_lastparse=NULL;
4534 /* Small enough for pointer-storage convention?
4535 If extralen==0, this means that we will not need long jumps. */
4536 if (RExC_size >= 0x10000L && RExC_extralen)
4537 RExC_size += RExC_extralen;
4540 if (RExC_whilem_seen > 15)
4541 RExC_whilem_seen = 15;
4543 /* Allocate space and zero-initialize. Note, the two step process
4544 of zeroing when in debug mode, thus anything assigned has to
4545 happen after that */
4546 rx = (REGEXP*) newSV_type(SVt_REGEXP);
4547 r = (struct regexp*)SvANY(rx);
4548 Newxc(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode),
4549 char, regexp_internal);
4550 if ( r == NULL || ri == NULL )
4551 FAIL("Regexp out of space");
4553 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
4554 Zero(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode), char);
4556 /* bulk initialize base fields with 0. */
4557 Zero(ri, sizeof(regexp_internal), char);
4560 /* non-zero initialization begins here */
4562 r->engine= RE_ENGINE_PTR;
4563 r->extflags = pm_flags;
4565 bool has_p = ((r->extflags & RXf_PMf_KEEPCOPY) == RXf_PMf_KEEPCOPY);
4566 bool has_charset = cBOOL(r->extflags & (RXf_PMf_LOCALE|RXf_PMf_UNICODE));
4568 /* The caret is output if there are any defaults: if not all the STD
4569 * flags are set, or if no character set specifier is needed */
4571 (((r->extflags & RXf_PMf_STD_PMMOD) != RXf_PMf_STD_PMMOD)
4573 bool has_runon = ((RExC_seen & REG_SEEN_RUN_ON_COMMENT)==REG_SEEN_RUN_ON_COMMENT);
4574 U16 reganch = (U16)((r->extflags & RXf_PMf_STD_PMMOD)
4575 >> RXf_PMf_STD_PMMOD_SHIFT);
4576 const char *fptr = STD_PAT_MODS; /*"msix"*/
4578 /* Allocate for the worst case, which is all the std flags are turned
4579 * on. If more precision is desired, we could do a population count of
4580 * the flags set. This could be done with a small lookup table, or by
4581 * shifting, masking and adding, or even, when available, assembly
4582 * language for a machine-language population count.
4583 * We never output a minus, as all those are defaults, so are
4584 * covered by the caret */
4585 const STRLEN wraplen = plen + has_p + has_runon
4586 + has_default /* If needs a caret */
4587 + has_charset /* If needs a character set specifier */
4588 + (sizeof(STD_PAT_MODS) - 1)
4589 + (sizeof("(?:)") - 1);
4591 p = sv_grow(MUTABLE_SV(rx), wraplen + 1); /* +1 for the ending NUL */
4593 SvFLAGS(rx) |= SvUTF8(pattern);
4596 /* If a default, cover it using the caret */
4598 *p++= DEFAULT_PAT_MOD;
4601 if (r->extflags & RXf_PMf_LOCALE) {
4602 *p++ = LOCALE_PAT_MOD;
4604 *p++ = UNICODE_PAT_MOD;
4608 *p++ = KEEPCOPY_PAT_MOD; /*'p'*/
4611 while((ch = *fptr++)) {
4619 Copy(RExC_precomp, p, plen, char);
4620 assert ((RX_WRAPPED(rx) - p) < 16);
4621 r->pre_prefix = p - RX_WRAPPED(rx);
4627 SvCUR_set(rx, p - SvPVX_const(rx));
4631 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
4633 if (RExC_seen & REG_SEEN_RECURSE) {
4634 Newxz(RExC_open_parens, RExC_npar,regnode *);
4635 SAVEFREEPV(RExC_open_parens);
4636 Newxz(RExC_close_parens,RExC_npar,regnode *);
4637 SAVEFREEPV(RExC_close_parens);
4640 /* Useful during FAIL. */
4641 #ifdef RE_TRACK_PATTERN_OFFSETS
4642 Newxz(ri->u.offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
4643 DEBUG_OFFSETS_r(PerlIO_printf(Perl_debug_log,
4644 "%s %"UVuf" bytes for offset annotations.\n",
4645 ri->u.offsets ? "Got" : "Couldn't get",
4646 (UV)((2*RExC_size+1) * sizeof(U32))));
4648 SetProgLen(ri,RExC_size);
4653 /* Second pass: emit code. */
4654 RExC_flags = pm_flags; /* don't let top level (?i) bleed */
4659 RExC_emit_start = ri->program;
4660 RExC_emit = ri->program;
4661 RExC_emit_bound = ri->program + RExC_size + 1;
4663 /* Store the count of eval-groups for security checks: */
4664 RExC_rx->seen_evals = RExC_seen_evals;
4665 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
4666 if (reg(pRExC_state, 0, &flags,1) == NULL) {
4670 /* XXXX To minimize changes to RE engine we always allocate
4671 3-units-long substrs field. */
4672 Newx(r->substrs, 1, struct reg_substr_data);
4673 if (RExC_recurse_count) {
4674 Newxz(RExC_recurse,RExC_recurse_count,regnode *);
4675 SAVEFREEPV(RExC_recurse);
4679 r->minlen = minlen = sawlookahead = sawplus = sawopen = 0;
4680 Zero(r->substrs, 1, struct reg_substr_data);
4682 #ifdef TRIE_STUDY_OPT
4684 StructCopy(&zero_scan_data, &data, scan_data_t);
4685 copyRExC_state = RExC_state;
4688 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log,"Restudying\n"));
4690 RExC_state = copyRExC_state;
4691 if (seen & REG_TOP_LEVEL_BRANCHES)
4692 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
4694 RExC_seen &= ~REG_TOP_LEVEL_BRANCHES;
4695 if (data.last_found) {
4696 SvREFCNT_dec(data.longest_fixed);
4697 SvREFCNT_dec(data.longest_float);
4698 SvREFCNT_dec(data.last_found);
4700 StructCopy(&zero_scan_data, &data, scan_data_t);
4703 StructCopy(&zero_scan_data, &data, scan_data_t);
4706 /* Dig out information for optimizations. */
4707 r->extflags = RExC_flags; /* was pm_op */
4708 /*dmq: removed as part of de-PMOP: pm->op_pmflags = RExC_flags; */
4711 SvUTF8_on(rx); /* Unicode in it? */
4712 ri->regstclass = NULL;
4713 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
4714 r->intflags |= PREGf_NAUGHTY;
4715 scan = ri->program + 1; /* First BRANCH. */
4717 /* testing for BRANCH here tells us whether there is "must appear"
4718 data in the pattern. If there is then we can use it for optimisations */
4719 if (!(RExC_seen & REG_TOP_LEVEL_BRANCHES)) { /* Only one top-level choice. */
4721 STRLEN longest_float_length, longest_fixed_length;
4722 struct regnode_charclass_class ch_class; /* pointed to by data */
4724 I32 last_close = 0; /* pointed to by data */
4725 regnode *first= scan;
4726 regnode *first_next= regnext(first);
4728 * Skip introductions and multiplicators >= 1
4729 * so that we can extract the 'meat' of the pattern that must
4730 * match in the large if() sequence following.
4731 * NOTE that EXACT is NOT covered here, as it is normally
4732 * picked up by the optimiser separately.
4734 * This is unfortunate as the optimiser isnt handling lookahead
4735 * properly currently.
4738 while ((OP(first) == OPEN && (sawopen = 1)) ||
4739 /* An OR of *one* alternative - should not happen now. */
4740 (OP(first) == BRANCH && OP(first_next) != BRANCH) ||
4741 /* for now we can't handle lookbehind IFMATCH*/
4742 (OP(first) == IFMATCH && !first->flags && (sawlookahead = 1)) ||
4743 (OP(first) == PLUS) ||
4744 (OP(first) == MINMOD) ||
4745 /* An {n,m} with n>0 */
4746 (PL_regkind[OP(first)] == CURLY && ARG1(first) > 0) ||
4747 (OP(first) == NOTHING && PL_regkind[OP(first_next)] != END ))
4750 * the only op that could be a regnode is PLUS, all the rest
4751 * will be regnode_1 or regnode_2.
4754 if (OP(first) == PLUS)
4757 first += regarglen[OP(first)];
4759 first = NEXTOPER(first);
4760 first_next= regnext(first);
4763 /* Starting-point info. */
4765 DEBUG_PEEP("first:",first,0);
4766 /* Ignore EXACT as we deal with it later. */
4767 if (PL_regkind[OP(first)] == EXACT) {
4768 if (OP(first) == EXACT)
4769 NOOP; /* Empty, get anchored substr later. */
4771 ri->regstclass = first;
4774 else if (PL_regkind[OP(first)] == TRIE &&
4775 ((reg_trie_data *)ri->data->data[ ARG(first) ])->minlen>0)
4778 /* this can happen only on restudy */
4779 if ( OP(first) == TRIE ) {
4780 struct regnode_1 *trieop = (struct regnode_1 *)
4781 PerlMemShared_calloc(1, sizeof(struct regnode_1));
4782 StructCopy(first,trieop,struct regnode_1);
4783 trie_op=(regnode *)trieop;
4785 struct regnode_charclass *trieop = (struct regnode_charclass *)
4786 PerlMemShared_calloc(1, sizeof(struct regnode_charclass));
4787 StructCopy(first,trieop,struct regnode_charclass);
4788 trie_op=(regnode *)trieop;
4791 make_trie_failtable(pRExC_state, (regnode *)first, trie_op, 0);
4792 ri->regstclass = trie_op;
4795 else if (REGNODE_SIMPLE(OP(first)))
4796 ri->regstclass = first;
4797 else if (PL_regkind[OP(first)] == BOUND ||
4798 PL_regkind[OP(first)] == NBOUND)
4799 ri->regstclass = first;
4800 else if (PL_regkind[OP(first)] == BOL) {
4801 r->extflags |= (OP(first) == MBOL
4803 : (OP(first) == SBOL
4806 first = NEXTOPER(first);
4809 else if (OP(first) == GPOS) {
4810 r->extflags |= RXf_ANCH_GPOS;
4811 first = NEXTOPER(first);
4814 else if ((!sawopen || !RExC_sawback) &&
4815 (OP(first) == STAR &&
4816 PL_regkind[OP(NEXTOPER(first))] == REG_ANY) &&
4817 !(r->extflags & RXf_ANCH) && !(RExC_seen & REG_SEEN_EVAL))
4819 /* turn .* into ^.* with an implied $*=1 */
4821 (OP(NEXTOPER(first)) == REG_ANY)
4824 r->extflags |= type;
4825 r->intflags |= PREGf_IMPLICIT;
4826 first = NEXTOPER(first);
4829 if (sawplus && !sawlookahead && (!sawopen || !RExC_sawback)
4830 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
4831 /* x+ must match at the 1st pos of run of x's */
4832 r->intflags |= PREGf_SKIP;
4834 /* Scan is after the zeroth branch, first is atomic matcher. */
4835 #ifdef TRIE_STUDY_OPT
4838 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4839 (IV)(first - scan + 1))
4843 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4844 (IV)(first - scan + 1))
4850 * If there's something expensive in the r.e., find the
4851 * longest literal string that must appear and make it the
4852 * regmust. Resolve ties in favor of later strings, since
4853 * the regstart check works with the beginning of the r.e.
4854 * and avoiding duplication strengthens checking. Not a
4855 * strong reason, but sufficient in the absence of others.
4856 * [Now we resolve ties in favor of the earlier string if
4857 * it happens that c_offset_min has been invalidated, since the
4858 * earlier string may buy us something the later one won't.]
4861 data.longest_fixed = newSVpvs("");
4862 data.longest_float = newSVpvs("");
4863 data.last_found = newSVpvs("");
4864 data.longest = &(data.longest_fixed);
4866 if (!ri->regstclass) {
4867 cl_init(pRExC_state, &ch_class);
4868 data.start_class = &ch_class;
4869 stclass_flag = SCF_DO_STCLASS_AND;
4870 } else /* XXXX Check for BOUND? */
4872 data.last_closep = &last_close;
4874 minlen = study_chunk(pRExC_state, &first, &minlen, &fake, scan + RExC_size, /* Up to end */
4875 &data, -1, NULL, NULL,
4876 SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag,0);
4882 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
4883 && data.last_start_min == 0 && data.last_end > 0
4884 && !RExC_seen_zerolen
4885 && !(RExC_seen & REG_SEEN_VERBARG)
4886 && (!(RExC_seen & REG_SEEN_GPOS) || (r->extflags & RXf_ANCH_GPOS)))
4887 r->extflags |= RXf_CHECK_ALL;
4888 scan_commit(pRExC_state, &data,&minlen,0);
4889 SvREFCNT_dec(data.last_found);
4891 /* Note that code very similar to this but for anchored string
4892 follows immediately below, changes may need to be made to both.
4895 longest_float_length = CHR_SVLEN(data.longest_float);
4896 if (longest_float_length
4897 || (data.flags & SF_FL_BEFORE_EOL
4898 && (!(data.flags & SF_FL_BEFORE_MEOL)
4899 || (RExC_flags & RXf_PMf_MULTILINE))))
4903 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
4904 && data.offset_fixed == data.offset_float_min
4905 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
4906 goto remove_float; /* As in (a)+. */
4908 /* copy the information about the longest float from the reg_scan_data
4909 over to the program. */
4910 if (SvUTF8(data.longest_float)) {
4911 r->float_utf8 = data.longest_float;
4912 r->float_substr = NULL;
4914 r->float_substr = data.longest_float;
4915 r->float_utf8 = NULL;
4917 /* float_end_shift is how many chars that must be matched that
4918 follow this item. We calculate it ahead of time as once the
4919 lookbehind offset is added in we lose the ability to correctly
4921 ml = data.minlen_float ? *(data.minlen_float)
4922 : (I32)longest_float_length;
4923 r->float_end_shift = ml - data.offset_float_min
4924 - longest_float_length + (SvTAIL(data.longest_float) != 0)
4925 + data.lookbehind_float;
4926 r->float_min_offset = data.offset_float_min - data.lookbehind_float;
4927 r->float_max_offset = data.offset_float_max;
4928 if (data.offset_float_max < I32_MAX) /* Don't offset infinity */
4929 r->float_max_offset -= data.lookbehind_float;
4931 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
4932 && (!(data.flags & SF_FL_BEFORE_MEOL)
4933 || (RExC_flags & RXf_PMf_MULTILINE)));
4934 fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0);
4938 r->float_substr = r->float_utf8 = NULL;
4939 SvREFCNT_dec(data.longest_float);
4940 longest_float_length = 0;
4943 /* Note that code very similar to this but for floating string
4944 is immediately above, changes may need to be made to both.
4947 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
4948 if (longest_fixed_length
4949 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
4950 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4951 || (RExC_flags & RXf_PMf_MULTILINE))))
4955 /* copy the information about the longest fixed
4956 from the reg_scan_data over to the program. */
4957 if (SvUTF8(data.longest_fixed)) {
4958 r->anchored_utf8 = data.longest_fixed;
4959 r->anchored_substr = NULL;
4961 r->anchored_substr = data.longest_fixed;
4962 r->anchored_utf8 = NULL;
4964 /* fixed_end_shift is how many chars that must be matched that
4965 follow this item. We calculate it ahead of time as once the
4966 lookbehind offset is added in we lose the ability to correctly
4968 ml = data.minlen_fixed ? *(data.minlen_fixed)
4969 : (I32)longest_fixed_length;
4970 r->anchored_end_shift = ml - data.offset_fixed
4971 - longest_fixed_length + (SvTAIL(data.longest_fixed) != 0)
4972 + data.lookbehind_fixed;
4973 r->anchored_offset = data.offset_fixed - data.lookbehind_fixed;
4975 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
4976 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4977 || (RExC_flags & RXf_PMf_MULTILINE)));
4978 fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0);
4981 r->anchored_substr = r->anchored_utf8 = NULL;
4982 SvREFCNT_dec(data.longest_fixed);
4983 longest_fixed_length = 0;
4986 && (OP(ri->regstclass) == REG_ANY || OP(ri->regstclass) == SANY))
4987 ri->regstclass = NULL;
4988 if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset)
4990 && !(data.start_class->flags & ANYOF_EOS)
4991 && !cl_is_anything(data.start_class))
4993 const U32 n = add_data(pRExC_state, 1, "f");
4995 Newx(RExC_rxi->data->data[n], 1,
4996 struct regnode_charclass_class);
4997 StructCopy(data.start_class,
4998 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
4999 struct regnode_charclass_class);
5000 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
5001 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
5002 DEBUG_COMPILE_r({ SV *sv = sv_newmortal();
5003 regprop(r, sv, (regnode*)data.start_class);
5004 PerlIO_printf(Perl_debug_log,
5005 "synthetic stclass \"%s\".\n",
5006 SvPVX_const(sv));});
5009 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
5010 if (longest_fixed_length > longest_float_length) {
5011 r->check_end_shift = r->anchored_end_shift;
5012 r->check_substr = r->anchored_substr;
5013 r->check_utf8 = r->anchored_utf8;
5014 r->check_offset_min = r->check_offset_max = r->anchored_offset;
5015 if (r->extflags & RXf_ANCH_SINGLE)
5016 r->extflags |= RXf_NOSCAN;
5019 r->check_end_shift = r->float_end_shift;
5020 r->check_substr = r->float_substr;
5021 r->check_utf8 = r->float_utf8;
5022 r->check_offset_min = r->float_min_offset;
5023 r->check_offset_max = r->float_max_offset;
5025 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
5026 This should be changed ASAP! */
5027 if ((r->check_substr || r->check_utf8) && !(r->extflags & RXf_ANCH_GPOS)) {
5028 r->extflags |= RXf_USE_INTUIT;
5029 if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8))
5030 r->extflags |= RXf_INTUIT_TAIL;
5032 /* XXX Unneeded? dmq (shouldn't as this is handled elsewhere)
5033 if ( (STRLEN)minlen < longest_float_length )
5034 minlen= longest_float_length;
5035 if ( (STRLEN)minlen < longest_fixed_length )
5036 minlen= longest_fixed_length;
5040 /* Several toplevels. Best we can is to set minlen. */
5042 struct regnode_charclass_class ch_class;
5045 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "\nMulti Top Level\n"));
5047 scan = ri->program + 1;
5048 cl_init(pRExC_state, &ch_class);
5049 data.start_class = &ch_class;
5050 data.last_closep = &last_close;
5053 minlen = study_chunk(pRExC_state, &scan, &minlen, &fake, scan + RExC_size,
5054 &data, -1, NULL, NULL, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS,0);
5058 r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8
5059 = r->float_substr = r->float_utf8 = NULL;
5060 if (!(data.start_class->flags & ANYOF_EOS)
5061 && !cl_is_anything(data.start_class))
5063 const U32 n = add_data(pRExC_state, 1, "f");
5065 Newx(RExC_rxi->data->data[n], 1,
5066 struct regnode_charclass_class);
5067 StructCopy(data.start_class,
5068 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
5069 struct regnode_charclass_class);
5070 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
5071 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
5072 DEBUG_COMPILE_r({ SV* sv = sv_newmortal();
5073 regprop(r, sv, (regnode*)data.start_class);
5074 PerlIO_printf(Perl_debug_log,
5075 "synthetic stclass \"%s\".\n",
5076 SvPVX_const(sv));});
5080 /* Guard against an embedded (?=) or (?<=) with a longer minlen than
5081 the "real" pattern. */
5083 PerlIO_printf(Perl_debug_log,"minlen: %"IVdf" r->minlen:%"IVdf"\n",
5084 (IV)minlen, (IV)r->minlen);
5086 r->minlenret = minlen;
5087 if (r->minlen < minlen)
5090 if (RExC_seen & REG_SEEN_GPOS)
5091 r->extflags |= RXf_GPOS_SEEN;
5092 if (RExC_seen & REG_SEEN_LOOKBEHIND)
5093 r->extflags |= RXf_LOOKBEHIND_SEEN;
5094 if (RExC_seen & REG_SEEN_EVAL)
5095 r->extflags |= RXf_EVAL_SEEN;
5096 if (RExC_seen & REG_SEEN_CANY)
5097 r->extflags |= RXf_CANY_SEEN;
5098 if (RExC_seen & REG_SEEN_VERBARG)
5099 r->intflags |= PREGf_VERBARG_SEEN;
5100 if (RExC_seen & REG_SEEN_CUTGROUP)
5101 r->intflags |= PREGf_CUTGROUP_SEEN;
5102 if (RExC_paren_names)
5103 RXp_PAREN_NAMES(r) = MUTABLE_HV(SvREFCNT_inc(RExC_paren_names));
5105 RXp_PAREN_NAMES(r) = NULL;
5107 #ifdef STUPID_PATTERN_CHECKS
5108 if (RX_PRELEN(rx) == 0)
5109 r->extflags |= RXf_NULL;
5110 if (r->extflags & RXf_SPLIT && RX_PRELEN(rx) == 1 && RX_PRECOMP(rx)[0] == ' ')
5111 /* XXX: this should happen BEFORE we compile */
5112 r->extflags |= (RXf_SKIPWHITE|RXf_WHITE);
5113 else if (RX_PRELEN(rx) == 3 && memEQ("\\s+", RX_PRECOMP(rx), 3))
5114 r->extflags |= RXf_WHITE;
5115 else if (RX_PRELEN(rx) == 1 && RXp_PRECOMP(rx)[0] == '^')
5116 r->extflags |= RXf_START_ONLY;
5118 if (r->extflags & RXf_SPLIT && RX_PRELEN(rx) == 1 && RX_PRECOMP(rx)[0] == ' ')
5119 /* XXX: this should happen BEFORE we compile */
5120 r->extflags |= (RXf_SKIPWHITE|RXf_WHITE);
5122 regnode *first = ri->program + 1;
5124 U8 nop = OP(NEXTOPER(first));
5126 if (PL_regkind[fop] == NOTHING && nop == END)
5127 r->extflags |= RXf_NULL;
5128 else if (PL_regkind[fop] == BOL && nop == END)
5129 r->extflags |= RXf_START_ONLY;
5130 else if (fop == PLUS && nop ==SPACE && OP(regnext(first))==END)
5131 r->extflags |= RXf_WHITE;
5135 if (RExC_paren_names) {
5136 ri->name_list_idx = add_data( pRExC_state, 1, "a" );
5137 ri->data->data[ri->name_list_idx] = (void*)SvREFCNT_inc(RExC_paren_name_list);
5140 ri->name_list_idx = 0;
5142 if (RExC_recurse_count) {
5143 for ( ; RExC_recurse_count ; RExC_recurse_count-- ) {
5144 const regnode *scan = RExC_recurse[RExC_recurse_count-1];
5145 ARG2L_SET( scan, RExC_open_parens[ARG(scan)-1] - scan );
5148 Newxz(r->offs, RExC_npar, regexp_paren_pair);
5149 /* assume we don't need to swap parens around before we match */
5152 PerlIO_printf(Perl_debug_log,"Final program:\n");
5155 #ifdef RE_TRACK_PATTERN_OFFSETS
5156 DEBUG_OFFSETS_r(if (ri->u.offsets) {
5157 const U32 len = ri->u.offsets[0];
5159 GET_RE_DEBUG_FLAGS_DECL;
5160 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)ri->u.offsets[0]);
5161 for (i = 1; i <= len; i++) {
5162 if (ri->u.offsets[i*2-1] || ri->u.offsets[i*2])
5163 PerlIO_printf(Perl_debug_log, "%"UVuf":%"UVuf"[%"UVuf"] ",
5164 (UV)i, (UV)ri->u.offsets[i*2-1], (UV)ri->u.offsets[i*2]);
5166 PerlIO_printf(Perl_debug_log, "\n");
5172 #undef RE_ENGINE_PTR
5176 Perl_reg_named_buff(pTHX_ REGEXP * const rx, SV * const key, SV * const value,
5179 PERL_ARGS_ASSERT_REG_NAMED_BUFF;
5181 PERL_UNUSED_ARG(value);
5183 if (flags & RXapif_FETCH) {
5184 return reg_named_buff_fetch(rx, key, flags);
5185 } else if (flags & (RXapif_STORE | RXapif_DELETE | RXapif_CLEAR)) {
5186 Perl_croak_no_modify(aTHX);
5188 } else if (flags & RXapif_EXISTS) {
5189 return reg_named_buff_exists(rx, key, flags)
5192 } else if (flags & RXapif_REGNAMES) {
5193 return reg_named_buff_all(rx, flags);
5194 } else if (flags & (RXapif_SCALAR | RXapif_REGNAMES_COUNT)) {
5195 return reg_named_buff_scalar(rx, flags);
5197 Perl_croak(aTHX_ "panic: Unknown flags %d in named_buff", (int)flags);
5203 Perl_reg_named_buff_iter(pTHX_ REGEXP * const rx, const SV * const lastkey,
5206 PERL_ARGS_ASSERT_REG_NAMED_BUFF_ITER;
5207 PERL_UNUSED_ARG(lastkey);
5209 if (flags & RXapif_FIRSTKEY)
5210 return reg_named_buff_firstkey(rx, flags);
5211 else if (flags & RXapif_NEXTKEY)
5212 return reg_named_buff_nextkey(rx, flags);
5214 Perl_croak(aTHX_ "panic: Unknown flags %d in named_buff_iter", (int)flags);
5220 Perl_reg_named_buff_fetch(pTHX_ REGEXP * const r, SV * const namesv,
5223 AV *retarray = NULL;
5225 struct regexp *const rx = (struct regexp *)SvANY(r);
5227 PERL_ARGS_ASSERT_REG_NAMED_BUFF_FETCH;
5229 if (flags & RXapif_ALL)
5232 if (rx && RXp_PAREN_NAMES(rx)) {
5233 HE *he_str = hv_fetch_ent( RXp_PAREN_NAMES(rx), namesv, 0, 0 );
5236 SV* sv_dat=HeVAL(he_str);
5237 I32 *nums=(I32*)SvPVX(sv_dat);
5238 for ( i=0; i<SvIVX(sv_dat); i++ ) {
5239 if ((I32)(rx->nparens) >= nums[i]
5240 && rx->offs[nums[i]].start != -1
5241 && rx->offs[nums[i]].end != -1)
5244 CALLREG_NUMBUF_FETCH(r,nums[i],ret);
5248 ret = newSVsv(&PL_sv_undef);
5251 av_push(retarray, ret);
5254 return newRV_noinc(MUTABLE_SV(retarray));
5261 Perl_reg_named_buff_exists(pTHX_ REGEXP * const r, SV * const key,
5264 struct regexp *const rx = (struct regexp *)SvANY(r);
5266 PERL_ARGS_ASSERT_REG_NAMED_BUFF_EXISTS;
5268 if (rx && RXp_PAREN_NAMES(rx)) {
5269 if (flags & RXapif_ALL) {
5270 return hv_exists_ent(RXp_PAREN_NAMES(rx), key, 0);
5272 SV *sv = CALLREG_NAMED_BUFF_FETCH(r, key, flags);
5286 Perl_reg_named_buff_firstkey(pTHX_ REGEXP * const r, const U32 flags)
5288 struct regexp *const rx = (struct regexp *)SvANY(r);
5290 PERL_ARGS_ASSERT_REG_NAMED_BUFF_FIRSTKEY;
5292 if ( rx && RXp_PAREN_NAMES(rx) ) {
5293 (void)hv_iterinit(RXp_PAREN_NAMES(rx));
5295 return CALLREG_NAMED_BUFF_NEXTKEY(r, NULL, flags & ~RXapif_FIRSTKEY);
5302 Perl_reg_named_buff_nextkey(pTHX_ REGEXP * const r, const U32 flags)
5304 struct regexp *const rx = (struct regexp *)SvANY(r);
5305 GET_RE_DEBUG_FLAGS_DECL;
5307 PERL_ARGS_ASSERT_REG_NAMED_BUFF_NEXTKEY;
5309 if (rx && RXp_PAREN_NAMES(rx)) {
5310 HV *hv = RXp_PAREN_NAMES(rx);
5312 while ( (temphe = hv_iternext_flags(hv,0)) ) {
5315 SV* sv_dat = HeVAL(temphe);
5316 I32 *nums = (I32*)SvPVX(sv_dat);
5317 for ( i = 0; i < SvIVX(sv_dat); i++ ) {
5318 if ((I32)(rx->lastparen) >= nums[i] &&
5319 rx->offs[nums[i]].start != -1 &&
5320 rx->offs[nums[i]].end != -1)
5326 if (parno || flags & RXapif_ALL) {
5327 return newSVhek(HeKEY_hek(temphe));
5335 Perl_reg_named_buff_scalar(pTHX_ REGEXP * const r, const U32 flags)
5340 struct regexp *const rx = (struct regexp *)SvANY(r);
5342 PERL_ARGS_ASSERT_REG_NAMED_BUFF_SCALAR;
5344 if (rx && RXp_PAREN_NAMES(rx)) {
5345 if (flags & (RXapif_ALL | RXapif_REGNAMES_COUNT)) {
5346 return newSViv(HvTOTALKEYS(RXp_PAREN_NAMES(rx)));
5347 } else if (flags & RXapif_ONE) {
5348 ret = CALLREG_NAMED_BUFF_ALL(r, (flags | RXapif_REGNAMES));
5349 av = MUTABLE_AV(SvRV(ret));
5350 length = av_len(av);
5352 return newSViv(length + 1);
5354 Perl_croak(aTHX_ "panic: Unknown flags %d in named_buff_scalar", (int)flags);
5358 return &PL_sv_undef;
5362 Perl_reg_named_buff_all(pTHX_ REGEXP * const r, const U32 flags)
5364 struct regexp *const rx = (struct regexp *)SvANY(r);
5367 PERL_ARGS_ASSERT_REG_NAMED_BUFF_ALL;
5369 if (rx && RXp_PAREN_NAMES(rx)) {
5370 HV *hv= RXp_PAREN_NAMES(rx);
5372 (void)hv_iterinit(hv);
5373 while ( (temphe = hv_iternext_flags(hv,0)) ) {
5376 SV* sv_dat = HeVAL(temphe);
5377 I32 *nums = (I32*)SvPVX(sv_dat);
5378 for ( i = 0; i < SvIVX(sv_dat); i++ ) {
5379 if ((I32)(rx->lastparen) >= nums[i] &&
5380 rx->offs[nums[i]].start != -1 &&
5381 rx->offs[nums[i]].end != -1)
5387 if (parno || flags & RXapif_ALL) {
5388 av_push(av, newSVhek(HeKEY_hek(temphe)));
5393 return newRV_noinc(MUTABLE_SV(av));
5397 Perl_reg_numbered_buff_fetch(pTHX_ REGEXP * const r, const I32 paren,
5400 struct regexp *const rx = (struct regexp *)SvANY(r);
5405 PERL_ARGS_ASSERT_REG_NUMBERED_BUFF_FETCH;
5408 sv_setsv(sv,&PL_sv_undef);
5412 if (paren == RX_BUFF_IDX_PREMATCH && rx->offs[0].start != -1) {
5414 i = rx->offs[0].start;
5418 if (paren == RX_BUFF_IDX_POSTMATCH && rx->offs[0].end != -1) {
5420 s = rx->subbeg + rx->offs[0].end;
5421 i = rx->sublen - rx->offs[0].end;
5424 if ( 0 <= paren && paren <= (I32)rx->nparens &&
5425 (s1 = rx->offs[paren].start) != -1 &&
5426 (t1 = rx->offs[paren].end) != -1)
5430 s = rx->subbeg + s1;
5432 sv_setsv(sv,&PL_sv_undef);
5435 assert(rx->sublen >= (s - rx->subbeg) + i );
5437 const int oldtainted = PL_tainted;
5439 sv_setpvn(sv, s, i);
5440 PL_tainted = oldtainted;
5441 if ( (rx->extflags & RXf_CANY_SEEN)
5442 ? (RXp_MATCH_UTF8(rx)
5443 && (!i || is_utf8_string((U8*)s, i)))
5444 : (RXp_MATCH_UTF8(rx)) )
5451 if (RXp_MATCH_TAINTED(rx)) {
5452 if (SvTYPE(sv) >= SVt_PVMG) {
5453 MAGIC* const mg = SvMAGIC(sv);
5456 SvMAGIC_set(sv, mg->mg_moremagic);
5458 if ((mgt = SvMAGIC(sv))) {
5459 mg->mg_moremagic = mgt;
5460 SvMAGIC_set(sv, mg);
5470 sv_setsv(sv,&PL_sv_undef);
5476 Perl_reg_numbered_buff_store(pTHX_ REGEXP * const rx, const I32 paren,
5477 SV const * const value)
5479 PERL_ARGS_ASSERT_REG_NUMBERED_BUFF_STORE;
5481 PERL_UNUSED_ARG(rx);
5482 PERL_UNUSED_ARG(paren);
5483 PERL_UNUSED_ARG(value);
5486 Perl_croak_no_modify(aTHX);
5490 Perl_reg_numbered_buff_length(pTHX_ REGEXP * const r, const SV * const sv,
5493 struct regexp *const rx = (struct regexp *)SvANY(r);
5497 PERL_ARGS_ASSERT_REG_NUMBERED_BUFF_LENGTH;
5499 /* Some of this code was originally in C<Perl_magic_len> in F<mg.c> */
5501 /* $` / ${^PREMATCH} */
5502 case RX_BUFF_IDX_PREMATCH:
5503 if (rx->offs[0].start != -1) {
5504 i = rx->offs[0].start;
5512 /* $' / ${^POSTMATCH} */
5513 case RX_BUFF_IDX_POSTMATCH:
5514 if (rx->offs[0].end != -1) {
5515 i = rx->sublen - rx->offs[0].end;
5517 s1 = rx->offs[0].end;
5523 /* $& / ${^MATCH}, $1, $2, ... */
5525 if (paren <= (I32)rx->nparens &&
5526 (s1 = rx->offs[paren].start) != -1 &&
5527 (t1 = rx->offs[paren].end) != -1)
5532 if (ckWARN(WARN_UNINITIALIZED))
5533 report_uninit((const SV *)sv);
5538 if (i > 0 && RXp_MATCH_UTF8(rx)) {
5539 const char * const s = rx->subbeg + s1;
5544 if (is_utf8_string_loclen((U8*)s, i, &ep, &el))
5551 Perl_reg_qr_package(pTHX_ REGEXP * const rx)
5553 PERL_ARGS_ASSERT_REG_QR_PACKAGE;
5554 PERL_UNUSED_ARG(rx);
5558 return newSVpvs("Regexp");
5561 /* Scans the name of a named buffer from the pattern.
5562 * If flags is REG_RSN_RETURN_NULL returns null.
5563 * If flags is REG_RSN_RETURN_NAME returns an SV* containing the name
5564 * If flags is REG_RSN_RETURN_DATA returns the data SV* corresponding
5565 * to the parsed name as looked up in the RExC_paren_names hash.
5566 * If there is an error throws a vFAIL().. type exception.
5569 #define REG_RSN_RETURN_NULL 0
5570 #define REG_RSN_RETURN_NAME 1
5571 #define REG_RSN_RETURN_DATA 2
5574 S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags)
5576 char *name_start = RExC_parse;
5578 PERL_ARGS_ASSERT_REG_SCAN_NAME;
5580 if (isIDFIRST_lazy_if(RExC_parse, UTF)) {
5581 /* skip IDFIRST by using do...while */
5584 RExC_parse += UTF8SKIP(RExC_parse);
5585 } while (isALNUM_utf8((U8*)RExC_parse));
5589 } while (isALNUM(*RExC_parse));
5594 = newSVpvn_flags(name_start, (int)(RExC_parse - name_start),
5595 SVs_TEMP | (UTF ? SVf_UTF8 : 0));
5596 if ( flags == REG_RSN_RETURN_NAME)
5598 else if (flags==REG_RSN_RETURN_DATA) {
5601 if ( ! sv_name ) /* should not happen*/
5602 Perl_croak(aTHX_ "panic: no svname in reg_scan_name");
5603 if (RExC_paren_names)
5604 he_str = hv_fetch_ent( RExC_paren_names, sv_name, 0, 0 );
5606 sv_dat = HeVAL(he_str);
5608 vFAIL("Reference to nonexistent named group");
5612 Perl_croak(aTHX_ "panic: bad flag in reg_scan_name");
5619 #define DEBUG_PARSE_MSG(funcname) DEBUG_PARSE_r({ \
5620 int rem=(int)(RExC_end - RExC_parse); \
5629 if (RExC_lastparse!=RExC_parse) \
5630 PerlIO_printf(Perl_debug_log," >%.*s%-*s", \
5633 iscut ? "..." : "<" \
5636 PerlIO_printf(Perl_debug_log,"%16s",""); \
5639 num = RExC_size + 1; \
5641 num=REG_NODE_NUM(RExC_emit); \
5642 if (RExC_lastnum!=num) \
5643 PerlIO_printf(Perl_debug_log,"|%4d",num); \
5645 PerlIO_printf(Perl_debug_log,"|%4s",""); \
5646 PerlIO_printf(Perl_debug_log,"|%*s%-4s", \
5647 (int)((depth*2)), "", \
5651 RExC_lastparse=RExC_parse; \
5656 #define DEBUG_PARSE(funcname) DEBUG_PARSE_r({ \
5657 DEBUG_PARSE_MSG((funcname)); \
5658 PerlIO_printf(Perl_debug_log,"%4s","\n"); \
5660 #define DEBUG_PARSE_FMT(funcname,fmt,args) DEBUG_PARSE_r({ \
5661 DEBUG_PARSE_MSG((funcname)); \
5662 PerlIO_printf(Perl_debug_log,fmt "\n",args); \
5665 - reg - regular expression, i.e. main body or parenthesized thing
5667 * Caller must absorb opening parenthesis.
5669 * Combining parenthesis handling with the base level of regular expression
5670 * is a trifle forced, but the need to tie the tails of the branches to what
5671 * follows makes it hard to avoid.
5673 #define REGTAIL(x,y,z) regtail((x),(y),(z),depth+1)
5675 #define REGTAIL_STUDY(x,y,z) regtail_study((x),(y),(z),depth+1)
5677 #define REGTAIL_STUDY(x,y,z) regtail((x),(y),(z),depth+1)
5681 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp,U32 depth)
5682 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
5685 register regnode *ret; /* Will be the head of the group. */
5686 register regnode *br;
5687 register regnode *lastbr;
5688 register regnode *ender = NULL;
5689 register I32 parno = 0;
5691 U32 oregflags = RExC_flags;
5692 bool have_branch = 0;
5694 I32 freeze_paren = 0;
5695 I32 after_freeze = 0;
5697 /* for (?g), (?gc), and (?o) warnings; warning
5698 about (?c) will warn about (?g) -- japhy */
5700 #define WASTED_O 0x01
5701 #define WASTED_G 0x02
5702 #define WASTED_C 0x04
5703 #define WASTED_GC (0x02|0x04)
5704 I32 wastedflags = 0x00;
5706 char * parse_start = RExC_parse; /* MJD */
5707 char * const oregcomp_parse = RExC_parse;
5709 GET_RE_DEBUG_FLAGS_DECL;
5711 PERL_ARGS_ASSERT_REG;
5712 DEBUG_PARSE("reg ");
5714 *flagp = 0; /* Tentatively. */
5717 /* Make an OPEN node, if parenthesized. */
5719 if ( *RExC_parse == '*') { /* (*VERB:ARG) */
5720 char *start_verb = RExC_parse;
5721 STRLEN verb_len = 0;
5722 char *start_arg = NULL;
5723 unsigned char op = 0;
5725 int internal_argval = 0; /* internal_argval is only useful if !argok */
5726 while ( *RExC_parse && *RExC_parse != ')' ) {
5727 if ( *RExC_parse == ':' ) {
5728 start_arg = RExC_parse + 1;
5734 verb_len = RExC_parse - start_verb;
5737 while ( *RExC_parse && *RExC_parse != ')' )
5739 if ( *RExC_parse != ')' )
5740 vFAIL("Unterminated verb pattern argument");
5741 if ( RExC_parse == start_arg )
5744 if ( *RExC_parse != ')' )
5745 vFAIL("Unterminated verb pattern");
5748 switch ( *start_verb ) {
5749 case 'A': /* (*ACCEPT) */
5750 if ( memEQs(start_verb,verb_len,"ACCEPT") ) {
5752 internal_argval = RExC_nestroot;
5755 case 'C': /* (*COMMIT) */
5756 if ( memEQs(start_verb,verb_len,"COMMIT") )
5759 case 'F': /* (*FAIL) */
5760 if ( verb_len==1 || memEQs(start_verb,verb_len,"FAIL") ) {
5765 case ':': /* (*:NAME) */
5766 case 'M': /* (*MARK:NAME) */
5767 if ( verb_len==0 || memEQs(start_verb,verb_len,"MARK") ) {
5772 case 'P': /* (*PRUNE) */
5773 if ( memEQs(start_verb,verb_len,"PRUNE") )
5776 case 'S': /* (*SKIP) */
5777 if ( memEQs(start_verb,verb_len,"SKIP") )
5780 case 'T': /* (*THEN) */
5781 /* [19:06] <TimToady> :: is then */
5782 if ( memEQs(start_verb,verb_len,"THEN") ) {
5784 RExC_seen |= REG_SEEN_CUTGROUP;
5790 vFAIL3("Unknown verb pattern '%.*s'",
5791 verb_len, start_verb);
5794 if ( start_arg && internal_argval ) {
5795 vFAIL3("Verb pattern '%.*s' may not have an argument",
5796 verb_len, start_verb);
5797 } else if ( argok < 0 && !start_arg ) {
5798 vFAIL3("Verb pattern '%.*s' has a mandatory argument",
5799 verb_len, start_verb);
5801 ret = reganode(pRExC_state, op, internal_argval);
5802 if ( ! internal_argval && ! SIZE_ONLY ) {
5804 SV *sv = newSVpvn( start_arg, RExC_parse - start_arg);
5805 ARG(ret) = add_data( pRExC_state, 1, "S" );
5806 RExC_rxi->data->data[ARG(ret)]=(void*)sv;
5813 if (!internal_argval)
5814 RExC_seen |= REG_SEEN_VERBARG;
5815 } else if ( start_arg ) {
5816 vFAIL3("Verb pattern '%.*s' may not have an argument",
5817 verb_len, start_verb);
5819 ret = reg_node(pRExC_state, op);
5821 nextchar(pRExC_state);
5824 if (*RExC_parse == '?') { /* (?...) */
5825 bool is_logical = 0;
5826 const char * const seqstart = RExC_parse;
5827 bool has_use_defaults = FALSE;
5830 paren = *RExC_parse++;
5831 ret = NULL; /* For look-ahead/behind. */
5834 case 'P': /* (?P...) variants for those used to PCRE/Python */
5835 paren = *RExC_parse++;
5836 if ( paren == '<') /* (?P<...>) named capture */
5838 else if (paren == '>') { /* (?P>name) named recursion */
5839 goto named_recursion;
5841 else if (paren == '=') { /* (?P=...) named backref */
5842 /* this pretty much dupes the code for \k<NAME> in regatom(), if
5843 you change this make sure you change that */
5844 char* name_start = RExC_parse;
5846 SV *sv_dat = reg_scan_name(pRExC_state,
5847 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5848 if (RExC_parse == name_start || *RExC_parse != ')')
5849 vFAIL2("Sequence %.3s... not terminated",parse_start);
5852 num = add_data( pRExC_state, 1, "S" );
5853 RExC_rxi->data->data[num]=(void*)sv_dat;
5854 SvREFCNT_inc_simple_void(sv_dat);
5857 ret = reganode(pRExC_state,
5868 Set_Node_Offset(ret, parse_start+1);
5869 Set_Node_Cur_Length(ret); /* MJD */
5871 nextchar(pRExC_state);
5875 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
5877 case '<': /* (?<...) */
5878 if (*RExC_parse == '!')
5880 else if (*RExC_parse != '=')
5886 case '\'': /* (?'...') */
5887 name_start= RExC_parse;
5888 svname = reg_scan_name(pRExC_state,
5889 SIZE_ONLY ? /* reverse test from the others */
5890 REG_RSN_RETURN_NAME :
5891 REG_RSN_RETURN_NULL);
5892 if (RExC_parse == name_start) {
5894 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
5897 if (*RExC_parse != paren)
5898 vFAIL2("Sequence (?%c... not terminated",
5899 paren=='>' ? '<' : paren);
5903 if (!svname) /* shouldnt happen */
5905 "panic: reg_scan_name returned NULL");
5906 if (!RExC_paren_names) {
5907 RExC_paren_names= newHV();
5908 sv_2mortal(MUTABLE_SV(RExC_paren_names));
5910 RExC_paren_name_list= newAV();
5911 sv_2mortal(MUTABLE_SV(RExC_paren_name_list));
5914 he_str = hv_fetch_ent( RExC_paren_names, svname, 1, 0 );
5916 sv_dat = HeVAL(he_str);
5918 /* croak baby croak */
5920 "panic: paren_name hash element allocation failed");
5921 } else if ( SvPOK(sv_dat) ) {
5922 /* (?|...) can mean we have dupes so scan to check
5923 its already been stored. Maybe a flag indicating
5924 we are inside such a construct would be useful,
5925 but the arrays are likely to be quite small, so
5926 for now we punt -- dmq */
5927 IV count = SvIV(sv_dat);
5928 I32 *pv = (I32*)SvPVX(sv_dat);
5930 for ( i = 0 ; i < count ; i++ ) {
5931 if ( pv[i] == RExC_npar ) {
5937 pv = (I32*)SvGROW(sv_dat, SvCUR(sv_dat) + sizeof(I32)+1);
5938 SvCUR_set(sv_dat, SvCUR(sv_dat) + sizeof(I32));
5939 pv[count] = RExC_npar;
5940 SvIV_set(sv_dat, SvIVX(sv_dat) + 1);
5943 (void)SvUPGRADE(sv_dat,SVt_PVNV);
5944 sv_setpvn(sv_dat, (char *)&(RExC_npar), sizeof(I32));
5946 SvIV_set(sv_dat, 1);
5949 if (!av_store(RExC_paren_name_list, RExC_npar, SvREFCNT_inc(svname)))
5950 SvREFCNT_dec(svname);
5953 /*sv_dump(sv_dat);*/
5955 nextchar(pRExC_state);
5957 goto capturing_parens;
5959 RExC_seen |= REG_SEEN_LOOKBEHIND;
5961 case '=': /* (?=...) */
5962 RExC_seen_zerolen++;
5964 case '!': /* (?!...) */
5965 RExC_seen_zerolen++;
5966 if (*RExC_parse == ')') {
5967 ret=reg_node(pRExC_state, OPFAIL);
5968 nextchar(pRExC_state);
5972 case '|': /* (?|...) */
5973 /* branch reset, behave like a (?:...) except that
5974 buffers in alternations share the same numbers */
5976 after_freeze = freeze_paren = RExC_npar;
5978 case ':': /* (?:...) */
5979 case '>': /* (?>...) */
5981 case '$': /* (?$...) */
5982 case '@': /* (?@...) */
5983 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
5985 case '#': /* (?#...) */
5986 while (*RExC_parse && *RExC_parse != ')')
5988 if (*RExC_parse != ')')
5989 FAIL("Sequence (?#... not terminated");
5990 nextchar(pRExC_state);
5993 case '0' : /* (?0) */
5994 case 'R' : /* (?R) */
5995 if (*RExC_parse != ')')
5996 FAIL("Sequence (?R) not terminated");
5997 ret = reg_node(pRExC_state, GOSTART);
5998 *flagp |= POSTPONED;
5999 nextchar(pRExC_state);
6002 { /* named and numeric backreferences */
6004 case '&': /* (?&NAME) */
6005 parse_start = RExC_parse - 1;
6008 SV *sv_dat = reg_scan_name(pRExC_state,
6009 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
6010 num = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
6012 goto gen_recurse_regop;
6015 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
6017 vFAIL("Illegal pattern");
6019 goto parse_recursion;
6021 case '-': /* (?-1) */
6022 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
6023 RExC_parse--; /* rewind to let it be handled later */
6027 case '1': case '2': case '3': case '4': /* (?1) */
6028 case '5': case '6': case '7': case '8': case '9':
6031 num = atoi(RExC_parse);
6032 parse_start = RExC_parse - 1; /* MJD */
6033 if (*RExC_parse == '-')
6035 while (isDIGIT(*RExC_parse))
6037 if (*RExC_parse!=')')
6038 vFAIL("Expecting close bracket");
6041 if ( paren == '-' ) {
6043 Diagram of capture buffer numbering.
6044 Top line is the normal capture buffer numbers
6045 Bottom line is the negative indexing as from
6049 /(a(x)y)(a(b(c(?-2)d)e)f)(g(h))/
6053 num = RExC_npar + num;
6056 vFAIL("Reference to nonexistent group");
6058 } else if ( paren == '+' ) {
6059 num = RExC_npar + num - 1;
6062 ret = reganode(pRExC_state, GOSUB, num);
6064 if (num > (I32)RExC_rx->nparens) {
6066 vFAIL("Reference to nonexistent group");
6068 ARG2L_SET( ret, RExC_recurse_count++);
6070 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
6071 "Recurse #%"UVuf" to %"IVdf"\n", (UV)ARG(ret), (IV)ARG2L(ret)));
6075 RExC_seen |= REG_SEEN_RECURSE;
6076 Set_Node_Length(ret, 1 + regarglen[OP(ret)]); /* MJD */
6077 Set_Node_Offset(ret, parse_start); /* MJD */
6079 *flagp |= POSTPONED;
6080 nextchar(pRExC_state);
6082 } /* named and numeric backreferences */
6085 case '?': /* (??...) */
6087 if (*RExC_parse != '{') {
6089 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
6092 *flagp |= POSTPONED;
6093 paren = *RExC_parse++;
6095 case '{': /* (?{...}) */
6100 char *s = RExC_parse;
6102 RExC_seen_zerolen++;
6103 RExC_seen |= REG_SEEN_EVAL;
6104 while (count && (c = *RExC_parse)) {
6115 if (*RExC_parse != ')') {
6117 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
6121 OP_4tree *sop, *rop;
6122 SV * const sv = newSVpvn(s, RExC_parse - 1 - s);
6125 Perl_save_re_context(aTHX);
6126 rop = Perl_sv_compile_2op_is_broken(aTHX_ sv, &sop, "re", &pad);
6127 sop->op_private |= OPpREFCOUNTED;
6128 /* re_dup will OpREFCNT_inc */
6129 OpREFCNT_set(sop, 1);
6132 n = add_data(pRExC_state, 3, "nop");
6133 RExC_rxi->data->data[n] = (void*)rop;
6134 RExC_rxi->data->data[n+1] = (void*)sop;
6135 RExC_rxi->data->data[n+2] = (void*)pad;
6138 else { /* First pass */
6139 if (PL_reginterp_cnt < ++RExC_seen_evals
6141 /* No compiled RE interpolated, has runtime
6142 components ===> unsafe. */
6143 FAIL("Eval-group not allowed at runtime, use re 'eval'");
6144 if (PL_tainting && PL_tainted)
6145 FAIL("Eval-group in insecure regular expression");
6146 #if PERL_VERSION > 8
6147 if (IN_PERL_COMPILETIME)
6152 nextchar(pRExC_state);
6154 ret = reg_node(pRExC_state, LOGICAL);
6157 REGTAIL(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
6158 /* deal with the length of this later - MJD */
6161 ret = reganode(pRExC_state, EVAL, n);
6162 Set_Node_Length(ret, RExC_parse - parse_start + 1);
6163 Set_Node_Offset(ret, parse_start);
6166 case '(': /* (?(?{...})...) and (?(?=...)...) */
6169 if (RExC_parse[0] == '?') { /* (?(?...)) */
6170 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
6171 || RExC_parse[1] == '<'
6172 || RExC_parse[1] == '{') { /* Lookahead or eval. */
6175 ret = reg_node(pRExC_state, LOGICAL);
6178 REGTAIL(pRExC_state, ret, reg(pRExC_state, 1, &flag,depth+1));
6182 else if ( RExC_parse[0] == '<' /* (?(<NAME>)...) */
6183 || RExC_parse[0] == '\'' ) /* (?('NAME')...) */
6185 char ch = RExC_parse[0] == '<' ? '>' : '\'';
6186 char *name_start= RExC_parse++;
6188 SV *sv_dat=reg_scan_name(pRExC_state,
6189 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
6190 if (RExC_parse == name_start || *RExC_parse != ch)
6191 vFAIL2("Sequence (?(%c... not terminated",
6192 (ch == '>' ? '<' : ch));
6195 num = add_data( pRExC_state, 1, "S" );
6196 RExC_rxi->data->data[num]=(void*)sv_dat;
6197 SvREFCNT_inc_simple_void(sv_dat);
6199 ret = reganode(pRExC_state,NGROUPP,num);
6200 goto insert_if_check_paren;
6202 else if (RExC_parse[0] == 'D' &&
6203 RExC_parse[1] == 'E' &&
6204 RExC_parse[2] == 'F' &&
6205 RExC_parse[3] == 'I' &&
6206 RExC_parse[4] == 'N' &&
6207 RExC_parse[5] == 'E')
6209 ret = reganode(pRExC_state,DEFINEP,0);
6212 goto insert_if_check_paren;
6214 else if (RExC_parse[0] == 'R') {
6217 if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
6218 parno = atoi(RExC_parse++);
6219 while (isDIGIT(*RExC_parse))
6221 } else if (RExC_parse[0] == '&') {
6224 sv_dat = reg_scan_name(pRExC_state,
6225 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
6226 parno = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
6228 ret = reganode(pRExC_state,INSUBP,parno);
6229 goto insert_if_check_paren;
6231 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
6234 parno = atoi(RExC_parse++);
6236 while (isDIGIT(*RExC_parse))
6238 ret = reganode(pRExC_state, GROUPP, parno);
6240 insert_if_check_paren:
6241 if ((c = *nextchar(pRExC_state)) != ')')
6242 vFAIL("Switch condition not recognized");
6244 REGTAIL(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
6245 br = regbranch(pRExC_state, &flags, 1,depth+1);
6247 br = reganode(pRExC_state, LONGJMP, 0);
6249 REGTAIL(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
6250 c = *nextchar(pRExC_state);
6255 vFAIL("(?(DEFINE)....) does not allow branches");
6256 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
6257 regbranch(pRExC_state, &flags, 1,depth+1);
6258 REGTAIL(pRExC_state, ret, lastbr);
6261 c = *nextchar(pRExC_state);
6266 vFAIL("Switch (?(condition)... contains too many branches");
6267 ender = reg_node(pRExC_state, TAIL);
6268 REGTAIL(pRExC_state, br, ender);
6270 REGTAIL(pRExC_state, lastbr, ender);
6271 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
6274 REGTAIL(pRExC_state, ret, ender);
6275 RExC_size++; /* XXX WHY do we need this?!!
6276 For large programs it seems to be required
6277 but I can't figure out why. -- dmq*/
6281 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
6285 RExC_parse--; /* for vFAIL to print correctly */
6286 vFAIL("Sequence (? incomplete");
6288 case DEFAULT_PAT_MOD: /* Use default flags with the exceptions
6290 has_use_defaults = TRUE;
6291 STD_PMMOD_FLAGS_CLEAR(&RExC_flags);
6292 if (RExC_utf8) { /* But the default for a utf8 pattern is
6293 unicode semantics */
6294 RExC_flags |= RXf_PMf_UNICODE;
6299 parse_flags: /* (?i) */
6301 U32 posflags = 0, negflags = 0;
6302 U32 *flagsp = &posflags;
6303 bool has_charset_modifier = 0;
6305 while (*RExC_parse) {
6306 /* && strchr("iogcmsx", *RExC_parse) */
6307 /* (?g), (?gc) and (?o) are useless here
6308 and must be globally applied -- japhy */
6309 switch (*RExC_parse) {
6310 CASE_STD_PMMOD_FLAGS_PARSE_SET(flagsp);
6311 case LOCALE_PAT_MOD:
6312 if (has_charset_modifier || flagsp == &negflags) {
6313 goto fail_modifiers;
6315 posflags |= RXf_PMf_LOCALE;
6316 negflags |= RXf_PMf_UNICODE;
6317 has_charset_modifier = 1;
6319 case UNICODE_PAT_MOD:
6320 if (has_charset_modifier || flagsp == &negflags) {
6321 goto fail_modifiers;
6323 posflags |= RXf_PMf_UNICODE;
6324 negflags |= RXf_PMf_LOCALE;
6325 has_charset_modifier = 1;
6328 if (has_use_defaults
6329 || has_charset_modifier
6330 || flagsp == &negflags)
6332 goto fail_modifiers;
6335 /* The dual charset means unicode semantics if the
6336 * pattern (or target, not known until runtime) are
6339 posflags |= RXf_PMf_UNICODE;
6340 negflags |= RXf_PMf_LOCALE;
6343 negflags |= (RXf_PMf_LOCALE|RXf_PMf_UNICODE);
6345 has_charset_modifier = 1;
6347 case ONCE_PAT_MOD: /* 'o' */
6348 case GLOBAL_PAT_MOD: /* 'g' */
6349 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
6350 const I32 wflagbit = *RExC_parse == 'o' ? WASTED_O : WASTED_G;
6351 if (! (wastedflags & wflagbit) ) {
6352 wastedflags |= wflagbit;
6355 "Useless (%s%c) - %suse /%c modifier",
6356 flagsp == &negflags ? "?-" : "?",
6358 flagsp == &negflags ? "don't " : "",
6365 case CONTINUE_PAT_MOD: /* 'c' */
6366 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
6367 if (! (wastedflags & WASTED_C) ) {
6368 wastedflags |= WASTED_GC;
6371 "Useless (%sc) - %suse /gc modifier",
6372 flagsp == &negflags ? "?-" : "?",
6373 flagsp == &negflags ? "don't " : ""
6378 case KEEPCOPY_PAT_MOD: /* 'p' */
6379 if (flagsp == &negflags) {
6381 ckWARNreg(RExC_parse + 1,"Useless use of (?-p)");
6383 *flagsp |= RXf_PMf_KEEPCOPY;
6387 /* A flag is a default iff it is following a minus, so
6388 * if there is a minus, it means will be trying to
6389 * re-specify a default which is an error */
6390 if (has_use_defaults || flagsp == &negflags) {
6393 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
6397 wastedflags = 0; /* reset so (?g-c) warns twice */
6403 RExC_flags |= posflags;
6404 RExC_flags &= ~negflags;
6406 oregflags |= posflags;
6407 oregflags &= ~negflags;
6409 nextchar(pRExC_state);
6420 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
6425 }} /* one for the default block, one for the switch */
6432 ret = reganode(pRExC_state, OPEN, parno);
6435 RExC_nestroot = parno;
6436 if (RExC_seen & REG_SEEN_RECURSE
6437 && !RExC_open_parens[parno-1])
6439 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
6440 "Setting open paren #%"IVdf" to %d\n",
6441 (IV)parno, REG_NODE_NUM(ret)));
6442 RExC_open_parens[parno-1]= ret;
6445 Set_Node_Length(ret, 1); /* MJD */
6446 Set_Node_Offset(ret, RExC_parse); /* MJD */
6454 /* Pick up the branches, linking them together. */
6455 parse_start = RExC_parse; /* MJD */
6456 br = regbranch(pRExC_state, &flags, 1,depth+1);
6459 if (RExC_npar > after_freeze)
6460 after_freeze = RExC_npar;
6461 RExC_npar = freeze_paren;
6464 /* branch_len = (paren != 0); */
6468 if (*RExC_parse == '|') {
6469 if (!SIZE_ONLY && RExC_extralen) {
6470 reginsert(pRExC_state, BRANCHJ, br, depth+1);
6473 reginsert(pRExC_state, BRANCH, br, depth+1);
6474 Set_Node_Length(br, paren != 0);
6475 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
6479 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
6481 else if (paren == ':') {
6482 *flagp |= flags&SIMPLE;
6484 if (is_open) { /* Starts with OPEN. */
6485 REGTAIL(pRExC_state, ret, br); /* OPEN -> first. */
6487 else if (paren != '?') /* Not Conditional */
6489 *flagp |= flags & (SPSTART | HASWIDTH | POSTPONED);
6491 while (*RExC_parse == '|') {
6492 if (!SIZE_ONLY && RExC_extralen) {
6493 ender = reganode(pRExC_state, LONGJMP,0);
6494 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
6497 RExC_extralen += 2; /* Account for LONGJMP. */
6498 nextchar(pRExC_state);
6500 if (RExC_npar > after_freeze)
6501 after_freeze = RExC_npar;
6502 RExC_npar = freeze_paren;
6504 br = regbranch(pRExC_state, &flags, 0, depth+1);
6508 REGTAIL(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
6510 *flagp |= flags & (SPSTART | HASWIDTH | POSTPONED);
6513 if (have_branch || paren != ':') {
6514 /* Make a closing node, and hook it on the end. */
6517 ender = reg_node(pRExC_state, TAIL);
6520 ender = reganode(pRExC_state, CLOSE, parno);
6521 if (!SIZE_ONLY && RExC_seen & REG_SEEN_RECURSE) {
6522 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
6523 "Setting close paren #%"IVdf" to %d\n",
6524 (IV)parno, REG_NODE_NUM(ender)));
6525 RExC_close_parens[parno-1]= ender;
6526 if (RExC_nestroot == parno)
6529 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
6530 Set_Node_Length(ender,1); /* MJD */
6536 *flagp &= ~HASWIDTH;
6539 ender = reg_node(pRExC_state, SUCCEED);
6542 ender = reg_node(pRExC_state, END);
6544 assert(!RExC_opend); /* there can only be one! */
6549 REGTAIL(pRExC_state, lastbr, ender);
6551 if (have_branch && !SIZE_ONLY) {
6553 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
6555 /* Hook the tails of the branches to the closing node. */
6556 for (br = ret; br; br = regnext(br)) {
6557 const U8 op = PL_regkind[OP(br)];
6559 REGTAIL_STUDY(pRExC_state, NEXTOPER(br), ender);
6561 else if (op == BRANCHJ) {
6562 REGTAIL_STUDY(pRExC_state, NEXTOPER(NEXTOPER(br)), ender);
6570 static const char parens[] = "=!<,>";
6572 if (paren && (p = strchr(parens, paren))) {
6573 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
6574 int flag = (p - parens) > 1;
6577 node = SUSPEND, flag = 0;
6578 reginsert(pRExC_state, node,ret, depth+1);
6579 Set_Node_Cur_Length(ret);
6580 Set_Node_Offset(ret, parse_start + 1);
6582 REGTAIL_STUDY(pRExC_state, ret, reg_node(pRExC_state, TAIL));
6586 /* Check for proper termination. */
6588 RExC_flags = oregflags;
6589 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
6590 RExC_parse = oregcomp_parse;
6591 vFAIL("Unmatched (");
6594 else if (!paren && RExC_parse < RExC_end) {
6595 if (*RExC_parse == ')') {
6597 vFAIL("Unmatched )");
6600 FAIL("Junk on end of regexp"); /* "Can't happen". */
6604 RExC_npar = after_freeze;
6609 - regbranch - one alternative of an | operator
6611 * Implements the concatenation operator.
6614 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth)
6617 register regnode *ret;
6618 register regnode *chain = NULL;
6619 register regnode *latest;
6620 I32 flags = 0, c = 0;
6621 GET_RE_DEBUG_FLAGS_DECL;
6623 PERL_ARGS_ASSERT_REGBRANCH;
6625 DEBUG_PARSE("brnc");
6630 if (!SIZE_ONLY && RExC_extralen)
6631 ret = reganode(pRExC_state, BRANCHJ,0);
6633 ret = reg_node(pRExC_state, BRANCH);
6634 Set_Node_Length(ret, 1);
6638 if (!first && SIZE_ONLY)
6639 RExC_extralen += 1; /* BRANCHJ */
6641 *flagp = WORST; /* Tentatively. */
6644 nextchar(pRExC_state);
6645 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
6647 latest = regpiece(pRExC_state, &flags,depth+1);
6648 if (latest == NULL) {
6649 if (flags & TRYAGAIN)
6653 else if (ret == NULL)
6655 *flagp |= flags&(HASWIDTH|POSTPONED);
6656 if (chain == NULL) /* First piece. */
6657 *flagp |= flags&SPSTART;
6660 REGTAIL(pRExC_state, chain, latest);
6665 if (chain == NULL) { /* Loop ran zero times. */
6666 chain = reg_node(pRExC_state, NOTHING);
6671 *flagp |= flags&SIMPLE;
6678 - regpiece - something followed by possible [*+?]
6680 * Note that the branching code sequences used for ? and the general cases
6681 * of * and + are somewhat optimized: they use the same NOTHING node as
6682 * both the endmarker for their branch list and the body of the last branch.
6683 * It might seem that this node could be dispensed with entirely, but the
6684 * endmarker role is not redundant.
6687 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
6690 register regnode *ret;
6692 register char *next;
6694 const char * const origparse = RExC_parse;
6696 I32 max = REG_INFTY;
6698 const char *maxpos = NULL;
6699 GET_RE_DEBUG_FLAGS_DECL;
6701 PERL_ARGS_ASSERT_REGPIECE;
6703 DEBUG_PARSE("piec");
6705 ret = regatom(pRExC_state, &flags,depth+1);
6707 if (flags & TRYAGAIN)
6714 if (op == '{' && regcurly(RExC_parse)) {
6716 parse_start = RExC_parse; /* MJD */
6717 next = RExC_parse + 1;
6718 while (isDIGIT(*next) || *next == ',') {
6727 if (*next == '}') { /* got one */
6731 min = atoi(RExC_parse);
6735 maxpos = RExC_parse;
6737 if (!max && *maxpos != '0')
6738 max = REG_INFTY; /* meaning "infinity" */
6739 else if (max >= REG_INFTY)
6740 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
6742 nextchar(pRExC_state);
6745 if ((flags&SIMPLE)) {
6746 RExC_naughty += 2 + RExC_naughty / 2;
6747 reginsert(pRExC_state, CURLY, ret, depth+1);
6748 Set_Node_Offset(ret, parse_start+1); /* MJD */
6749 Set_Node_Cur_Length(ret);
6752 regnode * const w = reg_node(pRExC_state, WHILEM);
6755 REGTAIL(pRExC_state, ret, w);
6756 if (!SIZE_ONLY && RExC_extralen) {
6757 reginsert(pRExC_state, LONGJMP,ret, depth+1);
6758 reginsert(pRExC_state, NOTHING,ret, depth+1);
6759 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
6761 reginsert(pRExC_state, CURLYX,ret, depth+1);
6763 Set_Node_Offset(ret, parse_start+1);
6764 Set_Node_Length(ret,
6765 op == '{' ? (RExC_parse - parse_start) : 1);
6767 if (!SIZE_ONLY && RExC_extralen)
6768 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
6769 REGTAIL(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
6771 RExC_whilem_seen++, RExC_extralen += 3;
6772 RExC_naughty += 4 + RExC_naughty; /* compound interest */
6781 vFAIL("Can't do {n,m} with n > m");
6783 ARG1_SET(ret, (U16)min);
6784 ARG2_SET(ret, (U16)max);
6796 #if 0 /* Now runtime fix should be reliable. */
6798 /* if this is reinstated, don't forget to put this back into perldiag:
6800 =item Regexp *+ operand could be empty at {#} in regex m/%s/
6802 (F) The part of the regexp subject to either the * or + quantifier
6803 could match an empty string. The {#} shows in the regular
6804 expression about where the problem was discovered.
6808 if (!(flags&HASWIDTH) && op != '?')
6809 vFAIL("Regexp *+ operand could be empty");
6812 parse_start = RExC_parse;
6813 nextchar(pRExC_state);
6815 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
6817 if (op == '*' && (flags&SIMPLE)) {
6818 reginsert(pRExC_state, STAR, ret, depth+1);
6822 else if (op == '*') {
6826 else if (op == '+' && (flags&SIMPLE)) {
6827 reginsert(pRExC_state, PLUS, ret, depth+1);
6831 else if (op == '+') {
6835 else if (op == '?') {
6840 if (!SIZE_ONLY && !(flags&(HASWIDTH|POSTPONED)) && max > REG_INFTY/3) {
6841 ckWARN3reg(RExC_parse,
6842 "%.*s matches null string many times",
6843 (int)(RExC_parse >= origparse ? RExC_parse - origparse : 0),
6847 if (RExC_parse < RExC_end && *RExC_parse == '?') {
6848 nextchar(pRExC_state);
6849 reginsert(pRExC_state, MINMOD, ret, depth+1);
6850 REGTAIL(pRExC_state, ret, ret + NODE_STEP_REGNODE);
6852 #ifndef REG_ALLOW_MINMOD_SUSPEND
6855 if (RExC_parse < RExC_end && *RExC_parse == '+') {
6857 nextchar(pRExC_state);
6858 ender = reg_node(pRExC_state, SUCCEED);
6859 REGTAIL(pRExC_state, ret, ender);
6860 reginsert(pRExC_state, SUSPEND, ret, depth+1);
6862 ender = reg_node(pRExC_state, TAIL);
6863 REGTAIL(pRExC_state, ret, ender);
6867 if (RExC_parse < RExC_end && ISMULT2(RExC_parse)) {
6869 vFAIL("Nested quantifiers");
6876 /* reg_namedseq(pRExC_state,UVp)
6878 This is expected to be called by a parser routine that has
6879 recognized '\N' and needs to handle the rest. RExC_parse is
6880 expected to point at the first char following the N at the time
6883 The \N may be inside (indicated by valuep not being NULL) or outside a
6886 \N may begin either a named sequence, or if outside a character class, mean
6887 to match a non-newline. For non single-quoted regexes, the tokenizer has
6888 attempted to decide which, and in the case of a named sequence converted it
6889 into one of the forms: \N{} (if the sequence is null), or \N{U+c1.c2...},
6890 where c1... are the characters in the sequence. For single-quoted regexes,
6891 the tokenizer passes the \N sequence through unchanged; this code will not
6892 attempt to determine this nor expand those. The net effect is that if the
6893 beginning of the passed-in pattern isn't '{U+' or there is no '}', it
6894 signals that this \N occurrence means to match a non-newline.
6896 Only the \N{U+...} form should occur in a character class, for the same
6897 reason that '.' inside a character class means to just match a period: it
6898 just doesn't make sense.
6900 If valuep is non-null then it is assumed that we are parsing inside
6901 of a charclass definition and the first codepoint in the resolved
6902 string is returned via *valuep and the routine will return NULL.
6903 In this mode if a multichar string is returned from the charnames
6904 handler, a warning will be issued, and only the first char in the
6905 sequence will be examined. If the string returned is zero length
6906 then the value of *valuep is undefined and NON-NULL will
6907 be returned to indicate failure. (This will NOT be a valid pointer
6910 If valuep is null then it is assumed that we are parsing normal text and a
6911 new EXACT node is inserted into the program containing the resolved string,
6912 and a pointer to the new node is returned. But if the string is zero length
6913 a NOTHING node is emitted instead.
6915 On success RExC_parse is set to the char following the endbrace.
6916 Parsing failures will generate a fatal error via vFAIL(...)
6919 S_reg_namedseq(pTHX_ RExC_state_t *pRExC_state, UV *valuep, I32 *flagp)
6921 char * endbrace; /* '}' following the name */
6922 regnode *ret = NULL;
6924 char* parse_start = RExC_parse - 2; /* points to the '\N' */
6928 GET_RE_DEBUG_FLAGS_DECL;
6930 PERL_ARGS_ASSERT_REG_NAMEDSEQ;
6934 /* The [^\n] meaning of \N ignores spaces and comments under the /x
6935 * modifier. The other meaning does not */
6936 p = (RExC_flags & RXf_PMf_EXTENDED)
6937 ? regwhite( pRExC_state, RExC_parse )
6940 /* Disambiguate between \N meaning a named character versus \N meaning
6941 * [^\n]. The former is assumed when it can't be the latter. */
6942 if (*p != '{' || regcurly(p)) {
6945 /* no bare \N in a charclass */
6946 vFAIL("\\N in a character class must be a named character: \\N{...}");
6948 nextchar(pRExC_state);
6949 ret = reg_node(pRExC_state, REG_ANY);
6950 *flagp |= HASWIDTH|SIMPLE;
6953 Set_Node_Length(ret, 1); /* MJD */
6957 /* Here, we have decided it should be a named sequence */
6959 /* The test above made sure that the next real character is a '{', but
6960 * under the /x modifier, it could be separated by space (or a comment and
6961 * \n) and this is not allowed (for consistency with \x{...} and the
6962 * tokenizer handling of \N{NAME}). */
6963 if (*RExC_parse != '{') {
6964 vFAIL("Missing braces on \\N{}");
6967 RExC_parse++; /* Skip past the '{' */
6969 if (! (endbrace = strchr(RExC_parse, '}')) /* no trailing brace */
6970 || ! (endbrace == RExC_parse /* nothing between the {} */
6971 || (endbrace - RExC_parse >= 2 /* U+ (bad hex is checked below */
6972 && strnEQ(RExC_parse, "U+", 2)))) /* for a better error msg) */
6974 if (endbrace) RExC_parse = endbrace; /* position msg's '<--HERE' */
6975 vFAIL("\\N{NAME} must be resolved by the lexer");
6978 if (endbrace == RExC_parse) { /* empty: \N{} */
6980 RExC_parse = endbrace + 1;
6981 return reg_node(pRExC_state,NOTHING);
6985 ckWARNreg(RExC_parse,
6986 "Ignoring zero length \\N{} in character class"
6988 RExC_parse = endbrace + 1;
6991 return (regnode *) &RExC_parse; /* Invalid regnode pointer */
6994 REQUIRE_UTF8; /* named sequences imply Unicode semantics */
6995 RExC_parse += 2; /* Skip past the 'U+' */
6997 if (valuep) { /* In a bracketed char class */
6998 /* We only pay attention to the first char of
6999 multichar strings being returned. I kinda wonder
7000 if this makes sense as it does change the behaviour
7001 from earlier versions, OTOH that behaviour was broken
7002 as well. XXX Solution is to recharacterize as
7003 [rest-of-class]|multi1|multi2... */
7005 STRLEN length_of_hex;
7006 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
7007 | PERL_SCAN_DISALLOW_PREFIX
7008 | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0);
7010 char * endchar = RExC_parse + strcspn(RExC_parse, ".}");
7011 if (endchar < endbrace) {
7012 ckWARNreg(endchar, "Using just the first character returned by \\N{} in character class");
7015 length_of_hex = (STRLEN)(endchar - RExC_parse);
7016 *valuep = grok_hex(RExC_parse, &length_of_hex, &flags, NULL);
7018 /* The tokenizer should have guaranteed validity, but it's possible to
7019 * bypass it by using single quoting, so check */
7020 if (length_of_hex == 0
7021 || length_of_hex != (STRLEN)(endchar - RExC_parse) )
7023 RExC_parse += length_of_hex; /* Includes all the valid */
7024 RExC_parse += (RExC_orig_utf8) /* point to after 1st invalid */
7025 ? UTF8SKIP(RExC_parse)
7027 /* Guard against malformed utf8 */
7028 if (RExC_parse >= endchar) RExC_parse = endchar;
7029 vFAIL("Invalid hexadecimal number in \\N{U+...}");
7032 RExC_parse = endbrace + 1;
7033 if (endchar == endbrace) return NULL;
7035 ret = (regnode *) &RExC_parse; /* Invalid regnode pointer */
7037 else { /* Not a char class */
7038 char *s; /* String to put in generated EXACT node */
7039 STRLEN len = 0; /* Its current byte length */
7040 char *endchar; /* Points to '.' or '}' ending cur char in the input
7043 ret = reg_node(pRExC_state, (U8) ((! FOLD) ? EXACT
7051 /* Exact nodes can hold only a U8 length's of text = 255. Loop through
7052 * the input which is of the form now 'c1.c2.c3...}' until find the
7053 * ending brace or exceed length 255. The characters that exceed this
7054 * limit are dropped. The limit could be relaxed should it become
7055 * desirable by reparsing this as (?:\N{NAME}), so could generate
7056 * multiple EXACT nodes, as is done for just regular input. But this
7057 * is primarily a named character, and not intended to be a huge long
7058 * string, so 255 bytes should be good enough */
7060 STRLEN length_of_hex;
7061 I32 grok_flags = PERL_SCAN_ALLOW_UNDERSCORES
7062 | PERL_SCAN_DISALLOW_PREFIX
7063 | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0);
7064 UV cp; /* Ord of current character */
7066 /* Code points are separated by dots. If none, there is only one
7067 * code point, and is terminated by the brace */
7068 endchar = RExC_parse + strcspn(RExC_parse, ".}");
7070 /* The values are Unicode even on EBCDIC machines */
7071 length_of_hex = (STRLEN)(endchar - RExC_parse);
7072 cp = grok_hex(RExC_parse, &length_of_hex, &grok_flags, NULL);
7073 if ( length_of_hex == 0
7074 || length_of_hex != (STRLEN)(endchar - RExC_parse) )
7076 RExC_parse += length_of_hex; /* Includes all the valid */
7077 RExC_parse += (RExC_orig_utf8) /* point to after 1st invalid */
7078 ? UTF8SKIP(RExC_parse)
7080 /* Guard against malformed utf8 */
7081 if (RExC_parse >= endchar) RExC_parse = endchar;
7082 vFAIL("Invalid hexadecimal number in \\N{U+...}");
7085 if (! FOLD) { /* Not folding, just append to the string */
7088 /* Quit before adding this character if would exceed limit */
7089 if (len + UNISKIP(cp) > U8_MAX) break;
7091 unilen = reguni(pRExC_state, cp, s);
7096 } else { /* Folding, output the folded equivalent */
7097 STRLEN foldlen,numlen;
7098 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
7099 cp = toFOLD_uni(cp, tmpbuf, &foldlen);
7101 /* Quit before exceeding size limit */
7102 if (len + foldlen > U8_MAX) break;
7104 for (foldbuf = tmpbuf;
7108 cp = utf8_to_uvchr(foldbuf, &numlen);
7110 const STRLEN unilen = reguni(pRExC_state, cp, s);
7113 /* In EBCDIC the numlen and unilen can differ. */
7115 if (numlen >= foldlen)
7119 break; /* "Can't happen." */
7123 /* Point to the beginning of the next character in the sequence. */
7124 RExC_parse = endchar + 1;
7126 /* Quit if no more characters */
7127 if (RExC_parse >= endbrace) break;
7132 if (RExC_parse < endbrace) {
7133 ckWARNreg(RExC_parse - 1,
7134 "Using just the first characters returned by \\N{}");
7137 RExC_size += STR_SZ(len);
7140 RExC_emit += STR_SZ(len);
7143 RExC_parse = endbrace + 1;
7145 *flagp |= HASWIDTH; /* Not SIMPLE, as that causes the engine to fail
7146 with malformed in t/re/pat_advanced.t */
7148 Set_Node_Cur_Length(ret); /* MJD */
7149 nextchar(pRExC_state);
7159 * It returns the code point in utf8 for the value in *encp.
7160 * value: a code value in the source encoding
7161 * encp: a pointer to an Encode object
7163 * If the result from Encode is not a single character,
7164 * it returns U+FFFD (Replacement character) and sets *encp to NULL.
7167 S_reg_recode(pTHX_ const char value, SV **encp)
7170 SV * const sv = newSVpvn_flags(&value, numlen, SVs_TEMP);
7171 const char * const s = *encp ? sv_recode_to_utf8(sv, *encp) : SvPVX(sv);
7172 const STRLEN newlen = SvCUR(sv);
7173 UV uv = UNICODE_REPLACEMENT;
7175 PERL_ARGS_ASSERT_REG_RECODE;
7179 ? utf8n_to_uvchr((U8*)s, newlen, &numlen, UTF8_ALLOW_DEFAULT)
7182 if (!newlen || numlen != newlen) {
7183 uv = UNICODE_REPLACEMENT;
7191 - regatom - the lowest level
7193 Try to identify anything special at the start of the pattern. If there
7194 is, then handle it as required. This may involve generating a single regop,
7195 such as for an assertion; or it may involve recursing, such as to
7196 handle a () structure.
7198 If the string doesn't start with something special then we gobble up
7199 as much literal text as we can.
7201 Once we have been able to handle whatever type of thing started the
7202 sequence, we return.
7204 Note: we have to be careful with escapes, as they can be both literal
7205 and special, and in the case of \10 and friends can either, depending
7206 on context. Specifically there are two seperate switches for handling
7207 escape sequences, with the one for handling literal escapes requiring
7208 a dummy entry for all of the special escapes that are actually handled
7213 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
7216 register regnode *ret = NULL;
7218 char *parse_start = RExC_parse;
7219 GET_RE_DEBUG_FLAGS_DECL;
7220 DEBUG_PARSE("atom");
7221 *flagp = WORST; /* Tentatively. */
7223 PERL_ARGS_ASSERT_REGATOM;
7226 switch ((U8)*RExC_parse) {
7228 RExC_seen_zerolen++;
7229 nextchar(pRExC_state);
7230 if (RExC_flags & RXf_PMf_MULTILINE)
7231 ret = reg_node(pRExC_state, MBOL);
7232 else if (RExC_flags & RXf_PMf_SINGLELINE)
7233 ret = reg_node(pRExC_state, SBOL);
7235 ret = reg_node(pRExC_state, BOL);
7236 Set_Node_Length(ret, 1); /* MJD */
7239 nextchar(pRExC_state);
7241 RExC_seen_zerolen++;
7242 if (RExC_flags & RXf_PMf_MULTILINE)
7243 ret = reg_node(pRExC_state, MEOL);
7244 else if (RExC_flags & RXf_PMf_SINGLELINE)
7245 ret = reg_node(pRExC_state, SEOL);
7247 ret = reg_node(pRExC_state, EOL);
7248 Set_Node_Length(ret, 1); /* MJD */
7251 nextchar(pRExC_state);
7252 if (RExC_flags & RXf_PMf_SINGLELINE)
7253 ret = reg_node(pRExC_state, SANY);
7255 ret = reg_node(pRExC_state, REG_ANY);
7256 *flagp |= HASWIDTH|SIMPLE;
7258 Set_Node_Length(ret, 1); /* MJD */
7262 char * const oregcomp_parse = ++RExC_parse;
7263 ret = regclass(pRExC_state,depth+1);
7264 if (*RExC_parse != ']') {
7265 RExC_parse = oregcomp_parse;
7266 vFAIL("Unmatched [");
7268 nextchar(pRExC_state);
7269 *flagp |= HASWIDTH|SIMPLE;
7270 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
7274 nextchar(pRExC_state);
7275 ret = reg(pRExC_state, 1, &flags,depth+1);
7277 if (flags & TRYAGAIN) {
7278 if (RExC_parse == RExC_end) {
7279 /* Make parent create an empty node if needed. */
7287 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE|POSTPONED);
7291 if (flags & TRYAGAIN) {
7295 vFAIL("Internal urp");
7296 /* Supposed to be caught earlier. */
7299 if (!regcurly(RExC_parse)) {
7308 vFAIL("Quantifier follows nothing");
7310 case LATIN_SMALL_LETTER_SHARP_S:
7311 case UTF8_TWO_BYTE_HI_nocast(LATIN_SMALL_LETTER_SHARP_S):
7312 case UTF8_TWO_BYTE_HI_nocast(IOTA_D_T):
7313 #if UTF8_TWO_BYTE_HI_nocast(UPSILON_D_T) != UTF8_TWO_BYTE_HI_nocast(IOTA_D_T)
7314 #error The beginning utf8 byte of IOTA_D_T and UPSILON_D_T unexpectedly differ. Other instances in this code should have the case statement below.
7315 case UTF8_TWO_BYTE_HI_nocast(UPSILON_D_T):
7320 len=0; /* silence a spurious compiler warning */
7321 if ((cp = what_len_TRICKYFOLD_safe(RExC_parse,RExC_end,UTF,len))) {
7322 *flagp |= HASWIDTH; /* could be SIMPLE too, but needs a handler in regexec.regrepeat */
7323 RExC_parse+=len-1; /* we get one from nextchar() as well. :-( */
7324 ret = reganode(pRExC_state, FOLDCHAR, cp);
7325 Set_Node_Length(ret, 1); /* MJD */
7326 nextchar(pRExC_state); /* kill whitespace under /x */
7334 This switch handles escape sequences that resolve to some kind
7335 of special regop and not to literal text. Escape sequnces that
7336 resolve to literal text are handled below in the switch marked
7339 Every entry in this switch *must* have a corresponding entry
7340 in the literal escape switch. However, the opposite is not
7341 required, as the default for this switch is to jump to the
7342 literal text handling code.
7344 switch ((U8)*++RExC_parse) {
7345 case LATIN_SMALL_LETTER_SHARP_S:
7346 case UTF8_TWO_BYTE_HI_nocast(LATIN_SMALL_LETTER_SHARP_S):
7347 case UTF8_TWO_BYTE_HI_nocast(IOTA_D_T):
7349 /* Special Escapes */
7351 RExC_seen_zerolen++;
7352 ret = reg_node(pRExC_state, SBOL);
7354 goto finish_meta_pat;
7356 ret = reg_node(pRExC_state, GPOS);
7357 RExC_seen |= REG_SEEN_GPOS;
7359 goto finish_meta_pat;
7361 RExC_seen_zerolen++;
7362 ret = reg_node(pRExC_state, KEEPS);
7364 /* XXX:dmq : disabling in-place substitution seems to
7365 * be necessary here to avoid cases of memory corruption, as
7366 * with: C<$_="x" x 80; s/x\K/y/> -- rgs
7368 RExC_seen |= REG_SEEN_LOOKBEHIND;
7369 goto finish_meta_pat;
7371 ret = reg_node(pRExC_state, SEOL);
7373 RExC_seen_zerolen++; /* Do not optimize RE away */
7374 goto finish_meta_pat;
7376 ret = reg_node(pRExC_state, EOS);
7378 RExC_seen_zerolen++; /* Do not optimize RE away */
7379 goto finish_meta_pat;
7381 ret = reg_node(pRExC_state, CANY);
7382 RExC_seen |= REG_SEEN_CANY;
7383 *flagp |= HASWIDTH|SIMPLE;
7384 goto finish_meta_pat;
7386 ret = reg_node(pRExC_state, CLUMP);
7388 goto finish_meta_pat;
7391 ret = reg_node(pRExC_state, (U8)(ALNUML));
7393 ret = reg_node(pRExC_state, (U8)(ALNUM));
7394 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7396 *flagp |= HASWIDTH|SIMPLE;
7397 goto finish_meta_pat;
7400 ret = reg_node(pRExC_state, (U8)(NALNUML));
7402 ret = reg_node(pRExC_state, (U8)(NALNUM));
7403 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7405 *flagp |= HASWIDTH|SIMPLE;
7406 goto finish_meta_pat;
7408 RExC_seen_zerolen++;
7409 RExC_seen |= REG_SEEN_LOOKBEHIND;
7411 ret = reg_node(pRExC_state, (U8)(BOUNDL));
7413 ret = reg_node(pRExC_state, (U8)(BOUND));
7414 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7417 goto finish_meta_pat;
7419 RExC_seen_zerolen++;
7420 RExC_seen |= REG_SEEN_LOOKBEHIND;
7422 ret = reg_node(pRExC_state, (U8)(NBOUNDL));
7424 ret = reg_node(pRExC_state, (U8)(NBOUND));
7425 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7428 goto finish_meta_pat;
7431 ret = reg_node(pRExC_state, (U8)(SPACEL));
7433 ret = reg_node(pRExC_state, (U8)(SPACE));
7434 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7436 *flagp |= HASWIDTH|SIMPLE;
7437 goto finish_meta_pat;
7440 ret = reg_node(pRExC_state, (U8)(NSPACEL));
7442 ret = reg_node(pRExC_state, (U8)(NSPACE));
7443 FLAGS(ret) = (UNI_SEMANTICS) ? USE_UNI : 0;
7445 *flagp |= HASWIDTH|SIMPLE;
7446 goto finish_meta_pat;
7449 ret = reg_node(pRExC_state, (U8)(DIGITL));
7451 ret = reg_node(pRExC_state, (U8)(DIGIT));
7453 *flagp |= HASWIDTH|SIMPLE;
7454 goto finish_meta_pat;
7457 ret = reg_node(pRExC_state, (U8)(NDIGITL));
7459 ret = reg_node(pRExC_state, (U8)(NDIGIT));
7461 *flagp |= HASWIDTH|SIMPLE;
7462 goto finish_meta_pat;
7464 ret = reg_node(pRExC_state, LNBREAK);
7465 *flagp |= HASWIDTH|SIMPLE;
7466 goto finish_meta_pat;
7468 ret = reg_node(pRExC_state, HORIZWS);
7469 *flagp |= HASWIDTH|SIMPLE;
7470 goto finish_meta_pat;
7472 ret = reg_node(pRExC_state, NHORIZWS);
7473 *flagp |= HASWIDTH|SIMPLE;
7474 goto finish_meta_pat;
7476 ret = reg_node(pRExC_state, VERTWS);
7477 *flagp |= HASWIDTH|SIMPLE;
7478 goto finish_meta_pat;
7480 ret = reg_node(pRExC_state, NVERTWS);
7481 *flagp |= HASWIDTH|SIMPLE;
7483 nextchar(pRExC_state);
7484 Set_Node_Length(ret, 2); /* MJD */
7489 char* const oldregxend = RExC_end;
7491 char* parse_start = RExC_parse - 2;
7494 if (RExC_parse[1] == '{') {
7495 /* a lovely hack--pretend we saw [\pX] instead */
7496 RExC_end = strchr(RExC_parse, '}');
7498 const U8 c = (U8)*RExC_parse;
7500 RExC_end = oldregxend;
7501 vFAIL2("Missing right brace on \\%c{}", c);
7506 RExC_end = RExC_parse + 2;
7507 if (RExC_end > oldregxend)
7508 RExC_end = oldregxend;
7512 ret = regclass(pRExC_state,depth+1);
7514 RExC_end = oldregxend;
7517 Set_Node_Offset(ret, parse_start + 2);
7518 Set_Node_Cur_Length(ret);
7519 nextchar(pRExC_state);
7520 *flagp |= HASWIDTH|SIMPLE;
7524 /* Handle \N and \N{NAME} here and not below because it can be
7525 multicharacter. join_exact() will join them up later on.
7526 Also this makes sure that things like /\N{BLAH}+/ and
7527 \N{BLAH} being multi char Just Happen. dmq*/
7529 ret= reg_namedseq(pRExC_state, NULL, flagp);
7531 case 'k': /* Handle \k<NAME> and \k'NAME' */
7534 char ch= RExC_parse[1];
7535 if (ch != '<' && ch != '\'' && ch != '{') {
7537 vFAIL2("Sequence %.2s... not terminated",parse_start);
7539 /* this pretty much dupes the code for (?P=...) in reg(), if
7540 you change this make sure you change that */
7541 char* name_start = (RExC_parse += 2);
7543 SV *sv_dat = reg_scan_name(pRExC_state,
7544 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
7545 ch= (ch == '<') ? '>' : (ch == '{') ? '}' : '\'';
7546 if (RExC_parse == name_start || *RExC_parse != ch)
7547 vFAIL2("Sequence %.3s... not terminated",parse_start);
7550 num = add_data( pRExC_state, 1, "S" );
7551 RExC_rxi->data->data[num]=(void*)sv_dat;
7552 SvREFCNT_inc_simple_void(sv_dat);
7556 ret = reganode(pRExC_state,
7567 /* override incorrect value set in reganode MJD */
7568 Set_Node_Offset(ret, parse_start+1);
7569 Set_Node_Cur_Length(ret); /* MJD */
7570 nextchar(pRExC_state);
7576 case '1': case '2': case '3': case '4':
7577 case '5': case '6': case '7': case '8': case '9':
7580 bool isg = *RExC_parse == 'g';
7585 if (*RExC_parse == '{') {
7589 if (*RExC_parse == '-') {
7593 if (hasbrace && !isDIGIT(*RExC_parse)) {
7594 if (isrel) RExC_parse--;
7596 goto parse_named_seq;
7598 num = atoi(RExC_parse);
7599 if (isg && num == 0)
7600 vFAIL("Reference to invalid group 0");
7602 num = RExC_npar - num;
7604 vFAIL("Reference to nonexistent or unclosed group");
7606 if (!isg && num > 9 && num >= RExC_npar)
7609 char * const parse_start = RExC_parse - 1; /* MJD */
7610 while (isDIGIT(*RExC_parse))
7612 if (parse_start == RExC_parse - 1)
7613 vFAIL("Unterminated \\g... pattern");
7615 if (*RExC_parse != '}')
7616 vFAIL("Unterminated \\g{...} pattern");
7620 if (num > (I32)RExC_rx->nparens)
7621 vFAIL("Reference to nonexistent group");
7624 ret = reganode(pRExC_state,
7635 /* override incorrect value set in reganode MJD */
7636 Set_Node_Offset(ret, parse_start+1);
7637 Set_Node_Cur_Length(ret); /* MJD */
7639 nextchar(pRExC_state);
7644 if (RExC_parse >= RExC_end)
7645 FAIL("Trailing \\");
7648 /* Do not generate "unrecognized" warnings here, we fall
7649 back into the quick-grab loop below */
7656 if (RExC_flags & RXf_PMf_EXTENDED) {
7657 if ( reg_skipcomment( pRExC_state ) )
7664 register STRLEN len;
7669 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
7671 parse_start = RExC_parse - 1;
7677 ret = reg_node(pRExC_state,
7678 (U8) ((! FOLD) ? EXACT
7686 for (len = 0, p = RExC_parse - 1;
7687 len < 127 && p < RExC_end;
7690 char * const oldp = p;
7692 if (RExC_flags & RXf_PMf_EXTENDED)
7693 p = regwhite( pRExC_state, p );
7695 case LATIN_SMALL_LETTER_SHARP_S:
7696 case UTF8_TWO_BYTE_HI_nocast(LATIN_SMALL_LETTER_SHARP_S):
7697 case UTF8_TWO_BYTE_HI_nocast(IOTA_D_T):
7698 if (LOC || !FOLD || !is_TRICKYFOLD_safe(p,RExC_end,UTF))
7699 goto normal_default;
7709 /* Literal Escapes Switch
7711 This switch is meant to handle escape sequences that
7712 resolve to a literal character.
7714 Every escape sequence that represents something
7715 else, like an assertion or a char class, is handled
7716 in the switch marked 'Special Escapes' above in this
7717 routine, but also has an entry here as anything that
7718 isn't explicitly mentioned here will be treated as
7719 an unescaped equivalent literal.
7723 /* These are all the special escapes. */
7724 case LATIN_SMALL_LETTER_SHARP_S:
7725 case UTF8_TWO_BYTE_HI_nocast(LATIN_SMALL_LETTER_SHARP_S):
7726 case UTF8_TWO_BYTE_HI_nocast(IOTA_D_T):
7727 if (LOC || !FOLD || !is_TRICKYFOLD_safe(p,RExC_end,UTF))
7728 goto normal_default;
7729 case 'A': /* Start assertion */
7730 case 'b': case 'B': /* Word-boundary assertion*/
7731 case 'C': /* Single char !DANGEROUS! */
7732 case 'd': case 'D': /* digit class */
7733 case 'g': case 'G': /* generic-backref, pos assertion */
7734 case 'h': case 'H': /* HORIZWS */
7735 case 'k': case 'K': /* named backref, keep marker */
7736 case 'N': /* named char sequence */
7737 case 'p': case 'P': /* Unicode property */
7738 case 'R': /* LNBREAK */
7739 case 's': case 'S': /* space class */
7740 case 'v': case 'V': /* VERTWS */
7741 case 'w': case 'W': /* word class */
7742 case 'X': /* eXtended Unicode "combining character sequence" */
7743 case 'z': case 'Z': /* End of line/string assertion */
7747 /* Anything after here is an escape that resolves to a
7748 literal. (Except digits, which may or may not)
7767 ender = ASCII_TO_NATIVE('\033');
7771 ender = ASCII_TO_NATIVE('\007');
7776 STRLEN brace_len = len;
7778 const char* error_msg;
7780 bool valid = grok_bslash_o(p,
7787 RExC_parse = p; /* going to die anyway; point
7788 to exact spot of failure */
7795 if (PL_encoding && ender < 0x100) {
7796 goto recode_encoding;
7805 char* const e = strchr(p, '}');
7809 vFAIL("Missing right brace on \\x{}");
7812 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
7813 | PERL_SCAN_DISALLOW_PREFIX;
7814 STRLEN numlen = e - p - 1;
7815 ender = grok_hex(p + 1, &numlen, &flags, NULL);
7822 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
7824 ender = grok_hex(p, &numlen, &flags, NULL);
7827 if (PL_encoding && ender < 0x100)
7828 goto recode_encoding;
7832 ender = grok_bslash_c(*p++, SIZE_ONLY);
7834 case '0': case '1': case '2': case '3':case '4':
7835 case '5': case '6': case '7': case '8':case '9':
7837 (isDIGIT(p[1]) && atoi(p) >= RExC_npar))
7839 I32 flags = PERL_SCAN_SILENT_ILLDIGIT;
7841 ender = grok_oct(p, &numlen, &flags, NULL);
7851 if (PL_encoding && ender < 0x100)
7852 goto recode_encoding;
7856 SV* enc = PL_encoding;
7857 ender = reg_recode((const char)(U8)ender, &enc);
7858 if (!enc && SIZE_ONLY)
7859 ckWARNreg(p, "Invalid escape in the specified encoding");
7865 FAIL("Trailing \\");
7868 if (!SIZE_ONLY&& isALPHA(*p))
7869 ckWARN2reg(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
7870 goto normal_default;
7875 if (UTF8_IS_START(*p) && UTF) {
7877 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
7878 &numlen, UTF8_ALLOW_DEFAULT);
7885 if ( RExC_flags & RXf_PMf_EXTENDED)
7886 p = regwhite( pRExC_state, p );
7888 /* Prime the casefolded buffer. */
7889 ender = toFOLD_uni(ender, tmpbuf, &foldlen);
7891 if (p < RExC_end && ISMULT2(p)) { /* Back off on ?+*. */
7896 /* Emit all the Unicode characters. */
7898 for (foldbuf = tmpbuf;
7900 foldlen -= numlen) {
7901 ender = utf8_to_uvchr(foldbuf, &numlen);
7903 const STRLEN unilen = reguni(pRExC_state, ender, s);
7906 /* In EBCDIC the numlen
7907 * and unilen can differ. */
7909 if (numlen >= foldlen)
7913 break; /* "Can't happen." */
7917 const STRLEN unilen = reguni(pRExC_state, ender, s);
7926 REGC((char)ender, s++);
7932 /* Emit all the Unicode characters. */
7934 for (foldbuf = tmpbuf;
7936 foldlen -= numlen) {
7937 ender = utf8_to_uvchr(foldbuf, &numlen);
7939 const STRLEN unilen = reguni(pRExC_state, ender, s);
7942 /* In EBCDIC the numlen
7943 * and unilen can differ. */
7945 if (numlen >= foldlen)
7953 const STRLEN unilen = reguni(pRExC_state, ender, s);
7962 REGC((char)ender, s++);
7966 Set_Node_Cur_Length(ret); /* MJD */
7967 nextchar(pRExC_state);
7969 /* len is STRLEN which is unsigned, need to copy to signed */
7972 vFAIL("Internal disaster");
7976 if (len == 1 && UNI_IS_INVARIANT(ender))
7980 RExC_size += STR_SZ(len);
7983 RExC_emit += STR_SZ(len);
7993 S_regwhite( RExC_state_t *pRExC_state, char *p )
7995 const char *e = RExC_end;
7997 PERL_ARGS_ASSERT_REGWHITE;
8002 else if (*p == '#') {
8011 RExC_seen |= REG_SEEN_RUN_ON_COMMENT;
8019 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
8020 Character classes ([:foo:]) can also be negated ([:^foo:]).
8021 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
8022 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
8023 but trigger failures because they are currently unimplemented. */
8025 #define POSIXCC_DONE(c) ((c) == ':')
8026 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
8027 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
8030 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
8033 I32 namedclass = OOB_NAMEDCLASS;
8035 PERL_ARGS_ASSERT_REGPPOSIXCC;
8037 if (value == '[' && RExC_parse + 1 < RExC_end &&
8038 /* I smell either [: or [= or [. -- POSIX has been here, right? */
8039 POSIXCC(UCHARAT(RExC_parse))) {
8040 const char c = UCHARAT(RExC_parse);
8041 char* const s = RExC_parse++;
8043 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
8045 if (RExC_parse == RExC_end)
8046 /* Grandfather lone [:, [=, [. */
8049 const char* const t = RExC_parse++; /* skip over the c */
8052 if (UCHARAT(RExC_parse) == ']') {
8053 const char *posixcc = s + 1;
8054 RExC_parse++; /* skip over the ending ] */
8057 const I32 complement = *posixcc == '^' ? *posixcc++ : 0;
8058 const I32 skip = t - posixcc;
8060 /* Initially switch on the length of the name. */
8063 if (memEQ(posixcc, "word", 4)) /* this is not POSIX, this is the Perl \w */
8064 namedclass = complement ? ANYOF_NALNUM : ANYOF_ALNUM;
8067 /* Names all of length 5. */
8068 /* alnum alpha ascii blank cntrl digit graph lower
8069 print punct space upper */
8070 /* Offset 4 gives the best switch position. */
8071 switch (posixcc[4]) {
8073 if (memEQ(posixcc, "alph", 4)) /* alpha */
8074 namedclass = complement ? ANYOF_NALPHA : ANYOF_ALPHA;
8077 if (memEQ(posixcc, "spac", 4)) /* space */
8078 namedclass = complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
8081 if (memEQ(posixcc, "grap", 4)) /* graph */
8082 namedclass = complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
8085 if (memEQ(posixcc, "asci", 4)) /* ascii */
8086 namedclass = complement ? ANYOF_NASCII : ANYOF_ASCII;
8089 if (memEQ(posixcc, "blan", 4)) /* blank */
8090 namedclass = complement ? ANYOF_NBLANK : ANYOF_BLANK;
8093 if (memEQ(posixcc, "cntr", 4)) /* cntrl */
8094 namedclass = complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
8097 if (memEQ(posixcc, "alnu", 4)) /* alnum */
8098 namedclass = complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
8101 if (memEQ(posixcc, "lowe", 4)) /* lower */
8102 namedclass = complement ? ANYOF_NLOWER : ANYOF_LOWER;
8103 else if (memEQ(posixcc, "uppe", 4)) /* upper */
8104 namedclass = complement ? ANYOF_NUPPER : ANYOF_UPPER;
8107 if (memEQ(posixcc, "digi", 4)) /* digit */
8108 namedclass = complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
8109 else if (memEQ(posixcc, "prin", 4)) /* print */
8110 namedclass = complement ? ANYOF_NPRINT : ANYOF_PRINT;
8111 else if (memEQ(posixcc, "punc", 4)) /* punct */
8112 namedclass = complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
8117 if (memEQ(posixcc, "xdigit", 6))
8118 namedclass = complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
8122 if (namedclass == OOB_NAMEDCLASS)
8123 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
8125 assert (posixcc[skip] == ':');
8126 assert (posixcc[skip+1] == ']');
8127 } else if (!SIZE_ONLY) {
8128 /* [[=foo=]] and [[.foo.]] are still future. */
8130 /* adjust RExC_parse so the warning shows after
8132 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
8134 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
8137 /* Maternal grandfather:
8138 * "[:" ending in ":" but not in ":]" */
8148 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
8152 PERL_ARGS_ASSERT_CHECKPOSIXCC;
8154 if (POSIXCC(UCHARAT(RExC_parse))) {
8155 const char *s = RExC_parse;
8156 const char c = *s++;
8160 if (*s && c == *s && s[1] == ']') {
8162 "POSIX syntax [%c %c] belongs inside character classes",
8165 /* [[=foo=]] and [[.foo.]] are still future. */
8166 if (POSIXCC_NOTYET(c)) {
8167 /* adjust RExC_parse so the error shows after
8169 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
8171 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
8177 /* No locale test */
8178 #define _C_C_T_NOLOC_(NAME,TEST,WORD) \
8180 for (value = 0; value < 256; value++) \
8182 stored += S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8186 case ANYOF_N##NAME: \
8187 for (value = 0; value < 256; value++) \
8189 stored += S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8194 /* Like the above, but there are differences if we are in uni-8-bit or not, so
8195 * there are two tests passed in, to use depending on that. There aren't any
8196 * cases where the label is different from the name, so no need for that
8198 #define _C_C_T_(NAME,TEST_8,TEST_7,WORD) \
8200 if (LOC) ANYOF_CLASS_SET(ret, ANYOF_##NAME); \
8201 else if (UNI_SEMANTICS) { \
8202 for (value = 0; value < 256; value++) { \
8203 if (TEST_8) stored += \
8204 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8208 for (value = 0; value < 128; value++) { \
8209 if (TEST_7) stored += \
8210 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) UNI_TO_NATIVE(value)); \
8216 case ANYOF_N##NAME: \
8217 if (LOC) ANYOF_CLASS_SET(ret, ANYOF_N##NAME); \
8218 else if (UNI_SEMANTICS) { \
8219 for (value = 0; value < 256; value++) { \
8220 if (! TEST_8) stored += \
8221 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8225 for (value = 0; value < 128; value++) { \
8226 if (! TEST_7) stored += \
8227 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8229 for (value = 128; value < 256; value++) { \
8230 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value); \
8238 We dont use PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS as the direct test
8239 so that it is possible to override the option here without having to
8240 rebuild the entire core. as we are required to do if we change regcomp.h
8241 which is where PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS is defined.
8243 #if PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS
8244 #define BROKEN_UNICODE_CHARCLASS_MAPPINGS
8247 #ifdef BROKEN_UNICODE_CHARCLASS_MAPPINGS
8248 #define POSIX_CC_UNI_NAME(CCNAME) CCNAME
8250 #define POSIX_CC_UNI_NAME(CCNAME) "Posix" CCNAME
8254 S_set_regclass_bit_fold(pTHX_ RExC_state_t *pRExC_state, regnode* node, const U8 value)
8257 /* Handle the setting of folds in the bitmap for non-locale ANYOF nodes.
8258 * Locale folding is done at run-time, so this function should not be
8259 * called for nodes that are for locales.
8261 * This function simply sets the bit corresponding to the fold of the input
8262 * 'value', if not already set. The fold of 'f' is 'F', and the fold of
8265 * It also sets any necessary flags, and returns the number of bits that
8266 * actually changed from 0 to 1 */
8271 fold = (UNI_SEMANTICS) ? PL_fold_latin1[value]
8274 /* It assumes the bit for 'value' has already been set */
8275 if (fold != value && ! ANYOF_BITMAP_TEST(node, fold)) {
8276 ANYOF_BITMAP_SET(node, fold);
8280 /* The fold of the German sharp s is two ASCII characters, so isn't in the
8281 * bitmap and doesn't have to be in utf8, but we only process it if unicode
8282 * semantics are called for */
8283 if (UNI_SEMANTICS && value == LATIN_SMALL_LETTER_SHARP_S) {
8284 ANYOF_FLAGS(node) |= ANYOF_NONBITMAP_NON_UTF8;
8286 else if (_HAS_NONLATIN1_FOLD_CLOSURE_ONLY_FOR_USE_BY_REGCOMP_DOT_C_AND_REGEXEC_DOT_C(value)
8289 && PL_fold_latin1[value] != value))
8290 { /* A character that has a fold outside of Latin1 matches outside the
8291 bitmap, but only when the target string is utf8. Similarly when we
8292 don't have unicode semantics for the above ASCII Latin-1 characters,
8293 and they have a fold, they should match if the target is utf8, and
8295 ANYOF_FLAGS(node) |= ANYOF_UTF8;
8302 PERL_STATIC_INLINE U8
8303 S_set_regclass_bit(pTHX_ RExC_state_t *pRExC_state, regnode* node, const U8 value)
8305 /* This inline function sets a bit in the bitmap if not already set, and if
8306 * appropriate, its fold, returning the number of bits that actually
8307 * changed from 0 to 1 */
8311 if (ANYOF_BITMAP_TEST(node, value)) { /* Already set */
8315 ANYOF_BITMAP_SET(node, value);
8318 if (FOLD && ! LOC) { /* Locale folds aren't known until runtime */
8319 stored += S_set_regclass_bit_fold(aTHX_ pRExC_state, node, value);
8326 parse a class specification and produce either an ANYOF node that
8327 matches the pattern or if the pattern matches a single char only and
8328 that char is < 256 and we are case insensitive then we produce an
8333 S_regclass(pTHX_ RExC_state_t *pRExC_state, U32 depth)
8336 register UV nextvalue;
8337 register IV prevvalue = OOB_UNICODE;
8338 register IV range = 0;
8339 UV value = 0; /* XXX:dmq: needs to be referenceable (unfortunately) */
8340 register regnode *ret;
8343 char *rangebegin = NULL;
8344 bool need_class = 0;
8347 AV* unicode_alternate = NULL;
8349 UV literal_endpoint = 0;
8351 UV stored = 0; /* how many chars stored in the bitmap */
8353 regnode * const orig_emit = RExC_emit; /* Save the original RExC_emit in
8354 case we need to change the emitted regop to an EXACT. */
8355 const char * orig_parse = RExC_parse;
8356 GET_RE_DEBUG_FLAGS_DECL;
8358 PERL_ARGS_ASSERT_REGCLASS;
8360 PERL_UNUSED_ARG(depth);
8363 DEBUG_PARSE("clas");
8365 /* Assume we are going to generate an ANYOF node. */
8366 ret = reganode(pRExC_state, ANYOF, 0);
8369 ANYOF_FLAGS(ret) = 0;
8371 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
8375 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
8379 RExC_size += ANYOF_SKIP;
8380 #ifdef ANYOF_ADD_LOC_SKIP
8382 RExC_size += ANYOF_ADD_LOC_SKIP;
8385 listsv = &PL_sv_undef; /* For code scanners: listsv always non-NULL. */
8388 RExC_emit += ANYOF_SKIP;
8390 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
8391 #ifdef ANYOF_ADD_LOC_SKIP
8392 RExC_emit += ANYOF_ADD_LOC_SKIP;
8395 ANYOF_BITMAP_ZERO(ret);
8396 listsv = newSVpvs("# comment\n");
8399 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
8401 if (!SIZE_ONLY && POSIXCC(nextvalue))
8402 checkposixcc(pRExC_state);
8404 /* allow 1st char to be ] (allowing it to be - is dealt with later) */
8405 if (UCHARAT(RExC_parse) == ']')
8409 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
8413 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
8416 rangebegin = RExC_parse;
8418 value = utf8n_to_uvchr((U8*)RExC_parse,
8419 RExC_end - RExC_parse,
8420 &numlen, UTF8_ALLOW_DEFAULT);
8421 RExC_parse += numlen;
8424 value = UCHARAT(RExC_parse++);
8426 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
8427 if (value == '[' && POSIXCC(nextvalue))
8428 namedclass = regpposixcc(pRExC_state, value);
8429 else if (value == '\\') {
8431 value = utf8n_to_uvchr((U8*)RExC_parse,
8432 RExC_end - RExC_parse,
8433 &numlen, UTF8_ALLOW_DEFAULT);
8434 RExC_parse += numlen;
8437 value = UCHARAT(RExC_parse++);
8438 /* Some compilers cannot handle switching on 64-bit integer
8439 * values, therefore value cannot be an UV. Yes, this will
8440 * be a problem later if we want switch on Unicode.
8441 * A similar issue a little bit later when switching on
8442 * namedclass. --jhi */
8443 switch ((I32)value) {
8444 case 'w': namedclass = ANYOF_ALNUM; break;
8445 case 'W': namedclass = ANYOF_NALNUM; break;
8446 case 's': namedclass = ANYOF_SPACE; break;
8447 case 'S': namedclass = ANYOF_NSPACE; break;
8448 case 'd': namedclass = ANYOF_DIGIT; break;
8449 case 'D': namedclass = ANYOF_NDIGIT; break;
8450 case 'v': namedclass = ANYOF_VERTWS; break;
8451 case 'V': namedclass = ANYOF_NVERTWS; break;
8452 case 'h': namedclass = ANYOF_HORIZWS; break;
8453 case 'H': namedclass = ANYOF_NHORIZWS; break;
8454 case 'N': /* Handle \N{NAME} in class */
8456 /* We only pay attention to the first char of
8457 multichar strings being returned. I kinda wonder
8458 if this makes sense as it does change the behaviour
8459 from earlier versions, OTOH that behaviour was broken
8461 UV v; /* value is register so we cant & it /grrr */
8462 if (reg_namedseq(pRExC_state, &v, NULL)) {
8472 if (RExC_parse >= RExC_end)
8473 vFAIL2("Empty \\%c{}", (U8)value);
8474 if (*RExC_parse == '{') {
8475 const U8 c = (U8)value;
8476 e = strchr(RExC_parse++, '}');
8478 vFAIL2("Missing right brace on \\%c{}", c);
8479 while (isSPACE(UCHARAT(RExC_parse)))
8481 if (e == RExC_parse)
8482 vFAIL2("Empty \\%c{}", c);
8484 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
8492 if (UCHARAT(RExC_parse) == '^') {
8495 value = value == 'p' ? 'P' : 'p'; /* toggle */
8496 while (isSPACE(UCHARAT(RExC_parse))) {
8501 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::%.*s\n",
8502 (value=='p' ? '+' : '!'), (int)n, RExC_parse);
8506 /* The \p could match something in the Latin1 range, hence
8507 * something that isn't utf8 */
8508 ANYOF_FLAGS(ret) |= ANYOF_NONBITMAP;
8509 namedclass = ANYOF_MAX; /* no official name, but it's named */
8512 case 'n': value = '\n'; break;
8513 case 'r': value = '\r'; break;
8514 case 't': value = '\t'; break;
8515 case 'f': value = '\f'; break;
8516 case 'b': value = '\b'; break;
8517 case 'e': value = ASCII_TO_NATIVE('\033');break;
8518 case 'a': value = ASCII_TO_NATIVE('\007');break;
8520 RExC_parse--; /* function expects to be pointed at the 'o' */
8522 const char* error_msg;
8523 bool valid = grok_bslash_o(RExC_parse,
8528 RExC_parse += numlen;
8533 if (PL_encoding && value < 0x100) {
8534 goto recode_encoding;
8538 if (*RExC_parse == '{') {
8539 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
8540 | PERL_SCAN_DISALLOW_PREFIX;
8541 char * const e = strchr(RExC_parse++, '}');
8543 vFAIL("Missing right brace on \\x{}");
8545 numlen = e - RExC_parse;
8546 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
8550 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
8552 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
8553 RExC_parse += numlen;
8555 if (PL_encoding && value < 0x100)
8556 goto recode_encoding;
8559 value = grok_bslash_c(*RExC_parse++, SIZE_ONLY);
8561 case '0': case '1': case '2': case '3': case '4':
8562 case '5': case '6': case '7':
8564 /* Take 1-3 octal digits */
8565 I32 flags = PERL_SCAN_SILENT_ILLDIGIT;
8567 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
8568 RExC_parse += numlen;
8569 if (PL_encoding && value < 0x100)
8570 goto recode_encoding;
8575 SV* enc = PL_encoding;
8576 value = reg_recode((const char)(U8)value, &enc);
8577 if (!enc && SIZE_ONLY)
8578 ckWARNreg(RExC_parse,
8579 "Invalid escape in the specified encoding");
8583 /* Allow \_ to not give an error */
8584 if (!SIZE_ONLY && isALNUM(value) && value != '_') {
8585 ckWARN2reg(RExC_parse,
8586 "Unrecognized escape \\%c in character class passed through",
8591 } /* end of \blah */
8597 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
8599 /* What matches in a locale is not known until runtime, so need to
8600 * (one time per class) allocate extra space to pass to regexec.
8601 * The space will contain a bit for each named class that is to be
8602 * matched against. This isn't needed for \p{} and pseudo-classes,
8603 * as they are not affected by locale, and hence are dealt with
8605 if (LOC && namedclass < ANYOF_MAX && ! need_class) {
8608 #ifdef ANYOF_CLASS_ADD_SKIP
8609 RExC_size += ANYOF_CLASS_ADD_SKIP;
8613 #ifdef ANYOF_CLASS_ADD_SKIP
8614 RExC_emit += ANYOF_CLASS_ADD_SKIP;
8616 ANYOF_CLASS_ZERO(ret);
8618 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
8621 /* a bad range like a-\d, a-[:digit:] ? */
8625 RExC_parse >= rangebegin ?
8626 RExC_parse - rangebegin : 0;
8627 ckWARN4reg(RExC_parse,
8628 "False [] range \"%*.*s\"",
8631 if (prevvalue < 256) {
8633 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) prevvalue);
8635 S_set_regclass_bit(aTHX_ pRExC_state, ret, '-');
8638 ANYOF_FLAGS(ret) |= ANYOF_UTF8;
8639 Perl_sv_catpvf(aTHX_ listsv,
8640 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
8644 range = 0; /* this was not a true range */
8650 const char *what = NULL;
8653 /* Possible truncation here but in some 64-bit environments
8654 * the compiler gets heartburn about switch on 64-bit values.
8655 * A similar issue a little earlier when switching on value.
8657 switch ((I32)namedclass) {
8659 case _C_C_T_(ALNUMC, isALNUMC_L1(value), isALNUMC(value), "XPosixAlnum");
8660 case _C_C_T_(ALPHA, isALPHA_L1(value), isALPHA(value), "XPosixAlpha");
8661 case _C_C_T_(BLANK, isBLANK_L1(value), isBLANK(value), "XPosixBlank");
8662 case _C_C_T_(CNTRL, isCNTRL_L1(value), isCNTRL(value), "XPosixCntrl");
8663 case _C_C_T_(GRAPH, isGRAPH_L1(value), isGRAPH(value), "XPosixGraph");
8664 case _C_C_T_(LOWER, isLOWER_L1(value), isLOWER(value), "XPosixLower");
8665 case _C_C_T_(PRINT, isPRINT_L1(value), isPRINT(value), "XPosixPrint");
8666 case _C_C_T_(PSXSPC, isPSXSPC_L1(value), isPSXSPC(value), "XPosixSpace");
8667 case _C_C_T_(PUNCT, isPUNCT_L1(value), isPUNCT(value), "XPosixPunct");
8668 case _C_C_T_(UPPER, isUPPER_L1(value), isUPPER(value), "XPosixUpper");
8669 #ifdef BROKEN_UNICODE_CHARCLASS_MAPPINGS
8670 /* \s, \w match all unicode if utf8. */
8671 case _C_C_T_(SPACE, isSPACE_L1(value), isSPACE(value), "SpacePerl");
8672 case _C_C_T_(ALNUM, isWORDCHAR_L1(value), isALNUM(value), "Word");
8674 /* \s, \w match ascii and locale only */
8675 case _C_C_T_(SPACE, isSPACE_L1(value), isSPACE(value), "PerlSpace");
8676 case _C_C_T_(ALNUM, isWORDCHAR_L1(value), isALNUM(value), "PerlWord");
8678 case _C_C_T_(XDIGIT, isXDIGIT_L1(value), isXDIGIT(value), "XPosixXDigit");
8679 case _C_C_T_NOLOC_(VERTWS, is_VERTWS_latin1(&value), "VertSpace");
8680 case _C_C_T_NOLOC_(HORIZWS, is_HORIZWS_latin1(&value), "HorizSpace");
8683 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
8685 for (value = 0; value < 128; value++)
8687 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) ASCII_TO_NATIVE(value));
8690 what = NULL; /* Doesn't match outside ascii, so
8691 don't want to add +utf8:: */
8695 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
8697 for (value = 128; value < 256; value++)
8699 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) ASCII_TO_NATIVE(value));
8706 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
8708 /* consecutive digits assumed */
8709 for (value = '0'; value <= '9'; value++)
8711 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value);
8714 what = POSIX_CC_UNI_NAME("Digit");
8718 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
8720 /* consecutive digits assumed */
8721 for (value = 0; value < '0'; value++)
8723 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value);
8724 for (value = '9' + 1; value < 256; value++)
8726 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) value);
8729 what = POSIX_CC_UNI_NAME("Digit");
8732 /* this is to handle \p and \P */
8735 vFAIL("Invalid [::] class");
8739 /* Strings such as "+utf8::isWord\n" */
8740 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::Is%s\n", yesno, what);
8741 ANYOF_FLAGS(ret) |= ANYOF_UTF8;
8746 } /* end of namedclass \blah */
8749 if (prevvalue > (IV)value) /* b-a */ {
8750 const int w = RExC_parse - rangebegin;
8751 Simple_vFAIL4("Invalid [] range \"%*.*s\"", w, w, rangebegin);
8752 range = 0; /* not a valid range */
8756 prevvalue = value; /* save the beginning of the range */
8757 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
8758 RExC_parse[1] != ']') {
8761 /* a bad range like \w-, [:word:]- ? */
8762 if (namedclass > OOB_NAMEDCLASS) {
8763 if (ckWARN(WARN_REGEXP)) {
8765 RExC_parse >= rangebegin ?
8766 RExC_parse - rangebegin : 0;
8768 "False [] range \"%*.*s\"",
8773 S_set_regclass_bit(aTHX_ pRExC_state, ret, '-');
8775 range = 1; /* yeah, it's a range! */
8776 continue; /* but do it the next time */
8780 /* now is the next time */
8782 if (prevvalue < 256) {
8783 const IV ceilvalue = value < 256 ? value : 255;
8786 /* In EBCDIC [\x89-\x91] should include
8787 * the \x8e but [i-j] should not. */
8788 if (literal_endpoint == 2 &&
8789 ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
8790 (isUPPER(prevvalue) && isUPPER(ceilvalue))))
8792 if (isLOWER(prevvalue)) {
8793 for (i = prevvalue; i <= ceilvalue; i++)
8794 if (isLOWER(i) && !ANYOF_BITMAP_TEST(ret,i)) {
8796 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) i);
8799 for (i = prevvalue; i <= ceilvalue; i++)
8800 if (isUPPER(i) && !ANYOF_BITMAP_TEST(ret,i)) {
8802 S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) i);
8808 for (i = prevvalue; i <= ceilvalue; i++) {
8809 stored += S_set_regclass_bit(aTHX_ pRExC_state, ret, (U8) i);
8812 if (value > 255 || UTF) {
8813 const UV prevnatvalue = NATIVE_TO_UNI(prevvalue);
8814 const UV natvalue = NATIVE_TO_UNI(value);
8816 /* If the code point requires utf8 to represent, and we are not
8817 * folding, it can't match unless the target is in utf8. Only
8818 * a few code points above 255 fold to below it, so XXX an
8819 * optimization would be to know which ones and set the flag
8821 ANYOF_FLAGS(ret) |= (FOLD || value < 256)
8824 if (prevnatvalue < natvalue) { /* what about > ? */
8825 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
8826 prevnatvalue, natvalue);
8828 else if (prevnatvalue == natvalue) {
8829 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue);
8831 U8 foldbuf[UTF8_MAXBYTES_CASE+1];
8833 const UV f = to_uni_fold(natvalue, foldbuf, &foldlen);
8835 #ifdef EBCDIC /* RD t/uni/fold ff and 6b */
8836 if (RExC_precomp[0] == ':' &&
8837 RExC_precomp[1] == '[' &&
8838 (f == 0xDF || f == 0x92)) {
8839 f = NATIVE_TO_UNI(f);
8842 /* If folding and foldable and a single
8843 * character, insert also the folded version
8844 * to the charclass. */
8846 #ifdef EBCDIC /* RD tunifold ligatures s,t fb05, fb06 */
8847 if ((RExC_precomp[0] == ':' &&
8848 RExC_precomp[1] == '[' &&
8850 (value == 0xFB05 || value == 0xFB06))) ?
8851 foldlen == ((STRLEN)UNISKIP(f) - 1) :
8852 foldlen == (STRLEN)UNISKIP(f) )
8854 if (foldlen == (STRLEN)UNISKIP(f))
8856 Perl_sv_catpvf(aTHX_ listsv,
8859 /* Any multicharacter foldings
8860 * require the following transform:
8861 * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst)
8862 * where E folds into "pq" and F folds
8863 * into "rst", all other characters
8864 * fold to single characters. We save
8865 * away these multicharacter foldings,
8866 * to be later saved as part of the
8867 * additional "s" data. */
8870 if (!unicode_alternate)
8871 unicode_alternate = newAV();
8872 sv = newSVpvn_utf8((char*)foldbuf, foldlen,
8874 av_push(unicode_alternate, sv);
8878 /* If folding and the value is one of the Greek
8879 * sigmas insert a few more sigmas to make the
8880 * folding rules of the sigmas to work right.
8881 * Note that not all the possible combinations
8882 * are handled here: some of them are handled
8883 * by the standard folding rules, and some of
8884 * them (literal or EXACTF cases) are handled
8885 * during runtime in regexec.c:S_find_byclass(). */
8886 if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) {
8887 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
8888 (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA);
8889 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
8890 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
8892 else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA)
8893 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
8894 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
8899 literal_endpoint = 0;
8903 range = 0; /* this range (if it was one) is done now */
8910 /****** !SIZE_ONLY AFTER HERE *********/
8912 /* Folding in the bitmap is taken care of above, but not for locale, for
8913 * which we have to wait to see what folding is in effect at runtime, and
8914 * for things not in the bitmap */
8915 if (FOLD && (LOC || ANYOF_FLAGS(ret) & ANYOF_NONBITMAP)) {
8916 ANYOF_FLAGS(ret) |= ANYOF_LOC_NONBITMAP_FOLD;
8919 /* Optimize inverted simple patterns (e.g. [^a-z]). Note that this doesn't
8920 * optimize locale. Doing so perhaps could be done as long as there is
8921 * nothing like \w in it; some thought also would have to be given to the
8922 * interaction with above 0x100 chars */
8923 if ((ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
8924 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
8925 ANYOF_BITMAP(ret)[value] ^= 0xFF;
8926 stored = 256 - stored;
8928 /* The inversion means that everything above 255 is matched */
8929 ANYOF_FLAGS(ret) = ANYOF_UTF8|ANYOF_UNICODE_ALL;
8932 /* A single character class can be "optimized" into an EXACTish node.
8933 * Note that since we don't currently count how many characters there are
8934 * outside the bitmap, we are XXX missing optimization possibilities for
8935 * them. This optimization can't happen unless this is a truly single
8936 * character class, which means that it can't be an inversion into a
8937 * many-character class, and there must be no possibility of there being
8938 * things outside the bitmap. 'stored' (only) for locales doesn't include
8939 * \w, etc, so have to make a special test that they aren't present
8941 * Similarly A 2-character class of the very special form like [bB] can be
8942 * optimized into an EXACTFish node, but only for non-locales, and for
8943 * characters which only have the two folds; so things like 'fF' and 'Ii'
8944 * wouldn't work because they are part of the fold of 'LATIN SMALL LIGATURE
8946 if (! (ANYOF_FLAGS(ret) & (ANYOF_NONBITMAP|ANYOF_INVERT|ANYOF_UNICODE_ALL))
8947 && (((stored == 1 && ((! (ANYOF_FLAGS(ret) & ANYOF_LOCALE))
8948 || (! ANYOF_CLASS_TEST_ANY_SET(ret)))))
8949 || (stored == 2 && ((! (ANYOF_FLAGS(ret) & ANYOF_LOCALE))
8950 && (! _HAS_NONLATIN1_FOLD_CLOSURE_ONLY_FOR_USE_BY_REGCOMP_DOT_C_AND_REGEXEC_DOT_C(value))
8951 /* If the latest code point has a fold whose
8952 * bit is set, it must be the only other one */
8953 && ((prevvalue = PL_fold_latin1[value]) != (IV)value)
8954 && ANYOF_BITMAP_TEST(ret, prevvalue)))))
8956 /* Note that the information needed to decide to do this optimization
8957 * is not currently available until the 2nd pass, and that the actually
8958 * used EXACTish node takes less space than the calculated ANYOF node,
8959 * and hence the amount of space calculated in the first pass is larger
8960 * than actually used, so this optimization doesn't gain us any space.
8961 * But an EXACT node is faster than an ANYOF node, and can be combined
8962 * with any adjacent EXACT nodes later by the optimizer for further
8963 * gains. The speed of executing an EXACTF is similar to an ANYOF
8964 * node, so the optimization advantage comes from the ability to join
8965 * it to adjacent EXACT nodes */
8967 const char * cur_parse= RExC_parse;
8969 RExC_emit = (regnode *)orig_emit;
8970 RExC_parse = (char *)orig_parse;
8974 /* A locale node with one point can be folded; all the other cases
8975 * with folding will have two points, since we calculate them above
8977 if (ANYOF_FLAGS(ret) & ANYOF_LOC_NONBITMAP_FOLD) {
8983 } /* else 2 chars in the bit map: the folds of each other */
8984 else if (UNI_SEMANTICS || !isASCII(value)) {
8986 /* To join adjacent nodes, they must be the exact EXACTish type.
8987 * Try to use the most likely type, by using EXACTFU if the regex
8988 * calls for them, or is required because the character is
8992 else { /* Otherwise, more likely to be EXACTF type */
8996 ret = reg_node(pRExC_state, op);
8997 RExC_parse = (char *)cur_parse;
8998 if (UTF && ! NATIVE_IS_INVARIANT(value)) {
8999 *STRING(ret)= UTF8_EIGHT_BIT_HI((U8) value);
9000 *(STRING(ret) + 1)= UTF8_EIGHT_BIT_LO((U8) value);
9002 RExC_emit += STR_SZ(2);
9005 *STRING(ret)= (char)value;
9007 RExC_emit += STR_SZ(1);
9009 SvREFCNT_dec(listsv);
9014 AV * const av = newAV();
9016 /* The 0th element stores the character class description
9017 * in its textual form: used later (regexec.c:Perl_regclass_swash())
9018 * to initialize the appropriate swash (which gets stored in
9019 * the 1st element), and also useful for dumping the regnode.
9020 * The 2nd element stores the multicharacter foldings,
9021 * used later (regexec.c:S_reginclass()). */
9022 av_store(av, 0, listsv);
9023 av_store(av, 1, NULL);
9024 av_store(av, 2, MUTABLE_SV(unicode_alternate));
9025 rv = newRV_noinc(MUTABLE_SV(av));
9026 n = add_data(pRExC_state, 1, "s");
9027 RExC_rxi->data->data[n] = (void*)rv;
9035 /* reg_skipcomment()
9037 Absorbs an /x style # comments from the input stream.
9038 Returns true if there is more text remaining in the stream.
9039 Will set the REG_SEEN_RUN_ON_COMMENT flag if the comment
9040 terminates the pattern without including a newline.
9042 Note its the callers responsibility to ensure that we are
9048 S_reg_skipcomment(pTHX_ RExC_state_t *pRExC_state)
9052 PERL_ARGS_ASSERT_REG_SKIPCOMMENT;
9054 while (RExC_parse < RExC_end)
9055 if (*RExC_parse++ == '\n') {
9060 /* we ran off the end of the pattern without ending
9061 the comment, so we have to add an \n when wrapping */
9062 RExC_seen |= REG_SEEN_RUN_ON_COMMENT;
9070 Advances the parse position, and optionally absorbs
9071 "whitespace" from the inputstream.
9073 Without /x "whitespace" means (?#...) style comments only,
9074 with /x this means (?#...) and # comments and whitespace proper.
9076 Returns the RExC_parse point from BEFORE the scan occurs.
9078 This is the /x friendly way of saying RExC_parse++.
9082 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
9084 char* const retval = RExC_parse++;
9086 PERL_ARGS_ASSERT_NEXTCHAR;
9089 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
9090 RExC_parse[2] == '#') {
9091 while (*RExC_parse != ')') {
9092 if (RExC_parse == RExC_end)
9093 FAIL("Sequence (?#... not terminated");
9099 if (RExC_flags & RXf_PMf_EXTENDED) {
9100 if (isSPACE(*RExC_parse)) {
9104 else if (*RExC_parse == '#') {
9105 if ( reg_skipcomment( pRExC_state ) )
9114 - reg_node - emit a node
9116 STATIC regnode * /* Location. */
9117 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
9120 register regnode *ptr;
9121 regnode * const ret = RExC_emit;
9122 GET_RE_DEBUG_FLAGS_DECL;
9124 PERL_ARGS_ASSERT_REG_NODE;
9127 SIZE_ALIGN(RExC_size);
9131 if (RExC_emit >= RExC_emit_bound)
9132 Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %d", op);
9134 NODE_ALIGN_FILL(ret);
9136 FILL_ADVANCE_NODE(ptr, op);
9137 #ifdef RE_TRACK_PATTERN_OFFSETS
9138 if (RExC_offsets) { /* MJD */
9139 MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n",
9140 "reg_node", __LINE__,
9142 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0]
9143 ? "Overwriting end of array!\n" : "OK",
9144 (UV)(RExC_emit - RExC_emit_start),
9145 (UV)(RExC_parse - RExC_start),
9146 (UV)RExC_offsets[0]));
9147 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
9155 - reganode - emit a node with an argument
9157 STATIC regnode * /* Location. */
9158 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
9161 register regnode *ptr;
9162 regnode * const ret = RExC_emit;
9163 GET_RE_DEBUG_FLAGS_DECL;
9165 PERL_ARGS_ASSERT_REGANODE;
9168 SIZE_ALIGN(RExC_size);
9173 assert(2==regarglen[op]+1);
9175 Anything larger than this has to allocate the extra amount.
9176 If we changed this to be:
9178 RExC_size += (1 + regarglen[op]);
9180 then it wouldn't matter. Its not clear what side effect
9181 might come from that so its not done so far.
9186 if (RExC_emit >= RExC_emit_bound)
9187 Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %d", op);
9189 NODE_ALIGN_FILL(ret);
9191 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
9192 #ifdef RE_TRACK_PATTERN_OFFSETS
9193 if (RExC_offsets) { /* MJD */
9194 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
9198 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] ?
9199 "Overwriting end of array!\n" : "OK",
9200 (UV)(RExC_emit - RExC_emit_start),
9201 (UV)(RExC_parse - RExC_start),
9202 (UV)RExC_offsets[0]));
9203 Set_Cur_Node_Offset;
9211 - reguni - emit (if appropriate) a Unicode character
9214 S_reguni(pTHX_ const RExC_state_t *pRExC_state, UV uv, char* s)
9218 PERL_ARGS_ASSERT_REGUNI;
9220 return SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
9224 - reginsert - insert an operator in front of already-emitted operand
9226 * Means relocating the operand.
9229 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd, U32 depth)
9232 register regnode *src;
9233 register regnode *dst;
9234 register regnode *place;
9235 const int offset = regarglen[(U8)op];
9236 const int size = NODE_STEP_REGNODE + offset;
9237 GET_RE_DEBUG_FLAGS_DECL;
9239 PERL_ARGS_ASSERT_REGINSERT;
9240 PERL_UNUSED_ARG(depth);
9241 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
9242 DEBUG_PARSE_FMT("inst"," - %s",PL_reg_name[op]);
9251 if (RExC_open_parens) {
9253 /*DEBUG_PARSE_FMT("inst"," - %"IVdf, (IV)RExC_npar);*/
9254 for ( paren=0 ; paren < RExC_npar ; paren++ ) {
9255 if ( RExC_open_parens[paren] >= opnd ) {
9256 /*DEBUG_PARSE_FMT("open"," - %d",size);*/
9257 RExC_open_parens[paren] += size;
9259 /*DEBUG_PARSE_FMT("open"," - %s","ok");*/
9261 if ( RExC_close_parens[paren] >= opnd ) {
9262 /*DEBUG_PARSE_FMT("close"," - %d",size);*/
9263 RExC_close_parens[paren] += size;
9265 /*DEBUG_PARSE_FMT("close"," - %s","ok");*/
9270 while (src > opnd) {
9271 StructCopy(--src, --dst, regnode);
9272 #ifdef RE_TRACK_PATTERN_OFFSETS
9273 if (RExC_offsets) { /* MJD 20010112 */
9274 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %"UVuf" -> %"UVuf" (max %"UVuf").\n",
9278 (UV)(dst - RExC_emit_start) > RExC_offsets[0]
9279 ? "Overwriting end of array!\n" : "OK",
9280 (UV)(src - RExC_emit_start),
9281 (UV)(dst - RExC_emit_start),
9282 (UV)RExC_offsets[0]));
9283 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
9284 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
9290 place = opnd; /* Op node, where operand used to be. */
9291 #ifdef RE_TRACK_PATTERN_OFFSETS
9292 if (RExC_offsets) { /* MJD */
9293 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
9297 (UV)(place - RExC_emit_start) > RExC_offsets[0]
9298 ? "Overwriting end of array!\n" : "OK",
9299 (UV)(place - RExC_emit_start),
9300 (UV)(RExC_parse - RExC_start),
9301 (UV)RExC_offsets[0]));
9302 Set_Node_Offset(place, RExC_parse);
9303 Set_Node_Length(place, 1);
9306 src = NEXTOPER(place);
9307 FILL_ADVANCE_NODE(place, op);
9308 Zero(src, offset, regnode);
9312 - regtail - set the next-pointer at the end of a node chain of p to val.
9313 - SEE ALSO: regtail_study
9315 /* TODO: All three parms should be const */
9317 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
9320 register regnode *scan;
9321 GET_RE_DEBUG_FLAGS_DECL;
9323 PERL_ARGS_ASSERT_REGTAIL;
9325 PERL_UNUSED_ARG(depth);
9331 /* Find last node. */
9334 regnode * const temp = regnext(scan);
9336 SV * const mysv=sv_newmortal();
9337 DEBUG_PARSE_MSG((scan==p ? "tail" : ""));
9338 regprop(RExC_rx, mysv, scan);
9339 PerlIO_printf(Perl_debug_log, "~ %s (%d) %s %s\n",
9340 SvPV_nolen_const(mysv), REG_NODE_NUM(scan),
9341 (temp == NULL ? "->" : ""),
9342 (temp == NULL ? PL_reg_name[OP(val)] : "")
9350 if (reg_off_by_arg[OP(scan)]) {
9351 ARG_SET(scan, val - scan);
9354 NEXT_OFF(scan) = val - scan;
9360 - regtail_study - set the next-pointer at the end of a node chain of p to val.
9361 - Look for optimizable sequences at the same time.
9362 - currently only looks for EXACT chains.
9364 This is expermental code. The idea is to use this routine to perform
9365 in place optimizations on branches and groups as they are constructed,
9366 with the long term intention of removing optimization from study_chunk so
9367 that it is purely analytical.
9369 Currently only used when in DEBUG mode. The macro REGTAIL_STUDY() is used
9370 to control which is which.
9373 /* TODO: All four parms should be const */
9376 S_regtail_study(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
9379 register regnode *scan;
9381 #ifdef EXPERIMENTAL_INPLACESCAN
9384 GET_RE_DEBUG_FLAGS_DECL;
9386 PERL_ARGS_ASSERT_REGTAIL_STUDY;
9392 /* Find last node. */
9396 regnode * const temp = regnext(scan);
9397 #ifdef EXPERIMENTAL_INPLACESCAN
9398 if (PL_regkind[OP(scan)] == EXACT)
9399 if (join_exact(pRExC_state,scan,&min,1,val,depth+1))
9408 if( exact == PSEUDO )
9410 else if ( exact != OP(scan) )
9419 SV * const mysv=sv_newmortal();
9420 DEBUG_PARSE_MSG((scan==p ? "tsdy" : ""));
9421 regprop(RExC_rx, mysv, scan);
9422 PerlIO_printf(Perl_debug_log, "~ %s (%d) -> %s\n",
9423 SvPV_nolen_const(mysv),
9425 PL_reg_name[exact]);
9432 SV * const mysv_val=sv_newmortal();
9433 DEBUG_PARSE_MSG("");
9434 regprop(RExC_rx, mysv_val, val);
9435 PerlIO_printf(Perl_debug_log, "~ attach to %s (%"IVdf") offset to %"IVdf"\n",
9436 SvPV_nolen_const(mysv_val),
9437 (IV)REG_NODE_NUM(val),
9441 if (reg_off_by_arg[OP(scan)]) {
9442 ARG_SET(scan, val - scan);
9445 NEXT_OFF(scan) = val - scan;
9453 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
9457 S_regdump_extflags(pTHX_ const char *lead, const U32 flags)
9462 for (bit=0; bit<32; bit++) {
9463 if (flags & (1<<bit)) {
9465 PerlIO_printf(Perl_debug_log, "%s",lead);
9466 PerlIO_printf(Perl_debug_log, "%s ",PL_reg_extflags_name[bit]);
9471 PerlIO_printf(Perl_debug_log, "\n");
9473 PerlIO_printf(Perl_debug_log, "%s[none-set]\n",lead);
9479 Perl_regdump(pTHX_ const regexp *r)
9483 SV * const sv = sv_newmortal();
9484 SV *dsv= sv_newmortal();
9486 GET_RE_DEBUG_FLAGS_DECL;
9488 PERL_ARGS_ASSERT_REGDUMP;
9490 (void)dumpuntil(r, ri->program, ri->program + 1, NULL, NULL, sv, 0, 0);
9492 /* Header fields of interest. */
9493 if (r->anchored_substr) {
9494 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->anchored_substr),
9495 RE_SV_DUMPLEN(r->anchored_substr), 30);
9496 PerlIO_printf(Perl_debug_log,
9497 "anchored %s%s at %"IVdf" ",
9498 s, RE_SV_TAIL(r->anchored_substr),
9499 (IV)r->anchored_offset);
9500 } else if (r->anchored_utf8) {
9501 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->anchored_utf8),
9502 RE_SV_DUMPLEN(r->anchored_utf8), 30);
9503 PerlIO_printf(Perl_debug_log,
9504 "anchored utf8 %s%s at %"IVdf" ",
9505 s, RE_SV_TAIL(r->anchored_utf8),
9506 (IV)r->anchored_offset);
9508 if (r->float_substr) {
9509 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->float_substr),
9510 RE_SV_DUMPLEN(r->float_substr), 30);
9511 PerlIO_printf(Perl_debug_log,
9512 "floating %s%s at %"IVdf"..%"UVuf" ",
9513 s, RE_SV_TAIL(r->float_substr),
9514 (IV)r->float_min_offset, (UV)r->float_max_offset);
9515 } else if (r->float_utf8) {
9516 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->float_utf8),
9517 RE_SV_DUMPLEN(r->float_utf8), 30);
9518 PerlIO_printf(Perl_debug_log,
9519 "floating utf8 %s%s at %"IVdf"..%"UVuf" ",
9520 s, RE_SV_TAIL(r->float_utf8),
9521 (IV)r->float_min_offset, (UV)r->float_max_offset);
9523 if (r->check_substr || r->check_utf8)
9524 PerlIO_printf(Perl_debug_log,
9526 (r->check_substr == r->float_substr
9527 && r->check_utf8 == r->float_utf8
9528 ? "(checking floating" : "(checking anchored"));
9529 if (r->extflags & RXf_NOSCAN)
9530 PerlIO_printf(Perl_debug_log, " noscan");
9531 if (r->extflags & RXf_CHECK_ALL)
9532 PerlIO_printf(Perl_debug_log, " isall");
9533 if (r->check_substr || r->check_utf8)
9534 PerlIO_printf(Perl_debug_log, ") ");
9536 if (ri->regstclass) {
9537 regprop(r, sv, ri->regstclass);
9538 PerlIO_printf(Perl_debug_log, "stclass %s ", SvPVX_const(sv));
9540 if (r->extflags & RXf_ANCH) {
9541 PerlIO_printf(Perl_debug_log, "anchored");
9542 if (r->extflags & RXf_ANCH_BOL)
9543 PerlIO_printf(Perl_debug_log, "(BOL)");
9544 if (r->extflags & RXf_ANCH_MBOL)
9545 PerlIO_printf(Perl_debug_log, "(MBOL)");
9546 if (r->extflags & RXf_ANCH_SBOL)
9547 PerlIO_printf(Perl_debug_log, "(SBOL)");
9548 if (r->extflags & RXf_ANCH_GPOS)
9549 PerlIO_printf(Perl_debug_log, "(GPOS)");
9550 PerlIO_putc(Perl_debug_log, ' ');
9552 if (r->extflags & RXf_GPOS_SEEN)
9553 PerlIO_printf(Perl_debug_log, "GPOS:%"UVuf" ", (UV)r->gofs);
9554 if (r->intflags & PREGf_SKIP)
9555 PerlIO_printf(Perl_debug_log, "plus ");
9556 if (r->intflags & PREGf_IMPLICIT)
9557 PerlIO_printf(Perl_debug_log, "implicit ");
9558 PerlIO_printf(Perl_debug_log, "minlen %"IVdf" ", (IV)r->minlen);
9559 if (r->extflags & RXf_EVAL_SEEN)
9560 PerlIO_printf(Perl_debug_log, "with eval ");
9561 PerlIO_printf(Perl_debug_log, "\n");
9562 DEBUG_FLAGS_r(regdump_extflags("r->extflags: ",r->extflags));
9564 PERL_ARGS_ASSERT_REGDUMP;
9565 PERL_UNUSED_CONTEXT;
9567 #endif /* DEBUGGING */
9571 - regprop - printable representation of opcode
9573 #define EMIT_ANYOF_TEST_SEPARATOR(do_sep,sv,flags) \
9576 Perl_sv_catpvf(aTHX_ sv,"%s][%s",PL_colors[1],PL_colors[0]); \
9577 if (flags & ANYOF_INVERT) \
9578 /*make sure the invert info is in each */ \
9579 sv_catpvs(sv, "^"); \
9585 Perl_regprop(pTHX_ const regexp *prog, SV *sv, const regnode *o)
9590 RXi_GET_DECL(prog,progi);
9591 GET_RE_DEBUG_FLAGS_DECL;
9593 PERL_ARGS_ASSERT_REGPROP;
9597 if (OP(o) > REGNODE_MAX) /* regnode.type is unsigned */
9598 /* It would be nice to FAIL() here, but this may be called from
9599 regexec.c, and it would be hard to supply pRExC_state. */
9600 Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(o), (int)REGNODE_MAX);
9601 sv_catpv(sv, PL_reg_name[OP(o)]); /* Take off const! */
9603 k = PL_regkind[OP(o)];
9607 /* Using is_utf8_string() (via PERL_PV_UNI_DETECT)
9608 * is a crude hack but it may be the best for now since
9609 * we have no flag "this EXACTish node was UTF-8"
9611 pv_pretty(sv, STRING(o), STR_LEN(o), 60, PL_colors[0], PL_colors[1],
9612 PERL_PV_ESCAPE_UNI_DETECT |
9613 PERL_PV_ESCAPE_NONASCII |
9614 PERL_PV_PRETTY_ELLIPSES |
9615 PERL_PV_PRETTY_LTGT |
9616 PERL_PV_PRETTY_NOCLEAR
9618 } else if (k == TRIE) {
9619 /* print the details of the trie in dumpuntil instead, as
9620 * progi->data isn't available here */
9621 const char op = OP(o);
9622 const U32 n = ARG(o);
9623 const reg_ac_data * const ac = IS_TRIE_AC(op) ?
9624 (reg_ac_data *)progi->data->data[n] :
9626 const reg_trie_data * const trie
9627 = (reg_trie_data*)progi->data->data[!IS_TRIE_AC(op) ? n : ac->trie];
9629 Perl_sv_catpvf(aTHX_ sv, "-%s",PL_reg_name[o->flags]);
9630 DEBUG_TRIE_COMPILE_r(
9631 Perl_sv_catpvf(aTHX_ sv,
9632 "<S:%"UVuf"/%"IVdf" W:%"UVuf" L:%"UVuf"/%"UVuf" C:%"UVuf"/%"UVuf">",
9633 (UV)trie->startstate,
9634 (IV)trie->statecount-1, /* -1 because of the unused 0 element */
9635 (UV)trie->wordcount,
9638 (UV)TRIE_CHARCOUNT(trie),
9639 (UV)trie->uniquecharcount
9642 if ( IS_ANYOF_TRIE(op) || trie->bitmap ) {
9644 int rangestart = -1;
9645 U8* bitmap = IS_ANYOF_TRIE(op) ? (U8*)ANYOF_BITMAP(o) : (U8*)TRIE_BITMAP(trie);
9647 for (i = 0; i <= 256; i++) {
9648 if (i < 256 && BITMAP_TEST(bitmap,i)) {
9649 if (rangestart == -1)
9651 } else if (rangestart != -1) {
9652 if (i <= rangestart + 3)
9653 for (; rangestart < i; rangestart++)
9654 put_byte(sv, rangestart);
9656 put_byte(sv, rangestart);
9658 put_byte(sv, i - 1);
9666 } else if (k == CURLY) {
9667 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
9668 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
9669 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
9671 else if (k == WHILEM && o->flags) /* Ordinal/of */
9672 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
9673 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP || OP(o)==ACCEPT) {
9674 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
9675 if ( RXp_PAREN_NAMES(prog) ) {
9676 if ( k != REF || (OP(o) < NREF)) {
9677 AV *list= MUTABLE_AV(progi->data->data[progi->name_list_idx]);
9678 SV **name= av_fetch(list, ARG(o), 0 );
9680 Perl_sv_catpvf(aTHX_ sv, " '%"SVf"'", SVfARG(*name));
9683 AV *list= MUTABLE_AV(progi->data->data[ progi->name_list_idx ]);
9684 SV *sv_dat= MUTABLE_SV(progi->data->data[ ARG( o ) ]);
9685 I32 *nums=(I32*)SvPVX(sv_dat);
9686 SV **name= av_fetch(list, nums[0], 0 );
9689 for ( n=0; n<SvIVX(sv_dat); n++ ) {
9690 Perl_sv_catpvf(aTHX_ sv, "%s%"IVdf,
9691 (n ? "," : ""), (IV)nums[n]);
9693 Perl_sv_catpvf(aTHX_ sv, " '%"SVf"'", SVfARG(*name));
9697 } else if (k == GOSUB)
9698 Perl_sv_catpvf(aTHX_ sv, "%d[%+d]", (int)ARG(o),(int)ARG2L(o)); /* Paren and offset */
9699 else if (k == VERB) {
9701 Perl_sv_catpvf(aTHX_ sv, ":%"SVf,
9702 SVfARG((MUTABLE_SV(progi->data->data[ ARG( o ) ]))));
9703 } else if (k == LOGICAL)
9704 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
9705 else if (k == FOLDCHAR)
9706 Perl_sv_catpvf(aTHX_ sv, "[0x%"UVXf"]", PTR2UV(ARG(o)) );
9707 else if (k == ANYOF) {
9708 int i, rangestart = -1;
9709 const U8 flags = ANYOF_FLAGS(o);
9712 /* Should be synchronized with * ANYOF_ #xdefines in regcomp.h */
9713 static const char * const anyofs[] = {
9746 if (flags & ANYOF_LOCALE)
9747 sv_catpvs(sv, "{loc}");
9748 if (flags & ANYOF_LOC_NONBITMAP_FOLD)
9749 sv_catpvs(sv, "{i}");
9750 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
9751 if (flags & ANYOF_INVERT)
9754 /* output what the standard cp 0-255 bitmap matches */
9755 for (i = 0; i <= 256; i++) {
9756 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
9757 if (rangestart == -1)
9759 } else if (rangestart != -1) {
9760 if (i <= rangestart + 3)
9761 for (; rangestart < i; rangestart++)
9762 put_byte(sv, rangestart);
9764 put_byte(sv, rangestart);
9766 put_byte(sv, i - 1);
9773 EMIT_ANYOF_TEST_SEPARATOR(do_sep,sv,flags);
9774 /* output any special charclass tests (used entirely under use locale) */
9775 if (ANYOF_CLASS_TEST_ANY_SET(o))
9776 for (i = 0; i < (int)(sizeof(anyofs)/sizeof(char*)); i++)
9777 if (ANYOF_CLASS_TEST(o,i)) {
9778 sv_catpv(sv, anyofs[i]);
9782 EMIT_ANYOF_TEST_SEPARATOR(do_sep,sv,flags);
9784 /* output information about the unicode matching */
9785 if (flags & ANYOF_UNICODE_ALL)
9786 sv_catpvs(sv, "{unicode_all}");
9787 else if (flags & ANYOF_UTF8)
9788 sv_catpvs(sv, "{unicode}");
9789 if (flags & ANYOF_NONBITMAP_NON_UTF8)
9790 sv_catpvs(sv, "{outside bitmap}");
9794 SV * const sw = regclass_swash(prog, o, FALSE, &lv, 0);
9798 U8 s[UTF8_MAXBYTES_CASE+1];
9800 for (i = 0; i <= 256; i++) { /* just the first 256 */
9801 uvchr_to_utf8(s, i);
9803 if (i < 256 && swash_fetch(sw, s, TRUE)) {
9804 if (rangestart == -1)
9806 } else if (rangestart != -1) {
9807 if (i <= rangestart + 3)
9808 for (; rangestart < i; rangestart++) {
9809 const U8 * const e = uvchr_to_utf8(s,rangestart);
9811 for(p = s; p < e; p++)
9815 const U8 *e = uvchr_to_utf8(s,rangestart);
9817 for (p = s; p < e; p++)
9820 e = uvchr_to_utf8(s, i-1);
9821 for (p = s; p < e; p++)
9828 sv_catpvs(sv, "..."); /* et cetera */
9832 char *s = savesvpv(lv);
9833 char * const origs = s;
9835 while (*s && *s != '\n')
9839 const char * const t = ++s;
9857 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
9859 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
9860 Perl_sv_catpvf(aTHX_ sv, "[%d]", -(o->flags));
9862 PERL_UNUSED_CONTEXT;
9863 PERL_UNUSED_ARG(sv);
9865 PERL_UNUSED_ARG(prog);
9866 #endif /* DEBUGGING */
9870 Perl_re_intuit_string(pTHX_ REGEXP * const r)
9871 { /* Assume that RE_INTUIT is set */
9873 struct regexp *const prog = (struct regexp *)SvANY(r);
9874 GET_RE_DEBUG_FLAGS_DECL;
9876 PERL_ARGS_ASSERT_RE_INTUIT_STRING;
9877 PERL_UNUSED_CONTEXT;
9881 const char * const s = SvPV_nolen_const(prog->check_substr
9882 ? prog->check_substr : prog->check_utf8);
9884 if (!PL_colorset) reginitcolors();
9885 PerlIO_printf(Perl_debug_log,
9886 "%sUsing REx %ssubstr:%s \"%s%.60s%s%s\"\n",
9888 prog->check_substr ? "" : "utf8 ",
9889 PL_colors[5],PL_colors[0],
9892 (strlen(s) > 60 ? "..." : ""));
9895 return prog->check_substr ? prog->check_substr : prog->check_utf8;
9901 handles refcounting and freeing the perl core regexp structure. When
9902 it is necessary to actually free the structure the first thing it
9903 does is call the 'free' method of the regexp_engine associated to
9904 the regexp, allowing the handling of the void *pprivate; member
9905 first. (This routine is not overridable by extensions, which is why
9906 the extensions free is called first.)
9908 See regdupe and regdupe_internal if you change anything here.
9910 #ifndef PERL_IN_XSUB_RE
9912 Perl_pregfree(pTHX_ REGEXP *r)
9918 Perl_pregfree2(pTHX_ REGEXP *rx)
9921 struct regexp *const r = (struct regexp *)SvANY(rx);
9922 GET_RE_DEBUG_FLAGS_DECL;
9924 PERL_ARGS_ASSERT_PREGFREE2;
9927 ReREFCNT_dec(r->mother_re);
9929 CALLREGFREE_PVT(rx); /* free the private data */
9930 SvREFCNT_dec(RXp_PAREN_NAMES(r));
9933 SvREFCNT_dec(r->anchored_substr);
9934 SvREFCNT_dec(r->anchored_utf8);
9935 SvREFCNT_dec(r->float_substr);
9936 SvREFCNT_dec(r->float_utf8);
9937 Safefree(r->substrs);
9939 RX_MATCH_COPY_FREE(rx);
9940 #ifdef PERL_OLD_COPY_ON_WRITE
9941 SvREFCNT_dec(r->saved_copy);
9948 This is a hacky workaround to the structural issue of match results
9949 being stored in the regexp structure which is in turn stored in
9950 PL_curpm/PL_reg_curpm. The problem is that due to qr// the pattern
9951 could be PL_curpm in multiple contexts, and could require multiple
9952 result sets being associated with the pattern simultaneously, such
9953 as when doing a recursive match with (??{$qr})
9955 The solution is to make a lightweight copy of the regexp structure
9956 when a qr// is returned from the code executed by (??{$qr}) this
9957 lightweight copy doesnt actually own any of its data except for
9958 the starp/end and the actual regexp structure itself.
9964 Perl_reg_temp_copy (pTHX_ REGEXP *ret_x, REGEXP *rx)
9967 struct regexp *const r = (struct regexp *)SvANY(rx);
9968 register const I32 npar = r->nparens+1;
9970 PERL_ARGS_ASSERT_REG_TEMP_COPY;
9973 ret_x = (REGEXP*) newSV_type(SVt_REGEXP);
9974 ret = (struct regexp *)SvANY(ret_x);
9976 (void)ReREFCNT_inc(rx);
9977 /* We can take advantage of the existing "copied buffer" mechanism in SVs
9978 by pointing directly at the buffer, but flagging that the allocated
9979 space in the copy is zero. As we've just done a struct copy, it's now
9980 a case of zero-ing that, rather than copying the current length. */
9981 SvPV_set(ret_x, RX_WRAPPED(rx));
9982 SvFLAGS(ret_x) |= SvFLAGS(rx) & (SVf_POK|SVp_POK|SVf_UTF8);
9983 memcpy(&(ret->xpv_cur), &(r->xpv_cur),
9984 sizeof(regexp) - STRUCT_OFFSET(regexp, xpv_cur));
9985 SvLEN_set(ret_x, 0);
9986 SvSTASH_set(ret_x, NULL);
9987 SvMAGIC_set(ret_x, NULL);
9988 Newx(ret->offs, npar, regexp_paren_pair);
9989 Copy(r->offs, ret->offs, npar, regexp_paren_pair);
9991 Newx(ret->substrs, 1, struct reg_substr_data);
9992 StructCopy(r->substrs, ret->substrs, struct reg_substr_data);
9994 SvREFCNT_inc_void(ret->anchored_substr);
9995 SvREFCNT_inc_void(ret->anchored_utf8);
9996 SvREFCNT_inc_void(ret->float_substr);
9997 SvREFCNT_inc_void(ret->float_utf8);
9999 /* check_substr and check_utf8, if non-NULL, point to either their
10000 anchored or float namesakes, and don't hold a second reference. */
10002 RX_MATCH_COPIED_off(ret_x);
10003 #ifdef PERL_OLD_COPY_ON_WRITE
10004 ret->saved_copy = NULL;
10006 ret->mother_re = rx;
10012 /* regfree_internal()
10014 Free the private data in a regexp. This is overloadable by
10015 extensions. Perl takes care of the regexp structure in pregfree(),
10016 this covers the *pprivate pointer which technically perl doesn't
10017 know about, however of course we have to handle the
10018 regexp_internal structure when no extension is in use.
10020 Note this is called before freeing anything in the regexp
10025 Perl_regfree_internal(pTHX_ REGEXP * const rx)
10028 struct regexp *const r = (struct regexp *)SvANY(rx);
10029 RXi_GET_DECL(r,ri);
10030 GET_RE_DEBUG_FLAGS_DECL;
10032 PERL_ARGS_ASSERT_REGFREE_INTERNAL;
10038 SV *dsv= sv_newmortal();
10039 RE_PV_QUOTED_DECL(s, RX_UTF8(rx),
10040 dsv, RX_PRECOMP(rx), RX_PRELEN(rx), 60);
10041 PerlIO_printf(Perl_debug_log,"%sFreeing REx:%s %s\n",
10042 PL_colors[4],PL_colors[5],s);
10045 #ifdef RE_TRACK_PATTERN_OFFSETS
10047 Safefree(ri->u.offsets); /* 20010421 MJD */
10050 int n = ri->data->count;
10051 PAD* new_comppad = NULL;
10056 /* If you add a ->what type here, update the comment in regcomp.h */
10057 switch (ri->data->what[n]) {
10062 SvREFCNT_dec(MUTABLE_SV(ri->data->data[n]));
10065 Safefree(ri->data->data[n]);
10068 new_comppad = MUTABLE_AV(ri->data->data[n]);
10071 if (new_comppad == NULL)
10072 Perl_croak(aTHX_ "panic: pregfree comppad");
10073 PAD_SAVE_LOCAL(old_comppad,
10074 /* Watch out for global destruction's random ordering. */
10075 (SvTYPE(new_comppad) == SVt_PVAV) ? new_comppad : NULL
10078 refcnt = OpREFCNT_dec((OP_4tree*)ri->data->data[n]);
10081 op_free((OP_4tree*)ri->data->data[n]);
10083 PAD_RESTORE_LOCAL(old_comppad);
10084 SvREFCNT_dec(MUTABLE_SV(new_comppad));
10085 new_comppad = NULL;
10090 { /* Aho Corasick add-on structure for a trie node.
10091 Used in stclass optimization only */
10093 reg_ac_data *aho=(reg_ac_data*)ri->data->data[n];
10095 refcount = --aho->refcount;
10098 PerlMemShared_free(aho->states);
10099 PerlMemShared_free(aho->fail);
10100 /* do this last!!!! */
10101 PerlMemShared_free(ri->data->data[n]);
10102 PerlMemShared_free(ri->regstclass);
10108 /* trie structure. */
10110 reg_trie_data *trie=(reg_trie_data*)ri->data->data[n];
10112 refcount = --trie->refcount;
10115 PerlMemShared_free(trie->charmap);
10116 PerlMemShared_free(trie->states);
10117 PerlMemShared_free(trie->trans);
10119 PerlMemShared_free(trie->bitmap);
10121 PerlMemShared_free(trie->jump);
10122 PerlMemShared_free(trie->wordinfo);
10123 /* do this last!!!! */
10124 PerlMemShared_free(ri->data->data[n]);
10129 Perl_croak(aTHX_ "panic: regfree data code '%c'", ri->data->what[n]);
10132 Safefree(ri->data->what);
10133 Safefree(ri->data);
10139 #define av_dup_inc(s,t) MUTABLE_AV(sv_dup_inc((const SV *)s,t))
10140 #define hv_dup_inc(s,t) MUTABLE_HV(sv_dup_inc((const SV *)s,t))
10141 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
10144 re_dup - duplicate a regexp.
10146 This routine is expected to clone a given regexp structure. It is only
10147 compiled under USE_ITHREADS.
10149 After all of the core data stored in struct regexp is duplicated
10150 the regexp_engine.dupe method is used to copy any private data
10151 stored in the *pprivate pointer. This allows extensions to handle
10152 any duplication it needs to do.
10154 See pregfree() and regfree_internal() if you change anything here.
10156 #if defined(USE_ITHREADS)
10157 #ifndef PERL_IN_XSUB_RE
10159 Perl_re_dup_guts(pTHX_ const REGEXP *sstr, REGEXP *dstr, CLONE_PARAMS *param)
10163 const struct regexp *r = (const struct regexp *)SvANY(sstr);
10164 struct regexp *ret = (struct regexp *)SvANY(dstr);
10166 PERL_ARGS_ASSERT_RE_DUP_GUTS;
10168 npar = r->nparens+1;
10169 Newx(ret->offs, npar, regexp_paren_pair);
10170 Copy(r->offs, ret->offs, npar, regexp_paren_pair);
10172 /* no need to copy these */
10173 Newx(ret->swap, npar, regexp_paren_pair);
10176 if (ret->substrs) {
10177 /* Do it this way to avoid reading from *r after the StructCopy().
10178 That way, if any of the sv_dup_inc()s dislodge *r from the L1
10179 cache, it doesn't matter. */
10180 const bool anchored = r->check_substr
10181 ? r->check_substr == r->anchored_substr
10182 : r->check_utf8 == r->anchored_utf8;
10183 Newx(ret->substrs, 1, struct reg_substr_data);
10184 StructCopy(r->substrs, ret->substrs, struct reg_substr_data);
10186 ret->anchored_substr = sv_dup_inc(ret->anchored_substr, param);
10187 ret->anchored_utf8 = sv_dup_inc(ret->anchored_utf8, param);
10188 ret->float_substr = sv_dup_inc(ret->float_substr, param);
10189 ret->float_utf8 = sv_dup_inc(ret->float_utf8, param);
10191 /* check_substr and check_utf8, if non-NULL, point to either their
10192 anchored or float namesakes, and don't hold a second reference. */
10194 if (ret->check_substr) {
10196 assert(r->check_utf8 == r->anchored_utf8);
10197 ret->check_substr = ret->anchored_substr;
10198 ret->check_utf8 = ret->anchored_utf8;
10200 assert(r->check_substr == r->float_substr);
10201 assert(r->check_utf8 == r->float_utf8);
10202 ret->check_substr = ret->float_substr;
10203 ret->check_utf8 = ret->float_utf8;
10205 } else if (ret->check_utf8) {
10207 ret->check_utf8 = ret->anchored_utf8;
10209 ret->check_utf8 = ret->float_utf8;
10214 RXp_PAREN_NAMES(ret) = hv_dup_inc(RXp_PAREN_NAMES(ret), param);
10217 RXi_SET(ret,CALLREGDUPE_PVT(dstr,param));
10219 if (RX_MATCH_COPIED(dstr))
10220 ret->subbeg = SAVEPVN(ret->subbeg, ret->sublen);
10222 ret->subbeg = NULL;
10223 #ifdef PERL_OLD_COPY_ON_WRITE
10224 ret->saved_copy = NULL;
10227 if (ret->mother_re) {
10228 if (SvPVX_const(dstr) == SvPVX_const(ret->mother_re)) {
10229 /* Our storage points directly to our mother regexp, but that's
10230 1: a buffer in a different thread
10231 2: something we no longer hold a reference on
10232 so we need to copy it locally. */
10233 /* Note we need to sue SvCUR() on our mother_re, because it, in
10234 turn, may well be pointing to its own mother_re. */
10235 SvPV_set(dstr, SAVEPVN(SvPVX_const(ret->mother_re),
10236 SvCUR(ret->mother_re)+1));
10237 SvLEN_set(dstr, SvCUR(ret->mother_re)+1);
10239 ret->mother_re = NULL;
10243 #endif /* PERL_IN_XSUB_RE */
10248 This is the internal complement to regdupe() which is used to copy
10249 the structure pointed to by the *pprivate pointer in the regexp.
10250 This is the core version of the extension overridable cloning hook.
10251 The regexp structure being duplicated will be copied by perl prior
10252 to this and will be provided as the regexp *r argument, however
10253 with the /old/ structures pprivate pointer value. Thus this routine
10254 may override any copying normally done by perl.
10256 It returns a pointer to the new regexp_internal structure.
10260 Perl_regdupe_internal(pTHX_ REGEXP * const rx, CLONE_PARAMS *param)
10263 struct regexp *const r = (struct regexp *)SvANY(rx);
10264 regexp_internal *reti;
10266 RXi_GET_DECL(r,ri);
10268 PERL_ARGS_ASSERT_REGDUPE_INTERNAL;
10270 npar = r->nparens+1;
10273 Newxc(reti, sizeof(regexp_internal) + len*sizeof(regnode), char, regexp_internal);
10274 Copy(ri->program, reti->program, len+1, regnode);
10277 reti->regstclass = NULL;
10280 struct reg_data *d;
10281 const int count = ri->data->count;
10284 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
10285 char, struct reg_data);
10286 Newx(d->what, count, U8);
10289 for (i = 0; i < count; i++) {
10290 d->what[i] = ri->data->what[i];
10291 switch (d->what[i]) {
10292 /* legal options are one of: sSfpontTua
10293 see also regcomp.h and pregfree() */
10294 case 'a': /* actually an AV, but the dup function is identical. */
10297 case 'p': /* actually an AV, but the dup function is identical. */
10298 case 'u': /* actually an HV, but the dup function is identical. */
10299 d->data[i] = sv_dup_inc((const SV *)ri->data->data[i], param);
10302 /* This is cheating. */
10303 Newx(d->data[i], 1, struct regnode_charclass_class);
10304 StructCopy(ri->data->data[i], d->data[i],
10305 struct regnode_charclass_class);
10306 reti->regstclass = (regnode*)d->data[i];
10309 /* Compiled op trees are readonly and in shared memory,
10310 and can thus be shared without duplication. */
10312 d->data[i] = (void*)OpREFCNT_inc((OP*)ri->data->data[i]);
10316 /* Trie stclasses are readonly and can thus be shared
10317 * without duplication. We free the stclass in pregfree
10318 * when the corresponding reg_ac_data struct is freed.
10320 reti->regstclass= ri->regstclass;
10324 ((reg_trie_data*)ri->data->data[i])->refcount++;
10328 d->data[i] = ri->data->data[i];
10331 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", ri->data->what[i]);
10340 reti->name_list_idx = ri->name_list_idx;
10342 #ifdef RE_TRACK_PATTERN_OFFSETS
10343 if (ri->u.offsets) {
10344 Newx(reti->u.offsets, 2*len+1, U32);
10345 Copy(ri->u.offsets, reti->u.offsets, 2*len+1, U32);
10348 SetProgLen(reti,len);
10351 return (void*)reti;
10354 #endif /* USE_ITHREADS */
10356 #ifndef PERL_IN_XSUB_RE
10359 - regnext - dig the "next" pointer out of a node
10362 Perl_regnext(pTHX_ register regnode *p)
10365 register I32 offset;
10370 if (OP(p) > REGNODE_MAX) { /* regnode.type is unsigned */
10371 Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(p), (int)REGNODE_MAX);
10374 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
10383 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
10386 STRLEN l1 = strlen(pat1);
10387 STRLEN l2 = strlen(pat2);
10390 const char *message;
10392 PERL_ARGS_ASSERT_RE_CROAK2;
10398 Copy(pat1, buf, l1 , char);
10399 Copy(pat2, buf + l1, l2 , char);
10400 buf[l1 + l2] = '\n';
10401 buf[l1 + l2 + 1] = '\0';
10403 /* ANSI variant takes additional second argument */
10404 va_start(args, pat2);
10408 msv = vmess(buf, &args);
10410 message = SvPV_const(msv,l1);
10413 Copy(message, buf, l1 , char);
10414 buf[l1-1] = '\0'; /* Overwrite \n */
10415 Perl_croak(aTHX_ "%s", buf);
10418 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
10420 #ifndef PERL_IN_XSUB_RE
10422 Perl_save_re_context(pTHX)
10426 struct re_save_state *state;
10428 SAVEVPTR(PL_curcop);
10429 SSGROW(SAVESTACK_ALLOC_FOR_RE_SAVE_STATE + 1);
10431 state = (struct re_save_state *)(PL_savestack + PL_savestack_ix);
10432 PL_savestack_ix += SAVESTACK_ALLOC_FOR_RE_SAVE_STATE;
10433 SSPUSHUV(SAVEt_RE_STATE);
10435 Copy(&PL_reg_state, state, 1, struct re_save_state);
10437 PL_reg_start_tmp = 0;
10438 PL_reg_start_tmpl = 0;
10439 PL_reg_oldsaved = NULL;
10440 PL_reg_oldsavedlen = 0;
10441 PL_reg_maxiter = 0;
10442 PL_reg_leftiter = 0;
10443 PL_reg_poscache = NULL;
10444 PL_reg_poscache_size = 0;
10445 #ifdef PERL_OLD_COPY_ON_WRITE
10449 /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */
10451 const REGEXP * const rx = PM_GETRE(PL_curpm);
10454 for (i = 1; i <= RX_NPARENS(rx); i++) {
10455 char digits[TYPE_CHARS(long)];
10456 const STRLEN len = my_snprintf(digits, sizeof(digits), "%lu", (long)i);
10457 GV *const *const gvp
10458 = (GV**)hv_fetch(PL_defstash, digits, len, 0);
10461 GV * const gv = *gvp;
10462 if (SvTYPE(gv) == SVt_PVGV && GvSV(gv))
10472 clear_re(pTHX_ void *r)
10475 ReREFCNT_dec((REGEXP *)r);
10481 S_put_byte(pTHX_ SV *sv, int c)
10483 PERL_ARGS_ASSERT_PUT_BYTE;
10485 /* Our definition of isPRINT() ignores locales, so only bytes that are
10486 not part of UTF-8 are considered printable. I assume that the same
10487 holds for UTF-EBCDIC.
10488 Also, code point 255 is not printable in either (it's E0 in EBCDIC,
10489 which Wikipedia says:
10491 EO, or Eight Ones, is an 8-bit EBCDIC character code represented as all
10492 ones (binary 1111 1111, hexadecimal FF). It is similar, but not
10493 identical, to the ASCII delete (DEL) or rubout control character.
10494 ) So the old condition can be simplified to !isPRINT(c) */
10497 Perl_sv_catpvf(aTHX_ sv, "\\x%02x", c);
10500 Perl_sv_catpvf(aTHX_ sv, "\\x{%x}", c);
10504 const char string = c;
10505 if (c == '-' || c == ']' || c == '\\' || c == '^')
10506 sv_catpvs(sv, "\\");
10507 sv_catpvn(sv, &string, 1);
10512 #define CLEAR_OPTSTART \
10513 if (optstart) STMT_START { \
10514 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log, " (%"IVdf" nodes)\n", (IV)(node - optstart))); \
10518 #define DUMPUNTIL(b,e) CLEAR_OPTSTART; node=dumpuntil(r,start,(b),(e),last,sv,indent+1,depth+1);
10520 STATIC const regnode *
10521 S_dumpuntil(pTHX_ const regexp *r, const regnode *start, const regnode *node,
10522 const regnode *last, const regnode *plast,
10523 SV* sv, I32 indent, U32 depth)
10526 register U8 op = PSEUDO; /* Arbitrary non-END op. */
10527 register const regnode *next;
10528 const regnode *optstart= NULL;
10530 RXi_GET_DECL(r,ri);
10531 GET_RE_DEBUG_FLAGS_DECL;
10533 PERL_ARGS_ASSERT_DUMPUNTIL;
10535 #ifdef DEBUG_DUMPUNTIL
10536 PerlIO_printf(Perl_debug_log, "--- %d : %d - %d - %d\n",indent,node-start,
10537 last ? last-start : 0,plast ? plast-start : 0);
10540 if (plast && plast < last)
10543 while (PL_regkind[op] != END && (!last || node < last)) {
10544 /* While that wasn't END last time... */
10547 if (op == CLOSE || op == WHILEM)
10549 next = regnext((regnode *)node);
10552 if (OP(node) == OPTIMIZED) {
10553 if (!optstart && RE_DEBUG_FLAG(RE_DEBUG_COMPILE_OPTIMISE))
10560 regprop(r, sv, node);
10561 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
10562 (int)(2*indent + 1), "", SvPVX_const(sv));
10564 if (OP(node) != OPTIMIZED) {
10565 if (next == NULL) /* Next ptr. */
10566 PerlIO_printf(Perl_debug_log, " (0)");
10567 else if (PL_regkind[(U8)op] == BRANCH && PL_regkind[OP(next)] != BRANCH )
10568 PerlIO_printf(Perl_debug_log, " (FAIL)");
10570 PerlIO_printf(Perl_debug_log, " (%"IVdf")", (IV)(next - start));
10571 (void)PerlIO_putc(Perl_debug_log, '\n');
10575 if (PL_regkind[(U8)op] == BRANCHJ) {
10578 register const regnode *nnode = (OP(next) == LONGJMP
10579 ? regnext((regnode *)next)
10581 if (last && nnode > last)
10583 DUMPUNTIL(NEXTOPER(NEXTOPER(node)), nnode);
10586 else if (PL_regkind[(U8)op] == BRANCH) {
10588 DUMPUNTIL(NEXTOPER(node), next);
10590 else if ( PL_regkind[(U8)op] == TRIE ) {
10591 const regnode *this_trie = node;
10592 const char op = OP(node);
10593 const U32 n = ARG(node);
10594 const reg_ac_data * const ac = op>=AHOCORASICK ?
10595 (reg_ac_data *)ri->data->data[n] :
10597 const reg_trie_data * const trie =
10598 (reg_trie_data*)ri->data->data[op<AHOCORASICK ? n : ac->trie];
10600 AV *const trie_words = MUTABLE_AV(ri->data->data[n + TRIE_WORDS_OFFSET]);
10602 const regnode *nextbranch= NULL;
10605 for (word_idx= 0; word_idx < (I32)trie->wordcount; word_idx++) {
10606 SV ** const elem_ptr = av_fetch(trie_words,word_idx,0);
10608 PerlIO_printf(Perl_debug_log, "%*s%s ",
10609 (int)(2*(indent+3)), "",
10610 elem_ptr ? pv_pretty(sv, SvPV_nolen_const(*elem_ptr), SvCUR(*elem_ptr), 60,
10611 PL_colors[0], PL_colors[1],
10612 (SvUTF8(*elem_ptr) ? PERL_PV_ESCAPE_UNI : 0) |
10613 PERL_PV_PRETTY_ELLIPSES |
10614 PERL_PV_PRETTY_LTGT
10619 U16 dist= trie->jump[word_idx+1];
10620 PerlIO_printf(Perl_debug_log, "(%"UVuf")\n",
10621 (UV)((dist ? this_trie + dist : next) - start));
10624 nextbranch= this_trie + trie->jump[0];
10625 DUMPUNTIL(this_trie + dist, nextbranch);
10627 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
10628 nextbranch= regnext((regnode *)nextbranch);
10630 PerlIO_printf(Perl_debug_log, "\n");
10633 if (last && next > last)
10638 else if ( op == CURLY ) { /* "next" might be very big: optimizer */
10639 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS,
10640 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1);
10642 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
10644 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, next);
10646 else if ( op == PLUS || op == STAR) {
10647 DUMPUNTIL(NEXTOPER(node), NEXTOPER(node) + 1);
10649 else if (op == ANYOF) {
10650 /* arglen 1 + class block */
10651 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_CLASS)
10652 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
10653 node = NEXTOPER(node);
10655 else if (PL_regkind[(U8)op] == EXACT) {
10656 /* Literal string, where present. */
10657 node += NODE_SZ_STR(node) - 1;
10658 node = NEXTOPER(node);
10661 node = NEXTOPER(node);
10662 node += regarglen[(U8)op];
10664 if (op == CURLYX || op == OPEN)
10668 #ifdef DEBUG_DUMPUNTIL
10669 PerlIO_printf(Perl_debug_log, "--- %d\n", (int)indent);
10674 #endif /* DEBUGGING */
10678 * c-indentation-style: bsd
10679 * c-basic-offset: 4
10680 * indent-tabs-mode: t
10683 * ex: set ts=8 sts=4 sw=4 noet:
https://perl5.git.perl.org / perl5.git / blob