This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Re: [PATCH] Callbacks for named captures (%+ and %-)
[perl5.git] / regcomp.c
CommitLineData
a0d0e21e
LW
1/* regcomp.c
2 */
3
4/*
5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
6 */
7
61296642
DM
8/* This file contains functions for compiling a regular expression. See
9 * also regexec.c which funnily enough, contains functions for executing
166f8a29 10 * a regular expression.
e4a054ea
DM
11 *
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.
166f8a29
DM
16 */
17
a687059c
LW
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!
20 */
21
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.
25 */
26
e50aee73
AD
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.
30*/
31
b9d5759e 32#ifdef PERL_EXT_RE_BUILD
54df2634 33#include "re_top.h"
b81d288d 34#endif
56953603 35
a687059c 36/*
e50aee73 37 * pregcomp and pregexec -- regsub and regerror are not used in perl
a687059c
LW
38 *
39 * Copyright (c) 1986 by University of Toronto.
40 * Written by Henry Spencer. Not derived from licensed software.
41 *
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:
45 *
46 * 1. The author is not responsible for the consequences of use of
47 * this software, no matter how awful, even if they arise
48 * from defects in it.
49 *
50 * 2. The origin of this software must not be misrepresented, either
51 * by explicit claim or by omission.
52 *
53 * 3. Altered versions must be plainly marked as such, and must not
54 * be misrepresented as being the original software.
55 *
56 *
57 **** Alterations to Henry's code are...
58 ****
4bb101f2 59 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
fdf8c088 60 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 by Larry Wall and others
a687059c 61 ****
9ef589d8
LW
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.
64
a687059c
LW
65 *
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.
69 */
70#include "EXTERN.h"
864dbfa3 71#define PERL_IN_REGCOMP_C
a687059c 72#include "perl.h"
d06ea78c 73
acfe0abc 74#ifndef PERL_IN_XSUB_RE
d06ea78c
GS
75# include "INTERN.h"
76#endif
c277df42
IZ
77
78#define REG_COMP_C
54df2634
NC
79#ifdef PERL_IN_XSUB_RE
80# include "re_comp.h"
81#else
82# include "regcomp.h"
83#endif
a687059c 84
d4cce5f1 85#ifdef op
11343788 86#undef op
d4cce5f1 87#endif /* op */
11343788 88
fe14fcc3 89#ifdef MSDOS
7e4e8c89 90# if defined(BUGGY_MSC6)
fe14fcc3 91 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
7e4e8c89 92# pragma optimize("a",off)
fe14fcc3 93 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
7e4e8c89
NC
94# pragma optimize("w",on )
95# endif /* BUGGY_MSC6 */
fe14fcc3
LW
96#endif /* MSDOS */
97
a687059c
LW
98#ifndef STATIC
99#define STATIC static
100#endif
101
830247a4 102typedef struct RExC_state_t {
e2509266 103 U32 flags; /* are we folding, multilining? */
830247a4 104 char *precomp; /* uncompiled string. */
f8fc2ecf
YO
105 regexp *rx; /* perl core regexp structure */
106 regexp_internal *rxi; /* internal data for regexp object pprivate field */
fac92740 107 char *start; /* Start of input for compile */
830247a4
IZ
108 char *end; /* End of input for compile */
109 char *parse; /* Input-scan pointer. */
110 I32 whilem_seen; /* number of WHILEM in this expr */
fac92740 111 regnode *emit_start; /* Start of emitted-code area */
3b57cd43 112 regnode *emit_bound; /* First regnode outside of the allocated space */
ffc61ed2 113 regnode *emit; /* Code-emit pointer; &regdummy = don't = compiling */
830247a4
IZ
114 I32 naughty; /* How bad is this pattern? */
115 I32 sawback; /* Did we see \1, ...? */
116 U32 seen;
117 I32 size; /* Code size. */
c74340f9
YO
118 I32 npar; /* Capture buffer count, (OPEN). */
119 I32 cpar; /* Capture buffer count, (CLOSE). */
e2e6a0f1 120 I32 nestroot; /* root parens we are in - used by accept */
830247a4
IZ
121 I32 extralen;
122 I32 seen_zerolen;
123 I32 seen_evals;
40d049e4
YO
124 regnode **open_parens; /* pointers to open parens */
125 regnode **close_parens; /* pointers to close parens */
126 regnode *opend; /* END node in program */
02daf0ab
YO
127 I32 utf8; /* whether the pattern is utf8 or not */
128 I32 orig_utf8; /* whether the pattern was originally in utf8 */
129 /* XXX use this for future optimisation of case
130 * where pattern must be upgraded to utf8. */
6bda09f9 131 HV *charnames; /* cache of named sequences */
81714fb9 132 HV *paren_names; /* Paren names */
1f1031fe 133
40d049e4
YO
134 regnode **recurse; /* Recurse regops */
135 I32 recurse_count; /* Number of recurse regops */
830247a4
IZ
136#if ADD_TO_REGEXEC
137 char *starttry; /* -Dr: where regtry was called. */
138#define RExC_starttry (pRExC_state->starttry)
139#endif
3dab1dad 140#ifdef DEBUGGING
be8e71aa 141 const char *lastparse;
3dab1dad 142 I32 lastnum;
1f1031fe 143 AV *paren_name_list; /* idx -> name */
3dab1dad
YO
144#define RExC_lastparse (pRExC_state->lastparse)
145#define RExC_lastnum (pRExC_state->lastnum)
1f1031fe 146#define RExC_paren_name_list (pRExC_state->paren_name_list)
3dab1dad 147#endif
830247a4
IZ
148} RExC_state_t;
149
e2509266 150#define RExC_flags (pRExC_state->flags)
830247a4
IZ
151#define RExC_precomp (pRExC_state->precomp)
152#define RExC_rx (pRExC_state->rx)
f8fc2ecf 153#define RExC_rxi (pRExC_state->rxi)
fac92740 154#define RExC_start (pRExC_state->start)
830247a4
IZ
155#define RExC_end (pRExC_state->end)
156#define RExC_parse (pRExC_state->parse)
157#define RExC_whilem_seen (pRExC_state->whilem_seen)
7122b237
YO
158#ifdef RE_TRACK_PATTERN_OFFSETS
159#define RExC_offsets (pRExC_state->rxi->u.offsets) /* I am not like the others */
160#endif
830247a4 161#define RExC_emit (pRExC_state->emit)
fac92740 162#define RExC_emit_start (pRExC_state->emit_start)
3b57cd43 163#define RExC_emit_bound (pRExC_state->emit_bound)
830247a4
IZ
164#define RExC_naughty (pRExC_state->naughty)
165#define RExC_sawback (pRExC_state->sawback)
166#define RExC_seen (pRExC_state->seen)
167#define RExC_size (pRExC_state->size)
168#define RExC_npar (pRExC_state->npar)
e2e6a0f1 169#define RExC_nestroot (pRExC_state->nestroot)
830247a4
IZ
170#define RExC_extralen (pRExC_state->extralen)
171#define RExC_seen_zerolen (pRExC_state->seen_zerolen)
172#define RExC_seen_evals (pRExC_state->seen_evals)
1aa99e6b 173#define RExC_utf8 (pRExC_state->utf8)
02daf0ab 174#define RExC_orig_utf8 (pRExC_state->orig_utf8)
fc8cd66c 175#define RExC_charnames (pRExC_state->charnames)
40d049e4
YO
176#define RExC_open_parens (pRExC_state->open_parens)
177#define RExC_close_parens (pRExC_state->close_parens)
178#define RExC_opend (pRExC_state->opend)
81714fb9 179#define RExC_paren_names (pRExC_state->paren_names)
40d049e4
YO
180#define RExC_recurse (pRExC_state->recurse)
181#define RExC_recurse_count (pRExC_state->recurse_count)
830247a4 182
cde0cee5 183
a687059c
LW
184#define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
185#define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
186 ((*s) == '{' && regcurly(s)))
a687059c 187
35c8bce7
LW
188#ifdef SPSTART
189#undef SPSTART /* dratted cpp namespace... */
190#endif
a687059c
LW
191/*
192 * Flags to be passed up and down.
193 */
a687059c 194#define WORST 0 /* Worst case. */
a3b492c3
YO
195#define HASWIDTH 0x01 /* Known to match non-null strings. */
196#define SIMPLE 0x02 /* Simple enough to be STAR/PLUS operand. */
197#define SPSTART 0x04 /* Starts with * or +. */
198#define TRYAGAIN 0x08 /* Weeded out a declaration. */
199#define POSTPONED 0x10 /* (?1),(?&name), (??{...}) or similar */
a687059c 200
3dab1dad
YO
201#define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1)
202
07be1b83
YO
203/* whether trie related optimizations are enabled */
204#if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION
205#define TRIE_STUDY_OPT
786e8c11 206#define FULL_TRIE_STUDY
07be1b83
YO
207#define TRIE_STCLASS
208#endif
1de06328
YO
209
210
40d049e4
YO
211
212#define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3]
213#define PBITVAL(paren) (1 << ((paren) & 7))
214#define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren))
215#define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren)
216#define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren))
217
218
1de06328
YO
219/* About scan_data_t.
220
221 During optimisation we recurse through the regexp program performing
222 various inplace (keyhole style) optimisations. In addition study_chunk
223 and scan_commit populate this data structure with information about
224 what strings MUST appear in the pattern. We look for the longest
225 string that must appear for at a fixed location, and we look for the
226 longest string that may appear at a floating location. So for instance
227 in the pattern:
228
229 /FOO[xX]A.*B[xX]BAR/
230
231 Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating
232 strings (because they follow a .* construct). study_chunk will identify
233 both FOO and BAR as being the longest fixed and floating strings respectively.
234
235 The strings can be composites, for instance
236
237 /(f)(o)(o)/
238
239 will result in a composite fixed substring 'foo'.
240
241 For each string some basic information is maintained:
242
243 - offset or min_offset
244 This is the position the string must appear at, or not before.
245 It also implicitly (when combined with minlenp) tells us how many
246 character must match before the string we are searching.
247 Likewise when combined with minlenp and the length of the string
248 tells us how many characters must appear after the string we have
249 found.
250
251 - max_offset
252 Only used for floating strings. This is the rightmost point that
253 the string can appear at. Ifset to I32 max it indicates that the
254 string can occur infinitely far to the right.
255
256 - minlenp
257 A pointer to the minimum length of the pattern that the string
258 was found inside. This is important as in the case of positive
259 lookahead or positive lookbehind we can have multiple patterns
260 involved. Consider
261
262 /(?=FOO).*F/
263
264 The minimum length of the pattern overall is 3, the minimum length
265 of the lookahead part is 3, but the minimum length of the part that
266 will actually match is 1. So 'FOO's minimum length is 3, but the
267 minimum length for the F is 1. This is important as the minimum length
268 is used to determine offsets in front of and behind the string being
269 looked for. Since strings can be composites this is the length of the
270 pattern at the time it was commited with a scan_commit. Note that
271 the length is calculated by study_chunk, so that the minimum lengths
272 are not known until the full pattern has been compiled, thus the
273 pointer to the value.
274
275 - lookbehind
276
277 In the case of lookbehind the string being searched for can be
278 offset past the start point of the final matching string.
279 If this value was just blithely removed from the min_offset it would
280 invalidate some of the calculations for how many chars must match
281 before or after (as they are derived from min_offset and minlen and
282 the length of the string being searched for).
283 When the final pattern is compiled and the data is moved from the
284 scan_data_t structure into the regexp structure the information
285 about lookbehind is factored in, with the information that would
286 have been lost precalculated in the end_shift field for the
287 associated string.
288
289 The fields pos_min and pos_delta are used to store the minimum offset
290 and the delta to the maximum offset at the current point in the pattern.
291
292*/
2c2d71f5
JH
293
294typedef struct scan_data_t {
1de06328
YO
295 /*I32 len_min; unused */
296 /*I32 len_delta; unused */
2c2d71f5
JH
297 I32 pos_min;
298 I32 pos_delta;
299 SV *last_found;
1de06328 300 I32 last_end; /* min value, <0 unless valid. */
2c2d71f5
JH
301 I32 last_start_min;
302 I32 last_start_max;
1de06328
YO
303 SV **longest; /* Either &l_fixed, or &l_float. */
304 SV *longest_fixed; /* longest fixed string found in pattern */
305 I32 offset_fixed; /* offset where it starts */
306 I32 *minlen_fixed; /* pointer to the minlen relevent to the string */
307 I32 lookbehind_fixed; /* is the position of the string modfied by LB */
308 SV *longest_float; /* longest floating string found in pattern */
309 I32 offset_float_min; /* earliest point in string it can appear */
310 I32 offset_float_max; /* latest point in string it can appear */
311 I32 *minlen_float; /* pointer to the minlen relevent to the string */
312 I32 lookbehind_float; /* is the position of the string modified by LB */
2c2d71f5
JH
313 I32 flags;
314 I32 whilem_c;
cb434fcc 315 I32 *last_closep;
653099ff 316 struct regnode_charclass_class *start_class;
2c2d71f5
JH
317} scan_data_t;
318
a687059c 319/*
e50aee73 320 * Forward declarations for pregcomp()'s friends.
a687059c 321 */
a0d0e21e 322
27da23d5 323static const scan_data_t zero_scan_data =
1de06328 324 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0};
c277df42
IZ
325
326#define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
07be1b83
YO
327#define SF_BEFORE_SEOL 0x0001
328#define SF_BEFORE_MEOL 0x0002
c277df42
IZ
329#define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
330#define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
331
09b7f37c
CB
332#ifdef NO_UNARY_PLUS
333# define SF_FIX_SHIFT_EOL (0+2)
334# define SF_FL_SHIFT_EOL (0+4)
335#else
336# define SF_FIX_SHIFT_EOL (+2)
337# define SF_FL_SHIFT_EOL (+4)
338#endif
c277df42
IZ
339
340#define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
341#define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
342
343#define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
344#define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
07be1b83
YO
345#define SF_IS_INF 0x0040
346#define SF_HAS_PAR 0x0080
347#define SF_IN_PAR 0x0100
348#define SF_HAS_EVAL 0x0200
349#define SCF_DO_SUBSTR 0x0400
653099ff
GS
350#define SCF_DO_STCLASS_AND 0x0800
351#define SCF_DO_STCLASS_OR 0x1000
352#define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR)
e1901655 353#define SCF_WHILEM_VISITED_POS 0x2000
c277df42 354
786e8c11 355#define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */
e2e6a0f1 356#define SCF_SEEN_ACCEPT 0x8000
07be1b83 357
eb160463 358#define UTF (RExC_utf8 != 0)
bbe252da
YO
359#define LOC ((RExC_flags & RXf_PMf_LOCALE) != 0)
360#define FOLD ((RExC_flags & RXf_PMf_FOLD) != 0)
a0ed51b3 361
ffc61ed2 362#define OOB_UNICODE 12345678
93733859 363#define OOB_NAMEDCLASS -1
b8c5462f 364
a0ed51b3
LW
365#define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
366#define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
367
8615cb43 368
b45f050a
JF
369/* length of regex to show in messages that don't mark a position within */
370#define RegexLengthToShowInErrorMessages 127
371
372/*
373 * If MARKER[12] are adjusted, be sure to adjust the constants at the top
374 * of t/op/regmesg.t, the tests in t/op/re_tests, and those in
375 * op/pragma/warn/regcomp.
376 */
7253e4e3
RK
377#define MARKER1 "<-- HERE" /* marker as it appears in the description */
378#define MARKER2 " <-- HERE " /* marker as it appears within the regex */
b81d288d 379
7253e4e3 380#define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/"
b45f050a
JF
381
382/*
383 * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given
384 * arg. Show regex, up to a maximum length. If it's too long, chop and add
385 * "...".
386 */
58e23c8d 387#define _FAIL(code) STMT_START { \
bfed75c6 388 const char *ellipses = ""; \
ccb2c380
MP
389 IV len = RExC_end - RExC_precomp; \
390 \
391 if (!SIZE_ONLY) \
392 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
393 if (len > RegexLengthToShowInErrorMessages) { \
394 /* chop 10 shorter than the max, to ensure meaning of "..." */ \
395 len = RegexLengthToShowInErrorMessages - 10; \
396 ellipses = "..."; \
397 } \
58e23c8d 398 code; \
ccb2c380 399} STMT_END
8615cb43 400
58e23c8d
YO
401#define FAIL(msg) _FAIL( \
402 Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \
403 msg, (int)len, RExC_precomp, ellipses))
404
405#define FAIL2(msg,arg) _FAIL( \
406 Perl_croak(aTHX_ msg " in regex m/%.*s%s/", \
407 arg, (int)len, RExC_precomp, ellipses))
408
b45f050a 409/*
b45f050a
JF
410 * Simple_vFAIL -- like FAIL, but marks the current location in the scan
411 */
ccb2c380 412#define Simple_vFAIL(m) STMT_START { \
a28509cc 413 const IV offset = RExC_parse - RExC_precomp; \
ccb2c380
MP
414 Perl_croak(aTHX_ "%s" REPORT_LOCATION, \
415 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
416} STMT_END
b45f050a
JF
417
418/*
419 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL()
420 */
ccb2c380
MP
421#define vFAIL(m) STMT_START { \
422 if (!SIZE_ONLY) \
423 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
424 Simple_vFAIL(m); \
425} STMT_END
b45f050a
JF
426
427/*
428 * Like Simple_vFAIL(), but accepts two arguments.
429 */
ccb2c380 430#define Simple_vFAIL2(m,a1) STMT_START { \
a28509cc 431 const IV offset = RExC_parse - RExC_precomp; \
ccb2c380
MP
432 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \
433 (int)offset, RExC_precomp, RExC_precomp + offset); \
434} STMT_END
b45f050a
JF
435
436/*
437 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2().
438 */
ccb2c380
MP
439#define vFAIL2(m,a1) STMT_START { \
440 if (!SIZE_ONLY) \
441 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
442 Simple_vFAIL2(m, a1); \
443} STMT_END
b45f050a
JF
444
445
446/*
447 * Like Simple_vFAIL(), but accepts three arguments.
448 */
ccb2c380 449#define Simple_vFAIL3(m, a1, a2) STMT_START { \
a28509cc 450 const IV offset = RExC_parse - RExC_precomp; \
ccb2c380
MP
451 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \
452 (int)offset, RExC_precomp, RExC_precomp + offset); \
453} STMT_END
b45f050a
JF
454
455/*
456 * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3().
457 */
ccb2c380
MP
458#define vFAIL3(m,a1,a2) STMT_START { \
459 if (!SIZE_ONLY) \
460 SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \
461 Simple_vFAIL3(m, a1, a2); \
462} STMT_END
b45f050a
JF
463
464/*
465 * Like Simple_vFAIL(), but accepts four arguments.
466 */
ccb2c380 467#define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \
a28509cc 468 const IV offset = RExC_parse - RExC_precomp; \
ccb2c380
MP
469 S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \
470 (int)offset, RExC_precomp, RExC_precomp + offset); \
471} STMT_END
b45f050a 472
ccb2c380 473#define vWARN(loc,m) STMT_START { \
a28509cc 474 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
475 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \
476 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
477} STMT_END
478
479#define vWARNdep(loc,m) STMT_START { \
a28509cc 480 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
481 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \
482 "%s" REPORT_LOCATION, \
483 m, (int)offset, RExC_precomp, RExC_precomp + offset); \
484} STMT_END
485
486
487#define vWARN2(loc, m, a1) STMT_START { \
a28509cc 488 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
489 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
490 a1, (int)offset, RExC_precomp, RExC_precomp + offset); \
491} STMT_END
492
493#define vWARN3(loc, m, a1, a2) STMT_START { \
a28509cc 494 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
495 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
496 a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \
497} STMT_END
498
499#define vWARN4(loc, m, a1, a2, a3) STMT_START { \
a28509cc 500 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
501 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
502 a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \
503} STMT_END
504
505#define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \
a28509cc 506 const IV offset = loc - RExC_precomp; \
ccb2c380
MP
507 Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \
508 a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \
509} STMT_END
9d1d55b5 510
8615cb43 511
cd439c50 512/* Allow for side effects in s */
ccb2c380
MP
513#define REGC(c,s) STMT_START { \
514 if (!SIZE_ONLY) *(s) = (c); else (void)(s); \
515} STMT_END
cd439c50 516
fac92740
MJD
517/* Macros for recording node offsets. 20001227 mjd@plover.com
518 * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in
519 * element 2*n-1 of the array. Element #2n holds the byte length node #n.
520 * Element 0 holds the number n.
07be1b83 521 * Position is 1 indexed.
fac92740 522 */
7122b237
YO
523#ifndef RE_TRACK_PATTERN_OFFSETS
524#define Set_Node_Offset_To_R(node,byte)
525#define Set_Node_Offset(node,byte)
526#define Set_Cur_Node_Offset
527#define Set_Node_Length_To_R(node,len)
528#define Set_Node_Length(node,len)
529#define Set_Node_Cur_Length(node)
530#define Node_Offset(n)
531#define Node_Length(n)
532#define Set_Node_Offset_Length(node,offset,len)
533#define ProgLen(ri) ri->u.proglen
534#define SetProgLen(ri,x) ri->u.proglen = x
535#else
536#define ProgLen(ri) ri->u.offsets[0]
537#define SetProgLen(ri,x) ri->u.offsets[0] = x
ccb2c380
MP
538#define Set_Node_Offset_To_R(node,byte) STMT_START { \
539 if (! SIZE_ONLY) { \
540 MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \
2a49f0f5 541 __LINE__, (int)(node), (int)(byte))); \
ccb2c380 542 if((node) < 0) { \
551405c4 543 Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \
ccb2c380
MP
544 } else { \
545 RExC_offsets[2*(node)-1] = (byte); \
546 } \
547 } \
548} STMT_END
549
550#define Set_Node_Offset(node,byte) \
551 Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start)
552#define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse)
553
554#define Set_Node_Length_To_R(node,len) STMT_START { \
555 if (! SIZE_ONLY) { \
556 MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \
551405c4 557 __LINE__, (int)(node), (int)(len))); \
ccb2c380 558 if((node) < 0) { \
551405c4 559 Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \
ccb2c380
MP
560 } else { \
561 RExC_offsets[2*(node)] = (len); \
562 } \
563 } \
564} STMT_END
565
566#define Set_Node_Length(node,len) \
567 Set_Node_Length_To_R((node)-RExC_emit_start, len)
568#define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len)
569#define Set_Node_Cur_Length(node) \
570 Set_Node_Length(node, RExC_parse - parse_start)
fac92740
MJD
571
572/* Get offsets and lengths */
573#define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1])
574#define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)])
575
07be1b83
YO
576#define Set_Node_Offset_Length(node,offset,len) STMT_START { \
577 Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \
578 Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \
579} STMT_END
7122b237 580#endif
07be1b83
YO
581
582#if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS
583#define EXPERIMENTAL_INPLACESCAN
7122b237 584#endif /*RE_TRACK_PATTERN_OFFSETS*/
07be1b83 585
304ee84b
YO
586#define DEBUG_STUDYDATA(str,data,depth) \
587DEBUG_OPTIMISE_MORE_r(if(data){ \
1de06328 588 PerlIO_printf(Perl_debug_log, \
304ee84b
YO
589 "%*s" str "Pos:%"IVdf"/%"IVdf \
590 " Flags: 0x%"UVXf" Whilem_c: %"IVdf" Lcp: %"IVdf" %s", \
1de06328
YO
591 (int)(depth)*2, "", \
592 (IV)((data)->pos_min), \
593 (IV)((data)->pos_delta), \
304ee84b 594 (UV)((data)->flags), \
1de06328 595 (IV)((data)->whilem_c), \
304ee84b
YO
596 (IV)((data)->last_closep ? *((data)->last_closep) : -1), \
597 is_inf ? "INF " : "" \
1de06328
YO
598 ); \
599 if ((data)->last_found) \
600 PerlIO_printf(Perl_debug_log, \
601 "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \
602 " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \
603 SvPVX_const((data)->last_found), \
604 (IV)((data)->last_end), \
605 (IV)((data)->last_start_min), \
606 (IV)((data)->last_start_max), \
607 ((data)->longest && \
608 (data)->longest==&((data)->longest_fixed)) ? "*" : "", \
609 SvPVX_const((data)->longest_fixed), \
610 (IV)((data)->offset_fixed), \
611 ((data)->longest && \
612 (data)->longest==&((data)->longest_float)) ? "*" : "", \
613 SvPVX_const((data)->longest_float), \
614 (IV)((data)->offset_float_min), \
615 (IV)((data)->offset_float_max) \
616 ); \
617 PerlIO_printf(Perl_debug_log,"\n"); \
618});
619
acfe0abc 620static void clear_re(pTHX_ void *r);
4327152a 621
653099ff 622/* Mark that we cannot extend a found fixed substring at this point.
786e8c11 623 Update the longest found anchored substring and the longest found
653099ff
GS
624 floating substrings if needed. */
625
4327152a 626STATIC void
304ee84b 627S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp, int is_inf)
c277df42 628{
e1ec3a88
AL
629 const STRLEN l = CHR_SVLEN(data->last_found);
630 const STRLEN old_l = CHR_SVLEN(*data->longest);
1de06328 631 GET_RE_DEBUG_FLAGS_DECL;
b81d288d 632
c277df42 633 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
6b43b216 634 SvSetMagicSV(*data->longest, data->last_found);
c277df42
IZ
635 if (*data->longest == data->longest_fixed) {
636 data->offset_fixed = l ? data->last_start_min : data->pos_min;
637 if (data->flags & SF_BEFORE_EOL)
b81d288d 638 data->flags
c277df42
IZ
639 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
640 else
641 data->flags &= ~SF_FIX_BEFORE_EOL;
1de06328
YO
642 data->minlen_fixed=minlenp;
643 data->lookbehind_fixed=0;
a0ed51b3 644 }
304ee84b 645 else { /* *data->longest == data->longest_float */
c277df42 646 data->offset_float_min = l ? data->last_start_min : data->pos_min;
b81d288d
AB
647 data->offset_float_max = (l
648 ? data->last_start_max
c277df42 649 : data->pos_min + data->pos_delta);
304ee84b 650 if (is_inf || (U32)data->offset_float_max > (U32)I32_MAX)
9051bda5 651 data->offset_float_max = I32_MAX;
c277df42 652 if (data->flags & SF_BEFORE_EOL)
b81d288d 653 data->flags
c277df42
IZ
654 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
655 else
656 data->flags &= ~SF_FL_BEFORE_EOL;
1de06328
YO
657 data->minlen_float=minlenp;
658 data->lookbehind_float=0;
c277df42
IZ
659 }
660 }
661 SvCUR_set(data->last_found, 0);
0eda9292 662 {
a28509cc 663 SV * const sv = data->last_found;
097eb12c
AL
664 if (SvUTF8(sv) && SvMAGICAL(sv)) {
665 MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8);
666 if (mg)
667 mg->mg_len = 0;
668 }
0eda9292 669 }
c277df42
IZ
670 data->last_end = -1;
671 data->flags &= ~SF_BEFORE_EOL;
bcdf7404 672 DEBUG_STUDYDATA("commit: ",data,0);
c277df42
IZ
673}
674
653099ff
GS
675/* Can match anything (initialization) */
676STATIC void
097eb12c 677S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
653099ff 678{
653099ff 679 ANYOF_CLASS_ZERO(cl);
f8bef550 680 ANYOF_BITMAP_SETALL(cl);
1aa99e6b 681 cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL;
653099ff
GS
682 if (LOC)
683 cl->flags |= ANYOF_LOCALE;
684}
685
686/* Can match anything (initialization) */
687STATIC int
5f66b61c 688S_cl_is_anything(const struct regnode_charclass_class *cl)
653099ff
GS
689{
690 int value;
691
aaa51d5e 692 for (value = 0; value <= ANYOF_MAX; value += 2)
653099ff
GS
693 if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1))
694 return 1;
1aa99e6b
IH
695 if (!(cl->flags & ANYOF_UNICODE_ALL))
696 return 0;
10edeb5d 697 if (!ANYOF_BITMAP_TESTALLSET((const void*)cl))
f8bef550 698 return 0;
653099ff
GS
699 return 1;
700}
701
702/* Can match anything (initialization) */
703STATIC void
097eb12c 704S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
653099ff 705{
8ecf7187 706 Zero(cl, 1, struct regnode_charclass_class);
653099ff 707 cl->type = ANYOF;
830247a4 708 cl_anything(pRExC_state, cl);
653099ff
GS
709}
710
711STATIC void
097eb12c 712S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl)
653099ff 713{
8ecf7187 714 Zero(cl, 1, struct regnode_charclass_class);
653099ff 715 cl->type = ANYOF;
830247a4 716 cl_anything(pRExC_state, cl);
653099ff
GS
717 if (LOC)
718 cl->flags |= ANYOF_LOCALE;
719}
720
721/* 'And' a given class with another one. Can create false positives */
722/* We assume that cl is not inverted */
723STATIC void
5f66b61c 724S_cl_and(struct regnode_charclass_class *cl,
a28509cc 725 const struct regnode_charclass_class *and_with)
653099ff 726{
40d049e4
YO
727
728 assert(and_with->type == ANYOF);
653099ff
GS
729 if (!(and_with->flags & ANYOF_CLASS)
730 && !(cl->flags & ANYOF_CLASS)
731 && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
732 && !(and_with->flags & ANYOF_FOLD)
733 && !(cl->flags & ANYOF_FOLD)) {
734 int i;
735
736 if (and_with->flags & ANYOF_INVERT)
737 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
738 cl->bitmap[i] &= ~and_with->bitmap[i];
739 else
740 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
741 cl->bitmap[i] &= and_with->bitmap[i];
742 } /* XXXX: logic is complicated otherwise, leave it along for a moment. */
743 if (!(and_with->flags & ANYOF_EOS))
744 cl->flags &= ~ANYOF_EOS;
1aa99e6b 745
14ebb1a2
JH
746 if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE &&
747 !(and_with->flags & ANYOF_INVERT)) {
1aa99e6b
IH
748 cl->flags &= ~ANYOF_UNICODE_ALL;
749 cl->flags |= ANYOF_UNICODE;
750 ARG_SET(cl, ARG(and_with));
751 }
14ebb1a2
JH
752 if (!(and_with->flags & ANYOF_UNICODE_ALL) &&
753 !(and_with->flags & ANYOF_INVERT))
1aa99e6b 754 cl->flags &= ~ANYOF_UNICODE_ALL;
14ebb1a2
JH
755 if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) &&
756 !(and_with->flags & ANYOF_INVERT))
1aa99e6b 757 cl->flags &= ~ANYOF_UNICODE;
653099ff
GS
758}
759
760/* 'OR' a given class with another one. Can create false positives */
761/* We assume that cl is not inverted */
762STATIC void
097eb12c 763S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with)
653099ff 764{
653099ff
GS
765 if (or_with->flags & ANYOF_INVERT) {
766 /* We do not use
767 * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2))
768 * <= (B1 | !B2) | (CL1 | !CL2)
769 * which is wasteful if CL2 is small, but we ignore CL2:
770 * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1
771 * XXXX Can we handle case-fold? Unclear:
772 * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) =
773 * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i'))
774 */
775 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
776 && !(or_with->flags & ANYOF_FOLD)
777 && !(cl->flags & ANYOF_FOLD) ) {
778 int i;
779
780 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
781 cl->bitmap[i] |= ~or_with->bitmap[i];
782 } /* XXXX: logic is complicated otherwise */
783 else {
830247a4 784 cl_anything(pRExC_state, cl);
653099ff
GS
785 }
786 } else {
787 /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */
788 if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE)
b81d288d 789 && (!(or_with->flags & ANYOF_FOLD)
653099ff
GS
790 || (cl->flags & ANYOF_FOLD)) ) {
791 int i;
792
793 /* OR char bitmap and class bitmap separately */
794 for (i = 0; i < ANYOF_BITMAP_SIZE; i++)
795 cl->bitmap[i] |= or_with->bitmap[i];
796 if (or_with->flags & ANYOF_CLASS) {
797 for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++)
798 cl->classflags[i] |= or_with->classflags[i];
799 cl->flags |= ANYOF_CLASS;
800 }
801 }
802 else { /* XXXX: logic is complicated, leave it along for a moment. */
830247a4 803 cl_anything(pRExC_state, cl);
653099ff
GS
804 }
805 }
806 if (or_with->flags & ANYOF_EOS)
807 cl->flags |= ANYOF_EOS;
1aa99e6b
IH
808
809 if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE &&
810 ARG(cl) != ARG(or_with)) {
811 cl->flags |= ANYOF_UNICODE_ALL;
812 cl->flags &= ~ANYOF_UNICODE;
813 }
814 if (or_with->flags & ANYOF_UNICODE_ALL) {
815 cl->flags |= ANYOF_UNICODE_ALL;
816 cl->flags &= ~ANYOF_UNICODE;
817 }
653099ff
GS
818}
819
a3621e74
YO
820#define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ]
821#define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid )
822#define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate )
823#define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 )
824
3dab1dad
YO
825
826#ifdef DEBUGGING
07be1b83 827/*
2b8b4781
NC
828 dump_trie(trie,widecharmap,revcharmap)
829 dump_trie_interim_list(trie,widecharmap,revcharmap,next_alloc)
830 dump_trie_interim_table(trie,widecharmap,revcharmap,next_alloc)
3dab1dad
YO
831
832 These routines dump out a trie in a somewhat readable format.
07be1b83
YO
833 The _interim_ variants are used for debugging the interim
834 tables that are used to generate the final compressed
835 representation which is what dump_trie expects.
836
3dab1dad
YO
837 Part of the reason for their existance is to provide a form
838 of documentation as to how the different representations function.
07be1b83
YO
839
840*/
3dab1dad
YO
841
842/*
3dab1dad
YO
843 Dumps the final compressed table form of the trie to Perl_debug_log.
844 Used for debugging make_trie().
845*/
846
847STATIC void
2b8b4781
NC
848S_dump_trie(pTHX_ const struct _reg_trie_data *trie, HV *widecharmap,
849 AV *revcharmap, U32 depth)
3dab1dad
YO
850{
851 U32 state;
ab3bbdeb 852 SV *sv=sv_newmortal();
55eed653 853 int colwidth= widecharmap ? 6 : 4;
3dab1dad
YO
854 GET_RE_DEBUG_FLAGS_DECL;
855
ab3bbdeb 856
3dab1dad
YO
857 PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ",
858 (int)depth * 2 + 2,"",
859 "Match","Base","Ofs" );
860
861 for( state = 0 ; state < trie->uniquecharcount ; state++ ) {
2b8b4781 862 SV ** const tmp = av_fetch( revcharmap, state, 0);
3dab1dad 863 if ( tmp ) {
ab3bbdeb
YO
864 PerlIO_printf( Perl_debug_log, "%*s",
865 colwidth,
ddc5bc0f 866 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
ab3bbdeb
YO
867 PL_colors[0], PL_colors[1],
868 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
869 PERL_PV_ESCAPE_FIRSTCHAR
870 )
871 );
3dab1dad
YO
872 }
873 }
874 PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------",
875 (int)depth * 2 + 2,"");
876
877 for( state = 0 ; state < trie->uniquecharcount ; state++ )
ab3bbdeb 878 PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------");
3dab1dad
YO
879 PerlIO_printf( Perl_debug_log, "\n");
880
1e2e3d02 881 for( state = 1 ; state < trie->statecount ; state++ ) {
be8e71aa 882 const U32 base = trie->states[ state ].trans.base;
3dab1dad
YO
883
884 PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state);
885
886 if ( trie->states[ state ].wordnum ) {
887 PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum );
888 } else {
889 PerlIO_printf( Perl_debug_log, "%6s", "" );
890 }
891
892 PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base );
893
894 if ( base ) {
895 U32 ofs = 0;
896
897 while( ( base + ofs < trie->uniquecharcount ) ||
898 ( base + ofs - trie->uniquecharcount < trie->lasttrans
899 && trie->trans[ base + ofs - trie->uniquecharcount ].check != state))
900 ofs++;
901
902 PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs);
903
904 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
905 if ( ( base + ofs >= trie->uniquecharcount ) &&
906 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
907 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
908 {
ab3bbdeb
YO
909 PerlIO_printf( Perl_debug_log, "%*"UVXf,
910 colwidth,
3dab1dad
YO
911 (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next );
912 } else {
ab3bbdeb 913 PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." );
3dab1dad
YO
914 }
915 }
916
917 PerlIO_printf( Perl_debug_log, "]");
918
919 }
920 PerlIO_printf( Perl_debug_log, "\n" );
921 }
922}
923/*
3dab1dad
YO
924 Dumps a fully constructed but uncompressed trie in list form.
925 List tries normally only are used for construction when the number of
926 possible chars (trie->uniquecharcount) is very high.
927 Used for debugging make_trie().
928*/
929STATIC void
55eed653 930S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie,
2b8b4781
NC
931 HV *widecharmap, AV *revcharmap, U32 next_alloc,
932 U32 depth)
3dab1dad
YO
933{
934 U32 state;
ab3bbdeb 935 SV *sv=sv_newmortal();
55eed653 936 int colwidth= widecharmap ? 6 : 4;
3dab1dad
YO
937 GET_RE_DEBUG_FLAGS_DECL;
938 /* print out the table precompression. */
ab3bbdeb
YO
939 PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s",
940 (int)depth * 2 + 2,"", (int)depth * 2 + 2,"",
941 "------:-----+-----------------\n" );
3dab1dad
YO
942
943 for( state=1 ; state < next_alloc ; state ++ ) {
944 U16 charid;
945
ab3bbdeb 946 PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :",
3dab1dad
YO
947 (int)depth * 2 + 2,"", (UV)state );
948 if ( ! trie->states[ state ].wordnum ) {
949 PerlIO_printf( Perl_debug_log, "%5s| ","");
950 } else {
951 PerlIO_printf( Perl_debug_log, "W%4x| ",
952 trie->states[ state ].wordnum
953 );
954 }
955 for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) {
2b8b4781 956 SV ** const tmp = av_fetch( revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0);
ab3bbdeb
YO
957 if ( tmp ) {
958 PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ",
959 colwidth,
ddc5bc0f 960 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
ab3bbdeb
YO
961 PL_colors[0], PL_colors[1],
962 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
963 PERL_PV_ESCAPE_FIRSTCHAR
964 ) ,
1e2e3d02
YO
965 TRIE_LIST_ITEM(state,charid).forid,
966 (UV)TRIE_LIST_ITEM(state,charid).newstate
967 );
968 if (!(charid % 10))
664e119d
RGS
969 PerlIO_printf(Perl_debug_log, "\n%*s| ",
970 (int)((depth * 2) + 14), "");
1e2e3d02 971 }
ab3bbdeb
YO
972 }
973 PerlIO_printf( Perl_debug_log, "\n");
3dab1dad
YO
974 }
975}
976
977/*
3dab1dad
YO
978 Dumps a fully constructed but uncompressed trie in table form.
979 This is the normal DFA style state transition table, with a few
980 twists to facilitate compression later.
981 Used for debugging make_trie().
982*/
983STATIC void
55eed653 984S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie,
2b8b4781
NC
985 HV *widecharmap, AV *revcharmap, U32 next_alloc,
986 U32 depth)
3dab1dad
YO
987{
988 U32 state;
989 U16 charid;
ab3bbdeb 990 SV *sv=sv_newmortal();
55eed653 991 int colwidth= widecharmap ? 6 : 4;
3dab1dad
YO
992 GET_RE_DEBUG_FLAGS_DECL;
993
994 /*
995 print out the table precompression so that we can do a visual check
996 that they are identical.
997 */
998
999 PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" );
1000
1001 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
2b8b4781 1002 SV ** const tmp = av_fetch( revcharmap, charid, 0);
3dab1dad 1003 if ( tmp ) {
ab3bbdeb
YO
1004 PerlIO_printf( Perl_debug_log, "%*s",
1005 colwidth,
ddc5bc0f 1006 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth,
ab3bbdeb
YO
1007 PL_colors[0], PL_colors[1],
1008 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1009 PERL_PV_ESCAPE_FIRSTCHAR
1010 )
1011 );
3dab1dad
YO
1012 }
1013 }
1014
1015 PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" );
1016
1017 for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) {
ab3bbdeb 1018 PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------");
3dab1dad
YO
1019 }
1020
1021 PerlIO_printf( Perl_debug_log, "\n" );
1022
1023 for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) {
1024
1025 PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ",
1026 (int)depth * 2 + 2,"",
1027 (UV)TRIE_NODENUM( state ) );
1028
1029 for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) {
ab3bbdeb
YO
1030 UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next );
1031 if (v)
1032 PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v );
1033 else
1034 PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." );
3dab1dad
YO
1035 }
1036 if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) {
1037 PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check );
1038 } else {
1039 PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check,
1040 trie->states[ TRIE_NODENUM( state ) ].wordnum );
1041 }
1042 }
07be1b83 1043}
3dab1dad
YO
1044
1045#endif
1046
786e8c11
YO
1047/* make_trie(startbranch,first,last,tail,word_count,flags,depth)
1048 startbranch: the first branch in the whole branch sequence
1049 first : start branch of sequence of branch-exact nodes.
1050 May be the same as startbranch
1051 last : Thing following the last branch.
1052 May be the same as tail.
1053 tail : item following the branch sequence
1054 count : words in the sequence
1055 flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/
1056 depth : indent depth
3dab1dad 1057
786e8c11 1058Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node.
07be1b83 1059
786e8c11
YO
1060A trie is an N'ary tree where the branches are determined by digital
1061decomposition of the key. IE, at the root node you look up the 1st character and
1062follow that branch repeat until you find the end of the branches. Nodes can be
1063marked as "accepting" meaning they represent a complete word. Eg:
07be1b83 1064
786e8c11 1065 /he|she|his|hers/
72f13be8 1066
786e8c11
YO
1067would convert into the following structure. Numbers represent states, letters
1068following numbers represent valid transitions on the letter from that state, if
1069the number is in square brackets it represents an accepting state, otherwise it
1070will be in parenthesis.
07be1b83 1071
786e8c11
YO
1072 +-h->+-e->[3]-+-r->(8)-+-s->[9]
1073 | |
1074 | (2)
1075 | |
1076 (1) +-i->(6)-+-s->[7]
1077 |
1078 +-s->(3)-+-h->(4)-+-e->[5]
07be1b83 1079
786e8c11
YO
1080 Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers)
1081
1082This shows that when matching against the string 'hers' we will begin at state 1
1083read 'h' and move to state 2, read 'e' and move to state 3 which is accepting,
1084then read 'r' and go to state 8 followed by 's' which takes us to state 9 which
1085is also accepting. Thus we know that we can match both 'he' and 'hers' with a
1086single traverse. We store a mapping from accepting to state to which word was
1087matched, and then when we have multiple possibilities we try to complete the
1088rest of the regex in the order in which they occured in the alternation.
1089
1090The only prior NFA like behaviour that would be changed by the TRIE support is
1091the silent ignoring of duplicate alternations which are of the form:
1092
1093 / (DUPE|DUPE) X? (?{ ... }) Y /x
1094
1095Thus EVAL blocks follwing a trie may be called a different number of times with
1096and without the optimisation. With the optimisations dupes will be silently
1097ignored. This inconsistant behaviour of EVAL type nodes is well established as
1098the following demonstrates:
1099
1100 'words'=~/(word|word|word)(?{ print $1 })[xyz]/
1101
1102which prints out 'word' three times, but
1103
1104 'words'=~/(word|word|word)(?{ print $1 })S/
1105
1106which doesnt print it out at all. This is due to other optimisations kicking in.
1107
1108Example of what happens on a structural level:
1109
1110The regexp /(ac|ad|ab)+/ will produce the folowing debug output:
1111
1112 1: CURLYM[1] {1,32767}(18)
1113 5: BRANCH(8)
1114 6: EXACT <ac>(16)
1115 8: BRANCH(11)
1116 9: EXACT <ad>(16)
1117 11: BRANCH(14)
1118 12: EXACT <ab>(16)
1119 16: SUCCEED(0)
1120 17: NOTHING(18)
1121 18: END(0)
1122
1123This would be optimizable with startbranch=5, first=5, last=16, tail=16
1124and should turn into:
1125
1126 1: CURLYM[1] {1,32767}(18)
1127 5: TRIE(16)
1128 [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1]
1129 <ac>
1130 <ad>
1131 <ab>
1132 16: SUCCEED(0)
1133 17: NOTHING(18)
1134 18: END(0)
1135
1136Cases where tail != last would be like /(?foo|bar)baz/:
1137
1138 1: BRANCH(4)
1139 2: EXACT <foo>(8)
1140 4: BRANCH(7)
1141 5: EXACT <bar>(8)
1142 7: TAIL(8)
1143 8: EXACT <baz>(10)
1144 10: END(0)
1145
1146which would be optimizable with startbranch=1, first=1, last=7, tail=8
1147and would end up looking like:
1148
1149 1: TRIE(8)
1150 [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1]
1151 <foo>
1152 <bar>
1153 7: TAIL(8)
1154 8: EXACT <baz>(10)
1155 10: END(0)
1156
1157 d = uvuni_to_utf8_flags(d, uv, 0);
1158
1159is the recommended Unicode-aware way of saying
1160
1161 *(d++) = uv;
1162*/
1163
1e2e3d02 1164#define TRIE_STORE_REVCHAR \
786e8c11 1165 STMT_START { \
1e2e3d02 1166 SV *tmp = newSVpvs(""); \
786e8c11 1167 if (UTF) SvUTF8_on(tmp); \
1e2e3d02 1168 Perl_sv_catpvf( aTHX_ tmp, "%c", (int)uvc ); \
2b8b4781 1169 av_push( revcharmap, tmp ); \
786e8c11
YO
1170 } STMT_END
1171
1172#define TRIE_READ_CHAR STMT_START { \
1173 wordlen++; \
1174 if ( UTF ) { \
1175 if ( folder ) { \
1176 if ( foldlen > 0 ) { \
1177 uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \
1178 foldlen -= len; \
1179 scan += len; \
1180 len = 0; \
1181 } else { \
1182 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1183 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1184 foldlen -= UNISKIP( uvc ); \
1185 scan = foldbuf + UNISKIP( uvc ); \
1186 } \
1187 } else { \
1188 uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\
1189 } \
1190 } else { \
1191 uvc = (U32)*uc; \
1192 len = 1; \
1193 } \
1194} STMT_END
1195
1196
1197
1198#define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \
1199 if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \
f9003953
NC
1200 U32 ging = TRIE_LIST_LEN( state ) *= 2; \
1201 Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \
786e8c11
YO
1202 } \
1203 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \
1204 TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \
1205 TRIE_LIST_CUR( state )++; \
1206} STMT_END
07be1b83 1207
786e8c11
YO
1208#define TRIE_LIST_NEW(state) STMT_START { \
1209 Newxz( trie->states[ state ].trans.list, \
1210 4, reg_trie_trans_le ); \
1211 TRIE_LIST_CUR( state ) = 1; \
1212 TRIE_LIST_LEN( state ) = 4; \
1213} STMT_END
07be1b83 1214
786e8c11
YO
1215#define TRIE_HANDLE_WORD(state) STMT_START { \
1216 U16 dupe= trie->states[ state ].wordnum; \
1217 regnode * const noper_next = regnext( noper ); \
1218 \
1219 if (trie->wordlen) \
1220 trie->wordlen[ curword ] = wordlen; \
1221 DEBUG_r({ \
1222 /* store the word for dumping */ \
1223 SV* tmp; \
1224 if (OP(noper) != NOTHING) \
1225 tmp = newSVpvn(STRING(noper), STR_LEN(noper)); \
1226 else \
1227 tmp = newSVpvn( "", 0 ); \
1228 if ( UTF ) SvUTF8_on( tmp ); \
2b8b4781 1229 av_push( trie_words, tmp ); \
786e8c11
YO
1230 }); \
1231 \
1232 curword++; \
1233 \
1234 if ( noper_next < tail ) { \
1235 if (!trie->jump) \
c944940b 1236 trie->jump = (U16 *) PerlMemShared_calloc( word_count + 1, sizeof(U16) ); \
7f69552c 1237 trie->jump[curword] = (U16)(noper_next - convert); \
786e8c11
YO
1238 if (!jumper) \
1239 jumper = noper_next; \
1240 if (!nextbranch) \
1241 nextbranch= regnext(cur); \
1242 } \
1243 \
1244 if ( dupe ) { \
1245 /* So it's a dupe. This means we need to maintain a */\
1246 /* linked-list from the first to the next. */\
1247 /* we only allocate the nextword buffer when there */\
1248 /* a dupe, so first time we have to do the allocation */\
1249 if (!trie->nextword) \
c944940b 1250 trie->nextword = (U16 *) \
446bd890 1251 PerlMemShared_calloc( word_count + 1, sizeof(U16)); \
786e8c11
YO
1252 while ( trie->nextword[dupe] ) \
1253 dupe= trie->nextword[dupe]; \
1254 trie->nextword[dupe]= curword; \
1255 } else { \
1256 /* we haven't inserted this word yet. */ \
1257 trie->states[ state ].wordnum = curword; \
1258 } \
1259} STMT_END
07be1b83 1260
3dab1dad 1261
786e8c11
YO
1262#define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \
1263 ( ( base + charid >= ucharcount \
1264 && base + charid < ubound \
1265 && state == trie->trans[ base - ucharcount + charid ].check \
1266 && trie->trans[ base - ucharcount + charid ].next ) \
1267 ? trie->trans[ base - ucharcount + charid ].next \
1268 : ( state==1 ? special : 0 ) \
1269 )
3dab1dad 1270
786e8c11
YO
1271#define MADE_TRIE 1
1272#define MADE_JUMP_TRIE 2
1273#define MADE_EXACT_TRIE 4
3dab1dad 1274
a3621e74 1275STATIC I32
786e8c11 1276S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth)
a3621e74 1277{
27da23d5 1278 dVAR;
a3621e74
YO
1279 /* first pass, loop through and scan words */
1280 reg_trie_data *trie;
55eed653 1281 HV *widecharmap = NULL;
2b8b4781 1282 AV *revcharmap = newAV();
a3621e74 1283 regnode *cur;
9f7f3913 1284 const U32 uniflags = UTF8_ALLOW_DEFAULT;
a3621e74
YO
1285 STRLEN len = 0;
1286 UV uvc = 0;
1287 U16 curword = 0;
1288 U32 next_alloc = 0;
786e8c11
YO
1289 regnode *jumper = NULL;
1290 regnode *nextbranch = NULL;
7f69552c 1291 regnode *convert = NULL;
a3621e74 1292 /* we just use folder as a flag in utf8 */
e1ec3a88 1293 const U8 * const folder = ( flags == EXACTF
a3621e74
YO
1294 ? PL_fold
1295 : ( flags == EXACTFL
1296 ? PL_fold_locale
1297 : NULL
1298 )
1299 );
1300
2b8b4781
NC
1301#ifdef DEBUGGING
1302 const U32 data_slot = add_data( pRExC_state, 4, "tuuu" );
1303 AV *trie_words = NULL;
1304 /* along with revcharmap, this only used during construction but both are
1305 * useful during debugging so we store them in the struct when debugging.
8e11feef 1306 */
2b8b4781
NC
1307#else
1308 const U32 data_slot = add_data( pRExC_state, 2, "tu" );
3dab1dad 1309 STRLEN trie_charcount=0;
3dab1dad 1310#endif
2b8b4781 1311 SV *re_trie_maxbuff;
a3621e74 1312 GET_RE_DEBUG_FLAGS_DECL;
72f13be8
YO
1313#ifndef DEBUGGING
1314 PERL_UNUSED_ARG(depth);
1315#endif
a3621e74 1316
c944940b 1317 trie = (reg_trie_data *) PerlMemShared_calloc( 1, sizeof(reg_trie_data) );
a3621e74 1318 trie->refcount = 1;
3dab1dad 1319 trie->startstate = 1;
786e8c11 1320 trie->wordcount = word_count;
f8fc2ecf 1321 RExC_rxi->data->data[ data_slot ] = (void*)trie;
c944940b 1322 trie->charmap = (U16 *) PerlMemShared_calloc( 256, sizeof(U16) );
3dab1dad 1323 if (!(UTF && folder))
c944940b 1324 trie->bitmap = (char *) PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 );
a3621e74 1325 DEBUG_r({
2b8b4781 1326 trie_words = newAV();
a3621e74 1327 });
a3621e74 1328
0111c4fd 1329 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
a3621e74 1330 if (!SvIOK(re_trie_maxbuff)) {
0111c4fd 1331 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
a3621e74 1332 }
3dab1dad
YO
1333 DEBUG_OPTIMISE_r({
1334 PerlIO_printf( Perl_debug_log,
786e8c11 1335 "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n",
3dab1dad
YO
1336 (int)depth * 2 + 2, "",
1337 REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
786e8c11 1338 REG_NODE_NUM(last), REG_NODE_NUM(tail),
85c3142d 1339 (int)depth);
3dab1dad 1340 });
7f69552c
YO
1341
1342 /* Find the node we are going to overwrite */
1343 if ( first == startbranch && OP( last ) != BRANCH ) {
1344 /* whole branch chain */
1345 convert = first;
1346 } else {
1347 /* branch sub-chain */
1348 convert = NEXTOPER( first );
1349 }
1350
a3621e74
YO
1351 /* -- First loop and Setup --
1352
1353 We first traverse the branches and scan each word to determine if it
1354 contains widechars, and how many unique chars there are, this is
1355 important as we have to build a table with at least as many columns as we
1356 have unique chars.
1357
1358 We use an array of integers to represent the character codes 0..255
1359 (trie->charmap) and we use a an HV* to store unicode characters. We use the
1360 native representation of the character value as the key and IV's for the
1361 coded index.
1362
1363 *TODO* If we keep track of how many times each character is used we can
1364 remap the columns so that the table compression later on is more
1365 efficient in terms of memory by ensuring most common value is in the
1366 middle and the least common are on the outside. IMO this would be better
1367 than a most to least common mapping as theres a decent chance the most
1368 common letter will share a node with the least common, meaning the node
1369 will not be compressable. With a middle is most common approach the worst
1370 case is when we have the least common nodes twice.
1371
1372 */
1373
a3621e74 1374 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
c445ea15 1375 regnode * const noper = NEXTOPER( cur );
e1ec3a88 1376 const U8 *uc = (U8*)STRING( noper );
a28509cc 1377 const U8 * const e = uc + STR_LEN( noper );
a3621e74
YO
1378 STRLEN foldlen = 0;
1379 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
2af232bd 1380 const U8 *scan = (U8*)NULL;
07be1b83 1381 U32 wordlen = 0; /* required init */
02daf0ab
YO
1382 STRLEN chars = 0;
1383 bool set_bit = trie->bitmap ? 1 : 0; /*store the first char in the bitmap?*/
a3621e74 1384
3dab1dad
YO
1385 if (OP(noper) == NOTHING) {
1386 trie->minlen= 0;
1387 continue;
1388 }
02daf0ab
YO
1389 if ( set_bit ) /* bitmap only alloced when !(UTF&&Folding) */
1390 TRIE_BITMAP_SET(trie,*uc); /* store the raw first byte
1391 regardless of encoding */
1392
a3621e74 1393 for ( ; uc < e ; uc += len ) {
3dab1dad 1394 TRIE_CHARCOUNT(trie)++;
a3621e74 1395 TRIE_READ_CHAR;
3dab1dad 1396 chars++;
a3621e74
YO
1397 if ( uvc < 256 ) {
1398 if ( !trie->charmap[ uvc ] ) {
1399 trie->charmap[ uvc ]=( ++trie->uniquecharcount );
1400 if ( folder )
1401 trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ];
3dab1dad 1402 TRIE_STORE_REVCHAR;
a3621e74 1403 }
02daf0ab
YO
1404 if ( set_bit ) {
1405 /* store the codepoint in the bitmap, and if its ascii
1406 also store its folded equivelent. */
1407 TRIE_BITMAP_SET(trie,uvc);
1408 if ( folder ) TRIE_BITMAP_SET(trie,folder[ uvc ]);
1409 set_bit = 0; /* We've done our bit :-) */
1410 }
a3621e74
YO
1411 } else {
1412 SV** svpp;
55eed653
NC
1413 if ( !widecharmap )
1414 widecharmap = newHV();
a3621e74 1415
55eed653 1416 svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 1 );
a3621e74
YO
1417
1418 if ( !svpp )
e4584336 1419 Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc );
a3621e74
YO
1420
1421 if ( !SvTRUE( *svpp ) ) {
1422 sv_setiv( *svpp, ++trie->uniquecharcount );
3dab1dad 1423 TRIE_STORE_REVCHAR;
a3621e74
YO
1424 }
1425 }
1426 }
3dab1dad
YO
1427 if( cur == first ) {
1428 trie->minlen=chars;
1429 trie->maxlen=chars;
1430 } else if (chars < trie->minlen) {
1431 trie->minlen=chars;
1432 } else if (chars > trie->maxlen) {
1433 trie->maxlen=chars;
1434 }
1435
a3621e74
YO
1436 } /* end first pass */
1437 DEBUG_TRIE_COMPILE_r(
3dab1dad
YO
1438 PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
1439 (int)depth * 2 + 2,"",
55eed653 1440 ( widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
be8e71aa
YO
1441 (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
1442 (int)trie->minlen, (int)trie->maxlen )
a3621e74 1443 );
c944940b 1444 trie->wordlen = (U32 *) PerlMemShared_calloc( word_count, sizeof(U32) );
a3621e74
YO
1445
1446 /*
1447 We now know what we are dealing with in terms of unique chars and
1448 string sizes so we can calculate how much memory a naive
0111c4fd
RGS
1449 representation using a flat table will take. If it's over a reasonable
1450 limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory
a3621e74
YO
1451 conservative but potentially much slower representation using an array
1452 of lists.
1453
1454 At the end we convert both representations into the same compressed
1455 form that will be used in regexec.c for matching with. The latter
1456 is a form that cannot be used to construct with but has memory
1457 properties similar to the list form and access properties similar
1458 to the table form making it both suitable for fast searches and
1459 small enough that its feasable to store for the duration of a program.
1460
1461 See the comment in the code where the compressed table is produced
1462 inplace from the flat tabe representation for an explanation of how
1463 the compression works.
1464
1465 */
1466
1467
3dab1dad 1468 if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) {
a3621e74
YO
1469 /*
1470 Second Pass -- Array Of Lists Representation
1471
1472 Each state will be represented by a list of charid:state records
1473 (reg_trie_trans_le) the first such element holds the CUR and LEN
1474 points of the allocated array. (See defines above).
1475
1476 We build the initial structure using the lists, and then convert
1477 it into the compressed table form which allows faster lookups
1478 (but cant be modified once converted).
a3621e74
YO
1479 */
1480
a3621e74
YO
1481 STRLEN transcount = 1;
1482
1e2e3d02
YO
1483 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1484 "%*sCompiling trie using list compiler\n",
1485 (int)depth * 2 + 2, ""));
446bd890 1486
c944940b
JH
1487 trie->states = (reg_trie_state *)
1488 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1489 sizeof(reg_trie_state) );
a3621e74
YO
1490 TRIE_LIST_NEW(1);
1491 next_alloc = 2;
1492
1493 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1494
c445ea15
AL
1495 regnode * const noper = NEXTOPER( cur );
1496 U8 *uc = (U8*)STRING( noper );
1497 const U8 * const e = uc + STR_LEN( noper );
1498 U32 state = 1; /* required init */
1499 U16 charid = 0; /* sanity init */
1500 U8 *scan = (U8*)NULL; /* sanity init */
1501 STRLEN foldlen = 0; /* required init */
07be1b83 1502 U32 wordlen = 0; /* required init */
c445ea15
AL
1503 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1504
3dab1dad 1505 if (OP(noper) != NOTHING) {
786e8c11 1506 for ( ; uc < e ; uc += len ) {
c445ea15 1507
786e8c11 1508 TRIE_READ_CHAR;
c445ea15 1509
786e8c11
YO
1510 if ( uvc < 256 ) {
1511 charid = trie->charmap[ uvc ];
c445ea15 1512 } else {
55eed653 1513 SV** const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
786e8c11
YO
1514 if ( !svpp ) {
1515 charid = 0;
1516 } else {
1517 charid=(U16)SvIV( *svpp );
1518 }
c445ea15 1519 }
786e8c11
YO
1520 /* charid is now 0 if we dont know the char read, or nonzero if we do */
1521 if ( charid ) {
a3621e74 1522
786e8c11
YO
1523 U16 check;
1524 U32 newstate = 0;
a3621e74 1525
786e8c11
YO
1526 charid--;
1527 if ( !trie->states[ state ].trans.list ) {
1528 TRIE_LIST_NEW( state );
c445ea15 1529 }
786e8c11
YO
1530 for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) {
1531 if ( TRIE_LIST_ITEM( state, check ).forid == charid ) {
1532 newstate = TRIE_LIST_ITEM( state, check ).newstate;
1533 break;
1534 }
1535 }
1536 if ( ! newstate ) {
1537 newstate = next_alloc++;
1538 TRIE_LIST_PUSH( state, charid, newstate );
1539 transcount++;
1540 }
1541 state = newstate;
1542 } else {
1543 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
c445ea15 1544 }
a28509cc 1545 }
c445ea15 1546 }
3dab1dad 1547 TRIE_HANDLE_WORD(state);
a3621e74
YO
1548
1549 } /* end second pass */
1550
1e2e3d02
YO
1551 /* next alloc is the NEXT state to be allocated */
1552 trie->statecount = next_alloc;
c944940b
JH
1553 trie->states = (reg_trie_state *)
1554 PerlMemShared_realloc( trie->states,
1555 next_alloc
1556 * sizeof(reg_trie_state) );
a3621e74 1557
3dab1dad 1558 /* and now dump it out before we compress it */
2b8b4781
NC
1559 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_list(trie, widecharmap,
1560 revcharmap, next_alloc,
1561 depth+1)
1e2e3d02 1562 );
a3621e74 1563
c944940b
JH
1564 trie->trans = (reg_trie_trans *)
1565 PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) );
a3621e74
YO
1566 {
1567 U32 state;
a3621e74
YO
1568 U32 tp = 0;
1569 U32 zp = 0;
1570
1571
1572 for( state=1 ; state < next_alloc ; state ++ ) {
1573 U32 base=0;
1574
1575 /*
1576 DEBUG_TRIE_COMPILE_MORE_r(
1577 PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp)
1578 );
1579 */
1580
1581 if (trie->states[state].trans.list) {
1582 U16 minid=TRIE_LIST_ITEM( state, 1).forid;
1583 U16 maxid=minid;
a28509cc 1584 U16 idx;
a3621e74
YO
1585
1586 for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
c445ea15
AL
1587 const U16 forid = TRIE_LIST_ITEM( state, idx).forid;
1588 if ( forid < minid ) {
1589 minid=forid;
1590 } else if ( forid > maxid ) {
1591 maxid=forid;
1592 }
a3621e74
YO
1593 }
1594 if ( transcount < tp + maxid - minid + 1) {
1595 transcount *= 2;
c944940b
JH
1596 trie->trans = (reg_trie_trans *)
1597 PerlMemShared_realloc( trie->trans,
446bd890
NC
1598 transcount
1599 * sizeof(reg_trie_trans) );
a3621e74
YO
1600 Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans );
1601 }
1602 base = trie->uniquecharcount + tp - minid;
1603 if ( maxid == minid ) {
1604 U32 set = 0;
1605 for ( ; zp < tp ; zp++ ) {
1606 if ( ! trie->trans[ zp ].next ) {
1607 base = trie->uniquecharcount + zp - minid;
1608 trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1609 trie->trans[ zp ].check = state;
1610 set = 1;
1611 break;
1612 }
1613 }
1614 if ( !set ) {
1615 trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate;
1616 trie->trans[ tp ].check = state;
1617 tp++;
1618 zp = tp;
1619 }
1620 } else {
1621 for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) {
c445ea15 1622 const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid;
a3621e74
YO
1623 trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate;
1624 trie->trans[ tid ].check = state;
1625 }
1626 tp += ( maxid - minid + 1 );
1627 }
1628 Safefree(trie->states[ state ].trans.list);
1629 }
1630 /*
1631 DEBUG_TRIE_COMPILE_MORE_r(
1632 PerlIO_printf( Perl_debug_log, " base: %d\n",base);
1633 );
1634 */
1635 trie->states[ state ].trans.base=base;
1636 }
cc601c31 1637 trie->lasttrans = tp + 1;
a3621e74
YO
1638 }
1639 } else {
1640 /*
1641 Second Pass -- Flat Table Representation.
1642
1643 we dont use the 0 slot of either trans[] or states[] so we add 1 to each.
1644 We know that we will need Charcount+1 trans at most to store the data
1645 (one row per char at worst case) So we preallocate both structures
1646 assuming worst case.
1647
1648 We then construct the trie using only the .next slots of the entry
1649 structs.
1650
1651 We use the .check field of the first entry of the node temporarily to
1652 make compression both faster and easier by keeping track of how many non
1653 zero fields are in the node.
1654
1655 Since trans are numbered from 1 any 0 pointer in the table is a FAIL
1656 transition.
1657
1658 There are two terms at use here: state as a TRIE_NODEIDX() which is a
1659 number representing the first entry of the node, and state as a
1660 TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and
1661 TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there
1662 are 2 entrys per node. eg:
1663
1664 A B A B
1665 1. 2 4 1. 3 7
1666 2. 0 3 3. 0 5
1667 3. 0 0 5. 0 0
1668 4. 0 0 7. 0 0
1669
1670 The table is internally in the right hand, idx form. However as we also
1671 have to deal with the states array which is indexed by nodenum we have to
1672 use TRIE_NODENUM() to convert.
1673
1674 */
1e2e3d02
YO
1675 DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log,
1676 "%*sCompiling trie using table compiler\n",
1677 (int)depth * 2 + 2, ""));
3dab1dad 1678
c944940b
JH
1679 trie->trans = (reg_trie_trans *)
1680 PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 )
1681 * trie->uniquecharcount + 1,
1682 sizeof(reg_trie_trans) );
1683 trie->states = (reg_trie_state *)
1684 PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2,
1685 sizeof(reg_trie_state) );
a3621e74
YO
1686 next_alloc = trie->uniquecharcount + 1;
1687
3dab1dad 1688
a3621e74
YO
1689 for ( cur = first ; cur < last ; cur = regnext( cur ) ) {
1690
c445ea15 1691 regnode * const noper = NEXTOPER( cur );
a28509cc
AL
1692 const U8 *uc = (U8*)STRING( noper );
1693 const U8 * const e = uc + STR_LEN( noper );
a3621e74
YO
1694
1695 U32 state = 1; /* required init */
1696
1697 U16 charid = 0; /* sanity init */
1698 U32 accept_state = 0; /* sanity init */
1699 U8 *scan = (U8*)NULL; /* sanity init */
1700
1701 STRLEN foldlen = 0; /* required init */
07be1b83 1702 U32 wordlen = 0; /* required init */
a3621e74
YO
1703 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1704
3dab1dad 1705 if ( OP(noper) != NOTHING ) {
786e8c11 1706 for ( ; uc < e ; uc += len ) {
a3621e74 1707
786e8c11 1708 TRIE_READ_CHAR;
a3621e74 1709
786e8c11
YO
1710 if ( uvc < 256 ) {
1711 charid = trie->charmap[ uvc ];
1712 } else {
55eed653 1713 SV* const * const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0);
786e8c11 1714 charid = svpp ? (U16)SvIV(*svpp) : 0;
a3621e74 1715 }
786e8c11
YO
1716 if ( charid ) {
1717 charid--;
1718 if ( !trie->trans[ state + charid ].next ) {
1719 trie->trans[ state + charid ].next = next_alloc;
1720 trie->trans[ state ].check++;
1721 next_alloc += trie->uniquecharcount;
1722 }
1723 state = trie->trans[ state + charid ].next;
1724 } else {
1725 Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc );
1726 }
1727 /* charid is now 0 if we dont know the char read, or nonzero if we do */
a3621e74 1728 }
a3621e74 1729 }
3dab1dad
YO
1730 accept_state = TRIE_NODENUM( state );
1731 TRIE_HANDLE_WORD(accept_state);
a3621e74
YO
1732
1733 } /* end second pass */
1734
3dab1dad 1735 /* and now dump it out before we compress it */
2b8b4781
NC
1736 DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_table(trie, widecharmap,
1737 revcharmap,
1738 next_alloc, depth+1));
a3621e74 1739
a3621e74
YO
1740 {
1741 /*
1742 * Inplace compress the table.*
1743
1744 For sparse data sets the table constructed by the trie algorithm will
1745 be mostly 0/FAIL transitions or to put it another way mostly empty.
1746 (Note that leaf nodes will not contain any transitions.)
1747
1748 This algorithm compresses the tables by eliminating most such
1749 transitions, at the cost of a modest bit of extra work during lookup:
1750
1751 - Each states[] entry contains a .base field which indicates the
1752 index in the state[] array wheres its transition data is stored.
1753
1754 - If .base is 0 there are no valid transitions from that node.
1755
1756 - If .base is nonzero then charid is added to it to find an entry in
1757 the trans array.
1758
1759 -If trans[states[state].base+charid].check!=state then the
1760 transition is taken to be a 0/Fail transition. Thus if there are fail
1761 transitions at the front of the node then the .base offset will point
1762 somewhere inside the previous nodes data (or maybe even into a node
1763 even earlier), but the .check field determines if the transition is
1764 valid.
1765
786e8c11 1766 XXX - wrong maybe?
a3621e74
YO
1767 The following process inplace converts the table to the compressed
1768 table: We first do not compress the root node 1,and mark its all its
1769 .check pointers as 1 and set its .base pointer as 1 as well. This
1770 allows to do a DFA construction from the compressed table later, and
1771 ensures that any .base pointers we calculate later are greater than
1772 0.
1773
1774 - We set 'pos' to indicate the first entry of the second node.
1775
1776 - We then iterate over the columns of the node, finding the first and
1777 last used entry at l and m. We then copy l..m into pos..(pos+m-l),
1778 and set the .check pointers accordingly, and advance pos
1779 appropriately and repreat for the next node. Note that when we copy
1780 the next pointers we have to convert them from the original
1781 NODEIDX form to NODENUM form as the former is not valid post
1782 compression.
1783
1784 - If a node has no transitions used we mark its base as 0 and do not
1785 advance the pos pointer.
1786
1787 - If a node only has one transition we use a second pointer into the
1788 structure to fill in allocated fail transitions from other states.
1789 This pointer is independent of the main pointer and scans forward
1790 looking for null transitions that are allocated to a state. When it
1791 finds one it writes the single transition into the "hole". If the
786e8c11 1792 pointer doesnt find one the single transition is appended as normal.
a3621e74
YO
1793
1794 - Once compressed we can Renew/realloc the structures to release the
1795 excess space.
1796
1797 See "Table-Compression Methods" in sec 3.9 of the Red Dragon,
1798 specifically Fig 3.47 and the associated pseudocode.
1799
1800 demq
1801 */
a3b680e6 1802 const U32 laststate = TRIE_NODENUM( next_alloc );
a28509cc 1803 U32 state, charid;
a3621e74 1804 U32 pos = 0, zp=0;
1e2e3d02 1805 trie->statecount = laststate;
a3621e74
YO
1806
1807 for ( state = 1 ; state < laststate ; state++ ) {
1808 U8 flag = 0;
a28509cc
AL
1809 const U32 stateidx = TRIE_NODEIDX( state );
1810 const U32 o_used = trie->trans[ stateidx ].check;
1811 U32 used = trie->trans[ stateidx ].check;
a3621e74
YO
1812 trie->trans[ stateidx ].check = 0;
1813
1814 for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) {
1815 if ( flag || trie->trans[ stateidx + charid ].next ) {
1816 if ( trie->trans[ stateidx + charid ].next ) {
1817 if (o_used == 1) {
1818 for ( ; zp < pos ; zp++ ) {
1819 if ( ! trie->trans[ zp ].next ) {
1820 break;
1821 }
1822 }
1823 trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ;
1824 trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1825 trie->trans[ zp ].check = state;
1826 if ( ++zp > pos ) pos = zp;
1827 break;
1828 }
1829 used--;
1830 }
1831 if ( !flag ) {
1832 flag = 1;
1833 trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ;
1834 }
1835 trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next );
1836 trie->trans[ pos ].check = state;
1837 pos++;
1838 }
1839 }
1840 }
cc601c31 1841 trie->lasttrans = pos + 1;
c944940b
JH
1842 trie->states = (reg_trie_state *)
1843 PerlMemShared_realloc( trie->states, laststate
1844 * sizeof(reg_trie_state) );
a3621e74 1845 DEBUG_TRIE_COMPILE_MORE_r(
e4584336 1846 PerlIO_printf( Perl_debug_log,
3dab1dad
YO
1847 "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n",
1848 (int)depth * 2 + 2,"",
1849 (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ),
5d7488b2
AL
1850 (IV)next_alloc,
1851 (IV)pos,
a3621e74
YO
1852 ( ( next_alloc - pos ) * 100 ) / (double)next_alloc );
1853 );
1854
1855 } /* end table compress */
1856 }
1e2e3d02
YO
1857 DEBUG_TRIE_COMPILE_MORE_r(
1858 PerlIO_printf(Perl_debug_log, "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n",
1859 (int)depth * 2 + 2, "",
1860 (UV)trie->statecount,
1861 (UV)trie->lasttrans)
1862 );
cc601c31 1863 /* resize the trans array to remove unused space */
c944940b
JH
1864 trie->trans = (reg_trie_trans *)
1865 PerlMemShared_realloc( trie->trans, trie->lasttrans
1866 * sizeof(reg_trie_trans) );
a3621e74 1867
3dab1dad 1868 /* and now dump out the compressed format */
2b8b4781 1869 DEBUG_TRIE_COMPILE_r(dump_trie(trie, widecharmap, revcharmap, depth+1));
07be1b83 1870
3dab1dad 1871 { /* Modify the program and insert the new TRIE node*/
3dab1dad
YO
1872 U8 nodetype =(U8)(flags & 0xFF);
1873 char *str=NULL;
786e8c11 1874
07be1b83 1875#ifdef DEBUGGING
e62cc96a 1876 regnode *optimize = NULL;
7122b237
YO
1877#ifdef RE_TRACK_PATTERN_OFFSETS
1878
b57a0404
JH
1879 U32 mjd_offset = 0;
1880 U32 mjd_nodelen = 0;
7122b237
YO
1881#endif /* RE_TRACK_PATTERN_OFFSETS */
1882#endif /* DEBUGGING */
a3621e74 1883 /*
3dab1dad
YO
1884 This means we convert either the first branch or the first Exact,
1885 depending on whether the thing following (in 'last') is a branch
1886 or not and whther first is the startbranch (ie is it a sub part of
1887 the alternation or is it the whole thing.)
1888 Assuming its a sub part we conver the EXACT otherwise we convert
1889 the whole branch sequence, including the first.
a3621e74 1890 */
3dab1dad 1891 /* Find the node we are going to overwrite */
7f69552c 1892 if ( first != startbranch || OP( last ) == BRANCH ) {
07be1b83 1893 /* branch sub-chain */
3dab1dad 1894 NEXT_OFF( first ) = (U16)(last - first);
7122b237 1895#ifdef RE_TRACK_PATTERN_OFFSETS
07be1b83
YO
1896 DEBUG_r({
1897 mjd_offset= Node_Offset((convert));
1898 mjd_nodelen= Node_Length((convert));
1899 });
7122b237 1900#endif
7f69552c 1901 /* whole branch chain */
7122b237
YO
1902 }
1903#ifdef RE_TRACK_PATTERN_OFFSETS
1904 else {
7f69552c
YO
1905 DEBUG_r({
1906 const regnode *nop = NEXTOPER( convert );
1907 mjd_offset= Node_Offset((nop));
1908 mjd_nodelen= Node_Length((nop));
1909 });
07be1b83
YO
1910 }
1911 DEBUG_OPTIMISE_r(
1912 PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n",
1913 (int)depth * 2 + 2, "",
786e8c11 1914 (UV)mjd_offset, (UV)mjd_nodelen)
07be1b83 1915 );
7122b237 1916#endif
3dab1dad
YO
1917 /* But first we check to see if there is a common prefix we can
1918 split out as an EXACT and put in front of the TRIE node. */
1919 trie->startstate= 1;
55eed653 1920 if ( trie->bitmap && !widecharmap && !trie->jump ) {
3dab1dad 1921 U32 state;
1e2e3d02 1922 for ( state = 1 ; state < trie->statecount-1 ; state++ ) {
a3621e74 1923 U32 ofs = 0;
8e11feef
RGS
1924 I32 idx = -1;
1925 U32 count = 0;
1926 const U32 base = trie->states[ state ].trans.base;
a3621e74 1927
3dab1dad 1928 if ( trie->states[state].wordnum )
8e11feef 1929 count = 1;
a3621e74 1930
8e11feef 1931 for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) {
cc601c31
YO
1932 if ( ( base + ofs >= trie->uniquecharcount ) &&
1933 ( base + ofs - trie->uniquecharcount < trie->lasttrans ) &&
a3621e74
YO
1934 trie->trans[ base + ofs - trie->uniquecharcount ].check == state )
1935 {
3dab1dad 1936 if ( ++count > 1 ) {
2b8b4781 1937 SV **tmp = av_fetch( revcharmap, ofs, 0);
07be1b83 1938 const U8 *ch = (U8*)SvPV_nolen_const( *tmp );
8e11feef 1939 if ( state == 1 ) break;
3dab1dad
YO
1940 if ( count == 2 ) {
1941 Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char);
1942 DEBUG_OPTIMISE_r(
8e11feef
RGS
1943 PerlIO_printf(Perl_debug_log,
1944 "%*sNew Start State=%"UVuf" Class: [",
1945 (int)depth * 2 + 2, "",
786e8c11 1946 (UV)state));
be8e71aa 1947 if (idx >= 0) {
2b8b4781 1948 SV ** const tmp = av_fetch( revcharmap, idx, 0);
be8e71aa 1949 const U8 * const ch = (U8*)SvPV_nolen_const( *tmp );
8e11feef 1950
3dab1dad 1951 TRIE_BITMAP_SET(trie,*ch);
8e11feef
RGS
1952 if ( folder )
1953 TRIE_BITMAP_SET(trie, folder[ *ch ]);
3dab1dad 1954 DEBUG_OPTIMISE_r(
07be1b83 1955 PerlIO_printf(Perl_debug_log, (char*)ch)
3dab1dad 1956 );
8e11feef
RGS
1957 }
1958 }
1959 TRIE_BITMAP_SET(trie,*ch);
1960 if ( folder )
1961 TRIE_BITMAP_SET(trie,folder[ *ch ]);
1962 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch));
1963 }
1964 idx = ofs;
1965 }
3dab1dad
YO
1966 }
1967 if ( count == 1 ) {
2b8b4781 1968 SV **tmp = av_fetch( revcharmap, idx, 0);
c490c714
YO
1969 STRLEN len;
1970 char *ch = SvPV( *tmp, len );
de734bd5
A
1971 DEBUG_OPTIMISE_r({
1972 SV *sv=sv_newmortal();
8e11feef
RGS
1973 PerlIO_printf( Perl_debug_log,
1974 "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n",
1975 (int)depth * 2 + 2, "",
de734bd5
A
1976 (UV)state, (UV)idx,
1977 pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6,
1978 PL_colors[0], PL_colors[1],
1979 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) |
1980 PERL_PV_ESCAPE_FIRSTCHAR
1981 )
1982 );
1983 });
3dab1dad
YO
1984 if ( state==1 ) {
1985 OP( convert ) = nodetype;
1986 str=STRING(convert);
1987 STR_LEN(convert)=0;
1988 }
c490c714
YO
1989 STR_LEN(convert) += len;
1990 while (len--)
de734bd5 1991 *str++ = *ch++;
8e11feef 1992 } else {
f9049ba1 1993#ifdef DEBUGGING
8e11feef
RGS
1994 if (state>1)
1995 DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n"));
f9049ba1 1996#endif
8e11feef
RGS
1997 break;
1998 }
1999 }
3dab1dad 2000 if (str) {
8e11feef 2001 regnode *n = convert+NODE_SZ_STR(convert);
07be1b83 2002 NEXT_OFF(convert) = NODE_SZ_STR(convert);
8e11feef 2003 trie->startstate = state;
07be1b83
YO
2004 trie->minlen -= (state - 1);
2005 trie->maxlen -= (state - 1);
2006 DEBUG_r({
2007 regnode *fix = convert;
de734bd5 2008 U32 word = trie->wordcount;
07be1b83
YO
2009 mjd_nodelen++;
2010 Set_Node_Offset_Length(convert, mjd_offset, state - 1);
2011 while( ++fix < n ) {
2012 Set_Node_Offset_Length(fix, 0, 0);
2013 }
de734bd5 2014 while (word--) {
2b8b4781 2015 SV ** const tmp = av_fetch( trie_words, word, 0 );
de734bd5
A
2016 if (tmp) {
2017 if ( STR_LEN(convert) <= SvCUR(*tmp) )
2018 sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert));
2019 else
2020 sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp));
2021 }
2022 }
07be1b83 2023 });
8e11feef
RGS
2024 if (trie->maxlen) {
2025 convert = n;
2026 } else {
3dab1dad 2027 NEXT_OFF(convert) = (U16)(tail - convert);
a5ca303d 2028 DEBUG_r(optimize= n);
3dab1dad
YO
2029 }
2030 }
2031 }
a5ca303d
YO
2032 if (!jumper)
2033 jumper = last;
3dab1dad 2034 if ( trie->maxlen ) {
8e11feef
RGS
2035 NEXT_OFF( convert ) = (U16)(tail - convert);
2036 ARG_SET( convert, data_slot );
786e8c11
YO
2037 /* Store the offset to the first unabsorbed branch in
2038 jump[0], which is otherwise unused by the jump logic.
2039 We use this when dumping a trie and during optimisation. */
2040 if (trie->jump)
7f69552c 2041 trie->jump[0] = (U16)(nextbranch - convert);
a5ca303d 2042
786e8c11
YO
2043 /* XXXX */
2044 if ( !trie->states[trie->startstate].wordnum && trie->bitmap &&
1de06328 2045 ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
786e8c11
YO
2046 {
2047 OP( convert ) = TRIEC;
2048 Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
446bd890 2049 PerlMemShared_free(trie->bitmap);
786e8c11
YO
2050 trie->bitmap= NULL;
2051 } else
2052 OP( convert ) = TRIE;
a3621e74 2053
3dab1dad
YO
2054 /* store the type in the flags */
2055 convert->flags = nodetype;
a5ca303d
YO
2056 DEBUG_r({
2057 optimize = convert
2058 + NODE_STEP_REGNODE
2059 + regarglen[ OP( convert ) ];
2060 });
2061 /* XXX We really should free up the resource in trie now,
2062 as we won't use them - (which resources?) dmq */
3dab1dad 2063 }
a3621e74 2064 /* needed for dumping*/
e62cc96a 2065 DEBUG_r(if (optimize) {
07be1b83 2066 regnode *opt = convert;
bcdf7404 2067
e62cc96a 2068 while ( ++opt < optimize) {
07be1b83
YO
2069 Set_Node_Offset_Length(opt,0,0);
2070 }
786e8c11
YO
2071 /*
2072 Try to clean up some of the debris left after the
2073 optimisation.
a3621e74 2074 */
786e8c11 2075 while( optimize < jumper ) {
07be1b83 2076 mjd_nodelen += Node_Length((optimize));
a3621e74 2077 OP( optimize ) = OPTIMIZED;
07be1b83 2078 Set_Node_Offset_Length(optimize,0,0);
a3621e74
YO
2079 optimize++;
2080 }
07be1b83 2081 Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
a3621e74
YO
2082 });
2083 } /* end node insert */
55eed653 2084 RExC_rxi->data->data[ data_slot + 1 ] = (void*)widecharmap;
2b8b4781
NC
2085#ifdef DEBUGGING
2086 RExC_rxi->data->data[ data_slot + TRIE_WORDS_OFFSET ] = (void*)trie_words;
2087 RExC_rxi->data->data[ data_slot + 3 ] = (void*)revcharmap;
2088#else
2089 SvREFCNT_dec(revcharmap);
07be1b83 2090#endif
786e8c11
YO
2091 return trie->jump
2092 ? MADE_JUMP_TRIE
2093 : trie->startstate>1
2094 ? MADE_EXACT_TRIE
2095 : MADE_TRIE;
2096}
2097
2098STATIC void
2099S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth)
2100{
2101/* The Trie is constructed and compressed now so we can build a fail array now if its needed
2102
2103 This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the
2104 "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88
2105 ISBN 0-201-10088-6
2106
2107 We find the fail state for each state in the trie, this state is the longest proper
2108 suffix of the current states 'word' that is also a proper prefix of another word in our
2109 trie. State 1 represents the word '' and is the thus the default fail state. This allows
2110 the DFA not to have to restart after its tried and failed a word at a given point, it
2111 simply continues as though it had been matching the other word in the first place.
2112 Consider
2113 'abcdgu'=~/abcdefg|cdgu/
2114 When we get to 'd' we are still matching the first word, we would encounter 'g' which would
2115 fail, which would bring use to the state representing 'd' in the second word where we would
2116 try 'g' and succeed, prodceding to match 'cdgu'.
2117 */
2118 /* add a fail transition */
3251b653
NC
2119 const U32 trie_offset = ARG(source);
2120 reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[trie_offset];
786e8c11
YO
2121 U32 *q;
2122 const U32 ucharcount = trie->uniquecharcount;
1e2e3d02 2123 const U32 numstates = trie->statecount;
786e8c11
YO
2124 const U32 ubound = trie->lasttrans + ucharcount;
2125 U32 q_read = 0;
2126 U32 q_write = 0;
2127 U32 charid;
2128 U32 base = trie->states[ 1 ].trans.base;
2129 U32 *fail;
2130 reg_ac_data *aho;
2131 const U32 data_slot = add_data( pRExC_state, 1, "T" );
2132 GET_RE_DEBUG_FLAGS_DECL;
2133#ifndef DEBUGGING
2134 PERL_UNUSED_ARG(depth);
2135#endif
2136
2137
2138 ARG_SET( stclass, data_slot );
c944940b 2139 aho = (reg_ac_data *) PerlMemShared_calloc( 1, sizeof(reg_ac_data) );
f8fc2ecf 2140 RExC_rxi->data->data[ data_slot ] = (void*)aho;
3251b653 2141 aho->trie=trie_offset;
446bd890
NC
2142 aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) );
2143 Copy( trie->states, aho->states, numstates, reg_trie_state );
786e8c11 2144 Newxz( q, numstates, U32);
c944940b 2145 aho->fail = (U32 *) PerlMemShared_calloc( numstates, sizeof(U32) );
786e8c11
YO
2146 aho->refcount = 1;
2147 fail = aho->fail;
2148 /* initialize fail[0..1] to be 1 so that we always have
2149 a valid final fail state */
2150 fail[ 0 ] = fail[ 1 ] = 1;
2151
2152 for ( charid = 0; charid < ucharcount ; charid++ ) {
2153 const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 );
2154 if ( newstate ) {
2155 q[ q_write ] = newstate;
2156 /* set to point at the root */
2157 fail[ q[ q_write++ ] ]=1;
2158 }
2159 }
2160 while ( q_read < q_write) {
2161 const U32 cur = q[ q_read++ % numstates ];
2162 base = trie->states[ cur ].trans.base;
2163
2164 for ( charid = 0 ; charid < ucharcount ; charid++ ) {
2165 const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 );
2166 if (ch_state) {
2167 U32 fail_state = cur;
2168 U32 fail_base;
2169 do {
2170 fail_state = fail[ fail_state ];
2171 fail_base = aho->states[ fail_state ].trans.base;
2172 } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) );
2173
2174 fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 );
2175 fail[ ch_state ] = fail_state;
2176 if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum )
2177 {
2178 aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum;
2179 }
2180 q[ q_write++ % numstates] = ch_state;
2181 }
2182 }
2183 }
2184 /* restore fail[0..1] to 0 so that we "fall out" of the AC loop
2185 when we fail in state 1, this allows us to use the
2186 charclass scan to find a valid start char. This is based on the principle
2187 that theres a good chance the string being searched contains lots of stuff
2188 that cant be a start char.
2189 */
2190 fail[ 0 ] = fail[ 1 ] = 0;
2191 DEBUG_TRIE_COMPILE_r({
6d99fb9b
JH
2192 PerlIO_printf(Perl_debug_log,
2193 "%*sStclass Failtable (%"UVuf" states): 0",
2194 (int)(depth * 2), "", (UV)numstates
1e2e3d02 2195 );
786e8c11
YO
2196 for( q_read=1; q_read<numstates; q_read++ ) {
2197 PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]);
2198 }
2199 PerlIO_printf(Perl_debug_log, "\n");
2200 });
2201 Safefree(q);
2202 /*RExC_seen |= REG_SEEN_TRIEDFA;*/
a3621e74
YO
2203}
2204
786e8c11 2205
a3621e74 2206/*
5d1c421c
JH
2207 * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2.
2208 * These need to be revisited when a newer toolchain becomes available.
2209 */
2210#if defined(__sparc64__) && defined(__GNUC__)
2211# if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96)
2212# undef SPARC64_GCC_WORKAROUND
2213# define SPARC64_GCC_WORKAROUND 1
2214# endif
2215#endif
2216
07be1b83 2217#define DEBUG_PEEP(str,scan,depth) \
b515a41d 2218 DEBUG_OPTIMISE_r({if (scan){ \
07be1b83
YO
2219 SV * const mysv=sv_newmortal(); \
2220 regnode *Next = regnext(scan); \
2221 regprop(RExC_rx, mysv, scan); \
7f69552c 2222 PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)\n", \
07be1b83
YO
2223 (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\
2224 Next ? (REG_NODE_NUM(Next)) : 0 ); \
b515a41d 2225 }});
07be1b83 2226
1de06328
YO
2227
2228
2229
2230
07be1b83
YO
2231#define JOIN_EXACT(scan,min,flags) \
2232 if (PL_regkind[OP(scan)] == EXACT) \
2233 join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1)
2234
be8e71aa 2235STATIC U32
07be1b83
YO
2236S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) {
2237 /* Merge several consecutive EXACTish nodes into one. */
2238 regnode *n = regnext(scan);
2239 U32 stringok = 1;
2240 regnode *next = scan + NODE_SZ_STR(scan);
2241 U32 merged = 0;
2242 U32 stopnow = 0;
2243#ifdef DEBUGGING
2244 regnode *stop = scan;
72f13be8 2245 GET_RE_DEBUG_FLAGS_DECL;
f9049ba1 2246#else
d47053eb
RGS
2247 PERL_UNUSED_ARG(depth);
2248#endif
2249#ifndef EXPERIMENTAL_INPLACESCAN
f9049ba1
SP
2250 PERL_UNUSED_ARG(flags);
2251 PERL_UNUSED_ARG(val);
07be1b83 2252#endif
07be1b83
YO
2253 DEBUG_PEEP("join",scan,depth);
2254
2255 /* Skip NOTHING, merge EXACT*. */
2256 while (n &&
2257 ( PL_regkind[OP(n)] == NOTHING ||
2258 (stringok && (OP(n) == OP(scan))))
2259 && NEXT_OFF(n)
2260 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
2261
2262 if (OP(n) == TAIL || n > next)
2263 stringok = 0;
2264 if (PL_regkind[OP(n)] == NOTHING) {
07be1b83
YO
2265 DEBUG_PEEP("skip:",n,depth);
2266 NEXT_OFF(scan) += NEXT_OFF(n);
2267 next = n + NODE_STEP_REGNODE;
2268#ifdef DEBUGGING
2269 if (stringok)
2270 stop = n;
2271#endif
2272 n = regnext(n);
2273 }
2274 else if (stringok) {
786e8c11 2275 const unsigned int oldl = STR_LEN(scan);
07be1b83
YO
2276 regnode * const nnext = regnext(n);
2277
2278 DEBUG_PEEP("merg",n,depth);
2279
2280 merged++;
2281 if (oldl + STR_LEN(n) > U8_MAX)
2282 break;
2283 NEXT_OFF(scan) += NEXT_OFF(n);
2284 STR_LEN(scan) += STR_LEN(n);
2285 next = n + NODE_SZ_STR(n);
2286 /* Now we can overwrite *n : */
2287 Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char);
2288#ifdef DEBUGGING
2289 stop = next - 1;
2290#endif
2291 n = nnext;
2292 if (stopnow) break;
2293 }
2294
d47053eb
RGS
2295#ifdef EXPERIMENTAL_INPLACESCAN
2296 if (flags && !NEXT_OFF(n)) {
2297 DEBUG_PEEP("atch", val, depth);
2298 if (reg_off_by_arg[OP(n)]) {
2299 ARG_SET(n, val - n);
2300 }
2301 else {
2302 NEXT_OFF(n) = val - n;
2303 }
2304 stopnow = 1;
2305 }
07be1b83
YO
2306#endif
2307 }
2308
2309 if (UTF && ( OP(scan) == EXACTF ) && ( STR_LEN(scan) >= 6 ) ) {
2310 /*
2311 Two problematic code points in Unicode casefolding of EXACT nodes:
2312
2313 U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS
2314 U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
2315
2316 which casefold to
2317
2318 Unicode UTF-8
2319
2320 U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81
2321 U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81
2322
2323 This means that in case-insensitive matching (or "loose matching",
2324 as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte
2325 length of the above casefolded versions) can match a target string
2326 of length two (the byte length of UTF-8 encoded U+0390 or U+03B0).
2327 This would rather mess up the minimum length computation.
2328
2329 What we'll do is to look for the tail four bytes, and then peek
2330 at the preceding two bytes to see whether we need to decrease
2331 the minimum length by four (six minus two).
2332
2333 Thanks to the design of UTF-8, there cannot be false matches:
2334 A sequence of valid UTF-8 bytes cannot be a subsequence of
2335 another valid sequence of UTF-8 bytes.
2336
2337 */
2338 char * const s0 = STRING(scan), *s, *t;
2339 char * const s1 = s0 + STR_LEN(scan) - 1;
2340 char * const s2 = s1 - 4;
e294cc5d
JH
2341#ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */
2342 const char t0[] = "\xaf\x49\xaf\x42";
2343#else
07be1b83 2344 const char t0[] = "\xcc\x88\xcc\x81";
e294cc5d 2345#endif
07be1b83
YO
2346 const char * const t1 = t0 + 3;
2347
2348 for (s = s0 + 2;
2349 s < s2 && (t = ninstr(s, s1, t0, t1));
2350 s = t + 4) {
e294cc5d
JH
2351#ifdef EBCDIC
2352 if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) ||
2353 ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5))
2354#else
07be1b83
YO
2355 if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) ||
2356 ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF))
e294cc5d 2357#endif
07be1b83
YO
2358 *min -= 4;
2359 }
2360 }
2361
2362#ifdef DEBUGGING
2363 /* Allow dumping */
2364 n = scan + NODE_SZ_STR(scan);
2365 while (n <= stop) {
2366 if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) {
2367 OP(n) = OPTIMIZED;
2368 NEXT_OFF(n) = 0;
2369 }
2370 n++;
2371 }
2372#endif
2373 DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)});
2374 return stopnow;
2375}
2376
653099ff
GS
2377/* REx optimizer. Converts nodes into quickier variants "in place".
2378 Finds fixed substrings. */
2379
a0288114 2380/* Stops at toplevel WHILEM as well as at "last". At end *scanp is set
c277df42
IZ
2381 to the position after last scanned or to NULL. */
2382
40d049e4
YO
2383#define INIT_AND_WITHP \
2384 assert(!and_withp); \
2385 Newx(and_withp,1,struct regnode_charclass_class); \
2386 SAVEFREEPV(and_withp)
07be1b83 2387
b515a41d
YO
2388/* this is a chain of data about sub patterns we are processing that
2389 need to be handled seperately/specially in study_chunk. Its so
2390 we can simulate recursion without losing state. */
2391struct scan_frame;
2392typedef struct scan_frame {
2393 regnode *last; /* last node to process in this frame */
2394 regnode *next; /* next node to process when last is reached */
2395 struct scan_frame *prev; /*previous frame*/
2396 I32 stop; /* what stopparen do we use */
2397} scan_frame;
2398
304ee84b
YO
2399
2400#define SCAN_COMMIT(s, data, m) scan_commit(s, data, m, is_inf)
2401
e1d1eefb
YO
2402#define CASE_SYNST_FNC(nAmE) \
2403case nAmE: \
2404 if (flags & SCF_DO_STCLASS_AND) { \
2405 for (value = 0; value < 256; value++) \
2406 if (!is_ ## nAmE ## _cp(value)) \
2407 ANYOF_BITMAP_CLEAR(data->start_class, value); \
2408 } \
2409 else { \
2410 for (value = 0; value < 256; value++) \
2411 if (is_ ## nAmE ## _cp(value)) \
2412 ANYOF_BITMAP_SET(data->start_class, value); \
2413 } \
2414 break; \
2415case N ## nAmE: \
2416 if (flags & SCF_DO_STCLASS_AND) { \
2417 for (value = 0; value < 256; value++) \
2418 if (is_ ## nAmE ## _cp(value)) \
2419 ANYOF_BITMAP_CLEAR(data->start_class, value); \
2420 } \
2421 else { \
2422 for (value = 0; value < 256; value++) \
2423 if (!is_ ## nAmE ## _cp(value)) \
2424 ANYOF_BITMAP_SET(data->start_class, value); \
2425 } \
2426 break
2427
2428
2429
76e3520e 2430STATIC I32
40d049e4 2431S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp,
1de06328 2432 I32 *minlenp, I32 *deltap,
40d049e4
YO
2433 regnode *last,
2434 scan_data_t *data,
2435 I32 stopparen,
2436 U8* recursed,
2437 struct regnode_charclass_class *and_withp,
2438 U32 flags, U32 depth)
c277df42
IZ
2439 /* scanp: Start here (read-write). */
2440 /* deltap: Write maxlen-minlen here. */
2441 /* last: Stop before this one. */
40d049e4
YO
2442 /* data: string data about the pattern */
2443 /* stopparen: treat close N as END */
2444 /* recursed: which subroutines have we recursed into */
2445 /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */
c277df42 2446{
97aff369 2447 dVAR;
c277df42
IZ
2448 I32 min = 0, pars = 0, code;
2449 regnode *scan = *scanp, *next;
2450 I32 delta = 0;
2451 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
aca2d497 2452 int is_inf_internal = 0; /* The studied chunk is infinite */
c277df42
IZ
2453 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
2454 scan_data_t data_fake;
a3621e74 2455 SV *re_trie_maxbuff = NULL;
786e8c11 2456 regnode *first_non_open = scan;
e2e6a0f1 2457 I32 stopmin = I32_MAX;
8aa23a47
YO
2458 scan_frame *frame = NULL;
2459
a3621e74 2460 GET_RE_DEBUG_FLAGS_DECL;
8aa23a47 2461
13a24bad 2462#ifdef DEBUGGING
40d049e4 2463 StructCopy(&zero_scan_data, &data_fake, scan_data_t);
13a24bad 2464#endif
40d049e4 2465
786e8c11 2466 if ( depth == 0 ) {
40d049e4 2467 while (first_non_open && OP(first_non_open) == OPEN)
786e8c11
YO
2468 first_non_open=regnext(first_non_open);
2469 }
2470
b81d288d 2471
8aa23a47
YO
2472 fake_study_recurse:
2473 while ( scan && OP(scan) != END && scan < last ){
2474 /* Peephole optimizer: */
304ee84b 2475 DEBUG_STUDYDATA("Peep:", data,depth);
8aa23a47
YO
2476 DEBUG_PEEP("Peep",scan,depth);
2477 JOIN_EXACT(scan,&min,0);
2478
2479 /* Follow the next-chain of the current node and optimize
2480 away all the NOTHINGs from it. */
2481 if (OP(scan) != CURLYX) {
2482 const int max = (reg_off_by_arg[OP(scan)]
2483 ? I32_MAX
2484 /* I32 may be smaller than U16 on CRAYs! */
2485 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
2486 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
2487 int noff;
2488 regnode *n = scan;
2489
2490 /* Skip NOTHING and LONGJMP. */
2491 while ((n = regnext(n))
2492 && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
2493 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
2494 && off + noff < max)
2495 off += noff;
2496 if (reg_off_by_arg[OP(scan)])
2497 ARG(scan) = off;
2498 else
2499 NEXT_OFF(scan) = off;
2500 }
a3621e74 2501
c277df42 2502
8aa23a47
YO
2503
2504 /* The principal pseudo-switch. Cannot be a switch, since we
2505 look into several different things. */
2506 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
2507 || OP(scan) == IFTHEN) {
2508 next = regnext(scan);
2509 code = OP(scan);
2510 /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */
2511
2512 if (OP(next) == code || code == IFTHEN) {
2513 /* NOTE - There is similar code to this block below for handling
2514 TRIE nodes on a re-study. If you change stuff here check there
2515 too. */
2516 I32 max1 = 0, min1 = I32_MAX, num = 0;
2517 struct regnode_charclass_class accum;
2518 regnode * const startbranch=scan;
2519
2520 if (flags & SCF_DO_SUBSTR)
304ee84b 2521 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot merge strings after this. */
8aa23a47
YO
2522 if (flags & SCF_DO_STCLASS)
2523 cl_init_zero(pRExC_state, &accum);
2524
2525 while (OP(scan) == code) {
2526 I32 deltanext, minnext, f = 0, fake;
2527 struct regnode_charclass_class this_class;
2528
2529 num++;
2530 data_fake.flags = 0;
2531 if (data) {
2532 data_fake.whilem_c = data->whilem_c;
2533 data_fake.last_closep = data->last_closep;
2534 }
2535 else
2536 data_fake.last_closep = &fake;
58e23c8d
YO
2537
2538 data_fake.pos_delta = delta;
8aa23a47
YO
2539 next = regnext(scan);
2540 scan = NEXTOPER(scan);
2541 if (code != BRANCH)
c277df42 2542 scan = NEXTOPER(scan);
8aa23a47
YO
2543 if (flags & SCF_DO_STCLASS) {
2544 cl_init(pRExC_state, &this_class);
2545 data_fake.start_class = &this_class;
2546 f = SCF_DO_STCLASS_AND;
58e23c8d 2547 }
8aa23a47
YO
2548 if (flags & SCF_WHILEM_VISITED_POS)
2549 f |= SCF_WHILEM_VISITED_POS;
2550
2551 /* we suppose the run is continuous, last=next...*/
2552 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
2553 next, &data_fake,
2554 stopparen, recursed, NULL, f,depth+1);
2555 if (min1 > minnext)
2556 min1 = minnext;
2557 if (max1 < minnext + deltanext)
2558 max1 = minnext + deltanext;
2559 if (deltanext == I32_MAX)
2560 is_inf = is_inf_internal = 1;
2561 scan = next;
2562 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
2563 pars++;
2564 if (data_fake.flags & SCF_SEEN_ACCEPT) {
2565 if ( stopmin > minnext)
2566 stopmin = min + min1;
2567 flags &= ~SCF_DO_SUBSTR;
2568 if (data)
2569 data->flags |= SCF_SEEN_ACCEPT;
2570 }
2571 if (data) {
2572 if (data_fake.flags & SF_HAS_EVAL)
2573 data->flags |= SF_HAS_EVAL;
2574 data->whilem_c = data_fake.whilem_c;
3dab1dad 2575 }
8aa23a47
YO
2576 if (flags & SCF_DO_STCLASS)
2577 cl_or(pRExC_state, &accum, &this_class);
2578 }
2579 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
2580 min1 = 0;
2581 if (flags & SCF_DO_SUBSTR) {
2582 data->pos_min += min1;
2583 data->pos_delta += max1 - min1;
2584 if (max1 != min1 || is_inf)
2585 data->longest = &(data->longest_float);
2586 }
2587 min += min1;
2588 delta += max1 - min1;
2589 if (flags & SCF_DO_STCLASS_OR) {
2590 cl_or(pRExC_state, data->start_class, &accum);
2591 if (min1) {
2592 cl_and(data->start_class, and_withp);
2593 flags &= ~SCF_DO_STCLASS;
653099ff 2594 }
8aa23a47
YO
2595 }
2596 else if (flags & SCF_DO_STCLASS_AND) {
2597 if (min1) {
2598 cl_and(data->start_class, &accum);
2599 flags &= ~SCF_DO_STCLASS;
de0c8cb8 2600 }
8aa23a47
YO
2601 else {
2602 /* Switch to OR mode: cache the old value of
2603 * data->start_class */
2604 INIT_AND_WITHP;
2605 StructCopy(data->start_class, and_withp,
2606 struct regnode_charclass_class);
2607 flags &= ~SCF_DO_STCLASS_AND;
2608 StructCopy(&accum, data->start_class,
2609 struct regnode_charclass_class);
2610 flags |= SCF_DO_STCLASS_OR;
2611 data->start_class->flags |= ANYOF_EOS;
de0c8cb8 2612 }
8aa23a47 2613 }
a3621e74 2614
8aa23a47
YO
2615 if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) {
2616 /* demq.
a3621e74 2617
8aa23a47
YO
2618 Assuming this was/is a branch we are dealing with: 'scan' now
2619 points at the item that follows the branch sequence, whatever
2620 it is. We now start at the beginning of the sequence and look
2621 for subsequences of
a3621e74 2622
8aa23a47
YO
2623 BRANCH->EXACT=>x1
2624 BRANCH->EXACT=>x2
2625 tail
a3621e74 2626
8aa23a47 2627 which would be constructed from a pattern like /A|LIST|OF|WORDS/
a3621e74 2628
8aa23a47
YO
2629 If we can find such a subseqence we need to turn the first
2630 element into a trie and then add the subsequent branch exact
2631 strings to the trie.
a3621e74 2632
8aa23a47 2633 We have two cases
a3621e74 2634
8aa23a47 2635 1. patterns where the whole set of branch can be converted.
a3621e74 2636
8aa23a47 2637 2. patterns where only a subset can be converted.
a3621e74 2638
8aa23a47
YO
2639 In case 1 we can replace the whole set with a single regop
2640 for the trie. In case 2 we need to keep the start and end
2641 branchs so
a3621e74 2642
8aa23a47
YO
2643 'BRANCH EXACT; BRANCH EXACT; BRANCH X'
2644 becomes BRANCH TRIE; BRANCH X;
786e8c11 2645
8aa23a47
YO
2646 There is an additional case, that being where there is a
2647 common prefix, which gets split out into an EXACT like node
2648 preceding the TRIE node.
a3621e74 2649
8aa23a47
YO
2650 If x(1..n)==tail then we can do a simple trie, if not we make
2651 a "jump" trie, such that when we match the appropriate word
2652 we "jump" to the appopriate tail node. Essentailly we turn
2653 a nested if into a case structure of sorts.
b515a41d 2654
8aa23a47
YO
2655 */
2656
2657 int made=0;
2658 if (!re_trie_maxbuff) {
2659 re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1);
2660 if (!SvIOK(re_trie_maxbuff))
2661 sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT);
2662 }
2663 if ( SvIV(re_trie_maxbuff)>=0 ) {
2664 regnode *cur;
2665 regnode *first = (regnode *)NULL;
2666 regnode *last = (regnode *)NULL;
2667 regnode *tail = scan;
2668 U8 optype = 0;
2669 U32 count=0;
a3621e74
YO
2670
2671#ifdef DEBUGGING
8aa23a47 2672 SV * const mysv = sv_newmortal(); /* for dumping */
a3621e74 2673#endif
8aa23a47
YO
2674 /* var tail is used because there may be a TAIL
2675 regop in the way. Ie, the exacts will point to the
2676 thing following the TAIL, but the last branch will
2677 point at the TAIL. So we advance tail. If we
2678 have nested (?:) we may have to move through several
2679 tails.
2680 */
2681
2682 while ( OP( tail ) == TAIL ) {
2683 /* this is the TAIL generated by (?:) */
2684 tail = regnext( tail );
2685 }
a3621e74 2686
8aa23a47
YO
2687
2688 DEBUG_OPTIMISE_r({
2689 regprop(RExC_rx, mysv, tail );
2690 PerlIO_printf( Perl_debug_log, "%*s%s%s\n",
2691 (int)depth * 2 + 2, "",
2692 "Looking for TRIE'able sequences. Tail node is: ",
2693 SvPV_nolen_const( mysv )
2694 );
2695 });
2696
2697 /*
2698
2699 step through the branches, cur represents each
2700 branch, noper is the first thing to be matched
2701 as part of that branch and noper_next is the
2702 regnext() of that node. if noper is an EXACT
2703 and noper_next is the same as scan (our current
2704 position in the regex) then the EXACT branch is
2705 a possible optimization target. Once we have
2706 two or more consequetive such branches we can
2707 create a trie of the EXACT's contents and stich
2708 it in place. If the sequence represents all of
2709 the branches we eliminate the whole thing and
2710 replace it with a single TRIE. If it is a
2711 subsequence then we need to stitch it in. This
2712 means the first branch has to remain, and needs
2713 to be repointed at the item on the branch chain
2714 following the last branch optimized. This could
2715 be either a BRANCH, in which case the
2716 subsequence is internal, or it could be the
2717 item following the branch sequence in which
2718 case the subsequence is at the end.
2719
2720 */
2721
2722 /* dont use tail as the end marker for this traverse */
2723 for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) {
2724 regnode * const noper = NEXTOPER( cur );
b515a41d 2725#if defined(DEBUGGING) || defined(NOJUMPTRIE)
8aa23a47 2726 regnode * const noper_next = regnext( noper );
b515a41d
YO
2727#endif
2728
8aa23a47
YO
2729 DEBUG_OPTIMISE_r({
2730 regprop(RExC_rx, mysv, cur);
2731 PerlIO_printf( Perl_debug_log, "%*s- %s (%d)",
2732 (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) );
2733
2734 regprop(RExC_rx, mysv, noper);
2735 PerlIO_printf( Perl_debug_log, " -> %s",
2736 SvPV_nolen_const(mysv));
2737
2738 if ( noper_next ) {
2739 regprop(RExC_rx, mysv, noper_next );
2740 PerlIO_printf( Perl_debug_log,"\t=> %s\t",
2741 SvPV_nolen_const(mysv));
2742 }
2743 PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n",
2744 REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) );
2745 });
2746 if ( (((first && optype!=NOTHING) ? OP( noper ) == optype
2747 : PL_regkind[ OP( noper ) ] == EXACT )
2748 || OP(noper) == NOTHING )
786e8c11 2749#ifdef NOJUMPTRIE
8aa23a47 2750 && noper_next == tail
786e8c11 2751#endif
8aa23a47
YO
2752 && count < U16_MAX)
2753 {
2754 count++;
2755 if ( !first || optype == NOTHING ) {
2756 if (!first) first = cur;
2757 optype = OP( noper );
2758 } else {
2759 last = cur;
2760 }
2761 } else {
2762 if ( last ) {
2763 make_trie( pRExC_state,
2764 startbranch, first, cur, tail, count,
2765 optype, depth+1 );
2766 }
2767 if ( PL_regkind[ OP( noper ) ] == EXACT
786e8c11 2768#ifdef NOJUMPTRIE
8aa23a47 2769 && noper_next == tail
786e8c11 2770#endif
8aa23a47
YO
2771 ){
2772 count = 1;
2773 first = cur;
2774 optype = OP( noper );
2775 } else {
2776 count = 0;
2777 first = NULL;
2778 optype = 0;
2779 }
2780 last = NULL;
2781 }
2782 }
2783 DEBUG_OPTIMISE_r({
2784 regprop(RExC_rx, mysv, cur);
2785 PerlIO_printf( Perl_debug_log,
2786 "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2,
2787 "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur));
2788
2789 });
2790 if ( last ) {
2791 made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 );
3dab1dad 2792#ifdef TRIE_STUDY_OPT
8aa23a47
YO
2793 if ( ((made == MADE_EXACT_TRIE &&
2794 startbranch == first)
2795 || ( first_non_open == first )) &&
2796 depth==0 ) {
2797 flags |= SCF_TRIE_RESTUDY;
2798 if ( startbranch == first
2799 && scan == tail )
2800 {
2801 RExC_seen &=~REG_TOP_LEVEL_BRANCHES;
2802 }
2803 }
3dab1dad 2804#endif
8aa23a47
YO
2805 }
2806 }
2807
2808 } /* do trie */
2809
653099ff 2810 }
8aa23a47
YO
2811 else if ( code == BRANCHJ ) { /* single branch is optimized. */
2812 scan = NEXTOPER(NEXTOPER(scan));
2813 } else /* single branch is optimized. */
2814 scan = NEXTOPER(scan);
2815 continue;
2816 } else if (OP(scan) == SUSPEND || OP(scan) == GOSUB || OP(scan) == GOSTART) {
2817 scan_frame *newframe = NULL;
2818 I32 paren;
2819 regnode *start;
2820 regnode *end;
2821
2822 if (OP(scan) != SUSPEND) {
2823 /* set the pointer */
2824 if (OP(scan) == GOSUB) {
2825 paren = ARG(scan);
2826 RExC_recurse[ARG2L(scan)] = scan;
2827 start = RExC_open_parens[paren-1];
2828 end = RExC_close_parens[paren-1];
2829 } else {
2830 paren = 0;
f8fc2ecf 2831 start = RExC_rxi->program + 1;
8aa23a47
YO
2832 end = RExC_opend;
2833 }
2834 if (!recursed) {
2835 Newxz(recursed, (((RExC_npar)>>3) +1), U8);
2836 SAVEFREEPV(recursed);
2837 }
2838 if (!PAREN_TEST(recursed,paren+1)) {
2839 PAREN_SET(recursed,paren+1);
2840 Newx(newframe,1,scan_frame);
2841 } else {
2842 if (flags & SCF_DO_SUBSTR) {
304ee84b 2843 SCAN_COMMIT(pRExC_state,data,minlenp);
8aa23a47
YO
2844 data->longest = &(data->longest_float);
2845 }
2846 is_inf = is_inf_internal = 1;
2847 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
2848 cl_anything(pRExC_state, data->start_class);
2849 flags &= ~SCF_DO_STCLASS;
2850 }
2851 } else {
2852 Newx(newframe,1,scan_frame);
2853 paren = stopparen;
2854 start = scan+2;
2855 end = regnext(scan);
2856 }
2857 if (newframe) {
2858 assert(start);
2859 assert(end);
2860 SAVEFREEPV(newframe);
2861 newframe->next = regnext(scan);
2862 newframe->last = last;
2863 newframe->stop = stopparen;
2864 newframe->prev = frame;
2865
2866 frame = newframe;
2867 scan = start;
2868 stopparen = paren;
2869 last = end;
2870
2871 continue;
2872 }
2873 }
2874 else if (OP(scan) == EXACT) {
2875 I32 l = STR_LEN(scan);
2876 UV uc;
2877 if (UTF) {
2878 const U8 * const s = (U8*)STRING(scan);
2879 l = utf8_length(s, s + l);
2880 uc = utf8_to_uvchr(s, NULL);
2881 } else {
2882 uc = *((U8*)STRING(scan));
2883 }
2884 min += l;
2885 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
2886 /* The code below prefers earlier match for fixed
2887 offset, later match for variable offset. */
2888 if (data->last_end == -1) { /* Update the start info. */
2889 data->last_start_min = data->pos_min;
2890 data->last_start_max = is_inf
2891 ? I32_MAX : data->pos_min + data->pos_delta;
b515a41d 2892 }
8aa23a47
YO
2893 sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan));
2894 if (UTF)
2895 SvUTF8_on(data->last_found);
2896 {
2897 SV * const sv = data->last_found;
2898 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
2899 mg_find(sv, PERL_MAGIC_utf8) : NULL;
2900 if (mg && mg->mg_len >= 0)
2901 mg->mg_len += utf8_length((U8*)STRING(scan),
2902 (U8*)STRING(scan)+STR_LEN(scan));
b515a41d 2903 }
8aa23a47
YO
2904 data->last_end = data->pos_min + l;
2905 data->pos_min += l; /* As in the first entry. */
2906 data->flags &= ~SF_BEFORE_EOL;
2907 }
2908 if (flags & SCF_DO_STCLASS_AND) {
2909 /* Check whether it is compatible with what we know already! */
2910 int compat = 1;
2911
2912 if (uc >= 0x100 ||
2913 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2914 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2915 && (!(data->start_class->flags & ANYOF_FOLD)
2916 || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2917 )
2918 compat = 0;
2919 ANYOF_CLASS_ZERO(data->start_class);
2920 ANYOF_BITMAP_ZERO(data->start_class);
2921 if (compat)
2922 ANYOF_BITMAP_SET(data->start_class, uc);
2923 data->start_class->flags &= ~ANYOF_EOS;
2924 if (uc < 0x100)
2925 data->start_class->flags &= ~ANYOF_UNICODE_ALL;
2926 }
2927 else if (flags & SCF_DO_STCLASS_OR) {
2928 /* false positive possible if the class is case-folded */
2929 if (uc < 0x100)
2930 ANYOF_BITMAP_SET(data->start_class, uc);
2931 else
2932 data->start_class->flags |= ANYOF_UNICODE_ALL;
2933 data->start_class->flags &= ~ANYOF_EOS;
2934 cl_and(data->start_class, and_withp);
2935 }
2936 flags &= ~SCF_DO_STCLASS;
2937 }
2938 else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */
2939 I32 l = STR_LEN(scan);
2940 UV uc = *((U8*)STRING(scan));
2941
2942 /* Search for fixed substrings supports EXACT only. */
2943 if (flags & SCF_DO_SUBSTR) {
2944 assert(data);
304ee84b 2945 SCAN_COMMIT(pRExC_state, data, minlenp);
8aa23a47
YO
2946 }
2947 if (UTF) {
2948 const U8 * const s = (U8 *)STRING(scan);
2949 l = utf8_length(s, s + l);
2950 uc = utf8_to_uvchr(s, NULL);
2951 }
2952 min += l;
2953 if (flags & SCF_DO_SUBSTR)
2954 data->pos_min += l;
2955 if (flags & SCF_DO_STCLASS_AND) {
2956 /* Check whether it is compatible with what we know already! */
2957 int compat = 1;
2958
2959 if (uc >= 0x100 ||
2960 (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE))
2961 && !ANYOF_BITMAP_TEST(data->start_class, uc)
2962 && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc])))
2963 compat = 0;
2964 ANYOF_CLASS_ZERO(data->start_class);
2965 ANYOF_BITMAP_ZERO(data->start_class);
2966 if (compat) {
2967 ANYOF_BITMAP_SET(data->start_class, uc);
653099ff 2968 data->start_class->flags &= ~ANYOF_EOS;
8aa23a47
YO
2969 data->start_class->flags |= ANYOF_FOLD;
2970 if (OP(scan) == EXACTFL)
2971 data->start_class->flags |= ANYOF_LOCALE;
653099ff 2972 }
8aa23a47
YO
2973 }
2974 else if (flags & SCF_DO_STCLASS_OR) {
2975 if (data->start_class->flags & ANYOF_FOLD) {
2976 /* false positive possible if the class is case-folded.
2977 Assume that the locale settings are the same... */
1aa99e6b
IH
2978 if (uc < 0x100)
2979 ANYOF_BITMAP_SET(data->start_class, uc);
653099ff
GS
2980 data->start_class->flags &= ~ANYOF_EOS;
2981 }
8aa23a47 2982 cl_and(data->start_class, and_withp);
653099ff 2983 }
8aa23a47
YO
2984 flags &= ~SCF_DO_STCLASS;
2985 }
2986 else if (strchr((const char*)PL_varies,OP(scan))) {
2987 I32 mincount, maxcount, minnext, deltanext, fl = 0;
2988 I32 f = flags, pos_before = 0;
2989 regnode * const oscan = scan;
2990 struct regnode_charclass_class this_class;
2991 struct regnode_charclass_class *oclass = NULL;
2992 I32 next_is_eval = 0;
2993
2994 switch (PL_regkind[OP(scan)]) {
2995 case WHILEM: /* End of (?:...)* . */
2996 scan = NEXTOPER(scan);
2997 goto finish;
2998 case PLUS:
2999 if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) {
3000 next = NEXTOPER(scan);
3001 if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) {
3002 mincount = 1;
3003 maxcount = REG_INFTY;
3004 next = regnext(scan);
3005 scan = NEXTOPER(scan);
3006 goto do_curly;
3007 }
3008 }
3009 if (flags & SCF_DO_SUBSTR)
3010 data->pos_min++;
3011 min++;
3012 /* Fall through. */
3013 case STAR:
3014 if (flags & SCF_DO_STCLASS) {
3015 mincount = 0;
3016 maxcount = REG_INFTY;
3017 next = regnext(scan);
3018 scan = NEXTOPER(scan);
3019 goto do_curly;
3020 }
3021 is_inf = is_inf_internal = 1;
3022 scan = regnext(scan);
c277df42 3023 if (flags & SCF_DO_SUBSTR) {
304ee84b 3024 SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */
8aa23a47 3025 data->longest = &(data->longest_float);
c277df42 3026 }
8aa23a47
YO
3027 goto optimize_curly_tail;
3028 case CURLY:
3029 if (stopparen>0 && (OP(scan)==CURLYN || OP(scan)==CURLYM)
3030 && (scan->flags == stopparen))
3031 {
3032 mincount = 1;
3033 maxcount = 1;
3034 } else {
3035 mincount = ARG1(scan);
3036 maxcount = ARG2(scan);
653099ff 3037 }
8aa23a47
YO
3038 next = regnext(scan);
3039 if (OP(scan) == CURLYX) {
3040 I32 lp = (data ? *(data->last_closep) : 0);
3041 scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX);
653099ff 3042 }
8aa23a47
YO
3043 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
3044 next_is_eval = (OP(scan) == EVAL);
3045 do_curly:
3046 if (flags & SCF_DO_SUBSTR) {
304ee84b 3047 if (mincount == 0) SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */
8aa23a47 3048 pos_before = data->pos_min;
b45f050a 3049 }
8aa23a47
YO
3050 if (data) {
3051 fl = data->flags;
3052 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
3053 if (is_inf)
3054 data->flags |= SF_IS_INF;
3055 }
3056 if (flags & SCF_DO_STCLASS) {
3057 cl_init(pRExC_state, &this_class);
3058 oclass = data->start_class;
3059 data->start_class = &this_class;
3060 f |= SCF_DO_STCLASS_AND;
3061 f &= ~SCF_DO_STCLASS_OR;
3062 }
3063 /* These are the cases when once a subexpression
3064 fails at a particular position, it cannot succeed
3065 even after backtracking at the enclosing scope.
3066
3067 XXXX what if minimal match and we are at the
3068 initial run of {n,m}? */
3069 if ((mincount != maxcount - 1) && (maxcount != REG_INFTY))
3070 f &= ~SCF_WHILEM_VISITED_POS;
b45f050a 3071
8aa23a47
YO
3072 /* This will finish on WHILEM, setting scan, or on NULL: */
3073 minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext,
3074 last, data, stopparen, recursed, NULL,
3075 (mincount == 0
3076 ? (f & ~SCF_DO_SUBSTR) : f),depth+1);
b515a41d 3077
8aa23a47
YO
3078 if (flags & SCF_DO_STCLASS)
3079 data->start_class = oclass;
3080 if (mincount == 0 || minnext == 0) {
3081 if (flags & SCF_DO_STCLASS_OR) {
3082 cl_or(pRExC_state, data->start_class, &this_class);
3083 }
3084 else if (flags & SCF_DO_STCLASS_AND) {
3085 /* Switch to OR mode: cache the old value of
3086 * data->start_class */
3087 INIT_AND_WITHP;
3088 StructCopy(data->start_class, and_withp,
3089 struct regnode_charclass_class);
3090 flags &= ~SCF_DO_STCLASS_AND;
3091 StructCopy(&this_class, data->start_class,
3092 struct regnode_charclass_class);
3093 flags |= SCF_DO_STCLASS_OR;
3094 data->start_class->flags |= ANYOF_EOS;
3095 }
3096 } else { /* Non-zero len */
3097 if (flags & SCF_DO_STCLASS_OR) {
3098 cl_or(pRExC_state, data->start_class, &this_class);
3099 cl_and(data->start_class, and_withp);
3100 }
3101 else if (flags & SCF_DO_STCLASS_AND)
3102 cl_and(data->start_class, &this_class);
3103 flags &= ~SCF_DO_STCLASS;
3104 }
3105 if (!scan) /* It was not CURLYX, but CURLY. */
3106 scan = next;
3107 if ( /* ? quantifier ok, except for (?{ ... }) */
3108 (next_is_eval || !(mincount == 0 && maxcount == 1))
3109 && (minnext == 0) && (deltanext == 0)
3110 && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
3111 && maxcount <= REG_INFTY/3 /* Complement check for big count */
3112 && ckWARN(WARN_REGEXP))
3113 {
3114 vWARN(RExC_parse,
3115 "Quantifier unexpected on zero-length expression");
3116 }
3117
3118 min += minnext * mincount;
3119 is_inf_internal |= ((maxcount == REG_INFTY
3120 && (minnext + deltanext) > 0)
3121 || deltanext == I32_MAX);
3122 is_inf |= is_inf_internal;
3123 delta += (minnext + deltanext) * maxcount - minnext * mincount;
3124
3125 /* Try powerful optimization CURLYX => CURLYN. */
3126 if ( OP(oscan) == CURLYX && data
3127 && data->flags & SF_IN_PAR
3128 && !(data->flags & SF_HAS_EVAL)
3129 && !deltanext && minnext == 1 ) {
3130 /* Try to optimize to CURLYN. */
3131 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
3132 regnode * const nxt1 = nxt;
497b47a8 3133#ifdef DEBUGGING
8aa23a47 3134 regnode *nxt2;
497b47a8 3135#endif
c277df42 3136
8aa23a47
YO
3137 /* Skip open. */
3138 nxt = regnext(nxt);
3139 if (!strchr((const char*)PL_simple,OP(nxt))
3140 && !(PL_regkind[OP(nxt)] == EXACT
3141 && STR_LEN(nxt) == 1))
3142 goto nogo;
497b47a8 3143#ifdef DEBUGGING
8aa23a47 3144 nxt2 = nxt;
497b47a8 3145#endif
8aa23a47
YO
3146 nxt = regnext(nxt);
3147 if (OP(nxt) != CLOSE)
3148 goto nogo;
3149 if (RExC_open_parens) {
3150 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3151 RExC_close_parens[ARG(nxt1)-1]=nxt+2; /*close->while*/
3152 }
3153 /* Now we know that nxt2 is the only contents: */
3154 oscan->flags = (U8)ARG(nxt);
3155 OP(oscan) = CURLYN;
3156 OP(nxt1) = NOTHING; /* was OPEN. */
40d049e4 3157
c277df42 3158#ifdef DEBUGGING
8aa23a47
YO
3159 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3160 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
3161 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
3162 OP(nxt) = OPTIMIZED; /* was CLOSE. */
3163 OP(nxt + 1) = OPTIMIZED; /* was count. */
3164 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
b81d288d 3165#endif
8aa23a47
YO
3166 }
3167 nogo:
3168
3169 /* Try optimization CURLYX => CURLYM. */
3170 if ( OP(oscan) == CURLYX && data
3171 && !(data->flags & SF_HAS_PAR)
3172 && !(data->flags & SF_HAS_EVAL)
3173 && !deltanext /* atom is fixed width */
3174 && minnext != 0 /* CURLYM can't handle zero width */
3175 ) {
3176 /* XXXX How to optimize if data == 0? */
3177 /* Optimize to a simpler form. */
3178 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
3179 regnode *nxt2;
3180
3181 OP(oscan) = CURLYM;
3182 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
3183 && (OP(nxt2) != WHILEM))
3184 nxt = nxt2;
3185 OP(nxt2) = SUCCEED; /* Whas WHILEM */
3186 /* Need to optimize away parenths. */
3187 if (data->flags & SF_IN_PAR) {
3188 /* Set the parenth number. */
3189 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
3190
3191 if (OP(nxt) != CLOSE)
3192 FAIL("Panic opt close");
3193 oscan->flags = (U8)ARG(nxt);
3194 if (RExC_open_parens) {
3195 RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/
3196 RExC_close_parens[ARG(nxt1)-1]=nxt2+1; /*close->NOTHING*/
40d049e4 3197 }
8aa23a47
YO
3198 OP(nxt1) = OPTIMIZED; /* was OPEN. */
3199 OP(nxt) = OPTIMIZED; /* was CLOSE. */
40d049e4 3200
c277df42 3201#ifdef DEBUGGING
8aa23a47
YO
3202 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
3203 OP(nxt + 1) = OPTIMIZED; /* was count. */
3204 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
3205 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
b81d288d 3206#endif
c277df42 3207#if 0
8aa23a47
YO
3208 while ( nxt1 && (OP(nxt1) != WHILEM)) {
3209 regnode *nnxt = regnext(nxt1);
3210
3211 if (nnxt == nxt) {
3212 if (reg_off_by_arg[OP(nxt1)])
3213 ARG_SET(nxt1, nxt2 - nxt1);
3214 else if (nxt2 - nxt1 < U16_MAX)
3215 NEXT_OFF(nxt1) = nxt2 - nxt1;
3216 else
3217 OP(nxt) = NOTHING; /* Cannot beautify */
c277df42 3218 }
8aa23a47 3219 nxt1 = nnxt;
c277df42 3220 }
5d1c421c 3221#endif
8aa23a47
YO
3222 /* Optimize again: */
3223 study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt,
3224 NULL, stopparen, recursed, NULL, 0,depth+1);
3225 }
3226 else
3227 oscan->flags = 0;
3228 }
3229 else if ((OP(oscan) == CURLYX)
3230 && (flags & SCF_WHILEM_VISITED_POS)
3231 /* See the comment on a similar expression above.
3232 However, this time it not a subexpression
3233 we care about, but the expression itself. */
3234 && (maxcount == REG_INFTY)
3235 && data && ++data->whilem_c < 16) {
3236 /* This stays as CURLYX, we can put the count/of pair. */
3237 /* Find WHILEM (as in regexec.c) */
3238 regnode *nxt = oscan + NEXT_OFF(oscan);
3239
3240 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
3241 nxt += ARG(nxt);
3242 PREVOPER(nxt)->flags = (U8)(data->whilem_c
3243 | (RExC_whilem_seen << 4)); /* On WHILEM */
3244 }
3245 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
3246 pars++;
3247 if (flags & SCF_DO_SUBSTR) {
3248 SV *last_str = NULL;
3249 int counted = mincount != 0;
a0ed51b3 3250
8aa23a47
YO
3251 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
3252#if defined(SPARC64_GCC_WORKAROUND)
3253 I32 b = 0;
3254 STRLEN l = 0;
3255 const char *s = NULL;
3256 I32 old = 0;
b515a41d 3257
8aa23a47
YO
3258 if (pos_before >= data->last_start_min)
3259 b = pos_before;
3260 else
3261 b = data->last_start_min;
b515a41d 3262
8aa23a47
YO
3263 l = 0;
3264 s = SvPV_const(data->last_found, l);
3265 old = b - data->last_start_min;
3266
3267#else
3268 I32 b = pos_before >= data->last_start_min
3269 ? pos_before : data->last_start_min;
3270 STRLEN l;
3271 const char * const s = SvPV_const(data->last_found, l);
3272 I32 old = b - data->last_start_min;
3273#endif
3274
3275 if (UTF)
3276 old = utf8_hop((U8*)s, old) - (U8*)s;
3277
3278 l -= old;
3279 /* Get the added string: */
3280 last_str = newSVpvn(s + old, l);
3281 if (UTF)
3282 SvUTF8_on(last_str);
3283 if (deltanext == 0 && pos_before == b) {
3284 /* What was added is a constant string */
3285 if (mincount > 1) {
3286 SvGROW(last_str, (mincount * l) + 1);
3287 repeatcpy(SvPVX(last_str) + l,
3288 SvPVX_const(last_str), l, mincount - 1);
3289 SvCUR_set(last_str, SvCUR(last_str) * mincount);
3290 /* Add additional parts. */
3291 SvCUR_set(data->last_found,
3292 SvCUR(data->last_found) - l);
3293 sv_catsv(data->last_found, last_str);
3294 {
3295 SV * sv = data->last_found;
3296 MAGIC *mg =
3297 SvUTF8(sv) && SvMAGICAL(sv) ?
3298 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3299 if (mg && mg->mg_len >= 0)
3300 mg->mg_len += CHR_SVLEN(last_str);
b515a41d 3301 }
8aa23a47 3302 data->last_end += l * (mincount - 1);
b515a41d 3303 }
8aa23a47
YO
3304 } else {
3305 /* start offset must point into the last copy */
3306 data->last_start_min += minnext * (mincount - 1);
3307 data->last_start_max += is_inf ? I32_MAX
3308 : (maxcount - 1) * (minnext + data->pos_delta);
3309 }
c277df42 3310 }
8aa23a47
YO
3311 /* It is counted once already... */
3312 data->pos_min += minnext * (mincount - counted);
3313 data->pos_delta += - counted * deltanext +
3314 (minnext + deltanext) * maxcount - minnext * mincount;
3315 if (mincount != maxcount) {
3316 /* Cannot extend fixed substrings found inside
3317 the group. */
304ee84b 3318 SCAN_COMMIT(pRExC_state,data,minlenp);
8aa23a47
YO
3319 if (mincount && last_str) {
3320 SV * const sv = data->last_found;
3321 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ?
3322 mg_find(sv, PERL_MAGIC_utf8) : NULL;
3323
3324 if (mg)
3325 mg->mg_len = -1;
3326 sv_setsv(sv, last_str);
3327 data->last_end = data->pos_min;
3328 data->last_start_min =
3329 data->pos_min - CHR_SVLEN(last_str);
3330 data->last_start_max = is_inf
3331 ? I32_MAX
3332 : data->pos_min + data->pos_delta
3333 - CHR_SVLEN(last_str);
3334 }
3335 data->longest = &(data->longest_float);
3336 }
3337 SvREFCNT_dec(last_str);
c277df42 3338 }
8aa23a47
YO
3339 if (data && (fl & SF_HAS_EVAL))
3340 data->flags |= SF_HAS_EVAL;
3341 optimize_curly_tail:
3342 if (OP(oscan) != CURLYX) {
3343 while (PL_regkind[OP(next = regnext(oscan))] == NOTHING
3344 && NEXT_OFF(next))
3345 NEXT_OFF(oscan) += NEXT_OFF(next);
3346 }
3347 continue;
3348 default: /* REF and CLUMP only? */
3349 if (flags & SCF_DO_SUBSTR) {
304ee84b 3350 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
8aa23a47
YO
3351 data->longest = &(data->longest_float);
3352 }
3353 is_inf = is_inf_internal = 1;
3354 if (flags & SCF_DO_STCLASS_OR)
3355 cl_anything(pRExC_state, data->start_class);
3356 flags &= ~SCF_DO_STCLASS;
3357 break;
c277df42 3358 }
8aa23a47 3359 }
e1d1eefb
YO
3360 else if (OP(scan) == LNBREAK) {
3361 if (flags & SCF_DO_STCLASS) {
3362 int value = 0;
3363 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
3364 if (flags & SCF_DO_STCLASS_AND) {
3365 for (value = 0; value < 256; value++)
e64b1bd1 3366 if (!is_VERTWS_cp(value))
e1d1eefb
YO
3367 ANYOF_BITMAP_CLEAR(data->start_class, value);
3368 }
3369 else {
3370 for (value = 0; value < 256; value++)
e64b1bd1 3371 if (is_VERTWS_cp(value))
e1d1eefb
YO
3372 ANYOF_BITMAP_SET(data->start_class, value);
3373 }
3374 if (flags & SCF_DO_STCLASS_OR)
3375 cl_and(data->start_class, and_withp);
3376 flags &= ~SCF_DO_STCLASS;
3377 }
3378 min += 1;
f9a79580 3379 delta += 1;
e1d1eefb
YO
3380 if (flags & SCF_DO_SUBSTR) {
3381 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3382 data->pos_min += 1;
f9a79580 3383 data->pos_delta += 1;
e1d1eefb
YO
3384 data->longest = &(data->longest_float);
3385 }
3386
3387 }
f9a79580
RGS
3388 else if (OP(scan) == FOLDCHAR) {
3389 int d = ARG(scan)==0xDF ? 1 : 2;
3390 flags &= ~SCF_DO_STCLASS;
3391 min += 1;
3392 delta += d;
3393 if (flags & SCF_DO_SUBSTR) {
3394 SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */
3395 data->pos_min += 1;
3396 data->pos_delta += d;
3397 data->longest = &(data->longest_float);
3398 }
3399 }
8aa23a47
YO
3400 else if (strchr((const char*)PL_simple,OP(scan))) {
3401 int value = 0;
653099ff 3402
8aa23a47 3403 if (flags & SCF_DO_SUBSTR) {
304ee84b 3404 SCAN_COMMIT(pRExC_state,data,minlenp);
8aa23a47
YO
3405 data->pos_min++;
3406 }
3407 min++;
3408 if (flags & SCF_DO_STCLASS) {
3409 data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */
b515a41d 3410
8aa23a47
YO
3411 /* Some of the logic below assumes that switching
3412 locale on will only add false positives. */
3413 switch (PL_regkind[OP(scan)]) {
3414 case SANY:
3415 default:
3416 do_default:
3417 /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */
3418 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */
3419 cl_anything(pRExC_state, data->start_class);
3420 break;
3421 case REG_ANY:
3422 if (OP(scan) == SANY)
3423 goto do_default;
3424 if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */
3425 value = (ANYOF_BITMAP_TEST(data->start_class,'\n')
3426 || (data->start_class->flags & ANYOF_CLASS));
3427 cl_anything(pRExC_state, data->start_class);
653099ff 3428 }
8aa23a47
YO
3429 if (flags & SCF_DO_STCLASS_AND || !value)
3430 ANYOF_BITMAP_CLEAR(data->start_class,'\n');
3431 break;
3432 case ANYOF:
3433 if (flags & SCF_DO_STCLASS_AND)
3434 cl_and(data->start_class,
3435 (struct regnode_charclass_class*)scan);
653099ff 3436 else
8aa23a47
YO
3437 cl_or(pRExC_state, data->start_class,
3438 (struct regnode_charclass_class*)scan);
3439 break;
3440 case ALNUM:
3441 if (flags & SCF_DO_STCLASS_AND) {
3442 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3443 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3444 for (value = 0; value < 256; value++)
3445 if (!isALNUM(value))
3446 ANYOF_BITMAP_CLEAR(data->start_class, value);
3447 }
653099ff 3448 }
8aa23a47
YO
3449 else {
3450 if (data->start_class->flags & ANYOF_LOCALE)
3451 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3452 else {
3453 for (value = 0; value < 256; value++)
3454 if (isALNUM(value))
3455 ANYOF_BITMAP_SET(data->start_class, value);
653099ff 3456 }
8aa23a47
YO
3457 }
3458 break;
3459 case ALNUML:
3460 if (flags & SCF_DO_STCLASS_AND) {
3461 if (data->start_class->flags & ANYOF_LOCALE)
3462 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM);
3463 }
3464 else {
3465 ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM);
3466 data->start_class->flags |= ANYOF_LOCALE;
3467 }
3468 break;
3469 case NALNUM:
3470 if (flags & SCF_DO_STCLASS_AND) {
3471 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3472 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
3473 for (value = 0; value < 256; value++)
3474 if (isALNUM(value))
3475 ANYOF_BITMAP_CLEAR(data->start_class, value);
653099ff
GS
3476 }
3477 }
8aa23a47
YO
3478 else {
3479 if (data->start_class->flags & ANYOF_LOCALE)
3480 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3481 else {
3482 for (value = 0; value < 256; value++)
3483 if (!isALNUM(value))
3484 ANYOF_BITMAP_SET(data->start_class, value);
3485 }
653099ff 3486 }
8aa23a47
YO
3487 break;
3488 case NALNUML:
3489 if (flags & SCF_DO_STCLASS_AND) {
3490 if (data->start_class->flags & ANYOF_LOCALE)
3491 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM);
653099ff 3492 }
8aa23a47
YO
3493 else {
3494 data->start_class->flags |= ANYOF_LOCALE;
3495 ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM);
3496 }
3497 break;
3498 case SPACE:
3499 if (flags & SCF_DO_STCLASS_AND) {
3500 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3501 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3502 for (value = 0; value < 256; value++)
3503 if (!isSPACE(value))
3504 ANYOF_BITMAP_CLEAR(data->start_class, value);
653099ff
GS
3505 }
3506 }
8aa23a47
YO
3507 else {
3508 if (data->start_class->flags & ANYOF_LOCALE)
3509 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3510 else {
3511 for (value = 0; value < 256; value++)
3512 if (isSPACE(value))
3513 ANYOF_BITMAP_SET(data->start_class, value);
3514 }
653099ff 3515 }
8aa23a47
YO
3516 break;
3517 case SPACEL:
3518 if (flags & SCF_DO_STCLASS_AND) {
3519 if (data->start_class->flags & ANYOF_LOCALE)
3520 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE);
3521 }
3522 else {
3523 data->start_class->flags |= ANYOF_LOCALE;
3524 ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE);
3525 }
3526 break;
3527 case NSPACE:
3528 if (flags & SCF_DO_STCLASS_AND) {
3529 if (!(data->start_class->flags & ANYOF_LOCALE)) {
3530 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3531 for (value = 0; value < 256; value++)
3532 if (isSPACE(value))
3533 ANYOF_BITMAP_CLEAR(data->start_class, value);
653099ff 3534 }
8aa23a47
YO
3535 }
3536 else {
3537 if (data->start_class->flags & ANYOF_LOCALE)
3538 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3539 else {
3540 for (value = 0; value < 256; value++)
3541 if (!isSPACE(value))
3542 ANYOF_BITMAP_SET(data->start_class, value);
653099ff
GS
3543 }
3544 }
8aa23a47
YO
3545 break;
3546 case NSPACEL:
3547 if (flags & SCF_DO_STCLASS_AND) {
3548 if (data->start_class->flags & ANYOF_LOCALE) {
3549 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE);
3550 for (value = 0; value < 256; value++)
3551 if (!isSPACE(value))
3552 ANYOF_BITMAP_CLEAR(data->start_class, value);
3553 }
653099ff 3554 }
8aa23a47
YO
3555 else {
3556 data->start_class->flags |= ANYOF_LOCALE;
3557 ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE);
3558 }
3559 break;
3560 case DIGIT:
3561 if (flags & SCF_DO_STCLASS_AND) {
3562 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT);
3563 for (value = 0; value < 256; value++)
3564 if (!isDIGIT(value))
3565 ANYOF_BITMAP_CLEAR(data->start_class, value);
3566 }
3567 else {
3568 if (data->start_class->flags & ANYOF_LOCALE)
3569 ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT);
3570 else {
3571 for (value = 0; value < 256; value++)
3572 if (isDIGIT(value))
3573 ANYOF_BITMAP_SET(data->start_class, value);
3574 }
3575 }
3576 break;
3577 case NDIGIT:
3578 if (flags & SCF_DO_STCLASS_AND) {
3579 ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT);
3580 for (value = 0; value < 256; value++)
3581 if (isDIGIT(value))
3582 ANYOF_BITMAP_CLEAR(data->start_class, value);
3583 }
3584 else {
3585 if (data->start_class->flags & ANYOF_LOCALE)
3586 ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT);
3587 else {
3588 for (value = 0; value < 256; value++)
3589 if (!isDIGIT(value))
3590 ANYOF_BITMAP_SET(data->start_class, value);
653099ff
GS
3591 }
3592 }
8aa23a47 3593 break;
e1d1eefb
YO
3594 CASE_SYNST_FNC(VERTWS);
3595 CASE_SYNST_FNC(HORIZWS);
3596
8aa23a47
YO
3597 }
3598 if (flags & SCF_DO_STCLASS_OR)
3599 cl_and(data->start_class, and_withp);
3600 flags &= ~SCF_DO_STCLASS;
3601 }
3602 }
3603 else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
3604 data->flags |= (OP(scan) == MEOL
3605 ? SF_BEFORE_MEOL
3606 : SF_BEFORE_SEOL);
3607 }
3608 else if ( PL_regkind[OP(scan)] == BRANCHJ
3609 /* Lookbehind, or need to calculate parens/evals/stclass: */
3610 && (scan->flags || data || (flags & SCF_DO_STCLASS))
3611 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
3612 if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3613 || OP(scan) == UNLESSM )
3614 {
3615 /* Negative Lookahead/lookbehind
3616 In this case we can't do fixed string optimisation.
3617 */
1de06328 3618
8aa23a47
YO
3619 I32 deltanext, minnext, fake = 0;
3620 regnode *nscan;
3621 struct regnode_charclass_class intrnl;
3622 int f = 0;
1de06328 3623
8aa23a47
YO
3624 data_fake.flags = 0;
3625 if (data) {
3626 data_fake.whilem_c = data->whilem_c;
3627 data_fake.last_closep = data->last_closep;
c277df42 3628 }
8aa23a47
YO
3629 else
3630 data_fake.last_closep = &fake;
58e23c8d 3631 data_fake.pos_delta = delta;
8aa23a47
YO
3632 if ( flags & SCF_DO_STCLASS && !scan->flags
3633 && OP(scan) == IFMATCH ) { /* Lookahead */
3634 cl_init(pRExC_state, &intrnl);
3635 data_fake.start_class = &intrnl;
3636 f |= SCF_DO_STCLASS_AND;
3637 }
3638 if (flags & SCF_WHILEM_VISITED_POS)
3639 f |= SCF_WHILEM_VISITED_POS;
3640 next = regnext(scan);
3641 nscan = NEXTOPER(NEXTOPER(scan));
3642 minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext,
3643 last, &data_fake, stopparen, recursed, NULL, f, depth+1);
3644 if (scan->flags) {
3645 if (deltanext) {
58e23c8d 3646 FAIL("Variable length lookbehind not implemented");
8aa23a47
YO
3647 }
3648 else if (minnext > (I32)U8_MAX) {
58e23c8d 3649 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
8aa23a47
YO
3650 }
3651 scan->flags = (U8)minnext;
3652 }
3653 if (data) {
3654 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3655 pars++;
3656 if (data_fake.flags & SF_HAS_EVAL)
3657 data->flags |= SF_HAS_EVAL;
3658 data->whilem_c = data_fake.whilem_c;
3659 }
3660 if (f & SCF_DO_STCLASS_AND) {
3661 const int was = (data->start_class->flags & ANYOF_EOS);
3662
3663 cl_and(data->start_class, &intrnl);
3664 if (was)
3665 data->start_class->flags |= ANYOF_EOS;
3666 }
cb434fcc 3667 }
8aa23a47
YO
3668#if PERL_ENABLE_POSITIVE_ASSERTION_STUDY
3669 else {
3670 /* Positive Lookahead/lookbehind
3671 In this case we can do fixed string optimisation,
3672 but we must be careful about it. Note in the case of
3673 lookbehind the positions will be offset by the minimum
3674 length of the pattern, something we won't know about
3675 until after the recurse.
3676 */
3677 I32 deltanext, fake = 0;
3678 regnode *nscan;
3679 struct regnode_charclass_class intrnl;
3680 int f = 0;
3681 /* We use SAVEFREEPV so that when the full compile
3682 is finished perl will clean up the allocated
3683 minlens when its all done. This was we don't
3684 have to worry about freeing them when we know
3685 they wont be used, which would be a pain.
3686 */
3687 I32 *minnextp;
3688 Newx( minnextp, 1, I32 );
3689 SAVEFREEPV(minnextp);
3690
3691 if (data) {
3692 StructCopy(data, &data_fake, scan_data_t);
3693 if ((flags & SCF_DO_SUBSTR) && data->last_found) {
3694 f |= SCF_DO_SUBSTR;
3695 if (scan->flags)
304ee84b 3696 SCAN_COMMIT(pRExC_state, &data_fake,minlenp);
8aa23a47
YO
3697 data_fake.last_found=newSVsv(data->last_found);
3698 }
3699 }
3700 else
3701 data_fake.last_closep = &fake;
3702 data_fake.flags = 0;
58e23c8d 3703 data_fake.pos_delta = delta;
8aa23a47
YO
3704 if (is_inf)
3705 data_fake.flags |= SF_IS_INF;
3706 if ( flags & SCF_DO_STCLASS && !scan->flags
3707 && OP(scan) == IFMATCH ) { /* Lookahead */
3708 cl_init(pRExC_state, &intrnl);
3709 data_fake.start_class = &intrnl;
3710 f |= SCF_DO_STCLASS_AND;
3711 }
3712 if (flags & SCF_WHILEM_VISITED_POS)
3713 f |= SCF_WHILEM_VISITED_POS;
3714 next = regnext(scan);
3715 nscan = NEXTOPER(NEXTOPER(scan));
3716
3717 *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext,
3718 last, &data_fake, stopparen, recursed, NULL, f,depth+1);
3719 if (scan->flags) {
3720 if (deltanext) {
58e23c8d 3721 FAIL("Variable length lookbehind not implemented");
8aa23a47
YO
3722 }
3723 else if (*minnextp > (I32)U8_MAX) {
58e23c8d 3724 FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX);
8aa23a47
YO
3725 }
3726 scan->flags = (U8)*minnextp;
3727 }
3728
3729 *minnextp += min;
3730
3731 if (f & SCF_DO_STCLASS_AND) {
3732 const int was = (data->start_class->flags & ANYOF_EOS);
3733
3734 cl_and(data->start_class, &intrnl);
3735 if (was)
3736 data->start_class->flags |= ANYOF_EOS;
3737 }
3738 if (data) {
3739 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
3740 pars++;
3741 if (data_fake.flags & SF_HAS_EVAL)
3742 data->flags |= SF_HAS_EVAL;
3743 data->whilem_c = data_fake.whilem_c;
3744 if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) {
3745 if (RExC_rx->minlen<*minnextp)
3746 RExC_rx->minlen=*minnextp;
304ee84b 3747 SCAN_COMMIT(pRExC_state, &data_fake, minnextp);
8aa23a47
YO
3748 SvREFCNT_dec(data_fake.last_found);
3749
3750 if ( data_fake.minlen_fixed != minlenp )
3751 {
3752 data->offset_fixed= data_fake.offset_fixed;
3753 data->minlen_fixed= data_fake.minlen_fixed;
3754 data->lookbehind_fixed+= scan->flags;
3755 }
3756 if ( data_fake.minlen_float != minlenp )
3757 {
3758 data->minlen_float= data_fake.minlen_float;
3759 data->offset_float_min=data_fake.offset_float_min;
3760 data->offset_float_max=data_fake.offset_float_max;
3761 data->lookbehind_float+= scan->flags;
3762 }
3763 }
3764 }
3765
3766
40d049e4 3767 }
8aa23a47
YO
3768#endif
3769 }
3770 else if (OP(scan) == OPEN) {
3771 if (stopparen != (I32)ARG(scan))
3772 pars++;
3773 }
3774 else if (OP(scan) == CLOSE) {
3775 if (stopparen == (I32)ARG(scan)) {
3776 break;
3777 }
3778 if ((I32)ARG(scan) == is_par) {
3779 next = regnext(scan);
b515a41d 3780
8aa23a47
YO
3781 if ( next && (OP(next) != WHILEM) && next < last)
3782 is_par = 0; /* Disable optimization */
40d049e4 3783 }
8aa23a47
YO
3784 if (data)
3785 *(data->last_closep) = ARG(scan);
3786 }
3787 else if (OP(scan) == EVAL) {
c277df42
IZ
3788 if (data)
3789 data->flags |= SF_HAS_EVAL;
8aa23a47
YO
3790 }
3791 else if ( PL_regkind[OP(scan)] == ENDLIKE ) {
3792 if (flags & SCF_DO_SUBSTR) {
304ee84b 3793 SCAN_COMMIT(pRExC_state,data,minlenp);
8aa23a47 3794 flags &= ~SCF_DO_SUBSTR;
40d049e4 3795 }
8aa23a47
YO
3796 if (data && OP(scan)==ACCEPT) {
3797 data->flags |= SCF_SEEN_ACCEPT;
3798 if (stopmin > min)
3799 stopmin = min;
e2e6a0f1 3800 }
8aa23a47
YO
3801 }
3802 else if (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */
3803 {
0f5d15d6 3804 if (flags & SCF_DO_SUBSTR) {
304ee84b 3805 SCAN_COMMIT(pRExC_state,data,minlenp);
0f5d15d6
IZ
3806 data->longest = &(data->longest_float);
3807 }
3808 is_inf = is_inf_internal = 1;
653099ff 3809 if (flags & SCF_DO_STCLASS_OR) /* Allow everything */