5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
8 /* This file contains functions for compiling a regular expression. See
9 * also regexec.c which funnily enough, contains functions for executing
10 * a regular expression.
12 * This file is also copied at build time to ext/re/re_comp.c, where
13 * it's built with -DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT.
14 * This causes the main functions to be compiled under new names and with
15 * debugging support added, which makes "use re 'debug'" work.
18 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
19 * confused with the original package (see point 3 below). Thanks, Henry!
22 /* Additional note: this code is very heavily munged from Henry's version
23 * in places. In some spots I've traded clarity for efficiency, so don't
24 * blame Henry for some of the lack of readability.
27 /* The names of the functions have been changed from regcomp and
28 * regexec to pregcomp and pregexec in order to avoid conflicts
29 * with the POSIX routines of the same names.
32 #ifdef PERL_EXT_RE_BUILD
37 * pregcomp and pregexec -- regsub and regerror are not used in perl
39 * Copyright (c) 1986 by University of Toronto.
40 * Written by Henry Spencer. Not derived from licensed software.
42 * Permission is granted to anyone to use this software for any
43 * purpose on any computer system, and to redistribute it freely,
44 * subject to the following restrictions:
46 * 1. The author is not responsible for the consequences of use of
47 * this software, no matter how awful, even if they arise
50 * 2. The origin of this software must not be misrepresented, either
51 * by explicit claim or by omission.
53 * 3. Altered versions must be plainly marked as such, and must not
54 * be misrepresented as being the original software.
57 **** Alterations to Henry's code are...
59 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
60 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
62 **** You may distribute under the terms of either the GNU General Public
63 **** License or the Artistic License, as specified in the README file.
66 * Beware that some of this code is subtly aware of the way operator
67 * precedence is structured in regular expressions. Serious changes in
68 * regular-expression syntax might require a total rethink.
71 #define PERL_IN_REGCOMP_C
74 #ifndef PERL_IN_XSUB_RE
79 #ifdef PERL_IN_XSUB_RE
90 # if defined(BUGGY_MSC6)
91 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
92 # pragma optimize("a",off)
93 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
94 # pragma optimize("w",on )
95 # endif /* BUGGY_MSC6 */
102 typedef struct RExC_state_t {
103 U32 flags; /* are we folding, multilining? */
104 char *precomp; /* uncompiled string. */
105 regexp *rx; /* perl core regexp structure */
106 regexp_internal *rxi; /* internal data for regexp object pprivate field */
107 char *start; /* Start of input for compile */
108 char *end; /* End of input for compile */
109 char *parse; /* Input-scan pointer. */
110 I32 whilem_seen; /* number of WHILEM in this expr */
111 regnode *emit_start; /* Start of emitted-code area */
112 regnode *emit; /* Code-emit pointer; ®dummy = don't = compiling */
113 I32 naughty; /* How bad is this pattern? */
114 I32 sawback; /* Did we see \1, ...? */
116 I32 size; /* Code size. */
117 I32 npar; /* Capture buffer count, (OPEN). */
118 I32 cpar; /* Capture buffer count, (CLOSE). */
119 I32 nestroot; /* root parens we are in - used by accept */
123 regnode **open_parens; /* pointers to open parens */
124 regnode **close_parens; /* pointers to close parens */
125 regnode *opend; /* END node in program */
127 HV *charnames; /* cache of named sequences */
128 HV *paren_names; /* Paren names */
129 regnode **recurse; /* Recurse regops */
130 I32 recurse_count; /* Number of recurse regops */
132 char *starttry; /* -Dr: where regtry was called. */
133 #define RExC_starttry (pRExC_state->starttry)
136 const char *lastparse;
138 #define RExC_lastparse (pRExC_state->lastparse)
139 #define RExC_lastnum (pRExC_state->lastnum)
143 #define RExC_flags (pRExC_state->flags)
144 #define RExC_precomp (pRExC_state->precomp)
145 #define RExC_rx (pRExC_state->rx)
146 #define RExC_rxi (pRExC_state->rxi)
147 #define RExC_start (pRExC_state->start)
148 #define RExC_end (pRExC_state->end)
149 #define RExC_parse (pRExC_state->parse)
150 #define RExC_whilem_seen (pRExC_state->whilem_seen)
151 #define RExC_offsets (pRExC_state->rxi->offsets) /* I am not like the others */
152 #define RExC_emit (pRExC_state->emit)
153 #define RExC_emit_start (pRExC_state->emit_start)
154 #define RExC_naughty (pRExC_state->naughty)
155 #define RExC_sawback (pRExC_state->sawback)
156 #define RExC_seen (pRExC_state->seen)
157 #define RExC_size (pRExC_state->size)
158 #define RExC_npar (pRExC_state->npar)
159 #define RExC_cpar (pRExC_state->cpar)
160 #define RExC_nestroot (pRExC_state->nestroot)
161 #define RExC_extralen (pRExC_state->extralen)
162 #define RExC_seen_zerolen (pRExC_state->seen_zerolen)
163 #define RExC_seen_evals (pRExC_state->seen_evals)
164 #define RExC_utf8 (pRExC_state->utf8)
165 #define RExC_charnames (pRExC_state->charnames)
166 #define RExC_open_parens (pRExC_state->open_parens)
167 #define RExC_close_parens (pRExC_state->close_parens)
168 #define RExC_opend (pRExC_state->opend)
169 #define RExC_paren_names (pRExC_state->paren_names)
170 #define RExC_recurse (pRExC_state->recurse)
171 #define RExC_recurse_count (pRExC_state->recurse_count)
173 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
174 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
175 ((*s) == '{' && regcurly(s)))
178 #undef SPSTART /* dratted cpp namespace... */
181 * Flags to be passed up and down.
183 #define WORST 0 /* Worst case. */
184 #define HASWIDTH 0x1 /* Known to match non-null strings. */
185 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
186 #define SPSTART 0x4 /* Starts with * or +. */
187 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
189 #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
191 /* whether trie related optimizations are enabled */
192 #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
193 #define TRIE_STUDY_OPT
194 #define FULL_TRIE_STUDY
200 #define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3]
201 #define PBITVAL(paren) (1 << ((paren) & 7))
202 #define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren))
203 #define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren)
204 #define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren))
207 /* About scan_data_t.
209 During optimisation we recurse through the regexp program performing
210 various inplace (keyhole style) optimisations. In addition study_chunk
211 and scan_commit populate this data structure with information about
212 what strings MUST appear in the pattern. We look for the longest
213 string that must appear for at a fixed location, and we look for the
214 longest string that may appear at a floating location. So for instance
219 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
220 strings (because they follow a .* construct). study_chunk will identify
221 both FOO and BAR as being the longest fixed and floating strings respectively.
223 The strings can be composites, for instance
227 will result in a composite fixed substring 'foo'.
229 For each string some basic information is maintained:
231 - offset or min_offset
232 This is the position the string must appear at, or not before.
233 It also implicitly (when combined with minlenp) tells us how many
234 character must match before the string we are searching.
235 Likewise when combined with minlenp and the length of the string
236 tells us how many characters must appear after the string we have
240 Only used for floating strings. This is the rightmost point that
241 the string can appear at. Ifset to I32 max it indicates that the
242 string can occur infinitely far to the right.
245 A pointer to the minimum length of the pattern that the string
246 was found inside. This is important as in the case of positive
247 lookahead or positive lookbehind we can have multiple patterns
252 The minimum length of the pattern overall is 3, the minimum length
253 of the lookahead part is 3, but the minimum length of the part that
254 will actually match is 1. So 'FOO's minimum length is 3, but the
255 minimum length for the F is 1. This is important as the minimum length
256 is used to determine offsets in front of and behind the string being
257 looked for. Since strings can be composites this is the length of the
258 pattern at the time it was commited with a scan_commit. Note that
259 the length is calculated by study_chunk, so that the minimum lengths
260 are not known until the full pattern has been compiled, thus the
261 pointer to the value.
265 In the case of lookbehind the string being searched for can be
266 offset past the start point of the final matching string.
267 If this value was just blithely removed from the min_offset it would
268 invalidate some of the calculations for how many chars must match
269 before or after (as they are derived from min_offset and minlen and
270 the length of the string being searched for).
271 When the final pattern is compiled and the data is moved from the
272 scan_data_t structure into the regexp structure the information
273 about lookbehind is factored in, with the information that would
274 have been lost precalculated in the end_shift field for the
277 The fields pos_min and pos_delta are used to store the minimum offset
278 and the delta to the maximum offset at the current point in the pattern.
282 typedef struct scan_data_t {
283 /*I32 len_min; unused */
284 /*I32 len_delta; unused */
288 I32 last_end; /* min value, <0 unless valid. */
291 SV **longest; /* Either &l_fixed, or &l_float. */
292 SV *longest_fixed; /* longest fixed string found in pattern */
293 I32 offset_fixed; /* offset where it starts */
294 I32 *minlen_fixed; /* pointer to the minlen relevent to the string */
295 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
296 SV *longest_float; /* longest floating string found in pattern */
297 I32 offset_float_min; /* earliest point in string it can appear */
298 I32 offset_float_max; /* latest point in string it can appear */
299 I32 *minlen_float; /* pointer to the minlen relevent to the string */
300 I32 lookbehind_float; /* is the position of the string modified by LB */
304 struct regnode_charclass_class *start_class;
308 * Forward declarations for pregcomp()'s friends.
311 static const scan_data_t zero_scan_data =
312 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
314 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
315 #define SF_BEFORE_SEOL 0x0001
316 #define SF_BEFORE_MEOL 0x0002
317 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
318 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
321 # define SF_FIX_SHIFT_EOL (0+2)
322 # define SF_FL_SHIFT_EOL (0+4)
324 # define SF_FIX_SHIFT_EOL (+2)
325 # define SF_FL_SHIFT_EOL (+4)
328 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
329 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
331 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
332 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
333 #define SF_IS_INF 0x0040
334 #define SF_HAS_PAR 0x0080
335 #define SF_IN_PAR 0x0100
336 #define SF_HAS_EVAL 0x0200
337 #define SCF_DO_SUBSTR 0x0400
338 #define SCF_DO_STCLASS_AND 0x0800
339 #define SCF_DO_STCLASS_OR 0x1000
340 #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
341 #define SCF_WHILEM_VISITED_POS 0x2000
343 #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
344 #define SCF_SEEN_ACCEPT 0x8000
346 #define UTF (RExC_utf8 != 0)
347 #define LOC ((RExC_flags & RXf_PMf_LOCALE) != 0)
348 #define FOLD ((RExC_flags & RXf_PMf_FOLD) != 0)
350 #define OOB_UNICODE 12345678
351 #define OOB_NAMEDCLASS -1
353 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
354 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
357 /* length of regex to show in messages that don't mark a position within */
358 #define RegexLengthToShowInErrorMessages 127
361 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
362 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
363 * op/pragma/warn/regcomp.
365 #define MARKER1 "<-- HERE" /* marker as it appears in the description */
366 #define MARKER2 " <-- HERE " /* marker as it appears within the regex */
368 #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
371 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
372 * arg. Show regex, up to a maximum length. If it's too long, chop and add
375 #define _FAIL(code) STMT_START { \
376 const char *ellipses = ""; \
377 IV len = RExC_end - RExC_precomp; \
380 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
381 if (len > RegexLengthToShowInErrorMessages) { \
382 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
383 len = RegexLengthToShowInErrorMessages - 10; \
389 #define FAIL(msg) _FAIL( \
390 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
391 msg, (int)len, RExC_precomp, ellipses))
393 #define FAIL2(msg,arg) _FAIL( \
394 Perl_croak(aTHX_ msg " in regex m/%.*s%s/", \
395 arg, (int)len, RExC_precomp, ellipses))
398 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
400 #define Simple_vFAIL(m) STMT_START { \
401 const IV offset = RExC_parse - RExC_precomp; \
402 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
403 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
407 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
409 #define vFAIL(m) STMT_START { \
411 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
416 * Like Simple_vFAIL(), but accepts two arguments.
418 #define Simple_vFAIL2(m,a1) STMT_START { \
419 const IV offset = RExC_parse - RExC_precomp; \
420 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
421 (int)offset, RExC_precomp, RExC_precomp + offset); \
425 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
427 #define vFAIL2(m,a1) STMT_START { \
429 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
430 Simple_vFAIL2(m, a1); \
435 * Like Simple_vFAIL(), but accepts three arguments.
437 #define Simple_vFAIL3(m, a1, a2) STMT_START { \
438 const IV offset = RExC_parse - RExC_precomp; \
439 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
440 (int)offset, RExC_precomp, RExC_precomp + offset); \
444 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
446 #define vFAIL3(m,a1,a2) STMT_START { \
448 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
449 Simple_vFAIL3(m, a1, a2); \
453 * Like Simple_vFAIL(), but accepts four arguments.
455 #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
456 const IV offset = RExC_parse - RExC_precomp; \
457 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
458 (int)offset, RExC_precomp, RExC_precomp + offset); \
461 #define vWARN(loc,m) STMT_START { \
462 const IV offset = loc - RExC_precomp; \
463 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
464 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
467 #define vWARNdep(loc,m) STMT_START { \
468 const IV offset = loc - RExC_precomp; \
469 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
470 "%s" REPORT_LOCATION, \
471 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
475 #define vWARN2(loc, m, a1) STMT_START { \
476 const IV offset = loc - RExC_precomp; \
477 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
478 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
481 #define vWARN3(loc, m, a1, a2) STMT_START { \
482 const IV offset = loc - RExC_precomp; \
483 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
484 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
487 #define vWARN4(loc, m, a1, a2, a3) STMT_START { \
488 const IV offset = loc - RExC_precomp; \
489 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
490 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
493 #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
494 const IV offset = loc - RExC_precomp; \
495 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
496 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
500 /* Allow for side effects in s */
501 #define REGC(c,s) STMT_START { \
502 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
505 /* Macros for recording node offsets. 20001227 mjd@plover.com
506 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
507 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
508 * Element 0 holds the number n.
509 * Position is 1 indexed.
512 #define Set_Node_Offset_To_R(node,byte) STMT_START { \
514 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
515 __LINE__, (int)(node), (int)(byte))); \
517 Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \
519 RExC_offsets[2*(node)-1] = (byte); \
524 #define Set_Node_Offset(node,byte) \
525 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
526 #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
528 #define Set_Node_Length_To_R(node,len) STMT_START { \
530 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
531 __LINE__, (int)(node), (int)(len))); \
533 Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \
535 RExC_offsets[2*(node)] = (len); \
540 #define Set_Node_Length(node,len) \
541 Set_Node_Length_To_R((node)-RExC_emit_start, len)
542 #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
543 #define Set_Node_Cur_Length(node) \
544 Set_Node_Length(node, RExC_parse - parse_start)
546 /* Get offsets and lengths */
547 #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
548 #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
550 #define Set_Node_Offset_Length(node,offset,len) STMT_START { \
551 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
552 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
556 #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
557 #define EXPERIMENTAL_INPLACESCAN
560 #define DEBUG_STUDYDATA(data,depth) \
561 DEBUG_OPTIMISE_MORE_r(if(data){ \
562 PerlIO_printf(Perl_debug_log, \
563 "%*s"/* Len:%"IVdf"/%"IVdf" */"Pos:%"IVdf"/%"IVdf \
564 " Flags: %"IVdf" Whilem_c: %"IVdf" Lcp: %"IVdf" ", \
565 (int)(depth)*2, "", \
566 (IV)((data)->pos_min), \
567 (IV)((data)->pos_delta), \
568 (IV)((data)->flags), \
569 (IV)((data)->whilem_c), \
570 (IV)((data)->last_closep ? *((data)->last_closep) : -1) \
572 if ((data)->last_found) \
573 PerlIO_printf(Perl_debug_log, \
574 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
575 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
576 SvPVX_const((data)->last_found), \
577 (IV)((data)->last_end), \
578 (IV)((data)->last_start_min), \
579 (IV)((data)->last_start_max), \
580 ((data)->longest && \
581 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
582 SvPVX_const((data)->longest_fixed), \
583 (IV)((data)->offset_fixed), \
584 ((data)->longest && \
585 (data)->longest==&((data)->longest_float)) ? "*" : "", \
586 SvPVX_const((data)->longest_float), \
587 (IV)((data)->offset_float_min), \
588 (IV)((data)->offset_float_max) \
590 PerlIO_printf(Perl_debug_log,"\n"); \
593 static void clear_re(pTHX_ void *r);
595 /* Mark that we cannot extend a found fixed substring at this point.
596 Update the longest found anchored substring and the longest found
597 floating substrings if needed. */
600 S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp)
602 const STRLEN l = CHR_SVLEN(data->last_found);
603 const STRLEN old_l = CHR_SVLEN(*data->longest);
604 GET_RE_DEBUG_FLAGS_DECL;
606 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
607 SvSetMagicSV(*data->longest, data->last_found);
608 if (*data->longest == data->longest_fixed) {
609 data->offset_fixed = l ? data->last_start_min : data->pos_min;
610 if (data->flags & SF_BEFORE_EOL)
612 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
614 data->flags &= ~SF_FIX_BEFORE_EOL;
615 data->minlen_fixed=minlenp;
616 data->lookbehind_fixed=0;
619 data->offset_float_min = l ? data->last_start_min : data->pos_min;
620 data->offset_float_max = (l
621 ? data->last_start_max
622 : data->pos_min + data->pos_delta);
623 if ((U32)data->offset_float_max > (U32)I32_MAX)
624 data->offset_float_max = I32_MAX;
625 if (data->flags & SF_BEFORE_EOL)
627 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
629 data->flags &= ~SF_FL_BEFORE_EOL;
630 data->minlen_float=minlenp;
631 data->lookbehind_float=0;
634 SvCUR_set(data->last_found, 0);
636 SV * const sv = data->last_found;
637 if (SvUTF8(sv) && SvMAGICAL(sv)) {
638 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
644 data->flags &= ~SF_BEFORE_EOL;
645 DEBUG_STUDYDATA(data,0);
648 /* Can match anything (initialization) */
650 S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
652 ANYOF_CLASS_ZERO(cl);
653 ANYOF_BITMAP_SETALL(cl);
654 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
656 cl->flags |= ANYOF_LOCALE;
659 /* Can match anything (initialization) */
661 S_cl_is_anything(const struct regnode_charclass_class *cl)
665 for (value = 0; value <= ANYOF_MAX; value += 2)
666 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
668 if (!(cl->flags & ANYOF_UNICODE_ALL))
670 if (!ANYOF_BITMAP_TESTALLSET((const void*)cl))
675 /* Can match anything (initialization) */
677 S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
679 Zero(cl, 1, struct regnode_charclass_class);
681 cl_anything(pRExC_state, cl);
685 S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
687 Zero(cl, 1, struct regnode_charclass_class);
689 cl_anything(pRExC_state, cl);
691 cl->flags |= ANYOF_LOCALE;
694 /* 'And' a given class with another one. Can create false positives */
695 /* We assume that cl is not inverted */
697 S_cl_and(struct regnode_charclass_class *cl,
698 const struct regnode_charclass_class *and_with)
701 assert(and_with->type == ANYOF);
702 if (!(and_with->flags & ANYOF_CLASS)
703 && !(cl->flags & ANYOF_CLASS)
704 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
705 && !(and_with->flags & ANYOF_FOLD)
706 && !(cl->flags & ANYOF_FOLD)) {
709 if (and_with->flags & ANYOF_INVERT)
710 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
711 cl->bitmap[i] &= ~and_with->bitmap[i];
713 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
714 cl->bitmap[i] &= and_with->bitmap[i];
715 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
716 if (!(and_with->flags & ANYOF_EOS))
717 cl->flags &= ~ANYOF_EOS;
719 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE &&
720 !(and_with->flags & ANYOF_INVERT)) {
721 cl->flags &= ~ANYOF_UNICODE_ALL;
722 cl->flags |= ANYOF_UNICODE;
723 ARG_SET(cl, ARG(and_with));
725 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
726 !(and_with->flags & ANYOF_INVERT))
727 cl->flags &= ~ANYOF_UNICODE_ALL;
728 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) &&
729 !(and_with->flags & ANYOF_INVERT))
730 cl->flags &= ~ANYOF_UNICODE;
733 /* 'OR' a given class with another one. Can create false positives */
734 /* We assume that cl is not inverted */
736 S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with)
738 if (or_with->flags & ANYOF_INVERT) {
740 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
741 * <= (B1 | !B2) | (CL1 | !CL2)
742 * which is wasteful if CL2 is small, but we ignore CL2:
743 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
744 * XXXX Can we handle case-fold? Unclear:
745 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
746 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
748 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
749 && !(or_with->flags & ANYOF_FOLD)
750 && !(cl->flags & ANYOF_FOLD) ) {
753 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
754 cl->bitmap[i] |= ~or_with->bitmap[i];
755 } /* XXXX: logic is complicated otherwise */
757 cl_anything(pRExC_state, cl);
760 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
761 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
762 && (!(or_with->flags & ANYOF_FOLD)
763 || (cl->flags & ANYOF_FOLD)) ) {
766 /* OR char bitmap and class bitmap separately */
767 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
768 cl->bitmap[i] |= or_with->bitmap[i];
769 if (or_with->flags & ANYOF_CLASS) {
770 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
771 cl->classflags[i] |= or_with->classflags[i];
772 cl->flags |= ANYOF_CLASS;
775 else { /* XXXX: logic is complicated, leave it along for a moment. */
776 cl_anything(pRExC_state, cl);
779 if (or_with->flags & ANYOF_EOS)
780 cl->flags |= ANYOF_EOS;
782 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
783 ARG(cl) != ARG(or_with)) {
784 cl->flags |= ANYOF_UNICODE_ALL;
785 cl->flags &= ~ANYOF_UNICODE;
787 if (or_with->flags & ANYOF_UNICODE_ALL) {
788 cl->flags |= ANYOF_UNICODE_ALL;
789 cl->flags &= ~ANYOF_UNICODE;
793 #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
794 #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
795 #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
796 #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 )
802 dump_trie_interim_list(trie,next_alloc)
803 dump_trie_interim_table(trie,next_alloc)
805 These routines dump out a trie in a somewhat readable format.
806 The _interim_ variants are used for debugging the interim
807 tables that are used to generate the final compressed
808 representation which is what dump_trie expects.
810 Part of the reason for their existance is to provide a form
811 of documentation as to how the different representations function.
817 Dumps the final compressed table form of the trie to Perl_debug_log.
818 Used for debugging make_trie().
822 S_dump_trie(pTHX_ const struct _reg_trie_data *trie,U32 depth)
825 SV *sv=sv_newmortal();
826 int colwidth= trie->widecharmap ? 6 : 4;
827 GET_RE_DEBUG_FLAGS_DECL;
830 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
831 (int)depth * 2 + 2,"",
832 "Match","Base","Ofs" );
834 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
835 SV ** const tmp = av_fetch( trie->revcharmap, state, 0);
837 PerlIO_printf( Perl_debug_log, "%*s",
839 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
840 PL_colors[0], PL_colors[1],
841 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
842 PERL_PV_ESCAPE_FIRSTCHAR
847 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
848 (int)depth * 2 + 2,"");
850 for( state = 0 ; state < trie->uniquecharcount ; state++ )
851 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
852 PerlIO_printf( Perl_debug_log, "\n");
854 for( state = 1 ; state < trie->statecount ; state++ ) {
855 const U32 base = trie->states[ state ].trans.base;
857 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state);
859 if ( trie->states[ state ].wordnum ) {
860 PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum );
862 PerlIO_printf( Perl_debug_log, "%6s", "" );
865 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
870 while( ( base + ofs < trie->uniquecharcount ) ||
871 ( base + ofs - trie->uniquecharcount < trie->lasttrans
872 && trie->trans[ base + ofs - trie->uniquecharcount ].check != state))
875 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
877 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
878 if ( ( base + ofs >= trie->uniquecharcount ) &&
879 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
880 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
882 PerlIO_printf( Perl_debug_log, "%*"UVXf,
884 (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next );
886 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
890 PerlIO_printf( Perl_debug_log, "]");
893 PerlIO_printf( Perl_debug_log, "\n" );
897 dump_trie_interim_list(trie,next_alloc)
898 Dumps a fully constructed but uncompressed trie in list form.
899 List tries normally only are used for construction when the number of
900 possible chars (trie->uniquecharcount) is very high.
901 Used for debugging make_trie().
904 S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie, U32 next_alloc,U32 depth)
907 SV *sv=sv_newmortal();
908 int colwidth= trie->widecharmap ? 6 : 4;
909 GET_RE_DEBUG_FLAGS_DECL;
910 /* print out the table precompression. */
911 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
912 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
913 "------:-----+-----------------\n" );
915 for( state=1 ; state < next_alloc ; state ++ ) {
918 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
919 (int)depth * 2 + 2,"", (UV)state );
920 if ( ! trie->states[ state ].wordnum ) {
921 PerlIO_printf( Perl_debug_log, "%5s| ","");
923 PerlIO_printf( Perl_debug_log, "W%4x| ",
924 trie->states[ state ].wordnum
927 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
928 SV ** const tmp = av_fetch( trie->revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0);
930 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
932 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
933 PL_colors[0], PL_colors[1],
934 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
935 PERL_PV_ESCAPE_FIRSTCHAR
937 TRIE_LIST_ITEM(state,charid).forid,
938 (UV)TRIE_LIST_ITEM(state,charid).newstate
941 PerlIO_printf(Perl_debug_log, "\n%*s| ",
942 (int)((depth * 2) + 14), "");
945 PerlIO_printf( Perl_debug_log, "\n");
950 dump_trie_interim_table(trie,next_alloc)
951 Dumps a fully constructed but uncompressed trie in table form.
952 This is the normal DFA style state transition table, with a few
953 twists to facilitate compression later.
954 Used for debugging make_trie().
957 S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie, U32 next_alloc, U32 depth)
961 SV *sv=sv_newmortal();
962 int colwidth= trie->widecharmap ? 6 : 4;
963 GET_RE_DEBUG_FLAGS_DECL;
966 print out the table precompression so that we can do a visual check
967 that they are identical.
970 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
972 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
973 SV ** const tmp = av_fetch( trie->revcharmap, charid, 0);
975 PerlIO_printf( Perl_debug_log, "%*s",
977 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
978 PL_colors[0], PL_colors[1],
979 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
980 PERL_PV_ESCAPE_FIRSTCHAR
986 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
988 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
989 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
992 PerlIO_printf( Perl_debug_log, "\n" );
994 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
996 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
997 (int)depth * 2 + 2,"",
998 (UV)TRIE_NODENUM( state ) );
1000 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
1001 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
1003 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
1005 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
1007 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
1008 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check );
1010 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check,
1011 trie->states[ TRIE_NODENUM( state ) ].wordnum );
1018 /* make_trie(startbranch,first,last,tail,word_count,flags,depth)
1019 startbranch: the first branch in the whole branch sequence
1020 first : start branch of sequence of branch-exact nodes.
1021 May be the same as startbranch
1022 last : Thing following the last branch.
1023 May be the same as tail.
1024 tail : item following the branch sequence
1025 count : words in the sequence
1026 flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/
1027 depth : indent depth
1029 Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
1031 A trie is an N'ary tree where the branches are determined by digital
1032 decomposition of the key. IE, at the root node you look up the 1st character and
1033 follow that branch repeat until you find the end of the branches. Nodes can be
1034 marked as "accepting" meaning they represent a complete word. Eg:
1038 would convert into the following structure. Numbers represent states, letters
1039 following numbers represent valid transitions on the letter from that state, if
1040 the number is in square brackets it represents an accepting state, otherwise it
1041 will be in parenthesis.
1043 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1047 (1) +-i->(6)-+-s->[7]
1049 +-s->(3)-+-h->(4)-+-e->[5]
1051 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1053 This shows that when matching against the string 'hers' we will begin at state 1
1054 read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1055 then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1056 is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1057 single traverse. We store a mapping from accepting to state to which word was
1058 matched, and then when we have multiple possibilities we try to complete the
1059 rest of the regex in the order in which they occured in the alternation.
1061 The only prior NFA like behaviour that would be changed by the TRIE support is
1062 the silent ignoring of duplicate alternations which are of the form:
1064 / (DUPE|DUPE) X? (?{ ... }) Y /x
1066 Thus EVAL blocks follwing a trie may be called a different number of times with
1067 and without the optimisation. With the optimisations dupes will be silently
1068 ignored. This inconsistant behaviour of EVAL type nodes is well established as
1069 the following demonstrates:
1071 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
1073 which prints out 'word' three times, but
1075 'words'=~/(word|word|word)(?{ print $1 })S/
1077 which doesnt print it out at all. This is due to other optimisations kicking in.
1079 Example of what happens on a structural level:
1081 The regexp /(ac|ad|ab)+/ will produce the folowing debug output:
1083 1: CURLYM[1] {1,32767}(18)
1094 This would be optimizable with startbranch=5, first=5, last=16, tail=16
1095 and should turn into:
1097 1: CURLYM[1] {1,32767}(18)
1099 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
1107 Cases where tail != last would be like /(?foo|bar)baz/:
1117 which would be optimizable with startbranch=1, first=1, last=7, tail=8
1118 and would end up looking like:
1121 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
1128 d = uvuni_to_utf8_flags(d, uv, 0);
1130 is the recommended Unicode-aware way of saying
1135 #define TRIE_STORE_REVCHAR \
1137 SV *tmp = newSVpvs(""); \
1138 if (UTF) SvUTF8_on(tmp); \
1139 Perl_sv_catpvf( aTHX_ tmp, "%c", (int)uvc ); \
1140 av_push( TRIE_REVCHARMAP(trie), tmp ); \
1143 #define TRIE_READ_CHAR STMT_START { \
1147 if ( foldlen > 0 ) { \
1148 uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \
1153 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1154 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1155 foldlen -= UNISKIP( uvc ); \
1156 scan = foldbuf + UNISKIP( uvc ); \
1159 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1169 #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
1170 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
1171 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
1172 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
1174 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
1175 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
1176 TRIE_LIST_CUR( state )++; \
1179 #define TRIE_LIST_NEW(state) STMT_START { \
1180 Newxz( trie->states[ state ].trans.list, \
1181 4, reg_trie_trans_le ); \
1182 TRIE_LIST_CUR( state ) = 1; \
1183 TRIE_LIST_LEN( state ) = 4; \
1186 #define TRIE_HANDLE_WORD(state) STMT_START { \
1187 U16 dupe= trie->states[ state ].wordnum; \
1188 regnode * const noper_next = regnext( noper ); \
1190 if (trie->wordlen) \
1191 trie->wordlen[ curword ] = wordlen; \
1193 /* store the word for dumping */ \
1195 if (OP(noper) != NOTHING) \
1196 tmp = newSVpvn(STRING(noper), STR_LEN(noper)); \
1198 tmp = newSVpvn( "", 0 ); \
1199 if ( UTF ) SvUTF8_on( tmp ); \
1200 av_push( trie->words, tmp ); \
1205 if ( noper_next < tail ) { \
1207 trie->jump = PerlMemShared_calloc( word_count + 1, sizeof(U16) ); \
1208 trie->jump[curword] = (U16)(noper_next - convert); \
1210 jumper = noper_next; \
1212 nextbranch= regnext(cur); \
1216 /* So it's a dupe. This means we need to maintain a */\
1217 /* linked-list from the first to the next. */\
1218 /* we only allocate the nextword buffer when there */\
1219 /* a dupe, so first time we have to do the allocation */\
1220 if (!trie->nextword) \
1222 PerlMemShared_calloc( word_count + 1, sizeof(U16)); \
1223 while ( trie->nextword[dupe] ) \
1224 dupe= trie->nextword[dupe]; \
1225 trie->nextword[dupe]= curword; \
1227 /* we haven't inserted this word yet. */ \
1228 trie->states[ state ].wordnum = curword; \
1233 #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
1234 ( ( base + charid >= ucharcount \
1235 && base + charid < ubound \
1236 && state == trie->trans[ base - ucharcount + charid ].check \
1237 && trie->trans[ base - ucharcount + charid ].next ) \
1238 ? trie->trans[ base - ucharcount + charid ].next \
1239 : ( state==1 ? special : 0 ) \
1243 #define MADE_JUMP_TRIE 2
1244 #define MADE_EXACT_TRIE 4
1247 S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth)
1250 /* first pass, loop through and scan words */
1251 reg_trie_data *trie;
1253 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1258 regnode *jumper = NULL;
1259 regnode *nextbranch = NULL;
1260 regnode *convert = NULL;
1261 /* we just use folder as a flag in utf8 */
1262 const U8 * const folder = ( flags == EXACTF
1264 : ( flags == EXACTFL
1270 const U32 data_slot = add_data( pRExC_state, 1, "t" );
1271 SV *re_trie_maxbuff;
1273 /* these are only used during construction but are useful during
1274 * debugging so we store them in the struct when debugging.
1276 STRLEN trie_charcount=0;
1277 AV *trie_revcharmap;
1279 GET_RE_DEBUG_FLAGS_DECL;
1281 PERL_UNUSED_ARG(depth);
1284 trie = PerlMemShared_calloc( 1, sizeof(reg_trie_data) );
1286 trie->startstate = 1;
1287 trie->wordcount = word_count;
1288 RExC_rxi->data->data[ data_slot ] = (void*)trie;
1289 trie->charmap = PerlMemShared_calloc( 256, sizeof(U16) );
1290 if (!(UTF && folder))
1291 trie->bitmap = PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 );
1293 trie->words = newAV();
1295 TRIE_REVCHARMAP(trie) = newAV();
1297 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
1298 if (!SvIOK(re_trie_maxbuff)) {
1299 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
1302 PerlIO_printf( Perl_debug_log,
1303 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
1304 (int)depth * 2 + 2, "",
1305 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
1306 REG_NODE_NUM(last), REG_NODE_NUM(tail),
1310 /* Find the node we are going to overwrite */
1311 if ( first == startbranch && OP( last ) != BRANCH ) {
1312 /* whole branch chain */
1315 /* branch sub-chain */
1316 convert = NEXTOPER( first );
1319 /* -- First loop and Setup --
1321 We first traverse the branches and scan each word to determine if it
1322 contains widechars, and how many unique chars there are, this is
1323 important as we have to build a table with at least as many columns as we
1326 We use an array of integers to represent the character codes 0..255
1327 (trie->charmap) and we use a an HV* to store unicode characters. We use the
1328 native representation of the character value as the key and IV's for the
1331 *TODO* If we keep track of how many times each character is used we can
1332 remap the columns so that the table compression later on is more
1333 efficient in terms of memory by ensuring most common value is in the
1334 middle and the least common are on the outside. IMO this would be better
1335 than a most to least common mapping as theres a decent chance the most
1336 common letter will share a node with the least common, meaning the node
1337 will not be compressable. With a middle is most common approach the worst
1338 case is when we have the least common nodes twice.
1342 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1343 regnode * const noper = NEXTOPER( cur );
1344 const U8 *uc = (U8*)STRING( noper );
1345 const U8 * const e = uc + STR_LEN( noper );
1347 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1348 const U8 *scan = (U8*)NULL;
1349 U32 wordlen = 0; /* required init */
1352 if (OP(noper) == NOTHING) {
1357 TRIE_BITMAP_SET(trie,*uc);
1358 if ( folder ) TRIE_BITMAP_SET(trie,folder[ *uc ]);
1360 for ( ; uc < e ; uc += len ) {
1361 TRIE_CHARCOUNT(trie)++;
1365 if ( !trie->charmap[ uvc ] ) {
1366 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
1368 trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ];
1373 if ( !trie->widecharmap )
1374 trie->widecharmap = newHV();
1376 svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 1 );
1379 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
1381 if ( !SvTRUE( *svpp ) ) {
1382 sv_setiv( *svpp, ++trie->uniquecharcount );
1387 if( cur == first ) {
1390 } else if (chars < trie->minlen) {
1392 } else if (chars > trie->maxlen) {
1396 } /* end first pass */
1397 DEBUG_TRIE_COMPILE_r(
1398 PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
1399 (int)depth * 2 + 2,"",
1400 ( trie->widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
1401 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
1402 (int)trie->minlen, (int)trie->maxlen )
1404 trie->wordlen = PerlMemShared_calloc( word_count, sizeof(U32) );
1407 We now know what we are dealing with in terms of unique chars and
1408 string sizes so we can calculate how much memory a naive
1409 representation using a flat table will take. If it's over a reasonable
1410 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
1411 conservative but potentially much slower representation using an array
1414 At the end we convert both representations into the same compressed
1415 form that will be used in regexec.c for matching with. The latter
1416 is a form that cannot be used to construct with but has memory
1417 properties similar to the list form and access properties similar
1418 to the table form making it both suitable for fast searches and
1419 small enough that its feasable to store for the duration of a program.
1421 See the comment in the code where the compressed table is produced
1422 inplace from the flat tabe representation for an explanation of how
1423 the compression works.
1428 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) {
1430 Second Pass -- Array Of Lists Representation
1432 Each state will be represented by a list of charid:state records
1433 (reg_trie_trans_le) the first such element holds the CUR and LEN
1434 points of the allocated array. (See defines above).
1436 We build the initial structure using the lists, and then convert
1437 it into the compressed table form which allows faster lookups
1438 (but cant be modified once converted).
1441 STRLEN transcount = 1;
1443 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1444 "%*sCompiling trie using list compiler\n",
1445 (int)depth * 2 + 2, ""));
1447 trie->states = PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1448 sizeof(reg_trie_state) );
1452 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1454 regnode * const noper = NEXTOPER( cur );
1455 U8 *uc = (U8*)STRING( noper );
1456 const U8 * const e = uc + STR_LEN( noper );
1457 U32 state = 1; /* required init */
1458 U16 charid = 0; /* sanity init */
1459 U8 *scan = (U8*)NULL; /* sanity init */
1460 STRLEN foldlen = 0; /* required init */
1461 U32 wordlen = 0; /* required init */
1462 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1464 if (OP(noper) != NOTHING) {
1465 for ( ; uc < e ; uc += len ) {
1470 charid = trie->charmap[ uvc ];
1472 SV** const svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 0);
1476 charid=(U16)SvIV( *svpp );
1479 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1486 if ( !trie->states[ state ].trans.list ) {
1487 TRIE_LIST_NEW( state );
1489 for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) {
1490 if ( TRIE_LIST_ITEM( state, check ).forid == charid ) {
1491 newstate = TRIE_LIST_ITEM( state, check ).newstate;
1496 newstate = next_alloc++;
1497 TRIE_LIST_PUSH( state, charid, newstate );
1502 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1506 TRIE_HANDLE_WORD(state);
1508 } /* end second pass */
1510 /* next alloc is the NEXT state to be allocated */
1511 trie->statecount = next_alloc;
1512 trie->states = PerlMemShared_realloc( trie->states, next_alloc
1513 * sizeof(reg_trie_state) );
1515 /* and now dump it out before we compress it */
1516 DEBUG_TRIE_COMPILE_MORE_r(
1517 dump_trie_interim_list(trie,next_alloc,depth+1)
1521 = PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) );
1528 for( state=1 ; state < next_alloc ; state ++ ) {
1532 DEBUG_TRIE_COMPILE_MORE_r(
1533 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
1537 if (trie->states[state].trans.list) {
1538 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
1542 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1543 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
1544 if ( forid < minid ) {
1546 } else if ( forid > maxid ) {
1550 if ( transcount < tp + maxid - minid + 1) {
1553 = PerlMemShared_realloc( trie->trans,
1555 * sizeof(reg_trie_trans) );
1556 Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans );
1558 base = trie->uniquecharcount + tp - minid;
1559 if ( maxid == minid ) {
1561 for ( ; zp < tp ; zp++ ) {
1562 if ( ! trie->trans[ zp ].next ) {
1563 base = trie->uniquecharcount + zp - minid;
1564 trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1565 trie->trans[ zp ].check = state;
1571 trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1572 trie->trans[ tp ].check = state;
1577 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
1578 const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid;
1579 trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate;
1580 trie->trans[ tid ].check = state;
1582 tp += ( maxid - minid + 1 );
1584 Safefree(trie->states[ state ].trans.list);
1587 DEBUG_TRIE_COMPILE_MORE_r(
1588 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
1591 trie->states[ state ].trans.base=base;
1593 trie->lasttrans = tp + 1;
1597 Second Pass -- Flat Table Representation.
1599 we dont use the 0 slot of either trans[] or states[] so we add 1 to each.
1600 We know that we will need Charcount+1 trans at most to store the data
1601 (one row per char at worst case) So we preallocate both structures
1602 assuming worst case.
1604 We then construct the trie using only the .next slots of the entry
1607 We use the .check field of the first entry of the node temporarily to
1608 make compression both faster and easier by keeping track of how many non
1609 zero fields are in the node.
1611 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
1614 There are two terms at use here: state as a TRIE_NODEIDX() which is a
1615 number representing the first entry of the node, and state as a
1616 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and
1617 TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there
1618 are 2 entrys per node. eg:
1626 The table is internally in the right hand, idx form. However as we also
1627 have to deal with the states array which is indexed by nodenum we have to
1628 use TRIE_NODENUM() to convert.
1631 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1632 "%*sCompiling trie using table compiler\n",
1633 (int)depth * 2 + 2, ""));
1635 trie->trans = PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 )
1636 * trie->uniquecharcount + 1,
1637 sizeof(reg_trie_trans) );
1638 trie->states = PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1639 sizeof(reg_trie_state) );
1640 next_alloc = trie->uniquecharcount + 1;
1643 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1645 regnode * const noper = NEXTOPER( cur );
1646 const U8 *uc = (U8*)STRING( noper );
1647 const U8 * const e = uc + STR_LEN( noper );
1649 U32 state = 1; /* required init */
1651 U16 charid = 0; /* sanity init */
1652 U32 accept_state = 0; /* sanity init */
1653 U8 *scan = (U8*)NULL; /* sanity init */
1655 STRLEN foldlen = 0; /* required init */
1656 U32 wordlen = 0; /* required init */
1657 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1659 if ( OP(noper) != NOTHING ) {
1660 for ( ; uc < e ; uc += len ) {
1665 charid = trie->charmap[ uvc ];
1667 SV* const * const svpp = hv_fetch( trie->widecharmap, (char*)&uvc, sizeof( UV ), 0);
1668 charid = svpp ? (U16)SvIV(*svpp) : 0;
1672 if ( !trie->trans[ state + charid ].next ) {
1673 trie->trans[ state + charid ].next = next_alloc;
1674 trie->trans[ state ].check++;
1675 next_alloc += trie->uniquecharcount;
1677 state = trie->trans[ state + charid ].next;
1679 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1681 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1684 accept_state = TRIE_NODENUM( state );
1685 TRIE_HANDLE_WORD(accept_state);
1687 } /* end second pass */
1689 /* and now dump it out before we compress it */
1690 DEBUG_TRIE_COMPILE_MORE_r(
1691 dump_trie_interim_table(trie,next_alloc,depth+1)
1696 * Inplace compress the table.*
1698 For sparse data sets the table constructed by the trie algorithm will
1699 be mostly 0/FAIL transitions or to put it another way mostly empty.
1700 (Note that leaf nodes will not contain any transitions.)
1702 This algorithm compresses the tables by eliminating most such
1703 transitions, at the cost of a modest bit of extra work during lookup:
1705 - Each states[] entry contains a .base field which indicates the
1706 index in the state[] array wheres its transition data is stored.
1708 - If .base is 0 there are no valid transitions from that node.
1710 - If .base is nonzero then charid is added to it to find an entry in
1713 -If trans[states[state].base+charid].check!=state then the
1714 transition is taken to be a 0/Fail transition. Thus if there are fail
1715 transitions at the front of the node then the .base offset will point
1716 somewhere inside the previous nodes data (or maybe even into a node
1717 even earlier), but the .check field determines if the transition is
1721 The following process inplace converts the table to the compressed
1722 table: We first do not compress the root node 1,and mark its all its
1723 .check pointers as 1 and set its .base pointer as 1 as well. This
1724 allows to do a DFA construction from the compressed table later, and
1725 ensures that any .base pointers we calculate later are greater than
1728 - We set 'pos' to indicate the first entry of the second node.
1730 - We then iterate over the columns of the node, finding the first and
1731 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
1732 and set the .check pointers accordingly, and advance pos
1733 appropriately and repreat for the next node. Note that when we copy
1734 the next pointers we have to convert them from the original
1735 NODEIDX form to NODENUM form as the former is not valid post
1738 - If a node has no transitions used we mark its base as 0 and do not
1739 advance the pos pointer.
1741 - If a node only has one transition we use a second pointer into the
1742 structure to fill in allocated fail transitions from other states.
1743 This pointer is independent of the main pointer and scans forward
1744 looking for null transitions that are allocated to a state. When it
1745 finds one it writes the single transition into the "hole". If the
1746 pointer doesnt find one the single transition is appended as normal.
1748 - Once compressed we can Renew/realloc the structures to release the
1751 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
1752 specifically Fig 3.47 and the associated pseudocode.
1756 const U32 laststate = TRIE_NODENUM( next_alloc );
1759 trie->statecount = laststate;
1761 for ( state = 1 ; state < laststate ; state++ ) {
1763 const U32 stateidx = TRIE_NODEIDX( state );
1764 const U32 o_used = trie->trans[ stateidx ].check;
1765 U32 used = trie->trans[ stateidx ].check;
1766 trie->trans[ stateidx ].check = 0;
1768 for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) {
1769 if ( flag || trie->trans[ stateidx + charid ].next ) {
1770 if ( trie->trans[ stateidx + charid ].next ) {
1772 for ( ; zp < pos ; zp++ ) {
1773 if ( ! trie->trans[ zp ].next ) {
1777 trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ;
1778 trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1779 trie->trans[ zp ].check = state;
1780 if ( ++zp > pos ) pos = zp;
1787 trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ;
1789 trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1790 trie->trans[ pos ].check = state;
1795 trie->lasttrans = pos + 1;
1796 trie->states = PerlMemShared_realloc( trie->states, laststate
1797 * sizeof(reg_trie_state) );
1798 DEBUG_TRIE_COMPILE_MORE_r(
1799 PerlIO_printf( Perl_debug_log,
1800 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
1801 (int)depth * 2 + 2,"",
1802 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ),
1805 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
1808 } /* end table compress */
1810 DEBUG_TRIE_COMPILE_MORE_r(
1811 PerlIO_printf(Perl_debug_log, "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n",
1812 (int)depth * 2 + 2, "",
1813 (UV)trie->statecount,
1814 (UV)trie->lasttrans)
1816 /* resize the trans array to remove unused space */
1817 trie->trans = PerlMemShared_realloc( trie->trans, trie->lasttrans
1818 * sizeof(reg_trie_trans) );
1820 /* and now dump out the compressed format */
1821 DEBUG_TRIE_COMPILE_r(
1822 dump_trie(trie,depth+1)
1825 { /* Modify the program and insert the new TRIE node*/
1826 U8 nodetype =(U8)(flags & 0xFF);
1830 regnode *optimize = NULL;
1832 U32 mjd_nodelen = 0;
1835 This means we convert either the first branch or the first Exact,
1836 depending on whether the thing following (in 'last') is a branch
1837 or not and whther first is the startbranch (ie is it a sub part of
1838 the alternation or is it the whole thing.)
1839 Assuming its a sub part we conver the EXACT otherwise we convert
1840 the whole branch sequence, including the first.
1842 /* Find the node we are going to overwrite */
1843 if ( first != startbranch || OP( last ) == BRANCH ) {
1844 /* branch sub-chain */
1845 NEXT_OFF( first ) = (U16)(last - first);
1847 mjd_offset= Node_Offset((convert));
1848 mjd_nodelen= Node_Length((convert));
1850 /* whole branch chain */
1853 const regnode *nop = NEXTOPER( convert );
1854 mjd_offset= Node_Offset((nop));
1855 mjd_nodelen= Node_Length((nop));
1860 PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
1861 (int)depth * 2 + 2, "",
1862 (UV)mjd_offset, (UV)mjd_nodelen)
1865 /* But first we check to see if there is a common prefix we can
1866 split out as an EXACT and put in front of the TRIE node. */
1867 trie->startstate= 1;
1868 if ( trie->bitmap && !trie->widecharmap && !trie->jump ) {
1870 for ( state = 1 ; state < trie->statecount-1 ; state++ ) {
1874 const U32 base = trie->states[ state ].trans.base;
1876 if ( trie->states[state].wordnum )
1879 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
1880 if ( ( base + ofs >= trie->uniquecharcount ) &&
1881 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
1882 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
1884 if ( ++count > 1 ) {
1885 SV **tmp = av_fetch( TRIE_REVCHARMAP(trie), ofs, 0);
1886 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
1887 if ( state == 1 ) break;
1889 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
1891 PerlIO_printf(Perl_debug_log,
1892 "%*sNew Start State=%"UVuf" Class: [",
1893 (int)depth * 2 + 2, "",
1896 SV ** const tmp = av_fetch( TRIE_REVCHARMAP(trie), idx, 0);
1897 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
1899 TRIE_BITMAP_SET(trie,*ch);
1901 TRIE_BITMAP_SET(trie, folder[ *ch ]);
1903 PerlIO_printf(Perl_debug_log, (char*)ch)
1907 TRIE_BITMAP_SET(trie,*ch);
1909 TRIE_BITMAP_SET(trie,folder[ *ch ]);
1910 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
1916 SV **tmp = av_fetch( TRIE_REVCHARMAP(trie), idx, 0);
1917 char *ch = SvPV_nolen( *tmp );
1919 SV *sv=sv_newmortal();
1920 PerlIO_printf( Perl_debug_log,
1921 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
1922 (int)depth * 2 + 2, "",
1924 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6,
1925 PL_colors[0], PL_colors[1],
1926 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1927 PERL_PV_ESCAPE_FIRSTCHAR
1932 OP( convert ) = nodetype;
1933 str=STRING(convert);
1944 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
1950 regnode *n = convert+NODE_SZ_STR(convert);
1951 NEXT_OFF(convert) = NODE_SZ_STR(convert);
1952 trie->startstate = state;
1953 trie->minlen -= (state - 1);
1954 trie->maxlen -= (state - 1);
1956 regnode *fix = convert;
1957 U32 word = trie->wordcount;
1959 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
1960 while( ++fix < n ) {
1961 Set_Node_Offset_Length(fix, 0, 0);
1964 SV ** const tmp = av_fetch( trie->words, word, 0 );
1966 if ( STR_LEN(convert) <= SvCUR(*tmp) )
1967 sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert));
1969 sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp));
1976 NEXT_OFF(convert) = (U16)(tail - convert);
1977 DEBUG_r(optimize= n);
1983 if ( trie->maxlen ) {
1984 NEXT_OFF( convert ) = (U16)(tail - convert);
1985 ARG_SET( convert, data_slot );
1986 /* Store the offset to the first unabsorbed branch in
1987 jump[0], which is otherwise unused by the jump logic.
1988 We use this when dumping a trie and during optimisation. */
1990 trie->jump[0] = (U16)(nextbranch - convert);
1993 if ( !trie->states[trie->startstate].wordnum && trie->bitmap &&
1994 ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
1996 OP( convert ) = TRIEC;
1997 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
1998 PerlMemShared_free(trie->bitmap);
2001 OP( convert ) = TRIE;
2003 /* store the type in the flags */
2004 convert->flags = nodetype;
2008 + regarglen[ OP( convert ) ];
2010 /* XXX We really should free up the resource in trie now,
2011 as we won't use them - (which resources?) dmq */
2013 /* needed for dumping*/
2014 DEBUG_r(if (optimize) {
2015 regnode *opt = convert;
2016 while ( ++opt < optimize) {
2017 Set_Node_Offset_Length(opt,0,0);
2020 Try to clean up some of the debris left after the
2023 while( optimize < jumper ) {
2024 mjd_nodelen += Node_Length((optimize));
2025 OP( optimize ) = OPTIMIZED;
2026 Set_Node_Offset_Length(optimize,0,0);
2029 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
2031 } /* end node insert */
2033 SvREFCNT_dec(TRIE_REVCHARMAP(trie));
2037 : trie->startstate>1
2043 S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth)
2045 /* The Trie is constructed and compressed now so we can build a fail array now if its needed
2047 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the
2048 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88
2051 We find the fail state for each state in the trie, this state is the longest proper
2052 suffix of the current states 'word' that is also a proper prefix of another word in our
2053 trie. State 1 represents the word '' and is the thus the default fail state. This allows
2054 the DFA not to have to restart after its tried and failed a word at a given point, it
2055 simply continues as though it had been matching the other word in the first place.
2057 'abcdgu'=~/abcdefg|cdgu/
2058 When we get to 'd' we are still matching the first word, we would encounter 'g' which would
2059 fail, which would bring use to the state representing 'd' in the second word where we would
2060 try 'g' and succeed, prodceding to match 'cdgu'.
2062 /* add a fail transition */
2063 reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[ARG(source)];
2065 const U32 ucharcount = trie->uniquecharcount;
2066 const U32 numstates = trie->statecount;
2067 const U32 ubound = trie->lasttrans + ucharcount;
2071 U32 base = trie->states[ 1 ].trans.base;
2074 const U32 data_slot = add_data( pRExC_state, 1, "T" );
2075 GET_RE_DEBUG_FLAGS_DECL;
2077 PERL_UNUSED_ARG(depth);
2081 ARG_SET( stclass, data_slot );
2082 aho = PerlMemShared_calloc( 1, sizeof(reg_ac_data) );
2083 RExC_rxi->data->data[ data_slot ] = (void*)aho;
2085 aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) );
2086 Copy( trie->states, aho->states, numstates, reg_trie_state );
2087 Newxz( q, numstates, U32);
2088 aho->fail = PerlMemShared_calloc( numstates, sizeof(U32) );
2091 /* initialize fail[0..1] to be 1 so that we always have
2092 a valid final fail state */
2093 fail[ 0 ] = fail[ 1 ] = 1;
2095 for ( charid = 0; charid < ucharcount ; charid++ ) {
2096 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
2098 q[ q_write ] = newstate;
2099 /* set to point at the root */
2100 fail[ q[ q_write++ ] ]=1;
2103 while ( q_read < q_write) {
2104 const U32 cur = q[ q_read++ % numstates ];
2105 base = trie->states[ cur ].trans.base;
2107 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
2108 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
2110 U32 fail_state = cur;
2113 fail_state = fail[ fail_state ];
2114 fail_base = aho->states[ fail_state ].trans.base;
2115 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
2117 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
2118 fail[ ch_state ] = fail_state;
2119 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
2121 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
2123 q[ q_write++ % numstates] = ch_state;
2127 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
2128 when we fail in state 1, this allows us to use the
2129 charclass scan to find a valid start char. This is based on the principle
2130 that theres a good chance the string being searched contains lots of stuff
2131 that cant be a start char.
2133 fail[ 0 ] = fail[ 1 ] = 0;
2134 DEBUG_TRIE_COMPILE_r({
2135 PerlIO_printf(Perl_debug_log,
2136 "%*sStclass Failtable (%"UVuf" states): 0",
2137 (int)(depth * 2), "", (UV)numstates
2139 for( q_read=1; q_read<numstates; q_read++ ) {
2140 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
2142 PerlIO_printf(Perl_debug_log, "\n");
2145 /*RExC_seen |= REG_SEEN_TRIEDFA;*/
2150 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
2151 * These need to be revisited when a newer toolchain becomes available.
2153 #if defined(__sparc64__) && defined(__GNUC__)
2154 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
2155 # undef SPARC64_GCC_WORKAROUND
2156 # define SPARC64_GCC_WORKAROUND 1
2160 #define DEBUG_PEEP(str,scan,depth) \
2161 DEBUG_OPTIMISE_r({if (scan){ \
2162 SV * const mysv=sv_newmortal(); \
2163 regnode *Next = regnext(scan); \
2164 regprop(RExC_rx, mysv, scan); \
2165 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)\n", \
2166 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\
2167 Next ? (REG_NODE_NUM(Next)) : 0 ); \
2174 #define JOIN_EXACT(scan,min,flags) \
2175 if (PL_regkind[OP(scan)] == EXACT) \
2176 join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1)
2179 S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) {
2180 /* Merge several consecutive EXACTish nodes into one. */
2181 regnode *n = regnext(scan);
2183 regnode *next = scan + NODE_SZ_STR(scan);
2187 regnode *stop = scan;
2188 GET_RE_DEBUG_FLAGS_DECL;
2190 PERL_UNUSED_ARG(depth);
2192 #ifndef EXPERIMENTAL_INPLACESCAN
2193 PERL_UNUSED_ARG(flags);
2194 PERL_UNUSED_ARG(val);
2196 DEBUG_PEEP("join",scan,depth);
2198 /* Skip NOTHING, merge EXACT*. */
2200 ( PL_regkind[OP(n)] == NOTHING ||
2201 (stringok && (OP(n) == OP(scan))))
2203 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
2205 if (OP(n) == TAIL || n > next)
2207 if (PL_regkind[OP(n)] == NOTHING) {
2208 DEBUG_PEEP("skip:",n,depth);
2209 NEXT_OFF(scan) += NEXT_OFF(n);
2210 next = n + NODE_STEP_REGNODE;
2217 else if (stringok) {
2218 const unsigned int oldl = STR_LEN(scan);
2219 regnode * const nnext = regnext(n);
2221 DEBUG_PEEP("merg",n,depth);
2224 if (oldl + STR_LEN(n) > U8_MAX)
2226 NEXT_OFF(scan) += NEXT_OFF(n);
2227 STR_LEN(scan) += STR_LEN(n);
2228 next = n + NODE_SZ_STR(n);
2229 /* Now we can overwrite *n : */
2230 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
2238 #ifdef EXPERIMENTAL_INPLACESCAN
2239 if (flags && !NEXT_OFF(n)) {
2240 DEBUG_PEEP("atch", val, depth);
2241 if (reg_off_by_arg[OP(n)]) {
2242 ARG_SET(n, val - n);
2245 NEXT_OFF(n) = val - n;
2252 if (UTF && ( OP(scan) == EXACTF ) && ( STR_LEN(scan) >= 6 ) ) {
2254 Two problematic code points in Unicode casefolding of EXACT nodes:
2256 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
2257 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
2263 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
2264 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
2266 This means that in case-insensitive matching (or "loose matching",
2267 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
2268 length of the above casefolded versions) can match a target string
2269 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
2270 This would rather mess up the minimum length computation.
2272 What we'll do is to look for the tail four bytes, and then peek
2273 at the preceding two bytes to see whether we need to decrease
2274 the minimum length by four (six minus two).
2276 Thanks to the design of UTF-8, there cannot be false matches:
2277 A sequence of valid UTF-8 bytes cannot be a subsequence of
2278 another valid sequence of UTF-8 bytes.
2281 char * const s0 = STRING(scan), *s, *t;
2282 char * const s1 = s0 + STR_LEN(scan) - 1;
2283 char * const s2 = s1 - 4;
2284 #ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */
2285 const char t0[] = "\xaf\x49\xaf\x42";
2287 const char t0[] = "\xcc\x88\xcc\x81";
2289 const char * const t1 = t0 + 3;
2292 s < s2 && (t = ninstr(s, s1, t0, t1));
2295 if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) ||
2296 ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5))
2298 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
2299 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
2307 n = scan + NODE_SZ_STR(scan);
2309 if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) {
2316 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
2320 /* REx optimizer. Converts nodes into quickier variants "in place".
2321 Finds fixed substrings. */
2323 /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
2324 to the position after last scanned or to NULL. */
2326 #define INIT_AND_WITHP \
2327 assert(!and_withp); \
2328 Newx(and_withp,1,struct regnode_charclass_class); \
2329 SAVEFREEPV(and_withp)
2331 /* this is a chain of data about sub patterns we are processing that
2332 need to be handled seperately/specially in study_chunk. Its so
2333 we can simulate recursion without losing state. */
2335 typedef struct scan_frame {
2336 regnode *last; /* last node to process in this frame */
2337 regnode *next; /* next node to process when last is reached */
2338 struct scan_frame *prev; /*previous frame*/
2339 I32 stop; /* what stopparen do we use */
2343 S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
2344 I32 *minlenp, I32 *deltap,
2349 struct regnode_charclass_class *and_withp,
2350 U32 flags, U32 depth)
2351 /* scanp: Start here (read-write). */
2352 /* deltap: Write maxlen-minlen here. */
2353 /* last: Stop before this one. */
2354 /* data: string data about the pattern */
2355 /* stopparen: treat close N as END */
2356 /* recursed: which subroutines have we recursed into */
2357 /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */
2360 I32 min = 0, pars = 0, code;
2361 regnode *scan = *scanp, *next;
2363 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
2364 int is_inf_internal = 0; /* The studied chunk is infinite */
2365 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
2366 scan_data_t data_fake;
2367 SV *re_trie_maxbuff = NULL;
2368 regnode *first_non_open = scan;
2369 I32 stopmin = I32_MAX;
2370 scan_frame *frame = NULL;
2372 GET_RE_DEBUG_FLAGS_DECL;
2375 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
2379 while (first_non_open && OP(first_non_open) == OPEN)
2380 first_non_open=regnext(first_non_open);
2385 while ( scan && OP(scan) != END && scan < last ){
2386 /* Peephole optimizer: */
2387 DEBUG_STUDYDATA(data,depth);
2388 DEBUG_PEEP("Peep",scan,depth);
2389 JOIN_EXACT(scan,&min,0);
2391 /* Follow the next-chain of the current node and optimize
2392 away all the NOTHINGs from it. */
2393 if (OP(scan) != CURLYX) {
2394 const int max = (reg_off_by_arg[OP(scan)]
2396 /* I32 may be smaller than U16 on CRAYs! */
2397 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
2398 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
2402 /* Skip NOTHING and LONGJMP. */
2403 while ((n = regnext(n))
2404 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
2405 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
2406 && off + noff < max)
2408 if (reg_off_by_arg[OP(scan)])
2411 NEXT_OFF(scan) = off;
2416 /* The principal pseudo-switch. Cannot be a switch, since we
2417 look into several different things. */
2418 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
2419 || OP(scan) == IFTHEN) {
2420 next = regnext(scan);
2422 /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */
2424 if (OP(next) == code || code == IFTHEN) {
2425 /* NOTE - There is similar code to this block below for handling
2426 TRIE nodes on a re-study. If you change stuff here check there
2428 I32 max1 = 0, min1 = I32_MAX, num = 0;
2429 struct regnode_charclass_class accum;
2430 regnode * const startbranch=scan;
2432 if (flags & SCF_DO_SUBSTR)
2433 scan_commit(pRExC_state, data, minlenp); /* Cannot merge strings after this. */
2434 if (flags & SCF_DO_STCLASS)
2435 cl_init_zero(pRExC_state, &accum);
2437 while (OP(scan) == code) {
2438 I32 deltanext, minnext, f = 0, fake;
2439 struct regnode_charclass_class this_class;
2442 data_fake.flags = 0;
2444 data_fake.whilem_c = data->whilem_c;
2445 data_fake.last_closep = data->last_closep;
2448 data_fake.last_closep = &fake;
2450 data_fake.pos_delta = delta;
2451 next = regnext(scan);
2452 scan = NEXTOPER(scan);
2454 scan = NEXTOPER(scan);
2455 if (flags & SCF_DO_STCLASS) {
2456 cl_init(pRExC_state, &this_class);
2457 data_fake.start_class = &this_class;
2458 f = SCF_DO_STCLASS_AND;
2460 if (flags & SCF_WHILEM_VISITED_POS)
2461 f |= SCF_WHILEM_VISITED_POS;
2463 /* we suppose the run is continuous, last=next...*/
2464 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2466 stopparen, recursed, NULL, f,depth+1);
2469 if (max1 < minnext + deltanext)
2470 max1 = minnext + deltanext;
2471 if (deltanext == I32_MAX)
2472 is_inf = is_inf_internal = 1;
2474 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
2476 if (data_fake.flags & SCF_SEEN_ACCEPT) {
2477 if ( stopmin > minnext)
2478 stopmin = min + min1;
2479 flags &= ~SCF_DO_SUBSTR;
2481 data->flags |= SCF_SEEN_ACCEPT;
2484 if (data_fake.flags & SF_HAS_EVAL)
2485 data->flags |= SF_HAS_EVAL;
2486 data->whilem_c = data_fake.whilem_c;
2488 if (flags & SCF_DO_STCLASS)
2489 cl_or(pRExC_state, &accum, &this_class);
2491 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
2493 if (flags & SCF_DO_SUBSTR) {
2494 data->pos_min += min1;
2495 data->pos_delta += max1 - min1;
2496 if (max1 != min1 || is_inf)
2497 data->longest = &(data->longest_float);
2500 delta += max1 - min1;
2501 if (flags & SCF_DO_STCLASS_OR) {
2502 cl_or(pRExC_state, data->start_class, &accum);
2504 cl_and(data->start_class, and_withp);
2505 flags &= ~SCF_DO_STCLASS;
2508 else if (flags & SCF_DO_STCLASS_AND) {
2510 cl_and(data->start_class, &accum);
2511 flags &= ~SCF_DO_STCLASS;
2514 /* Switch to OR mode: cache the old value of
2515 * data->start_class */
2517 StructCopy(data->start_class, and_withp,
2518 struct regnode_charclass_class);
2519 flags &= ~SCF_DO_STCLASS_AND;
2520 StructCopy(&accum, data->start_class,
2521 struct regnode_charclass_class);
2522 flags |= SCF_DO_STCLASS_OR;
2523 data->start_class->flags |= ANYOF_EOS;
2527 if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) {
2530 Assuming this was/is a branch we are dealing with: 'scan' now
2531 points at the item that follows the branch sequence, whatever
2532 it is. We now start at the beginning of the sequence and look
2539 which would be constructed from a pattern like /A|LIST|OF|WORDS/
2541 If we can find such a subseqence we need to turn the first
2542 element into a trie and then add the subsequent branch exact
2543 strings to the trie.
2547 1. patterns where the whole set of branch can be converted.
2549 2. patterns where only a subset can be converted.
2551 In case 1 we can replace the whole set with a single regop
2552 for the trie. In case 2 we need to keep the start and end
2555 'BRANCH EXACT; BRANCH EXACT; BRANCH X'
2556 becomes BRANCH TRIE; BRANCH X;
2558 There is an additional case, that being where there is a
2559 common prefix, which gets split out into an EXACT like node
2560 preceding the TRIE node.
2562 If x(1..n)==tail then we can do a simple trie, if not we make
2563 a "jump" trie, such that when we match the appropriate word
2564 we "jump" to the appopriate tail node. Essentailly we turn
2565 a nested if into a case structure of sorts.
2570 if (!re_trie_maxbuff) {
2571 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2572 if (!SvIOK(re_trie_maxbuff))
2573 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2575 if ( SvIV(re_trie_maxbuff)>=0 ) {
2577 regnode *first = (regnode *)NULL;
2578 regnode *last = (regnode *)NULL;
2579 regnode *tail = scan;
2584 SV * const mysv = sv_newmortal(); /* for dumping */
2586 /* var tail is used because there may be a TAIL
2587 regop in the way. Ie, the exacts will point to the
2588 thing following the TAIL, but the last branch will
2589 point at the TAIL. So we advance tail. If we
2590 have nested (?:) we may have to move through several
2594 while ( OP( tail ) == TAIL ) {
2595 /* this is the TAIL generated by (?:) */
2596 tail = regnext( tail );
2601 regprop(RExC_rx, mysv, tail );
2602 PerlIO_printf( Perl_debug_log, "%*s%s%s\n",
2603 (int)depth * 2 + 2, "",
2604 "Looking for TRIE'able sequences. Tail node is: ",
2605 SvPV_nolen_const( mysv )
2611 step through the branches, cur represents each
2612 branch, noper is the first thing to be matched
2613 as part of that branch and noper_next is the
2614 regnext() of that node. if noper is an EXACT
2615 and noper_next is the same as scan (our current
2616 position in the regex) then the EXACT branch is
2617 a possible optimization target. Once we have
2618 two or more consequetive such branches we can
2619 create a trie of the EXACT's contents and stich
2620 it in place. If the sequence represents all of
2621 the branches we eliminate the whole thing and
2622 replace it with a single TRIE. If it is a
2623 subsequence then we need to stitch it in. This
2624 means the first branch has to remain, and needs
2625 to be repointed at the item on the branch chain
2626 following the last branch optimized. This could
2627 be either a BRANCH, in which case the
2628 subsequence is internal, or it could be the
2629 item following the branch sequence in which
2630 case the subsequence is at the end.
2634 /* dont use tail as the end marker for this traverse */
2635 for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) {
2636 regnode * const noper = NEXTOPER( cur );
2637 #if defined(DEBUGGING) || defined(NOJUMPTRIE)
2638 regnode * const noper_next = regnext( noper );
2642 regprop(RExC_rx, mysv, cur);
2643 PerlIO_printf( Perl_debug_log, "%*s- %s (%d)",
2644 (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) );
2646 regprop(RExC_rx, mysv, noper);
2647 PerlIO_printf( Perl_debug_log, " -> %s",
2648 SvPV_nolen_const(mysv));
2651 regprop(RExC_rx, mysv, noper_next );
2652 PerlIO_printf( Perl_debug_log,"\t=> %s\t",
2653 SvPV_nolen_const(mysv));
2655 PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n",
2656 REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) );
2658 if ( (((first && optype!=NOTHING) ? OP( noper ) == optype
2659 : PL_regkind[ OP( noper ) ] == EXACT )
2660 || OP(noper) == NOTHING )
2662 && noper_next == tail
2667 if ( !first || optype == NOTHING ) {
2668 if (!first) first = cur;
2669 optype = OP( noper );
2675 make_trie( pRExC_state,
2676 startbranch, first, cur, tail, count,
2679 if ( PL_regkind[ OP( noper ) ] == EXACT
2681 && noper_next == tail
2686 optype = OP( noper );
2696 regprop(RExC_rx, mysv, cur);
2697 PerlIO_printf( Perl_debug_log,
2698 "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2,
2699 "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur));
2703 made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 );
2704 #ifdef TRIE_STUDY_OPT
2705 if ( ((made == MADE_EXACT_TRIE &&
2706 startbranch == first)
2707 || ( first_non_open == first )) &&
2709 flags |= SCF_TRIE_RESTUDY;
2710 if ( startbranch == first
2713 RExC_seen &=~REG_TOP_LEVEL_BRANCHES;
2723 else if ( code == BRANCHJ ) { /* single branch is optimized. */
2724 scan = NEXTOPER(NEXTOPER(scan));
2725 } else /* single branch is optimized. */
2726 scan = NEXTOPER(scan);
2728 } else if (OP(scan) == SUSPEND || OP(scan) == GOSUB || OP(scan) == GOSTART) {
2729 scan_frame *newframe = NULL;
2734 if (OP(scan) != SUSPEND) {
2735 /* set the pointer */
2736 if (OP(scan) == GOSUB) {
2738 RExC_recurse[ARG2L(scan)] = scan;
2739 start = RExC_open_parens[paren-1];
2740 end = RExC_close_parens[paren-1];
2743 start = RExC_rxi->program + 1;
2747 Newxz(recursed, (((RExC_npar)>>3) +1), U8);
2748 SAVEFREEPV(recursed);
2750 if (!PAREN_TEST(recursed,paren+1)) {
2751 PAREN_SET(recursed,paren+1);
2752 Newx(newframe,1,scan_frame);
2754 if (flags & SCF_DO_SUBSTR) {
2755 scan_commit(pRExC_state,data,minlenp);
2756 data->longest = &(data->longest_float);
2758 is_inf = is_inf_internal = 1;
2759 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
2760 cl_anything(pRExC_state, data->start_class);
2761 flags &= ~SCF_DO_STCLASS;
2764 Newx(newframe,1,scan_frame);
2767 end = regnext(scan);
2772 SAVEFREEPV(newframe);
2773 newframe->next = regnext(scan);
2774 newframe->last = last;
2775 newframe->stop = stopparen;
2776 newframe->prev = frame;
2786 else if (OP(scan) == EXACT) {
2787 I32 l = STR_LEN(scan);
2790 const U8 * const s = (U8*)STRING(scan);
2791 l = utf8_length(s, s + l);
2792 uc = utf8_to_uvchr(s, NULL);
2794 uc = *((U8*)STRING(scan));
2797 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
2798 /* The code below prefers earlier match for fixed
2799 offset, later match for variable offset. */
2800 if (data->last_end == -1) { /* Update the start info. */
2801 data->last_start_min = data->pos_min;
2802 data->last_start_max = is_inf
2803 ? I32_MAX : data->pos_min + data->pos_delta;
2805 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
2807 SvUTF8_on(data->last_found);
2809 SV * const sv = data->last_found;
2810 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
2811 mg_find(sv, PERL_MAGIC_utf8) : NULL;
2812 if (mg && mg->mg_len >= 0)
2813 mg->mg_len += utf8_length((U8*)STRING(scan),
2814 (U8*)STRING(scan)+STR_LEN(scan));
2816 data->last_end = data->pos_min + l;
2817 data->pos_min += l; /* As in the first entry. */
2818 data->flags &= ~SF_BEFORE_EOL;
2820 if (flags & SCF_DO_STCLASS_AND) {
2821 /* Check whether it is compatible with what we know already! */
2825 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2826 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2827 && (!(data->start_class->flags & ANYOF_FOLD)
2828 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2831 ANYOF_CLASS_ZERO(data->start_class);
2832 ANYOF_BITMAP_ZERO(data->start_class);
2834 ANYOF_BITMAP_SET(data->start_class, uc);
2835 data->start_class->flags &= ~ANYOF_EOS;
2837 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
2839 else if (flags & SCF_DO_STCLASS_OR) {
2840 /* false positive possible if the class is case-folded */
2842 ANYOF_BITMAP_SET(data->start_class, uc);
2844 data->start_class->flags |= ANYOF_UNICODE_ALL;
2845 data->start_class->flags &= ~ANYOF_EOS;
2846 cl_and(data->start_class, and_withp);
2848 flags &= ~SCF_DO_STCLASS;
2850 else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */
2851 I32 l = STR_LEN(scan);
2852 UV uc = *((U8*)STRING(scan));
2854 /* Search for fixed substrings supports EXACT only. */
2855 if (flags & SCF_DO_SUBSTR) {
2857 scan_commit(pRExC_state, data, minlenp);
2860 const U8 * const s = (U8 *)STRING(scan);
2861 l = utf8_length(s, s + l);
2862 uc = utf8_to_uvchr(s, NULL);
2865 if (flags & SCF_DO_SUBSTR)
2867 if (flags & SCF_DO_STCLASS_AND) {
2868 /* Check whether it is compatible with what we know already! */
2872 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2873 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2874 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2876 ANYOF_CLASS_ZERO(data->start_class);
2877 ANYOF_BITMAP_ZERO(data->start_class);
2879 ANYOF_BITMAP_SET(data->start_class, uc);
2880 data->start_class->flags &= ~ANYOF_EOS;
2881 data->start_class->flags |= ANYOF_FOLD;
2882 if (OP(scan) == EXACTFL)
2883 data->start_class->flags |= ANYOF_LOCALE;
2886 else if (flags & SCF_DO_STCLASS_OR) {
2887 if (data->start_class->flags & ANYOF_FOLD) {
2888 /* false positive possible if the class is case-folded.
2889 Assume that the locale settings are the same... */
2891 ANYOF_BITMAP_SET(data->start_class, uc);
2892 data->start_class->flags &= ~ANYOF_EOS;
2894 cl_and(data->start_class, and_withp);
2896 flags &= ~SCF_DO_STCLASS;
2898 else if (strchr((const char*)PL_varies,OP(scan))) {
2899 I32 mincount, maxcount, minnext, deltanext, fl = 0;
2900 I32 f = flags, pos_before = 0;
2901 regnode * const oscan = scan;
2902 struct regnode_charclass_class this_class;
2903 struct regnode_charclass_class *oclass = NULL;
2904 I32 next_is_eval = 0;
2906 switch (PL_regkind[OP(scan)]) {
2907 case WHILEM: /* End of (?:...)* . */
2908 scan = NEXTOPER(scan);
2911 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
2912 next = NEXTOPER(scan);
2913 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
2915 maxcount = REG_INFTY;
2916 next = regnext(scan);
2917 scan = NEXTOPER(scan);
2921 if (flags & SCF_DO_SUBSTR)
2926 if (flags & SCF_DO_STCLASS) {
2928 maxcount = REG_INFTY;
2929 next = regnext(scan);
2930 scan = NEXTOPER(scan);
2933 is_inf = is_inf_internal = 1;
2934 scan = regnext(scan);
2935 if (flags & SCF_DO_SUBSTR) {
2936 scan_commit(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */
2937 data->longest = &(data->longest_float);
2939 goto optimize_curly_tail;
2941 if (stopparen>0 && (OP(scan)==CURLYN || OP(scan)==CURLYM)
2942 && (scan->flags == stopparen))
2947 mincount = ARG1(scan);
2948 maxcount = ARG2(scan);
2950 next = regnext(scan);
2951 if (OP(scan) == CURLYX) {
2952 I32 lp = (data ? *(data->last_closep) : 0);
2953 scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX);
2955 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
2956 next_is_eval = (OP(scan) == EVAL);
2958 if (flags & SCF_DO_SUBSTR) {
2959 if (mincount == 0) scan_commit(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */
2960 pos_before = data->pos_min;
2964 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
2966 data->flags |= SF_IS_INF;
2968 if (flags & SCF_DO_STCLASS) {
2969 cl_init(pRExC_state, &this_class);
2970 oclass = data->start_class;
2971 data->start_class = &this_class;
2972 f |= SCF_DO_STCLASS_AND;
2973 f &= ~SCF_DO_STCLASS_OR;
2975 /* These are the cases when once a subexpression
2976 fails at a particular position, it cannot succeed
2977 even after backtracking at the enclosing scope.
2979 XXXX what if minimal match and we are at the
2980 initial run of {n,m}? */
2981 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
2982 f &= ~SCF_WHILEM_VISITED_POS;
2984 /* This will finish on WHILEM, setting scan, or on NULL: */
2985 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2986 last, data, stopparen, recursed, NULL,
2988 ? (f & ~SCF_DO_SUBSTR) : f),depth+1);
2990 if (flags & SCF_DO_STCLASS)
2991 data->start_class = oclass;
2992 if (mincount == 0 || minnext == 0) {
2993 if (flags & SCF_DO_STCLASS_OR) {
2994 cl_or(pRExC_state, data->start_class, &this_class);
2996 else if (flags & SCF_DO_STCLASS_AND) {
2997 /* Switch to OR mode: cache the old value of
2998 * data->start_class */
3000 StructCopy(data->start_class, and_withp,
3001 struct regnode_charclass_class);
3002 flags &= ~SCF_DO_STCLASS_AND;
3003 StructCopy(&this_class, data->start_class,
3004 struct regnode_charclass_class);
3005 flags |= SCF_DO_STCLASS_OR;
3006 data->start_class->flags |= ANYOF_EOS;
3008 } else { /* Non-zero len */
3009 if (flags & SCF_DO_STCLASS_OR) {
3010 cl_or(pRExC_state, data->start_class, &this_class);
3011 cl_and(data->start_class, and_withp);
3013 else if (flags & SCF_DO_STCLASS_AND)
3014 cl_and(data->start_class, &this_class);
3015 flags &= ~SCF_DO_STCLASS;
3017 if (!scan) /* It was not CURLYX, but CURLY. */
3019 if ( /* ? quantifier ok, except for (?{ ... }) */
3020 (next_is_eval || !(mincount == 0 && maxcount == 1))
3021 && (minnext == 0) && (deltanext == 0)
3022 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
3023 && maxcount <= REG_INFTY/3 /* Complement check for big count */
3024 && ckWARN(WARN_REGEXP))
3027 "Quantifier unexpected on zero-length expression");
3030 min += minnext * mincount;
3031 is_inf_internal |= ((maxcount == REG_INFTY
3032 && (minnext + deltanext) > 0)
3033 || deltanext == I32_MAX);
3034 is_inf |= is_inf_internal;
3035 delta += (minnext + deltanext) * maxcount - minnext * mincount;
3037 /* Try powerful optimization CURLYX => CURLYN. */
3038 if ( OP(oscan) == CURLYX && data
3039 && data->flags & SF_IN_PAR
3040 && !(data->flags & SF_HAS_EVAL)
3041 && !deltanext && minnext == 1 ) {
3042 /* Try to optimize to CURLYN. */
3043 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
3044 regnode * const nxt1 = nxt;
3051 if (!strchr((const char*)PL_simple,OP(nxt))
3052 && !(PL_regkind[OP(nxt)] == EXACT
3053 && STR_LEN(nxt) == 1))
3059 if (OP(nxt) != CLOSE)
3061 if (RExC_open_parens) {
3062 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3063 RExC_close_parens[ARG(nxt1)-1]=nxt+2; /*close->while*/
3065 /* Now we know that nxt2 is the only contents: */
3066 oscan->flags = (U8)ARG(nxt);
3068 OP(nxt1) = NOTHING; /* was OPEN. */
3071 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3072 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
3073 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
3074 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3075 OP(nxt + 1) = OPTIMIZED; /* was count. */
3076 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
3081 /* Try optimization CURLYX => CURLYM. */
3082 if ( OP(oscan) == CURLYX && data
3083 && !(data->flags & SF_HAS_PAR)
3084 && !(data->flags & SF_HAS_EVAL)
3085 && !deltanext /* atom is fixed width */
3086 && minnext != 0 /* CURLYM can't handle zero width */
3088 /* XXXX How to optimize if data == 0? */
3089 /* Optimize to a simpler form. */
3090 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
3094 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
3095 && (OP(nxt2) != WHILEM))
3097 OP(nxt2) = SUCCEED; /* Whas WHILEM */
3098 /* Need to optimize away parenths. */
3099 if (data->flags & SF_IN_PAR) {
3100 /* Set the parenth number. */
3101 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
3103 if (OP(nxt) != CLOSE)
3104 FAIL("Panic opt close");
3105 oscan->flags = (U8)ARG(nxt);
3106 if (RExC_open_parens) {
3107 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3108 RExC_close_parens[ARG(nxt1)-1]=nxt2+1; /*close->NOTHING*/
3110 OP(nxt1) = OPTIMIZED; /* was OPEN. */
3111 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3114 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3115 OP(nxt + 1) = OPTIMIZED; /* was count. */
3116 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
3117 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
3120 while ( nxt1 && (OP(nxt1) != WHILEM)) {
3121 regnode *nnxt = regnext(nxt1);
3124 if (reg_off_by_arg[OP(nxt1)])
3125 ARG_SET(nxt1, nxt2 - nxt1);
3126 else if (nxt2 - nxt1 < U16_MAX)
3127 NEXT_OFF(nxt1) = nxt2 - nxt1;
3129 OP(nxt) = NOTHING; /* Cannot beautify */
3134 /* Optimize again: */
3135 study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt,
3136 NULL, stopparen, recursed, NULL, 0,depth+1);
3141 else if ((OP(oscan) == CURLYX)
3142 && (flags & SCF_WHILEM_VISITED_POS)
3143 /* See the comment on a similar expression above.
3144 However, this time it not a subexpression
3145 we care about, but the expression itself. */
3146 && (maxcount == REG_INFTY)
3147 && data && ++data->whilem_c < 16) {
3148 /* This stays as CURLYX, we can put the count/of pair. */
3149 /* Find WHILEM (as in regexec.c) */
3150 regnode *nxt = oscan + NEXT_OFF(oscan);
3152 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
3154 PREVOPER(nxt)->flags = (U8)(data->whilem_c
3155 | (RExC_whilem_seen << 4)); /* On WHILEM */
3157 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
3159 if (flags & SCF_DO_SUBSTR) {
3160 SV *last_str = NULL;
3161 int counted = mincount != 0;
3163 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
3164 #if defined(SPARC64_GCC_WORKAROUND)
3167 const char *s = NULL;
3170 if (pos_before >= data->last_start_min)
3173 b = data->last_start_min;
3176 s = SvPV_const(data->last_found, l);
3177 old = b - data->last_start_min;
3180 I32 b = pos_before >= data->last_start_min
3181 ? pos_before : data->last_start_min;
3183 const char * const s = SvPV_const(data->last_found, l);
3184 I32 old = b - data->last_start_min;
3188 old = utf8_hop((U8*)s, old) - (U8*)s;
3191 /* Get the added string: */
3192 last_str = newSVpvn(s + old, l);
3194 SvUTF8_on(last_str);
3195 if (deltanext == 0 && pos_before == b) {
3196 /* What was added is a constant string */
3198 SvGROW(last_str, (mincount * l) + 1);
3199 repeatcpy(SvPVX(last_str) + l,
3200 SvPVX_const(last_str), l, mincount - 1);
3201 SvCUR_set(last_str, SvCUR(last_str) * mincount);
3202 /* Add additional parts. */
3203 SvCUR_set(data->last_found,
3204 SvCUR(data->last_found) - l);
3205 sv_catsv(data->last_found, last_str);
3207 SV * sv = data->last_found;
3209 SvUTF8(sv) && SvMAGICAL(sv) ?
3210 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3211 if (mg && mg->mg_len >= 0)
3212 mg->mg_len += CHR_SVLEN(last_str);
3214 data->last_end += l * (mincount - 1);
3217 /* start offset must point into the last copy */
3218 data->last_start_min += minnext * (mincount - 1);
3219 data->last_start_max += is_inf ? I32_MAX
3220 : (maxcount - 1) * (minnext + data->pos_delta);
3223 /* It is counted once already... */
3224 data->pos_min += minnext * (mincount - counted);
3225 data->pos_delta += - counted * deltanext +
3226 (minnext + deltanext) * maxcount - minnext * mincount;
3227 if (mincount != maxcount) {
3228 /* Cannot extend fixed substrings found inside
3230 scan_commit(pRExC_state,data,minlenp);
3231 if (mincount && last_str) {
3232 SV * const sv = data->last_found;
3233 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3234 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3238 sv_setsv(sv, last_str);
3239 data->last_end = data->pos_min;
3240 data->last_start_min =
3241 data->pos_min - CHR_SVLEN(last_str);
3242 data->last_start_max = is_inf
3244 : data->pos_min + data->pos_delta
3245 - CHR_SVLEN(last_str);
3247 data->longest = &(data->longest_float);
3249 SvREFCNT_dec(last_str);
3251 if (data && (fl & SF_HAS_EVAL))
3252 data->flags |= SF_HAS_EVAL;
3253 optimize_curly_tail:
3254 if (OP(oscan) != CURLYX) {
3255 while (PL_regkind[OP(next = regnext(oscan))] == NOTHING
3257 NEXT_OFF(oscan) += NEXT_OFF(next);
3260 default: /* REF and CLUMP only? */
3261 if (flags & SCF_DO_SUBSTR) {
3262 scan_commit(pRExC_state,data,minlenp); /* Cannot expect anything... */
3263 data->longest = &(data->longest_float);
3265 is_inf = is_inf_internal = 1;
3266 if (flags & SCF_DO_STCLASS_OR)
3267 cl_anything(pRExC_state, data->start_class);
3268 flags &= ~SCF_DO_STCLASS;
3272 else if (strchr((const char*)PL_simple,OP(scan))) {
3275 if (flags & SCF_DO_SUBSTR) {
3276 scan_commit(pRExC_state,data,minlenp);
3280 if (flags & SCF_DO_STCLASS) {
3281 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3283 /* Some of the logic below assumes that switching
3284 locale on will only add false positives. */
3285 switch (PL_regkind[OP(scan)]) {
3289 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
3290 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3291 cl_anything(pRExC_state, data->start_class);
3294 if (OP(scan) == SANY)
3296 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
3297 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
3298 || (data->start_class->flags & ANYOF_CLASS));
3299 cl_anything(pRExC_state, data->start_class);
3301 if (flags & SCF_DO_STCLASS_AND || !value)
3302 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
3305 if (flags & SCF_DO_STCLASS_AND)
3306 cl_and(data->start_class,
3307 (struct regnode_charclass_class*)scan);
3309 cl_or(pRExC_state, data->start_class,
3310 (struct regnode_charclass_class*)scan);
3313 if (flags & SCF_DO_STCLASS_AND) {
3314 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3315 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3316 for (value = 0; value < 256; value++)
3317 if (!isALNUM(value))
3318 ANYOF_BITMAP_CLEAR(data->start_class, value);
3322 if (data->start_class->flags & ANYOF_LOCALE)
3323 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3325 for (value = 0; value < 256; value++)
3327 ANYOF_BITMAP_SET(data->start_class, value);
3332 if (flags & SCF_DO_STCLASS_AND) {
3333 if (data->start_class->flags & ANYOF_LOCALE)
3334 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3337 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3338 data->start_class->flags |= ANYOF_LOCALE;
3342 if (flags & SCF_DO_STCLASS_AND) {
3343 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3344 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3345 for (value = 0; value < 256; value++)
3347 ANYOF_BITMAP_CLEAR(data->start_class, value);
3351 if (data->start_class->flags & ANYOF_LOCALE)
3352 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3354 for (value = 0; value < 256; value++)
3355 if (!isALNUM(value))
3356 ANYOF_BITMAP_SET(data->start_class, value);
3361 if (flags & SCF_DO_STCLASS_AND) {
3362 if (data->start_class->flags & ANYOF_LOCALE)
3363 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3366 data->start_class->flags |= ANYOF_LOCALE;
3367 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3371 if (flags & SCF_DO_STCLASS_AND) {
3372 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3373 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3374 for (value = 0; value < 256; value++)
3375 if (!isSPACE(value))
3376 ANYOF_BITMAP_CLEAR(data->start_class, value);
3380 if (data->start_class->flags & ANYOF_LOCALE)
3381 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3383 for (value = 0; value < 256; value++)
3385 ANYOF_BITMAP_SET(data->start_class, value);
3390 if (flags & SCF_DO_STCLASS_AND) {
3391 if (data->start_class->flags & ANYOF_LOCALE)
3392 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3395 data->start_class->flags |= ANYOF_LOCALE;
3396 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3400 if (flags & SCF_DO_STCLASS_AND) {
3401 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3402 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3403 for (value = 0; value < 256; value++)
3405 ANYOF_BITMAP_CLEAR(data->start_class, value);
3409 if (data->start_class->flags & ANYOF_LOCALE)
3410 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3412 for (value = 0; value < 256; value++)
3413 if (!isSPACE(value))
3414 ANYOF_BITMAP_SET(data->start_class, value);
3419 if (flags & SCF_DO_STCLASS_AND) {
3420 if (data->start_class->flags & ANYOF_LOCALE) {
3421 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3422 for (value = 0; value < 256; value++)
3423 if (!isSPACE(value))
3424 ANYOF_BITMAP_CLEAR(data->start_class, value);
3428 data->start_class->flags |= ANYOF_LOCALE;
3429 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3433 if (flags & SCF_DO_STCLASS_AND) {
3434 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
3435 for (value = 0; value < 256; value++)
3436 if (!isDIGIT(value))
3437 ANYOF_BITMAP_CLEAR(data->start_class, value);
3440 if (data->start_class->flags & ANYOF_LOCALE)
3441 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
3443 for (value = 0; value < 256; value++)
3445 ANYOF_BITMAP_SET(data->start_class, value);
3450 if (flags & SCF_DO_STCLASS_AND) {
3451 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
3452 for (value = 0; value < 256; value++)
3454 ANYOF_BITMAP_CLEAR(data->start_class, value);
3457 if (data->start_class->flags & ANYOF_LOCALE)
3458 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
3460 for (value = 0; value < 256; value++)
3461 if (!isDIGIT(value))
3462 ANYOF_BITMAP_SET(data->start_class, value);
3467 if (flags & SCF_DO_STCLASS_OR)
3468 cl_and(data->start_class, and_withp);
3469 flags &= ~SCF_DO_STCLASS;
3472 else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
3473 data->flags |= (OP(scan) == MEOL
3477 else if ( PL_regkind[OP(scan)] == BRANCHJ
3478 /* Lookbehind, or need to calculate parens/evals/stclass: */
3479 && (scan->flags || data || (flags & SCF_DO_STCLASS))
3480 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
3481 if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3482 || OP(scan) == UNLESSM )
3484 /* Negative Lookahead/lookbehind
3485 In this case we can't do fixed string optimisation.
3488 I32 deltanext, minnext, fake = 0;
3490 struct regnode_charclass_class intrnl;
3493 data_fake.flags = 0;
3495 data_fake.whilem_c = data->whilem_c;
3496 data_fake.last_closep = data->last_closep;
3499 data_fake.last_closep = &fake;
3500 data_fake.pos_delta = delta;
3501 if ( flags & SCF_DO_STCLASS && !scan->flags
3502 && OP(scan) == IFMATCH ) { /* Lookahead */
3503 cl_init(pRExC_state, &intrnl);
3504 data_fake.start_class = &intrnl;
3505 f |= SCF_DO_STCLASS_AND;
3507 if (flags & SCF_WHILEM_VISITED_POS)
3508 f |= SCF_WHILEM_VISITED_POS;
3509 next = regnext(scan);
3510 nscan = NEXTOPER(NEXTOPER(scan));
3511 minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext,
3512 last, &data_fake, stopparen, recursed, NULL, f, depth+1);
3515 FAIL("Variable length lookbehind not implemented");
3517 else if (minnext > (I32)U8_MAX) {
3518 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3520 scan->flags = (U8)minnext;
3523 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3525 if (data_fake.flags & SF_HAS_EVAL)
3526 data->flags |= SF_HAS_EVAL;
3527 data->whilem_c = data_fake.whilem_c;
3529 if (f & SCF_DO_STCLASS_AND) {
3530 const int was = (data->start_class->flags & ANYOF_EOS);
3532 cl_and(data->start_class, &intrnl);
3534 data->start_class->flags |= ANYOF_EOS;
3537 #if PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3539 /* Positive Lookahead/lookbehind
3540 In this case we can do fixed string optimisation,
3541 but we must be careful about it. Note in the case of
3542 lookbehind the positions will be offset by the minimum
3543 length of the pattern, something we won't know about
3544 until after the recurse.
3546 I32 deltanext, fake = 0;
3548 struct regnode_charclass_class intrnl;
3550 /* We use SAVEFREEPV so that when the full compile
3551 is finished perl will clean up the allocated
3552 minlens when its all done. This was we don't
3553 have to worry about freeing them when we know
3554 they wont be used, which would be a pain.
3557 Newx( minnextp, 1, I32 );
3558 SAVEFREEPV(minnextp);
3561 StructCopy(data, &data_fake, scan_data_t);
3562 if ((flags & SCF_DO_SUBSTR) && data->last_found) {
3565 scan_commit(pRExC_state, &data_fake,minlenp);
3566 data_fake.last_found=newSVsv(data->last_found);
3570 data_fake.last_closep = &fake;
3571 data_fake.flags = 0;
3572 data_fake.pos_delta = delta;
3574 data_fake.flags |= SF_IS_INF;
3575 if ( flags & SCF_DO_STCLASS && !scan->flags
3576 && OP(scan) == IFMATCH ) { /* Lookahead */
3577 cl_init(pRExC_state, &intrnl);
3578 data_fake.start_class = &intrnl;
3579 f |= SCF_DO_STCLASS_AND;
3581 if (flags & SCF_WHILEM_VISITED_POS)
3582 f |= SCF_WHILEM_VISITED_POS;
3583 next = regnext(scan);
3584 nscan = NEXTOPER(NEXTOPER(scan));
3586 *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext,
3587 last, &data_fake, stopparen, recursed, NULL, f,depth+1);
3590 FAIL("Variable length lookbehind not implemented");
3592 else if (*minnextp > (I32)U8_MAX) {
3593 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
3595 scan->flags = (U8)*minnextp;
3600 if (f & SCF_DO_STCLASS_AND) {
3601 const int was = (data->start_class->flags & ANYOF_EOS);
3603 cl_and(data->start_class, &intrnl);
3605 data->start_class->flags |= ANYOF_EOS;
3608 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3610 if (data_fake.flags & SF_HAS_EVAL)
3611 data->flags |= SF_HAS_EVAL;
3612 data->whilem_c = data_fake.whilem_c;
3613 if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) {
3614 if (RExC_rx->minlen<*minnextp)
3615 RExC_rx->minlen=*minnextp;
3616 scan_commit(pRExC_state, &data_fake, minnextp);
3617 SvREFCNT_dec(data_fake.last_found);
3619 if ( data_fake.minlen_fixed != minlenp )
3621 data->offset_fixed= data_fake.offset_fixed;
3622 data->minlen_fixed= data_fake.minlen_fixed;
3623 data->lookbehind_fixed+= scan->flags;
3625 if ( data_fake.minlen_float != minlenp )
3627 data->minlen_float= data_fake.minlen_float;
3628 data->offset_float_min=data_fake.offset_float_min;
3629 data->offset_float_max=data_fake.offset_float_max;
3630 data->lookbehind_float+= scan->flags;
3639 else if (OP(scan) == OPEN) {
3640 if (stopparen != (I32)ARG(scan))
3643 else if (OP(scan) == CLOSE) {
3644 if (stopparen == (I32)ARG(scan)) {
3647 if ((I32)ARG(scan) == is_par) {
3648 next = regnext(scan);
3650 if ( next && (OP(next) != WHILEM) && next < last)
3651 is_par = 0; /* Disable optimization */
3654 *(data->last_closep) = ARG(scan);
3656 else if (OP(scan) == EVAL) {
3658 data->flags |= SF_HAS_EVAL;
3660 else if ( PL_regkind[OP(scan)] == ENDLIKE ) {
3661 if (flags & SCF_DO_SUBSTR) {
3662 scan_commit(pRExC_state,data,minlenp);
3663 flags &= ~SCF_DO_SUBSTR;
3665 if (data && OP(scan)==ACCEPT) {
3666 data->flags |= SCF_SEEN_ACCEPT;
3671 else if (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */
3673 if (flags & SCF_DO_SUBSTR) {
3674 scan_commit(pRExC_state,data,minlenp);
3675 data->longest = &(data->longest_float);
3677 is_inf = is_inf_internal = 1;
3678 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3679 cl_anything(pRExC_state, data->start_class);
3680 flags &= ~SCF_DO_STCLASS;
3682 else if (OP(scan) == GPOS) {
3683 if (!(RExC_rx->extflags & RXf_GPOS_FLOAT) &&
3684 !(delta || is_inf || (data && data->pos_delta)))
3686 if (!(RExC_rx->extflags & RXf_ANCH) && (flags & SCF_DO_SUBSTR))
3687 RExC_rx->extflags |= RXf_ANCH_GPOS;
3688 if (RExC_rx->gofs < (U32)min)
3689 RExC_rx->gofs = min;
3691 RExC_rx->extflags |= RXf_GPOS_FLOAT;
3695 #ifdef TRIE_STUDY_OPT
3696 #ifdef FULL_TRIE_STUDY
3697 else if (PL_regkind[OP(scan)] == TRIE) {
3698 /* NOTE - There is similar code to this block above for handling
3699 BRANCH nodes on the initial study. If you change stuff here
3701 regnode *trie_node= scan;
3702 regnode *tail= regnext(scan);
3703 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
3704 I32 max1 = 0, min1 = I32_MAX;
3705 struct regnode_charclass_class accum;
3707 if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */
3708 scan_commit(pRExC_state, data,minlenp); /* Cannot merge strings after this. */
3709 if (flags & SCF_DO_STCLASS)
3710 cl_init_zero(pRExC_state, &accum);
3716 const regnode *nextbranch= NULL;
3719 for ( word=1 ; word <= trie->wordcount ; word++)
3721 I32 deltanext=0, minnext=0, f = 0, fake;
3722 struct regnode_charclass_class this_class;
3724 data_fake.flags = 0;
3726 data_fake.whilem_c = data->whilem_c;
3727 data_fake.last_closep = data->last_closep;
3730 data_fake.last_closep = &fake;
3731 data_fake.pos_delta = delta;
3732 if (flags & SCF_DO_STCLASS) {
3733 cl_init(pRExC_state, &this_class);
3734 data_fake.start_class = &this_class;
3735 f = SCF_DO_STCLASS_AND;
3737 if (flags & SCF_WHILEM_VISITED_POS)
3738 f |= SCF_WHILEM_VISITED_POS;
3740 if (trie->jump[word]) {
3742 nextbranch = trie_node + trie->jump[0];
3743 scan= trie_node + trie->jump[word];
3744 /* We go from the jump point to the branch that follows
3745 it. Note this means we need the vestigal unused branches
3746 even though they arent otherwise used.
3748 minnext = study_chunk(pRExC_state, &scan, minlenp,
3749 &deltanext, (regnode *)nextbranch, &data_fake,
3750 stopparen, recursed, NULL, f,depth+1);
3752 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
3753 nextbranch= regnext((regnode*)nextbranch);
3755 if (min1 > (I32)(minnext + trie->minlen))
3756 min1 = minnext + trie->minlen;
3757 if (max1 < (I32)(minnext + deltanext + trie->maxlen))
3758 max1 = minnext + deltanext + trie->maxlen;
3759 if (deltanext == I32_MAX)
3760 is_inf = is_inf_internal = 1;
3762 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3764 if (data_fake.flags & SCF_SEEN_ACCEPT) {
3765 if ( stopmin > min + min1)
3766 stopmin = min + min1;
3767 flags &= ~SCF_DO_SUBSTR;
3769 data->flags |= SCF_SEEN_ACCEPT;
3772 if (data_fake.flags & SF_HAS_EVAL)
3773 data->flags |= SF_HAS_EVAL;
3774 data->whilem_c = data_fake.whilem_c;
3776 if (flags & SCF_DO_STCLASS)
3777 cl_or(pRExC_state, &accum, &this_class);
3780 if (flags & SCF_DO_SUBSTR) {
3781 data->pos_min += min1;
3782 data->pos_delta += max1 - min1;
3783 if (max1 != min1 || is_inf)
3784 data->longest = &(data->longest_float);
3787 delta += max1 - min1;
3788 if (flags & SCF_DO_STCLASS_OR) {
3789 cl_or(pRExC_state, data->start_class, &accum);
3791 cl_and(data->start_class, and_withp);
3792 flags &= ~SCF_DO_STCLASS;
3795 else if (flags & SCF_DO_STCLASS_AND) {
3797 cl_and(data->start_class, &accum);
3798 flags &= ~SCF_DO_STCLASS;
3801 /* Switch to OR mode: cache the old value of
3802 * data->start_class */
3804 StructCopy(data->start_class, and_withp,
3805 struct regnode_charclass_class);
3806 flags &= ~SCF_DO_STCLASS_AND;
3807 StructCopy(&accum, data->start_class,
3808 struct regnode_charclass_class);
3809 flags |= SCF_DO_STCLASS_OR;
3810 data->start_class->flags |= ANYOF_EOS;
3817 else if (PL_regkind[OP(scan)] == TRIE) {
3818 reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ];
3821 min += trie->minlen;
3822 delta += (trie->maxlen - trie->minlen);
3823 flags &= ~SCF_DO_STCLASS; /* xxx */
3824 if (flags & SCF_DO_SUBSTR) {
3825 scan_commit(pRExC_state,data,minlenp); /* Cannot expect anything... */
3826 data->pos_min += trie->minlen;
3827 data->pos_delta += (trie->maxlen - trie->minlen);
3828 if (trie->maxlen != trie->minlen)
3829 data->longest = &(data->longest_float);
3831 if (trie->jump) /* no more substrings -- for now /grr*/
3832 flags &= ~SCF_DO_SUBSTR;
3834 #endif /* old or new */
3835 #endif /* TRIE_STUDY_OPT */
3836 /* Else: zero-length, ignore. */
3837 scan = regnext(scan);
3842 stopparen = frame->stop;
3843 frame = frame->prev;
3844 goto fake_study_recurse;
3851 *deltap = is_inf_internal ? I32_MAX : delta;
3852 if (flags & SCF_DO_SUBSTR && is_inf)
3853 data->pos_delta = I32_MAX - data->pos_min;
3854 if (is_par > (I32)U8_MAX)
3856 if (is_par && pars==1 && data) {
3857 data->flags |= SF_IN_PAR;
3858 data->flags &= ~SF_HAS_PAR;
3860 else if (pars && data) {
3861 data->flags |= SF_HAS_PAR;
3862 data->flags &= ~SF_IN_PAR;
3864 if (flags & SCF_DO_STCLASS_OR)
3865 cl_and(data->start_class, and_withp);
3866 if (flags & SCF_TRIE_RESTUDY)
3867 data->flags |= SCF_TRIE_RESTUDY;
3869 DEBUG_STUDYDATA(data,depth);
3871 return min < stopmin ? min : stopmin;
3875 S_add_data(RExC_state_t *pRExC_state, U32 n, const char *s)
3877 U32 count = RExC_rxi->data ? RExC_rxi->data->count : 0;
3879 Renewc(RExC_rxi->data,
3880 sizeof(*RExC_rxi->data) + sizeof(void*) * (count + n - 1),
3881 char, struct reg_data);
3883 Renew(RExC_rxi->data->what, count + n, U8);
3885 Newx(RExC_rxi->data->what, n, U8);
3886 RExC_rxi->data->count = count + n;
3887 Copy(s, RExC_rxi->data->what + count, n, U8);
3891 #ifndef PERL_IN_XSUB_RE
3893 Perl_reginitcolors(pTHX)
3896 const char * const s = PerlEnv_getenv("PERL_RE_COLORS");
3898 char *t = savepv(s);
3902 t = strchr(t, '\t');
3908 PL_colors[i] = t = (char *)"";
3913 PL_colors[i++] = (char *)"";
3920 #ifdef TRIE_STUDY_OPT
3921 #define CHECK_RESTUDY_GOTO \
3923 (data.flags & SCF_TRIE_RESTUDY) \
3927 #define CHECK_RESTUDY_GOTO
3931 - pregcomp - compile a regular expression into internal code
3933 * We can't allocate space until we know how big the compiled form will be,
3934 * but we can't compile it (and thus know how big it is) until we've got a
3935 * place to put the code. So we cheat: we compile it twice, once with code
3936 * generation turned off and size counting turned on, and once "for real".
3937 * This also means that we don't allocate space until we are sure that the
3938 * thing really will compile successfully, and we never have to move the
3939 * code and thus invalidate pointers into it. (Note that it has to be in
3940 * one piece because free() must be able to free it all.) [NB: not true in perl]
3942 * Beware that the optimization-preparation code in here knows about some
3943 * of the structure of the compiled regexp. [I'll say.]
3948 #ifndef PERL_IN_XSUB_RE
3949 #define RE_ENGINE_PTR &PL_core_reg_engine
3951 extern const struct regexp_engine my_reg_engine;
3952 #define RE_ENGINE_PTR &my_reg_engine
3954 /* these make a few things look better, to avoid indentation */
3955 #define BEGIN_BLOCK {
3959 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
3962 GET_RE_DEBUG_FLAGS_DECL;
3963 DEBUG_r(if (!PL_colorset) reginitcolors());
3964 #ifndef PERL_IN_XSUB_RE
3966 /* Dispatch a request to compile a regexp to correct
3968 HV * const table = GvHV(PL_hintgv);
3970 SV **ptr= hv_fetchs(table, "regcomp", FALSE);
3971 if (ptr && SvIOK(*ptr) && SvIV(*ptr)) {
3972 const regexp_engine *eng=INT2PTR(regexp_engine*,SvIV(*ptr));
3974 PerlIO_printf(Perl_debug_log, "Using engine %"UVxf"\n",
3977 return CALLREGCOMP_ENG(eng, exp, xend, pm);
3984 register regexp_internal *ri;
3992 RExC_state_t RExC_state;
3993 RExC_state_t * const pRExC_state = &RExC_state;
3994 #ifdef TRIE_STUDY_OPT
3996 RExC_state_t copyRExC_state;
3999 FAIL("NULL regexp argument");
4001 RExC_utf8 = pm->op_pmdynflags & PMdf_CMP_UTF8;
4005 SV *dsv= sv_newmortal();
4006 RE_PV_QUOTED_DECL(s, RExC_utf8,
4007 dsv, RExC_precomp, (xend - exp), 60);
4008 PerlIO_printf(Perl_debug_log, "%sCompiling REx%s %s\n",
4009 PL_colors[4],PL_colors[5],s);
4011 RExC_flags = pm->op_pmflags;
4015 RExC_seen_zerolen = *exp == '^' ? -1 : 0;
4016 RExC_seen_evals = 0;
4019 /* First pass: determine size, legality. */
4028 RExC_emit = &PL_regdummy;
4029 RExC_whilem_seen = 0;
4030 RExC_charnames = NULL;
4031 RExC_open_parens = NULL;
4032 RExC_close_parens = NULL;
4034 RExC_paren_names = NULL;
4035 RExC_recurse = NULL;
4036 RExC_recurse_count = 0;
4038 #if 0 /* REGC() is (currently) a NOP at the first pass.
4039 * Clever compilers notice this and complain. --jhi */
4040 REGC((U8)REG_MAGIC, (char*)RExC_emit);
4042 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "Starting first pass (sizing)\n"));
4043 if (reg(pRExC_state, 0, &flags,1) == NULL) {
4044 RExC_precomp = NULL;
4048 PerlIO_printf(Perl_debug_log,
4049 "Required size %"IVdf" nodes\n"
4050 "Starting second pass (creation)\n",
4053 RExC_lastparse=NULL;
4055 /* Small enough for pointer-storage convention?
4056 If extralen==0, this means that we will not need long jumps. */
4057 if (RExC_size >= 0x10000L && RExC_extralen)
4058 RExC_size += RExC_extralen;
4061 if (RExC_whilem_seen > 15)
4062 RExC_whilem_seen = 15;
4065 /* Make room for a sentinel value at the end of the program */
4069 /* Allocate space and zero-initialize. Note, the two step process
4070 of zeroing when in debug mode, thus anything assigned has to
4071 happen after that */
4072 Newxz(r, 1, regexp);
4073 Newxc(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode),
4074 char, regexp_internal);
4075 if ( r == NULL || ri == NULL )
4076 FAIL("Regexp out of space");
4078 /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */
4079 Zero(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode), char);
4081 /* bulk initialize base fields with 0. */
4082 Zero(ri, sizeof(regexp_internal), char);
4085 /* non-zero initialization begins here */
4087 r->engine= RE_ENGINE_PTR;
4089 r->prelen = xend - exp;
4090 r->precomp = savepvn(RExC_precomp, r->prelen);
4091 r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4093 r->nparens = RExC_npar - 1; /* set early to validate backrefs */
4095 if (RExC_seen & REG_SEEN_RECURSE) {
4096 Newxz(RExC_open_parens, RExC_npar,regnode *);
4097 SAVEFREEPV(RExC_open_parens);
4098 Newxz(RExC_close_parens,RExC_npar,regnode *);
4099 SAVEFREEPV(RExC_close_parens);
4102 /* Useful during FAIL. */
4103 Newxz(ri->offsets, 2*RExC_size+1, U32); /* MJD 20001228 */
4105 ri->offsets[0] = RExC_size;
4107 DEBUG_OFFSETS_r(PerlIO_printf(Perl_debug_log,
4108 "%s %"UVuf" bytes for offset annotations.\n",
4109 ri->offsets ? "Got" : "Couldn't get",
4110 (UV)((2*RExC_size+1) * sizeof(U32))));
4115 /* Second pass: emit code. */
4116 RExC_flags = pm->op_pmflags; /* don't let top level (?i) bleed */
4122 RExC_emit_start = ri->program;
4123 RExC_emit = ri->program;
4125 /* put a sentinal on the end of the program so we can check for
4127 ri->program[RExC_size].type = 255;
4129 /* Store the count of eval-groups for security checks: */
4130 RExC_emit->next_off = (RExC_seen_evals > (I32)U16_MAX) ? U16_MAX : (U16)RExC_seen_evals;
4131 REGC((U8)REG_MAGIC, (char*) RExC_emit++);
4132 if (reg(pRExC_state, 0, &flags,1) == NULL)
4135 /* XXXX To minimize changes to RE engine we always allocate
4136 3-units-long substrs field. */
4137 Newx(r->substrs, 1, struct reg_substr_data);
4138 if (RExC_recurse_count) {
4139 Newxz(RExC_recurse,RExC_recurse_count,regnode *);
4140 SAVEFREEPV(RExC_recurse);
4144 r->minlen = minlen = sawplus = sawopen = 0;
4145 Zero(r->substrs, 1, struct reg_substr_data);
4147 #ifdef TRIE_STUDY_OPT
4150 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log,"Restudying\n"));
4152 RExC_state = copyRExC_state;
4153 if (seen & REG_TOP_LEVEL_BRANCHES)
4154 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
4156 RExC_seen &= ~REG_TOP_LEVEL_BRANCHES;
4157 if (data.last_found) {
4158 SvREFCNT_dec(data.longest_fixed);
4159 SvREFCNT_dec(data.longest_float);
4160 SvREFCNT_dec(data.last_found);
4162 StructCopy(&zero_scan_data, &data, scan_data_t);
4164 StructCopy(&zero_scan_data, &data, scan_data_t);
4165 copyRExC_state = RExC_state;
4168 StructCopy(&zero_scan_data, &data, scan_data_t);
4171 /* Dig out information for optimizations. */
4172 r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME; /* Again? */
4173 pm->op_pmflags = RExC_flags;
4175 r->extflags |= RXf_UTF8; /* Unicode in it? */
4176 ri->regstclass = NULL;
4177 if (RExC_naughty >= 10) /* Probably an expensive pattern. */
4178 r->intflags |= PREGf_NAUGHTY;
4179 scan = ri->program + 1; /* First BRANCH. */
4181 /* testing for BRANCH here tells us whether there is "must appear"
4182 data in the pattern. If there is then we can use it for optimisations */
4183 if (!(RExC_seen & REG_TOP_LEVEL_BRANCHES)) { /* Only one top-level choice. */
4185 STRLEN longest_float_length, longest_fixed_length;
4186 struct regnode_charclass_class ch_class; /* pointed to by data */
4188 I32 last_close = 0; /* pointed to by data */
4191 /* Skip introductions and multiplicators >= 1. */
4192 while ((OP(first) == OPEN && (sawopen = 1)) ||
4193 /* An OR of *one* alternative - should not happen now. */
4194 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
4195 /* for now we can't handle lookbehind IFMATCH*/
4196 (OP(first) == IFMATCH && !first->flags) ||
4197 (OP(first) == PLUS) ||
4198 (OP(first) == MINMOD) ||
4199 /* An {n,m} with n>0 */
4200 (PL_regkind[OP(first)] == CURLY && ARG1(first) > 0) )
4203 if (OP(first) == PLUS)
4206 first += regarglen[OP(first)];
4207 if (OP(first) == IFMATCH) {
4208 first = NEXTOPER(first);
4209 first += EXTRA_STEP_2ARGS;
4210 } else /* XXX possible optimisation for /(?=)/ */
4211 first = NEXTOPER(first);
4214 /* Starting-point info. */
4216 DEBUG_PEEP("first:",first,0);
4217 /* Ignore EXACT as we deal with it later. */
4218 if (PL_regkind[OP(first)] == EXACT) {
4219 if (OP(first) == EXACT)
4220 NOOP; /* Empty, get anchored substr later. */
4221 else if ((OP(first) == EXACTF || OP(first) == EXACTFL))
4222 ri->regstclass = first;
4225 else if (PL_regkind[OP(first)] == TRIE &&
4226 ((reg_trie_data *)ri->data->data[ ARG(first) ])->minlen>0)
4229 /* this can happen only on restudy */
4230 if ( OP(first) == TRIE ) {
4231 struct regnode_1 *trieop =
4232 PerlMemShared_calloc(1, sizeof(struct regnode_1));
4233 StructCopy(first,trieop,struct regnode_1);
4234 trie_op=(regnode *)trieop;
4236 struct regnode_charclass *trieop =
4237 PerlMemShared_calloc(1, sizeof(struct regnode_charclass));
4238 StructCopy(first,trieop,struct regnode_charclass);
4239 trie_op=(regnode *)trieop;
4242 make_trie_failtable(pRExC_state, (regnode *)first, trie_op, 0);
4243 ri->regstclass = trie_op;
4246 else if (strchr((const char*)PL_simple,OP(first)))
4247 ri->regstclass = first;
4248 else if (PL_regkind[OP(first)] == BOUND ||
4249 PL_regkind[OP(first)] == NBOUND)
4250 ri->regstclass = first;
4251 else if (PL_regkind[OP(first)] == BOL) {
4252 r->extflags |= (OP(first) == MBOL
4254 : (OP(first) == SBOL
4257 first = NEXTOPER(first);
4260 else if (OP(first) == GPOS) {
4261 r->extflags |= RXf_ANCH_GPOS;
4262 first = NEXTOPER(first);
4265 else if ((!sawopen || !RExC_sawback) &&
4266 (OP(first) == STAR &&
4267 PL_regkind[OP(NEXTOPER(first))] == REG_ANY) &&
4268 !(r->extflags & RXf_ANCH) && !(RExC_seen & REG_SEEN_EVAL))
4270 /* turn .* into ^.* with an implied $*=1 */
4272 (OP(NEXTOPER(first)) == REG_ANY)
4275 r->extflags |= type;
4276 r->intflags |= PREGf_IMPLICIT;
4277 first = NEXTOPER(first);
4280 if (sawplus && (!sawopen || !RExC_sawback)
4281 && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */
4282 /* x+ must match at the 1st pos of run of x's */
4283 r->intflags |= PREGf_SKIP;
4285 /* Scan is after the zeroth branch, first is atomic matcher. */
4286 #ifdef TRIE_STUDY_OPT
4289 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4290 (IV)(first - scan + 1))
4294 PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n",
4295 (IV)(first - scan + 1))
4301 * If there's something expensive in the r.e., find the
4302 * longest literal string that must appear and make it the
4303 * regmust. Resolve ties in favor of later strings, since
4304 * the regstart check works with the beginning of the r.e.
4305 * and avoiding duplication strengthens checking. Not a
4306 * strong reason, but sufficient in the absence of others.
4307 * [Now we resolve ties in favor of the earlier string if
4308 * it happens that c_offset_min has been invalidated, since the
4309 * earlier string may buy us something the later one won't.]
4312 data.longest_fixed = newSVpvs("");
4313 data.longest_float = newSVpvs("");
4314 data.last_found = newSVpvs("");
4315 data.longest = &(data.longest_fixed);
4317 if (!ri->regstclass) {
4318 cl_init(pRExC_state, &ch_class);
4319 data.start_class = &ch_class;
4320 stclass_flag = SCF_DO_STCLASS_AND;
4321 } else /* XXXX Check for BOUND? */
4323 data.last_closep = &last_close;
4325 minlen = study_chunk(pRExC_state, &first, &minlen, &fake, scan + RExC_size, /* Up to end */
4326 &data, -1, NULL, NULL,
4327 SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag,0);
4333 if ( RExC_npar == 1 && data.longest == &(data.longest_fixed)
4334 && data.last_start_min == 0 && data.last_end > 0
4335 && !RExC_seen_zerolen
4336 && (!(RExC_seen & REG_SEEN_GPOS) || (r->extflags & RXf_ANCH_GPOS)))
4337 r->extflags |= RXf_CHECK_ALL;
4338 scan_commit(pRExC_state, &data,&minlen);
4339 SvREFCNT_dec(data.last_found);
4341 /* Note that code very similar to this but for anchored string
4342 follows immediately below, changes may need to be made to both.
4345 longest_float_length = CHR_SVLEN(data.longest_float);
4346 if (longest_float_length
4347 || (data.flags & SF_FL_BEFORE_EOL
4348 && (!(data.flags & SF_FL_BEFORE_MEOL)
4349 || (RExC_flags & RXf_PMf_MULTILINE))))
4353 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
4354 && data.offset_fixed == data.offset_float_min
4355 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
4356 goto remove_float; /* As in (a)+. */
4358 /* copy the information about the longest float from the reg_scan_data
4359 over to the program. */
4360 if (SvUTF8(data.longest_float)) {
4361 r->float_utf8 = data.longest_float;
4362 r->float_substr = NULL;
4364 r->float_substr = data.longest_float;
4365 r->float_utf8 = NULL;
4367 /* float_end_shift is how many chars that must be matched that
4368 follow this item. We calculate it ahead of time as once the
4369 lookbehind offset is added in we lose the ability to correctly
4371 ml = data.minlen_float ? *(data.minlen_float)
4372 : (I32)longest_float_length;
4373 r->float_end_shift = ml - data.offset_float_min
4374 - longest_float_length + (SvTAIL(data.longest_float) != 0)
4375 + data.lookbehind_float;
4376 r->float_min_offset = data.offset_float_min - data.lookbehind_float;
4377 r->float_max_offset = data.offset_float_max;
4378 if (data.offset_float_max < I32_MAX) /* Don't offset infinity */
4379 r->float_max_offset -= data.lookbehind_float;
4381 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
4382 && (!(data.flags & SF_FL_BEFORE_MEOL)
4383 || (RExC_flags & RXf_PMf_MULTILINE)));
4384 fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0);
4388 r->float_substr = r->float_utf8 = NULL;
4389 SvREFCNT_dec(data.longest_float);
4390 longest_float_length = 0;
4393 /* Note that code very similar to this but for floating string
4394 is immediately above, changes may need to be made to both.
4397 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
4398 if (longest_fixed_length
4399 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
4400 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4401 || (RExC_flags & RXf_PMf_MULTILINE))))
4405 /* copy the information about the longest fixed
4406 from the reg_scan_data over to the program. */
4407 if (SvUTF8(data.longest_fixed)) {
4408 r->anchored_utf8 = data.longest_fixed;
4409 r->anchored_substr = NULL;
4411 r->anchored_substr = data.longest_fixed;
4412 r->anchored_utf8 = NULL;
4414 /* fixed_end_shift is how many chars that must be matched that
4415 follow this item. We calculate it ahead of time as once the
4416 lookbehind offset is added in we lose the ability to correctly
4418 ml = data.minlen_fixed ? *(data.minlen_fixed)
4419 : (I32)longest_fixed_length;
4420 r->anchored_end_shift = ml - data.offset_fixed
4421 - longest_fixed_length + (SvTAIL(data.longest_fixed) != 0)
4422 + data.lookbehind_fixed;
4423 r->anchored_offset = data.offset_fixed - data.lookbehind_fixed;
4425 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
4426 && (!(data.flags & SF_FIX_BEFORE_MEOL)
4427 || (RExC_flags & RXf_PMf_MULTILINE)));
4428 fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0);
4431 r->anchored_substr = r->anchored_utf8 = NULL;
4432 SvREFCNT_dec(data.longest_fixed);
4433 longest_fixed_length = 0;
4436 && (OP(ri->regstclass) == REG_ANY || OP(ri->regstclass) == SANY))
4437 ri->regstclass = NULL;
4438 if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset)
4440 && !(data.start_class->flags & ANYOF_EOS)
4441 && !cl_is_anything(data.start_class))
4443 const U32 n = add_data(pRExC_state, 1, "f");
4445 Newx(RExC_rxi->data->data[n], 1,
4446 struct regnode_charclass_class);
4447 StructCopy(data.start_class,
4448 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
4449 struct regnode_charclass_class);
4450 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
4451 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
4452 DEBUG_COMPILE_r({ SV *sv = sv_newmortal();
4453 regprop(r, sv, (regnode*)data.start_class);
4454 PerlIO_printf(Perl_debug_log,
4455 "synthetic stclass \"%s\".\n",
4456 SvPVX_const(sv));});
4459 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
4460 if (longest_fixed_length > longest_float_length) {
4461 r->check_end_shift = r->anchored_end_shift;
4462 r->check_substr = r->anchored_substr;
4463 r->check_utf8 = r->anchored_utf8;
4464 r->check_offset_min = r->check_offset_max = r->anchored_offset;
4465 if (r->extflags & RXf_ANCH_SINGLE)
4466 r->extflags |= RXf_NOSCAN;
4469 r->check_end_shift = r->float_end_shift;
4470 r->check_substr = r->float_substr;
4471 r->check_utf8 = r->float_utf8;
4472 r->check_offset_min = r->float_min_offset;
4473 r->check_offset_max = r->float_max_offset;
4475 /* XXXX Currently intuiting is not compatible with ANCH_GPOS.
4476 This should be changed ASAP! */
4477 if ((r->check_substr || r->check_utf8) && !(r->extflags & RXf_ANCH_GPOS)) {
4478 r->extflags |= RXf_USE_INTUIT;
4479 if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8))
4480 r->extflags |= RXf_INTUIT_TAIL;
4482 /* XXX Unneeded? dmq (shouldn't as this is handled elsewhere)
4483 if ( (STRLEN)minlen < longest_float_length )
4484 minlen= longest_float_length;
4485 if ( (STRLEN)minlen < longest_fixed_length )
4486 minlen= longest_fixed_length;
4490 /* Several toplevels. Best we can is to set minlen. */
4492 struct regnode_charclass_class ch_class;
4495 DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "\nMulti Top Level\n"));
4497 scan = ri->program + 1;
4498 cl_init(pRExC_state, &ch_class);
4499 data.start_class = &ch_class;
4500 data.last_closep = &last_close;
4503 minlen = study_chunk(pRExC_state, &scan, &minlen, &fake, scan + RExC_size,
4504 &data, -1, NULL, NULL, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS,0);
4508 r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8
4509 = r->float_substr = r->float_utf8 = NULL;
4510 if (!(data.start_class->flags & ANYOF_EOS)
4511 && !cl_is_anything(data.start_class))
4513 const U32 n = add_data(pRExC_state, 1, "f");
4515 Newx(RExC_rxi->data->data[n], 1,
4516 struct regnode_charclass_class);
4517 StructCopy(data.start_class,
4518 (struct regnode_charclass_class*)RExC_rxi->data->data[n],
4519 struct regnode_charclass_class);
4520 ri->regstclass = (regnode*)RExC_rxi->data->data[n];
4521 r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */
4522 DEBUG_COMPILE_r({ SV* sv = sv_newmortal();
4523 regprop(r, sv, (regnode*)data.start_class);
4524 PerlIO_printf(Perl_debug_log,
4525 "synthetic stclass \"%s\".\n",
4526 SvPVX_const(sv));});
4530 /* Guard against an embedded (?=) or (?<=) with a longer minlen than
4531 the "real" pattern. */
4533 PerlIO_printf(Perl_debug_log,"minlen: %"IVdf" r->minlen:%"IVdf"\n",
4534 (IV)minlen, (IV)r->minlen);
4536 r->minlenret = minlen;
4537 if (r->minlen < minlen)
4540 if (RExC_seen & REG_SEEN_GPOS)
4541 r->extflags |= RXf_GPOS_SEEN;
4542 if (RExC_seen & REG_SEEN_LOOKBEHIND)
4543 r->extflags |= RXf_LOOKBEHIND_SEEN;
4544 if (RExC_seen & REG_SEEN_EVAL)
4545 r->extflags |= RXf_EVAL_SEEN;
4546 if (RExC_seen & REG_SEEN_CANY)
4547 r->extflags |= RXf_CANY_SEEN;
4548 if (RExC_seen & REG_SEEN_VERBARG)
4549 r->intflags |= PREGf_VERBARG_SEEN;
4550 if (RExC_seen & REG_SEEN_CUTGROUP)
4551 r->intflags |= PREGf_CUTGROUP_SEEN;
4552 if (RExC_paren_names)
4553 r->paren_names = (HV*)SvREFCNT_inc(RExC_paren_names);
4555 r->paren_names = NULL;
4557 if (RExC_recurse_count) {
4558 for ( ; RExC_recurse_count ; RExC_recurse_count-- ) {
4559 const regnode *scan = RExC_recurse[RExC_recurse_count-1];
4560 ARG2L_SET( scan, RExC_open_parens[ARG(scan)-1] - scan );
4563 Newxz(r->startp, RExC_npar, I32);
4564 Newxz(r->endp, RExC_npar, I32);
4565 /* assume we don't need to swap parens around before we match */
4568 PerlIO_printf(Perl_debug_log,"Final program:\n");
4571 DEBUG_OFFSETS_r(if (ri->offsets) {
4572 const U32 len = ri->offsets[0];
4574 GET_RE_DEBUG_FLAGS_DECL;
4575 PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)ri->offsets[0]);
4576 for (i = 1; i <= len; i++) {
4577 if (ri->offsets[i*2-1] || ri->offsets[i*2])
4578 PerlIO_printf(Perl_debug_log, "%"UVuf":%"UVuf"[%"UVuf"] ",
4579 (UV)i, (UV)ri->offsets[i*2-1], (UV)ri->offsets[i*2]);
4581 PerlIO_printf(Perl_debug_log, "\n");
4587 #undef CORE_ONLY_BLOCK
4589 #undef RE_ENGINE_PTR
4591 #ifndef PERL_IN_XSUB_RE
4593 Perl_reg_named_buff_sv(pTHX_ SV* namesv)
4595 I32 parno = 0; /* no match */
4597 const REGEXP * const rx = PM_GETRE(PL_curpm);
4598 if (rx && rx->paren_names) {
4599 HE *he_str = hv_fetch_ent( rx->paren_names, namesv, 0, 0 );
4602 SV* sv_dat=HeVAL(he_str);
4603 I32 *nums=(I32*)SvPVX(sv_dat);
4604 for ( i=0; i<SvIVX(sv_dat); i++ ) {
4605 if ((I32)(rx->lastparen) >= nums[i] &&
4606 rx->endp[nums[i]] != -1)
4619 SV *sv= sv_newmortal();
4620 Perl_sv_setpvf(aTHX_ sv, "%"IVdf,(IV)parno);
4621 gv_paren= Perl_gv_fetchsv(aTHX_ sv, GV_ADD, SVt_PVGV);
4622 return GvSVn(gv_paren);
4627 /* Scans the name of a named buffer from the pattern.
4628 * If flags is REG_RSN_RETURN_NULL returns null.
4629 * If flags is REG_RSN_RETURN_NAME returns an SV* containing the name
4630 * If flags is REG_RSN_RETURN_DATA returns the data SV* corresponding
4631 * to the parsed name as looked up in the RExC_paren_names hash.
4632 * If there is an error throws a vFAIL().. type exception.
4635 #define REG_RSN_RETURN_NULL 0
4636 #define REG_RSN_RETURN_NAME 1
4637 #define REG_RSN_RETURN_DATA 2
4640 S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags) {
4641 char *name_start = RExC_parse;
4644 while( isIDFIRST_uni(utf8n_to_uvchr((U8*)RExC_parse,
4645 RExC_end - RExC_parse, &numlen, UTF8_ALLOW_DEFAULT)))
4647 RExC_parse += numlen;
4650 while( isIDFIRST(*RExC_parse) )
4654 SV* sv_name = sv_2mortal(Perl_newSVpvn(aTHX_ name_start,
4655 (int)(RExC_parse - name_start)));
4658 if ( flags == REG_RSN_RETURN_NAME)
4660 else if (flags==REG_RSN_RETURN_DATA) {
4663 if ( ! sv_name ) /* should not happen*/
4664 Perl_croak(aTHX_ "panic: no svname in reg_scan_name");
4665 if (RExC_paren_names)
4666 he_str = hv_fetch_ent( RExC_paren_names, sv_name, 0, 0 );
4668 sv_dat = HeVAL(he_str);
4670 vFAIL("Reference to nonexistent named group");
4674 Perl_croak(aTHX_ "panic: bad flag in reg_scan_name");
4681 #define DEBUG_PARSE_MSG(funcname) DEBUG_PARSE_r({ \
4682 int rem=(int)(RExC_end - RExC_parse); \
4691 if (RExC_lastparse!=RExC_parse) \
4692 PerlIO_printf(Perl_debug_log," >%.*s%-*s", \
4695 iscut ? "..." : "<" \
4698 PerlIO_printf(Perl_debug_log,"%16s",""); \
4703 num=REG_NODE_NUM(RExC_emit); \
4704 if (RExC_lastnum!=num) \
4705 PerlIO_printf(Perl_debug_log,"|%4d",num); \
4707 PerlIO_printf(Perl_debug_log,"|%4s",""); \
4708 PerlIO_printf(Perl_debug_log,"|%*s%-4s", \
4709 (int)((depth*2)), "", \
4713 RExC_lastparse=RExC_parse; \
4718 #define DEBUG_PARSE(funcname) DEBUG_PARSE_r({ \
4719 DEBUG_PARSE_MSG((funcname)); \
4720 PerlIO_printf(Perl_debug_log,"%4s","\n"); \
4722 #define DEBUG_PARSE_FMT(funcname,fmt,args) DEBUG_PARSE_r({ \
4723 DEBUG_PARSE_MSG((funcname)); \
4724 PerlIO_printf(Perl_debug_log,fmt "\n",args); \
4727 - reg - regular expression, i.e. main body or parenthesized thing
4729 * Caller must absorb opening parenthesis.
4731 * Combining parenthesis handling with the base level of regular expression
4732 * is a trifle forced, but the need to tie the tails of the branches to what
4733 * follows makes it hard to avoid.
4735 #define REGTAIL(x,y,z) regtail((x),(y),(z),depth+1)
4737 #define REGTAIL_STUDY(x,y,z) regtail_study((x),(y),(z),depth+1)
4739 #define REGTAIL_STUDY(x,y,z) regtail((x),(y),(z),depth+1)
4742 /* this idea is borrowed from STR_WITH_LEN in handy.h */
4743 #define CHECK_WORD(s,v,l) \
4744 (((sizeof(s)-1)==(l)) && (strnEQ(start_verb, (s ""), (sizeof(s)-1))))
4747 S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp,U32 depth)
4748 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
4751 register regnode *ret; /* Will be the head of the group. */
4752 register regnode *br;
4753 register regnode *lastbr;
4754 register regnode *ender = NULL;
4755 register I32 parno = 0;
4757 const I32 oregflags = RExC_flags;
4758 bool have_branch = 0;
4761 /* for (?g), (?gc), and (?o) warnings; warning
4762 about (?c) will warn about (?g) -- japhy */
4764 #define WASTED_O 0x01
4765 #define WASTED_G 0x02
4766 #define WASTED_C 0x04
4767 #define WASTED_GC (0x02|0x04)
4768 I32 wastedflags = 0x00;
4770 char * parse_start = RExC_parse; /* MJD */
4771 char * const oregcomp_parse = RExC_parse;
4773 GET_RE_DEBUG_FLAGS_DECL;
4774 DEBUG_PARSE("reg ");
4777 *flagp = 0; /* Tentatively. */
4780 /* Make an OPEN node, if parenthesized. */
4782 if ( *RExC_parse == '*') { /* (*VERB:ARG) */
4783 char *start_verb = RExC_parse;
4784 STRLEN verb_len = 0;
4785 char *start_arg = NULL;
4786 unsigned char op = 0;
4788 int internal_argval = 0; /* internal_argval is only useful if !argok */
4789 while ( *RExC_parse && *RExC_parse != ')' ) {
4790 if ( *RExC_parse == ':' ) {
4791 start_arg = RExC_parse + 1;
4797 verb_len = RExC_parse - start_verb;
4800 while ( *RExC_parse && *RExC_parse != ')' )
4802 if ( *RExC_parse != ')' )
4803 vFAIL("Unterminated verb pattern argument");
4804 if ( RExC_parse == start_arg )
4807 if ( *RExC_parse != ')' )
4808 vFAIL("Unterminated verb pattern");
4811 switch ( *start_verb ) {
4812 case 'A': /* (*ACCEPT) */
4813 if ( CHECK_WORD("ACCEPT",start_verb,verb_len) ) {
4815 internal_argval = RExC_nestroot;
4818 case 'C': /* (*COMMIT) */
4819 if ( CHECK_WORD("COMMIT",start_verb,verb_len) )
4822 case 'F': /* (*FAIL) */
4823 if ( verb_len==1 || CHECK_WORD("FAIL",start_verb,verb_len) ) {
4828 case ':': /* (*:NAME) */
4829 case 'M': /* (*MARK:NAME) */
4830 if ( verb_len==0 || CHECK_WORD("MARK",start_verb,verb_len) ) {
4835 case 'P': /* (*PRUNE) */
4836 if ( CHECK_WORD("PRUNE",start_verb,verb_len) )
4839 case 'S': /* (*SKIP) */
4840 if ( CHECK_WORD("SKIP",start_verb,verb_len) )
4843 case 'T': /* (*THEN) */
4844 /* [19:06] <TimToady> :: is then */
4845 if ( CHECK_WORD("THEN",start_verb,verb_len) ) {
4847 RExC_seen |= REG_SEEN_CUTGROUP;
4853 vFAIL3("Unknown verb pattern '%.*s'",
4854 verb_len, start_verb);
4857 if ( start_arg && internal_argval ) {
4858 vFAIL3("Verb pattern '%.*s' may not have an argument",
4859 verb_len, start_verb);
4860 } else if ( argok < 0 && !start_arg ) {
4861 vFAIL3("Verb pattern '%.*s' has a mandatory argument",
4862 verb_len, start_verb);
4864 ret = reganode(pRExC_state, op, internal_argval);
4865 if ( ! internal_argval && ! SIZE_ONLY ) {
4867 SV *sv = newSVpvn( start_arg, RExC_parse - start_arg);
4868 ARG(ret) = add_data( pRExC_state, 1, "S" );
4869 RExC_rxi->data->data[ARG(ret)]=(void*)sv;
4876 if (!internal_argval)
4877 RExC_seen |= REG_SEEN_VERBARG;
4878 } else if ( start_arg ) {
4879 vFAIL3("Verb pattern '%.*s' may not have an argument",
4880 verb_len, start_verb);
4882 ret = reg_node(pRExC_state, op);
4884 nextchar(pRExC_state);
4887 if (*RExC_parse == '?') { /* (?...) */
4888 U32 posflags = 0, negflags = 0;
4889 U32 *flagsp = &posflags;
4890 bool is_logical = 0;
4891 const char * const seqstart = RExC_parse;
4894 paren = *RExC_parse++;
4895 ret = NULL; /* For look-ahead/behind. */
4898 case '<': /* (?<...) */
4899 if (*RExC_parse == '!')
4901 else if (*RExC_parse != '=')
4906 case '\'': /* (?'...') */
4907 name_start= RExC_parse;
4908 svname = reg_scan_name(pRExC_state,
4909 SIZE_ONLY ? /* reverse test from the others */
4910 REG_RSN_RETURN_NAME :
4911 REG_RSN_RETURN_NULL);
4912 if (RExC_parse == name_start)
4914 if (*RExC_parse != paren)
4915 vFAIL2("Sequence (?%c... not terminated",
4916 paren=='>' ? '<' : paren);
4920 if (!svname) /* shouldnt happen */
4922 "panic: reg_scan_name returned NULL");
4923 if (!RExC_paren_names) {
4924 RExC_paren_names= newHV();
4925 sv_2mortal((SV*)RExC_paren_names);
4927 he_str = hv_fetch_ent( RExC_paren_names, svname, 1, 0 );
4929 sv_dat = HeVAL(he_str);
4931 /* croak baby croak */
4933 "panic: paren_name hash element allocation failed");
4934 } else if ( SvPOK(sv_dat) ) {
4935 IV count=SvIV(sv_dat);
4936 I32 *pv=(I32*)SvGROW(sv_dat,SvCUR(sv_dat)+sizeof(I32)+1);
4937 SvCUR_set(sv_dat,SvCUR(sv_dat)+sizeof(I32));
4938 pv[count]=RExC_npar;
4941 (void)SvUPGRADE(sv_dat,SVt_PVNV);
4942 sv_setpvn(sv_dat, (char *)&(RExC_npar), sizeof(I32));
4947 /*sv_dump(sv_dat);*/
4949 nextchar(pRExC_state);
4951 goto capturing_parens;
4953 RExC_seen |= REG_SEEN_LOOKBEHIND;
4955 case '=': /* (?=...) */
4956 case '!': /* (?!...) */
4957 RExC_seen_zerolen++;
4958 if (*RExC_parse == ')') {
4959 ret=reg_node(pRExC_state, OPFAIL);
4960 nextchar(pRExC_state);
4963 case ':': /* (?:...) */
4964 case '>': /* (?>...) */
4966 case '$': /* (?$...) */
4967 case '@': /* (?@...) */
4968 vFAIL2("Sequence (?%c...) not implemented", (int)paren);
4970 case '#': /* (?#...) */
4971 while (*RExC_parse && *RExC_parse != ')')
4973 if (*RExC_parse != ')')
4974 FAIL("Sequence (?#... not terminated");
4975 nextchar(pRExC_state);
4978 case '0' : /* (?0) */
4979 case 'R' : /* (?R) */
4980 if (*RExC_parse != ')')
4981 FAIL("Sequence (?R) not terminated");
4982 ret = reg_node(pRExC_state, GOSTART);
4983 nextchar(pRExC_state);
4986 { /* named and numeric backreferences */
4989 case '&': /* (?&NAME) */
4990 parse_start = RExC_parse - 1;
4992 SV *sv_dat = reg_scan_name(pRExC_state,
4993 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
4994 num = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
4996 goto gen_recurse_regop;
4999 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
5001 vFAIL("Illegal pattern");
5003 goto parse_recursion;
5005 case '-': /* (?-1) */
5006 if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) {
5007 RExC_parse--; /* rewind to let it be handled later */
5011 case '1': case '2': case '3': case '4': /* (?1) */
5012 case '5': case '6': case '7': case '8': case '9':
5015 num = atoi(RExC_parse);
5016 parse_start = RExC_parse - 1; /* MJD */
5017 if (*RExC_parse == '-')
5019 while (isDIGIT(*RExC_parse))
5021 if (*RExC_parse!=')')
5022 vFAIL("Expecting close bracket");
5025 if ( paren == '-' ) {
5027 Diagram of capture buffer numbering.
5028 Top line is the normal capture buffer numbers
5029 Botton line is the negative indexing as from
5033 /(a(x)y)(a(b(c(?-2)d)e)f)(g(h))/
5037 num = RExC_npar + num;
5040 vFAIL("Reference to nonexistent group");
5042 } else if ( paren == '+' ) {
5043 num = RExC_npar + num - 1;
5046 ret = reganode(pRExC_state, GOSUB, num);
5048 if (num > (I32)RExC_rx->nparens) {
5050 vFAIL("Reference to nonexistent group");
5052 ARG2L_SET( ret, RExC_recurse_count++);
5054 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5055 "Recurse #%"UVuf" to %"IVdf"\n", (UV)ARG(ret), (IV)ARG2L(ret)));
5059 RExC_seen |= REG_SEEN_RECURSE;
5060 Set_Node_Length(ret, 1 + regarglen[OP(ret)]); /* MJD */
5061 Set_Node_Offset(ret, parse_start); /* MJD */
5063 nextchar(pRExC_state);
5065 } /* named and numeric backreferences */
5068 case 'p': /* (?p...) */
5069 if (SIZE_ONLY && ckWARN2(WARN_DEPRECATED, WARN_REGEXP))
5070 vWARNdep(RExC_parse, "(?p{}) is deprecated - use (??{})");
5072 case '?': /* (??...) */
5074 if (*RExC_parse != '{')
5076 paren = *RExC_parse++;
5078 case '{': /* (?{...}) */
5083 char *s = RExC_parse;
5085 RExC_seen_zerolen++;
5086 RExC_seen |= REG_SEEN_EVAL;
5087 while (count && (c = *RExC_parse)) {
5098 if (*RExC_parse != ')') {
5100 vFAIL("Sequence (?{...}) not terminated or not {}-balanced");
5104 OP_4tree *sop, *rop;
5105 SV * const sv = newSVpvn(s, RExC_parse - 1 - s);
5108 Perl_save_re_context(aTHX);
5109 rop = sv_compile_2op(sv, &sop, "re", &pad);
5110 sop->op_private |= OPpREFCOUNTED;
5111 /* re_dup will OpREFCNT_inc */
5112 OpREFCNT_set(sop, 1);
5115 n = add_data(pRExC_state, 3, "nop");
5116 RExC_rxi->data->data[n] = (void*)rop;
5117 RExC_rxi->data->data[n+1] = (void*)sop;
5118 RExC_rxi->data->data[n+2] = (void*)pad;
5121 else { /* First pass */
5122 if (PL_reginterp_cnt < ++RExC_seen_evals
5124 /* No compiled RE interpolated, has runtime
5125 components ===> unsafe. */
5126 FAIL("Eval-group not allowed at runtime, use re 'eval'");
5127 if (PL_tainting && PL_tainted)
5128 FAIL("Eval-group in insecure regular expression");
5129 #if PERL_VERSION > 8
5130 if (IN_PERL_COMPILETIME)
5135 nextchar(pRExC_state);
5137 ret = reg_node(pRExC_state, LOGICAL);
5140 REGTAIL(pRExC_state, ret, reganode(pRExC_state, EVAL, n));
5141 /* deal with the length of this later - MJD */
5144 ret = reganode(pRExC_state, EVAL, n);
5145 Set_Node_Length(ret, RExC_parse - parse_start + 1);
5146 Set_Node_Offset(ret, parse_start);
5149 case '(': /* (?(?{...})...) and (?(?=...)...) */
5152 if (RExC_parse[0] == '?') { /* (?(?...)) */
5153 if (RExC_parse[1] == '=' || RExC_parse[1] == '!'
5154 || RExC_parse[1] == '<'
5155 || RExC_parse[1] == '{') { /* Lookahead or eval. */
5158 ret = reg_node(pRExC_state, LOGICAL);
5161 REGTAIL(pRExC_state, ret, reg(pRExC_state, 1, &flag,depth+1));
5165 else if ( RExC_parse[0] == '<' /* (?(<NAME>)...) */
5166 || RExC_parse[0] == '\'' ) /* (?('NAME')...) */
5168 char ch = RExC_parse[0] == '<' ? '>' : '\'';
5169 char *name_start= RExC_parse++;
5171 SV *sv_dat=reg_scan_name(pRExC_state,
5172 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5173 if (RExC_parse == name_start || *RExC_parse != ch)
5174 vFAIL2("Sequence (?(%c... not terminated",
5175 (ch == '>' ? '<' : ch));
5178 num = add_data( pRExC_state, 1, "S" );
5179 RExC_rxi->data->data[num]=(void*)sv_dat;
5180 SvREFCNT_inc(sv_dat);
5182 ret = reganode(pRExC_state,NGROUPP,num);
5183 goto insert_if_check_paren;
5185 else if (RExC_parse[0] == 'D' &&
5186 RExC_parse[1] == 'E' &&
5187 RExC_parse[2] == 'F' &&
5188 RExC_parse[3] == 'I' &&
5189 RExC_parse[4] == 'N' &&
5190 RExC_parse[5] == 'E')
5192 ret = reganode(pRExC_state,DEFINEP,0);
5195 goto insert_if_check_paren;
5197 else if (RExC_parse[0] == 'R') {
5200 if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
5201 parno = atoi(RExC_parse++);
5202 while (isDIGIT(*RExC_parse))
5204 } else if (RExC_parse[0] == '&') {
5207 sv_dat = reg_scan_name(pRExC_state,
5208 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
5209 parno = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0;
5211 ret = reganode(pRExC_state,INSUBP,parno);
5212 goto insert_if_check_paren;
5214 else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) {
5217 parno = atoi(RExC_parse++);
5219 while (isDIGIT(*RExC_parse))
5221 ret = reganode(pRExC_state, GROUPP, parno);
5223 insert_if_check_paren:
5224 if ((c = *nextchar(pRExC_state)) != ')')
5225 vFAIL("Switch condition not recognized");
5227 REGTAIL(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0));
5228 br = regbranch(pRExC_state, &flags, 1,depth+1);
5230 br = reganode(pRExC_state, LONGJMP, 0);
5232 REGTAIL(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0));
5233 c = *nextchar(pRExC_state);
5238 vFAIL("(?(DEFINE)....) does not allow branches");
5239 lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */
5240 regbranch(pRExC_state, &flags, 1,depth+1);
5241 REGTAIL(pRExC_state, ret, lastbr);
5244 c = *nextchar(pRExC_state);
5249 vFAIL("Switch (?(condition)... contains too many branches");
5250 ender = reg_node(pRExC_state, TAIL);
5251 REGTAIL(pRExC_state, br, ender);
5253 REGTAIL(pRExC_state, lastbr, ender);
5254 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender);
5257 REGTAIL(pRExC_state, ret, ender);
5261 vFAIL2("Unknown switch condition (?(%.2s", RExC_parse);
5265 RExC_parse--; /* for vFAIL to print correctly */
5266 vFAIL("Sequence (? incomplete");
5270 parse_flags: /* (?i) */
5271 while (*RExC_parse && strchr("iogcmsx", *RExC_parse)) {
5272 /* (?g), (?gc) and (?o) are useless here
5273 and must be globally applied -- japhy */
5275 if (*RExC_parse == 'o' || *RExC_parse == 'g') {
5276 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5277 const I32 wflagbit = *RExC_parse == 'o' ? WASTED_O : WASTED_G;
5278 if (! (wastedflags & wflagbit) ) {
5279 wastedflags |= wflagbit;
5282 "Useless (%s%c) - %suse /%c modifier",
5283 flagsp == &negflags ? "?-" : "?",
5285 flagsp == &negflags ? "don't " : "",
5291 else if (*RExC_parse == 'c') {
5292 if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5293 if (! (wastedflags & WASTED_C) ) {
5294 wastedflags |= WASTED_GC;
5297 "Useless (%sc) - %suse /gc modifier",
5298 flagsp == &negflags ? "?-" : "?",
5299 flagsp == &negflags ? "don't " : ""
5304 else { pmflag(flagsp, *RExC_parse); }
5308 if (*RExC_parse == '-') {
5310 wastedflags = 0; /* reset so (?g-c) warns twice */
5314 RExC_flags |= posflags;
5315 RExC_flags &= ~negflags;
5316 if (*RExC_parse == ':') {
5322 if (*RExC_parse != ')') {
5324 vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart);
5326 nextchar(pRExC_state);
5336 ret = reganode(pRExC_state, OPEN, parno);
5339 RExC_nestroot = parno;
5340 if (RExC_seen & REG_SEEN_RECURSE) {
5341 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5342 "Setting open paren #%"IVdf" to %d\n",
5343 (IV)parno, REG_NODE_NUM(ret)));
5344 RExC_open_parens[parno-1]= ret;
5347 Set_Node_Length(ret, 1); /* MJD */
5348 Set_Node_Offset(ret, RExC_parse); /* MJD */
5355 /* Pick up the branches, linking them together. */
5356 parse_start = RExC_parse; /* MJD */
5357 br = regbranch(pRExC_state, &flags, 1,depth+1);
5358 /* branch_len = (paren != 0); */
5362 if (*RExC_parse == '|') {
5363 if (!SIZE_ONLY && RExC_extralen) {
5364 reginsert(pRExC_state, BRANCHJ, br, depth+1);
5367 reginsert(pRExC_state, BRANCH, br, depth+1);
5368 Set_Node_Length(br, paren != 0);
5369 Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start);
5373 RExC_extralen += 1; /* For BRANCHJ-BRANCH. */
5375 else if (paren == ':') {
5376 *flagp |= flags&SIMPLE;
5378 if (is_open) { /* Starts with OPEN. */
5379 REGTAIL(pRExC_state, ret, br); /* OPEN -> first. */
5381 else if (paren != '?') /* Not Conditional */
5383 *flagp |= flags & (SPSTART | HASWIDTH);
5385 while (*RExC_parse == '|') {
5386 if (!SIZE_ONLY && RExC_extralen) {
5387 ender = reganode(pRExC_state, LONGJMP,0);
5388 REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
5391 RExC_extralen += 2; /* Account for LONGJMP. */
5392 nextchar(pRExC_state);
5393 br = regbranch(pRExC_state, &flags, 0, depth+1);
5397 REGTAIL(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */
5401 *flagp |= flags&SPSTART;
5404 if (have_branch || paren != ':') {
5405 /* Make a closing node, and hook it on the end. */
5408 ender = reg_node(pRExC_state, TAIL);
5412 ender = reganode(pRExC_state, CLOSE, parno);
5413 if (!SIZE_ONLY && RExC_seen & REG_SEEN_RECURSE) {
5414 DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log,
5415 "Setting close paren #%"IVdf" to %d\n",
5416 (IV)parno, REG_NODE_NUM(ender)));
5417 RExC_close_parens[parno-1]= ender;
5418 if (RExC_nestroot == parno)
5421 Set_Node_Offset(ender,RExC_parse+1); /* MJD */
5422 Set_Node_Length(ender,1); /* MJD */
5428 *flagp &= ~HASWIDTH;
5431 ender = reg_node(pRExC_state, SUCCEED);
5434 ender = reg_node(pRExC_state, END);
5436 assert(!RExC_opend); /* there can only be one! */
5441 REGTAIL(pRExC_state, lastbr, ender);
5443 if (have_branch && !SIZE_ONLY) {
5445 RExC_seen |= REG_TOP_LEVEL_BRANCHES;
5447 /* Hook the tails of the branches to the closing node. */
5448 for (br = ret; br; br = regnext(br)) {
5449 const U8 op = PL_regkind[OP(br)];
5451 REGTAIL_STUDY(pRExC_state, NEXTOPER(br), ender);
5453 else if (op == BRANCHJ) {
5454 REGTAIL_STUDY(pRExC_state, NEXTOPER(NEXTOPER(br)), ender);
5462 static const char parens[] = "=!<,>";
5464 if (paren && (p = strchr(parens, paren))) {
5465 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
5466 int flag = (p - parens) > 1;
5469 node = SUSPEND, flag = 0;
5470 reginsert(pRExC_state, node,ret, depth+1);
5471 Set_Node_Cur_Length(ret);
5472 Set_Node_Offset(ret, parse_start + 1);
5474 REGTAIL_STUDY(pRExC_state, ret, reg_node(pRExC_state, TAIL));
5478 /* Check for proper termination. */
5480 RExC_flags = oregflags;
5481 if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') {
5482 RExC_parse = oregcomp_parse;
5483 vFAIL("Unmatched (");
5486 else if (!paren && RExC_parse < RExC_end) {
5487 if (*RExC_parse == ')') {
5489 vFAIL("Unmatched )");
5492 FAIL("Junk on end of regexp"); /* "Can't happen". */
5500 - regbranch - one alternative of an | operator
5502 * Implements the concatenation operator.
5505 S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth)
5508 register regnode *ret;
5509 register regnode *chain = NULL;
5510 register regnode *latest;
5511 I32 flags = 0, c = 0;
5512 GET_RE_DEBUG_FLAGS_DECL;
5513 DEBUG_PARSE("brnc");
5517 if (!SIZE_ONLY && RExC_extralen)
5518 ret = reganode(pRExC_state, BRANCHJ,0);
5520 ret = reg_node(pRExC_state, BRANCH);
5521 Set_Node_Length(ret, 1);
5525 if (!first && SIZE_ONLY)
5526 RExC_extralen += 1; /* BRANCHJ */
5528 *flagp = WORST; /* Tentatively. */
5531 nextchar(pRExC_state);
5532 while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') {
5534 latest = regpiece(pRExC_state, &flags,depth+1);
5535 if (latest == NULL) {
5536 if (flags & TRYAGAIN)
5540 else if (ret == NULL)
5542 *flagp |= flags&HASWIDTH;
5543 if (chain == NULL) /* First piece. */
5544 *flagp |= flags&SPSTART;
5547 REGTAIL(pRExC_state, chain, latest);
5552 if (chain == NULL) { /* Loop ran zero times. */
5553 chain = reg_node(pRExC_state, NOTHING);
5558 *flagp |= flags&SIMPLE;
5565 - regpiece - something followed by possible [*+?]
5567 * Note that the branching code sequences used for ? and the general cases
5568 * of * and + are somewhat optimized: they use the same NOTHING node as
5569 * both the endmarker for their branch list and the body of the last branch.
5570 * It might seem that this node could be dispensed with entirely, but the
5571 * endmarker role is not redundant.
5574 S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
5577 register regnode *ret;
5579 register char *next;
5581 const char * const origparse = RExC_parse;
5583 I32 max = REG_INFTY;
5585 const char *maxpos = NULL;
5586 GET_RE_DEBUG_FLAGS_DECL;
5587 DEBUG_PARSE("piec");
5589 ret = regatom(pRExC_state, &flags,depth+1);
5591 if (flags & TRYAGAIN)
5598 if (op == '{' && regcurly(RExC_parse)) {
5600 parse_start = RExC_parse; /* MJD */
5601 next = RExC_parse + 1;
5602 while (isDIGIT(*next) || *next == ',') {
5611 if (*next == '}') { /* got one */
5615 min = atoi(RExC_parse);
5619 maxpos = RExC_parse;
5621 if (!max && *maxpos != '0')
5622 max = REG_INFTY; /* meaning "infinity" */
5623 else if (max >= REG_INFTY)
5624 vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
5626 nextchar(pRExC_state);
5629 if ((flags&SIMPLE)) {
5630 RExC_naughty += 2 + RExC_naughty / 2;
5631 reginsert(pRExC_state, CURLY, ret, depth+1);
5632 Set_Node_Offset(ret, parse_start+1); /* MJD */
5633 Set_Node_Cur_Length(ret);
5636 regnode * const w = reg_node(pRExC_state, WHILEM);
5639 REGTAIL(pRExC_state, ret, w);
5640 if (!SIZE_ONLY && RExC_extralen) {
5641 reginsert(pRExC_state, LONGJMP,ret, depth+1);
5642 reginsert(pRExC_state, NOTHING,ret, depth+1);
5643 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
5645 reginsert(pRExC_state, CURLYX,ret, depth+1);
5647 Set_Node_Offset(ret, parse_start+1);
5648 Set_Node_Length(ret,
5649 op == '{' ? (RExC_parse - parse_start) : 1);
5651 if (!SIZE_ONLY && RExC_extralen)
5652 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
5653 REGTAIL(pRExC_state, ret, reg_node(pRExC_state, NOTHING));
5655 RExC_whilem_seen++, RExC_extralen += 3;
5656 RExC_naughty += 4 + RExC_naughty; /* compound interest */
5664 if (max && max < min)
5665 vFAIL("Can't do {n,m} with n > m");
5667 ARG1_SET(ret, (U16)min);
5668 ARG2_SET(ret, (U16)max);
5680 #if 0 /* Now runtime fix should be reliable. */
5682 /* if this is reinstated, don't forget to put this back into perldiag:
5684 =item Regexp *+ operand could be empty at {#} in regex m/%s/
5686 (F) The part of the regexp subject to either the * or + quantifier
5687 could match an empty string. The {#} shows in the regular
5688 expression about where the problem was discovered.
5692 if (!(flags&HASWIDTH) && op != '?')
5693 vFAIL("Regexp *+ operand could be empty");
5696 parse_start = RExC_parse;
5697 nextchar(pRExC_state);
5699 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
5701 if (op == '*' && (flags&SIMPLE)) {
5702 reginsert(pRExC_state, STAR, ret, depth+1);
5706 else if (op == '*') {
5710 else if (op == '+' && (flags&SIMPLE)) {
5711 reginsert(pRExC_state, PLUS, ret, depth+1);
5715 else if (op == '+') {
5719 else if (op == '?') {
5724 if (!SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3 && ckWARN(WARN_REGEXP)) {
5726 "%.*s matches null string many times",
5727 (int)(RExC_parse >= origparse ? RExC_parse - origparse : 0),
5731 if (RExC_parse < RExC_end && *RExC_parse == '?') {
5732 nextchar(pRExC_state);
5733 reginsert(pRExC_state, MINMOD, ret, depth+1);
5734 REGTAIL(pRExC_state, ret, ret + NODE_STEP_REGNODE);
5736 #ifndef REG_ALLOW_MINMOD_SUSPEND
5739 if (RExC_parse < RExC_end && *RExC_parse == '+') {
5741 nextchar(pRExC_state);
5742 ender = reg_node(pRExC_state, SUCCEED);
5743 REGTAIL(pRExC_state, ret, ender);
5744 reginsert(pRExC_state, SUSPEND, ret, depth+1);
5746 ender = reg_node(pRExC_state, TAIL);
5747 REGTAIL(pRExC_state, ret, ender);
5751 if (RExC_parse < RExC_end && ISMULT2(RExC_parse)) {
5753 vFAIL("Nested quantifiers");
5760 /* reg_namedseq(pRExC_state,UVp)
5762 This is expected to be called by a parser routine that has
5763 recognized'\N' and needs to handle the rest. RExC_parse is
5764 expected to point at the first char following the N at the time
5767 If valuep is non-null then it is assumed that we are parsing inside
5768 of a charclass definition and the first codepoint in the resolved
5769 string is returned via *valuep and the routine will return NULL.
5770 In this mode if a multichar string is returned from the charnames
5771 handler a warning will be issued, and only the first char in the
5772 sequence will be examined. If the string returned is zero length
5773 then the value of *valuep is undefined and NON-NULL will
5774 be returned to indicate failure. (This will NOT be a valid pointer
5777 If value is null then it is assumed that we are parsing normal text
5778 and inserts a new EXACT node into the program containing the resolved
5779 string and returns a pointer to the new node. If the string is
5780 zerolength a NOTHING node is emitted.
5782 On success RExC_parse is set to the char following the endbrace.
5783 Parsing failures will generate a fatal errorvia vFAIL(...)
5785 NOTE: We cache all results from the charnames handler locally in
5786 the RExC_charnames hash (created on first use) to prevent a charnames
5787 handler from playing silly-buggers and returning a short string and
5788 then a long string for a given pattern. Since the regexp program
5789 size is calculated during an initial parse this would result
5790 in a buffer overrun so we cache to prevent the charname result from
5791 changing during the course of the parse.
5795 S_reg_namedseq(pTHX_ RExC_state_t *pRExC_state, UV *valuep)
5797 char * name; /* start of the content of the name */
5798 char * endbrace; /* endbrace following the name */
5801 STRLEN len; /* this has various purposes throughout the code */
5802 bool cached = 0; /* if this is true then we shouldn't refcount dev sv_str */
5803 regnode *ret = NULL;
5805 if (*RExC_parse != '{') {
5806 vFAIL("Missing braces on \\N{}");
5808 name = RExC_parse+1;
5809 endbrace = strchr(RExC_parse, '}');
5812 vFAIL("Missing right brace on \\N{}");
5814 RExC_parse = endbrace + 1;
5817 /* RExC_parse points at the beginning brace,
5818 endbrace points at the last */
5819 if ( name[0]=='U' && name[1]=='+' ) {
5820 /* its a "unicode hex" notation {U+89AB} */
5821 I32 fl = PERL_SCAN_ALLOW_UNDERSCORES
5822 | PERL_SCAN_DISALLOW_PREFIX
5823 | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0);
5825 len = (STRLEN)(endbrace - name - 2);
5826 cp = grok_hex(name + 2, &len, &fl, NULL);
5827 if ( len != (STRLEN)(endbrace - name - 2) ) {
5836 sv_str= Perl_newSVpvf_nocontext("%c",(int)cp);
5838 /* fetch the charnames handler for this scope */
5839 HV * const table = GvHV(PL_hintgv);
5841 hv_fetchs(table, "charnames", FALSE) :
5843 SV *cv= cvp ? *cvp : NULL;
5846 /* create an SV with the name as argument */
5847 sv_name = newSVpvn(name, endbrace - name);
5849 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5850 vFAIL2("Constant(\\N{%s}) unknown: "
5851 "(possibly a missing \"use charnames ...\")",
5854 if (!cvp || !SvOK(*cvp)) { /* when $^H{charnames} = undef; */
5855 vFAIL2("Constant(\\N{%s}): "
5856 "$^H{charnames} is not defined",SvPVX(sv_name));
5861 if (!RExC_charnames) {
5862 /* make sure our cache is allocated */
5863 RExC_charnames = newHV();
5864 sv_2mortal((SV*)RExC_charnames);
5866 /* see if we have looked this one up before */
5867 he_str = hv_fetch_ent( RExC_charnames, sv_name, 0, 0 );
5869 sv_str = HeVAL(he_str);
5882 count= call_sv(cv, G_SCALAR);
5884 if (count == 1) { /* XXXX is this right? dmq */
5886 SvREFCNT_inc_simple_void(sv_str);
5894 if ( !sv_str || !SvOK(sv_str) ) {
5895 vFAIL2("Constant(\\N{%s}): Call to &{$^H{charnames}} "
5896 "did not return a defined value",SvPVX(sv_name));
5898 if (hv_store_ent( RExC_charnames, sv_name, sv_str, 0))
5903 char *p = SvPV(sv_str, len);
5906 if ( SvUTF8(sv_str) ) {
5907 *valuep = utf8_to_uvchr((U8*)p, &numlen);
5911 We have to turn on utf8 for high bit chars otherwise
5912 we get failures with
5914 "ss" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5915 "SS" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i
5917 This is different from what \x{} would do with the same
5918 codepoint, where the condition is > 0xFF.
5925 /* warn if we havent used the whole string? */
5927 if (numlen<len && SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5929 "Ignoring excess chars from \\N{%s} in character class",
5933 } else if (SIZE_ONLY && ckWARN(WARN_REGEXP)) {
5935 "Ignoring zero length \\N{%s} in character class",
5940 SvREFCNT_dec(sv_name);
5942 SvREFCNT_dec(sv_str);
5943 return len ? NULL : (regnode *)&len;
5944 } else if(SvCUR(sv_str)) {
5949 char * parse_start = name-3; /* needed for the offsets */
5950 GET_RE_DEBUG_FLAGS_DECL; /* needed for the offsets */
5952 ret = reg_node(pRExC_state,
5953 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
5956 if ( RExC_utf8 && !SvUTF8(sv_str) ) {
5957 sv_utf8_upgrade(sv_str);
5958 } else if ( !RExC_utf8 && SvUTF8(sv_str) ) {
5962 p = SvPV(sv_str, len);
5964 /* len is the length written, charlen is the size the char read */
5965 for ( len = 0; p < pend; p += charlen ) {
5967 UV uvc = utf8_to_uvchr((U8*)p, &charlen);
5969 STRLEN foldlen,numlen;
5970 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
5971 uvc = toFOLD_uni(uvc, tmpbuf, &foldlen);
5972 /* Emit all the Unicode characters. */
5974 for (foldbuf = tmpbuf;
5978 uvc = utf8_to_uvchr(foldbuf, &numlen);
5980 const STRLEN unilen = reguni(pRExC_state, uvc, s);
5983 /* In EBCDIC the numlen
5984 * and unilen can differ. */
5986 if (numlen >= foldlen)
5990 break; /* "Can't happen." */
5993 const STRLEN unilen = reguni(pRExC_state, uvc, s);
6005 RExC_size += STR_SZ(len);
6008 RExC_emit += STR_SZ(len);
6010 Set_Node_Cur_Length(ret); /* MJD */
6012 nextchar(pRExC_state);
6014 ret = reg_node(pRExC_state,NOTHING);
6017 SvREFCNT_dec(sv_str);
6020 SvREFCNT_dec(sv_name);
6030 * It returns the code point in utf8 for the value in *encp.
6031 * value: a code value in the source encoding
6032 * encp: a pointer to an Encode object
6034 * If the result from Encode is not a single character,
6035 * it returns U+FFFD (Replacement character) and sets *encp to NULL.
6038 S_reg_recode(pTHX_ const char value, SV **encp)
6041 SV * const sv = sv_2mortal(newSVpvn(&value, numlen));
6042 const char * const s = encp && *encp ? sv_recode_to_utf8(sv, *encp)
6044 const STRLEN newlen = SvCUR(sv);
6045 UV uv = UNICODE_REPLACEMENT;
6049 ? utf8n_to_uvchr((U8*)s, newlen, &numlen, UTF8_ALLOW_DEFAULT)
6052 if (!newlen || numlen != newlen) {
6053 uv = UNICODE_REPLACEMENT;
6062 - regatom - the lowest level
6064 * Optimization: gobbles an entire sequence of ordinary characters so that
6065 * it can turn them into a single node, which is smaller to store and
6066 * faster to run. Backslashed characters are exceptions, each becoming a
6067 * separate node; the code is simpler that way and it's not worth fixing.
6069 * [Yes, it is worth fixing, some scripts can run twice the speed.]
6070 * [It looks like its ok, as in S_study_chunk we merge adjacent EXACT nodes]
6073 S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth)
6076 register regnode *ret = NULL;
6078 char *parse_start = RExC_parse;
6079 GET_RE_DEBUG_FLAGS_DECL;
6080 DEBUG_PARSE("atom");
6081 *flagp = WORST; /* Tentatively. */
6084 switch (*RExC_parse) {
6086 RExC_seen_zerolen++;
6087 nextchar(pRExC_state);
6088 if (RExC_flags & RXf_PMf_MULTILINE)
6089 ret = reg_node(pRExC_state, MBOL);
6090 else if (RExC_flags & RXf_PMf_SINGLELINE)
6091 ret = reg_node(pRExC_state, SBOL);
6093 ret = reg_node(pRExC_state, BOL);
6094 Set_Node_Length(ret, 1); /* MJD */
6097 nextchar(pRExC_state);
6099 RExC_seen_zerolen++;
6100 if (RExC_flags & RXf_PMf_MULTILINE)
6101 ret = reg_node(pRExC_state, MEOL);
6102 else if (RExC_flags & RXf_PMf_SINGLELINE)
6103 ret = reg_node(pRExC_state, SEOL);
6105 ret = reg_node(pRExC_state, EOL);
6106 Set_Node_Length(ret, 1); /* MJD */
6109 nextchar(pRExC_state);
6110 if (RExC_flags & RXf_PMf_SINGLELINE)
6111 ret = reg_node(pRExC_state, SANY);
6113 ret = reg_node(pRExC_state, REG_ANY);
6114 *flagp |= HASWIDTH|SIMPLE;
6116 Set_Node_Length(ret, 1); /* MJD */
6120 char * const oregcomp_parse = ++RExC_parse;
6121 ret = regclass(pRExC_state,depth+1);
6122 if (*RExC_parse != ']') {
6123 RExC_parse = oregcomp_parse;
6124 vFAIL("Unmatched [");
6126 nextchar(pRExC_state);
6127 *flagp |= HASWIDTH|SIMPLE;
6128 Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */
6132 nextchar(pRExC_state);
6133 ret = reg(pRExC_state, 1, &flags,depth+1);
6135 if (flags & TRYAGAIN) {
6136 if (RExC_parse == RExC_end) {
6137 /* Make parent create an empty node if needed. */
6145 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
6149 if (flags & TRYAGAIN) {
6153 vFAIL("Internal urp");
6154 /* Supposed to be caught earlier. */
6157 if (!regcurly(RExC_parse)) {
6166 vFAIL("Quantifier follows nothing");
6169 switch (*++RExC_parse) {
6171 RExC_seen_zerolen++;
6172 ret = reg_node(pRExC_state, SBOL);
6174 nextchar(pRExC_state);
6175 Set_Node_Length(ret, 2); /* MJD */
6178 ret = reg_node(pRExC_state, GPOS);
6179 RExC_seen |= REG_SEEN_GPOS;
6181 nextchar(pRExC_state);
6182 Set_Node_Length(ret, 2); /* MJD */
6185 ret = reg_node(pRExC_state, SEOL);
6187 RExC_seen_zerolen++; /* Do not optimize RE away */
6188 nextchar(pRExC_state);
6191 ret = reg_node(pRExC_state, EOS);
6193 RExC_seen_zerolen++; /* Do not optimize RE away */
6194 nextchar(pRExC_state);
6195 Set_Node_Length(ret, 2); /* MJD */
6198 ret = reg_node(pRExC_state, CANY);
6199 RExC_seen |= REG_SEEN_CANY;
6200 *flagp |= HASWIDTH|SIMPLE;
6201 nextchar(pRExC_state);
6202 Set_Node_Length(ret, 2); /* MJD */
6205 ret = reg_node(pRExC_state, CLUMP);
6207 nextchar(pRExC_state);
6208 Set_Node_Length(ret, 2); /* MJD */
6211 ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM));
6212 *flagp |= HASWIDTH|SIMPLE;
6213 nextchar(pRExC_state);
6214 Set_Node_Length(ret, 2); /* MJD */
6217 ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM));
6218 *flagp |= HASWIDTH|SIMPLE;
6219 nextchar(pRExC_state);
6220 Set_Node_Length(ret, 2); /* MJD */
6223 RExC_seen_zerolen++;
6224 RExC_seen |= REG_SEEN_LOOKBEHIND;
6225 ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND));
6227 nextchar(pRExC_state);
6228 Set_Node_Length(ret, 2); /* MJD */
6231 RExC_seen_zerolen++;
6232 RExC_seen |= REG_SEEN_LOOKBEHIND;
6233 ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND));
6235 nextchar(pRExC_state);
6236 Set_Node_Length(ret, 2); /* MJD */
6239 ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE));
6240 *flagp |= HASWIDTH|SIMPLE;
6241 nextchar(pRExC_state);
6242 Set_Node_Length(ret, 2); /* MJD */
6245 ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE));
6246 *flagp |= HASWIDTH|SIMPLE;
6247 nextchar(pRExC_state);
6248 Set_Node_Length(ret, 2); /* MJD */
6251 ret = reg_node(pRExC_state, DIGIT);
6252 *flagp |= HASWIDTH|SIMPLE;
6253 nextchar(pRExC_state);
6254 Set_Node_Length(ret, 2); /* MJD */
6257 ret = reg_node(pRExC_state, NDIGIT);
6258 *flagp |= HASWIDTH|SIMPLE;
6259 nextchar(pRExC_state);
6260 Set_Node_Length(ret, 2); /* MJD */
6265 char* const oldregxend = RExC_end;
6266 char* parse_start = RExC_parse - 2;
6268 if (RExC_parse[1] == '{') {
6269 /* a lovely hack--pretend we saw [\pX] instead */
6270 RExC_end = strchr(RExC_parse, '}');
6272 const U8 c = (U8)*RExC_parse;
6274 RExC_end = oldregxend;
6275 vFAIL2("Missing right brace on \\%c{}", c);
6280 RExC_end = RExC_parse + 2;
6281 if (RExC_end > oldregxend)
6282 RExC_end = oldregxend;
6286 ret = regclass(pRExC_state,depth+1);
6288 RExC_end = oldregxend;
6291 Set_Node_Offset(ret, parse_start + 2);
6292 Set_Node_Cur_Length(ret);
6293 nextchar(pRExC_state);
6294 *flagp |= HASWIDTH|SIMPLE;
6298 /* Handle \N{NAME} here and not below because it can be
6299 multicharacter. join_exact() will join them up later on.
6300 Also this makes sure that things like /\N{BLAH}+/ and
6301 \N{BLAH} being multi char Just Happen. dmq*/
6303 ret= reg_namedseq(pRExC_state, NULL);
6305 case 'k': /* Handle \k<NAME> and \k'NAME' */
6307 char ch= RExC_parse[1];
6308 if (ch != '<' && ch != '\'') {
6310 vWARN( RExC_parse + 1,
6311 "Possible broken named back reference treated as literal k");
6315 char* name_start = (RExC_parse += 2);
6317 SV *sv_dat = reg_scan_name(pRExC_state,
6318 SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA);
6319 ch= (ch == '<') ? '>' : '\'';
6321 if (RExC_parse == name_start || *RExC_parse != ch)
6322 vFAIL2("Sequence \\k%c... not terminated",
6323 (ch == '>' ? '<' : ch));
6326 ret = reganode(pRExC_state,
6327 (U8)(FOLD ? (LOC ? NREFFL : NREFF) : NREF),
6333 num = add_data( pRExC_state, 1, "S" );
6335 RExC_rxi->data->data[num]=(void*)sv_dat;
6336 SvREFCNT_inc(sv_dat);
6338 /* override incorrect value set in reganode MJD */
6339 Set_Node_Offset(ret, parse_start+1);
6340 Set_Node_Cur_Length(ret); /* MJD */
6341 nextchar(pRExC_state);
6357 case '1': case '2': case '3': case '4':
6358 case '5': case '6': case '7': case '8': case '9':
6361 bool isrel=(*RExC_parse=='R');
6364 num = atoi(RExC_parse);
6366 num = RExC_cpar - num;
6368 vFAIL("Reference to nonexistent or unclosed group");
6370 if (num > 9 && num >= RExC_npar)
6373 char * const parse_start = RExC_parse - 1; /* MJD */
6374 while (isDIGIT(*RExC_parse))
6378 if (num > (I32)RExC_rx->nparens)
6379 vFAIL("Reference to nonexistent group");
6380 /* People make this error all the time apparently.
6381 So we cant fail on it, even though we should
6383 else if (num >= RExC_cpar)
6384 vFAIL("Reference to unclosed group will always match");
6388 ret = reganode(pRExC_state,
6389 (U8)(FOLD ? (LOC ? REFFL : REFF) : REF),
6393 /* override incorrect value set in reganode MJD */
6394 Set_Node_Offset(ret, parse_start+1);
6395 Set_Node_Cur_Length(ret); /* MJD */
6397 nextchar(pRExC_state);
6402 if (RExC_parse >= RExC_end)
6403 FAIL("Trailing \\");
6406 /* Do not generate "unrecognized" warnings here, we fall
6407 back into the quick-grab loop below */
6414 if (RExC_flags & RXf_PMf_EXTENDED) {
6415 while (RExC_parse < RExC_end && *RExC_parse != '\n')
6417 if (RExC_parse < RExC_end)
6423 register STRLEN len;
6428 U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf;
6430 parse_start = RExC_parse - 1;
6436 ret = reg_node(pRExC_state,
6437 (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT));
6439 for (len = 0, p = RExC_parse - 1;
6440 len < 127 && p < RExC_end;
6443 char * const oldp = p;
6445 if (RExC_flags & RXf_PMf_EXTENDED)
6446 p = regwhite(p, RExC_end);
6495 ender = ASCII_TO_NATIVE('\033');
6499 ender = ASCII_TO_NATIVE('\007');
6504 char* const e = strchr(p, '}');
6508 vFAIL("Missing right brace on \\x{}");
6511 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
6512 | PERL_SCAN_DISALLOW_PREFIX;
6513 STRLEN numlen = e - p - 1;
6514 ender = grok_hex(p + 1, &numlen, &flags, NULL);
6521 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
6523 ender = grok_hex(p, &numlen, &flags, NULL);
6526 if (PL_encoding && ender < 0x100)
6527 goto recode_encoding;
6531 ender = UCHARAT(p++);
6532 ender = toCTRL(ender);
6534 case '0': case '1': case '2': case '3':case '4':
6535 case '5': case '6': case '7': case '8':case '9':
6537 (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) {
6540 ender = grok_oct(p, &numlen, &flags, NULL);
6547 if (PL_encoding && ender < 0x100)
6548 goto recode_encoding;
6552 SV* enc = PL_encoding;
6553 ender = reg_recode((const char)(U8)ender, &enc);
6554 if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP))
6555 vWARN(p, "Invalid escape in the specified encoding");
6561 FAIL("Trailing \\");
6564 if (!SIZE_ONLY&& isALPHA(*p) && ckWARN(WARN_REGEXP))
6565 vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p));
6566 goto normal_default;
6571 if (UTF8_IS_START(*p) && UTF) {
6573 ender = utf8n_to_uvchr((U8*)p, RExC_end - p,
6574 &numlen, UTF8_ALLOW_DEFAULT);
6581 if (RExC_flags & RXf_PMf_EXTENDED)
6582 p = regwhite(p, RExC_end);
6584 /* Prime the casefolded buffer. */
6585 ender = toFOLD_uni(ender, tmpbuf, &foldlen);
6587 if (ISMULT2(p)) { /* Back off on ?+*. */
6592 /* Emit all the Unicode characters. */
6594 for (foldbuf = tmpbuf;
6596 foldlen -= numlen) {
6597 ender = utf8_to_uvchr(foldbuf, &numlen);
6599 const STRLEN unilen = reguni(pRExC_state, ender, s);
6602 /* In EBCDIC the numlen
6603 * and unilen can differ. */
6605 if (numlen >= foldlen)
6609 break; /* "Can't happen." */
6613 const STRLEN unilen = reguni(pRExC_state, ender, s);
6622 REGC((char)ender, s++);
6628 /* Emit all the Unicode characters. */
6630 for (foldbuf = tmpbuf;
6632 foldlen -= numlen) {
6633 ender = utf8_to_uvchr(foldbuf, &numlen);
6635 const STRLEN unilen = reguni(pRExC_state, ender, s);
6638 /* In EBCDIC the numlen
6639 * and unilen can differ. */
6641 if (numlen >= foldlen)
6649 const STRLEN unilen = reguni(pRExC_state, ender, s);
6658 REGC((char)ender, s++);
6662 Set_Node_Cur_Length(ret); /* MJD */
6663 nextchar(pRExC_state);
6665 /* len is STRLEN which is unsigned, need to copy to signed */
6668 vFAIL("Internal disaster");
6672 if (len == 1 && UNI_IS_INVARIANT(ender))
6676 RExC_size += STR_SZ(len);
6679 RExC_emit += STR_SZ(len);
6689 S_regwhite(char *p, const char *e)
6694 else if (*p == '#') {
6697 } while (p < e && *p != '\n');
6705 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
6706 Character classes ([:foo:]) can also be negated ([:^foo:]).
6707 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
6708 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
6709 but trigger failures because they are currently unimplemented. */
6711 #define POSIXCC_DONE(c) ((c) == ':')
6712 #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.')
6713 #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c))
6716 S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value)
6719 I32 namedclass = OOB_NAMEDCLASS;
6721 if (value == '[' && RExC_parse + 1 < RExC_end &&
6722 /* I smell either [: or [= or [. -- POSIX has been here, right? */
6723 POSIXCC(UCHARAT(RExC_parse))) {
6724 const char c = UCHARAT(RExC_parse);
6725 char* const s = RExC_parse++;
6727 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c)
6729 if (RExC_parse == RExC_end)
6730 /* Grandfather lone [:, [=, [. */
6733 const char* const t = RExC_parse++; /* skip over the c */
6736 if (UCHARAT(RExC_parse) == ']') {
6737 const char *posixcc = s + 1;
6738 RExC_parse++; /* skip over the ending ] */
6741 const I32 complement = *posixcc == '^' ? *posixcc++ : 0;
6742 const I32 skip = t - posixcc;
6744 /* Initially switch on the length of the name. */
6747 if (memEQ(posixcc, "word", 4)) /* this is not POSIX, this is the Perl \w */
6748 namedclass = complement ? ANYOF_NALNUM : ANYOF_ALNUM;
6751 /* Names all of length 5. */
6752 /* alnum alpha ascii blank cntrl digit graph lower
6753 print punct space upper */
6754 /* Offset 4 gives the best switch position. */
6755 switch (posixcc[4]) {
6757 if (memEQ(posixcc, "alph", 4)) /* alpha */
6758 namedclass = complement ? ANYOF_NALPHA : ANYOF_ALPHA;
6761 if (memEQ(posixcc, "spac", 4)) /* space */
6762 namedclass = complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC;
6765 if (memEQ(posixcc, "grap", 4)) /* graph */
6766 namedclass = complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
6769 if (memEQ(posixcc, "asci", 4)) /* ascii */
6770 namedclass = complement ? ANYOF_NASCII : ANYOF_ASCII;
6773 if (memEQ(posixcc, "blan", 4)) /* blank */
6774 namedclass = complement ? ANYOF_NBLANK : ANYOF_BLANK;
6777 if (memEQ(posixcc, "cntr", 4)) /* cntrl */
6778 namedclass = complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
6781 if (memEQ(posixcc, "alnu", 4)) /* alnum */
6782 namedclass = complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
6785 if (memEQ(posixcc, "lowe", 4)) /* lower */
6786 namedclass = complement ? ANYOF_NLOWER : ANYOF_LOWER;
6787 else if (memEQ(posixcc, "uppe", 4)) /* upper */
6788 namedclass = complement ? ANYOF_NUPPER : ANYOF_UPPER;
6791 if (memEQ(posixcc, "digi", 4)) /* digit */
6792 namedclass = complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
6793 else if (memEQ(posixcc, "prin", 4)) /* print */
6794 namedclass = complement ? ANYOF_NPRINT : ANYOF_PRINT;
6795 else if (memEQ(posixcc, "punc", 4)) /* punct */
6796 namedclass = complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
6801 if (memEQ(posixcc, "xdigit", 6))
6802 namedclass = complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
6806 if (namedclass == OOB_NAMEDCLASS)
6807 Simple_vFAIL3("POSIX class [:%.*s:] unknown",
6809 assert (posixcc[skip] == ':');
6810 assert (posixcc[skip+1] == ']');
6811 } else if (!SIZE_ONLY) {
6812 /* [[=foo=]] and [[.foo.]] are still future. */
6814 /* adjust RExC_parse so the warning shows after
6816 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']')
6818 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6821 /* Maternal grandfather:
6822 * "[:" ending in ":" but not in ":]" */
6832 S_checkposixcc(pTHX_ RExC_state_t *pRExC_state)
6835 if (POSIXCC(UCHARAT(RExC_parse))) {
6836 const char *s = RExC_parse;
6837 const char c = *s++;
6841 if (*s && c == *s && s[1] == ']') {
6842 if (ckWARN(WARN_REGEXP))
6844 "POSIX syntax [%c %c] belongs inside character classes",
6847 /* [[=foo=]] and [[.foo.]] are still future. */
6848 if (POSIXCC_NOTYET(c)) {
6849 /* adjust RExC_parse so the error shows after
6851 while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']')
6853 Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c);
6861 parse a class specification and produce either an ANYOF node that
6862 matches the pattern. If the pattern matches a single char only and
6863 that char is < 256 then we produce an EXACT node instead.
6866 S_regclass(pTHX_ RExC_state_t *pRExC_state, U32 depth)
6869 register UV value = 0;
6870 register UV nextvalue;
6871 register IV prevvalue = OOB_UNICODE;
6872 register IV range = 0;
6873 register regnode *ret;
6876 char *rangebegin = NULL;
6877 bool need_class = 0;
6880 bool optimize_invert = TRUE;
6881 AV* unicode_alternate = NULL;
6883 UV literal_endpoint = 0;
6885 UV stored = 0; /* number of chars stored in the class */
6887 regnode * const orig_emit = RExC_emit; /* Save the original RExC_emit in
6888 case we need to change the emitted regop to an EXACT. */
6889 const char * orig_parse = RExC_parse;
6890 GET_RE_DEBUG_FLAGS_DECL;
6892 PERL_UNUSED_ARG(depth);
6895 DEBUG_PARSE("clas");
6897 /* Assume we are going to generate an ANYOF node. */
6898 ret = reganode(pRExC_state, ANYOF, 0);
6901 ANYOF_FLAGS(ret) = 0;
6903 if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */
6907 ANYOF_FLAGS(ret) |= ANYOF_INVERT;
6911 RExC_size += ANYOF_SKIP;
6912 listsv = &PL_sv_undef; /* For code scanners: listsv always non-NULL. */
6915 RExC_emit += ANYOF_SKIP;
6917 ANYOF_FLAGS(ret) |= ANYOF_FOLD;
6919 ANYOF_FLAGS(ret) |= ANYOF_LOCALE;
6920 ANYOF_BITMAP_ZERO(ret);
6921 listsv = newSVpvs("# comment\n");
6924 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6926 if (!SIZE_ONLY && POSIXCC(nextvalue))
6927 checkposixcc(pRExC_state);
6929 /* allow 1st char to be ] (allowing it to be - is dealt with later) */
6930 if (UCHARAT(RExC_parse) == ']')
6934 while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') {
6938 namedclass = OOB_NAMEDCLASS; /* initialize as illegal */
6941 rangebegin = RExC_parse;
6943 value = utf8n_to_uvchr((U8*)RExC_parse,
6944 RExC_end - RExC_parse,
6945 &numlen, UTF8_ALLOW_DEFAULT);
6946 RExC_parse += numlen;
6949 value = UCHARAT(RExC_parse++);
6951 nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0;
6952 if (value == '[' && POSIXCC(nextvalue))
6953 namedclass = regpposixcc(pRExC_state, value);
6954 else if (value == '\\') {
6956 value = utf8n_to_uvchr((U8*)RExC_parse,
6957 RExC_end - RExC_parse,
6958 &numlen, UTF8_ALLOW_DEFAULT);
6959 RExC_parse += numlen;
6962 value = UCHARAT(RExC_parse++);
6963 /* Some compilers cannot handle switching on 64-bit integer
6964 * values, therefore value cannot be an UV. Yes, this will
6965 * be a problem later if we want switch on Unicode.
6966 * A similar issue a little bit later when switching on
6967 * namedclass. --jhi */
6968 switch ((I32)value) {
6969 case 'w': namedclass = ANYOF_ALNUM; break;
6970 case 'W': namedclass = ANYOF_NALNUM; break;
6971 case 's': namedclass = ANYOF_SPACE; break;
6972 case 'S': namedclass = ANYOF_NSPACE; break;
6973 case 'd': namedclass = ANYOF_DIGIT; break;
6974 case 'D': namedclass = ANYOF_NDIGIT; break;
6975 case 'N': /* Handle \N{NAME} in class */
6977 /* We only pay attention to the first char of
6978 multichar strings being returned. I kinda wonder
6979 if this makes sense as it does change the behaviour
6980 from earlier versions, OTOH that behaviour was broken
6982 UV v; /* value is register so we cant & it /grrr */
6983 if (reg_namedseq(pRExC_state, &v)) {
6993 if (RExC_parse >= RExC_end)
6994 vFAIL2("Empty \\%c{}", (U8)value);
6995 if (*RExC_parse == '{') {
6996 const U8 c = (U8)value;
6997 e = strchr(RExC_parse++, '}');
6999 vFAIL2("Missing right brace on \\%c{}", c);
7000 while (isSPACE(UCHARAT(RExC_parse)))
7002 if (e == RExC_parse)
7003 vFAIL2("Empty \\%c{}", c);
7005 while (isSPACE(UCHARAT(RExC_parse + n - 1)))
7013 if (UCHARAT(RExC_parse) == '^') {
7016 value = value == 'p' ? 'P' : 'p'; /* toggle */
7017 while (isSPACE(UCHARAT(RExC_parse))) {
7022 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::%.*s\n",
7023 (value=='p' ? '+' : '!'), (int)n, RExC_parse);
7026 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7027 namedclass = ANYOF_MAX; /* no official name, but it's named */
7030 case 'n': value = '\n'; break;
7031 case 'r': value = '\r'; break;
7032 case 't': value = '\t'; break;
7033 case 'f': value = '\f'; break;
7034 case 'b': value = '\b'; break;
7035 case 'e': value = ASCII_TO_NATIVE('\033');break;
7036 case 'a': value = ASCII_TO_NATIVE('\007');break;
7038 if (*RExC_parse == '{') {
7039 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
7040 | PERL_SCAN_DISALLOW_PREFIX;
7041 char * const e = strchr(RExC_parse++, '}');
7043 vFAIL("Missing right brace on \\x{}");
7045 numlen = e - RExC_parse;
7046 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
7050 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
7052 value = grok_hex(RExC_parse, &numlen, &flags, NULL);
7053 RExC_parse += numlen;
7055 if (PL_encoding && value < 0x100)
7056 goto recode_encoding;
7059 value = UCHARAT(RExC_parse++);
7060 value = toCTRL(value);
7062 case '0': case '1': case '2': case '3': case '4':
7063 case '5': case '6': case '7': case '8': case '9':
7067 value = grok_oct(--RExC_parse, &numlen, &flags, NULL);
7068 RExC_parse += numlen;
7069 if (PL_encoding && value < 0x100)
7070 goto recode_encoding;
7075 SV* enc = PL_encoding;
7076 value = reg_recode((const char)(U8)value, &enc);
7077 if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP))
7079 "Invalid escape in the specified encoding");
7083 if (!SIZE_ONLY && isALPHA(value) && ckWARN(WARN_REGEXP))
7085 "Unrecognized escape \\%c in character class passed through",
7089 } /* end of \blah */
7095 if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */
7097 if (!SIZE_ONLY && !need_class)
7098 ANYOF_CLASS_ZERO(ret);
7102 /* a bad range like a-\d, a-[:digit:] ? */
7105 if (ckWARN(WARN_REGEXP)) {
7107 RExC_parse >= rangebegin ?
7108 RExC_parse - rangebegin : 0;
7110 "False [] range \"%*.*s\"",
7113 if (prevvalue < 256) {
7114 ANYOF_BITMAP_SET(ret, prevvalue);
7115 ANYOF_BITMAP_SET(ret, '-');
7118 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7119 Perl_sv_catpvf(aTHX_ listsv,
7120 "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-');
7124 range = 0; /* this was not a true range */
7128 const char *what = NULL;
7131 if (namedclass > OOB_NAMEDCLASS)
7132 optimize_invert = FALSE;
7133 /* Possible truncation here but in some 64-bit environments
7134 * the compiler gets heartburn about switch on 64-bit values.
7135 * A similar issue a little earlier when switching on value.
7137 switch ((I32)namedclass) {
7140 ANYOF_CLASS_SET(ret, ANYOF_ALNUM);
7142 for (value = 0; value < 256; value++)
7144 ANYOF_BITMAP_SET(ret, value);
7151 ANYOF_CLASS_SET(ret, ANYOF_NALNUM);
7153 for (value = 0; value < 256; value++)
7154 if (!isALNUM(value))
7155 ANYOF_BITMAP_SET(ret, value);
7162 ANYOF_CLASS_SET(ret, ANYOF_ALNUMC);
7164 for (value = 0; value < 256; value++)
7165 if (isALNUMC(value))
7166 ANYOF_BITMAP_SET(ret, value);
7173 ANYOF_CLASS_SET(ret, ANYOF_NALNUMC);
7175 for (value = 0; value < 256; value++)
7176 if (!isALNUMC(value))
7177 ANYOF_BITMAP_SET(ret, value);
7184 ANYOF_CLASS_SET(ret, ANYOF_ALPHA);
7186 for (value = 0; value < 256; value++)
7188 ANYOF_BITMAP_SET(ret, value);
7195 ANYOF_CLASS_SET(ret, ANYOF_NALPHA);
7197 for (value = 0; value < 256; value++)
7198 if (!isALPHA(value))
7199 ANYOF_BITMAP_SET(ret, value);
7206 ANYOF_CLASS_SET(ret, ANYOF_ASCII);
7209 for (value = 0; value < 128; value++)
7210 ANYOF_BITMAP_SET(ret, value);
7212 for (value = 0; value < 256; value++) {
7214 ANYOF_BITMAP_SET(ret, value);
7223 ANYOF_CLASS_SET(ret, ANYOF_NASCII);
7226 for (value = 128; value < 256; value++)
7227 ANYOF_BITMAP_SET(ret, value);
7229 for (value = 0; value < 256; value++) {
7230 if (!isASCII(value))
7231 ANYOF_BITMAP_SET(ret, value);
7240 ANYOF_CLASS_SET(ret, ANYOF_BLANK);
7242 for (value = 0; value < 256; value++)
7244 ANYOF_BITMAP_SET(ret, value);
7251 ANYOF_CLASS_SET(ret, ANYOF_NBLANK);
7253 for (value = 0; value < 256; value++)
7254 if (!isBLANK(value))
7255 ANYOF_BITMAP_SET(ret, value);
7262 ANYOF_CLASS_SET(ret, ANYOF_CNTRL);
7264 for (value = 0; value < 256; value++)
7266 ANYOF_BITMAP_SET(ret, value);
7273 ANYOF_CLASS_SET(ret, ANYOF_NCNTRL);
7275 for (value = 0; value < 256; value++)
7276 if (!isCNTRL(value))
7277 ANYOF_BITMAP_SET(ret, value);
7284 ANYOF_CLASS_SET(ret, ANYOF_DIGIT);
7286 /* consecutive digits assumed */
7287 for (value = '0'; value <= '9'; value++)
7288 ANYOF_BITMAP_SET(ret, value);
7295 ANYOF_CLASS_SET(ret, ANYOF_NDIGIT);
7297 /* consecutive digits assumed */
7298 for (value = 0; value < '0'; value++)
7299 ANYOF_BITMAP_SET(ret, value);
7300 for (value = '9' + 1; value < 256; value++)
7301 ANYOF_BITMAP_SET(ret, value);
7308 ANYOF_CLASS_SET(ret, ANYOF_GRAPH);
7310 for (value = 0; value < 256; value++)
7312 ANYOF_BITMAP_SET(ret, value);
7319 ANYOF_CLASS_SET(ret, ANYOF_NGRAPH);
7321 for (value = 0; value < 256; value++)
7322 if (!isGRAPH(value))
7323 ANYOF_BITMAP_SET(ret, value);
7330 ANYOF_CLASS_SET(ret, ANYOF_LOWER);
7332 for (value = 0; value < 256; value++)
7334 ANYOF_BITMAP_SET(ret, value);
7341 ANYOF_CLASS_SET(ret, ANYOF_NLOWER);
7343 for (value = 0; value < 256; value++)
7344 if (!isLOWER(value))
7345 ANYOF_BITMAP_SET(ret, value);
7352 ANYOF_CLASS_SET(ret, ANYOF_PRINT);
7354 for (value = 0; value < 256; value++)
7356 ANYOF_BITMAP_SET(ret, value);
7363 ANYOF_CLASS_SET(ret, ANYOF_NPRINT);
7365 for (value = 0; value < 256; value++)
7366 if (!isPRINT(value))
7367 ANYOF_BITMAP_SET(ret, value);
7374 ANYOF_CLASS_SET(ret, ANYOF_PSXSPC);
7376 for (value = 0; value < 256; value++)
7377 if (isPSXSPC(value))
7378 ANYOF_BITMAP_SET(ret, value);
7385 ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC);
7387 for (value = 0; value < 256; value++)
7388 if (!isPSXSPC(value))
7389 ANYOF_BITMAP_SET(ret, value);
7396 ANYOF_CLASS_SET(ret, ANYOF_PUNCT);
7398 for (value = 0; value < 256; value++)
7400 ANYOF_BITMAP_SET(ret, value);
7407 ANYOF_CLASS_SET(ret, ANYOF_NPUNCT);
7409 for (value = 0; value < 256; value++)
7410 if (!isPUNCT(value))
7411 ANYOF_BITMAP_SET(ret, value);
7418 ANYOF_CLASS_SET(ret, ANYOF_SPACE);
7420 for (value = 0; value < 256; value++)
7422 ANYOF_BITMAP_SET(ret, value);
7429 ANYOF_CLASS_SET(ret, ANYOF_NSPACE);
7431 for (value = 0; value < 256; value++)
7432 if (!isSPACE(value))
7433 ANYOF_BITMAP_SET(ret, value);
7440 ANYOF_CLASS_SET(ret, ANYOF_UPPER);
7442 for (value = 0; value < 256; value++)
7444 ANYOF_BITMAP_SET(ret, value);
7451 ANYOF_CLASS_SET(ret, ANYOF_NUPPER);
7453 for (value = 0; value < 256; value++)
7454 if (!isUPPER(value))
7455 ANYOF_BITMAP_SET(ret, value);
7462 ANYOF_CLASS_SET(ret, ANYOF_XDIGIT);
7464 for (value = 0; value < 256; value++)
7465 if (isXDIGIT(value))
7466 ANYOF_BITMAP_SET(ret, value);
7473 ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT);
7475 for (value = 0; value < 256; value++)
7476 if (!isXDIGIT(value))
7477 ANYOF_BITMAP_SET(ret, value);
7483 /* this is to handle \p and \P */
7486 vFAIL("Invalid [::] class");
7490 /* Strings such as "+utf8::isWord\n" */
7491 Perl_sv_catpvf(aTHX_ listsv, "%cutf8::Is%s\n", yesno, what);
7494 ANYOF_FLAGS(ret) |= ANYOF_CLASS;
7497 } /* end of namedclass \blah */
7500 if (prevvalue > (IV)value) /* b-a */ {
7501 const int w = RExC_parse - rangebegin;
7502 Simple_vFAIL4("Invalid [] range \"%*.*s\"", w, w, rangebegin);
7503 range = 0; /* not a valid range */
7507 prevvalue = value; /* save the beginning of the range */
7508 if (*RExC_parse == '-' && RExC_parse+1 < RExC_end &&
7509 RExC_parse[1] != ']') {
7512 /* a bad range like \w-, [:word:]- ? */
7513 if (namedclass > OOB_NAMEDCLASS) {
7514 if (ckWARN(WARN_REGEXP)) {
7516 RExC_parse >= rangebegin ?
7517 RExC_parse - rangebegin : 0;
7519 "False [] range \"%*.*s\"",
7523 ANYOF_BITMAP_SET(ret, '-');
7525 range = 1; /* yeah, it's a range! */
7526 continue; /* but do it the next time */
7530 /* now is the next time */
7531 /*stored += (value - prevvalue + 1);*/
7533 if (prevvalue < 256) {
7534 const IV ceilvalue = value < 256 ? value : 255;
7537 /* In EBCDIC [\x89-\x91] should include
7538 * the \x8e but [i-j] should not. */
7539 if (literal_endpoint == 2 &&
7540 ((isLOWER(prevvalue) && isLOWER(ceilvalue)) ||
7541 (isUPPER(prevvalue) && isUPPER(ceilvalue))))
7543 if (isLOWER(prevvalue)) {
7544 for (i = prevvalue; i <= ceilvalue; i++)
7546 ANYOF_BITMAP_SET(ret, i);
7548 for (i = prevvalue; i <= ceilvalue; i++)
7550 ANYOF_BITMAP_SET(ret, i);
7555 for (i = prevvalue; i <= ceilvalue; i++) {
7556 if (!ANYOF_BITMAP_TEST(ret,i)) {
7558 ANYOF_BITMAP_SET(ret, i);
7562 if (value > 255 || UTF) {
7563 const UV prevnatvalue = NATIVE_TO_UNI(prevvalue);
7564 const UV natvalue = NATIVE_TO_UNI(value);
7565 stored+=2; /* can't optimize this class */
7566 ANYOF_FLAGS(ret) |= ANYOF_UNICODE;
7567 if (prevnatvalue < natvalue) { /* what about > ? */
7568 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n",
7569 prevnatvalue, natvalue);
7571 else if (prevnatvalue == natvalue) {
7572 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue);
7574 U8 foldbuf[UTF8_MAXBYTES_CASE+1];
7576 const UV f = to_uni_fold(natvalue, foldbuf, &foldlen);
7578 #ifdef EBCDIC /* RD t/uni/fold ff and 6b */
7579 if (RExC_precomp[0] == ':' &&
7580 RExC_precomp[1] == '[' &&
7581 (f == 0xDF || f == 0x92)) {
7582 f = NATIVE_TO_UNI(f);
7585 /* If folding and foldable and a single
7586 * character, insert also the folded version
7587 * to the charclass. */
7589 #ifdef EBCDIC /* RD tunifold ligatures s,t fb05, fb06 */
7590 if ((RExC_precomp[0] == ':' &&
7591 RExC_precomp[1] == '[' &&
7593 (value == 0xFB05 || value == 0xFB06))) ?
7594 foldlen == ((STRLEN)UNISKIP(f) - 1) :
7595 foldlen == (STRLEN)UNISKIP(f) )
7597 if (foldlen == (STRLEN)UNISKIP(f))
7599 Perl_sv_catpvf(aTHX_ listsv,
7602 /* Any multicharacter foldings
7603 * require the following transform:
7604 * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst)
7605 * where E folds into "pq" and F folds
7606 * into "rst", all other characters
7607 * fold to single characters. We save
7608 * away these multicharacter foldings,
7609 * to be later saved as part of the
7610 * additional "s" data. */
7613 if (!unicode_alternate)
7614 unicode_alternate = newAV();
7615 sv = newSVpvn((char*)foldbuf, foldlen);
7617 av_push(unicode_alternate, sv);
7621 /* If folding and the value is one of the Greek
7622 * sigmas insert a few more sigmas to make the
7623 * folding rules of the sigmas to work right.
7624 * Note that not all the possible combinations
7625 * are handled here: some of them are handled
7626 * by the standard folding rules, and some of
7627 * them (literal or EXACTF cases) are handled
7628 * during runtime in regexec.c:S_find_byclass(). */
7629 if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) {
7630 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7631 (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA);
7632 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7633 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7635 else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA)
7636 Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n",
7637 (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA);
7642 literal_endpoint = 0;
7646 range = 0; /* this range (if it was one) is done now */
7650 ANYOF_FLAGS(ret) |= ANYOF_LARGE;
7652 RExC_size += ANYOF_CLASS_ADD_SKIP;
7654 RExC_emit += ANYOF_CLASS_ADD_SKIP;
7660 /****** !SIZE_ONLY AFTER HERE *********/
7662 if( stored == 1 && value < 256
7663 && !( ANYOF_FLAGS(ret) & ( ANYOF_FLAGS_ALL ^ ANYOF_FOLD ) )
7665 /* optimize single char class to an EXACT node
7666 but *only* when its not a UTF/high char */
7667 const char * cur_parse= RExC_parse;
7668 RExC_emit = (regnode *)orig_emit;
7669 RExC_parse = (char *)orig_parse;
7670 ret = reg_node(pRExC_state,
7671 (U8)((ANYOF_FLAGS(ret) & ANYOF_FOLD) ? EXACTF : EXACT));
7672 RExC_parse = (char *)cur_parse;
7673 *STRING(ret)= (char)value;
7675 RExC_emit += STR_SZ(1);
7678 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
7679 if ( /* If the only flag is folding (plus possibly inversion). */
7680 ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD)
7682 for (value = 0; value < 256; ++value) {
7683 if (ANYOF_BITMAP_TEST(ret, value)) {
7684 UV fold = PL_fold[value];
7687 ANYOF_BITMAP_SET(ret, fold);
7690 ANYOF_FLAGS(ret) &= ~ANYOF_FOLD;
7693 /* optimize inverted simple patterns (e.g. [^a-z]) */
7694 if (optimize_invert &&
7695 /* If the only flag is inversion. */
7696 (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
7697 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
7698 ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL;
7699 ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL;
7702 AV * const av = newAV();
7704 /* The 0th element stores the character class description
7705 * in its textual form: used later (regexec.c:Perl_regclass_swash())
7706 * to initialize the appropriate swash (which gets stored in
7707 * the 1st element), and also useful for dumping the regnode.
7708 * The 2nd element stores the multicharacter foldings,
7709 * used later (regexec.c:S_reginclass()). */
7710 av_store(av, 0, listsv);
7711 av_store(av, 1, NULL);
7712 av_store(av, 2, (SV*)unicode_alternate);
7713 rv = newRV_noinc((SV*)av);
7714 n = add_data(pRExC_state, 1, "s");
7715 RExC_rxi->data->data[n] = (void*)rv;
7722 S_nextchar(pTHX_ RExC_state_t *pRExC_state)
7724 char* const retval = RExC_parse++;
7727 if (*RExC_parse == '(' && RExC_parse[1] == '?' &&
7728 RExC_parse[2] == '#') {
7729 while (*RExC_parse != ')') {
7730 if (RExC_parse == RExC_end)
7731 FAIL("Sequence (?#... not terminated");
7737 if (RExC_flags & RXf_PMf_EXTENDED) {
7738 if (isSPACE(*RExC_parse)) {
7742 else if (*RExC_parse == '#') {
7743 while (RExC_parse < RExC_end)
7744 if (*RExC_parse++ == '\n') break;
7753 - reg_node - emit a node
7755 STATIC regnode * /* Location. */
7756 S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op)
7759 register regnode *ptr;
7760 regnode * const ret = RExC_emit;
7761 GET_RE_DEBUG_FLAGS_DECL;
7764 SIZE_ALIGN(RExC_size);
7769 if (OP(RExC_emit) == 255)
7770 Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %s: %d ",
7771 reg_name[op], OP(RExC_emit));
7773 NODE_ALIGN_FILL(ret);
7775 FILL_ADVANCE_NODE(ptr, op);
7776 if (RExC_offsets) { /* MJD */
7777 MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n",
7778 "reg_node", __LINE__,
7780 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0]
7781 ? "Overwriting end of array!\n" : "OK",
7782 (UV)(RExC_emit - RExC_emit_start),
7783 (UV)(RExC_parse - RExC_start),
7784 (UV)RExC_offsets[0]));
7785 Set_Node_Offset(RExC_emit, RExC_parse + (op == END));
7793 - reganode - emit a node with an argument
7795 STATIC regnode * /* Location. */
7796 S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg)
7799 register regnode *ptr;
7800 regnode * const ret = RExC_emit;
7801 GET_RE_DEBUG_FLAGS_DECL;
7804 SIZE_ALIGN(RExC_size);
7809 assert(2==regarglen[op]+1);
7811 Anything larger than this has to allocate the extra amount.
7812 If we changed this to be:
7814 RExC_size += (1 + regarglen[op]);
7816 then it wouldn't matter. Its not clear what side effect
7817 might come from that so its not done so far.
7823 if (OP(RExC_emit) == 255)
7824 Perl_croak(aTHX_ "panic: reganode overwriting end of allocated program space");
7826 NODE_ALIGN_FILL(ret);
7828 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
7829 if (RExC_offsets) { /* MJD */
7830 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7834 (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] ?
7835 "Overwriting end of array!\n" : "OK",
7836 (UV)(RExC_emit - RExC_emit_start),
7837 (UV)(RExC_parse - RExC_start),
7838 (UV)RExC_offsets[0]));
7839 Set_Cur_Node_Offset;
7847 - reguni - emit (if appropriate) a Unicode character
7850 S_reguni(pTHX_ const RExC_state_t *pRExC_state, UV uv, char* s)
7853 return SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s);
7857 - reginsert - insert an operator in front of already-emitted operand
7859 * Means relocating the operand.
7862 S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd, U32 depth)
7865 register regnode *src;
7866 register regnode *dst;
7867 register regnode *place;
7868 const int offset = regarglen[(U8)op];
7869 const int size = NODE_STEP_REGNODE + offset;
7870 GET_RE_DEBUG_FLAGS_DECL;
7871 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
7872 DEBUG_PARSE_FMT("inst"," - %s",reg_name[op]);
7881 if (RExC_open_parens) {
7883 DEBUG_PARSE_FMT("inst"," - %"IVdf, (IV)RExC_npar);
7884 for ( paren=0 ; paren < RExC_npar ; paren++ ) {
7885 if ( RExC_open_parens[paren] >= opnd ) {
7886 DEBUG_PARSE_FMT("open"," - %d",size);
7887 RExC_open_parens[paren] += size;
7889 DEBUG_PARSE_FMT("open"," - %s","ok");
7891 if ( RExC_close_parens[paren] >= opnd ) {
7892 DEBUG_PARSE_FMT("close"," - %d",size);
7893 RExC_close_parens[paren] += size;
7895 DEBUG_PARSE_FMT("close"," - %s","ok");
7900 while (src > opnd) {
7901 StructCopy(--src, --dst, regnode);
7902 if (RExC_offsets) { /* MJD 20010112 */
7903 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %"UVuf" -> %"UVuf" (max %"UVuf").\n",
7907 (UV)(dst - RExC_emit_start) > RExC_offsets[0]
7908 ? "Overwriting end of array!\n" : "OK",
7909 (UV)(src - RExC_emit_start),
7910 (UV)(dst - RExC_emit_start),
7911 (UV)RExC_offsets[0]));
7912 Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src));
7913 Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src));
7918 place = opnd; /* Op node, where operand used to be. */
7919 if (RExC_offsets) { /* MJD */
7920 MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
7924 (UV)(place - RExC_emit_start) > RExC_offsets[0]
7925 ? "Overwriting end of array!\n" : "OK",
7926 (UV)(place - RExC_emit_start),
7927 (UV)(RExC_parse - RExC_start),
7928 (UV)RExC_offsets[0]));
7929 Set_Node_Offset(place, RExC_parse);
7930 Set_Node_Length(place, 1);
7932 src = NEXTOPER(place);
7933 FILL_ADVANCE_NODE(place, op);
7934 Zero(src, offset, regnode);
7938 - regtail - set the next-pointer at the end of a node chain of p to val.
7939 - SEE ALSO: regtail_study
7941 /* TODO: All three parms should be const */
7943 S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
7946 register regnode *scan;
7947 GET_RE_DEBUG_FLAGS_DECL;
7949 PERL_UNUSED_ARG(depth);
7955 /* Find last node. */
7958 regnode * const temp = regnext(scan);
7960 SV * const mysv=sv_newmortal();
7961 DEBUG_PARSE_MSG((scan==p ? "tail" : ""));
7962 regprop(RExC_rx, mysv, scan);
7963 PerlIO_printf(Perl_debug_log, "~ %s (%d) %s %s\n",
7964 SvPV_nolen_const(mysv), REG_NODE_NUM(scan),
7965 (temp == NULL ? "->" : ""),
7966 (temp == NULL ? reg_name[OP(val)] : "")
7974 if (reg_off_by_arg[OP(scan)]) {
7975 ARG_SET(scan, val - scan);
7978 NEXT_OFF(scan) = val - scan;
7984 - regtail_study - set the next-pointer at the end of a node chain of p to val.
7985 - Look for optimizable sequences at the same time.
7986 - currently only looks for EXACT chains.
7988 This is expermental code. The idea is to use this routine to perform
7989 in place optimizations on branches and groups as they are constructed,
7990 with the long term intention of removing optimization from study_chunk so
7991 that it is purely analytical.
7993 Currently only used when in DEBUG mode. The macro REGTAIL_STUDY() is used
7994 to control which is which.
7997 /* TODO: All four parms should be const */
8000 S_regtail_study(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth)
8003 register regnode *scan;
8005 #ifdef EXPERIMENTAL_INPLACESCAN
8009 GET_RE_DEBUG_FLAGS_DECL;
8015 /* Find last node. */
8019 regnode * const temp = regnext(scan);
8020 #ifdef EXPERIMENTAL_INPLACESCAN
8021 if (PL_regkind[OP(scan)] == EXACT)
8022 if (join_exact(pRExC_state,scan,&min,1,val,depth+1))
8030 if( exact == PSEUDO )
8032 else if ( exact != OP(scan) )
8041 SV * const mysv=sv_newmortal();
8042 DEBUG_PARSE_MSG((scan==p ? "tsdy" : ""));
8043 regprop(RExC_rx, mysv, scan);
8044 PerlIO_printf(Perl_debug_log, "~ %s (%d) -> %s\n",
8045 SvPV_nolen_const(mysv),
8054 SV * const mysv_val=sv_newmortal();
8055 DEBUG_PARSE_MSG("");
8056 regprop(RExC_rx, mysv_val, val);
8057 PerlIO_printf(Perl_debug_log, "~ attach to %s (%"IVdf") offset to %"IVdf"\n",
8058 SvPV_nolen_const(mysv_val),
8059 (IV)REG_NODE_NUM(val),
8063 if (reg_off_by_arg[OP(scan)]) {
8064 ARG_SET(scan, val - scan);
8067 NEXT_OFF(scan) = val - scan;
8075 - regcurly - a little FSA that accepts {\d+,?\d*}
8078 S_regcurly(register const char *s)
8097 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
8100 Perl_regdump(pTHX_ const regexp *r)
8104 SV * const sv = sv_newmortal();
8105 SV *dsv= sv_newmortal();
8108 (void)dumpuntil(r, ri->program, ri->program + 1, NULL, NULL, sv, 0, 0);
8110 /* Header fields of interest. */
8111 if (r->anchored_substr) {
8112 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->anchored_substr),
8113 RE_SV_DUMPLEN(r->anchored_substr), 30);
8114 PerlIO_printf(Perl_debug_log,
8115 "anchored %s%s at %"IVdf" ",
8116 s, RE_SV_TAIL(r->anchored_substr),
8117 (IV)r->anchored_offset);
8118 } else if (r->anchored_utf8) {
8119 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->anchored_utf8),
8120 RE_SV_DUMPLEN(r->anchored_utf8), 30);
8121 PerlIO_printf(Perl_debug_log,
8122 "anchored utf8 %s%s at %"IVdf" ",
8123 s, RE_SV_TAIL(r->anchored_utf8),
8124 (IV)r->anchored_offset);
8126 if (r->float_substr) {
8127 RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->float_substr),
8128 RE_SV_DUMPLEN(r->float_substr), 30);
8129 PerlIO_printf(Perl_debug_log,
8130 "floating %s%s at %"IVdf"..%"UVuf" ",
8131 s, RE_SV_TAIL(r->float_substr),
8132 (IV)r->float_min_offset, (UV)r->float_max_offset);
8133 } else if (r->float_utf8) {
8134 RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->float_utf8),
8135 RE_SV_DUMPLEN(r->float_utf8), 30);
8136 PerlIO_printf(Perl_debug_log,
8137 "floating utf8 %s%s at %"IVdf"..%"UVuf" ",
8138 s, RE_SV_TAIL(r->float_utf8),
8139 (IV)r->float_min_offset, (UV)r->float_max_offset);
8141 if (r->check_substr || r->check_utf8)
8142 PerlIO_printf(Perl_debug_log,
8144 (r->check_substr == r->float_substr
8145 && r->check_utf8 == r->float_utf8
8146 ? "(checking floating" : "(checking anchored"));
8147 if (r->extflags & RXf_NOSCAN)
8148 PerlIO_printf(Perl_debug_log, " noscan");
8149 if (r->extflags & RXf_CHECK_ALL)
8150 PerlIO_printf(Perl_debug_log, " isall");
8151 if (r->check_substr || r->check_utf8)
8152 PerlIO_printf(Perl_debug_log, ") ");
8154 if (ri->regstclass) {
8155 regprop(r, sv, ri->regstclass);
8156 PerlIO_printf(Perl_debug_log, "stclass %s ", SvPVX_const(sv));
8158 if (r->extflags & RXf_ANCH) {
8159 PerlIO_printf(Perl_debug_log, "anchored");
8160 if (r->extflags & RXf_ANCH_BOL)
8161 PerlIO_printf(Perl_debug_log, "(BOL)");
8162 if (r->extflags & RXf_ANCH_MBOL)
8163 PerlIO_printf(Perl_debug_log, "(MBOL)");
8164 if (r->extflags & RXf_ANCH_SBOL)
8165 PerlIO_printf(Perl_debug_log, "(SBOL)");
8166 if (r->extflags & RXf_ANCH_GPOS)
8167 PerlIO_printf(Perl_debug_log, "(GPOS)");
8168 PerlIO_putc(Perl_debug_log, ' ');
8170 if (r->extflags & RXf_GPOS_SEEN)
8171 PerlIO_printf(Perl_debug_log, "GPOS:%"UVuf" ", (UV)r->gofs);
8172 if (r->intflags & PREGf_SKIP)
8173 PerlIO_printf(Perl_debug_log, "plus ");
8174 if (r->intflags & PREGf_IMPLICIT)
8175 PerlIO_printf(Perl_debug_log, "implicit ");
8176 PerlIO_printf(Perl_debug_log, "minlen %"IVdf" ", (IV)r->minlen);
8177 if (r->extflags & RXf_EVAL_SEEN)
8178 PerlIO_printf(Perl_debug_log, "with eval ");
8179 PerlIO_printf(Perl_debug_log, "\n");
8181 PERL_UNUSED_CONTEXT;
8183 #endif /* DEBUGGING */
8187 - regprop - printable representation of opcode
8190 Perl_regprop(pTHX_ const regexp *prog, SV *sv, const regnode *o)
8195 RXi_GET_DECL(prog,progi);
8196 GET_RE_DEBUG_FLAGS_DECL;
8199 sv_setpvn(sv, "", 0);
8201 if (OP(o) > REGNODE_MAX) /* regnode.type is unsigned */
8202 /* It would be nice to FAIL() here, but this may be called from
8203 regexec.c, and it would be hard to supply pRExC_state. */
8204 Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(o), (int)REGNODE_MAX);
8205 sv_catpv(sv, reg_name[OP(o)]); /* Take off const! */
8207 k = PL_regkind[OP(o)];
8210 SV * const dsv = sv_2mortal(newSVpvs(""));
8211 /* Using is_utf8_string() (via PERL_PV_UNI_DETECT)
8212 * is a crude hack but it may be the best for now since
8213 * we have no flag "this EXACTish node was UTF-8"
8215 const char * const s =
8216 pv_pretty(dsv, STRING(o), STR_LEN(o), 60,
8217 PL_colors[0], PL_colors[1],
8218 PERL_PV_ESCAPE_UNI_DETECT |
8219 PERL_PV_PRETTY_ELIPSES |
8222 Perl_sv_catpvf(aTHX_ sv, " %s", s );
8223 } else if (k == TRIE) {
8224 /* print the details of the trie in dumpuntil instead, as
8225 * progi->data isn't available here */
8226 const char op = OP(o);
8227 const I32 n = ARG(o);
8228 const reg_ac_data * const ac = IS_TRIE_AC(op) ?
8229 (reg_ac_data *)progi->data->data[n] :
8231 const reg_trie_data * const trie = !IS_TRIE_AC(op) ?
8232 (reg_trie_data*)progi->data->data[n] :
8235 Perl_sv_catpvf(aTHX_ sv, "-%s",reg_name[o->flags]);
8236 DEBUG_TRIE_COMPILE_r(
8237 Perl_sv_catpvf(aTHX_ sv,
8238 "<S:%"UVuf"/%"IVdf" W:%"UVuf" L:%"UVuf"/%"UVuf" C:%"UVuf"/%"UVuf">",
8239 (UV)trie->startstate,
8240 (IV)trie->statecount-1, /* -1 because of the unused 0 element */
8241 (UV)trie->wordcount,
8244 (UV)TRIE_CHARCOUNT(trie),
8245 (UV)trie->uniquecharcount
8248 if ( IS_ANYOF_TRIE(op) || trie->bitmap ) {
8250 int rangestart = -1;
8251 U8* bitmap = IS_ANYOF_TRIE(op) ? (U8*)ANYOF_BITMAP(o) : (U8*)TRIE_BITMAP(trie);
8252 Perl_sv_catpvf(aTHX_ sv, "[");
8253 for (i = 0; i <= 256; i++) {
8254 if (i < 256 && BITMAP_TEST(bitmap,i)) {
8255 if (rangestart == -1)
8257 } else if (rangestart != -1) {
8258 if (i <= rangestart + 3)
8259 for (; rangestart < i; rangestart++)
8260 put_byte(sv, rangestart);
8262 put_byte(sv, rangestart);
8264 put_byte(sv, i - 1);
8269 Perl_sv_catpvf(aTHX_ sv, "]");
8272 } else if (k == CURLY) {
8273 if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX)
8274 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
8275 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
8277 else if (k == WHILEM && o->flags) /* Ordinal/of */
8278 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
8279 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP || OP(o)==ACCEPT)
8280 Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */
8281 else if (k == GOSUB)
8282 Perl_sv_catpvf(aTHX_ sv, "%d[%+d]", (int)ARG(o),(int)ARG2L(o)); /* Paren and offset */
8283 else if (k == VERB) {
8285 Perl_sv_catpvf(aTHX_ sv, ":%"SVf,
8286 (SV*)progi->data->data[ ARG( o ) ]);
8287 } else if (k == LOGICAL)
8288 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */
8289 else if (k == ANYOF) {
8290 int i, rangestart = -1;
8291 const U8 flags = ANYOF_FLAGS(o);
8293 /* Should be synchronized with * ANYOF_ #xdefines in regcomp.h */
8294 static const char * const anyofs[] = {
8327 if (flags & ANYOF_LOCALE)
8328 sv_catpvs(sv, "{loc}");
8329 if (flags & ANYOF_FOLD)
8330 sv_catpvs(sv, "{i}");
8331 Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]);
8332 if (flags & ANYOF_INVERT)
8334 for (i = 0; i <= 256; i++) {
8335 if (i < 256 && ANYOF_BITMAP_TEST(o,i)) {
8336 if (rangestart == -1)
8338 } else if (rangestart != -1) {
8339 if (i <= rangestart + 3)
8340 for (; rangestart < i; rangestart++)
8341 put_byte(sv, rangestart);
8343 put_byte(sv, rangestart);
8345 put_byte(sv, i - 1);
8351 if (o->flags & ANYOF_CLASS)
8352 for (i = 0; i < (int)(sizeof(anyofs)/sizeof(char*)); i++)
8353 if (ANYOF_CLASS_TEST(o,i))
8354 sv_catpv(sv, anyofs[i]);
8356 if (flags & ANYOF_UNICODE)
8357 sv_catpvs(sv, "{unicode}");
8358 else if (flags & ANYOF_UNICODE_ALL)
8359 sv_catpvs(sv, "{unicode_all}");
8363 SV * const sw = regclass_swash(prog, o, FALSE, &lv, 0);
8367 U8 s[UTF8_MAXBYTES_CASE+1];
8369 for (i = 0; i <= 256; i++) { /* just the first 256 */
8370 uvchr_to_utf8(s, i);
8372 if (i < 256 && swash_fetch(sw, s, TRUE)) {
8373 if (rangestart == -1)
8375 } else if (rangestart != -1) {
8376 if (i <= rangestart + 3)
8377 for (; rangestart < i; rangestart++) {
8378 const U8 * const e = uvchr_to_utf8(s,rangestart);
8380 for(p = s; p < e; p++)
8384 const U8 *e = uvchr_to_utf8(s,rangestart);
8386 for (p = s; p < e; p++)
8389 e = uvchr_to_utf8(s, i-1);
8390 for (p = s; p < e; p++)
8397 sv_catpvs(sv, "..."); /* et cetera */
8401 char *s = savesvpv(lv);
8402 char * const origs = s;
8404 while (*s && *s != '\n')
8408 const char * const t = ++s;
8426 Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]);
8428 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
8429 Perl_sv_catpvf(aTHX_ sv, "[%d]", -(o->flags));
8431 PERL_UNUSED_CONTEXT;
8432 PERL_UNUSED_ARG(sv);
8434 PERL_UNUSED_ARG(prog);
8435 #endif /* DEBUGGING */
8439 Perl_re_intuit_string(pTHX_ regexp *prog)
8440 { /* Assume that RE_INTUIT is set */
8442 GET_RE_DEBUG_FLAGS_DECL;
8443 PERL_UNUSED_CONTEXT;
8447 const char * const s = SvPV_nolen_const(prog->check_substr
8448 ? prog->check_substr : prog->check_utf8);
8450 if (!PL_colorset) reginitcolors();
8451 PerlIO_printf(Perl_debug_log,
8452 "%sUsing REx %ssubstr:%s \"%s%.60s%s%s\"\n",
8454 prog->check_substr ? "" : "utf8 ",
8455 PL_colors[5],PL_colors[0],
8458 (strlen(s) > 60 ? "..." : ""));
8461 return prog->check_substr ? prog->check_substr : prog->check_utf8;
8465 pregfree - free a regexp
8467 See regdupe below if you change anything here.
8471 Perl_pregfree(pTHX_ struct regexp *r)
8475 GET_RE_DEBUG_FLAGS_DECL;
8477 if (!r || (--r->refcnt > 0))
8483 SV *dsv= sv_newmortal();
8484 RE_PV_QUOTED_DECL(s, (r->extflags & RXf_UTF8),
8485 dsv, r->precomp, r->prelen, 60);
8486 PerlIO_printf(Perl_debug_log,"%sFreeing REx:%s %s\n",
8487 PL_colors[4],PL_colors[5],s);
8491 /* gcov results gave these as non-null 100% of the time, so there's no
8492 optimisation in checking them before calling Safefree */
8493 Safefree(r->precomp);
8494 Safefree(ri->offsets); /* 20010421 MJD */
8495 RX_MATCH_COPY_FREE(r);
8496 #ifdef PERL_OLD_COPY_ON_WRITE
8498 SvREFCNT_dec(r->saved_copy);
8501 if (r->anchored_substr)
8502 SvREFCNT_dec(r->anchored_substr);
8503 if (r->anchored_utf8)
8504 SvREFCNT_dec(r->anchored_utf8);
8505 if (r->float_substr)
8506 SvREFCNT_dec(r->float_substr);
8508 SvREFCNT_dec(r->float_utf8);
8509 Safefree(r->substrs);
8512 SvREFCNT_dec(r->paren_names);
8514 int n = ri->data->count;
8515 PAD* new_comppad = NULL;
8520 /* If you add a ->what type here, update the comment in regcomp.h */
8521 switch (ri->data->what[n]) {
8524 SvREFCNT_dec((SV*)ri->data->data[n]);
8527 Safefree(ri->data->data[n]);
8530 new_comppad = (AV*)ri->data->data[n];
8533 if (new_comppad == NULL)
8534 Perl_croak(aTHX_ "panic: pregfree comppad");
8535 PAD_SAVE_LOCAL(old_comppad,
8536 /* Watch out for global destruction's random ordering. */
8537 (SvTYPE(new_comppad) == SVt_PVAV) ? new_comppad : NULL
8540 refcnt = OpREFCNT_dec((OP_4tree*)ri->data->data[n]);
8543 op_free((OP_4tree*)ri->data->data[n]);
8545 PAD_RESTORE_LOCAL(old_comppad);
8546 SvREFCNT_dec((SV*)new_comppad);
8552 { /* Aho Corasick add-on structure for a trie node.
8553 Used in stclass optimization only */
8555 reg_ac_data *aho=(reg_ac_data*)ri->data->data[n];
8557 refcount = --aho->refcount;
8560 PerlMemShared_free(aho->states);
8561 PerlMemShared_free(aho->fail);
8562 aho->trie=NULL; /* not necessary to free this as it is
8563 handled by the 't' case */
8564 /* do this last!!!! */
8565 PerlMemShared_free(ri->data->data[n]);
8566 PerlMemShared_free(ri->regstclass);
8572 /* trie structure. */
8574 reg_trie_data *trie=(reg_trie_data*)ri->data->data[n];
8576 refcount = --trie->refcount;
8579 PerlMemShared_free(trie->charmap);
8580 if (trie->widecharmap)
8581 SvREFCNT_dec((SV*)trie->widecharmap);
8582 PerlMemShared_free(trie->states);
8583 PerlMemShared_free(trie->trans);
8585 PerlMemShared_free(trie->bitmap);
8587 PerlMemShared_free(trie->wordlen);
8589 PerlMemShared_free(trie->jump);
8591 PerlMemShared_free(trie->nextword);
8594 SvREFCNT_dec((SV*)trie->words);
8595 if (trie->revcharmap)
8596 SvREFCNT_dec((SV*)trie->revcharmap);
8598 /* do this last!!!! */
8599 PerlMemShared_free(ri->data->data[n]);
8604 Perl_croak(aTHX_ "panic: regfree data code '%c'", ri->data->what[n]);
8607 Safefree(ri->data->what);
8610 Safefree(r->startp);
8613 Safefree(ri->swap->startp);
8614 Safefree(ri->swap->endp);
8621 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8622 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8623 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8624 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
8627 regdupe - duplicate a regexp.
8629 This routine is called by sv.c's re_dup and is expected to clone a
8630 given regexp structure. It is a no-op when not under USE_ITHREADS.
8631 (Originally this *was* re_dup() for change history see sv.c)
8633 See pregfree() above if you change anything here.
8635 #if defined(USE_ITHREADS)
8637 Perl_regdupe(pTHX_ const regexp *r, CLONE_PARAMS *param)
8641 regexp_internal *reti;
8643 struct reg_substr_datum *s;
8647 return (REGEXP *)NULL;
8649 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8652 len = ri->offsets[0];
8653 npar = r->nparens+1;
8655 Newxz(ret, 1, regexp);
8656 Newxc(reti, sizeof(regexp_internal) + (len+1)*sizeof(regnode), char, regexp_internal);
8658 Copy(ri->program, reti->program, len+1, regnode);
8660 Newx(ret->startp, npar, I32);
8661 Copy(r->startp, ret->startp, npar, I32);
8662 Newx(ret->endp, npar, I32);
8663 Copy(r->startp, ret->startp, npar, I32);
8665 Newx(reti->swap, 1, regexp_paren_ofs);
8666 /* no need to copy these */
8667 Newx(reti->swap->startp, npar, I32);
8668 Newx(reti->swap->endp, npar, I32);
8673 Newx(ret->substrs, 1, struct reg_substr_data);
8674 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8675 s->min_offset = r->substrs->data[i].min_offset;
8676 s->max_offset = r->substrs->data[i].max_offset;
8677 s->end_shift = r->substrs->data[i].end_shift;
8678 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8679 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8682 reti->regstclass = NULL;
8685 const int count = ri->data->count;
8688 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
8689 char, struct reg_data);
8690 Newx(d->what, count, U8);
8693 for (i = 0; i < count; i++) {
8694 d->what[i] = ri->data->what[i];
8695 switch (d->what[i]) {
8696 /* legal options are one of: sSfpontT
8697 see also regcomp.h and pregfree() */
8700 case 'p': /* actually an AV, but the dup function is identical. */
8701 d->data[i] = sv_dup_inc((SV *)ri->data->data[i], param);
8704 /* This is cheating. */
8705 Newx(d->data[i], 1, struct regnode_charclass_class);
8706 StructCopy(ri->data->data[i], d->data[i],
8707 struct regnode_charclass_class);
8708 reti->regstclass = (regnode*)d->data[i];
8711 /* Compiled op trees are readonly and in shared memory,
8712 and can thus be shared without duplication. */
8714 d->data[i] = (void*)OpREFCNT_inc((OP*)ri->data->data[i]);
8718 /* Trie stclasses are readonly and can thus be shared
8719 * without duplication. We free the stclass in pregfree
8720 * when the corresponding reg_ac_data struct is freed.
8722 reti->regstclass= ri->regstclass;
8726 ((reg_trie_data*)ri->data->data[i])->refcount++;
8730 d->data[i] = ri->data->data[i];
8733 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", ri->data->what[i]);
8742 Newx(reti->offsets, 2*len+1, U32);
8743 Copy(ri->offsets, reti->offsets, 2*len+1, U32);
8745 ret->precomp = SAVEPVN(r->precomp, r->prelen);
8746 ret->refcnt = r->refcnt;
8747 ret->minlen = r->minlen;
8748 ret->minlenret = r->minlenret;
8749 ret->prelen = r->prelen;
8750 ret->nparens = r->nparens;
8751 ret->lastparen = r->lastparen;
8752 ret->lastcloseparen = r->lastcloseparen;
8753 ret->intflags = r->intflags;
8754 ret->extflags = r->extflags;
8756 ret->sublen = r->sublen;
8758 ret->engine = r->engine;
8760 ret->paren_names = hv_dup_inc(r->paren_names, param);
8762 if (RX_MATCH_COPIED(ret))
8763 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
8766 #ifdef PERL_OLD_COPY_ON_WRITE
8767 ret->saved_copy = NULL;
8770 ptr_table_store(PL_ptr_table, r, ret);
8778 converts a regexp embedded in a MAGIC struct to its stringified form,
8779 caching the converted form in the struct and returns the cached
8782 If lp is nonnull then it is used to return the length of the
8785 If flags is nonnull and the returned string contains UTF8 then
8786 (flags & 1) will be true.
8788 If haseval is nonnull then it is used to return whether the pattern
8791 Normally called via macro:
8793 CALLREG_STRINGIFY(mg,0,0);
8797 CALLREG_AS_STR(mg,lp,flags,haseval)
8799 See sv_2pv_flags() in sv.c for an example of internal usage.
8804 Perl_reg_stringify(pTHX_ MAGIC *mg, STRLEN *lp, U32 *flags, I32 *haseval ) {
8806 const regexp * const re = (regexp *)mg->mg_obj;
8807 RXi_GET_DECL(re,ri);
8810 const char *fptr = "msix";
8815 bool need_newline = 0;
8816 U16 reganch = (U16)((re->extflags & RXf_PMf_COMPILETIME) >> 12);
8818 while((ch = *fptr++)) {
8820 reflags[left++] = ch;
8823 reflags[right--] = ch;
8828 reflags[left] = '-';
8832 mg->mg_len = re->prelen + 4 + left;
8834 * If /x was used, we have to worry about a regex ending with a
8835 * comment later being embedded within another regex. If so, we don't
8836 * want this regex's "commentization" to leak out to the right part of
8837 * the enclosing regex, we must cap it with a newline.
8839 * So, if /x was used, we scan backwards from the end of the regex. If
8840 * we find a '#' before we find a newline, we need to add a newline
8841 * ourself. If we find a '\n' first (or if we don't find '#' or '\n'),
8842 * we don't need to add anything. -jfriedl
8844 if (PMf_EXTENDED & re->extflags) {
8845 const char *endptr = re->precomp + re->prelen;
8846 while (endptr >= re->precomp) {
8847 const char c = *(endptr--);
8849 break; /* don't need another */
8851 /* we end while in a comment, so we need a newline */
8852 mg->mg_len++; /* save space for it */
8853 need_newline = 1; /* note to add it */
8859 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
8860 mg->mg_ptr[0] = '(';
8861 mg->mg_ptr[1] = '?';
8862 Copy(reflags, mg->mg_ptr+2, left, char);
8863 *(mg->mg_ptr+left+2) = ':';
8864 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
8866 mg->mg_ptr[mg->mg_len - 2] = '\n';
8867 mg->mg_ptr[mg->mg_len - 1] = ')';
8868 mg->mg_ptr[mg->mg_len] = 0;
8871 *haseval = ri->program[0].next_off;
8873 *flags = ((re->extflags & RXf_UTF8) ? 1 : 0);
8881 #ifndef PERL_IN_XSUB_RE
8883 - regnext - dig the "next" pointer out of a node
8886 Perl_regnext(pTHX_ register regnode *p)
8889 register I32 offset;
8894 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
8903 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
8906 STRLEN l1 = strlen(pat1);
8907 STRLEN l2 = strlen(pat2);
8910 const char *message;
8916 Copy(pat1, buf, l1 , char);
8917 Copy(pat2, buf + l1, l2 , char);
8918 buf[l1 + l2] = '\n';
8919 buf[l1 + l2 + 1] = '\0';
8921 /* ANSI variant takes additional second argument */
8922 va_start(args, pat2);
8926 msv = vmess(buf, &args);
8928 message = SvPV_const(msv,l1);
8931 Copy(message, buf, l1 , char);
8932 buf[l1-1] = '\0'; /* Overwrite \n */
8933 Perl_croak(aTHX_ "%s", buf);
8936 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
8938 #ifndef PERL_IN_XSUB_RE
8940 Perl_save_re_context(pTHX)
8944 struct re_save_state *state;
8946 SAVEVPTR(PL_curcop);
8947 SSGROW(SAVESTACK_ALLOC_FOR_RE_SAVE_STATE + 1);
8949 state = (struct re_save_state *)(PL_savestack + PL_savestack_ix);
8950 PL_savestack_ix += SAVESTACK_ALLOC_FOR_RE_SAVE_STATE;
8951 SSPUSHINT(SAVEt_RE_STATE);
8953 Copy(&PL_reg_state, state, 1, struct re_save_state);
8955 PL_reg_start_tmp = 0;
8956 PL_reg_start_tmpl = 0;
8957 PL_reg_oldsaved = NULL;
8958 PL_reg_oldsavedlen = 0;
8960 PL_reg_leftiter = 0;
8961 PL_reg_poscache = NULL;
8962 PL_reg_poscache_size = 0;
8963 #ifdef PERL_OLD_COPY_ON_WRITE
8967 /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */
8969 const REGEXP * const rx = PM_GETRE(PL_curpm);
8972 for (i = 1; i <= rx->nparens; i++) {
8973 char digits[TYPE_CHARS(long)];
8974 const STRLEN len = my_snprintf(digits, sizeof(digits), "%lu", (long)i);
8975 GV *const *const gvp
8976 = (GV**)hv_fetch(PL_defstash, digits, len, 0);
8979 GV * const gv = *gvp;
8980 if (SvTYPE(gv) == SVt_PVGV && GvSV(gv))
8990 clear_re(pTHX_ void *r)
8993 ReREFCNT_dec((regexp *)r);
8999 S_put_byte(pTHX_ SV *sv, int c)
9001 if (isCNTRL(c) || c == 255 || !isPRINT(c))
9002 Perl_sv_catpvf(aTHX_ sv, "\\%o", c);
9003 else if (c == '-' || c == ']' || c == '\\' || c == '^')
9004 Perl_sv_catpvf(aTHX_ sv, "\\%c", c);
9006 Perl_sv_catpvf(aTHX_ sv, "%c", c);
9010 #define CLEAR_OPTSTART \
9011 if (optstart) STMT_START { \
9012 DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log, " (%"IVdf" nodes)\n", (IV)(node - optstart))); \
9016 #define DUMPUNTIL(b,e) CLEAR_OPTSTART; node=dumpuntil(r,start,(b),(e),last,sv,indent+1,depth+1);
9018 STATIC const regnode *
9019 S_dumpuntil(pTHX_ const regexp *r, const regnode *start, const regnode *node,
9020 const regnode *last, const regnode *plast,
9021 SV* sv, I32 indent, U32 depth)
9024 register U8 op = PSEUDO; /* Arbitrary non-END op. */
9025 register const regnode *next;
9026 const regnode *optstart= NULL;
9028 GET_RE_DEBUG_FLAGS_DECL;
9030 #ifdef DEBUG_DUMPUNTIL
9031 PerlIO_printf(Perl_debug_log, "--- %d : %d - %d - %d\n",indent,node-start,
9032 last ? last-start : 0,plast ? plast-start : 0);
9035 if (plast && plast < last)
9038 while (PL_regkind[op] != END && (!last || node < last)) {
9039 /* While that wasn't END last time... */
9043 if (op == CLOSE || op == WHILEM)
9045 next = regnext((regnode *)node);
9048 if (OP(node) == OPTIMIZED) {
9049 if (!optstart && RE_DEBUG_FLAG(RE_DEBUG_COMPILE_OPTIMISE))
9056 regprop(r, sv, node);
9057 PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start),
9058 (int)(2*indent + 1), "", SvPVX_const(sv));
9060 if (OP(node) != OPTIMIZED) {
9061 if (next == NULL) /* Next ptr. */
9062 PerlIO_printf(Perl_debug_log, "(0)");
9063 else if (PL_regkind[(U8)op] == BRANCH && PL_regkind[OP(next)] != BRANCH )
9064 PerlIO_printf(Perl_debug_log, "(FAIL)");
9066 PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start));
9068 /*if (PL_regkind[(U8)op] != TRIE)*/
9069 (void)PerlIO_putc(Perl_debug_log, '\n');
9073 if (PL_regkind[(U8)op] == BRANCHJ) {
9076 register const regnode *nnode = (OP(next) == LONGJMP
9077 ? regnext((regnode *)next)
9079 if (last && nnode > last)
9081 DUMPUNTIL(NEXTOPER(NEXTOPER(node)), nnode);
9084 else if (PL_regkind[(U8)op] == BRANCH) {
9086 DUMPUNTIL(NEXTOPER(node), next);
9088 else if ( PL_regkind[(U8)op] == TRIE ) {
9089 const regnode *this_trie = node;
9090 const char op = OP(node);
9091 const I32 n = ARG(node);
9092 const reg_ac_data * const ac = op>=AHOCORASICK ?
9093 (reg_ac_data *)ri->data->data[n] :
9095 const reg_trie_data * const trie = op<AHOCORASICK ?
9096 (reg_trie_data*)ri->data->data[n] :
9098 const regnode *nextbranch= NULL;
9100 sv_setpvn(sv, "", 0);
9101 for (word_idx= 0; word_idx < (I32)trie->wordcount; word_idx++) {
9102 SV ** const elem_ptr = av_fetch(trie->words,word_idx,0);
9104 PerlIO_printf(Perl_debug_log, "%*s%s ",
9105 (int)(2*(indent+3)), "",
9106 elem_ptr ? pv_pretty(sv, SvPV_nolen_const(*elem_ptr), SvCUR(*elem_ptr), 60,
9107 PL_colors[0], PL_colors[1],
9108 (SvUTF8(*elem_ptr) ? PERL_PV_ESCAPE_UNI : 0) |
9109 PERL_PV_PRETTY_ELIPSES |
9115 U16 dist= trie->jump[word_idx+1];
9116 PerlIO_printf(Perl_debug_log, "(%"UVuf")\n",
9117 (UV)((dist ? this_trie + dist : next) - start));
9120 nextbranch= this_trie + trie->jump[0];
9121 DUMPUNTIL(this_trie + dist, nextbranch);
9123 if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH)
9124 nextbranch= regnext((regnode *)nextbranch);
9126 PerlIO_printf(Perl_debug_log, "\n");
9129 if (last && next > last)
9134 else if ( op == CURLY ) { /* "next" might be very big: optimizer */
9135 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS,
9136 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1);
9138 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
9140 DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, next);
9142 else if ( op == PLUS || op == STAR) {
9143 DUMPUNTIL(NEXTOPER(node), NEXTOPER(node) + 1);
9145 else if (op == ANYOF) {
9146 /* arglen 1 + class block */
9147 node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE)
9148 ? ANYOF_CLASS_SKIP : ANYOF_SKIP);
9149 node = NEXTOPER(node);
9151 else if (PL_regkind[(U8)op] == EXACT) {
9152 /* Literal string, where present. */
9153 node += NODE_SZ_STR(node) - 1;
9154 node = NEXTOPER(node);
9157 node = NEXTOPER(node);
9158 node += regarglen[(U8)op];
9160 if (op == CURLYX || op == OPEN)
9164 #ifdef DEBUG_DUMPUNTIL
9165 PerlIO_printf(Perl_debug_log, "--- %d\n", (int)indent);
9170 #endif /* DEBUGGING */
9174 * c-indentation-style: bsd
9176 * indent-tabs-mode: t
9179 * ex: set ts=8 sts=4 sw=4 noet:
projects / p5sagit/p5-mst-13.2.git / blob