Commit | Line | Data |
---|---|---|
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 | 102 | typedef 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; ®dummy = 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 */ | |
1aa99e6b | 127 | I32 utf8; |
6bda09f9 | 128 | HV *charnames; /* cache of named sequences */ |
81714fb9 | 129 | HV *paren_names; /* Paren names */ |
1f1031fe | 130 | |
40d049e4 YO |
131 | regnode **recurse; /* Recurse regops */ |
132 | I32 recurse_count; /* Number of recurse regops */ | |
830247a4 IZ |
133 | #if ADD_TO_REGEXEC |
134 | char *starttry; /* -Dr: where regtry was called. */ | |
135 | #define RExC_starttry (pRExC_state->starttry) | |
136 | #endif | |
3dab1dad | 137 | #ifdef DEBUGGING |
be8e71aa | 138 | const char *lastparse; |
3dab1dad | 139 | I32 lastnum; |
1f1031fe | 140 | AV *paren_name_list; /* idx -> name */ |
3dab1dad YO |
141 | #define RExC_lastparse (pRExC_state->lastparse) |
142 | #define RExC_lastnum (pRExC_state->lastnum) | |
1f1031fe | 143 | #define RExC_paren_name_list (pRExC_state->paren_name_list) |
3dab1dad | 144 | #endif |
830247a4 IZ |
145 | } RExC_state_t; |
146 | ||
e2509266 | 147 | #define RExC_flags (pRExC_state->flags) |
830247a4 IZ |
148 | #define RExC_precomp (pRExC_state->precomp) |
149 | #define RExC_rx (pRExC_state->rx) | |
f8fc2ecf | 150 | #define RExC_rxi (pRExC_state->rxi) |
fac92740 | 151 | #define RExC_start (pRExC_state->start) |
830247a4 IZ |
152 | #define RExC_end (pRExC_state->end) |
153 | #define RExC_parse (pRExC_state->parse) | |
154 | #define RExC_whilem_seen (pRExC_state->whilem_seen) | |
7122b237 YO |
155 | #ifdef RE_TRACK_PATTERN_OFFSETS |
156 | #define RExC_offsets (pRExC_state->rxi->u.offsets) /* I am not like the others */ | |
157 | #endif | |
830247a4 | 158 | #define RExC_emit (pRExC_state->emit) |
fac92740 | 159 | #define RExC_emit_start (pRExC_state->emit_start) |
3b57cd43 | 160 | #define RExC_emit_bound (pRExC_state->emit_bound) |
830247a4 IZ |
161 | #define RExC_naughty (pRExC_state->naughty) |
162 | #define RExC_sawback (pRExC_state->sawback) | |
163 | #define RExC_seen (pRExC_state->seen) | |
164 | #define RExC_size (pRExC_state->size) | |
165 | #define RExC_npar (pRExC_state->npar) | |
e2e6a0f1 | 166 | #define RExC_nestroot (pRExC_state->nestroot) |
830247a4 IZ |
167 | #define RExC_extralen (pRExC_state->extralen) |
168 | #define RExC_seen_zerolen (pRExC_state->seen_zerolen) | |
169 | #define RExC_seen_evals (pRExC_state->seen_evals) | |
1aa99e6b | 170 | #define RExC_utf8 (pRExC_state->utf8) |
fc8cd66c | 171 | #define RExC_charnames (pRExC_state->charnames) |
40d049e4 YO |
172 | #define RExC_open_parens (pRExC_state->open_parens) |
173 | #define RExC_close_parens (pRExC_state->close_parens) | |
174 | #define RExC_opend (pRExC_state->opend) | |
81714fb9 | 175 | #define RExC_paren_names (pRExC_state->paren_names) |
40d049e4 YO |
176 | #define RExC_recurse (pRExC_state->recurse) |
177 | #define RExC_recurse_count (pRExC_state->recurse_count) | |
830247a4 | 178 | |
cde0cee5 | 179 | |
a687059c LW |
180 | #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?') |
181 | #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \ | |
182 | ((*s) == '{' && regcurly(s))) | |
a687059c | 183 | |
35c8bce7 LW |
184 | #ifdef SPSTART |
185 | #undef SPSTART /* dratted cpp namespace... */ | |
186 | #endif | |
a687059c LW |
187 | /* |
188 | * Flags to be passed up and down. | |
189 | */ | |
a687059c | 190 | #define WORST 0 /* Worst case. */ |
a3b492c3 YO |
191 | #define HASWIDTH 0x01 /* Known to match non-null strings. */ |
192 | #define SIMPLE 0x02 /* Simple enough to be STAR/PLUS operand. */ | |
193 | #define SPSTART 0x04 /* Starts with * or +. */ | |
194 | #define TRYAGAIN 0x08 /* Weeded out a declaration. */ | |
195 | #define POSTPONED 0x10 /* (?1),(?&name), (??{...}) or similar */ | |
a687059c | 196 | |
3dab1dad YO |
197 | #define REG_NODE_NUM(x) ((x) ? (int)((x)-RExC_emit_start) : -1) |
198 | ||
07be1b83 YO |
199 | /* whether trie related optimizations are enabled */ |
200 | #if PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION | |
201 | #define TRIE_STUDY_OPT | |
786e8c11 | 202 | #define FULL_TRIE_STUDY |
07be1b83 YO |
203 | #define TRIE_STCLASS |
204 | #endif | |
1de06328 YO |
205 | |
206 | ||
40d049e4 YO |
207 | |
208 | #define PBYTE(u8str,paren) ((U8*)(u8str))[(paren) >> 3] | |
209 | #define PBITVAL(paren) (1 << ((paren) & 7)) | |
210 | #define PAREN_TEST(u8str,paren) ( PBYTE(u8str,paren) & PBITVAL(paren)) | |
211 | #define PAREN_SET(u8str,paren) PBYTE(u8str,paren) |= PBITVAL(paren) | |
212 | #define PAREN_UNSET(u8str,paren) PBYTE(u8str,paren) &= (~PBITVAL(paren)) | |
213 | ||
214 | ||
1de06328 YO |
215 | /* About scan_data_t. |
216 | ||
217 | During optimisation we recurse through the regexp program performing | |
218 | various inplace (keyhole style) optimisations. In addition study_chunk | |
219 | and scan_commit populate this data structure with information about | |
220 | what strings MUST appear in the pattern. We look for the longest | |
221 | string that must appear for at a fixed location, and we look for the | |
222 | longest string that may appear at a floating location. So for instance | |
223 | in the pattern: | |
224 | ||
225 | /FOO[xX]A.*B[xX]BAR/ | |
226 | ||
227 | Both 'FOO' and 'A' are fixed strings. Both 'B' and 'BAR' are floating | |
228 | strings (because they follow a .* construct). study_chunk will identify | |
229 | both FOO and BAR as being the longest fixed and floating strings respectively. | |
230 | ||
231 | The strings can be composites, for instance | |
232 | ||
233 | /(f)(o)(o)/ | |
234 | ||
235 | will result in a composite fixed substring 'foo'. | |
236 | ||
237 | For each string some basic information is maintained: | |
238 | ||
239 | - offset or min_offset | |
240 | This is the position the string must appear at, or not before. | |
241 | It also implicitly (when combined with minlenp) tells us how many | |
242 | character must match before the string we are searching. | |
243 | Likewise when combined with minlenp and the length of the string | |
244 | tells us how many characters must appear after the string we have | |
245 | found. | |
246 | ||
247 | - max_offset | |
248 | Only used for floating strings. This is the rightmost point that | |
249 | the string can appear at. Ifset to I32 max it indicates that the | |
250 | string can occur infinitely far to the right. | |
251 | ||
252 | - minlenp | |
253 | A pointer to the minimum length of the pattern that the string | |
254 | was found inside. This is important as in the case of positive | |
255 | lookahead or positive lookbehind we can have multiple patterns | |
256 | involved. Consider | |
257 | ||
258 | /(?=FOO).*F/ | |
259 | ||
260 | The minimum length of the pattern overall is 3, the minimum length | |
261 | of the lookahead part is 3, but the minimum length of the part that | |
262 | will actually match is 1. So 'FOO's minimum length is 3, but the | |
263 | minimum length for the F is 1. This is important as the minimum length | |
264 | is used to determine offsets in front of and behind the string being | |
265 | looked for. Since strings can be composites this is the length of the | |
266 | pattern at the time it was commited with a scan_commit. Note that | |
267 | the length is calculated by study_chunk, so that the minimum lengths | |
268 | are not known until the full pattern has been compiled, thus the | |
269 | pointer to the value. | |
270 | ||
271 | - lookbehind | |
272 | ||
273 | In the case of lookbehind the string being searched for can be | |
274 | offset past the start point of the final matching string. | |
275 | If this value was just blithely removed from the min_offset it would | |
276 | invalidate some of the calculations for how many chars must match | |
277 | before or after (as they are derived from min_offset and minlen and | |
278 | the length of the string being searched for). | |
279 | When the final pattern is compiled and the data is moved from the | |
280 | scan_data_t structure into the regexp structure the information | |
281 | about lookbehind is factored in, with the information that would | |
282 | have been lost precalculated in the end_shift field for the | |
283 | associated string. | |
284 | ||
285 | The fields pos_min and pos_delta are used to store the minimum offset | |
286 | and the delta to the maximum offset at the current point in the pattern. | |
287 | ||
288 | */ | |
2c2d71f5 JH |
289 | |
290 | typedef struct scan_data_t { | |
1de06328 YO |
291 | /*I32 len_min; unused */ |
292 | /*I32 len_delta; unused */ | |
2c2d71f5 JH |
293 | I32 pos_min; |
294 | I32 pos_delta; | |
295 | SV *last_found; | |
1de06328 | 296 | I32 last_end; /* min value, <0 unless valid. */ |
2c2d71f5 JH |
297 | I32 last_start_min; |
298 | I32 last_start_max; | |
1de06328 YO |
299 | SV **longest; /* Either &l_fixed, or &l_float. */ |
300 | SV *longest_fixed; /* longest fixed string found in pattern */ | |
301 | I32 offset_fixed; /* offset where it starts */ | |
302 | I32 *minlen_fixed; /* pointer to the minlen relevent to the string */ | |
303 | I32 lookbehind_fixed; /* is the position of the string modfied by LB */ | |
304 | SV *longest_float; /* longest floating string found in pattern */ | |
305 | I32 offset_float_min; /* earliest point in string it can appear */ | |
306 | I32 offset_float_max; /* latest point in string it can appear */ | |
307 | I32 *minlen_float; /* pointer to the minlen relevent to the string */ | |
308 | I32 lookbehind_float; /* is the position of the string modified by LB */ | |
2c2d71f5 JH |
309 | I32 flags; |
310 | I32 whilem_c; | |
cb434fcc | 311 | I32 *last_closep; |
653099ff | 312 | struct regnode_charclass_class *start_class; |
2c2d71f5 JH |
313 | } scan_data_t; |
314 | ||
a687059c | 315 | /* |
e50aee73 | 316 | * Forward declarations for pregcomp()'s friends. |
a687059c | 317 | */ |
a0d0e21e | 318 | |
27da23d5 | 319 | static const scan_data_t zero_scan_data = |
1de06328 | 320 | { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ,0}; |
c277df42 IZ |
321 | |
322 | #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL) | |
07be1b83 YO |
323 | #define SF_BEFORE_SEOL 0x0001 |
324 | #define SF_BEFORE_MEOL 0x0002 | |
c277df42 IZ |
325 | #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL) |
326 | #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL) | |
327 | ||
09b7f37c CB |
328 | #ifdef NO_UNARY_PLUS |
329 | # define SF_FIX_SHIFT_EOL (0+2) | |
330 | # define SF_FL_SHIFT_EOL (0+4) | |
331 | #else | |
332 | # define SF_FIX_SHIFT_EOL (+2) | |
333 | # define SF_FL_SHIFT_EOL (+4) | |
334 | #endif | |
c277df42 IZ |
335 | |
336 | #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL) | |
337 | #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL) | |
338 | ||
339 | #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL) | |
340 | #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */ | |
07be1b83 YO |
341 | #define SF_IS_INF 0x0040 |
342 | #define SF_HAS_PAR 0x0080 | |
343 | #define SF_IN_PAR 0x0100 | |
344 | #define SF_HAS_EVAL 0x0200 | |
345 | #define SCF_DO_SUBSTR 0x0400 | |
653099ff GS |
346 | #define SCF_DO_STCLASS_AND 0x0800 |
347 | #define SCF_DO_STCLASS_OR 0x1000 | |
348 | #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR) | |
e1901655 | 349 | #define SCF_WHILEM_VISITED_POS 0x2000 |
c277df42 | 350 | |
786e8c11 | 351 | #define SCF_TRIE_RESTUDY 0x4000 /* Do restudy? */ |
e2e6a0f1 | 352 | #define SCF_SEEN_ACCEPT 0x8000 |
07be1b83 | 353 | |
eb160463 | 354 | #define UTF (RExC_utf8 != 0) |
bbe252da YO |
355 | #define LOC ((RExC_flags & RXf_PMf_LOCALE) != 0) |
356 | #define FOLD ((RExC_flags & RXf_PMf_FOLD) != 0) | |
a0ed51b3 | 357 | |
ffc61ed2 | 358 | #define OOB_UNICODE 12345678 |
93733859 | 359 | #define OOB_NAMEDCLASS -1 |
b8c5462f | 360 | |
a0ed51b3 LW |
361 | #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv)) |
362 | #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b) | |
363 | ||
8615cb43 | 364 | |
b45f050a JF |
365 | /* length of regex to show in messages that don't mark a position within */ |
366 | #define RegexLengthToShowInErrorMessages 127 | |
367 | ||
368 | /* | |
369 | * If MARKER[12] are adjusted, be sure to adjust the constants at the top | |
370 | * of t/op/regmesg.t, the tests in t/op/re_tests, and those in | |
371 | * op/pragma/warn/regcomp. | |
372 | */ | |
7253e4e3 RK |
373 | #define MARKER1 "<-- HERE" /* marker as it appears in the description */ |
374 | #define MARKER2 " <-- HERE " /* marker as it appears within the regex */ | |
b81d288d | 375 | |
7253e4e3 | 376 | #define REPORT_LOCATION " in regex; marked by " MARKER1 " in m/%.*s" MARKER2 "%s/" |
b45f050a JF |
377 | |
378 | /* | |
379 | * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given | |
380 | * arg. Show regex, up to a maximum length. If it's too long, chop and add | |
381 | * "...". | |
382 | */ | |
58e23c8d | 383 | #define _FAIL(code) STMT_START { \ |
bfed75c6 | 384 | const char *ellipses = ""; \ |
ccb2c380 MP |
385 | IV len = RExC_end - RExC_precomp; \ |
386 | \ | |
387 | if (!SIZE_ONLY) \ | |
388 | SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \ | |
389 | if (len > RegexLengthToShowInErrorMessages) { \ | |
390 | /* chop 10 shorter than the max, to ensure meaning of "..." */ \ | |
391 | len = RegexLengthToShowInErrorMessages - 10; \ | |
392 | ellipses = "..."; \ | |
393 | } \ | |
58e23c8d | 394 | code; \ |
ccb2c380 | 395 | } STMT_END |
8615cb43 | 396 | |
58e23c8d YO |
397 | #define FAIL(msg) _FAIL( \ |
398 | Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \ | |
399 | msg, (int)len, RExC_precomp, ellipses)) | |
400 | ||
401 | #define FAIL2(msg,arg) _FAIL( \ | |
402 | Perl_croak(aTHX_ msg " in regex m/%.*s%s/", \ | |
403 | arg, (int)len, RExC_precomp, ellipses)) | |
404 | ||
b45f050a | 405 | /* |
b45f050a JF |
406 | * Simple_vFAIL -- like FAIL, but marks the current location in the scan |
407 | */ | |
ccb2c380 | 408 | #define Simple_vFAIL(m) STMT_START { \ |
a28509cc | 409 | const IV offset = RExC_parse - RExC_precomp; \ |
ccb2c380 MP |
410 | Perl_croak(aTHX_ "%s" REPORT_LOCATION, \ |
411 | m, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
412 | } STMT_END | |
b45f050a JF |
413 | |
414 | /* | |
415 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL() | |
416 | */ | |
ccb2c380 MP |
417 | #define vFAIL(m) STMT_START { \ |
418 | if (!SIZE_ONLY) \ | |
419 | SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \ | |
420 | Simple_vFAIL(m); \ | |
421 | } STMT_END | |
b45f050a JF |
422 | |
423 | /* | |
424 | * Like Simple_vFAIL(), but accepts two arguments. | |
425 | */ | |
ccb2c380 | 426 | #define Simple_vFAIL2(m,a1) STMT_START { \ |
a28509cc | 427 | const IV offset = RExC_parse - RExC_precomp; \ |
ccb2c380 MP |
428 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \ |
429 | (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
430 | } STMT_END | |
b45f050a JF |
431 | |
432 | /* | |
433 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2(). | |
434 | */ | |
ccb2c380 MP |
435 | #define vFAIL2(m,a1) STMT_START { \ |
436 | if (!SIZE_ONLY) \ | |
437 | SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \ | |
438 | Simple_vFAIL2(m, a1); \ | |
439 | } STMT_END | |
b45f050a JF |
440 | |
441 | ||
442 | /* | |
443 | * Like Simple_vFAIL(), but accepts three arguments. | |
444 | */ | |
ccb2c380 | 445 | #define Simple_vFAIL3(m, a1, a2) STMT_START { \ |
a28509cc | 446 | const IV offset = RExC_parse - RExC_precomp; \ |
ccb2c380 MP |
447 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \ |
448 | (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
449 | } STMT_END | |
b45f050a JF |
450 | |
451 | /* | |
452 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3(). | |
453 | */ | |
ccb2c380 MP |
454 | #define vFAIL3(m,a1,a2) STMT_START { \ |
455 | if (!SIZE_ONLY) \ | |
456 | SAVEDESTRUCTOR_X(clear_re,(void*)RExC_rx); \ | |
457 | Simple_vFAIL3(m, a1, a2); \ | |
458 | } STMT_END | |
b45f050a JF |
459 | |
460 | /* | |
461 | * Like Simple_vFAIL(), but accepts four arguments. | |
462 | */ | |
ccb2c380 | 463 | #define Simple_vFAIL4(m, a1, a2, a3) STMT_START { \ |
a28509cc | 464 | const IV offset = RExC_parse - RExC_precomp; \ |
ccb2c380 MP |
465 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, \ |
466 | (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
467 | } STMT_END | |
b45f050a | 468 | |
ccb2c380 | 469 | #define vWARN(loc,m) STMT_START { \ |
a28509cc | 470 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
471 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s" REPORT_LOCATION, \ |
472 | m, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
473 | } STMT_END | |
474 | ||
475 | #define vWARNdep(loc,m) STMT_START { \ | |
a28509cc | 476 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
477 | Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_REGEXP), \ |
478 | "%s" REPORT_LOCATION, \ | |
479 | m, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
480 | } STMT_END | |
481 | ||
482 | ||
483 | #define vWARN2(loc, m, a1) STMT_START { \ | |
a28509cc | 484 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
485 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \ |
486 | a1, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
487 | } STMT_END | |
488 | ||
489 | #define vWARN3(loc, m, a1, a2) STMT_START { \ | |
a28509cc | 490 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
491 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \ |
492 | a1, a2, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
493 | } STMT_END | |
494 | ||
495 | #define vWARN4(loc, m, a1, a2, a3) STMT_START { \ | |
a28509cc | 496 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
497 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \ |
498 | a1, a2, a3, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
499 | } STMT_END | |
500 | ||
501 | #define vWARN5(loc, m, a1, a2, a3, a4) STMT_START { \ | |
a28509cc | 502 | const IV offset = loc - RExC_precomp; \ |
ccb2c380 MP |
503 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), m REPORT_LOCATION, \ |
504 | a1, a2, a3, a4, (int)offset, RExC_precomp, RExC_precomp + offset); \ | |
505 | } STMT_END | |
9d1d55b5 | 506 | |
8615cb43 | 507 | |
cd439c50 | 508 | /* Allow for side effects in s */ |
ccb2c380 MP |
509 | #define REGC(c,s) STMT_START { \ |
510 | if (!SIZE_ONLY) *(s) = (c); else (void)(s); \ | |
511 | } STMT_END | |
cd439c50 | 512 | |
fac92740 MJD |
513 | /* Macros for recording node offsets. 20001227 mjd@plover.com |
514 | * Nodes are numbered 1, 2, 3, 4. Node #n's position is recorded in | |
515 | * element 2*n-1 of the array. Element #2n holds the byte length node #n. | |
516 | * Element 0 holds the number n. | |
07be1b83 | 517 | * Position is 1 indexed. |
fac92740 | 518 | */ |
7122b237 YO |
519 | #ifndef RE_TRACK_PATTERN_OFFSETS |
520 | #define Set_Node_Offset_To_R(node,byte) | |
521 | #define Set_Node_Offset(node,byte) | |
522 | #define Set_Cur_Node_Offset | |
523 | #define Set_Node_Length_To_R(node,len) | |
524 | #define Set_Node_Length(node,len) | |
525 | #define Set_Node_Cur_Length(node) | |
526 | #define Node_Offset(n) | |
527 | #define Node_Length(n) | |
528 | #define Set_Node_Offset_Length(node,offset,len) | |
529 | #define ProgLen(ri) ri->u.proglen | |
530 | #define SetProgLen(ri,x) ri->u.proglen = x | |
531 | #else | |
532 | #define ProgLen(ri) ri->u.offsets[0] | |
533 | #define SetProgLen(ri,x) ri->u.offsets[0] = x | |
ccb2c380 MP |
534 | #define Set_Node_Offset_To_R(node,byte) STMT_START { \ |
535 | if (! SIZE_ONLY) { \ | |
536 | MJD_OFFSET_DEBUG(("** (%d) offset of node %d is %d.\n", \ | |
2a49f0f5 | 537 | __LINE__, (int)(node), (int)(byte))); \ |
ccb2c380 | 538 | if((node) < 0) { \ |
551405c4 | 539 | Perl_croak(aTHX_ "value of node is %d in Offset macro", (int)(node)); \ |
ccb2c380 MP |
540 | } else { \ |
541 | RExC_offsets[2*(node)-1] = (byte); \ | |
542 | } \ | |
543 | } \ | |
544 | } STMT_END | |
545 | ||
546 | #define Set_Node_Offset(node,byte) \ | |
547 | Set_Node_Offset_To_R((node)-RExC_emit_start, (byte)-RExC_start) | |
548 | #define Set_Cur_Node_Offset Set_Node_Offset(RExC_emit, RExC_parse) | |
549 | ||
550 | #define Set_Node_Length_To_R(node,len) STMT_START { \ | |
551 | if (! SIZE_ONLY) { \ | |
552 | MJD_OFFSET_DEBUG(("** (%d) size of node %d is %d.\n", \ | |
551405c4 | 553 | __LINE__, (int)(node), (int)(len))); \ |
ccb2c380 | 554 | if((node) < 0) { \ |
551405c4 | 555 | Perl_croak(aTHX_ "value of node is %d in Length macro", (int)(node)); \ |
ccb2c380 MP |
556 | } else { \ |
557 | RExC_offsets[2*(node)] = (len); \ | |
558 | } \ | |
559 | } \ | |
560 | } STMT_END | |
561 | ||
562 | #define Set_Node_Length(node,len) \ | |
563 | Set_Node_Length_To_R((node)-RExC_emit_start, len) | |
564 | #define Set_Cur_Node_Length(len) Set_Node_Length(RExC_emit, len) | |
565 | #define Set_Node_Cur_Length(node) \ | |
566 | Set_Node_Length(node, RExC_parse - parse_start) | |
fac92740 MJD |
567 | |
568 | /* Get offsets and lengths */ | |
569 | #define Node_Offset(n) (RExC_offsets[2*((n)-RExC_emit_start)-1]) | |
570 | #define Node_Length(n) (RExC_offsets[2*((n)-RExC_emit_start)]) | |
571 | ||
07be1b83 YO |
572 | #define Set_Node_Offset_Length(node,offset,len) STMT_START { \ |
573 | Set_Node_Offset_To_R((node)-RExC_emit_start, (offset)); \ | |
574 | Set_Node_Length_To_R((node)-RExC_emit_start, (len)); \ | |
575 | } STMT_END | |
7122b237 | 576 | #endif |
07be1b83 YO |
577 | |
578 | #if PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS | |
579 | #define EXPERIMENTAL_INPLACESCAN | |
7122b237 | 580 | #endif /*RE_TRACK_PATTERN_OFFSETS*/ |
07be1b83 | 581 | |
304ee84b YO |
582 | #define DEBUG_STUDYDATA(str,data,depth) \ |
583 | DEBUG_OPTIMISE_MORE_r(if(data){ \ | |
1de06328 | 584 | PerlIO_printf(Perl_debug_log, \ |
304ee84b YO |
585 | "%*s" str "Pos:%"IVdf"/%"IVdf \ |
586 | " Flags: 0x%"UVXf" Whilem_c: %"IVdf" Lcp: %"IVdf" %s", \ | |
1de06328 YO |
587 | (int)(depth)*2, "", \ |
588 | (IV)((data)->pos_min), \ | |
589 | (IV)((data)->pos_delta), \ | |
304ee84b | 590 | (UV)((data)->flags), \ |
1de06328 | 591 | (IV)((data)->whilem_c), \ |
304ee84b YO |
592 | (IV)((data)->last_closep ? *((data)->last_closep) : -1), \ |
593 | is_inf ? "INF " : "" \ | |
1de06328 YO |
594 | ); \ |
595 | if ((data)->last_found) \ | |
596 | PerlIO_printf(Perl_debug_log, \ | |
597 | "Last:'%s' %"IVdf":%"IVdf"/%"IVdf" %sFixed:'%s' @ %"IVdf \ | |
598 | " %sFloat: '%s' @ %"IVdf"/%"IVdf"", \ | |
599 | SvPVX_const((data)->last_found), \ | |
600 | (IV)((data)->last_end), \ | |
601 | (IV)((data)->last_start_min), \ | |
602 | (IV)((data)->last_start_max), \ | |
603 | ((data)->longest && \ | |
604 | (data)->longest==&((data)->longest_fixed)) ? "*" : "", \ | |
605 | SvPVX_const((data)->longest_fixed), \ | |
606 | (IV)((data)->offset_fixed), \ | |
607 | ((data)->longest && \ | |
608 | (data)->longest==&((data)->longest_float)) ? "*" : "", \ | |
609 | SvPVX_const((data)->longest_float), \ | |
610 | (IV)((data)->offset_float_min), \ | |
611 | (IV)((data)->offset_float_max) \ | |
612 | ); \ | |
613 | PerlIO_printf(Perl_debug_log,"\n"); \ | |
614 | }); | |
615 | ||
acfe0abc | 616 | static void clear_re(pTHX_ void *r); |
4327152a | 617 | |
653099ff | 618 | /* Mark that we cannot extend a found fixed substring at this point. |
786e8c11 | 619 | Update the longest found anchored substring and the longest found |
653099ff GS |
620 | floating substrings if needed. */ |
621 | ||
4327152a | 622 | STATIC void |
304ee84b | 623 | S_scan_commit(pTHX_ const RExC_state_t *pRExC_state, scan_data_t *data, I32 *minlenp, int is_inf) |
c277df42 | 624 | { |
e1ec3a88 AL |
625 | const STRLEN l = CHR_SVLEN(data->last_found); |
626 | const STRLEN old_l = CHR_SVLEN(*data->longest); | |
1de06328 | 627 | GET_RE_DEBUG_FLAGS_DECL; |
b81d288d | 628 | |
c277df42 | 629 | if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) { |
6b43b216 | 630 | SvSetMagicSV(*data->longest, data->last_found); |
c277df42 IZ |
631 | if (*data->longest == data->longest_fixed) { |
632 | data->offset_fixed = l ? data->last_start_min : data->pos_min; | |
633 | if (data->flags & SF_BEFORE_EOL) | |
b81d288d | 634 | data->flags |
c277df42 IZ |
635 | |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL); |
636 | else | |
637 | data->flags &= ~SF_FIX_BEFORE_EOL; | |
1de06328 YO |
638 | data->minlen_fixed=minlenp; |
639 | data->lookbehind_fixed=0; | |
a0ed51b3 | 640 | } |
304ee84b | 641 | else { /* *data->longest == data->longest_float */ |
c277df42 | 642 | data->offset_float_min = l ? data->last_start_min : data->pos_min; |
b81d288d AB |
643 | data->offset_float_max = (l |
644 | ? data->last_start_max | |
c277df42 | 645 | : data->pos_min + data->pos_delta); |
304ee84b | 646 | if (is_inf || (U32)data->offset_float_max > (U32)I32_MAX) |
9051bda5 | 647 | data->offset_float_max = I32_MAX; |
c277df42 | 648 | if (data->flags & SF_BEFORE_EOL) |
b81d288d | 649 | data->flags |
c277df42 IZ |
650 | |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL); |
651 | else | |
652 | data->flags &= ~SF_FL_BEFORE_EOL; | |
1de06328 YO |
653 | data->minlen_float=minlenp; |
654 | data->lookbehind_float=0; | |
c277df42 IZ |
655 | } |
656 | } | |
657 | SvCUR_set(data->last_found, 0); | |
0eda9292 | 658 | { |
a28509cc | 659 | SV * const sv = data->last_found; |
097eb12c AL |
660 | if (SvUTF8(sv) && SvMAGICAL(sv)) { |
661 | MAGIC * const mg = mg_find(sv, PERL_MAGIC_utf8); | |
662 | if (mg) | |
663 | mg->mg_len = 0; | |
664 | } | |
0eda9292 | 665 | } |
c277df42 IZ |
666 | data->last_end = -1; |
667 | data->flags &= ~SF_BEFORE_EOL; | |
bcdf7404 | 668 | DEBUG_STUDYDATA("commit: ",data,0); |
c277df42 IZ |
669 | } |
670 | ||
653099ff GS |
671 | /* Can match anything (initialization) */ |
672 | STATIC void | |
097eb12c | 673 | S_cl_anything(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl) |
653099ff | 674 | { |
653099ff | 675 | ANYOF_CLASS_ZERO(cl); |
f8bef550 | 676 | ANYOF_BITMAP_SETALL(cl); |
1aa99e6b | 677 | cl->flags = ANYOF_EOS|ANYOF_UNICODE_ALL; |
653099ff GS |
678 | if (LOC) |
679 | cl->flags |= ANYOF_LOCALE; | |
680 | } | |
681 | ||
682 | /* Can match anything (initialization) */ | |
683 | STATIC int | |
5f66b61c | 684 | S_cl_is_anything(const struct regnode_charclass_class *cl) |
653099ff GS |
685 | { |
686 | int value; | |
687 | ||
aaa51d5e | 688 | for (value = 0; value <= ANYOF_MAX; value += 2) |
653099ff GS |
689 | if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1)) |
690 | return 1; | |
1aa99e6b IH |
691 | if (!(cl->flags & ANYOF_UNICODE_ALL)) |
692 | return 0; | |
10edeb5d | 693 | if (!ANYOF_BITMAP_TESTALLSET((const void*)cl)) |
f8bef550 | 694 | return 0; |
653099ff GS |
695 | return 1; |
696 | } | |
697 | ||
698 | /* Can match anything (initialization) */ | |
699 | STATIC void | |
097eb12c | 700 | S_cl_init(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl) |
653099ff | 701 | { |
8ecf7187 | 702 | Zero(cl, 1, struct regnode_charclass_class); |
653099ff | 703 | cl->type = ANYOF; |
830247a4 | 704 | cl_anything(pRExC_state, cl); |
653099ff GS |
705 | } |
706 | ||
707 | STATIC void | |
097eb12c | 708 | S_cl_init_zero(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl) |
653099ff | 709 | { |
8ecf7187 | 710 | Zero(cl, 1, struct regnode_charclass_class); |
653099ff | 711 | cl->type = ANYOF; |
830247a4 | 712 | cl_anything(pRExC_state, cl); |
653099ff GS |
713 | if (LOC) |
714 | cl->flags |= ANYOF_LOCALE; | |
715 | } | |
716 | ||
717 | /* 'And' a given class with another one. Can create false positives */ | |
718 | /* We assume that cl is not inverted */ | |
719 | STATIC void | |
5f66b61c | 720 | S_cl_and(struct regnode_charclass_class *cl, |
a28509cc | 721 | const struct regnode_charclass_class *and_with) |
653099ff | 722 | { |
40d049e4 YO |
723 | |
724 | assert(and_with->type == ANYOF); | |
653099ff GS |
725 | if (!(and_with->flags & ANYOF_CLASS) |
726 | && !(cl->flags & ANYOF_CLASS) | |
727 | && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
728 | && !(and_with->flags & ANYOF_FOLD) | |
729 | && !(cl->flags & ANYOF_FOLD)) { | |
730 | int i; | |
731 | ||
732 | if (and_with->flags & ANYOF_INVERT) | |
733 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
734 | cl->bitmap[i] &= ~and_with->bitmap[i]; | |
735 | else | |
736 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
737 | cl->bitmap[i] &= and_with->bitmap[i]; | |
738 | } /* XXXX: logic is complicated otherwise, leave it along for a moment. */ | |
739 | if (!(and_with->flags & ANYOF_EOS)) | |
740 | cl->flags &= ~ANYOF_EOS; | |
1aa99e6b | 741 | |
14ebb1a2 JH |
742 | if (cl->flags & ANYOF_UNICODE_ALL && and_with->flags & ANYOF_UNICODE && |
743 | !(and_with->flags & ANYOF_INVERT)) { | |
1aa99e6b IH |
744 | cl->flags &= ~ANYOF_UNICODE_ALL; |
745 | cl->flags |= ANYOF_UNICODE; | |
746 | ARG_SET(cl, ARG(and_with)); | |
747 | } | |
14ebb1a2 JH |
748 | if (!(and_with->flags & ANYOF_UNICODE_ALL) && |
749 | !(and_with->flags & ANYOF_INVERT)) | |
1aa99e6b | 750 | cl->flags &= ~ANYOF_UNICODE_ALL; |
14ebb1a2 JH |
751 | if (!(and_with->flags & (ANYOF_UNICODE|ANYOF_UNICODE_ALL)) && |
752 | !(and_with->flags & ANYOF_INVERT)) | |
1aa99e6b | 753 | cl->flags &= ~ANYOF_UNICODE; |
653099ff GS |
754 | } |
755 | ||
756 | /* 'OR' a given class with another one. Can create false positives */ | |
757 | /* We assume that cl is not inverted */ | |
758 | STATIC void | |
097eb12c | 759 | S_cl_or(const RExC_state_t *pRExC_state, struct regnode_charclass_class *cl, const struct regnode_charclass_class *or_with) |
653099ff | 760 | { |
653099ff GS |
761 | if (or_with->flags & ANYOF_INVERT) { |
762 | /* We do not use | |
763 | * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2)) | |
764 | * <= (B1 | !B2) | (CL1 | !CL2) | |
765 | * which is wasteful if CL2 is small, but we ignore CL2: | |
766 | * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1 | |
767 | * XXXX Can we handle case-fold? Unclear: | |
768 | * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) = | |
769 | * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i')) | |
770 | */ | |
771 | if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
772 | && !(or_with->flags & ANYOF_FOLD) | |
773 | && !(cl->flags & ANYOF_FOLD) ) { | |
774 | int i; | |
775 | ||
776 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
777 | cl->bitmap[i] |= ~or_with->bitmap[i]; | |
778 | } /* XXXX: logic is complicated otherwise */ | |
779 | else { | |
830247a4 | 780 | cl_anything(pRExC_state, cl); |
653099ff GS |
781 | } |
782 | } else { | |
783 | /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */ | |
784 | if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
b81d288d | 785 | && (!(or_with->flags & ANYOF_FOLD) |
653099ff GS |
786 | || (cl->flags & ANYOF_FOLD)) ) { |
787 | int i; | |
788 | ||
789 | /* OR char bitmap and class bitmap separately */ | |
790 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
791 | cl->bitmap[i] |= or_with->bitmap[i]; | |
792 | if (or_with->flags & ANYOF_CLASS) { | |
793 | for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++) | |
794 | cl->classflags[i] |= or_with->classflags[i]; | |
795 | cl->flags |= ANYOF_CLASS; | |
796 | } | |
797 | } | |
798 | else { /* XXXX: logic is complicated, leave it along for a moment. */ | |
830247a4 | 799 | cl_anything(pRExC_state, cl); |
653099ff GS |
800 | } |
801 | } | |
802 | if (or_with->flags & ANYOF_EOS) | |
803 | cl->flags |= ANYOF_EOS; | |
1aa99e6b IH |
804 | |
805 | if (cl->flags & ANYOF_UNICODE && or_with->flags & ANYOF_UNICODE && | |
806 | ARG(cl) != ARG(or_with)) { | |
807 | cl->flags |= ANYOF_UNICODE_ALL; | |
808 | cl->flags &= ~ANYOF_UNICODE; | |
809 | } | |
810 | if (or_with->flags & ANYOF_UNICODE_ALL) { | |
811 | cl->flags |= ANYOF_UNICODE_ALL; | |
812 | cl->flags &= ~ANYOF_UNICODE; | |
813 | } | |
653099ff GS |
814 | } |
815 | ||
a3621e74 YO |
816 | #define TRIE_LIST_ITEM(state,idx) (trie->states[state].trans.list)[ idx ] |
817 | #define TRIE_LIST_CUR(state) ( TRIE_LIST_ITEM( state, 0 ).forid ) | |
818 | #define TRIE_LIST_LEN(state) ( TRIE_LIST_ITEM( state, 0 ).newstate ) | |
819 | #define TRIE_LIST_USED(idx) ( trie->states[state].trans.list ? (TRIE_LIST_CUR( idx ) - 1) : 0 ) | |
820 | ||
3dab1dad YO |
821 | |
822 | #ifdef DEBUGGING | |
07be1b83 | 823 | /* |
2b8b4781 NC |
824 | dump_trie(trie,widecharmap,revcharmap) |
825 | dump_trie_interim_list(trie,widecharmap,revcharmap,next_alloc) | |
826 | dump_trie_interim_table(trie,widecharmap,revcharmap,next_alloc) | |
3dab1dad YO |
827 | |
828 | These routines dump out a trie in a somewhat readable format. | |
07be1b83 YO |
829 | The _interim_ variants are used for debugging the interim |
830 | tables that are used to generate the final compressed | |
831 | representation which is what dump_trie expects. | |
832 | ||
3dab1dad YO |
833 | Part of the reason for their existance is to provide a form |
834 | of documentation as to how the different representations function. | |
07be1b83 YO |
835 | |
836 | */ | |
3dab1dad YO |
837 | |
838 | /* | |
3dab1dad YO |
839 | Dumps the final compressed table form of the trie to Perl_debug_log. |
840 | Used for debugging make_trie(). | |
841 | */ | |
842 | ||
843 | STATIC void | |
2b8b4781 NC |
844 | S_dump_trie(pTHX_ const struct _reg_trie_data *trie, HV *widecharmap, |
845 | AV *revcharmap, U32 depth) | |
3dab1dad YO |
846 | { |
847 | U32 state; | |
ab3bbdeb | 848 | SV *sv=sv_newmortal(); |
55eed653 | 849 | int colwidth= widecharmap ? 6 : 4; |
3dab1dad YO |
850 | GET_RE_DEBUG_FLAGS_DECL; |
851 | ||
ab3bbdeb | 852 | |
3dab1dad YO |
853 | PerlIO_printf( Perl_debug_log, "%*sChar : %-6s%-6s%-4s ", |
854 | (int)depth * 2 + 2,"", | |
855 | "Match","Base","Ofs" ); | |
856 | ||
857 | for( state = 0 ; state < trie->uniquecharcount ; state++ ) { | |
2b8b4781 | 858 | SV ** const tmp = av_fetch( revcharmap, state, 0); |
3dab1dad | 859 | if ( tmp ) { |
ab3bbdeb YO |
860 | PerlIO_printf( Perl_debug_log, "%*s", |
861 | colwidth, | |
ddc5bc0f | 862 | pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth, |
ab3bbdeb YO |
863 | PL_colors[0], PL_colors[1], |
864 | (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) | | |
865 | PERL_PV_ESCAPE_FIRSTCHAR | |
866 | ) | |
867 | ); | |
3dab1dad YO |
868 | } |
869 | } | |
870 | PerlIO_printf( Perl_debug_log, "\n%*sState|-----------------------", | |
871 | (int)depth * 2 + 2,""); | |
872 | ||
873 | for( state = 0 ; state < trie->uniquecharcount ; state++ ) | |
ab3bbdeb | 874 | PerlIO_printf( Perl_debug_log, "%.*s", colwidth, "--------"); |
3dab1dad YO |
875 | PerlIO_printf( Perl_debug_log, "\n"); |
876 | ||
1e2e3d02 | 877 | for( state = 1 ; state < trie->statecount ; state++ ) { |
be8e71aa | 878 | const U32 base = trie->states[ state ].trans.base; |
3dab1dad YO |
879 | |
880 | PerlIO_printf( Perl_debug_log, "%*s#%4"UVXf"|", (int)depth * 2 + 2,"", (UV)state); | |
881 | ||
882 | if ( trie->states[ state ].wordnum ) { | |
883 | PerlIO_printf( Perl_debug_log, " W%4X", trie->states[ state ].wordnum ); | |
884 | } else { | |
885 | PerlIO_printf( Perl_debug_log, "%6s", "" ); | |
886 | } | |
887 | ||
888 | PerlIO_printf( Perl_debug_log, " @%4"UVXf" ", (UV)base ); | |
889 | ||
890 | if ( base ) { | |
891 | U32 ofs = 0; | |
892 | ||
893 | while( ( base + ofs < trie->uniquecharcount ) || | |
894 | ( base + ofs - trie->uniquecharcount < trie->lasttrans | |
895 | && trie->trans[ base + ofs - trie->uniquecharcount ].check != state)) | |
896 | ofs++; | |
897 | ||
898 | PerlIO_printf( Perl_debug_log, "+%2"UVXf"[ ", (UV)ofs); | |
899 | ||
900 | for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) { | |
901 | if ( ( base + ofs >= trie->uniquecharcount ) && | |
902 | ( base + ofs - trie->uniquecharcount < trie->lasttrans ) && | |
903 | trie->trans[ base + ofs - trie->uniquecharcount ].check == state ) | |
904 | { | |
ab3bbdeb YO |
905 | PerlIO_printf( Perl_debug_log, "%*"UVXf, |
906 | colwidth, | |
3dab1dad YO |
907 | (UV)trie->trans[ base + ofs - trie->uniquecharcount ].next ); |
908 | } else { | |
ab3bbdeb | 909 | PerlIO_printf( Perl_debug_log, "%*s",colwidth," ." ); |
3dab1dad YO |
910 | } |
911 | } | |
912 | ||
913 | PerlIO_printf( Perl_debug_log, "]"); | |
914 | ||
915 | } | |
916 | PerlIO_printf( Perl_debug_log, "\n" ); | |
917 | } | |
918 | } | |
919 | /* | |
3dab1dad YO |
920 | Dumps a fully constructed but uncompressed trie in list form. |
921 | List tries normally only are used for construction when the number of | |
922 | possible chars (trie->uniquecharcount) is very high. | |
923 | Used for debugging make_trie(). | |
924 | */ | |
925 | STATIC void | |
55eed653 | 926 | S_dump_trie_interim_list(pTHX_ const struct _reg_trie_data *trie, |
2b8b4781 NC |
927 | HV *widecharmap, AV *revcharmap, U32 next_alloc, |
928 | U32 depth) | |
3dab1dad YO |
929 | { |
930 | U32 state; | |
ab3bbdeb | 931 | SV *sv=sv_newmortal(); |
55eed653 | 932 | int colwidth= widecharmap ? 6 : 4; |
3dab1dad YO |
933 | GET_RE_DEBUG_FLAGS_DECL; |
934 | /* print out the table precompression. */ | |
ab3bbdeb YO |
935 | PerlIO_printf( Perl_debug_log, "%*sState :Word | Transition Data\n%*s%s", |
936 | (int)depth * 2 + 2,"", (int)depth * 2 + 2,"", | |
937 | "------:-----+-----------------\n" ); | |
3dab1dad YO |
938 | |
939 | for( state=1 ; state < next_alloc ; state ++ ) { | |
940 | U16 charid; | |
941 | ||
ab3bbdeb | 942 | PerlIO_printf( Perl_debug_log, "%*s %4"UVXf" :", |
3dab1dad YO |
943 | (int)depth * 2 + 2,"", (UV)state ); |
944 | if ( ! trie->states[ state ].wordnum ) { | |
945 | PerlIO_printf( Perl_debug_log, "%5s| ",""); | |
946 | } else { | |
947 | PerlIO_printf( Perl_debug_log, "W%4x| ", | |
948 | trie->states[ state ].wordnum | |
949 | ); | |
950 | } | |
951 | for( charid = 1 ; charid <= TRIE_LIST_USED( state ) ; charid++ ) { | |
2b8b4781 | 952 | SV ** const tmp = av_fetch( revcharmap, TRIE_LIST_ITEM(state,charid).forid, 0); |
ab3bbdeb YO |
953 | if ( tmp ) { |
954 | PerlIO_printf( Perl_debug_log, "%*s:%3X=%4"UVXf" | ", | |
955 | colwidth, | |
ddc5bc0f | 956 | pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth, |
ab3bbdeb YO |
957 | PL_colors[0], PL_colors[1], |
958 | (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) | | |
959 | PERL_PV_ESCAPE_FIRSTCHAR | |
960 | ) , | |
1e2e3d02 YO |
961 | TRIE_LIST_ITEM(state,charid).forid, |
962 | (UV)TRIE_LIST_ITEM(state,charid).newstate | |
963 | ); | |
964 | if (!(charid % 10)) | |
664e119d RGS |
965 | PerlIO_printf(Perl_debug_log, "\n%*s| ", |
966 | (int)((depth * 2) + 14), ""); | |
1e2e3d02 | 967 | } |
ab3bbdeb YO |
968 | } |
969 | PerlIO_printf( Perl_debug_log, "\n"); | |
3dab1dad YO |
970 | } |
971 | } | |
972 | ||
973 | /* | |
3dab1dad YO |
974 | Dumps a fully constructed but uncompressed trie in table form. |
975 | This is the normal DFA style state transition table, with a few | |
976 | twists to facilitate compression later. | |
977 | Used for debugging make_trie(). | |
978 | */ | |
979 | STATIC void | |
55eed653 | 980 | S_dump_trie_interim_table(pTHX_ const struct _reg_trie_data *trie, |
2b8b4781 NC |
981 | HV *widecharmap, AV *revcharmap, U32 next_alloc, |
982 | U32 depth) | |
3dab1dad YO |
983 | { |
984 | U32 state; | |
985 | U16 charid; | |
ab3bbdeb | 986 | SV *sv=sv_newmortal(); |
55eed653 | 987 | int colwidth= widecharmap ? 6 : 4; |
3dab1dad YO |
988 | GET_RE_DEBUG_FLAGS_DECL; |
989 | ||
990 | /* | |
991 | print out the table precompression so that we can do a visual check | |
992 | that they are identical. | |
993 | */ | |
994 | ||
995 | PerlIO_printf( Perl_debug_log, "%*sChar : ",(int)depth * 2 + 2,"" ); | |
996 | ||
997 | for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) { | |
2b8b4781 | 998 | SV ** const tmp = av_fetch( revcharmap, charid, 0); |
3dab1dad | 999 | if ( tmp ) { |
ab3bbdeb YO |
1000 | PerlIO_printf( Perl_debug_log, "%*s", |
1001 | colwidth, | |
ddc5bc0f | 1002 | pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), colwidth, |
ab3bbdeb YO |
1003 | PL_colors[0], PL_colors[1], |
1004 | (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) | | |
1005 | PERL_PV_ESCAPE_FIRSTCHAR | |
1006 | ) | |
1007 | ); | |
3dab1dad YO |
1008 | } |
1009 | } | |
1010 | ||
1011 | PerlIO_printf( Perl_debug_log, "\n%*sState+-",(int)depth * 2 + 2,"" ); | |
1012 | ||
1013 | for( charid=0 ; charid < trie->uniquecharcount ; charid++ ) { | |
ab3bbdeb | 1014 | PerlIO_printf( Perl_debug_log, "%.*s", colwidth,"--------"); |
3dab1dad YO |
1015 | } |
1016 | ||
1017 | PerlIO_printf( Perl_debug_log, "\n" ); | |
1018 | ||
1019 | for( state=1 ; state < next_alloc ; state += trie->uniquecharcount ) { | |
1020 | ||
1021 | PerlIO_printf( Perl_debug_log, "%*s%4"UVXf" : ", | |
1022 | (int)depth * 2 + 2,"", | |
1023 | (UV)TRIE_NODENUM( state ) ); | |
1024 | ||
1025 | for( charid = 0 ; charid < trie->uniquecharcount ; charid++ ) { | |
ab3bbdeb YO |
1026 | UV v=(UV)SAFE_TRIE_NODENUM( trie->trans[ state + charid ].next ); |
1027 | if (v) | |
1028 | PerlIO_printf( Perl_debug_log, "%*"UVXf, colwidth, v ); | |
1029 | else | |
1030 | PerlIO_printf( Perl_debug_log, "%*s", colwidth, "." ); | |
3dab1dad YO |
1031 | } |
1032 | if ( ! trie->states[ TRIE_NODENUM( state ) ].wordnum ) { | |
1033 | PerlIO_printf( Perl_debug_log, " (%4"UVXf")\n", (UV)trie->trans[ state ].check ); | |
1034 | } else { | |
1035 | PerlIO_printf( Perl_debug_log, " (%4"UVXf") W%4X\n", (UV)trie->trans[ state ].check, | |
1036 | trie->states[ TRIE_NODENUM( state ) ].wordnum ); | |
1037 | } | |
1038 | } | |
07be1b83 | 1039 | } |
3dab1dad YO |
1040 | |
1041 | #endif | |
1042 | ||
786e8c11 YO |
1043 | /* make_trie(startbranch,first,last,tail,word_count,flags,depth) |
1044 | startbranch: the first branch in the whole branch sequence | |
1045 | first : start branch of sequence of branch-exact nodes. | |
1046 | May be the same as startbranch | |
1047 | last : Thing following the last branch. | |
1048 | May be the same as tail. | |
1049 | tail : item following the branch sequence | |
1050 | count : words in the sequence | |
1051 | flags : currently the OP() type we will be building one of /EXACT(|F|Fl)/ | |
1052 | depth : indent depth | |
3dab1dad | 1053 | |
786e8c11 | 1054 | Inplace optimizes a sequence of 2 or more Branch-Exact nodes into a TRIE node. |
07be1b83 | 1055 | |
786e8c11 YO |
1056 | A trie is an N'ary tree where the branches are determined by digital |
1057 | decomposition of the key. IE, at the root node you look up the 1st character and | |
1058 | follow that branch repeat until you find the end of the branches. Nodes can be | |
1059 | marked as "accepting" meaning they represent a complete word. Eg: | |
07be1b83 | 1060 | |
786e8c11 | 1061 | /he|she|his|hers/ |
72f13be8 | 1062 | |
786e8c11 YO |
1063 | would convert into the following structure. Numbers represent states, letters |
1064 | following numbers represent valid transitions on the letter from that state, if | |
1065 | the number is in square brackets it represents an accepting state, otherwise it | |
1066 | will be in parenthesis. | |
07be1b83 | 1067 | |
786e8c11 YO |
1068 | +-h->+-e->[3]-+-r->(8)-+-s->[9] |
1069 | | | | |
1070 | | (2) | |
1071 | | | | |
1072 | (1) +-i->(6)-+-s->[7] | |
1073 | | | |
1074 | +-s->(3)-+-h->(4)-+-e->[5] | |
07be1b83 | 1075 | |
786e8c11 YO |
1076 | Accept Word Mapping: 3=>1 (he),5=>2 (she), 7=>3 (his), 9=>4 (hers) |
1077 | ||
1078 | This shows that when matching against the string 'hers' we will begin at state 1 | |
1079 | read 'h' and move to state 2, read 'e' and move to state 3 which is accepting, | |
1080 | then read 'r' and go to state 8 followed by 's' which takes us to state 9 which | |
1081 | is also accepting. Thus we know that we can match both 'he' and 'hers' with a | |
1082 | single traverse. We store a mapping from accepting to state to which word was | |
1083 | matched, and then when we have multiple possibilities we try to complete the | |
1084 | rest of the regex in the order in which they occured in the alternation. | |
1085 | ||
1086 | The only prior NFA like behaviour that would be changed by the TRIE support is | |
1087 | the silent ignoring of duplicate alternations which are of the form: | |
1088 | ||
1089 | / (DUPE|DUPE) X? (?{ ... }) Y /x | |
1090 | ||
1091 | Thus EVAL blocks follwing a trie may be called a different number of times with | |
1092 | and without the optimisation. With the optimisations dupes will be silently | |
1093 | ignored. This inconsistant behaviour of EVAL type nodes is well established as | |
1094 | the following demonstrates: | |
1095 | ||
1096 | 'words'=~/(word|word|word)(?{ print $1 })[xyz]/ | |
1097 | ||
1098 | which prints out 'word' three times, but | |
1099 | ||
1100 | 'words'=~/(word|word|word)(?{ print $1 })S/ | |
1101 | ||
1102 | which doesnt print it out at all. This is due to other optimisations kicking in. | |
1103 | ||
1104 | Example of what happens on a structural level: | |
1105 | ||
1106 | The regexp /(ac|ad|ab)+/ will produce the folowing debug output: | |
1107 | ||
1108 | 1: CURLYM[1] {1,32767}(18) | |
1109 | 5: BRANCH(8) | |
1110 | 6: EXACT <ac>(16) | |
1111 | 8: BRANCH(11) | |
1112 | 9: EXACT <ad>(16) | |
1113 | 11: BRANCH(14) | |
1114 | 12: EXACT <ab>(16) | |
1115 | 16: SUCCEED(0) | |
1116 | 17: NOTHING(18) | |
1117 | 18: END(0) | |
1118 | ||
1119 | This would be optimizable with startbranch=5, first=5, last=16, tail=16 | |
1120 | and should turn into: | |
1121 | ||
1122 | 1: CURLYM[1] {1,32767}(18) | |
1123 | 5: TRIE(16) | |
1124 | [Words:3 Chars Stored:6 Unique Chars:4 States:5 NCP:1] | |
1125 | <ac> | |
1126 | <ad> | |
1127 | <ab> | |
1128 | 16: SUCCEED(0) | |
1129 | 17: NOTHING(18) | |
1130 | 18: END(0) | |
1131 | ||
1132 | Cases where tail != last would be like /(?foo|bar)baz/: | |
1133 | ||
1134 | 1: BRANCH(4) | |
1135 | 2: EXACT <foo>(8) | |
1136 | 4: BRANCH(7) | |
1137 | 5: EXACT <bar>(8) | |
1138 | 7: TAIL(8) | |
1139 | 8: EXACT <baz>(10) | |
1140 | 10: END(0) | |
1141 | ||
1142 | which would be optimizable with startbranch=1, first=1, last=7, tail=8 | |
1143 | and would end up looking like: | |
1144 | ||
1145 | 1: TRIE(8) | |
1146 | [Words:2 Chars Stored:6 Unique Chars:5 States:7 NCP:1] | |
1147 | <foo> | |
1148 | <bar> | |
1149 | 7: TAIL(8) | |
1150 | 8: EXACT <baz>(10) | |
1151 | 10: END(0) | |
1152 | ||
1153 | d = uvuni_to_utf8_flags(d, uv, 0); | |
1154 | ||
1155 | is the recommended Unicode-aware way of saying | |
1156 | ||
1157 | *(d++) = uv; | |
1158 | */ | |
1159 | ||
1e2e3d02 | 1160 | #define TRIE_STORE_REVCHAR \ |
786e8c11 | 1161 | STMT_START { \ |
1e2e3d02 | 1162 | SV *tmp = newSVpvs(""); \ |
786e8c11 | 1163 | if (UTF) SvUTF8_on(tmp); \ |
1e2e3d02 | 1164 | Perl_sv_catpvf( aTHX_ tmp, "%c", (int)uvc ); \ |
2b8b4781 | 1165 | av_push( revcharmap, tmp ); \ |
786e8c11 YO |
1166 | } STMT_END |
1167 | ||
1168 | #define TRIE_READ_CHAR STMT_START { \ | |
1169 | wordlen++; \ | |
1170 | if ( UTF ) { \ | |
1171 | if ( folder ) { \ | |
1172 | if ( foldlen > 0 ) { \ | |
1173 | uvc = utf8n_to_uvuni( scan, UTF8_MAXLEN, &len, uniflags ); \ | |
1174 | foldlen -= len; \ | |
1175 | scan += len; \ | |
1176 | len = 0; \ | |
1177 | } else { \ | |
1178 | uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\ | |
1179 | uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \ | |
1180 | foldlen -= UNISKIP( uvc ); \ | |
1181 | scan = foldbuf + UNISKIP( uvc ); \ | |
1182 | } \ | |
1183 | } else { \ | |
1184 | uvc = utf8n_to_uvuni( (const U8*)uc, UTF8_MAXLEN, &len, uniflags);\ | |
1185 | } \ | |
1186 | } else { \ | |
1187 | uvc = (U32)*uc; \ | |
1188 | len = 1; \ | |
1189 | } \ | |
1190 | } STMT_END | |
1191 | ||
1192 | ||
1193 | ||
1194 | #define TRIE_LIST_PUSH(state,fid,ns) STMT_START { \ | |
1195 | if ( TRIE_LIST_CUR( state ) >=TRIE_LIST_LEN( state ) ) { \ | |
f9003953 NC |
1196 | U32 ging = TRIE_LIST_LEN( state ) *= 2; \ |
1197 | Renew( trie->states[ state ].trans.list, ging, reg_trie_trans_le ); \ | |
786e8c11 YO |
1198 | } \ |
1199 | TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).forid = fid; \ | |
1200 | TRIE_LIST_ITEM( state, TRIE_LIST_CUR( state ) ).newstate = ns; \ | |
1201 | TRIE_LIST_CUR( state )++; \ | |
1202 | } STMT_END | |
07be1b83 | 1203 | |
786e8c11 YO |
1204 | #define TRIE_LIST_NEW(state) STMT_START { \ |
1205 | Newxz( trie->states[ state ].trans.list, \ | |
1206 | 4, reg_trie_trans_le ); \ | |
1207 | TRIE_LIST_CUR( state ) = 1; \ | |
1208 | TRIE_LIST_LEN( state ) = 4; \ | |
1209 | } STMT_END | |
07be1b83 | 1210 | |
786e8c11 YO |
1211 | #define TRIE_HANDLE_WORD(state) STMT_START { \ |
1212 | U16 dupe= trie->states[ state ].wordnum; \ | |
1213 | regnode * const noper_next = regnext( noper ); \ | |
1214 | \ | |
1215 | if (trie->wordlen) \ | |
1216 | trie->wordlen[ curword ] = wordlen; \ | |
1217 | DEBUG_r({ \ | |
1218 | /* store the word for dumping */ \ | |
1219 | SV* tmp; \ | |
1220 | if (OP(noper) != NOTHING) \ | |
1221 | tmp = newSVpvn(STRING(noper), STR_LEN(noper)); \ | |
1222 | else \ | |
1223 | tmp = newSVpvn( "", 0 ); \ | |
1224 | if ( UTF ) SvUTF8_on( tmp ); \ | |
2b8b4781 | 1225 | av_push( trie_words, tmp ); \ |
786e8c11 YO |
1226 | }); \ |
1227 | \ | |
1228 | curword++; \ | |
1229 | \ | |
1230 | if ( noper_next < tail ) { \ | |
1231 | if (!trie->jump) \ | |
c944940b | 1232 | trie->jump = (U16 *) PerlMemShared_calloc( word_count + 1, sizeof(U16) ); \ |
7f69552c | 1233 | trie->jump[curword] = (U16)(noper_next - convert); \ |
786e8c11 YO |
1234 | if (!jumper) \ |
1235 | jumper = noper_next; \ | |
1236 | if (!nextbranch) \ | |
1237 | nextbranch= regnext(cur); \ | |
1238 | } \ | |
1239 | \ | |
1240 | if ( dupe ) { \ | |
1241 | /* So it's a dupe. This means we need to maintain a */\ | |
1242 | /* linked-list from the first to the next. */\ | |
1243 | /* we only allocate the nextword buffer when there */\ | |
1244 | /* a dupe, so first time we have to do the allocation */\ | |
1245 | if (!trie->nextword) \ | |
c944940b | 1246 | trie->nextword = (U16 *) \ |
446bd890 | 1247 | PerlMemShared_calloc( word_count + 1, sizeof(U16)); \ |
786e8c11 YO |
1248 | while ( trie->nextword[dupe] ) \ |
1249 | dupe= trie->nextword[dupe]; \ | |
1250 | trie->nextword[dupe]= curword; \ | |
1251 | } else { \ | |
1252 | /* we haven't inserted this word yet. */ \ | |
1253 | trie->states[ state ].wordnum = curword; \ | |
1254 | } \ | |
1255 | } STMT_END | |
07be1b83 | 1256 | |
3dab1dad | 1257 | |
786e8c11 YO |
1258 | #define TRIE_TRANS_STATE(state,base,ucharcount,charid,special) \ |
1259 | ( ( base + charid >= ucharcount \ | |
1260 | && base + charid < ubound \ | |
1261 | && state == trie->trans[ base - ucharcount + charid ].check \ | |
1262 | && trie->trans[ base - ucharcount + charid ].next ) \ | |
1263 | ? trie->trans[ base - ucharcount + charid ].next \ | |
1264 | : ( state==1 ? special : 0 ) \ | |
1265 | ) | |
3dab1dad | 1266 | |
786e8c11 YO |
1267 | #define MADE_TRIE 1 |
1268 | #define MADE_JUMP_TRIE 2 | |
1269 | #define MADE_EXACT_TRIE 4 | |
3dab1dad | 1270 | |
a3621e74 | 1271 | STATIC I32 |
786e8c11 | 1272 | S_make_trie(pTHX_ RExC_state_t *pRExC_state, regnode *startbranch, regnode *first, regnode *last, regnode *tail, U32 word_count, U32 flags, U32 depth) |
a3621e74 | 1273 | { |
27da23d5 | 1274 | dVAR; |
a3621e74 YO |
1275 | /* first pass, loop through and scan words */ |
1276 | reg_trie_data *trie; | |
55eed653 | 1277 | HV *widecharmap = NULL; |
2b8b4781 | 1278 | AV *revcharmap = newAV(); |
a3621e74 | 1279 | regnode *cur; |
9f7f3913 | 1280 | const U32 uniflags = UTF8_ALLOW_DEFAULT; |
a3621e74 YO |
1281 | STRLEN len = 0; |
1282 | UV uvc = 0; | |
1283 | U16 curword = 0; | |
1284 | U32 next_alloc = 0; | |
786e8c11 YO |
1285 | regnode *jumper = NULL; |
1286 | regnode *nextbranch = NULL; | |
7f69552c | 1287 | regnode *convert = NULL; |
a3621e74 | 1288 | /* we just use folder as a flag in utf8 */ |
e1ec3a88 | 1289 | const U8 * const folder = ( flags == EXACTF |
a3621e74 YO |
1290 | ? PL_fold |
1291 | : ( flags == EXACTFL | |
1292 | ? PL_fold_locale | |
1293 | : NULL | |
1294 | ) | |
1295 | ); | |
1296 | ||
2b8b4781 NC |
1297 | #ifdef DEBUGGING |
1298 | const U32 data_slot = add_data( pRExC_state, 4, "tuuu" ); | |
1299 | AV *trie_words = NULL; | |
1300 | /* along with revcharmap, this only used during construction but both are | |
1301 | * useful during debugging so we store them in the struct when debugging. | |
8e11feef | 1302 | */ |
2b8b4781 NC |
1303 | #else |
1304 | const U32 data_slot = add_data( pRExC_state, 2, "tu" ); | |
3dab1dad | 1305 | STRLEN trie_charcount=0; |
3dab1dad | 1306 | #endif |
2b8b4781 | 1307 | SV *re_trie_maxbuff; |
a3621e74 | 1308 | GET_RE_DEBUG_FLAGS_DECL; |
72f13be8 YO |
1309 | #ifndef DEBUGGING |
1310 | PERL_UNUSED_ARG(depth); | |
1311 | #endif | |
a3621e74 | 1312 | |
c944940b | 1313 | trie = (reg_trie_data *) PerlMemShared_calloc( 1, sizeof(reg_trie_data) ); |
a3621e74 | 1314 | trie->refcount = 1; |
3dab1dad | 1315 | trie->startstate = 1; |
786e8c11 | 1316 | trie->wordcount = word_count; |
f8fc2ecf | 1317 | RExC_rxi->data->data[ data_slot ] = (void*)trie; |
c944940b | 1318 | trie->charmap = (U16 *) PerlMemShared_calloc( 256, sizeof(U16) ); |
3dab1dad | 1319 | if (!(UTF && folder)) |
c944940b | 1320 | trie->bitmap = (char *) PerlMemShared_calloc( ANYOF_BITMAP_SIZE, 1 ); |
a3621e74 | 1321 | DEBUG_r({ |
2b8b4781 | 1322 | trie_words = newAV(); |
a3621e74 | 1323 | }); |
a3621e74 | 1324 | |
0111c4fd | 1325 | re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1); |
a3621e74 | 1326 | if (!SvIOK(re_trie_maxbuff)) { |
0111c4fd | 1327 | sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT); |
a3621e74 | 1328 | } |
3dab1dad YO |
1329 | DEBUG_OPTIMISE_r({ |
1330 | PerlIO_printf( Perl_debug_log, | |
786e8c11 | 1331 | "%*smake_trie start==%d, first==%d, last==%d, tail==%d depth=%d\n", |
3dab1dad YO |
1332 | (int)depth * 2 + 2, "", |
1333 | REG_NODE_NUM(startbranch),REG_NODE_NUM(first), | |
786e8c11 | 1334 | REG_NODE_NUM(last), REG_NODE_NUM(tail), |
85c3142d | 1335 | (int)depth); |
3dab1dad | 1336 | }); |
7f69552c YO |
1337 | |
1338 | /* Find the node we are going to overwrite */ | |
1339 | if ( first == startbranch && OP( last ) != BRANCH ) { | |
1340 | /* whole branch chain */ | |
1341 | convert = first; | |
1342 | } else { | |
1343 | /* branch sub-chain */ | |
1344 | convert = NEXTOPER( first ); | |
1345 | } | |
1346 | ||
a3621e74 YO |
1347 | /* -- First loop and Setup -- |
1348 | ||
1349 | We first traverse the branches and scan each word to determine if it | |
1350 | contains widechars, and how many unique chars there are, this is | |
1351 | important as we have to build a table with at least as many columns as we | |
1352 | have unique chars. | |
1353 | ||
1354 | We use an array of integers to represent the character codes 0..255 | |
1355 | (trie->charmap) and we use a an HV* to store unicode characters. We use the | |
1356 | native representation of the character value as the key and IV's for the | |
1357 | coded index. | |
1358 | ||
1359 | *TODO* If we keep track of how many times each character is used we can | |
1360 | remap the columns so that the table compression later on is more | |
1361 | efficient in terms of memory by ensuring most common value is in the | |
1362 | middle and the least common are on the outside. IMO this would be better | |
1363 | than a most to least common mapping as theres a decent chance the most | |
1364 | common letter will share a node with the least common, meaning the node | |
1365 | will not be compressable. With a middle is most common approach the worst | |
1366 | case is when we have the least common nodes twice. | |
1367 | ||
1368 | */ | |
1369 | ||
a3621e74 | 1370 | for ( cur = first ; cur < last ; cur = regnext( cur ) ) { |
c445ea15 | 1371 | regnode * const noper = NEXTOPER( cur ); |
e1ec3a88 | 1372 | const U8 *uc = (U8*)STRING( noper ); |
a28509cc | 1373 | const U8 * const e = uc + STR_LEN( noper ); |
a3621e74 YO |
1374 | STRLEN foldlen = 0; |
1375 | U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ]; | |
2af232bd | 1376 | const U8 *scan = (U8*)NULL; |
07be1b83 | 1377 | U32 wordlen = 0; /* required init */ |
3dab1dad | 1378 | STRLEN chars=0; |
a3621e74 | 1379 | |
3dab1dad YO |
1380 | if (OP(noper) == NOTHING) { |
1381 | trie->minlen= 0; | |
1382 | continue; | |
1383 | } | |
1384 | if (trie->bitmap) { | |
1385 | TRIE_BITMAP_SET(trie,*uc); | |
1386 | if ( folder ) TRIE_BITMAP_SET(trie,folder[ *uc ]); | |
1387 | } | |
a3621e74 | 1388 | for ( ; uc < e ; uc += len ) { |
3dab1dad | 1389 | TRIE_CHARCOUNT(trie)++; |
a3621e74 | 1390 | TRIE_READ_CHAR; |
3dab1dad | 1391 | chars++; |
a3621e74 YO |
1392 | if ( uvc < 256 ) { |
1393 | if ( !trie->charmap[ uvc ] ) { | |
1394 | trie->charmap[ uvc ]=( ++trie->uniquecharcount ); | |
1395 | if ( folder ) | |
1396 | trie->charmap[ folder[ uvc ] ] = trie->charmap[ uvc ]; | |
3dab1dad | 1397 | TRIE_STORE_REVCHAR; |
a3621e74 YO |
1398 | } |
1399 | } else { | |
1400 | SV** svpp; | |
55eed653 NC |
1401 | if ( !widecharmap ) |
1402 | widecharmap = newHV(); | |
a3621e74 | 1403 | |
55eed653 | 1404 | svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 1 ); |
a3621e74 YO |
1405 | |
1406 | if ( !svpp ) | |
e4584336 | 1407 | Perl_croak( aTHX_ "error creating/fetching widecharmap entry for 0x%"UVXf, uvc ); |
a3621e74 YO |
1408 | |
1409 | if ( !SvTRUE( *svpp ) ) { | |
1410 | sv_setiv( *svpp, ++trie->uniquecharcount ); | |
3dab1dad | 1411 | TRIE_STORE_REVCHAR; |
a3621e74 YO |
1412 | } |
1413 | } | |
1414 | } | |
3dab1dad YO |
1415 | if( cur == first ) { |
1416 | trie->minlen=chars; | |
1417 | trie->maxlen=chars; | |
1418 | } else if (chars < trie->minlen) { | |
1419 | trie->minlen=chars; | |
1420 | } else if (chars > trie->maxlen) { | |
1421 | trie->maxlen=chars; | |
1422 | } | |
1423 | ||
a3621e74 YO |
1424 | } /* end first pass */ |
1425 | DEBUG_TRIE_COMPILE_r( | |
3dab1dad YO |
1426 | PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n", |
1427 | (int)depth * 2 + 2,"", | |
55eed653 | 1428 | ( widecharmap ? "UTF8" : "NATIVE" ), (int)word_count, |
be8e71aa YO |
1429 | (int)TRIE_CHARCOUNT(trie), trie->uniquecharcount, |
1430 | (int)trie->minlen, (int)trie->maxlen ) | |
a3621e74 | 1431 | ); |
c944940b | 1432 | trie->wordlen = (U32 *) PerlMemShared_calloc( word_count, sizeof(U32) ); |
a3621e74 YO |
1433 | |
1434 | /* | |
1435 | We now know what we are dealing with in terms of unique chars and | |
1436 | string sizes so we can calculate how much memory a naive | |
0111c4fd RGS |
1437 | representation using a flat table will take. If it's over a reasonable |
1438 | limit (as specified by ${^RE_TRIE_MAXBUF}) we use a more memory | |
a3621e74 YO |
1439 | conservative but potentially much slower representation using an array |
1440 | of lists. | |
1441 | ||
1442 | At the end we convert both representations into the same compressed | |
1443 | form that will be used in regexec.c for matching with. The latter | |
1444 | is a form that cannot be used to construct with but has memory | |
1445 | properties similar to the list form and access properties similar | |
1446 | to the table form making it both suitable for fast searches and | |
1447 | small enough that its feasable to store for the duration of a program. | |
1448 | ||
1449 | See the comment in the code where the compressed table is produced | |
1450 | inplace from the flat tabe representation for an explanation of how | |
1451 | the compression works. | |
1452 | ||
1453 | */ | |
1454 | ||
1455 | ||
3dab1dad | 1456 | if ( (IV)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1) > SvIV(re_trie_maxbuff) ) { |
a3621e74 YO |
1457 | /* |
1458 | Second Pass -- Array Of Lists Representation | |
1459 | ||
1460 | Each state will be represented by a list of charid:state records | |
1461 | (reg_trie_trans_le) the first such element holds the CUR and LEN | |
1462 | points of the allocated array. (See defines above). | |
1463 | ||
1464 | We build the initial structure using the lists, and then convert | |
1465 | it into the compressed table form which allows faster lookups | |
1466 | (but cant be modified once converted). | |
a3621e74 YO |
1467 | */ |
1468 | ||
a3621e74 YO |
1469 | STRLEN transcount = 1; |
1470 | ||
1e2e3d02 YO |
1471 | DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log, |
1472 | "%*sCompiling trie using list compiler\n", | |
1473 | (int)depth * 2 + 2, "")); | |
446bd890 | 1474 | |
c944940b JH |
1475 | trie->states = (reg_trie_state *) |
1476 | PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2, | |
1477 | sizeof(reg_trie_state) ); | |
a3621e74 YO |
1478 | TRIE_LIST_NEW(1); |
1479 | next_alloc = 2; | |
1480 | ||
1481 | for ( cur = first ; cur < last ; cur = regnext( cur ) ) { | |
1482 | ||
c445ea15 AL |
1483 | regnode * const noper = NEXTOPER( cur ); |
1484 | U8 *uc = (U8*)STRING( noper ); | |
1485 | const U8 * const e = uc + STR_LEN( noper ); | |
1486 | U32 state = 1; /* required init */ | |
1487 | U16 charid = 0; /* sanity init */ | |
1488 | U8 *scan = (U8*)NULL; /* sanity init */ | |
1489 | STRLEN foldlen = 0; /* required init */ | |
07be1b83 | 1490 | U32 wordlen = 0; /* required init */ |
c445ea15 AL |
1491 | U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ]; |
1492 | ||
3dab1dad | 1493 | if (OP(noper) != NOTHING) { |
786e8c11 | 1494 | for ( ; uc < e ; uc += len ) { |
c445ea15 | 1495 | |
786e8c11 | 1496 | TRIE_READ_CHAR; |
c445ea15 | 1497 | |
786e8c11 YO |
1498 | if ( uvc < 256 ) { |
1499 | charid = trie->charmap[ uvc ]; | |
c445ea15 | 1500 | } else { |
55eed653 | 1501 | SV** const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0); |
786e8c11 YO |
1502 | if ( !svpp ) { |
1503 | charid = 0; | |
1504 | } else { | |
1505 | charid=(U16)SvIV( *svpp ); | |
1506 | } | |
c445ea15 | 1507 | } |
786e8c11 YO |
1508 | /* charid is now 0 if we dont know the char read, or nonzero if we do */ |
1509 | if ( charid ) { | |
a3621e74 | 1510 | |
786e8c11 YO |
1511 | U16 check; |
1512 | U32 newstate = 0; | |
a3621e74 | 1513 | |
786e8c11 YO |
1514 | charid--; |
1515 | if ( !trie->states[ state ].trans.list ) { | |
1516 | TRIE_LIST_NEW( state ); | |
c445ea15 | 1517 | } |
786e8c11 YO |
1518 | for ( check = 1; check <= TRIE_LIST_USED( state ); check++ ) { |
1519 | if ( TRIE_LIST_ITEM( state, check ).forid == charid ) { | |
1520 | newstate = TRIE_LIST_ITEM( state, check ).newstate; | |
1521 | break; | |
1522 | } | |
1523 | } | |
1524 | if ( ! newstate ) { | |
1525 | newstate = next_alloc++; | |
1526 | TRIE_LIST_PUSH( state, charid, newstate ); | |
1527 | transcount++; | |
1528 | } | |
1529 | state = newstate; | |
1530 | } else { | |
1531 | Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc ); | |
c445ea15 | 1532 | } |
a28509cc | 1533 | } |
c445ea15 | 1534 | } |
3dab1dad | 1535 | TRIE_HANDLE_WORD(state); |
a3621e74 YO |
1536 | |
1537 | } /* end second pass */ | |
1538 | ||
1e2e3d02 YO |
1539 | /* next alloc is the NEXT state to be allocated */ |
1540 | trie->statecount = next_alloc; | |
c944940b JH |
1541 | trie->states = (reg_trie_state *) |
1542 | PerlMemShared_realloc( trie->states, | |
1543 | next_alloc | |
1544 | * sizeof(reg_trie_state) ); | |
a3621e74 | 1545 | |
3dab1dad | 1546 | /* and now dump it out before we compress it */ |
2b8b4781 NC |
1547 | DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_list(trie, widecharmap, |
1548 | revcharmap, next_alloc, | |
1549 | depth+1) | |
1e2e3d02 | 1550 | ); |
a3621e74 | 1551 | |
c944940b JH |
1552 | trie->trans = (reg_trie_trans *) |
1553 | PerlMemShared_calloc( transcount, sizeof(reg_trie_trans) ); | |
a3621e74 YO |
1554 | { |
1555 | U32 state; | |
a3621e74 YO |
1556 | U32 tp = 0; |
1557 | U32 zp = 0; | |
1558 | ||
1559 | ||
1560 | for( state=1 ; state < next_alloc ; state ++ ) { | |
1561 | U32 base=0; | |
1562 | ||
1563 | /* | |
1564 | DEBUG_TRIE_COMPILE_MORE_r( | |
1565 | PerlIO_printf( Perl_debug_log, "tp: %d zp: %d ",tp,zp) | |
1566 | ); | |
1567 | */ | |
1568 | ||
1569 | if (trie->states[state].trans.list) { | |
1570 | U16 minid=TRIE_LIST_ITEM( state, 1).forid; | |
1571 | U16 maxid=minid; | |
a28509cc | 1572 | U16 idx; |
a3621e74 YO |
1573 | |
1574 | for( idx = 2 ; idx <= TRIE_LIST_USED( state ) ; idx++ ) { | |
c445ea15 AL |
1575 | const U16 forid = TRIE_LIST_ITEM( state, idx).forid; |
1576 | if ( forid < minid ) { | |
1577 | minid=forid; | |
1578 | } else if ( forid > maxid ) { | |
1579 | maxid=forid; | |
1580 | } | |
a3621e74 YO |
1581 | } |
1582 | if ( transcount < tp + maxid - minid + 1) { | |
1583 | transcount *= 2; | |
c944940b JH |
1584 | trie->trans = (reg_trie_trans *) |
1585 | PerlMemShared_realloc( trie->trans, | |
446bd890 NC |
1586 | transcount |
1587 | * sizeof(reg_trie_trans) ); | |
a3621e74 YO |
1588 | Zero( trie->trans + (transcount / 2), transcount / 2 , reg_trie_trans ); |
1589 | } | |
1590 | base = trie->uniquecharcount + tp - minid; | |
1591 | if ( maxid == minid ) { | |
1592 | U32 set = 0; | |
1593 | for ( ; zp < tp ; zp++ ) { | |
1594 | if ( ! trie->trans[ zp ].next ) { | |
1595 | base = trie->uniquecharcount + zp - minid; | |
1596 | trie->trans[ zp ].next = TRIE_LIST_ITEM( state, 1).newstate; | |
1597 | trie->trans[ zp ].check = state; | |
1598 | set = 1; | |
1599 | break; | |
1600 | } | |
1601 | } | |
1602 | if ( !set ) { | |
1603 | trie->trans[ tp ].next = TRIE_LIST_ITEM( state, 1).newstate; | |
1604 | trie->trans[ tp ].check = state; | |
1605 | tp++; | |
1606 | zp = tp; | |
1607 | } | |
1608 | } else { | |
1609 | for ( idx=1; idx <= TRIE_LIST_USED( state ) ; idx++ ) { | |
c445ea15 | 1610 | const U32 tid = base - trie->uniquecharcount + TRIE_LIST_ITEM( state, idx ).forid; |
a3621e74 YO |
1611 | trie->trans[ tid ].next = TRIE_LIST_ITEM( state, idx ).newstate; |
1612 | trie->trans[ tid ].check = state; | |
1613 | } | |
1614 | tp += ( maxid - minid + 1 ); | |
1615 | } | |
1616 | Safefree(trie->states[ state ].trans.list); | |
1617 | } | |
1618 | /* | |
1619 | DEBUG_TRIE_COMPILE_MORE_r( | |
1620 | PerlIO_printf( Perl_debug_log, " base: %d\n",base); | |
1621 | ); | |
1622 | */ | |
1623 | trie->states[ state ].trans.base=base; | |
1624 | } | |
cc601c31 | 1625 | trie->lasttrans = tp + 1; |
a3621e74 YO |
1626 | } |
1627 | } else { | |
1628 | /* | |
1629 | Second Pass -- Flat Table Representation. | |
1630 | ||
1631 | we dont use the 0 slot of either trans[] or states[] so we add 1 to each. | |
1632 | We know that we will need Charcount+1 trans at most to store the data | |
1633 | (one row per char at worst case) So we preallocate both structures | |
1634 | assuming worst case. | |
1635 | ||
1636 | We then construct the trie using only the .next slots of the entry | |
1637 | structs. | |
1638 | ||
1639 | We use the .check field of the first entry of the node temporarily to | |
1640 | make compression both faster and easier by keeping track of how many non | |
1641 | zero fields are in the node. | |
1642 | ||
1643 | Since trans are numbered from 1 any 0 pointer in the table is a FAIL | |
1644 | transition. | |
1645 | ||
1646 | There are two terms at use here: state as a TRIE_NODEIDX() which is a | |
1647 | number representing the first entry of the node, and state as a | |
1648 | TRIE_NODENUM() which is the trans number. state 1 is TRIE_NODEIDX(1) and | |
1649 | TRIE_NODENUM(1), state 2 is TRIE_NODEIDX(2) and TRIE_NODENUM(3) if there | |
1650 | are 2 entrys per node. eg: | |
1651 | ||
1652 | A B A B | |
1653 | 1. 2 4 1. 3 7 | |
1654 | 2. 0 3 3. 0 5 | |
1655 | 3. 0 0 5. 0 0 | |
1656 | 4. 0 0 7. 0 0 | |
1657 | ||
1658 | The table is internally in the right hand, idx form. However as we also | |
1659 | have to deal with the states array which is indexed by nodenum we have to | |
1660 | use TRIE_NODENUM() to convert. | |
1661 | ||
1662 | */ | |
1e2e3d02 YO |
1663 | DEBUG_TRIE_COMPILE_MORE_r( PerlIO_printf( Perl_debug_log, |
1664 | "%*sCompiling trie using table compiler\n", | |
1665 | (int)depth * 2 + 2, "")); | |
3dab1dad | 1666 | |
c944940b JH |
1667 | trie->trans = (reg_trie_trans *) |
1668 | PerlMemShared_calloc( ( TRIE_CHARCOUNT(trie) + 1 ) | |
1669 | * trie->uniquecharcount + 1, | |
1670 | sizeof(reg_trie_trans) ); | |
1671 | trie->states = (reg_trie_state *) | |
1672 | PerlMemShared_calloc( TRIE_CHARCOUNT(trie) + 2, | |
1673 | sizeof(reg_trie_state) ); | |
a3621e74 YO |
1674 | next_alloc = trie->uniquecharcount + 1; |
1675 | ||
3dab1dad | 1676 | |
a3621e74 YO |
1677 | for ( cur = first ; cur < last ; cur = regnext( cur ) ) { |
1678 | ||
c445ea15 | 1679 | regnode * const noper = NEXTOPER( cur ); |
a28509cc AL |
1680 | const U8 *uc = (U8*)STRING( noper ); |
1681 | const U8 * const e = uc + STR_LEN( noper ); | |
a3621e74 YO |
1682 | |
1683 | U32 state = 1; /* required init */ | |
1684 | ||
1685 | U16 charid = 0; /* sanity init */ | |
1686 | U32 accept_state = 0; /* sanity init */ | |
1687 | U8 *scan = (U8*)NULL; /* sanity init */ | |
1688 | ||
1689 | STRLEN foldlen = 0; /* required init */ | |
07be1b83 | 1690 | U32 wordlen = 0; /* required init */ |
a3621e74 YO |
1691 | U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ]; |
1692 | ||
3dab1dad | 1693 | if ( OP(noper) != NOTHING ) { |
786e8c11 | 1694 | for ( ; uc < e ; uc += len ) { |
a3621e74 | 1695 | |
786e8c11 | 1696 | TRIE_READ_CHAR; |
a3621e74 | 1697 | |
786e8c11 YO |
1698 | if ( uvc < 256 ) { |
1699 | charid = trie->charmap[ uvc ]; | |
1700 | } else { | |
55eed653 | 1701 | SV* const * const svpp = hv_fetch( widecharmap, (char*)&uvc, sizeof( UV ), 0); |
786e8c11 | 1702 | charid = svpp ? (U16)SvIV(*svpp) : 0; |
a3621e74 | 1703 | } |
786e8c11 YO |
1704 | if ( charid ) { |
1705 | charid--; | |
1706 | if ( !trie->trans[ state + charid ].next ) { | |
1707 | trie->trans[ state + charid ].next = next_alloc; | |
1708 | trie->trans[ state ].check++; | |
1709 | next_alloc += trie->uniquecharcount; | |
1710 | } | |
1711 | state = trie->trans[ state + charid ].next; | |
1712 | } else { | |
1713 | Perl_croak( aTHX_ "panic! In trie construction, no char mapping for %"IVdf, uvc ); | |
1714 | } | |
1715 | /* charid is now 0 if we dont know the char read, or nonzero if we do */ | |
a3621e74 | 1716 | } |
a3621e74 | 1717 | } |
3dab1dad YO |
1718 | accept_state = TRIE_NODENUM( state ); |
1719 | TRIE_HANDLE_WORD(accept_state); | |
a3621e74 YO |
1720 | |
1721 | } /* end second pass */ | |
1722 | ||
3dab1dad | 1723 | /* and now dump it out before we compress it */ |
2b8b4781 NC |
1724 | DEBUG_TRIE_COMPILE_MORE_r(dump_trie_interim_table(trie, widecharmap, |
1725 | revcharmap, | |
1726 | next_alloc, depth+1)); | |
a3621e74 | 1727 | |
a3621e74 YO |
1728 | { |
1729 | /* | |
1730 | * Inplace compress the table.* | |
1731 | ||
1732 | For sparse data sets the table constructed by the trie algorithm will | |
1733 | be mostly 0/FAIL transitions or to put it another way mostly empty. | |
1734 | (Note that leaf nodes will not contain any transitions.) | |
1735 | ||
1736 | This algorithm compresses the tables by eliminating most such | |
1737 | transitions, at the cost of a modest bit of extra work during lookup: | |
1738 | ||
1739 | - Each states[] entry contains a .base field which indicates the | |
1740 | index in the state[] array wheres its transition data is stored. | |
1741 | ||
1742 | - If .base is 0 there are no valid transitions from that node. | |
1743 | ||
1744 | - If .base is nonzero then charid is added to it to find an entry in | |
1745 | the trans array. | |
1746 | ||
1747 | -If trans[states[state].base+charid].check!=state then the | |
1748 | transition is taken to be a 0/Fail transition. Thus if there are fail | |
1749 | transitions at the front of the node then the .base offset will point | |
1750 | somewhere inside the previous nodes data (or maybe even into a node | |
1751 | even earlier), but the .check field determines if the transition is | |
1752 | valid. | |
1753 | ||
786e8c11 | 1754 | XXX - wrong maybe? |
a3621e74 YO |
1755 | The following process inplace converts the table to the compressed |
1756 | table: We first do not compress the root node 1,and mark its all its | |
1757 | .check pointers as 1 and set its .base pointer as 1 as well. This | |
1758 | allows to do a DFA construction from the compressed table later, and | |
1759 | ensures that any .base pointers we calculate later are greater than | |
1760 | 0. | |
1761 | ||
1762 | - We set 'pos' to indicate the first entry of the second node. | |
1763 | ||
1764 | - We then iterate over the columns of the node, finding the first and | |
1765 | last used entry at l and m. We then copy l..m into pos..(pos+m-l), | |
1766 | and set the .check pointers accordingly, and advance pos | |
1767 | appropriately and repreat for the next node. Note that when we copy | |
1768 | the next pointers we have to convert them from the original | |
1769 | NODEIDX form to NODENUM form as the former is not valid post | |
1770 | compression. | |
1771 | ||
1772 | - If a node has no transitions used we mark its base as 0 and do not | |
1773 | advance the pos pointer. | |
1774 | ||
1775 | - If a node only has one transition we use a second pointer into the | |
1776 | structure to fill in allocated fail transitions from other states. | |
1777 | This pointer is independent of the main pointer and scans forward | |
1778 | looking for null transitions that are allocated to a state. When it | |
1779 | finds one it writes the single transition into the "hole". If the | |
786e8c11 | 1780 | pointer doesnt find one the single transition is appended as normal. |
a3621e74 YO |
1781 | |
1782 | - Once compressed we can Renew/realloc the structures to release the | |
1783 | excess space. | |
1784 | ||
1785 | See "Table-Compression Methods" in sec 3.9 of the Red Dragon, | |
1786 | specifically Fig 3.47 and the associated pseudocode. | |
1787 | ||
1788 | demq | |
1789 | */ | |
a3b680e6 | 1790 | const U32 laststate = TRIE_NODENUM( next_alloc ); |
a28509cc | 1791 | U32 state, charid; |
a3621e74 | 1792 | U32 pos = 0, zp=0; |
1e2e3d02 | 1793 | trie->statecount = laststate; |
a3621e74 YO |
1794 | |
1795 | for ( state = 1 ; state < laststate ; state++ ) { | |
1796 | U8 flag = 0; | |
a28509cc AL |
1797 | const U32 stateidx = TRIE_NODEIDX( state ); |
1798 | const U32 o_used = trie->trans[ stateidx ].check; | |
1799 | U32 used = trie->trans[ stateidx ].check; | |
a3621e74 YO |
1800 | trie->trans[ stateidx ].check = 0; |
1801 | ||
1802 | for ( charid = 0 ; used && charid < trie->uniquecharcount ; charid++ ) { | |
1803 | if ( flag || trie->trans[ stateidx + charid ].next ) { | |
1804 | if ( trie->trans[ stateidx + charid ].next ) { | |
1805 | if (o_used == 1) { | |
1806 | for ( ; zp < pos ; zp++ ) { | |
1807 | if ( ! trie->trans[ zp ].next ) { | |
1808 | break; | |
1809 | } | |
1810 | } | |
1811 | trie->states[ state ].trans.base = zp + trie->uniquecharcount - charid ; | |
1812 | trie->trans[ zp ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next ); | |
1813 | trie->trans[ zp ].check = state; | |
1814 | if ( ++zp > pos ) pos = zp; | |
1815 | break; | |
1816 | } | |
1817 | used--; | |
1818 | } | |
1819 | if ( !flag ) { | |
1820 | flag = 1; | |
1821 | trie->states[ state ].trans.base = pos + trie->uniquecharcount - charid ; | |
1822 | } | |
1823 | trie->trans[ pos ].next = SAFE_TRIE_NODENUM( trie->trans[ stateidx + charid ].next ); | |
1824 | trie->trans[ pos ].check = state; | |
1825 | pos++; | |
1826 | } | |
1827 | } | |
1828 | } | |
cc601c31 | 1829 | trie->lasttrans = pos + 1; |
c944940b JH |
1830 | trie->states = (reg_trie_state *) |
1831 | PerlMemShared_realloc( trie->states, laststate | |
1832 | * sizeof(reg_trie_state) ); | |
a3621e74 | 1833 | DEBUG_TRIE_COMPILE_MORE_r( |
e4584336 | 1834 | PerlIO_printf( Perl_debug_log, |
3dab1dad YO |
1835 | "%*sAlloc: %d Orig: %"IVdf" elements, Final:%"IVdf". Savings of %%%5.2f\n", |
1836 | (int)depth * 2 + 2,"", | |
1837 | (int)( ( TRIE_CHARCOUNT(trie) + 1 ) * trie->uniquecharcount + 1 ), | |
5d7488b2 AL |
1838 | (IV)next_alloc, |
1839 | (IV)pos, | |
a3621e74 YO |
1840 | ( ( next_alloc - pos ) * 100 ) / (double)next_alloc ); |
1841 | ); | |
1842 | ||
1843 | } /* end table compress */ | |
1844 | } | |
1e2e3d02 YO |
1845 | DEBUG_TRIE_COMPILE_MORE_r( |
1846 | PerlIO_printf(Perl_debug_log, "%*sStatecount:%"UVxf" Lasttrans:%"UVxf"\n", | |
1847 | (int)depth * 2 + 2, "", | |
1848 | (UV)trie->statecount, | |
1849 | (UV)trie->lasttrans) | |
1850 | ); | |
cc601c31 | 1851 | /* resize the trans array to remove unused space */ |
c944940b JH |
1852 | trie->trans = (reg_trie_trans *) |
1853 | PerlMemShared_realloc( trie->trans, trie->lasttrans | |
1854 | * sizeof(reg_trie_trans) ); | |
a3621e74 | 1855 | |
3dab1dad | 1856 | /* and now dump out the compressed format */ |
2b8b4781 | 1857 | DEBUG_TRIE_COMPILE_r(dump_trie(trie, widecharmap, revcharmap, depth+1)); |
07be1b83 | 1858 | |
3dab1dad | 1859 | { /* Modify the program and insert the new TRIE node*/ |
3dab1dad YO |
1860 | U8 nodetype =(U8)(flags & 0xFF); |
1861 | char *str=NULL; | |
786e8c11 | 1862 | |
07be1b83 | 1863 | #ifdef DEBUGGING |
e62cc96a | 1864 | regnode *optimize = NULL; |
7122b237 YO |
1865 | #ifdef RE_TRACK_PATTERN_OFFSETS |
1866 | ||
b57a0404 JH |
1867 | U32 mjd_offset = 0; |
1868 | U32 mjd_nodelen = 0; | |
7122b237 YO |
1869 | #endif /* RE_TRACK_PATTERN_OFFSETS */ |
1870 | #endif /* DEBUGGING */ | |
a3621e74 | 1871 | /* |
3dab1dad YO |
1872 | This means we convert either the first branch or the first Exact, |
1873 | depending on whether the thing following (in 'last') is a branch | |
1874 | or not and whther first is the startbranch (ie is it a sub part of | |
1875 | the alternation or is it the whole thing.) | |
1876 | Assuming its a sub part we conver the EXACT otherwise we convert | |
1877 | the whole branch sequence, including the first. | |
a3621e74 | 1878 | */ |
3dab1dad | 1879 | /* Find the node we are going to overwrite */ |
7f69552c | 1880 | if ( first != startbranch || OP( last ) == BRANCH ) { |
07be1b83 | 1881 | /* branch sub-chain */ |
3dab1dad | 1882 | NEXT_OFF( first ) = (U16)(last - first); |
7122b237 | 1883 | #ifdef RE_TRACK_PATTERN_OFFSETS |
07be1b83 YO |
1884 | DEBUG_r({ |
1885 | mjd_offset= Node_Offset((convert)); | |
1886 | mjd_nodelen= Node_Length((convert)); | |
1887 | }); | |
7122b237 | 1888 | #endif |
7f69552c | 1889 | /* whole branch chain */ |
7122b237 YO |
1890 | } |
1891 | #ifdef RE_TRACK_PATTERN_OFFSETS | |
1892 | else { | |
7f69552c YO |
1893 | DEBUG_r({ |
1894 | const regnode *nop = NEXTOPER( convert ); | |
1895 | mjd_offset= Node_Offset((nop)); | |
1896 | mjd_nodelen= Node_Length((nop)); | |
1897 | }); | |
07be1b83 YO |
1898 | } |
1899 | DEBUG_OPTIMISE_r( | |
1900 | PerlIO_printf(Perl_debug_log, "%*sMJD offset:%"UVuf" MJD length:%"UVuf"\n", | |
1901 | (int)depth * 2 + 2, "", | |
786e8c11 | 1902 | (UV)mjd_offset, (UV)mjd_nodelen) |
07be1b83 | 1903 | ); |
7122b237 | 1904 | #endif |
3dab1dad YO |
1905 | /* But first we check to see if there is a common prefix we can |
1906 | split out as an EXACT and put in front of the TRIE node. */ | |
1907 | trie->startstate= 1; | |
55eed653 | 1908 | if ( trie->bitmap && !widecharmap && !trie->jump ) { |
3dab1dad | 1909 | U32 state; |
1e2e3d02 | 1910 | for ( state = 1 ; state < trie->statecount-1 ; state++ ) { |
a3621e74 | 1911 | U32 ofs = 0; |
8e11feef RGS |
1912 | I32 idx = -1; |
1913 | U32 count = 0; | |
1914 | const U32 base = trie->states[ state ].trans.base; | |
a3621e74 | 1915 | |
3dab1dad | 1916 | if ( trie->states[state].wordnum ) |
8e11feef | 1917 | count = 1; |
a3621e74 | 1918 | |
8e11feef | 1919 | for ( ofs = 0 ; ofs < trie->uniquecharcount ; ofs++ ) { |
cc601c31 YO |
1920 | if ( ( base + ofs >= trie->uniquecharcount ) && |
1921 | ( base + ofs - trie->uniquecharcount < trie->lasttrans ) && | |
a3621e74 YO |
1922 | trie->trans[ base + ofs - trie->uniquecharcount ].check == state ) |
1923 | { | |
3dab1dad | 1924 | if ( ++count > 1 ) { |
2b8b4781 | 1925 | SV **tmp = av_fetch( revcharmap, ofs, 0); |
07be1b83 | 1926 | const U8 *ch = (U8*)SvPV_nolen_const( *tmp ); |
8e11feef | 1927 | if ( state == 1 ) break; |
3dab1dad YO |
1928 | if ( count == 2 ) { |
1929 | Zero(trie->bitmap, ANYOF_BITMAP_SIZE, char); | |
1930 | DEBUG_OPTIMISE_r( | |
8e11feef RGS |
1931 | PerlIO_printf(Perl_debug_log, |
1932 | "%*sNew Start State=%"UVuf" Class: [", | |
1933 | (int)depth * 2 + 2, "", | |
786e8c11 | 1934 | (UV)state)); |
be8e71aa | 1935 | if (idx >= 0) { |
2b8b4781 | 1936 | SV ** const tmp = av_fetch( revcharmap, idx, 0); |
be8e71aa | 1937 | const U8 * const ch = (U8*)SvPV_nolen_const( *tmp ); |
8e11feef | 1938 | |
3dab1dad | 1939 | TRIE_BITMAP_SET(trie,*ch); |
8e11feef RGS |
1940 | if ( folder ) |
1941 | TRIE_BITMAP_SET(trie, folder[ *ch ]); | |
3dab1dad | 1942 | DEBUG_OPTIMISE_r( |
07be1b83 | 1943 | PerlIO_printf(Perl_debug_log, (char*)ch) |
3dab1dad | 1944 | ); |
8e11feef RGS |
1945 | } |
1946 | } | |
1947 | TRIE_BITMAP_SET(trie,*ch); | |
1948 | if ( folder ) | |
1949 | TRIE_BITMAP_SET(trie,folder[ *ch ]); | |
1950 | DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"%s", ch)); | |
1951 | } | |
1952 | idx = ofs; | |
1953 | } | |
3dab1dad YO |
1954 | } |
1955 | if ( count == 1 ) { | |
2b8b4781 | 1956 | SV **tmp = av_fetch( revcharmap, idx, 0); |
de734bd5 A |
1957 | char *ch = SvPV_nolen( *tmp ); |
1958 | DEBUG_OPTIMISE_r({ | |
1959 | SV *sv=sv_newmortal(); | |
8e11feef RGS |
1960 | PerlIO_printf( Perl_debug_log, |
1961 | "%*sPrefix State: %"UVuf" Idx:%"UVuf" Char='%s'\n", | |
1962 | (int)depth * 2 + 2, "", | |
de734bd5 A |
1963 | (UV)state, (UV)idx, |
1964 | pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 6, | |
1965 | PL_colors[0], PL_colors[1], | |
1966 | (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0) | | |
1967 | PERL_PV_ESCAPE_FIRSTCHAR | |
1968 | ) | |
1969 | ); | |
1970 | }); | |
3dab1dad YO |
1971 | if ( state==1 ) { |
1972 | OP( convert ) = nodetype; | |
1973 | str=STRING(convert); | |
1974 | STR_LEN(convert)=0; | |
1975 | } | |
de734bd5 A |
1976 | while (*ch) { |
1977 | *str++ = *ch++; | |
1978 | STR_LEN(convert)++; | |
1979 | } | |
1980 | ||
8e11feef | 1981 | } else { |
f9049ba1 | 1982 | #ifdef DEBUGGING |
8e11feef RGS |
1983 | if (state>1) |
1984 | DEBUG_OPTIMISE_r(PerlIO_printf( Perl_debug_log,"]\n")); | |
f9049ba1 | 1985 | #endif |
8e11feef RGS |
1986 | break; |
1987 | } | |
1988 | } | |
3dab1dad | 1989 | if (str) { |
8e11feef | 1990 | regnode *n = convert+NODE_SZ_STR(convert); |
07be1b83 | 1991 | NEXT_OFF(convert) = NODE_SZ_STR(convert); |
8e11feef | 1992 | trie->startstate = state; |
07be1b83 YO |
1993 | trie->minlen -= (state - 1); |
1994 | trie->maxlen -= (state - 1); | |
1995 | DEBUG_r({ | |
1996 | regnode *fix = convert; | |
de734bd5 | 1997 | U32 word = trie->wordcount; |
07be1b83 YO |
1998 | mjd_nodelen++; |
1999 | Set_Node_Offset_Length(convert, mjd_offset, state - 1); | |
2000 | while( ++fix < n ) { | |
2001 | Set_Node_Offset_Length(fix, 0, 0); | |
2002 | } | |
de734bd5 | 2003 | while (word--) { |
2b8b4781 | 2004 | SV ** const tmp = av_fetch( trie_words, word, 0 ); |
de734bd5 A |
2005 | if (tmp) { |
2006 | if ( STR_LEN(convert) <= SvCUR(*tmp) ) | |
2007 | sv_chop(*tmp, SvPV_nolen(*tmp) + STR_LEN(convert)); | |
2008 | else | |
2009 | sv_chop(*tmp, SvPV_nolen(*tmp) + SvCUR(*tmp)); | |
2010 | } | |
2011 | } | |
07be1b83 | 2012 | }); |
8e11feef RGS |
2013 | if (trie->maxlen) { |
2014 | convert = n; | |
2015 | } else { | |
3dab1dad | 2016 | NEXT_OFF(convert) = (U16)(tail - convert); |
a5ca303d | 2017 | DEBUG_r(optimize= n); |
3dab1dad YO |
2018 | } |
2019 | } | |
2020 | } | |
a5ca303d YO |
2021 | if (!jumper) |
2022 | jumper = last; | |
3dab1dad | 2023 | if ( trie->maxlen ) { |
8e11feef RGS |
2024 | NEXT_OFF( convert ) = (U16)(tail - convert); |
2025 | ARG_SET( convert, data_slot ); | |
786e8c11 YO |
2026 | /* Store the offset to the first unabsorbed branch in |
2027 | jump[0], which is otherwise unused by the jump logic. | |
2028 | We use this when dumping a trie and during optimisation. */ | |
2029 | if (trie->jump) | |
7f69552c | 2030 | trie->jump[0] = (U16)(nextbranch - convert); |
a5ca303d | 2031 | |
786e8c11 YO |
2032 | /* XXXX */ |
2033 | if ( !trie->states[trie->startstate].wordnum && trie->bitmap && | |
1de06328 | 2034 | ( (char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) ) |
786e8c11 YO |
2035 | { |
2036 | OP( convert ) = TRIEC; | |
2037 | Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char); | |
446bd890 | 2038 | PerlMemShared_free(trie->bitmap); |
786e8c11 YO |
2039 | trie->bitmap= NULL; |
2040 | } else | |
2041 | OP( convert ) = TRIE; | |
a3621e74 | 2042 | |
3dab1dad YO |
2043 | /* store the type in the flags */ |
2044 | convert->flags = nodetype; | |
a5ca303d YO |
2045 | DEBUG_r({ |
2046 | optimize = convert | |
2047 | + NODE_STEP_REGNODE | |
2048 | + regarglen[ OP( convert ) ]; | |
2049 | }); | |
2050 | /* XXX We really should free up the resource in trie now, | |
2051 | as we won't use them - (which resources?) dmq */ | |
3dab1dad | 2052 | } |
a3621e74 | 2053 | /* needed for dumping*/ |
e62cc96a | 2054 | DEBUG_r(if (optimize) { |
07be1b83 | 2055 | regnode *opt = convert; |
bcdf7404 | 2056 | |
e62cc96a | 2057 | while ( ++opt < optimize) { |
07be1b83 YO |
2058 | Set_Node_Offset_Length(opt,0,0); |
2059 | } | |
786e8c11 YO |
2060 | /* |
2061 | Try to clean up some of the debris left after the | |
2062 | optimisation. | |
a3621e74 | 2063 | */ |
786e8c11 | 2064 | while( optimize < jumper ) { |
07be1b83 | 2065 | mjd_nodelen += Node_Length((optimize)); |
a3621e74 | 2066 | OP( optimize ) = OPTIMIZED; |
07be1b83 | 2067 | Set_Node_Offset_Length(optimize,0,0); |
a3621e74 YO |
2068 | optimize++; |
2069 | } | |
07be1b83 | 2070 | Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen); |
a3621e74 YO |
2071 | }); |
2072 | } /* end node insert */ | |
55eed653 | 2073 | RExC_rxi->data->data[ data_slot + 1 ] = (void*)widecharmap; |
2b8b4781 NC |
2074 | #ifdef DEBUGGING |
2075 | RExC_rxi->data->data[ data_slot + TRIE_WORDS_OFFSET ] = (void*)trie_words; | |
2076 | RExC_rxi->data->data[ data_slot + 3 ] = (void*)revcharmap; | |
2077 | #else | |
2078 | SvREFCNT_dec(revcharmap); | |
07be1b83 | 2079 | #endif |
786e8c11 YO |
2080 | return trie->jump |
2081 | ? MADE_JUMP_TRIE | |
2082 | : trie->startstate>1 | |
2083 | ? MADE_EXACT_TRIE | |
2084 | : MADE_TRIE; | |
2085 | } | |
2086 | ||
2087 | STATIC void | |
2088 | S_make_trie_failtable(pTHX_ RExC_state_t *pRExC_state, regnode *source, regnode *stclass, U32 depth) | |
2089 | { | |
2090 | /* The Trie is constructed and compressed now so we can build a fail array now if its needed | |
2091 | ||
2092 | This is basically the Aho-Corasick algorithm. Its from exercise 3.31 and 3.32 in the | |
2093 | "Red Dragon" -- Compilers, principles, techniques, and tools. Aho, Sethi, Ullman 1985/88 | |
2094 | ISBN 0-201-10088-6 | |
2095 | ||
2096 | We find the fail state for each state in the trie, this state is the longest proper | |
2097 | suffix of the current states 'word' that is also a proper prefix of another word in our | |
2098 | trie. State 1 represents the word '' and is the thus the default fail state. This allows | |
2099 | the DFA not to have to restart after its tried and failed a word at a given point, it | |
2100 | simply continues as though it had been matching the other word in the first place. | |
2101 | Consider | |
2102 | 'abcdgu'=~/abcdefg|cdgu/ | |
2103 | When we get to 'd' we are still matching the first word, we would encounter 'g' which would | |
2104 | fail, which would bring use to the state representing 'd' in the second word where we would | |
2105 | try 'g' and succeed, prodceding to match 'cdgu'. | |
2106 | */ | |
2107 | /* add a fail transition */ | |
3251b653 NC |
2108 | const U32 trie_offset = ARG(source); |
2109 | reg_trie_data *trie=(reg_trie_data *)RExC_rxi->data->data[trie_offset]; | |
786e8c11 YO |
2110 | U32 *q; |
2111 | const U32 ucharcount = trie->uniquecharcount; | |
1e2e3d02 | 2112 | const U32 numstates = trie->statecount; |
786e8c11 YO |
2113 | const U32 ubound = trie->lasttrans + ucharcount; |
2114 | U32 q_read = 0; | |
2115 | U32 q_write = 0; | |
2116 | U32 charid; | |
2117 | U32 base = trie->states[ 1 ].trans.base; | |
2118 | U32 *fail; | |
2119 | reg_ac_data *aho; | |
2120 | const U32 data_slot = add_data( pRExC_state, 1, "T" ); | |
2121 | GET_RE_DEBUG_FLAGS_DECL; | |
2122 | #ifndef DEBUGGING | |
2123 | PERL_UNUSED_ARG(depth); | |
2124 | #endif | |
2125 | ||
2126 | ||
2127 | ARG_SET( stclass, data_slot ); | |
c944940b | 2128 | aho = (reg_ac_data *) PerlMemShared_calloc( 1, sizeof(reg_ac_data) ); |
f8fc2ecf | 2129 | RExC_rxi->data->data[ data_slot ] = (void*)aho; |
3251b653 | 2130 | aho->trie=trie_offset; |
446bd890 NC |
2131 | aho->states=(reg_trie_state *)PerlMemShared_malloc( numstates * sizeof(reg_trie_state) ); |
2132 | Copy( trie->states, aho->states, numstates, reg_trie_state ); | |
786e8c11 | 2133 | Newxz( q, numstates, U32); |
c944940b | 2134 | aho->fail = (U32 *) PerlMemShared_calloc( numstates, sizeof(U32) ); |
786e8c11 YO |
2135 | aho->refcount = 1; |
2136 | fail = aho->fail; | |
2137 | /* initialize fail[0..1] to be 1 so that we always have | |
2138 | a valid final fail state */ | |
2139 | fail[ 0 ] = fail[ 1 ] = 1; | |
2140 | ||
2141 | for ( charid = 0; charid < ucharcount ; charid++ ) { | |
2142 | const U32 newstate = TRIE_TRANS_STATE( 1, base, ucharcount, charid, 0 ); | |
2143 | if ( newstate ) { | |
2144 | q[ q_write ] = newstate; | |
2145 | /* set to point at the root */ | |
2146 | fail[ q[ q_write++ ] ]=1; | |
2147 | } | |
2148 | } | |
2149 | while ( q_read < q_write) { | |
2150 | const U32 cur = q[ q_read++ % numstates ]; | |
2151 | base = trie->states[ cur ].trans.base; | |
2152 | ||
2153 | for ( charid = 0 ; charid < ucharcount ; charid++ ) { | |
2154 | const U32 ch_state = TRIE_TRANS_STATE( cur, base, ucharcount, charid, 1 ); | |
2155 | if (ch_state) { | |
2156 | U32 fail_state = cur; | |
2157 | U32 fail_base; | |
2158 | do { | |
2159 | fail_state = fail[ fail_state ]; | |
2160 | fail_base = aho->states[ fail_state ].trans.base; | |
2161 | } while ( !TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ) ); | |
2162 | ||
2163 | fail_state = TRIE_TRANS_STATE( fail_state, fail_base, ucharcount, charid, 1 ); | |
2164 | fail[ ch_state ] = fail_state; | |
2165 | if ( !aho->states[ ch_state ].wordnum && aho->states[ fail_state ].wordnum ) | |
2166 | { | |
2167 | aho->states[ ch_state ].wordnum = aho->states[ fail_state ].wordnum; | |
2168 | } | |
2169 | q[ q_write++ % numstates] = ch_state; | |
2170 | } | |
2171 | } | |
2172 | } | |
2173 | /* restore fail[0..1] to 0 so that we "fall out" of the AC loop | |
2174 | when we fail in state 1, this allows us to use the | |
2175 | charclass scan to find a valid start char. This is based on the principle | |
2176 | that theres a good chance the string being searched contains lots of stuff | |
2177 | that cant be a start char. | |
2178 | */ | |
2179 | fail[ 0 ] = fail[ 1 ] = 0; | |
2180 | DEBUG_TRIE_COMPILE_r({ | |
6d99fb9b JH |
2181 | PerlIO_printf(Perl_debug_log, |
2182 | "%*sStclass Failtable (%"UVuf" states): 0", | |
2183 | (int)(depth * 2), "", (UV)numstates | |
1e2e3d02 | 2184 | ); |
786e8c11 YO |
2185 | for( q_read=1; q_read<numstates; q_read++ ) { |
2186 | PerlIO_printf(Perl_debug_log, ", %"UVuf, (UV)fail[q_read]); | |
2187 | } | |
2188 | PerlIO_printf(Perl_debug_log, "\n"); | |
2189 | }); | |
2190 | Safefree(q); | |
2191 | /*RExC_seen |= REG_SEEN_TRIEDFA;*/ | |
a3621e74 YO |
2192 | } |
2193 | ||
786e8c11 | 2194 | |
a3621e74 | 2195 | /* |
5d1c421c JH |
2196 | * There are strange code-generation bugs caused on sparc64 by gcc-2.95.2. |
2197 | * These need to be revisited when a newer toolchain becomes available. | |
2198 | */ | |
2199 | #if defined(__sparc64__) && defined(__GNUC__) | |
2200 | # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 96) | |
2201 | # undef SPARC64_GCC_WORKAROUND | |
2202 | # define SPARC64_GCC_WORKAROUND 1 | |
2203 | # endif | |
2204 | #endif | |
2205 | ||
07be1b83 | 2206 | #define DEBUG_PEEP(str,scan,depth) \ |
b515a41d | 2207 | DEBUG_OPTIMISE_r({if (scan){ \ |
07be1b83 YO |
2208 | SV * const mysv=sv_newmortal(); \ |
2209 | regnode *Next = regnext(scan); \ | |
2210 | regprop(RExC_rx, mysv, scan); \ | |
7f69552c | 2211 | PerlIO_printf(Perl_debug_log, "%*s" str ">%3d: %s (%d)\n", \ |
07be1b83 YO |
2212 | (int)depth*2, "", REG_NODE_NUM(scan), SvPV_nolen_const(mysv),\ |
2213 | Next ? (REG_NODE_NUM(Next)) : 0 ); \ | |
b515a41d | 2214 | }}); |
07be1b83 | 2215 | |
1de06328 YO |
2216 | |
2217 | ||
2218 | ||
2219 | ||
07be1b83 YO |
2220 | #define JOIN_EXACT(scan,min,flags) \ |
2221 | if (PL_regkind[OP(scan)] == EXACT) \ | |
2222 | join_exact(pRExC_state,(scan),(min),(flags),NULL,depth+1) | |
2223 | ||
be8e71aa | 2224 | STATIC U32 |
07be1b83 YO |
2225 | S_join_exact(pTHX_ RExC_state_t *pRExC_state, regnode *scan, I32 *min, U32 flags,regnode *val, U32 depth) { |
2226 | /* Merge several consecutive EXACTish nodes into one. */ | |
2227 | regnode *n = regnext(scan); | |
2228 | U32 stringok = 1; | |
2229 | regnode *next = scan + NODE_SZ_STR(scan); | |
2230 | U32 merged = 0; | |
2231 | U32 stopnow = 0; | |
2232 | #ifdef DEBUGGING | |
2233 | regnode *stop = scan; | |
72f13be8 | 2234 | GET_RE_DEBUG_FLAGS_DECL; |
f9049ba1 | 2235 | #else |
d47053eb RGS |
2236 | PERL_UNUSED_ARG(depth); |
2237 | #endif | |
2238 | #ifndef EXPERIMENTAL_INPLACESCAN | |
f9049ba1 SP |
2239 | PERL_UNUSED_ARG(flags); |
2240 | PERL_UNUSED_ARG(val); | |
07be1b83 | 2241 | #endif |
07be1b83 YO |
2242 | DEBUG_PEEP("join",scan,depth); |
2243 | ||
2244 | /* Skip NOTHING, merge EXACT*. */ | |
2245 | while (n && | |
2246 | ( PL_regkind[OP(n)] == NOTHING || | |
2247 | (stringok && (OP(n) == OP(scan)))) | |
2248 | && NEXT_OFF(n) | |
2249 | && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) { | |
2250 | ||
2251 | if (OP(n) == TAIL || n > next) | |
2252 | stringok = 0; | |
2253 | if (PL_regkind[OP(n)] == NOTHING) { | |
07be1b83 YO |
2254 | DEBUG_PEEP("skip:",n,depth); |
2255 | NEXT_OFF(scan) += NEXT_OFF(n); | |
2256 | next = n + NODE_STEP_REGNODE; | |
2257 | #ifdef DEBUGGING | |
2258 | if (stringok) | |
2259 | stop = n; | |
2260 | #endif | |
2261 | n = regnext(n); | |
2262 | } | |
2263 | else if (stringok) { | |
786e8c11 | 2264 | const unsigned int oldl = STR_LEN(scan); |
07be1b83 YO |
2265 | regnode * const nnext = regnext(n); |
2266 | ||
2267 | DEBUG_PEEP("merg",n,depth); | |
2268 | ||
2269 | merged++; | |
2270 | if (oldl + STR_LEN(n) > U8_MAX) | |
2271 | break; | |
2272 | NEXT_OFF(scan) += NEXT_OFF(n); | |
2273 | STR_LEN(scan) += STR_LEN(n); | |
2274 | next = n + NODE_SZ_STR(n); | |
2275 | /* Now we can overwrite *n : */ | |
2276 | Move(STRING(n), STRING(scan) + oldl, STR_LEN(n), char); | |
2277 | #ifdef DEBUGGING | |
2278 | stop = next - 1; | |
2279 | #endif | |
2280 | n = nnext; | |
2281 | if (stopnow) break; | |
2282 | } | |
2283 | ||
d47053eb RGS |
2284 | #ifdef EXPERIMENTAL_INPLACESCAN |
2285 | if (flags && !NEXT_OFF(n)) { | |
2286 | DEBUG_PEEP("atch", val, depth); | |
2287 | if (reg_off_by_arg[OP(n)]) { | |
2288 | ARG_SET(n, val - n); | |
2289 | } | |
2290 | else { | |
2291 | NEXT_OFF(n) = val - n; | |
2292 | } | |
2293 | stopnow = 1; | |
2294 | } | |
07be1b83 YO |
2295 | #endif |
2296 | } | |
2297 | ||
2298 | if (UTF && ( OP(scan) == EXACTF ) && ( STR_LEN(scan) >= 6 ) ) { | |
2299 | /* | |
2300 | Two problematic code points in Unicode casefolding of EXACT nodes: | |
2301 | ||
2302 | U+0390 - GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS | |
2303 | U+03B0 - GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS | |
2304 | ||
2305 | which casefold to | |
2306 | ||
2307 | Unicode UTF-8 | |
2308 | ||
2309 | U+03B9 U+0308 U+0301 0xCE 0xB9 0xCC 0x88 0xCC 0x81 | |
2310 | U+03C5 U+0308 U+0301 0xCF 0x85 0xCC 0x88 0xCC 0x81 | |
2311 | ||
2312 | This means that in case-insensitive matching (or "loose matching", | |
2313 | as Unicode calls it), an EXACTF of length six (the UTF-8 encoded byte | |
2314 | length of the above casefolded versions) can match a target string | |
2315 | of length two (the byte length of UTF-8 encoded U+0390 or U+03B0). | |
2316 | This would rather mess up the minimum length computation. | |
2317 | ||
2318 | What we'll do is to look for the tail four bytes, and then peek | |
2319 | at the preceding two bytes to see whether we need to decrease | |
2320 | the minimum length by four (six minus two). | |
2321 | ||
2322 | Thanks to the design of UTF-8, there cannot be false matches: | |
2323 | A sequence of valid UTF-8 bytes cannot be a subsequence of | |
2324 | another valid sequence of UTF-8 bytes. | |
2325 | ||
2326 | */ | |
2327 | char * const s0 = STRING(scan), *s, *t; | |
2328 | char * const s1 = s0 + STR_LEN(scan) - 1; | |
2329 | char * const s2 = s1 - 4; | |
e294cc5d JH |
2330 | #ifdef EBCDIC /* RD tunifold greek 0390 and 03B0 */ |
2331 | const char t0[] = "\xaf\x49\xaf\x42"; | |
2332 | #else | |
07be1b83 | 2333 | const char t0[] = "\xcc\x88\xcc\x81"; |
e294cc5d | 2334 | #endif |
07be1b83 YO |
2335 | const char * const t1 = t0 + 3; |
2336 | ||
2337 | for (s = s0 + 2; | |
2338 | s < s2 && (t = ninstr(s, s1, t0, t1)); | |
2339 | s = t + 4) { | |
e294cc5d JH |
2340 | #ifdef EBCDIC |
2341 | if (((U8)t[-1] == 0x68 && (U8)t[-2] == 0xB4) || | |
2342 | ((U8)t[-1] == 0x46 && (U8)t[-2] == 0xB5)) | |
2343 | #else | |
07be1b83 YO |
2344 | if (((U8)t[-1] == 0xB9 && (U8)t[-2] == 0xCE) || |
2345 | ((U8)t[-1] == 0x85 && (U8)t[-2] == 0xCF)) | |
e294cc5d | 2346 | #endif |
07be1b83 YO |
2347 | *min -= 4; |
2348 | } | |
2349 | } | |
2350 | ||
2351 | #ifdef DEBUGGING | |
2352 | /* Allow dumping */ | |
2353 | n = scan + NODE_SZ_STR(scan); | |
2354 | while (n <= stop) { | |
2355 | if (PL_regkind[OP(n)] != NOTHING || OP(n) == NOTHING) { | |
2356 | OP(n) = OPTIMIZED; | |
2357 | NEXT_OFF(n) = 0; | |
2358 | } | |
2359 | n++; | |
2360 | } | |
2361 | #endif | |
2362 | DEBUG_OPTIMISE_r(if (merged){DEBUG_PEEP("finl",scan,depth)}); | |
2363 | return stopnow; | |
2364 | } | |
2365 | ||
653099ff GS |
2366 | /* REx optimizer. Converts nodes into quickier variants "in place". |
2367 | Finds fixed substrings. */ | |
2368 | ||
a0288114 | 2369 | /* Stops at toplevel WHILEM as well as at "last". At end *scanp is set |
c277df42 IZ |
2370 | to the position after last scanned or to NULL. */ |
2371 | ||
40d049e4 YO |
2372 | #define INIT_AND_WITHP \ |
2373 | assert(!and_withp); \ | |
2374 | Newx(and_withp,1,struct regnode_charclass_class); \ | |
2375 | SAVEFREEPV(and_withp) | |
07be1b83 | 2376 | |
b515a41d YO |
2377 | /* this is a chain of data about sub patterns we are processing that |
2378 | need to be handled seperately/specially in study_chunk. Its so | |
2379 | we can simulate recursion without losing state. */ | |
2380 | struct scan_frame; | |
2381 | typedef struct scan_frame { | |
2382 | regnode *last; /* last node to process in this frame */ | |
2383 | regnode *next; /* next node to process when last is reached */ | |
2384 | struct scan_frame *prev; /*previous frame*/ | |
2385 | I32 stop; /* what stopparen do we use */ | |
2386 | } scan_frame; | |
2387 | ||
304ee84b YO |
2388 | |
2389 | #define SCAN_COMMIT(s, data, m) scan_commit(s, data, m, is_inf) | |
2390 | ||
76e3520e | 2391 | STATIC I32 |
40d049e4 | 2392 | S_study_chunk(pTHX_ RExC_state_t *pRExC_state, regnode **scanp, |
1de06328 | 2393 | I32 *minlenp, I32 *deltap, |
40d049e4 YO |
2394 | regnode *last, |
2395 | scan_data_t *data, | |
2396 | I32 stopparen, | |
2397 | U8* recursed, | |
2398 | struct regnode_charclass_class *and_withp, | |
2399 | U32 flags, U32 depth) | |
c277df42 IZ |
2400 | /* scanp: Start here (read-write). */ |
2401 | /* deltap: Write maxlen-minlen here. */ | |
2402 | /* last: Stop before this one. */ | |
40d049e4 YO |
2403 | /* data: string data about the pattern */ |
2404 | /* stopparen: treat close N as END */ | |
2405 | /* recursed: which subroutines have we recursed into */ | |
2406 | /* and_withp: Valid if flags & SCF_DO_STCLASS_OR */ | |
c277df42 | 2407 | { |
97aff369 | 2408 | dVAR; |
c277df42 IZ |
2409 | I32 min = 0, pars = 0, code; |
2410 | regnode *scan = *scanp, *next; | |
2411 | I32 delta = 0; | |
2412 | int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF); | |
aca2d497 | 2413 | int is_inf_internal = 0; /* The studied chunk is infinite */ |
c277df42 IZ |
2414 | I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0; |
2415 | scan_data_t data_fake; | |
a3621e74 | 2416 | SV *re_trie_maxbuff = NULL; |
786e8c11 | 2417 | regnode *first_non_open = scan; |
e2e6a0f1 | 2418 | I32 stopmin = I32_MAX; |
8aa23a47 YO |
2419 | scan_frame *frame = NULL; |
2420 | ||
a3621e74 | 2421 | GET_RE_DEBUG_FLAGS_DECL; |
8aa23a47 | 2422 | |
13a24bad | 2423 | #ifdef DEBUGGING |
40d049e4 | 2424 | StructCopy(&zero_scan_data, &data_fake, scan_data_t); |
13a24bad | 2425 | #endif |
40d049e4 | 2426 | |
786e8c11 | 2427 | if ( depth == 0 ) { |
40d049e4 | 2428 | while (first_non_open && OP(first_non_open) == OPEN) |
786e8c11 YO |
2429 | first_non_open=regnext(first_non_open); |
2430 | } | |
2431 | ||
b81d288d | 2432 | |
8aa23a47 YO |
2433 | fake_study_recurse: |
2434 | while ( scan && OP(scan) != END && scan < last ){ | |
2435 | /* Peephole optimizer: */ | |
304ee84b | 2436 | DEBUG_STUDYDATA("Peep:", data,depth); |
8aa23a47 YO |
2437 | DEBUG_PEEP("Peep",scan,depth); |
2438 | JOIN_EXACT(scan,&min,0); | |
2439 | ||
2440 | /* Follow the next-chain of the current node and optimize | |
2441 | away all the NOTHINGs from it. */ | |
2442 | if (OP(scan) != CURLYX) { | |
2443 | const int max = (reg_off_by_arg[OP(scan)] | |
2444 | ? I32_MAX | |
2445 | /* I32 may be smaller than U16 on CRAYs! */ | |
2446 | : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX)); | |
2447 | int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan)); | |
2448 | int noff; | |
2449 | regnode *n = scan; | |
2450 | ||
2451 | /* Skip NOTHING and LONGJMP. */ | |
2452 | while ((n = regnext(n)) | |
2453 | && ((PL_regkind[OP(n)] == NOTHING && (noff = NEXT_OFF(n))) | |
2454 | || ((OP(n) == LONGJMP) && (noff = ARG(n)))) | |
2455 | && off + noff < max) | |
2456 | off += noff; | |
2457 | if (reg_off_by_arg[OP(scan)]) | |
2458 | ARG(scan) = off; | |
2459 | else | |
2460 | NEXT_OFF(scan) = off; | |
2461 | } | |
a3621e74 | 2462 | |
c277df42 | 2463 | |
8aa23a47 YO |
2464 | |
2465 | /* The principal pseudo-switch. Cannot be a switch, since we | |
2466 | look into several different things. */ | |
2467 | if (OP(scan) == BRANCH || OP(scan) == BRANCHJ | |
2468 | || OP(scan) == IFTHEN) { | |
2469 | next = regnext(scan); | |
2470 | code = OP(scan); | |
2471 | /* demq: the op(next)==code check is to see if we have "branch-branch" AFAICT */ | |
2472 | ||
2473 | if (OP(next) == code || code == IFTHEN) { | |
2474 | /* NOTE - There is similar code to this block below for handling | |
2475 | TRIE nodes on a re-study. If you change stuff here check there | |
2476 | too. */ | |
2477 | I32 max1 = 0, min1 = I32_MAX, num = 0; | |
2478 | struct regnode_charclass_class accum; | |
2479 | regnode * const startbranch=scan; | |
2480 | ||
2481 | if (flags & SCF_DO_SUBSTR) | |
304ee84b | 2482 | SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot merge strings after this. */ |
8aa23a47 YO |
2483 | if (flags & SCF_DO_STCLASS) |
2484 | cl_init_zero(pRExC_state, &accum); | |
2485 | ||
2486 | while (OP(scan) == code) { | |
2487 | I32 deltanext, minnext, f = 0, fake; | |
2488 | struct regnode_charclass_class this_class; | |
2489 | ||
2490 | num++; | |
2491 | data_fake.flags = 0; | |
2492 | if (data) { | |
2493 | data_fake.whilem_c = data->whilem_c; | |
2494 | data_fake.last_closep = data->last_closep; | |
2495 | } | |
2496 | else | |
2497 | data_fake.last_closep = &fake; | |
58e23c8d YO |
2498 | |
2499 | data_fake.pos_delta = delta; | |
8aa23a47 YO |
2500 | next = regnext(scan); |
2501 | scan = NEXTOPER(scan); | |
2502 | if (code != BRANCH) | |
c277df42 | 2503 | scan = NEXTOPER(scan); |
8aa23a47 YO |
2504 | if (flags & SCF_DO_STCLASS) { |
2505 | cl_init(pRExC_state, &this_class); | |
2506 | data_fake.start_class = &this_class; | |
2507 | f = SCF_DO_STCLASS_AND; | |
58e23c8d | 2508 | } |
8aa23a47 YO |
2509 | if (flags & SCF_WHILEM_VISITED_POS) |
2510 | f |= SCF_WHILEM_VISITED_POS; | |
2511 | ||
2512 | /* we suppose the run is continuous, last=next...*/ | |
2513 | minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext, | |
2514 | next, &data_fake, | |
2515 | stopparen, recursed, NULL, f,depth+1); | |
2516 | if (min1 > minnext) | |
2517 | min1 = minnext; | |
2518 | if (max1 < minnext + deltanext) | |
2519 | max1 = minnext + deltanext; | |
2520 | if (deltanext == I32_MAX) | |
2521 | is_inf = is_inf_internal = 1; | |
2522 | scan = next; | |
2523 | if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
2524 | pars++; | |
2525 | if (data_fake.flags & SCF_SEEN_ACCEPT) { | |
2526 | if ( stopmin > minnext) | |
2527 | stopmin = min + min1; | |
2528 | flags &= ~SCF_DO_SUBSTR; | |
2529 | if (data) | |
2530 | data->flags |= SCF_SEEN_ACCEPT; | |
2531 | } | |
2532 | if (data) { | |
2533 | if (data_fake.flags & SF_HAS_EVAL) | |
2534 | data->flags |= SF_HAS_EVAL; | |
2535 | data->whilem_c = data_fake.whilem_c; | |
3dab1dad | 2536 | } |
8aa23a47 YO |
2537 | if (flags & SCF_DO_STCLASS) |
2538 | cl_or(pRExC_state, &accum, &this_class); | |
2539 | } | |
2540 | if (code == IFTHEN && num < 2) /* Empty ELSE branch */ | |
2541 | min1 = 0; | |
2542 | if (flags & SCF_DO_SUBSTR) { | |
2543 | data->pos_min += min1; | |
2544 | data->pos_delta += max1 - min1; | |
2545 | if (max1 != min1 || is_inf) | |
2546 | data->longest = &(data->longest_float); | |
2547 | } | |
2548 | min += min1; | |
2549 | delta += max1 - min1; | |
2550 | if (flags & SCF_DO_STCLASS_OR) { | |
2551 | cl_or(pRExC_state, data->start_class, &accum); | |
2552 | if (min1) { | |
2553 | cl_and(data->start_class, and_withp); | |
2554 | flags &= ~SCF_DO_STCLASS; | |
653099ff | 2555 | } |
8aa23a47 YO |
2556 | } |
2557 | else if (flags & SCF_DO_STCLASS_AND) { | |
2558 | if (min1) { | |
2559 | cl_and(data->start_class, &accum); | |
2560 | flags &= ~SCF_DO_STCLASS; | |
de0c8cb8 | 2561 | } |
8aa23a47 YO |
2562 | else { |
2563 | /* Switch to OR mode: cache the old value of | |
2564 | * data->start_class */ | |
2565 | INIT_AND_WITHP; | |
2566 | StructCopy(data->start_class, and_withp, | |
2567 | struct regnode_charclass_class); | |
2568 | flags &= ~SCF_DO_STCLASS_AND; | |
2569 | StructCopy(&accum, data->start_class, | |
2570 | struct regnode_charclass_class); | |
2571 | flags |= SCF_DO_STCLASS_OR; | |
2572 | data->start_class->flags |= ANYOF_EOS; | |
de0c8cb8 | 2573 | } |
8aa23a47 | 2574 | } |
a3621e74 | 2575 | |
8aa23a47 YO |
2576 | if (PERL_ENABLE_TRIE_OPTIMISATION && OP( startbranch ) == BRANCH ) { |
2577 | /* demq. | |
a3621e74 | 2578 | |
8aa23a47 YO |
2579 | Assuming this was/is a branch we are dealing with: 'scan' now |
2580 | points at the item that follows the branch sequence, whatever | |
2581 | it is. We now start at the beginning of the sequence and look | |
2582 | for subsequences of | |
a3621e74 | 2583 | |
8aa23a47 YO |
2584 | BRANCH->EXACT=>x1 |
2585 | BRANCH->EXACT=>x2 | |
2586 | tail | |
a3621e74 | 2587 | |
8aa23a47 | 2588 | which would be constructed from a pattern like /A|LIST|OF|WORDS/ |
a3621e74 | 2589 | |
8aa23a47 YO |
2590 | If we can find such a subseqence we need to turn the first |
2591 | element into a trie and then add the subsequent branch exact | |
2592 | strings to the trie. | |
a3621e74 | 2593 | |
8aa23a47 | 2594 | We have two cases |
a3621e74 | 2595 | |
8aa23a47 | 2596 | 1. patterns where the whole set of branch can be converted. |
a3621e74 | 2597 | |
8aa23a47 | 2598 | 2. patterns where only a subset can be converted. |
a3621e74 | 2599 | |
8aa23a47 YO |
2600 | In case 1 we can replace the whole set with a single regop |
2601 | for the trie. In case 2 we need to keep the start and end | |
2602 | branchs so | |
a3621e74 | 2603 | |
8aa23a47 YO |
2604 | 'BRANCH EXACT; BRANCH EXACT; BRANCH X' |
2605 | becomes BRANCH TRIE; BRANCH X; | |
786e8c11 | 2606 | |
8aa23a47 YO |
2607 | There is an additional case, that being where there is a |
2608 | common prefix, which gets split out into an EXACT like node | |
2609 | preceding the TRIE node. | |
a3621e74 | 2610 | |
8aa23a47 YO |
2611 | If x(1..n)==tail then we can do a simple trie, if not we make |
2612 | a "jump" trie, such that when we match the appropriate word | |
2613 | we "jump" to the appopriate tail node. Essentailly we turn | |
2614 | a nested if into a case structure of sorts. | |
b515a41d | 2615 | |
8aa23a47 YO |
2616 | */ |
2617 | ||
2618 | int made=0; | |
2619 | if (!re_trie_maxbuff) { | |
2620 | re_trie_maxbuff = get_sv(RE_TRIE_MAXBUF_NAME, 1); | |
2621 | if (!SvIOK(re_trie_maxbuff)) | |
2622 | sv_setiv(re_trie_maxbuff, RE_TRIE_MAXBUF_INIT); | |
2623 | } | |
2624 | if ( SvIV(re_trie_maxbuff)>=0 ) { | |
2625 | regnode *cur; | |
2626 | regnode *first = (regnode *)NULL; | |
2627 | regnode *last = (regnode *)NULL; | |
2628 | regnode *tail = scan; | |
2629 | U8 optype = 0; | |
2630 | U32 count=0; | |
a3621e74 YO |
2631 | |
2632 | #ifdef DEBUGGING | |
8aa23a47 | 2633 | SV * const mysv = sv_newmortal(); /* for dumping */ |
a3621e74 | 2634 | #endif |
8aa23a47 YO |
2635 | /* var tail is used because there may be a TAIL |
2636 | regop in the way. Ie, the exacts will point to the | |
2637 | thing following the TAIL, but the last branch will | |
2638 | point at the TAIL. So we advance tail. If we | |
2639 | have nested (?:) we may have to move through several | |
2640 | tails. | |
2641 | */ | |
2642 | ||
2643 | while ( OP( tail ) == TAIL ) { | |
2644 | /* this is the TAIL generated by (?:) */ | |
2645 | tail = regnext( tail ); | |
2646 | } | |
a3621e74 | 2647 | |
8aa23a47 YO |
2648 | |
2649 | DEBUG_OPTIMISE_r({ | |
2650 | regprop(RExC_rx, mysv, tail ); | |
2651 | PerlIO_printf( Perl_debug_log, "%*s%s%s\n", | |
2652 | (int)depth * 2 + 2, "", | |
2653 | "Looking for TRIE'able sequences. Tail node is: ", | |
2654 | SvPV_nolen_const( mysv ) | |
2655 | ); | |
2656 | }); | |
2657 | ||
2658 | /* | |
2659 | ||
2660 | step through the branches, cur represents each | |
2661 | branch, noper is the first thing to be matched | |
2662 | as part of that branch and noper_next is the | |
2663 | regnext() of that node. if noper is an EXACT | |
2664 | and noper_next is the same as scan (our current | |
2665 | position in the regex) then the EXACT branch is | |
2666 | a possible optimization target. Once we have | |
2667 | two or more consequetive such branches we can | |
2668 | create a trie of the EXACT's contents and stich | |
2669 | it in place. If the sequence represents all of | |
2670 | the branches we eliminate the whole thing and | |
2671 | replace it with a single TRIE. If it is a | |
2672 | subsequence then we need to stitch it in. This | |
2673 | means the first branch has to remain, and needs | |
2674 | to be repointed at the item on the branch chain | |
2675 | following the last branch optimized. This could | |
2676 | be either a BRANCH, in which case the | |
2677 | subsequence is internal, or it could be the | |
2678 | item following the branch sequence in which | |
2679 | case the subsequence is at the end. | |
2680 | ||
2681 | */ | |
2682 | ||
2683 | /* dont use tail as the end marker for this traverse */ | |
2684 | for ( cur = startbranch ; cur != scan ; cur = regnext( cur ) ) { | |
2685 | regnode * const noper = NEXTOPER( cur ); | |
b515a41d | 2686 | #if defined(DEBUGGING) || defined(NOJUMPTRIE) |
8aa23a47 | 2687 | regnode * const noper_next = regnext( noper ); |
b515a41d YO |
2688 | #endif |
2689 | ||
8aa23a47 YO |
2690 | DEBUG_OPTIMISE_r({ |
2691 | regprop(RExC_rx, mysv, cur); | |
2692 | PerlIO_printf( Perl_debug_log, "%*s- %s (%d)", | |
2693 | (int)depth * 2 + 2,"", SvPV_nolen_const( mysv ), REG_NODE_NUM(cur) ); | |
2694 | ||
2695 | regprop(RExC_rx, mysv, noper); | |
2696 | PerlIO_printf( Perl_debug_log, " -> %s", | |
2697 | SvPV_nolen_const(mysv)); | |
2698 | ||
2699 | if ( noper_next ) { | |
2700 | regprop(RExC_rx, mysv, noper_next ); | |
2701 | PerlIO_printf( Perl_debug_log,"\t=> %s\t", | |
2702 | SvPV_nolen_const(mysv)); | |
2703 | } | |
2704 | PerlIO_printf( Perl_debug_log, "(First==%d,Last==%d,Cur==%d)\n", | |
2705 | REG_NODE_NUM(first), REG_NODE_NUM(last), REG_NODE_NUM(cur) ); | |
2706 | }); | |
2707 | if ( (((first && optype!=NOTHING) ? OP( noper ) == optype | |
2708 | : PL_regkind[ OP( noper ) ] == EXACT ) | |
2709 | || OP(noper) == NOTHING ) | |
786e8c11 | 2710 | #ifdef NOJUMPTRIE |
8aa23a47 | 2711 | && noper_next == tail |
786e8c11 | 2712 | #endif |
8aa23a47 YO |
2713 | && count < U16_MAX) |
2714 | { | |
2715 | count++; | |
2716 | if ( !first || optype == NOTHING ) { | |
2717 | if (!first) first = cur; | |
2718 | optype = OP( noper ); | |
2719 | } else { | |
2720 | last = cur; | |
2721 | } | |
2722 | } else { | |
2723 | if ( last ) { | |
2724 | make_trie( pRExC_state, | |
2725 | startbranch, first, cur, tail, count, | |
2726 | optype, depth+1 ); | |
2727 | } | |
2728 | if ( PL_regkind[ OP( noper ) ] == EXACT | |
786e8c11 | 2729 | #ifdef NOJUMPTRIE |
8aa23a47 | 2730 | && noper_next == tail |
786e8c11 | 2731 | #endif |
8aa23a47 YO |
2732 | ){ |
2733 | count = 1; | |
2734 | first = cur; | |
2735 | optype = OP( noper ); | |
2736 | } else { | |
2737 | count = 0; | |
2738 | first = NULL; | |
2739 | optype = 0; | |
2740 | } | |
2741 | last = NULL; | |
2742 | } | |
2743 | } | |
2744 | DEBUG_OPTIMISE_r({ | |
2745 | regprop(RExC_rx, mysv, cur); | |
2746 | PerlIO_printf( Perl_debug_log, | |
2747 | "%*s- %s (%d) <SCAN FINISHED>\n", (int)depth * 2 + 2, | |
2748 | "", SvPV_nolen_const( mysv ),REG_NODE_NUM(cur)); | |
2749 | ||
2750 | }); | |
2751 | if ( last ) { | |
2752 | made= make_trie( pRExC_state, startbranch, first, scan, tail, count, optype, depth+1 ); | |
3dab1dad | 2753 | #ifdef TRIE_STUDY_OPT |
8aa23a47 YO |
2754 | if ( ((made == MADE_EXACT_TRIE && |
2755 | startbranch == first) | |
2756 | || ( first_non_open == first )) && | |
2757 | depth==0 ) { | |
2758 | flags |= SCF_TRIE_RESTUDY; | |
2759 | if ( startbranch == first | |
2760 | && scan == tail ) | |
2761 | { | |
2762 | RExC_seen &=~REG_TOP_LEVEL_BRANCHES; | |
2763 | } | |
2764 | } | |
3dab1dad | 2765 | #endif |
8aa23a47 YO |
2766 | } |
2767 | } | |
2768 | ||
2769 | } /* do trie */ | |
2770 | ||
653099ff | 2771 | } |
8aa23a47 YO |
2772 | else if ( code == BRANCHJ ) { /* single branch is optimized. */ |
2773 | scan = NEXTOPER(NEXTOPER(scan)); | |
2774 | } else /* single branch is optimized. */ | |
2775 | scan = NEXTOPER(scan); | |
2776 | continue; | |
2777 | } else if (OP(scan) == SUSPEND || OP(scan) == GOSUB || OP(scan) == GOSTART) { | |
2778 | scan_frame *newframe = NULL; | |
2779 | I32 paren; | |
2780 | regnode *start; | |
2781 | regnode *end; | |
2782 | ||
2783 | if (OP(scan) != SUSPEND) { | |
2784 | /* set the pointer */ | |
2785 | if (OP(scan) == GOSUB) { | |
2786 | paren = ARG(scan); | |
2787 | RExC_recurse[ARG2L(scan)] = scan; | |
2788 | start = RExC_open_parens[paren-1]; | |
2789 | end = RExC_close_parens[paren-1]; | |
2790 | } else { | |
2791 | paren = 0; | |
f8fc2ecf | 2792 | start = RExC_rxi->program + 1; |
8aa23a47 YO |
2793 | end = RExC_opend; |
2794 | } | |
2795 | if (!recursed) { | |
2796 | Newxz(recursed, (((RExC_npar)>>3) +1), U8); | |
2797 | SAVEFREEPV(recursed); | |
2798 | } | |
2799 | if (!PAREN_TEST(recursed,paren+1)) { | |
2800 | PAREN_SET(recursed,paren+1); | |
2801 | Newx(newframe,1,scan_frame); | |
2802 | } else { | |
2803 | if (flags & SCF_DO_SUBSTR) { | |
304ee84b | 2804 | SCAN_COMMIT(pRExC_state,data,minlenp); |
8aa23a47 YO |
2805 | data->longest = &(data->longest_float); |
2806 | } | |
2807 | is_inf = is_inf_internal = 1; | |
2808 | if (flags & SCF_DO_STCLASS_OR) /* Allow everything */ | |
2809 | cl_anything(pRExC_state, data->start_class); | |
2810 | flags &= ~SCF_DO_STCLASS; | |
2811 | } | |
2812 | } else { | |
2813 | Newx(newframe,1,scan_frame); | |
2814 | paren = stopparen; | |
2815 | start = scan+2; | |
2816 | end = regnext(scan); | |
2817 | } | |
2818 | if (newframe) { | |
2819 | assert(start); | |
2820 | assert(end); | |
2821 | SAVEFREEPV(newframe); | |
2822 | newframe->next = regnext(scan); | |
2823 | newframe->last = last; | |
2824 | newframe->stop = stopparen; | |
2825 | newframe->prev = frame; | |
2826 | ||
2827 | frame = newframe; | |
2828 | scan = start; | |
2829 | stopparen = paren; | |
2830 | last = end; | |
2831 | ||
2832 | continue; | |
2833 | } | |
2834 | } | |
2835 | else if (OP(scan) == EXACT) { | |
2836 | I32 l = STR_LEN(scan); | |
2837 | UV uc; | |
2838 | if (UTF) { | |
2839 | const U8 * const s = (U8*)STRING(scan); | |
2840 | l = utf8_length(s, s + l); | |
2841 | uc = utf8_to_uvchr(s, NULL); | |
2842 | } else { | |
2843 | uc = *((U8*)STRING(scan)); | |
2844 | } | |
2845 | min += l; | |
2846 | if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */ | |
2847 | /* The code below prefers earlier match for fixed | |
2848 | offset, later match for variable offset. */ | |
2849 | if (data->last_end == -1) { /* Update the start info. */ | |
2850 | data->last_start_min = data->pos_min; | |
2851 | data->last_start_max = is_inf | |
2852 | ? I32_MAX : data->pos_min + data->pos_delta; | |
b515a41d | 2853 | } |
8aa23a47 YO |
2854 | sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan)); |
2855 | if (UTF) | |
2856 | SvUTF8_on(data->last_found); | |
2857 | { | |
2858 | SV * const sv = data->last_found; | |
2859 | MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? | |
2860 | mg_find(sv, PERL_MAGIC_utf8) : NULL; | |
2861 | if (mg && mg->mg_len >= 0) | |
2862 | mg->mg_len += utf8_length((U8*)STRING(scan), | |
2863 | (U8*)STRING(scan)+STR_LEN(scan)); | |
b515a41d | 2864 | } |
8aa23a47 YO |
2865 | data->last_end = data->pos_min + l; |
2866 | data->pos_min += l; /* As in the first entry. */ | |
2867 | data->flags &= ~SF_BEFORE_EOL; | |
2868 | } | |
2869 | if (flags & SCF_DO_STCLASS_AND) { | |
2870 | /* Check whether it is compatible with what we know already! */ | |
2871 | int compat = 1; | |
2872 | ||
2873 | if (uc >= 0x100 || | |
2874 | (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE)) | |
2875 | && !ANYOF_BITMAP_TEST(data->start_class, uc) | |
2876 | && (!(data->start_class->flags & ANYOF_FOLD) | |
2877 | || !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc]))) | |
2878 | ) | |
2879 | compat = 0; | |
2880 | ANYOF_CLASS_ZERO(data->start_class); | |
2881 | ANYOF_BITMAP_ZERO(data->start_class); | |
2882 | if (compat) | |
2883 | ANYOF_BITMAP_SET(data->start_class, uc); | |
2884 | data->start_class->flags &= ~ANYOF_EOS; | |
2885 | if (uc < 0x100) | |
2886 | data->start_class->flags &= ~ANYOF_UNICODE_ALL; | |
2887 | } | |
2888 | else if (flags & SCF_DO_STCLASS_OR) { | |
2889 | /* false positive possible if the class is case-folded */ | |
2890 | if (uc < 0x100) | |
2891 | ANYOF_BITMAP_SET(data->start_class, uc); | |
2892 | else | |
2893 | data->start_class->flags |= ANYOF_UNICODE_ALL; | |
2894 | data->start_class->flags &= ~ANYOF_EOS; | |
2895 | cl_and(data->start_class, and_withp); | |
2896 | } | |
2897 | flags &= ~SCF_DO_STCLASS; | |
2898 | } | |
2899 | else if (PL_regkind[OP(scan)] == EXACT) { /* But OP != EXACT! */ | |
2900 | I32 l = STR_LEN(scan); | |
2901 | UV uc = *((U8*)STRING(scan)); | |
2902 | ||
2903 | /* Search for fixed substrings supports EXACT only. */ | |
2904 | if (flags & SCF_DO_SUBSTR) { | |
2905 | assert(data); | |
304ee84b | 2906 | SCAN_COMMIT(pRExC_state, data, minlenp); |
8aa23a47 YO |
2907 | } |
2908 | if (UTF) { | |
2909 | const U8 * const s = (U8 *)STRING(scan); | |
2910 | l = utf8_length(s, s + l); | |
2911 | uc = utf8_to_uvchr(s, NULL); | |
2912 | } | |
2913 | min += l; | |
2914 | if (flags & SCF_DO_SUBSTR) | |
2915 | data->pos_min += l; | |
2916 | if (flags & SCF_DO_STCLASS_AND) { | |
2917 | /* Check whether it is compatible with what we know already! */ | |
2918 | int compat = 1; | |
2919 | ||
2920 | if (uc >= 0x100 || | |
2921 | (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE)) | |
2922 | && !ANYOF_BITMAP_TEST(data->start_class, uc) | |
2923 | && !ANYOF_BITMAP_TEST(data->start_class, PL_fold[uc]))) | |
2924 | compat = 0; | |
2925 | ANYOF_CLASS_ZERO(data->start_class); | |
2926 | ANYOF_BITMAP_ZERO(data->start_class); | |
2927 | if (compat) { | |
2928 | ANYOF_BITMAP_SET(data->start_class, uc); | |
653099ff | 2929 | data->start_class->flags &= ~ANYOF_EOS; |
8aa23a47 YO |
2930 | data->start_class->flags |= ANYOF_FOLD; |
2931 | if (OP(scan) == EXACTFL) | |
2932 | data->start_class->flags |= ANYOF_LOCALE; | |
653099ff | 2933 | } |
8aa23a47 YO |
2934 | } |
2935 | else if (flags & SCF_DO_STCLASS_OR) { | |
2936 | if (data->start_class->flags & ANYOF_FOLD) { | |
2937 | /* false positive possible if the class is case-folded. | |
2938 | Assume that the locale settings are the same... */ | |
1aa99e6b IH |
2939 | if (uc < 0x100) |
2940 | ANYOF_BITMAP_SET(data->start_class, uc); | |
653099ff GS |
2941 | data->start_class->flags &= ~ANYOF_EOS; |
2942 | } | |
8aa23a47 | 2943 | cl_and(data->start_class, and_withp); |
653099ff | 2944 | } |
8aa23a47 YO |
2945 | flags &= ~SCF_DO_STCLASS; |
2946 | } | |
2947 | else if (strchr((const char*)PL_varies,OP(scan))) { | |
2948 | I32 mincount, maxcount, minnext, deltanext, fl = 0; | |
2949 | I32 f = flags, pos_before = 0; | |
2950 | regnode * const oscan = scan; | |
2951 | struct regnode_charclass_class this_class; | |
2952 | struct regnode_charclass_class *oclass = NULL; | |
2953 | I32 next_is_eval = 0; | |
2954 | ||
2955 | switch (PL_regkind[OP(scan)]) { | |
2956 | case WHILEM: /* End of (?:...)* . */ | |
2957 | scan = NEXTOPER(scan); | |
2958 | goto finish; | |
2959 | case PLUS: | |
2960 | if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) { | |
2961 | next = NEXTOPER(scan); | |
2962 | if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) { | |
2963 | mincount = 1; | |
2964 | maxcount = REG_INFTY; | |
2965 | next = regnext(scan); | |
2966 | scan = NEXTOPER(scan); | |
2967 | goto do_curly; | |
2968 | } | |
2969 | } | |
2970 | if (flags & SCF_DO_SUBSTR) | |
2971 | data->pos_min++; | |
2972 | min++; | |
2973 | /* Fall through. */ | |
2974 | case STAR: | |
2975 | if (flags & SCF_DO_STCLASS) { | |
2976 | mincount = 0; | |
2977 | maxcount = REG_INFTY; | |
2978 | next = regnext(scan); | |
2979 | scan = NEXTOPER(scan); | |
2980 | goto do_curly; | |
2981 | } | |
2982 | is_inf = is_inf_internal = 1; | |
2983 | scan = regnext(scan); | |
c277df42 | 2984 | if (flags & SCF_DO_SUBSTR) { |
304ee84b | 2985 | SCAN_COMMIT(pRExC_state, data, minlenp); /* Cannot extend fixed substrings */ |
8aa23a47 | 2986 | data->longest = &(data->longest_float); |
c277df42 | 2987 | } |
8aa23a47 YO |
2988 | goto optimize_curly_tail; |
2989 | case CURLY: | |
2990 | if (stopparen>0 && (OP(scan)==CURLYN || OP(scan)==CURLYM) | |
2991 | && (scan->flags == stopparen)) | |
2992 | { | |
2993 | mincount = 1; | |
2994 | maxcount = 1; | |
2995 | } else { | |
2996 | mincount = ARG1(scan); | |
2997 | maxcount = ARG2(scan); | |
653099ff | 2998 | } |
8aa23a47 YO |
2999 | next = regnext(scan); |
3000 | if (OP(scan) == CURLYX) { | |
3001 | I32 lp = (data ? *(data->last_closep) : 0); | |
3002 | scan->flags = ((lp <= (I32)U8_MAX) ? (U8)lp : U8_MAX); | |
653099ff | 3003 | } |
8aa23a47 YO |
3004 | scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS; |
3005 | next_is_eval = (OP(scan) == EVAL); | |
3006 | do_curly: | |
3007 | if (flags & SCF_DO_SUBSTR) { | |
304ee84b | 3008 | if (mincount == 0) SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot extend fixed substrings */ |
8aa23a47 | 3009 | pos_before = data->pos_min; |
b45f050a | 3010 | } |
8aa23a47 YO |
3011 | if (data) { |
3012 | fl = data->flags; | |
3013 | data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL); | |
3014 | if (is_inf) | |
3015 | data->flags |= SF_IS_INF; | |
3016 | } | |
3017 | if (flags & SCF_DO_STCLASS) { | |
3018 | cl_init(pRExC_state, &this_class); | |
3019 | oclass = data->start_class; | |
3020 | data->start_class = &this_class; | |
3021 | f |= SCF_DO_STCLASS_AND; | |
3022 | f &= ~SCF_DO_STCLASS_OR; | |
3023 | } | |
3024 | /* These are the cases when once a subexpression | |
3025 | fails at a particular position, it cannot succeed | |
3026 | even after backtracking at the enclosing scope. | |
3027 | ||
3028 | XXXX what if minimal match and we are at the | |
3029 | initial run of {n,m}? */ | |
3030 | if ((mincount != maxcount - 1) && (maxcount != REG_INFTY)) | |
3031 | f &= ~SCF_WHILEM_VISITED_POS; | |
b45f050a | 3032 | |
8aa23a47 YO |
3033 | /* This will finish on WHILEM, setting scan, or on NULL: */ |
3034 | minnext = study_chunk(pRExC_state, &scan, minlenp, &deltanext, | |
3035 | last, data, stopparen, recursed, NULL, | |
3036 | (mincount == 0 | |
3037 | ? (f & ~SCF_DO_SUBSTR) : f),depth+1); | |
b515a41d | 3038 | |
8aa23a47 YO |
3039 | if (flags & SCF_DO_STCLASS) |
3040 | data->start_class = oclass; | |
3041 | if (mincount == 0 || minnext == 0) { | |
3042 | if (flags & SCF_DO_STCLASS_OR) { | |
3043 | cl_or(pRExC_state, data->start_class, &this_class); | |
3044 | } | |
3045 | else if (flags & SCF_DO_STCLASS_AND) { | |
3046 | /* Switch to OR mode: cache the old value of | |
3047 | * data->start_class */ | |
3048 | INIT_AND_WITHP; | |
3049 | StructCopy(data->start_class, and_withp, | |
3050 | struct regnode_charclass_class); | |
3051 | flags &= ~SCF_DO_STCLASS_AND; | |
3052 | StructCopy(&this_class, data->start_class, | |
3053 | struct regnode_charclass_class); | |
3054 | flags |= SCF_DO_STCLASS_OR; | |
3055 | data->start_class->flags |= ANYOF_EOS; | |
3056 | } | |
3057 | } else { /* Non-zero len */ | |
3058 | if (flags & SCF_DO_STCLASS_OR) { | |
3059 | cl_or(pRExC_state, data->start_class, &this_class); | |
3060 | cl_and(data->start_class, and_withp); | |
3061 | } | |
3062 | else if (flags & SCF_DO_STCLASS_AND) | |
3063 | cl_and(data->start_class, &this_class); | |
3064 | flags &= ~SCF_DO_STCLASS; | |
3065 | } | |
3066 | if (!scan) /* It was not CURLYX, but CURLY. */ | |
3067 | scan = next; | |
3068 | if ( /* ? quantifier ok, except for (?{ ... }) */ | |
3069 | (next_is_eval || !(mincount == 0 && maxcount == 1)) | |
3070 | && (minnext == 0) && (deltanext == 0) | |
3071 | && data && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)) | |
3072 | && maxcount <= REG_INFTY/3 /* Complement check for big count */ | |
3073 | && ckWARN(WARN_REGEXP)) | |
3074 | { | |
3075 | vWARN(RExC_parse, | |
3076 | "Quantifier unexpected on zero-length expression"); | |
3077 | } | |
3078 | ||
3079 | min += minnext * mincount; | |
3080 | is_inf_internal |= ((maxcount == REG_INFTY | |
3081 | && (minnext + deltanext) > 0) | |
3082 | || deltanext == I32_MAX); | |
3083 | is_inf |= is_inf_internal; | |
3084 | delta += (minnext + deltanext) * maxcount - minnext * mincount; | |
3085 | ||
3086 | /* Try powerful optimization CURLYX => CURLYN. */ | |
3087 | if ( OP(oscan) == CURLYX && data | |
3088 | && data->flags & SF_IN_PAR | |
3089 | && !(data->flags & SF_HAS_EVAL) | |
3090 | && !deltanext && minnext == 1 ) { | |
3091 | /* Try to optimize to CURLYN. */ | |
3092 | regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; | |
3093 | regnode * const nxt1 = nxt; | |
497b47a8 | 3094 | #ifdef DEBUGGING |
8aa23a47 | 3095 | regnode *nxt2; |
497b47a8 | 3096 | #endif |
c277df42 | 3097 | |
8aa23a47 YO |
3098 | /* Skip open. */ |
3099 | nxt = regnext(nxt); | |
3100 | if (!strchr((const char*)PL_simple,OP(nxt)) | |
3101 | && !(PL_regkind[OP(nxt)] == EXACT | |
3102 | && STR_LEN(nxt) == 1)) | |
3103 | goto nogo; | |
497b47a8 | 3104 | #ifdef DEBUGGING |
8aa23a47 | 3105 | nxt2 = nxt; |
497b47a8 | 3106 | #endif |
8aa23a47 YO |
3107 | nxt = regnext(nxt); |
3108 | if (OP(nxt) != CLOSE) | |
3109 | goto nogo; | |
3110 | if (RExC_open_parens) { | |
3111 | RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/ | |
3112 | RExC_close_parens[ARG(nxt1)-1]=nxt+2; /*close->while*/ | |
3113 | } | |
3114 | /* Now we know that nxt2 is the only contents: */ | |
3115 | oscan->flags = (U8)ARG(nxt); | |
3116 | OP(oscan) = CURLYN; | |
3117 | OP(nxt1) = NOTHING; /* was OPEN. */ | |
40d049e4 | 3118 | |
c277df42 | 3119 | #ifdef DEBUGGING |
8aa23a47 YO |
3120 | OP(nxt1 + 1) = OPTIMIZED; /* was count. */ |
3121 | NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */ | |
3122 | NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */ | |
3123 | OP(nxt) = OPTIMIZED; /* was CLOSE. */ | |
3124 | OP(nxt + 1) = OPTIMIZED; /* was count. */ | |
3125 | NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */ | |
b81d288d | 3126 | #endif |
8aa23a47 YO |
3127 | } |
3128 | nogo: | |
3129 | ||
3130 | /* Try optimization CURLYX => CURLYM. */ | |
3131 | if ( OP(oscan) == CURLYX && data | |
3132 | && !(data->flags & SF_HAS_PAR) | |
3133 | && !(data->flags & SF_HAS_EVAL) | |
3134 | && !deltanext /* atom is fixed width */ | |
3135 | && minnext != 0 /* CURLYM can't handle zero width */ | |
3136 | ) { | |
3137 | /* XXXX How to optimize if data == 0? */ | |
3138 | /* Optimize to a simpler form. */ | |
3139 | regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */ | |
3140 | regnode *nxt2; | |
3141 | ||
3142 | OP(oscan) = CURLYM; | |
3143 | while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/ | |
3144 | && (OP(nxt2) != WHILEM)) | |
3145 | nxt = nxt2; | |
3146 | OP(nxt2) = SUCCEED; /* Whas WHILEM */ | |
3147 | /* Need to optimize away parenths. */ | |
3148 | if (data->flags & SF_IN_PAR) { | |
3149 | /* Set the parenth number. */ | |
3150 | regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/ | |
3151 | ||
3152 | if (OP(nxt) != CLOSE) | |
3153 | FAIL("Panic opt close"); | |
3154 | oscan->flags = (U8)ARG(nxt); | |
3155 | if (RExC_open_parens) { | |
3156 | RExC_open_parens[ARG(nxt1)-1]=oscan; /*open->CURLYM*/ | |
3157 | RExC_close_parens[ARG(nxt1)-1]=nxt2+1; /*close->NOTHING*/ | |
40d049e4 | 3158 | } |
8aa23a47 YO |
3159 | OP(nxt1) = OPTIMIZED; /* was OPEN. */ |
3160 | OP(nxt) = OPTIMIZED; /* was CLOSE. */ | |
40d049e4 | 3161 | |
c277df42 | 3162 | #ifdef DEBUGGING |
8aa23a47 YO |
3163 | OP(nxt1 + 1) = OPTIMIZED; /* was count. */ |
3164 | OP(nxt + 1) = OPTIMIZED; /* was count. */ | |
3165 | NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */ | |
3166 | NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */ | |
b81d288d | 3167 | #endif |
c277df42 | 3168 | #if 0 |
8aa23a47 YO |
3169 | while ( nxt1 && (OP(nxt1) != WHILEM)) { |
3170 | regnode *nnxt = regnext(nxt1); | |
3171 | ||
3172 | if (nnxt == nxt) { | |
3173 | if (reg_off_by_arg[OP(nxt1)]) | |
3174 | ARG_SET(nxt1, nxt2 - nxt1); | |
3175 | else if (nxt2 - nxt1 < U16_MAX) | |
3176 | NEXT_OFF(nxt1) = nxt2 - nxt1; | |
3177 | else | |
3178 | OP(nxt) = NOTHING; /* Cannot beautify */ | |
c277df42 | 3179 | } |
8aa23a47 | 3180 | nxt1 = nnxt; |
c277df42 | 3181 | } |
5d1c421c | 3182 | #endif |
8aa23a47 YO |
3183 | /* Optimize again: */ |
3184 | study_chunk(pRExC_state, &nxt1, minlenp, &deltanext, nxt, | |
3185 | NULL, stopparen, recursed, NULL, 0,depth+1); | |
3186 | } | |
3187 | else | |
3188 | oscan->flags = 0; | |
3189 | } | |
3190 | else if ((OP(oscan) == CURLYX) | |
3191 | && (flags & SCF_WHILEM_VISITED_POS) | |
3192 | /* See the comment on a similar expression above. | |
3193 | However, this time it not a subexpression | |
3194 | we care about, but the expression itself. */ | |
3195 | && (maxcount == REG_INFTY) | |
3196 | && data && ++data->whilem_c < 16) { | |
3197 | /* This stays as CURLYX, we can put the count/of pair. */ | |
3198 | /* Find WHILEM (as in regexec.c) */ | |
3199 | regnode *nxt = oscan + NEXT_OFF(oscan); | |
3200 | ||
3201 | if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */ | |
3202 | nxt += ARG(nxt); | |
3203 | PREVOPER(nxt)->flags = (U8)(data->whilem_c | |
3204 | | (RExC_whilem_seen << 4)); /* On WHILEM */ | |
3205 | } | |
3206 | if (data && fl & (SF_HAS_PAR|SF_IN_PAR)) | |
3207 | pars++; | |
3208 | if (flags & SCF_DO_SUBSTR) { | |
3209 | SV *last_str = NULL; | |
3210 | int counted = mincount != 0; | |
a0ed51b3 | 3211 | |
8aa23a47 YO |
3212 | if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */ |
3213 | #if defined(SPARC64_GCC_WORKAROUND) | |
3214 | I32 b = 0; | |
3215 | STRLEN l = 0; | |
3216 | const char *s = NULL; | |
3217 | I32 old = 0; | |
b515a41d | 3218 | |
8aa23a47 YO |
3219 | if (pos_before >= data->last_start_min) |
3220 | b = pos_before; | |
3221 | else | |
3222 | b = data->last_start_min; | |
b515a41d | 3223 | |
8aa23a47 YO |
3224 | l = 0; |
3225 | s = SvPV_const(data->last_found, l); | |
3226 | old = b - data->last_start_min; | |
3227 | ||
3228 | #else | |
3229 | I32 b = pos_before >= data->last_start_min | |
3230 | ? pos_before : data->last_start_min; | |
3231 | STRLEN l; | |
3232 | const char * const s = SvPV_const(data->last_found, l); | |
3233 | I32 old = b - data->last_start_min; | |
3234 | #endif | |
3235 | ||
3236 | if (UTF) | |
3237 | old = utf8_hop((U8*)s, old) - (U8*)s; | |
3238 | ||
3239 | l -= old; | |
3240 | /* Get the added string: */ | |
3241 | last_str = newSVpvn(s + old, l); | |
3242 | if (UTF) | |
3243 | SvUTF8_on(last_str); | |
3244 | if (deltanext == 0 && pos_before == b) { | |
3245 | /* What was added is a constant string */ | |
3246 | if (mincount > 1) { | |
3247 | SvGROW(last_str, (mincount * l) + 1); | |
3248 | repeatcpy(SvPVX(last_str) + l, | |
3249 | SvPVX_const(last_str), l, mincount - 1); | |
3250 | SvCUR_set(last_str, SvCUR(last_str) * mincount); | |
3251 | /* Add additional parts. */ | |
3252 | SvCUR_set(data->last_found, | |
3253 | SvCUR(data->last_found) - l); | |
3254 | sv_catsv(data->last_found, last_str); | |
3255 | { | |
3256 | SV * sv = data->last_found; | |
3257 | MAGIC *mg = | |
3258 | SvUTF8(sv) && SvMAGICAL(sv) ? | |
3259 | mg_find(sv, PERL_MAGIC_utf8) : NULL; | |
3260 | if (mg && mg->mg_len >= 0) | |
3261 | mg->mg_len += CHR_SVLEN(last_str); | |
b515a41d | 3262 | } |
8aa23a47 | 3263 | data->last_end += l * (mincount - 1); |
b515a41d | 3264 | } |
8aa23a47 YO |
3265 | } else { |
3266 | /* start offset must point into the last copy */ | |
3267 | data->last_start_min += minnext * (mincount - 1); | |
3268 | data->last_start_max += is_inf ? I32_MAX | |
3269 | : (maxcount - 1) * (minnext + data->pos_delta); | |
3270 | } | |
c277df42 | 3271 | } |
8aa23a47 YO |
3272 | /* It is counted once already... */ |
3273 | data->pos_min += minnext * (mincount - counted); | |
3274 | data->pos_delta += - counted * deltanext + | |
3275 | (minnext + deltanext) * maxcount - minnext * mincount; | |
3276 | if (mincount != maxcount) { | |
3277 | /* Cannot extend fixed substrings found inside | |
3278 | the group. */ | |
304ee84b | 3279 | SCAN_COMMIT(pRExC_state,data,minlenp); |
8aa23a47 YO |
3280 | if (mincount && last_str) { |
3281 | SV * const sv = data->last_found; | |
3282 | MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? | |
3283 | mg_find(sv, PERL_MAGIC_utf8) : NULL; | |
3284 | ||
3285 | if (mg) | |
3286 | mg->mg_len = -1; | |
3287 | sv_setsv(sv, last_str); | |
3288 | data->last_end = data->pos_min; | |
3289 | data->last_start_min = | |
3290 | data->pos_min - CHR_SVLEN(last_str); | |
3291 | data->last_start_max = is_inf | |
3292 | ? I32_MAX | |
3293 | : data->pos_min + data->pos_delta | |
3294 | - CHR_SVLEN(last_str); | |
3295 | } | |
3296 | data->longest = &(data->longest_float); | |
3297 | } | |
3298 | SvREFCNT_dec(last_str); | |
c277df42 | 3299 | } |
8aa23a47 YO |
3300 | if (data && (fl & SF_HAS_EVAL)) |
3301 | data->flags |= SF_HAS_EVAL; | |
3302 | optimize_curly_tail: | |
3303 | if (OP(oscan) != CURLYX) { | |
3304 | while (PL_regkind[OP(next = regnext(oscan))] == NOTHING | |
3305 | && NEXT_OFF(next)) | |
3306 | NEXT_OFF(oscan) += NEXT_OFF(next); | |
3307 | } | |
3308 | continue; | |
3309 | default: /* REF and CLUMP only? */ | |
3310 | if (flags & SCF_DO_SUBSTR) { | |
304ee84b | 3311 | SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */ |
8aa23a47 YO |
3312 | data->longest = &(data->longest_float); |
3313 | } | |
3314 | is_inf = is_inf_internal = 1; | |
3315 | if (flags & SCF_DO_STCLASS_OR) | |
3316 | cl_anything(pRExC_state, data->start_class); | |
3317 | flags &= ~SCF_DO_STCLASS; | |
3318 | break; | |
c277df42 | 3319 | } |
8aa23a47 YO |
3320 | } |
3321 | else if (strchr((const char*)PL_simple,OP(scan))) { | |
3322 | int value = 0; | |
653099ff | 3323 | |
8aa23a47 | 3324 | if (flags & SCF_DO_SUBSTR) { |
304ee84b | 3325 | SCAN_COMMIT(pRExC_state,data,minlenp); |
8aa23a47 YO |
3326 | data->pos_min++; |
3327 | } | |
3328 | min++; | |
3329 | if (flags & SCF_DO_STCLASS) { | |
3330 | data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */ | |
b515a41d | 3331 | |
8aa23a47 YO |
3332 | /* Some of the logic below assumes that switching |
3333 | locale on will only add false positives. */ | |
3334 | switch (PL_regkind[OP(scan)]) { | |
3335 | case SANY: | |
3336 | default: | |
3337 | do_default: | |
3338 | /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */ | |
3339 | if (flags & SCF_DO_STCLASS_OR) /* Allow everything */ | |
3340 | cl_anything(pRExC_state, data->start_class); | |
3341 | break; | |
3342 | case REG_ANY: | |
3343 | if (OP(scan) == SANY) | |
3344 | goto do_default; | |
3345 | if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */ | |
3346 | value = (ANYOF_BITMAP_TEST(data->start_class,'\n') | |
3347 | || (data->start_class->flags & ANYOF_CLASS)); | |
3348 | cl_anything(pRExC_state, data->start_class); | |
653099ff | 3349 | } |
8aa23a47 YO |
3350 | if (flags & SCF_DO_STCLASS_AND || !value) |
3351 | ANYOF_BITMAP_CLEAR(data->start_class,'\n'); | |
3352 | break; | |
3353 | case ANYOF: | |
3354 | if (flags & SCF_DO_STCLASS_AND) | |
3355 | cl_and(data->start_class, | |
3356 | (struct regnode_charclass_class*)scan); | |
653099ff | 3357 | else |
8aa23a47 YO |
3358 | cl_or(pRExC_state, data->start_class, |
3359 | (struct regnode_charclass_class*)scan); | |
3360 | break; | |
3361 | case ALNUM: | |
3362 | if (flags & SCF_DO_STCLASS_AND) { | |
3363 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
3364 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM); | |
3365 | for (value = 0; value < 256; value++) | |
3366 | if (!isALNUM(value)) | |
3367 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
3368 | } | |
653099ff | 3369 | } |
8aa23a47 YO |
3370 | else { |
3371 | if (data->start_class->flags & ANYOF_LOCALE) | |
3372 | ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM); | |
3373 | else { | |
3374 | for (value = 0; value < 256; value++) | |
3375 | if (isALNUM(value)) | |
3376 | ANYOF_BITMAP_SET(data->start_class, value); | |
653099ff | 3377 | } |
8aa23a47 YO |
3378 | } |
3379 | break; | |
3380 | case ALNUML: | |
3381 | if (flags & SCF_DO_STCLASS_AND) { | |
3382 | if (data->start_class->flags & ANYOF_LOCALE) | |
3383 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM); | |
3384 | } | |
3385 | else { | |
3386 | ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM); | |
3387 | data->start_class->flags |= ANYOF_LOCALE; | |
3388 | } | |
3389 | break; | |
3390 | case NALNUM: | |
3391 | if (flags & SCF_DO_STCLASS_AND) { | |
3392 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
3393 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM); | |
3394 | for (value = 0; value < 256; value++) | |
3395 | if (isALNUM(value)) | |
3396 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
653099ff GS |
3397 | } |
3398 | } | |
8aa23a47 YO |
3399 | else { |
3400 | if (data->start_class->flags & ANYOF_LOCALE) | |
3401 | ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM); | |
3402 | else { | |
3403 | for (value = 0; value < 256; value++) | |
3404 | if (!isALNUM(value)) | |
3405 | ANYOF_BITMAP_SET(data->start_class, value); | |
3406 | } | |
653099ff | 3407 | } |
8aa23a47 YO |
3408 | break; |
3409 | case NALNUML: | |
3410 | if (flags & SCF_DO_STCLASS_AND) { | |
3411 | if (data->start_class->flags & ANYOF_LOCALE) | |
3412 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM); | |
653099ff | 3413 | } |
8aa23a47 YO |
3414 | else { |
3415 | data->start_class->flags |= ANYOF_LOCALE; | |
3416 | ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM); | |
3417 | } | |
3418 | break; | |
3419 | case SPACE: | |
3420 | if (flags & SCF_DO_STCLASS_AND) { | |
3421 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
3422 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE); | |
3423 | for (value = 0; value < 256; value++) | |
3424 | if (!isSPACE(value)) | |
3425 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
653099ff GS |
3426 | } |
3427 | } | |
8aa23a47 YO |
3428 | else { |
3429 | if (data->start_class->flags & ANYOF_LOCALE) | |
3430 | ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE); | |
3431 | else { | |
3432 | for (value = 0; value < 256; value++) | |
3433 | if (isSPACE(value)) | |
3434 | ANYOF_BITMAP_SET(data->start_class, value); | |
3435 | } | |
653099ff | 3436 | } |
8aa23a47 YO |
3437 | break; |
3438 | case SPACEL: | |
3439 | if (flags & SCF_DO_STCLASS_AND) { | |
3440 | if (data->start_class->flags & ANYOF_LOCALE) | |
3441 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE); | |
3442 | } | |
3443 | else { | |
3444 | data->start_class->flags |= ANYOF_LOCALE; | |
3445 | ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE); | |
3446 | } | |
3447 | break; | |
3448 | case NSPACE: | |
3449 | if (flags & SCF_DO_STCLASS_AND) { | |
3450 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
3451 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE); | |
3452 | for (value = 0; value < 256; value++) | |
3453 | if (isSPACE(value)) | |
3454 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
653099ff | 3455 | } |
8aa23a47 YO |
3456 | } |
3457 | else { | |
3458 | if (data->start_class->flags & ANYOF_LOCALE) | |
3459 | ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE); | |
3460 | else { | |
3461 | for (value = 0; value < 256; value++) | |
3462 | if (!isSPACE(value)) | |
3463 | ANYOF_BITMAP_SET(data->start_class, value); | |
653099ff GS |
3464 | } |
3465 | } | |
8aa23a47 YO |
3466 | break; |
3467 | case NSPACEL: | |
3468 | if (flags & SCF_DO_STCLASS_AND) { | |
3469 | if (data->start_class->flags & ANYOF_LOCALE) { | |
3470 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE); | |
3471 | for (value = 0; value < 256; value++) | |
3472 | if (!isSPACE(value)) | |
3473 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
3474 | } | |
653099ff | 3475 | } |
8aa23a47 YO |
3476 | else { |
3477 | data->start_class->flags |= ANYOF_LOCALE; | |
3478 | ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE); | |
3479 | } | |
3480 | break; | |
3481 | case DIGIT: | |
3482 | if (flags & SCF_DO_STCLASS_AND) { | |
3483 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT); | |
3484 | for (value = 0; value < 256; value++) | |
3485 | if (!isDIGIT(value)) | |
3486 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
3487 | } | |
3488 | else { | |
3489 | if (data->start_class->flags & ANYOF_LOCALE) | |
3490 | ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT); | |
3491 | else { | |
3492 | for (value = 0; value < 256; value++) | |
3493 | if (isDIGIT(value)) | |
3494 | ANYOF_BITMAP_SET(data->start_class, value); | |
3495 | } | |
3496 | } | |
3497 | break; | |
3498 | case NDIGIT: | |
3499 | if (flags & SCF_DO_STCLASS_AND) { | |
3500 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT); | |
3501 | for (value = 0; value < 256; value++) | |
3502 | if (isDIGIT(value)) | |
3503 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
3504 | } | |
3505 | else { | |
3506 | if (data->start_class->flags & ANYOF_LOCALE) | |
3507 | ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT); | |
3508 | else { | |
3509 | for (value = 0; value < 256; value++) | |
3510 | if (!isDIGIT(value)) | |
3511 | ANYOF_BITMAP_SET(data->start_class, value); | |
653099ff GS |
3512 | } |
3513 | } | |
8aa23a47 YO |
3514 | break; |
3515 | } | |
3516 | if (flags & SCF_DO_STCLASS_OR) | |
3517 | cl_and(data->start_class, and_withp); | |
3518 | flags &= ~SCF_DO_STCLASS; | |
3519 | } | |
3520 | } | |
3521 | else if (PL_regkind[OP(scan)] == EOL && flags & SCF_DO_SUBSTR) { | |
3522 | data->flags |= (OP(scan) == MEOL | |
3523 | ? SF_BEFORE_MEOL | |
3524 | : SF_BEFORE_SEOL); | |
3525 | } | |
3526 | else if ( PL_regkind[OP(scan)] == BRANCHJ | |
3527 | /* Lookbehind, or need to calculate parens/evals/stclass: */ | |
3528 | && (scan->flags || data || (flags & SCF_DO_STCLASS)) | |
3529 | && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) { | |
3530 | if ( !PERL_ENABLE_POSITIVE_ASSERTION_STUDY | |
3531 | || OP(scan) == UNLESSM ) | |
3532 | { | |
3533 | /* Negative Lookahead/lookbehind | |
3534 | In this case we can't do fixed string optimisation. | |
3535 | */ | |
1de06328 | 3536 | |
8aa23a47 YO |
3537 | I32 deltanext, minnext, fake = 0; |
3538 | regnode *nscan; | |
3539 | struct regnode_charclass_class intrnl; | |
3540 | int f = 0; | |
1de06328 | 3541 | |
8aa23a47 YO |
3542 | data_fake.flags = 0; |
3543 | if (data) { | |
3544 | data_fake.whilem_c = data->whilem_c; | |
3545 | data_fake.last_closep = data->last_closep; | |
c277df42 | 3546 | } |
8aa23a47 YO |
3547 | else |
3548 | data_fake.last_closep = &fake; | |
58e23c8d | 3549 | data_fake.pos_delta = delta; |
8aa23a47 YO |
3550 | if ( flags & SCF_DO_STCLASS && !scan->flags |
3551 | && OP(scan) == IFMATCH ) { /* Lookahead */ | |
3552 | cl_init(pRExC_state, &intrnl); | |
3553 | data_fake.start_class = &intrnl; | |
3554 | f |= SCF_DO_STCLASS_AND; | |
3555 | } | |
3556 | if (flags & SCF_WHILEM_VISITED_POS) | |
3557 | f |= SCF_WHILEM_VISITED_POS; | |
3558 | next = regnext(scan); | |
3559 | nscan = NEXTOPER(NEXTOPER(scan)); | |
3560 | minnext = study_chunk(pRExC_state, &nscan, minlenp, &deltanext, | |
3561 | last, &data_fake, stopparen, recursed, NULL, f, depth+1); | |
3562 | if (scan->flags) { | |
3563 | if (deltanext) { | |
58e23c8d | 3564 | FAIL("Variable length lookbehind not implemented"); |
8aa23a47 YO |
3565 | } |
3566 | else if (minnext > (I32)U8_MAX) { | |
58e23c8d | 3567 | FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX); |
8aa23a47 YO |
3568 | } |
3569 | scan->flags = (U8)minnext; | |
3570 | } | |
3571 | if (data) { | |
3572 | if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
3573 | pars++; | |
3574 | if (data_fake.flags & SF_HAS_EVAL) | |
3575 | data->flags |= SF_HAS_EVAL; | |
3576 | data->whilem_c = data_fake.whilem_c; | |
3577 | } | |
3578 | if (f & SCF_DO_STCLASS_AND) { | |
3579 | const int was = (data->start_class->flags & ANYOF_EOS); | |
3580 | ||
3581 | cl_and(data->start_class, &intrnl); | |
3582 | if (was) | |
3583 | data->start_class->flags |= ANYOF_EOS; | |
3584 | } | |
cb434fcc | 3585 | } |
8aa23a47 YO |
3586 | #if PERL_ENABLE_POSITIVE_ASSERTION_STUDY |
3587 | else { | |
3588 | /* Positive Lookahead/lookbehind | |
3589 | In this case we can do fixed string optimisation, | |
3590 | but we must be careful about it. Note in the case of | |
3591 | lookbehind the positions will be offset by the minimum | |
3592 | length of the pattern, something we won't know about | |
3593 | until after the recurse. | |
3594 | */ | |
3595 | I32 deltanext, fake = 0; | |
3596 | regnode *nscan; | |
3597 | struct regnode_charclass_class intrnl; | |
3598 | int f = 0; | |
3599 | /* We use SAVEFREEPV so that when the full compile | |
3600 | is finished perl will clean up the allocated | |
3601 | minlens when its all done. This was we don't | |
3602 | have to worry about freeing them when we know | |
3603 | they wont be used, which would be a pain. | |
3604 | */ | |
3605 | I32 *minnextp; | |
3606 | Newx( minnextp, 1, I32 ); | |
3607 | SAVEFREEPV(minnextp); | |
3608 | ||
3609 | if (data) { | |
3610 | StructCopy(data, &data_fake, scan_data_t); | |
3611 | if ((flags & SCF_DO_SUBSTR) && data->last_found) { | |
3612 | f |= SCF_DO_SUBSTR; | |
3613 | if (scan->flags) | |
304ee84b | 3614 | SCAN_COMMIT(pRExC_state, &data_fake,minlenp); |
8aa23a47 YO |
3615 | data_fake.last_found=newSVsv(data->last_found); |
3616 | } | |
3617 | } | |
3618 | else | |
3619 | data_fake.last_closep = &fake; | |
3620 | data_fake.flags = 0; | |
58e23c8d | 3621 | data_fake.pos_delta = delta; |
8aa23a47 YO |
3622 | if (is_inf) |
3623 | data_fake.flags |= SF_IS_INF; | |
3624 | if ( flags & SCF_DO_STCLASS && !scan->flags | |
3625 | && OP(scan) == IFMATCH ) { /* Lookahead */ | |
3626 | cl_init(pRExC_state, &intrnl); | |
3627 | data_fake.start_class = &intrnl; | |
3628 | f |= SCF_DO_STCLASS_AND; | |
3629 | } | |
3630 | if (flags & SCF_WHILEM_VISITED_POS) | |
3631 | f |= SCF_WHILEM_VISITED_POS; | |
3632 | next = regnext(scan); | |
3633 | nscan = NEXTOPER(NEXTOPER(scan)); | |
3634 | ||
3635 | *minnextp = study_chunk(pRExC_state, &nscan, minnextp, &deltanext, | |
3636 | last, &data_fake, stopparen, recursed, NULL, f,depth+1); | |
3637 | if (scan->flags) { | |
3638 | if (deltanext) { | |
58e23c8d | 3639 | FAIL("Variable length lookbehind not implemented"); |
8aa23a47 YO |
3640 | } |
3641 | else if (*minnextp > (I32)U8_MAX) { | |
58e23c8d | 3642 | FAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX); |
8aa23a47 YO |
3643 | } |
3644 | scan->flags = (U8)*minnextp; | |
3645 | } | |
3646 | ||
3647 | *minnextp += min; | |
3648 | ||
3649 | if (f & SCF_DO_STCLASS_AND) { | |
3650 | const int was = (data->start_class->flags & ANYOF_EOS); | |
3651 | ||
3652 | cl_and(data->start_class, &intrnl); | |
3653 | if (was) | |
3654 | data->start_class->flags |= ANYOF_EOS; | |
3655 | } | |
3656 | if (data) { | |
3657 | if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
3658 | pars++; | |
3659 | if (data_fake.flags & SF_HAS_EVAL) | |
3660 | data->flags |= SF_HAS_EVAL; | |
3661 | data->whilem_c = data_fake.whilem_c; | |
3662 | if ((flags & SCF_DO_SUBSTR) && data_fake.last_found) { | |
3663 | if (RExC_rx->minlen<*minnextp) | |
3664 | RExC_rx->minlen=*minnextp; | |
304ee84b | 3665 | SCAN_COMMIT(pRExC_state, &data_fake, minnextp); |
8aa23a47 YO |
3666 | SvREFCNT_dec(data_fake.last_found); |
3667 | ||
3668 | if ( data_fake.minlen_fixed != minlenp ) | |
3669 | { | |
3670 | data->offset_fixed= data_fake.offset_fixed; | |
3671 | data->minlen_fixed= data_fake.minlen_fixed; | |
3672 | data->lookbehind_fixed+= scan->flags; | |
3673 | } | |
3674 | if ( data_fake.minlen_float != minlenp ) | |
3675 | { | |
3676 | data->minlen_float= data_fake.minlen_float; | |
3677 | data->offset_float_min=data_fake.offset_float_min; | |
3678 | data->offset_float_max=data_fake.offset_float_max; | |
3679 | data->lookbehind_float+= scan->flags; | |
3680 | } | |
3681 | } | |
3682 | } | |
3683 | ||
3684 | ||
40d049e4 | 3685 | } |
8aa23a47 YO |
3686 | #endif |
3687 | } | |
3688 | else if (OP(scan) == OPEN) { | |
3689 | if (stopparen != (I32)ARG(scan)) | |
3690 | pars++; | |
3691 | } | |
3692 | else if (OP(scan) == CLOSE) { | |
3693 | if (stopparen == (I32)ARG(scan)) { | |
3694 | break; | |
3695 | } | |
3696 | if ((I32)ARG(scan) == is_par) { | |
3697 | next = regnext(scan); | |
b515a41d | 3698 | |
8aa23a47 YO |
3699 | if ( next && (OP(next) != WHILEM) && next < last) |
3700 | is_par = 0; /* Disable optimization */ | |
40d049e4 | 3701 | } |
8aa23a47 YO |
3702 | if (data) |
3703 | *(data->last_closep) = ARG(scan); | |
3704 | } | |
3705 | else if (OP(scan) == EVAL) { | |
c277df42 IZ |
3706 | if (data) |
3707 | data->flags |= SF_HAS_EVAL; | |
8aa23a47 YO |
3708 | } |
3709 | else if ( PL_regkind[OP(scan)] == ENDLIKE ) { | |
3710 | if (flags & SCF_DO_SUBSTR) { | |
304ee84b | 3711 | SCAN_COMMIT(pRExC_state,data,minlenp); |
8aa23a47 | 3712 | flags &= ~SCF_DO_SUBSTR; |
40d049e4 | 3713 | } |
8aa23a47 YO |
3714 | if (data && OP(scan)==ACCEPT) { |
3715 | data->flags |= SCF_SEEN_ACCEPT; | |
3716 | if (stopmin > min) | |
3717 | stopmin = min; | |
e2e6a0f1 | 3718 | } |
8aa23a47 YO |
3719 | } |
3720 | else if (OP(scan) == LOGICAL && scan->flags == 2) /* Embedded follows */ | |
3721 | { | |
0f5d15d6 | 3722 | if (flags & SCF_DO_SUBSTR) { |
304ee84b | 3723 | SCAN_COMMIT(pRExC_state,data,minlenp); |
0f5d15d6 IZ |
3724 | data->longest = &(data->longest_float); |
3725 | } | |
3726 | is_inf = is_inf_internal = 1; | |
653099ff | 3727 | if (flags & SCF_DO_STCLASS_OR) /* Allow everything */ |
830247a4 | 3728 | cl_anything(pRExC_state, data->start_class); |
96776eda | 3729 | flags &= ~SCF_DO_STCLASS; |
8aa23a47 | 3730 | } |
58e23c8d | 3731 | else if (OP(scan) == GPOS) { |
bbe252da | 3732 | if (!(RExC_rx->extflags & RXf_GPOS_FLOAT) && |
58e23c8d YO |
3733 | !(delta || is_inf || (data && data->pos_delta))) |
3734 | { | |
bbe252da YO |
3735 | if (!(RExC_rx->extflags & RXf_ANCH) && (flags & SCF_DO_SUBSTR)) |
3736 | RExC_rx->extflags |= RXf_ANCH_GPOS; | |
58e23c8d YO |
3737 | if (RExC_rx->gofs < (U32)min) |
3738 | RExC_rx->gofs = min; | |
3739 | } else { | |
bbe252da | 3740 | RExC_rx->extflags |= RXf_GPOS_FLOAT; |
58e23c8d YO |
3741 | RExC_rx->gofs = 0; |
3742 | } | |
3743 | } | |
786e8c11 | 3744 | #ifdef TRIE_STUDY_OPT |
40d049e4 | 3745 | #ifdef FULL_TRIE_STUDY |
8aa23a47 YO |
3746 | else if (PL_regkind[OP(scan)] == TRIE) { |
3747 | /* NOTE - There is similar code to this block above for handling | |
3748 | BRANCH nodes on the initial study. If you change stuff here | |
3749 | check there too. */ | |
3750 | regnode *trie_node= scan; | |
3751 | regnode *tail= regnext(scan); | |
f8fc2ecf | 3752 | reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ]; |
8aa23a47 YO |
3753 | I32 max1 = 0, min1 = I32_MAX; |
3754 | struct regnode_charclass_class accum; | |
3755 | ||
3756 | if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */ | |
304ee84b | 3757 | SCAN_COMMIT(pRExC_state, data,minlenp); /* Cannot merge strings after this. */ |
8aa23a47 YO |
3758 | if (flags & SCF_DO_STCLASS) |
3759 | cl_init_zero(pRExC_state, &accum); | |
3760 | ||
3761 | if (!trie->jump) { | |
3762 | min1= trie->minlen; | |
3763 | max1= trie->maxlen; | |
3764 | } else { | |
3765 | const regnode *nextbranch= NULL; | |
3766 | U32 word; | |
3767 | ||
3768 | for ( word=1 ; word <= trie->wordcount ; word++) | |
3769 | { | |
3770 | I32 deltanext=0, minnext=0, f = 0, fake; | |
3771 | struct regnode_charclass_class this_class; | |
3772 | ||
3773 | data_fake.flags = 0; | |
3774 | if (data) { | |
3775 | data_fake.whilem_c = data->whilem_c; | |
3776 | data_fake.last_closep = data->last_closep; | |
3777 | } | |
3778 | else | |
3779 | data_fake.last_closep = &fake; | |
58e23c8d | 3780 | data_fake.pos_delta = delta; |
8aa23a47 YO |
3781 | if (flags & SCF_DO_STCLASS) { |
3782 | cl_init(pRExC_state, &this_class); | |
3783 | data_fake.start_class = &this_class; | |
3784 | f = SCF_DO_STCLASS_AND; | |
3785 | } | |
3786 | if (flags & SCF_WHILEM_VISITED_POS) | |
3787 | f |= SCF_WHILEM_VISITED_POS; | |
3788 | ||
3789 | if (trie->jump[word]) { | |
3790 | if (!nextbranch) | |
3791 | nextbranch = trie_node + trie->jump[0]; | |
3792 | scan= trie_node + trie->jump[word]; | |
3793 | /* We go from the jump point to the branch that follows | |
3794 | it. Note this means we need the vestigal unused branches | |
3795 | even though they arent otherwise used. | |
3796 | */ | |
3797 | minnext = study_chunk(pRExC_state, &scan, minlenp, | |
3798 | &deltanext, (regnode *)nextbranch, &data_fake, | |
3799 | stopparen, recursed, NULL, f,depth+1); | |
3800 | } | |
3801 | if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH) | |
3802 | nextbranch= regnext((regnode*)nextbranch); | |
3803 | ||
3804 | if (min1 > (I32)(minnext + trie->minlen)) | |
3805 | min1 = minnext + trie->minlen; | |
3806 | if (max1 < (I32)(minnext + deltanext + trie->maxlen)) | |
3807 | max1 = minnext + deltanext + trie->maxlen; | |
3808 | if (deltanext == I32_MAX) | |
3809 | is_inf = is_inf_internal = 1; | |
3810 | ||
3811 | if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
3812 | pars++; | |
3813 | if (data_fake.flags & SCF_SEEN_ACCEPT) { | |
3814 | if ( stopmin > min + min1) | |
3815 | stopmin = min + min1; | |
3816 | flags &= ~SCF_DO_SUBSTR; | |
3817 | if (data) | |
3818 | data->flags |= SCF_SEEN_ACCEPT; | |
3819 | } | |
3820 | if (data) { | |
3821 | if (data_fake.flags & SF_HAS_EVAL) | |
3822 | data->flags |= SF_HAS_EVAL; | |
3823 | data->whilem_c = data_fake.whilem_c; | |
3824 | } | |
3825 | if (flags & SCF_DO_STCLASS) | |
3826 | cl_or(pRExC_state, &accum, &this_class); | |
3827 | } | |
3828 | } | |
3829 | if (flags & SCF_DO_SUBSTR) { | |
3830 | data->pos_min += min1; | |
3831 | data->pos_delta += max1 - min1; | |
3832 | if (max1 != min1 || is_inf) | |
3833 | data->longest = &(data->longest_float); | |
3834 | } | |
3835 | min += min1; | |
3836 | delta += max1 - min1; | |
3837 | if (flags & SCF_DO_STCLASS_OR) { | |
3838 | cl_or(pRExC_state, data->start_class, &accum); | |
3839 | if (min1) { | |
3840 | cl_and(data->start_class, and_withp); | |
3841 | flags &= ~SCF_DO_STCLASS; | |
3842 | } | |
3843 | } | |
3844 | else if (flags & SCF_DO_STCLASS_AND) { | |
3845 | if (min1) { | |
3846 | cl_and(data->start_class, &accum); | |
3847 | flags &= ~SCF_DO_STCLASS; | |
3848 | } | |
3849 | else { | |
3850 | /* Switch to OR mode: cache the old value of | |
3851 | * data->start_class */ | |
3852 | INIT_AND_WITHP; | |
3853 | StructCopy(data->start_class, and_withp, | |
3854 | struct regnode_charclass_class); | |
3855 | flags &= ~SCF_DO_STCLASS_AND; | |
3856 | StructCopy(&accum, data->start_class, | |
3857 | struct regnode_charclass_class); | |
3858 | flags |= SCF_DO_STCLASS_OR; | |
3859 | data->start_class->flags |= ANYOF_EOS; | |
3860 | } | |
3861 | } | |
3862 | scan= tail; | |
3863 | continue; | |
3864 | } | |
786e8c11 | 3865 | #else |
8aa23a47 | 3866 | else if (PL_regkind[OP(scan)] == TRIE) { |
f8fc2ecf | 3867 | reg_trie_data *trie = (reg_trie_data*)RExC_rxi->data->data[ ARG(scan) ]; |
8aa23a47 YO |
3868 | U8*bang=NULL; |
3869 | ||
3870 | min += trie->minlen; | |
3871 | delta += (trie->maxlen - trie->minlen); | |
3872 | flags &= ~SCF_DO_STCLASS; /* xxx */ | |
3873 | if (flags & SCF_DO_SUBSTR) { | |
304ee84b | 3874 | SCAN_COMMIT(pRExC_state,data,minlenp); /* Cannot expect anything... */ |
8aa23a47 YO |
3875 | data->pos_min += trie->minlen; |
3876 | data->pos_delta += (trie->maxlen - trie->minlen); | |
3877 | if (trie->maxlen != trie->minlen) | |
3878 | data->longest = &(data->longest_float); | |
3879 | } | |
3880 | if (trie->jump) /* no more substrings -- for now /grr*/ | |
3881 | flags &= ~SCF_DO_SUBSTR; | |
b515a41d | 3882 | } |
8aa23a47 YO |
3883 | #endif /* old or new */ |
3884 | #endif /* TRIE_STUDY_OPT */ | |
3885 | /* Else: zero-length, ignore. */ | |
3886 | scan = regnext(scan); | |
3887 | } | |
3888 | if (frame) { | |
3889 | last = frame->last; | |
3890 | scan = frame->next; | |
3891 | stopparen = frame->stop; | |
3892 | frame = frame->prev; | |
3893 | goto fake_study_recurse; | |
c277df42 IZ |
3894 | } |
3895 | ||
3896 | finish: | |
8aa23a47 | 3897 | assert(!frame); |
304ee84b | 3898 | DEBUG_STUDYDATA("pre-fin:",data,depth); |
8aa23a47 | 3899 | |
c277df42 | 3900 | *scanp = scan; |
aca2d497 | 3901 | *deltap = is_inf_internal ? I32_MAX : delta; |
b81d288d | 3902 | if (flags & SCF_DO_SUBSTR && is_inf) |
c277df42 | 3903 | data->pos_delta = I32_MAX - data->pos_min; |
786e8c11 | 3904 | if (is_par > (I32)U8_MAX) |
c277df42 IZ |
3905 | is_par = 0; |
3906 | if (is_par && pars==1 && data) { | |
3907 | data->flags |= SF_IN_PAR; | |
3908 | data->flags &= ~SF_HAS_PAR; | |
a0ed51b3 LW |
3909 | } |
3910 | else if (pars && data) { | |
c277df42 IZ |
3911 | data->flags |= SF_HAS_PAR; |
3912 | data->flags &= ~SF_IN_PAR; | |
3913 | } | |
653099ff | 3914 | if (flags & SCF_DO_STCLASS_OR) |
40d049e4 | 3915 | cl_and(data->start_class, and_withp); |
786e8c11 YO |
3916 | if (flags & SCF_TRIE_RESTUDY) |
3917 | data->flags |= SCF_TRIE_RESTUDY; | |
1de06328 | 3918 | |
304ee84b | 3919 | DEBUG_STUDYDATA("post-fin:",data,depth); |
1de06328 | 3920 | |
e2e6a0f1 | 3921 | return min < stopmin ? min : stopmin; |
c277df42 IZ |
3922 | } |
3923 | ||
2eccd3b2 NC |
3924 | STATIC U32 |
3925 | S_add_data(RExC_state_t *pRExC_state, U32 n, const char *s) | |
c277df42 | 3926 | { |
4a4e7719 NC |
3927 | U32 count = RExC_rxi->data ? RExC_rxi->data->count : 0; |
3928 | ||
3929 | Renewc(RExC_rxi->data, | |
3930 | sizeof(*RExC_rxi->data) + sizeof(void*) * (count + n - 1), | |
3931 | char, struct reg_data); | |
3932 | if(count) | |
f8fc2ecf | 3933 | Renew(RExC_rxi->data->what, count + n, U8); |
4a4e7719 | 3934 | else |
f8fc2ecf | 3935 | Newx(RExC_rxi->data->what, n, U8); |
4a4e7719 NC |
3936 | RExC_rxi->data->count = count + n; |
3937 | Copy(s, RExC_rxi->data->what + count, n, U8); | |
3938 | return count; | |
c277df42 IZ |
3939 | } |
3940 | ||
f8149455 | 3941 | /*XXX: todo make this not included in a non debugging perl */ |
76234dfb | 3942 | #ifndef PERL_IN_XSUB_RE |
d88dccdf | 3943 | void |
864dbfa3 | 3944 | Perl_reginitcolors(pTHX) |
d88dccdf | 3945 | { |
97aff369 | 3946 | dVAR; |
1df70142 | 3947 | const char * const s = PerlEnv_getenv("PERL_RE_COLORS"); |
d88dccdf | 3948 | if (s) { |
1df70142 AL |
3949 | char *t = savepv(s); |
3950 | int i = 0; | |
3951 | PL_colors[0] = t; | |
d88dccdf | 3952 | while (++i < 6) { |
1df70142 AL |
3953 | t = strchr(t, '\t'); |
3954 | if (t) { | |
3955 | *t = '\0'; | |
3956 | PL_colors[i] = ++t; | |
d88dccdf IZ |
3957 | } |
3958 | else | |
1df70142 | 3959 | PL_colors[i] = t = (char *)""; |
d88dccdf IZ |
3960 | } |
3961 | } else { | |
1df70142 | 3962 | int i = 0; |
b81d288d | 3963 | while (i < 6) |
06b5626a | 3964 | PL_colors[i++] = (char *)""; |
d88dccdf IZ |
3965 | } |
3966 | PL_colorset = 1; | |
3967 | } | |
76234dfb | 3968 | #endif |
8615cb43 | 3969 | |
07be1b83 | 3970 | |
786e8c11 YO |
3971 | #ifdef TRIE_STUDY_OPT |
3972 | #define CHECK_RESTUDY_GOTO \ | |
3973 | if ( \ | |
3974 | (data.flags & SCF_TRIE_RESTUDY) \ | |
3975 | && ! restudied++ \ | |
3976 | ) goto reStudy | |
3977 | #else | |
3978 | #define CHECK_RESTUDY_GOTO | |
3979 | #endif | |
f9f4320a | 3980 | |
a687059c | 3981 | /* |
e50aee73 | 3982 | - pregcomp - compile a regular expression into internal code |
a687059c LW |
3983 | * |
3984 | * We can't allocate space until we know how big the compiled form will be, | |
3985 | * but we can't compile it (and thus know how big it is) until we've got a | |
3986 | * place to put the code. So we cheat: we compile it twice, once with code | |
3987 | * generation turned off and size counting turned on, and once "for real". | |
3988 | * This also means that we don't allocate space until we are sure that the | |
3989 | * thing really will compile successfully, and we never have to move the | |
3990 | * code and thus invalidate pointers into it. (Note that it has to be in | |
3991 | * one piece because free() must be able to free it all.) [NB: not true in perl] | |
3992 | * | |
3993 | * Beware that the optimization-preparation code in here knows about some | |
3994 | * of the structure of the compiled regexp. [I'll say.] | |
3995 | */ | |
b9b4dddf YO |
3996 | |
3997 | ||
3998 | ||
f9f4320a | 3999 | #ifndef PERL_IN_XSUB_RE |
f9f4320a YO |
4000 | #define RE_ENGINE_PTR &PL_core_reg_engine |
4001 | #else | |
f9f4320a YO |
4002 | extern const struct regexp_engine my_reg_engine; |
4003 | #define RE_ENGINE_PTR &my_reg_engine | |
4004 | #endif | |
6d5c990f RGS |
4005 | |
4006 | #ifndef PERL_IN_XSUB_RE | |
a687059c | 4007 | regexp * |
864dbfa3 | 4008 | Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm) |
a687059c | 4009 | { |
97aff369 | 4010 | dVAR; |
6d5c990f | 4011 | HV * const table = GvHV(PL_hintgv); |
f9f4320a YO |
4012 | /* Dispatch a request to compile a regexp to correct |
4013 | regexp engine. */ | |
f9f4320a YO |
4014 | if (table) { |
4015 | SV **ptr= hv_fetchs(table, "regcomp", FALSE); | |
6d5c990f | 4016 | GET_RE_DEBUG_FLAGS_DECL; |
1e2e3d02 | 4017 | if (ptr && SvIOK(*ptr) && SvIV(*ptr)) { |
f9f4320a YO |
4018 | const regexp_engine *eng=INT2PTR(regexp_engine*,SvIV(*ptr)); |
4019 | DEBUG_COMPILE_r({ | |
8d8756e7 | 4020 | PerlIO_printf(Perl_debug_log, "Using engine %"UVxf"\n", |
f9f4320a YO |
4021 | SvIV(*ptr)); |
4022 | }); | |
f2f78491 | 4023 | return CALLREGCOMP_ENG(eng, exp, xend, pm); |
f9f4320a | 4024 | } |
b9b4dddf | 4025 | } |
2a5d9b1d RGS |
4026 | return Perl_re_compile(aTHX_ exp, xend, pm); |
4027 | } | |
6d5c990f | 4028 | #endif |
2a5d9b1d RGS |
4029 | |
4030 | regexp * | |
4031 | Perl_re_compile(pTHX_ char *exp, char *xend, PMOP *pm) | |
4032 | { | |
4033 | dVAR; | |
a0d0e21e | 4034 | register regexp *r; |
f8fc2ecf | 4035 | register regexp_internal *ri; |
c277df42 | 4036 | regnode *scan; |
c277df42 | 4037 | regnode *first; |
a0d0e21e | 4038 | I32 flags; |
a0d0e21e LW |
4039 | I32 minlen = 0; |
4040 | I32 sawplus = 0; | |
4041 | I32 sawopen = 0; | |
2c2d71f5 | 4042 | scan_data_t data; |
830247a4 | 4043 | RExC_state_t RExC_state; |
be8e71aa | 4044 | RExC_state_t * const pRExC_state = &RExC_state; |
07be1b83 YO |
4045 | #ifdef TRIE_STUDY_OPT |
4046 | int restudied= 0; | |
4047 | RExC_state_t copyRExC_state; | |
4048 | #endif | |
2a5d9b1d | 4049 | GET_RE_DEBUG_FLAGS_DECL; |
6d5c990f RGS |
4050 | DEBUG_r(if (!PL_colorset) reginitcolors()); |
4051 | ||
a0d0e21e | 4052 | if (exp == NULL) |
c277df42 | 4053 | FAIL("NULL regexp argument"); |
a0d0e21e | 4054 | |
a5961de5 | 4055 | RExC_utf8 = pm->op_pmdynflags & PMdf_CMP_UTF8; |
a0ed51b3 | 4056 | |
5cfc7842 | 4057 | RExC_precomp = exp; |
a3621e74 | 4058 | DEBUG_COMPILE_r({ |
ab3bbdeb YO |
4059 | SV *dsv= sv_newmortal(); |
4060 | RE_PV_QUOTED_DECL(s, RExC_utf8, | |
4061 | dsv, RExC_precomp, (xend - exp), 60); | |
4062 | PerlIO_printf(Perl_debug_log, "%sCompiling REx%s %s\n", | |
4063 | PL_colors[4],PL_colors[5],s); | |
a5961de5 | 4064 | }); |
e2509266 | 4065 | RExC_flags = pm->op_pmflags; |
830247a4 | 4066 | RExC_sawback = 0; |
bbce6d69 | 4067 | |
830247a4 IZ |
4068 | RExC_seen = 0; |
4069 | RExC_seen_zerolen = *exp == '^' ? -1 : 0; | |
4070 | RExC_seen_evals = 0; | |
4071 | RExC_extralen = 0; | |
c277df42 | 4072 | |
bbce6d69 | 4073 | /* First pass: determine size, legality. */ |
830247a4 | 4074 | RExC_parse = exp; |
fac92740 | 4075 | RExC_start = exp; |
830247a4 IZ |
4076 | RExC_end = xend; |
4077 | RExC_naughty = 0; | |
4078 | RExC_npar = 1; | |
e2e6a0f1 | 4079 | RExC_nestroot = 0; |
830247a4 IZ |
4080 | RExC_size = 0L; |
4081 | RExC_emit = &PL_regdummy; | |
4082 | RExC_whilem_seen = 0; | |
fc8cd66c | 4083 | RExC_charnames = NULL; |
40d049e4 YO |
4084 | RExC_open_parens = NULL; |
4085 | RExC_close_parens = NULL; | |
4086 | RExC_opend = NULL; | |
81714fb9 | 4087 | RExC_paren_names = NULL; |
1f1031fe YO |
4088 | #ifdef DEBUGGING |
4089 | RExC_paren_name_list = NULL; | |
4090 | #endif | |
40d049e4 YO |
4091 | RExC_recurse = NULL; |
4092 | RExC_recurse_count = 0; | |
81714fb9 | 4093 | |
85ddcde9 JH |
4094 | #if 0 /* REGC() is (currently) a NOP at the first pass. |
4095 | * Clever compilers notice this and complain. --jhi */ | |
830247a4 | 4096 | REGC((U8)REG_MAGIC, (char*)RExC_emit); |
85ddcde9 | 4097 | #endif |
3dab1dad YO |
4098 | DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "Starting first pass (sizing)\n")); |
4099 | if (reg(pRExC_state, 0, &flags,1) == NULL) { | |
c445ea15 | 4100 | RExC_precomp = NULL; |
a0d0e21e LW |
4101 | return(NULL); |
4102 | } | |
07be1b83 | 4103 | DEBUG_PARSE_r({ |
81714fb9 YO |
4104 | PerlIO_printf(Perl_debug_log, |
4105 | "Required size %"IVdf" nodes\n" | |
4106 | "Starting second pass (creation)\n", | |
4107 | (IV)RExC_size); | |
07be1b83 YO |
4108 | RExC_lastnum=0; |
4109 | RExC_lastparse=NULL; | |
4110 | }); | |
c277df42 IZ |
4111 | /* Small enough for pointer-storage convention? |
4112 | If extralen==0, this means that we will not need long jumps. */ | |
830247a4 IZ |
4113 | if (RExC_size >= 0x10000L && RExC_extralen) |
4114 | RExC_size += RExC_extralen; | |
c277df42 | 4115 | else |
830247a4 IZ |
4116 | RExC_extralen = 0; |
4117 | if (RExC_whilem_seen > 15) | |
4118 | RExC_whilem_seen = 15; | |
a0d0e21e | 4119 | |
f9f4320a YO |
4120 | /* Allocate space and zero-initialize. Note, the two step process |
4121 | of zeroing when in debug mode, thus anything assigned has to | |
4122 | happen after that */ | |
f8fc2ecf YO |
4123 | Newxz(r, 1, regexp); |
4124 | Newxc(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode), | |
4125 | char, regexp_internal); | |
4126 | if ( r == NULL || ri == NULL ) | |
b45f050a | 4127 | FAIL("Regexp out of space"); |
0f79a09d GS |
4128 | #ifdef DEBUGGING |
4129 | /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */ | |
f8fc2ecf | 4130 | Zero(ri, sizeof(regexp_internal) + (unsigned)RExC_size * sizeof(regnode), char); |
58e23c8d | 4131 | #else |
f8fc2ecf YO |
4132 | /* bulk initialize base fields with 0. */ |
4133 | Zero(ri, sizeof(regexp_internal), char); | |
0f79a09d | 4134 | #endif |
58e23c8d YO |
4135 | |
4136 | /* non-zero initialization begins here */ | |
f8fc2ecf | 4137 | RXi_SET( r, ri ); |
f9f4320a | 4138 | r->engine= RE_ENGINE_PTR; |
c277df42 | 4139 | r->refcnt = 1; |
bbce6d69 | 4140 | r->prelen = xend - exp; |
bbe252da | 4141 | r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME; |
bcdf7404 YO |
4142 | { |
4143 | bool has_k = ((r->extflags & RXf_PMf_KEEPCOPY) == RXf_PMf_KEEPCOPY); | |
4144 | bool has_minus = ((r->extflags & RXf_PMf_STD_PMMOD) != RXf_PMf_STD_PMMOD); | |
4145 | bool has_runon = ((RExC_seen & REG_SEEN_RUN_ON_COMMENT)==REG_SEEN_RUN_ON_COMMENT); | |
4146 | U16 reganch = (U16)((r->extflags & RXf_PMf_STD_PMMOD) >> 12); | |
4147 | const char *fptr = STD_PAT_MODS; /*"msix"*/ | |
4148 | char *p; | |
4149 | r->wraplen = r->prelen + has_minus + has_k + has_runon | |
4150 | + (sizeof(STD_PAT_MODS) - 1) | |
4151 | + (sizeof("(?:)") - 1); | |
4152 | ||
4153 | Newx(r->wrapped, r->wraplen, char ); | |
4154 | p = r->wrapped; | |
4155 | *p++='('; *p++='?'; | |
4156 | if (has_k) | |
4157 | *p++ = KEEPCOPY_PAT_MOD; /*'k'*/ | |
4158 | { | |
4159 | char *r = p + (sizeof(STD_PAT_MODS) - 1) + has_minus - 1; | |
4160 | char *colon = r + 1; | |
4161 | char ch; | |
4162 | ||
4163 | while((ch = *fptr++)) { | |
4164 | if(reganch & 1) | |
4165 | *p++ = ch; | |
4166 | else | |
4167 | *r-- = ch; | |
4168 | reganch >>= 1; | |
4169 | } | |
4170 | if(has_minus) { | |
4171 | *r = '-'; | |
4172 | p = colon; | |
4173 | } | |
4174 | } | |
4175 | ||
4176 | *p++=':'; | |
4177 | Copy(RExC_precomp, p, r->prelen, char); | |
4178 | r->precomp = p; | |
4179 | p += r->prelen; | |
4180 | if (has_runon) | |
4181 | *p++='\n'; | |
4182 | *p=')'; | |
bcdf7404 YO |
4183 | } |
4184 | ||
bbe252da | 4185 | r->intflags = 0; |
830247a4 | 4186 | r->nparens = RExC_npar - 1; /* set early to validate backrefs */ |
81714fb9 | 4187 | |
6bda09f9 | 4188 | if (RExC_seen & REG_SEEN_RECURSE) { |
40d049e4 YO |
4189 | Newxz(RExC_open_parens, RExC_npar,regnode *); |
4190 | SAVEFREEPV(RExC_open_parens); | |
4191 | Newxz(RExC_close_parens,RExC_npar,regnode *); | |
4192 | SAVEFREEPV(RExC_close_parens); | |
6bda09f9 YO |
4193 | } |
4194 | ||
4195 | /* Useful during FAIL. */ | |
7122b237 YO |
4196 | #ifdef RE_TRACK_PATTERN_OFFSETS |
4197 | Newxz(ri->u.offsets, 2*RExC_size+1, U32); /* MJD 20001228 */ | |
a3621e74 | 4198 | DEBUG_OFFSETS_r(PerlIO_printf(Perl_debug_log, |
2af232bd | 4199 | "%s %"UVuf" bytes for offset annotations.\n", |
7122b237 | 4200 | ri->u.offsets ? "Got" : "Couldn't get", |
392fbf5d | 4201 | (UV)((2*RExC_size+1) * sizeof(U32)))); |
7122b237 YO |
4202 | #endif |
4203 | SetProgLen(ri,RExC_size); | |
830247a4 | 4204 | RExC_rx = r; |
f8fc2ecf | 4205 | RExC_rxi = ri; |
bbce6d69 | 4206 | |
4207 | /* Second pass: emit code. */ | |
e2509266 | 4208 | RExC_flags = pm->op_pmflags; /* don't let top level (?i) bleed */ |
830247a4 IZ |
4209 | RExC_parse = exp; |
4210 | RExC_end = xend; | |
4211 | RExC_naughty = 0; | |
4212 | RExC_npar = 1; | |
f8fc2ecf YO |
4213 | RExC_emit_start = ri->program; |
4214 | RExC_emit = ri->program; | |
3b57cd43 YO |
4215 | RExC_emit_bound = ri->program + RExC_size + 1; |
4216 | ||
2cd61cdb | 4217 | /* Store the count of eval-groups for security checks: */ |
f8149455 | 4218 | RExC_rx->seen_evals = RExC_seen_evals; |
830247a4 | 4219 | REGC((U8)REG_MAGIC, (char*) RExC_emit++); |
3dab1dad | 4220 | if (reg(pRExC_state, 0, &flags,1) == NULL) |
a0d0e21e | 4221 | return(NULL); |
6bda09f9 | 4222 | |
07be1b83 YO |
4223 | /* XXXX To minimize changes to RE engine we always allocate |
4224 | 3-units-long substrs field. */ | |
4225 | Newx(r->substrs, 1, struct reg_substr_data); | |
40d049e4 YO |
4226 | if (RExC_recurse_count) { |
4227 | Newxz(RExC_recurse,RExC_recurse_count,regnode *); | |
4228 | SAVEFREEPV(RExC_recurse); | |
4229 | } | |
a0d0e21e | 4230 | |
07be1b83 | 4231 | reStudy: |
1de06328 | 4232 | r->minlen = minlen = sawplus = sawopen = 0; |
07be1b83 | 4233 | Zero(r->substrs, 1, struct reg_substr_data); |
a3621e74 | 4234 | |
07be1b83 YO |
4235 | #ifdef TRIE_STUDY_OPT |
4236 | if ( restudied ) { | |
5d458dd8 | 4237 | U32 seen=RExC_seen; |
07be1b83 | 4238 | DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log,"Restudying\n")); |
5d458dd8 YO |
4239 | |
4240 | RExC_state = copyRExC_state; | |
4241 | if (seen & REG_TOP_LEVEL_BRANCHES) | |
4242 | RExC_seen |= REG_TOP_LEVEL_BRANCHES; | |
4243 | else | |
4244 | RExC_seen &= ~REG_TOP_LEVEL_BRANCHES; | |
1de06328 | 4245 | if (data.last_found) { |
07be1b83 | 4246 | SvREFCNT_dec(data.longest_fixed); |
07be1b83 | 4247 | SvREFCNT_dec(data.longest_float); |
07be1b83 | 4248 | SvREFCNT_dec(data.last_found); |
1de06328 | 4249 | } |
40d049e4 | 4250 | StructCopy(&zero_scan_data, &data, scan_data_t); |
07be1b83 | 4251 | } else { |
40d049e4 | 4252 | StructCopy(&zero_scan_data, &data, scan_data_t); |
5d458dd8 | 4253 | copyRExC_state = RExC_state; |
07be1b83 | 4254 | } |
40d049e4 YO |
4255 | #else |
4256 | StructCopy(&zero_scan_data, &data, scan_data_t); | |
07be1b83 | 4257 | #endif |
fc8cd66c | 4258 | |
a0d0e21e | 4259 | /* Dig out information for optimizations. */ |
bbe252da | 4260 | r->extflags = pm->op_pmflags & RXf_PMf_COMPILETIME; /* Again? */ |
e2509266 | 4261 | pm->op_pmflags = RExC_flags; |
a0ed51b3 | 4262 | if (UTF) |
bbe252da | 4263 | r->extflags |= RXf_UTF8; /* Unicode in it? */ |
f8fc2ecf | 4264 | ri->regstclass = NULL; |
830247a4 | 4265 | if (RExC_naughty >= 10) /* Probably an expensive pattern. */ |
bbe252da | 4266 | r->intflags |= PREGf_NAUGHTY; |
f8fc2ecf | 4267 | scan = ri->program + 1; /* First BRANCH. */ |
2779dcf1 | 4268 | |
1de06328 YO |
4269 | /* testing for BRANCH here tells us whether there is "must appear" |
4270 | data in the pattern. If there is then we can use it for optimisations */ | |
eaf3ca90 | 4271 | if (!(RExC_seen & REG_TOP_LEVEL_BRANCHES)) { /* Only one top-level choice. */ |
c277df42 | 4272 | I32 fake; |
c5254dd6 | 4273 | STRLEN longest_float_length, longest_fixed_length; |
07be1b83 | 4274 | struct regnode_charclass_class ch_class; /* pointed to by data */ |
653099ff | 4275 | int stclass_flag; |
07be1b83 | 4276 | I32 last_close = 0; /* pointed to by data */ |
a0d0e21e LW |
4277 | |
4278 | first = scan; | |
c277df42 | 4279 | /* Skip introductions and multiplicators >= 1. */ |
a0d0e21e | 4280 | while ((OP(first) == OPEN && (sawopen = 1)) || |
653099ff | 4281 | /* An OR of *one* alternative - should not happen now. */ |
a0d0e21e | 4282 | (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) || |
07be1b83 YO |
4283 | /* for now we can't handle lookbehind IFMATCH*/ |
4284 | (OP(first) == IFMATCH && !first->flags) || | |
a0d0e21e LW |
4285 | (OP(first) == PLUS) || |
4286 | (OP(first) == MINMOD) || | |
653099ff | 4287 | /* An {n,m} with n>0 */ |
07be1b83 YO |
4288 | (PL_regkind[OP(first)] == CURLY && ARG1(first) > 0) ) |
4289 | { | |
786e8c11 | 4290 | |
a0d0e21e LW |
4291 | if (OP(first) == PLUS) |
4292 | sawplus = 1; | |
4293 | else | |
3dab1dad | 4294 | first += regarglen[OP(first)]; |
07be1b83 YO |
4295 | if (OP(first) == IFMATCH) { |
4296 | first = NEXTOPER(first); | |
4297 | first += EXTRA_STEP_2ARGS; | |
7c167cea | 4298 | } else /* XXX possible optimisation for /(?=)/ */ |
07be1b83 | 4299 | first = NEXTOPER(first); |
a687059c LW |
4300 | } |
4301 | ||
a0d0e21e LW |
4302 | /* Starting-point info. */ |
4303 | again: | |
786e8c11 | 4304 | DEBUG_PEEP("first:",first,0); |
07be1b83 | 4305 | /* Ignore EXACT as we deal with it later. */ |
3dab1dad | 4306 | if (PL_regkind[OP(first)] == EXACT) { |
1aa99e6b | 4307 | if (OP(first) == EXACT) |
6f207bd3 | 4308 | NOOP; /* Empty, get anchored substr later. */ |
1aa99e6b | 4309 | else if ((OP(first) == EXACTF || OP(first) == EXACTFL)) |
f8fc2ecf | 4310 | ri->regstclass = first; |
b3c9acc1 | 4311 | } |
07be1b83 | 4312 | #ifdef TRIE_STCLASS |
786e8c11 | 4313 | else if (PL_regkind[OP(first)] == TRIE && |
f8fc2ecf | 4314 | ((reg_trie_data *)ri->data->data[ ARG(first) ])->minlen>0) |
07be1b83 | 4315 | { |
786e8c11 | 4316 | regnode *trie_op; |
07be1b83 | 4317 | /* this can happen only on restudy */ |
786e8c11 | 4318 | if ( OP(first) == TRIE ) { |
c944940b | 4319 | struct regnode_1 *trieop = (struct regnode_1 *) |
446bd890 | 4320 | PerlMemShared_calloc(1, sizeof(struct regnode_1)); |
786e8c11 YO |
4321 | StructCopy(first,trieop,struct regnode_1); |
4322 | trie_op=(regnode *)trieop; | |
4323 | } else { | |
c944940b | 4324 | struct regnode_charclass *trieop = (struct regnode_charclass *) |
446bd890 | 4325 | PerlMemShared_calloc(1, sizeof(struct regnode_charclass)); |
786e8c11 YO |
4326 | StructCopy(first,trieop,struct regnode_charclass); |
4327 | trie_op=(regnode *)trieop; | |
4328 | } | |
1de06328 | 4329 | OP(trie_op)+=2; |
786e8c11 | 4330 | make_trie_failtable(pRExC_state, (regnode *)first, trie_op, 0); |
f8fc2ecf | 4331 | ri->regstclass = trie_op; |
07be1b83 YO |
4332 | } |
4333 | #endif | |
bfed75c6 | 4334 | else if (strchr((const char*)PL_simple,OP(first))) |
f8fc2ecf | 4335 | ri->regstclass = first; |
3dab1dad YO |
4336 | else if (PL_regkind[OP(first)] == BOUND || |
4337 | PL_regkind[OP(first)] == NBOUND) | |
f8fc2ecf | 4338 | ri->regstclass = first; |
3dab1dad | 4339 | else if (PL_regkind[OP(first)] == BOL) { |
bbe252da YO |
4340 | r->extflags |= (OP(first) == MBOL |
4341 | ? RXf_ANCH_MBOL | |
cad2e5aa | 4342 | : (OP(first) == SBOL |
bbe252da YO |
4343 | ? RXf_ANCH_SBOL |
4344 | : RXf_ANCH_BOL)); | |
a0d0e21e | 4345 | first = NEXTOPER(first); |
774d564b | 4346 | goto again; |
4347 | } | |
4348 | else if (OP(first) == GPOS) { | |
bbe252da | 4349 | r->extflags |= RXf_ANCH_GPOS; |
774d564b | 4350 | first = NEXTOPER(first); |
4351 | goto again; | |
a0d0e21e | 4352 | } |
cf2a2b69 YO |
4353 | else if ((!sawopen || !RExC_sawback) && |
4354 | (OP(first) == STAR && | |
3dab1dad | 4355 | PL_regkind[OP(NEXTOPER(first))] == REG_ANY) && |
bbe252da | 4356 | !(r->extflags & RXf_ANCH) && !(RExC_seen & REG_SEEN_EVAL)) |
a0d0e21e LW |
4357 | { |
4358 | /* turn .* into ^.* with an implied $*=1 */ | |
1df70142 AL |
4359 | const int type = |
4360 | (OP(NEXTOPER(first)) == REG_ANY) | |
bbe252da YO |
4361 | ? RXf_ANCH_MBOL |
4362 | : RXf_ANCH_SBOL; | |
4363 | r->extflags |= type; | |
4364 | r->intflags |= PREGf_IMPLICIT; | |
a0d0e21e | 4365 | first = NEXTOPER(first); |
774d564b | 4366 | goto again; |
a0d0e21e | 4367 | } |
b81d288d | 4368 | if (sawplus && (!sawopen || !RExC_sawback) |
830247a4 | 4369 | && !(RExC_seen & REG_SEEN_EVAL)) /* May examine pos and $& */ |
cad2e5aa | 4370 | /* x+ must match at the 1st pos of run of x's */ |
bbe252da | 4371 | r->intflags |= PREGf_SKIP; |
a0d0e21e | 4372 | |
c277df42 | 4373 | /* Scan is after the zeroth branch, first is atomic matcher. */ |
be8e71aa | 4374 | #ifdef TRIE_STUDY_OPT |
81714fb9 | 4375 | DEBUG_PARSE_r( |
be8e71aa YO |
4376 | if (!restudied) |
4377 | PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n", | |
4378 | (IV)(first - scan + 1)) | |
4379 | ); | |
4380 | #else | |
81714fb9 | 4381 | DEBUG_PARSE_r( |
be8e71aa YO |
4382 | PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n", |
4383 | (IV)(first - scan + 1)) | |
4384 | ); | |
4385 | #endif | |
4386 | ||
4387 | ||
a0d0e21e LW |
4388 | /* |
4389 | * If there's something expensive in the r.e., find the | |
4390 | * longest literal string that must appear and make it the | |
4391 | * regmust. Resolve ties in favor of later strings, since | |
4392 | * the regstart check works with the beginning of the r.e. | |
4393 | * and avoiding duplication strengthens checking. Not a | |
4394 | * strong reason, but sufficient in the absence of others. | |
4395 | * [Now we resolve ties in favor of the earlier string if | |
c277df42 | 4396 | * it happens that c_offset_min has been invalidated, since the |
a0d0e21e LW |
4397 | * earlier string may buy us something the later one won't.] |
4398 | */ | |
de8c5301 | 4399 | |
396482e1 GA |
4400 | data.longest_fixed = newSVpvs(""); |
4401 | data.longest_float = newSVpvs(""); | |
4402 | data.last_found = newSVpvs(""); | |
c277df42 IZ |
4403 | data.longest = &(data.longest_fixed); |
4404 | first = scan; | |
f8fc2ecf | 4405 | if (!ri->regstclass) { |
830247a4 | 4406 | cl_init(pRExC_state, &ch_class); |
653099ff GS |
4407 | data.start_class = &ch_class; |
4408 | stclass_flag = SCF_DO_STCLASS_AND; | |
4409 | } else /* XXXX Check for BOUND? */ | |
4410 | stclass_flag = 0; | |
cb434fcc | 4411 | data.last_closep = &last_close; |
de8c5301 | 4412 | |
1de06328 | 4413 | minlen = study_chunk(pRExC_state, &first, &minlen, &fake, scan + RExC_size, /* Up to end */ |
40d049e4 YO |
4414 | &data, -1, NULL, NULL, |
4415 | SCF_DO_SUBSTR | SCF_WHILEM_VISITED_POS | stclass_flag,0); | |
07be1b83 | 4416 | |
07be1b83 | 4417 | |
786e8c11 YO |
4418 | CHECK_RESTUDY_GOTO; |
4419 | ||
4420 | ||
830247a4 | 4421 | if ( RExC_npar == 1 && data.longest == &(data.longest_fixed) |
b81d288d | 4422 | && data.last_start_min == 0 && data.last_end > 0 |
830247a4 | 4423 | && !RExC_seen_zerolen |
2bf803e2 | 4424 | && !(RExC_seen & REG_SEEN_VERBARG) |
bbe252da YO |
4425 | && (!(RExC_seen & REG_SEEN_GPOS) || (r->extflags & RXf_ANCH_GPOS))) |
4426 | r->extflags |= RXf_CHECK_ALL; | |
304ee84b | 4427 | scan_commit(pRExC_state, &data,&minlen,0); |
c277df42 IZ |
4428 | SvREFCNT_dec(data.last_found); |
4429 | ||
1de06328 YO |
4430 | /* Note that code very similar to this but for anchored string |
4431 | follows immediately below, changes may need to be made to both. | |
4432 | Be careful. | |
4433 | */ | |
a0ed51b3 | 4434 | longest_float_length = CHR_SVLEN(data.longest_float); |
c5254dd6 | 4435 | if (longest_float_length |
c277df42 IZ |
4436 | || (data.flags & SF_FL_BEFORE_EOL |
4437 | && (!(data.flags & SF_FL_BEFORE_MEOL) | |
bbe252da | 4438 | || (RExC_flags & RXf_PMf_MULTILINE)))) |
1de06328 | 4439 | { |
1182767e | 4440 | I32 t,ml; |
cf93c79d | 4441 | |
1de06328 | 4442 | if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */ |
aca2d497 IZ |
4443 | && data.offset_fixed == data.offset_float_min |
4444 | && SvCUR(data.longest_fixed) == SvCUR(data.longest_float)) | |
4445 | goto remove_float; /* As in (a)+. */ | |
4446 | ||
1de06328 YO |
4447 | /* copy the information about the longest float from the reg_scan_data |
4448 | over to the program. */ | |
33b8afdf JH |
4449 | if (SvUTF8(data.longest_float)) { |
4450 | r->float_utf8 = data.longest_float; | |
c445ea15 | 4451 | r->float_substr = NULL; |
33b8afdf JH |
4452 | } else { |
4453 | r->float_substr = data.longest_float; | |
c445ea15 | 4454 | r->float_utf8 = NULL; |
33b8afdf | 4455 | } |
1de06328 YO |
4456 | /* float_end_shift is how many chars that must be matched that |
4457 | follow this item. We calculate it ahead of time as once the | |
4458 | lookbehind offset is added in we lose the ability to correctly | |
4459 | calculate it.*/ | |
4460 | ml = data.minlen_float ? *(data.minlen_float) | |
1182767e | 4461 | : (I32)longest_float_length; |
1de06328 YO |
4462 | r->float_end_shift = ml - data.offset_float_min |
4463 | - longest_float_length + (SvTAIL(data.longest_float) != 0) | |
4464 | + data.lookbehind_float; | |
4465 | r->float_min_offset = data.offset_float_min - data.lookbehind_float; | |
c277df42 | 4466 | r->float_max_offset = data.offset_float_max; |
1182767e | 4467 | if (data.offset_float_max < I32_MAX) /* Don't offset infinity */ |
1de06328 YO |
4468 | r->float_max_offset -= data.lookbehind_float; |
4469 | ||
cf93c79d IZ |
4470 | t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */ |
4471 | && (!(data.flags & SF_FL_BEFORE_MEOL) | |
bbe252da | 4472 | || (RExC_flags & RXf_PMf_MULTILINE))); |
33b8afdf | 4473 | fbm_compile(data.longest_float, t ? FBMcf_TAIL : 0); |
a0ed51b3 LW |
4474 | } |
4475 | else { | |
aca2d497 | 4476 | remove_float: |
c445ea15 | 4477 | r->float_substr = r->float_utf8 = NULL; |
c277df42 | 4478 | SvREFCNT_dec(data.longest_float); |
c5254dd6 | 4479 | longest_float_length = 0; |
a0d0e21e | 4480 | } |
c277df42 | 4481 | |
1de06328 YO |
4482 | /* Note that code very similar to this but for floating string |
4483 | is immediately above, changes may need to be made to both. | |
4484 | Be careful. | |
4485 | */ | |
a0ed51b3 | 4486 | longest_fixed_length = CHR_SVLEN(data.longest_fixed); |
c5254dd6 | 4487 | if (longest_fixed_length |
c277df42 IZ |
4488 | || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */ |
4489 | && (!(data.flags & SF_FIX_BEFORE_MEOL) | |
bbe252da | 4490 | || (RExC_flags & RXf_PMf_MULTILINE)))) |
1de06328 | 4491 | { |
1182767e | 4492 | I32 t,ml; |
cf93c79d | 4493 | |
1de06328 YO |
4494 | /* copy the information about the longest fixed |
4495 | from the reg_scan_data over to the program. */ | |
33b8afdf JH |
4496 | if (SvUTF8(data.longest_fixed)) { |
4497 | r->anchored_utf8 = data.longest_fixed; | |
c445ea15 | 4498 | r->anchored_substr = NULL; |
33b8afdf JH |
4499 | } else { |
4500 | r->anchored_substr = data.longest_fixed; | |
c445ea15 | 4501 | r->anchored_utf8 = NULL; |
33b8afdf | 4502 | } |
1de06328 YO |
4503 | /* fixed_end_shift is how many chars that must be matched that |
4504 | follow this item. We calculate it ahead of time as once the | |
4505 | lookbehind offset is added in we lose the ability to correctly | |
4506 | calculate it.*/ | |
4507 | ml = data.minlen_fixed ? *(data.minlen_fixed) | |
1182767e | 4508 | : (I32)longest_fixed_length; |
1de06328 YO |
4509 | r->anchored_end_shift = ml - data.offset_fixed |
4510 | - longest_fixed_length + (SvTAIL(data.longest_fixed) != 0) | |
4511 | + data.lookbehind_fixed; | |
4512 | r->anchored_offset = data.offset_fixed - data.lookbehind_fixed; | |
4513 | ||
cf93c79d IZ |
4514 | t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */ |
4515 | && (!(data.flags & SF_FIX_BEFORE_MEOL) | |
bbe252da | 4516 | || (RExC_flags & RXf_PMf_MULTILINE))); |
33b8afdf | 4517 | fbm_compile(data.longest_fixed, t ? FBMcf_TAIL : 0); |
a0ed51b3 LW |
4518 | } |
4519 | else { | |
c445ea15 | 4520 | r->anchored_substr = r->anchored_utf8 = NULL; |
c277df42 | 4521 | SvREFCNT_dec(data.longest_fixed); |
c5254dd6 | 4522 | longest_fixed_length = 0; |
a0d0e21e | 4523 | } |
f8fc2ecf YO |
4524 | if (ri->regstclass |
4525 | && (OP(ri->regstclass) == REG_ANY || OP(ri->regstclass) == SANY)) | |
4526 | ri->regstclass = NULL; | |
33b8afdf JH |
4527 | if ((!(r->anchored_substr || r->anchored_utf8) || r->anchored_offset) |
4528 | && stclass_flag | |
653099ff | 4529 | && !(data.start_class->flags & ANYOF_EOS) |
eb160463 GS |
4530 | && !cl_is_anything(data.start_class)) |
4531 | { | |
2eccd3b2 | 4532 | const U32 n = add_data(pRExC_state, 1, "f"); |
653099ff | 4533 | |
f8fc2ecf | 4534 | Newx(RExC_rxi->data->data[n], 1, |
653099ff GS |
4535 | struct regnode_charclass_class); |
4536 | StructCopy(data.start_class, | |
f8fc2ecf | 4537 | (struct regnode_charclass_class*)RExC_rxi->data->data[n], |
653099ff | 4538 | struct regnode_charclass_class); |
f8fc2ecf | 4539 | ri->regstclass = (regnode*)RExC_rxi->data->data[n]; |
bbe252da | 4540 | r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */ |
a3621e74 | 4541 | DEBUG_COMPILE_r({ SV *sv = sv_newmortal(); |
32fc9b6a | 4542 | regprop(r, sv, (regnode*)data.start_class); |
9c5ffd7c | 4543 | PerlIO_printf(Perl_debug_log, |
a0288114 | 4544 | "synthetic stclass \"%s\".\n", |
3f7c398e | 4545 | SvPVX_const(sv));}); |
653099ff | 4546 | } |
c277df42 IZ |
4547 | |
4548 | /* A temporary algorithm prefers floated substr to fixed one to dig more info. */ | |
c5254dd6 | 4549 | if (longest_fixed_length > longest_float_length) { |
1de06328 | 4550 | r->check_end_shift = r->anchored_end_shift; |
c277df42 | 4551 | r->check_substr = r->anchored_substr; |
33b8afdf | 4552 | r->check_utf8 = r->anchored_utf8; |
c277df42 | 4553 | r->check_offset_min = r->check_offset_max = r->anchored_offset; |
bbe252da YO |
4554 | if (r->extflags & RXf_ANCH_SINGLE) |
4555 | r->extflags |= RXf_NOSCAN; | |
a0ed51b3 LW |
4556 | } |
4557 | else { | |
1de06328 | 4558 | r->check_end_shift = r->float_end_shift; |
c277df42 | 4559 | r->check_substr = r->float_substr; |
33b8afdf | 4560 | r->check_utf8 = r->float_utf8; |
1de06328 YO |
4561 | r->check_offset_min = r->float_min_offset; |
4562 | r->check_offset_max = r->float_max_offset; | |
a0d0e21e | 4563 | } |
30382c73 IZ |
4564 | /* XXXX Currently intuiting is not compatible with ANCH_GPOS. |
4565 | This should be changed ASAP! */ | |
bbe252da YO |
4566 | if ((r->check_substr || r->check_utf8) && !(r->extflags & RXf_ANCH_GPOS)) { |
4567 | r->extflags |= RXf_USE_INTUIT; | |
33b8afdf | 4568 | if (SvTAIL(r->check_substr ? r->check_substr : r->check_utf8)) |
bbe252da | 4569 | r->extflags |= RXf_INTUIT_TAIL; |
cad2e5aa | 4570 | } |
1de06328 YO |
4571 | /* XXX Unneeded? dmq (shouldn't as this is handled elsewhere) |
4572 | if ( (STRLEN)minlen < longest_float_length ) | |
4573 | minlen= longest_float_length; | |
4574 | if ( (STRLEN)minlen < longest_fixed_length ) | |
4575 | minlen= longest_fixed_length; | |
4576 | */ | |
a0ed51b3 LW |
4577 | } |
4578 | else { | |
c277df42 IZ |
4579 | /* Several toplevels. Best we can is to set minlen. */ |
4580 | I32 fake; | |
653099ff | 4581 | struct regnode_charclass_class ch_class; |
cb434fcc | 4582 | I32 last_close = 0; |
c277df42 | 4583 | |
5d458dd8 | 4584 | DEBUG_PARSE_r(PerlIO_printf(Perl_debug_log, "\nMulti Top Level\n")); |
07be1b83 | 4585 | |
f8fc2ecf | 4586 | scan = ri->program + 1; |
830247a4 | 4587 | cl_init(pRExC_state, &ch_class); |
653099ff | 4588 | data.start_class = &ch_class; |
cb434fcc | 4589 | data.last_closep = &last_close; |
07be1b83 | 4590 | |
de8c5301 | 4591 | |
1de06328 | 4592 | minlen = study_chunk(pRExC_state, &scan, &minlen, &fake, scan + RExC_size, |
40d049e4 | 4593 | &data, -1, NULL, NULL, SCF_DO_STCLASS_AND|SCF_WHILEM_VISITED_POS,0); |
de8c5301 | 4594 | |
786e8c11 | 4595 | CHECK_RESTUDY_GOTO; |
07be1b83 | 4596 | |
33b8afdf | 4597 | r->check_substr = r->check_utf8 = r->anchored_substr = r->anchored_utf8 |
c445ea15 | 4598 | = r->float_substr = r->float_utf8 = NULL; |
653099ff | 4599 | if (!(data.start_class->flags & ANYOF_EOS) |
eb160463 GS |
4600 | && !cl_is_anything(data.start_class)) |
4601 | { | |
2eccd3b2 | 4602 | const U32 n = add_data(pRExC_state, 1, "f"); |
653099ff | 4603 | |
f8fc2ecf | 4604 | Newx(RExC_rxi->data->data[n], 1, |
653099ff GS |
4605 | struct regnode_charclass_class); |
4606 | StructCopy(data.start_class, | |
f8fc2ecf | 4607 | (struct regnode_charclass_class*)RExC_rxi->data->data[n], |
653099ff | 4608 | struct regnode_charclass_class); |
f8fc2ecf | 4609 | ri->regstclass = (regnode*)RExC_rxi->data->data[n]; |
bbe252da | 4610 | r->intflags &= ~PREGf_SKIP; /* Used in find_byclass(). */ |
a3621e74 | 4611 | DEBUG_COMPILE_r({ SV* sv = sv_newmortal(); |
32fc9b6a | 4612 | regprop(r, sv, (regnode*)data.start_class); |
9c5ffd7c | 4613 | PerlIO_printf(Perl_debug_log, |
a0288114 | 4614 | "synthetic stclass \"%s\".\n", |
3f7c398e | 4615 | SvPVX_const(sv));}); |
653099ff | 4616 | } |
a0d0e21e LW |
4617 | } |
4618 | ||
1de06328 YO |
4619 | /* Guard against an embedded (?=) or (?<=) with a longer minlen than |
4620 | the "real" pattern. */ | |
cf9788e3 RGS |
4621 | DEBUG_OPTIMISE_r({ |
4622 | PerlIO_printf(Perl_debug_log,"minlen: %"IVdf" r->minlen:%"IVdf"\n", | |
70685ca0 | 4623 | (IV)minlen, (IV)r->minlen); |
cf9788e3 | 4624 | }); |
de8c5301 | 4625 | r->minlenret = minlen; |
1de06328 YO |
4626 | if (r->minlen < minlen) |
4627 | r->minlen = minlen; | |
4628 | ||
b81d288d | 4629 | if (RExC_seen & REG_SEEN_GPOS) |
bbe252da | 4630 | r->extflags |= RXf_GPOS_SEEN; |
830247a4 | 4631 | if (RExC_seen & REG_SEEN_LOOKBEHIND) |
bbe252da | 4632 | r->extflags |= RXf_LOOKBEHIND_SEEN; |
830247a4 | 4633 | if (RExC_seen & REG_SEEN_EVAL) |
bbe252da | 4634 | r->extflags |= RXf_EVAL_SEEN; |
f33976b4 | 4635 | if (RExC_seen & REG_SEEN_CANY) |
bbe252da | 4636 | r->extflags |= RXf_CANY_SEEN; |
e2e6a0f1 | 4637 | if (RExC_seen & REG_SEEN_VERBARG) |
bbe252da | 4638 | r->intflags |= PREGf_VERBARG_SEEN; |
5d458dd8 | 4639 | if (RExC_seen & REG_SEEN_CUTGROUP) |
bbe252da | 4640 | r->intflags |= PREGf_CUTGROUP_SEEN; |
81714fb9 YO |
4641 | if (RExC_paren_names) |
4642 | r->paren_names = (HV*)SvREFCNT_inc(RExC_paren_names); | |
4643 | else | |
4644 | r->paren_names = NULL; | |
e357fc67 YO |
4645 | if (r->prelen == 3 && strEQ("\\s+", r->precomp)) |
4646 | r->extflags |= RXf_WHITE; | |
4647 | else if (r->prelen == 1 && r->precomp[0] == '^') | |
4648 | r->extflags |= RXf_START_ONLY; | |
4649 | ||
1f1031fe YO |
4650 | #ifdef DEBUGGING |
4651 | if (RExC_paren_names) { | |
4652 | ri->name_list_idx = add_data( pRExC_state, 1, "p" ); | |
4653 | ri->data->data[ri->name_list_idx] = (void*)SvREFCNT_inc(RExC_paren_name_list); | |
4654 | } else | |
1f1031fe | 4655 | #endif |
cde0cee5 | 4656 | ri->name_list_idx = 0; |
1f1031fe | 4657 | |
40d049e4 YO |
4658 | if (RExC_recurse_count) { |
4659 | for ( ; RExC_recurse_count ; RExC_recurse_count-- ) { | |
4660 | const regnode *scan = RExC_recurse[RExC_recurse_count-1]; | |
4661 | ARG2L_SET( scan, RExC_open_parens[ARG(scan)-1] - scan ); | |
4662 | } | |
4663 | } | |
a02a5408 JC |
4664 | Newxz(r->startp, RExC_npar, I32); |
4665 | Newxz(r->endp, RExC_npar, I32); | |
c74340f9 YO |
4666 | /* assume we don't need to swap parens around before we match */ |
4667 | ||
be8e71aa YO |
4668 | DEBUG_DUMP_r({ |
4669 | PerlIO_printf(Perl_debug_log,"Final program:\n"); | |
3dab1dad YO |
4670 | regdump(r); |
4671 | }); | |
7122b237 YO |
4672 | #ifdef RE_TRACK_PATTERN_OFFSETS |
4673 | DEBUG_OFFSETS_r(if (ri->u.offsets) { | |
4674 | const U32 len = ri->u.offsets[0]; | |
8e9a8a48 YO |
4675 | U32 i; |
4676 | GET_RE_DEBUG_FLAGS_DECL; | |
7122b237 | 4677 | PerlIO_printf(Perl_debug_log, "Offsets: [%"UVuf"]\n\t", (UV)ri->u.offsets[0]); |
8e9a8a48 | 4678 | for (i = 1; i <= len; i++) { |
7122b237 | 4679 | if (ri->u.offsets[i*2-1] || ri->u.offsets[i*2]) |
8e9a8a48 | 4680 | PerlIO_printf(Perl_debug_log, "%"UVuf":%"UVuf"[%"UVuf"] ", |
7122b237 | 4681 | (UV)i, (UV)ri->u.offsets[i*2-1], (UV)ri->u.offsets[i*2]); |
8e9a8a48 YO |
4682 | } |
4683 | PerlIO_printf(Perl_debug_log, "\n"); | |
4684 | }); | |
7122b237 | 4685 | #endif |
a0d0e21e | 4686 | return(r); |
a687059c LW |
4687 | } |
4688 | ||
f9f4320a | 4689 | #undef RE_ENGINE_PTR |
3dab1dad | 4690 | |
93b32b6d | 4691 | |
81714fb9 | 4692 | SV* |
93b32b6d | 4693 | Perl_reg_named_buff_get(pTHX_ const REGEXP * const rx, SV* namesv, U32 flags) |
81714fb9 | 4694 | { |
44a2ac75 YO |
4695 | AV *retarray = NULL; |
4696 | SV *ret; | |
4697 | if (flags & 1) | |
4698 | retarray=newAV(); | |
93b32b6d YO |
4699 | |
4700 | if (rx && rx->paren_names) { | |
4701 | HE *he_str = hv_fetch_ent( rx->paren_names, namesv, 0, 0 ); | |
4702 | if (he_str) { | |
4703 | IV i; | |
4704 | SV* sv_dat=HeVAL(he_str); | |
4705 | I32 *nums=(I32*)SvPVX(sv_dat); | |
4706 | for ( i=0; i<SvIVX(sv_dat); i++ ) { | |
66e6b4c5 RGS |
4707 | if ((I32)(rx->nparens) >= nums[i] |
4708 | && rx->startp[nums[i]] != -1 | |
4709 | && rx->endp[nums[i]] != -1) | |
93b32b6d YO |
4710 | { |
4711 | ret = CALLREG_NUMBUF(rx,nums[i],NULL); | |
4712 | if (!retarray) | |
4713 | return ret; | |
4714 | } else { | |
4715 | ret = newSVsv(&PL_sv_undef); | |
4716 | } | |
4717 | if (retarray) { | |
4718 | SvREFCNT_inc(ret); | |
4719 | av_push(retarray, ret); | |
81714fb9 YO |
4720 | } |
4721 | } | |
93b32b6d YO |
4722 | if (retarray) |
4723 | return (SV*)retarray; | |
81714fb9 YO |
4724 | } |
4725 | } | |
44a2ac75 YO |
4726 | return NULL; |
4727 | } | |
4728 | ||
4729 | SV* | |
93b32b6d | 4730 | Perl_reg_numbered_buff_get(pTHX_ const REGEXP * const rx, I32 paren, SV* usesv) |
44a2ac75 YO |
4731 | { |
4732 | char *s = NULL; | |
a9d504c3 | 4733 | I32 i = 0; |
44a2ac75 YO |
4734 | I32 s1, t1; |
4735 | SV *sv = usesv ? usesv : newSVpvs(""); | |
4736 | ||
cde0cee5 YO |
4737 | if (!rx->subbeg) { |
4738 | sv_setsv(sv,&PL_sv_undef); | |
4739 | return sv; | |
4740 | } | |
4741 | else | |
4742 | if (paren == -2 && rx->startp[0] != -1) { | |
44a2ac75 YO |
4743 | /* $` */ |
4744 | i = rx->startp[0]; | |
cde0cee5 | 4745 | s = rx->subbeg; |
44a2ac75 YO |
4746 | } |
4747 | else | |
cde0cee5 | 4748 | if (paren == -1 && rx->endp[0] != -1) { |
44a2ac75 YO |
4749 | /* $' */ |
4750 | s = rx->subbeg + rx->endp[0]; | |
4751 | i = rx->sublen - rx->endp[0]; | |
4752 | } | |
4753 | else | |
4754 | if ( 0 <= paren && paren <= (I32)rx->nparens && | |
4755 | (s1 = rx->startp[paren]) != -1 && | |
4756 | (t1 = rx->endp[paren]) != -1) | |
4757 | { | |
4758 | /* $& $1 ... */ | |
4759 | i = t1 - s1; | |
4760 | s = rx->subbeg + s1; | |
cde0cee5 YO |
4761 | } else { |
4762 | sv_setsv(sv,&PL_sv_undef); | |
4763 | return sv; | |
4764 | } | |
4765 | assert(rx->sublen >= (s - rx->subbeg) + i ); | |
4766 | if (i >= 0) { | |
4767 | const int oldtainted = PL_tainted; | |
4768 | TAINT_NOT; | |
4769 | sv_setpvn(sv, s, i); | |
4770 | PL_tainted = oldtainted; | |
4771 | if ( (rx->extflags & RXf_CANY_SEEN) | |
4772 | ? (RX_MATCH_UTF8(rx) | |
4773 | && (!i || is_utf8_string((U8*)s, i))) | |
4774 | : (RX_MATCH_UTF8(rx)) ) | |
4775 | { | |
4776 | SvUTF8_on(sv); | |
4777 | } | |
4778 | else | |
4779 | SvUTF8_off(sv); | |
4780 | if (PL_tainting) { | |
4781 | if (RX_MATCH_TAINTED(rx)) { | |
4782 | if (SvTYPE(sv) >= SVt_PVMG) { | |
4783 | MAGIC* const mg = SvMAGIC(sv); | |
4784 | MAGIC* mgt; | |
4785 | PL_tainted = 1; | |
4786 | SvMAGIC_set(sv, mg->mg_moremagic); | |
4787 | SvTAINT(sv); | |
4788 | if ((mgt = SvMAGIC(sv))) { | |
4789 | mg->mg_moremagic = mgt; | |
4790 | SvMAGIC_set(sv, mg); | |
44a2ac75 | 4791 | } |
cde0cee5 YO |
4792 | } else { |
4793 | PL_tainted = 1; | |
4794 | SvTAINT(sv); | |
4795 | } | |
4796 | } else | |
4797 | SvTAINTED_off(sv); | |
44a2ac75 | 4798 | } |
81714fb9 | 4799 | } else { |
44a2ac75 | 4800 | sv_setsv(sv,&PL_sv_undef); |
81714fb9 | 4801 | } |
44a2ac75 | 4802 | return sv; |
81714fb9 | 4803 | } |
93b32b6d | 4804 | |
0a4db386 | 4805 | |
894be9b7 | 4806 | /* Scans the name of a named buffer from the pattern. |
0a4db386 YO |
4807 | * If flags is REG_RSN_RETURN_NULL returns null. |
4808 | * If flags is REG_RSN_RETURN_NAME returns an SV* containing the name | |
4809 | * If flags is REG_RSN_RETURN_DATA returns the data SV* corresponding | |
4810 | * to the parsed name as looked up in the RExC_paren_names hash. | |
4811 | * If there is an error throws a vFAIL().. type exception. | |
894be9b7 | 4812 | */ |
0a4db386 YO |
4813 | |
4814 | #define REG_RSN_RETURN_NULL 0 | |
4815 | #define REG_RSN_RETURN_NAME 1 | |
4816 | #define REG_RSN_RETURN_DATA 2 | |
4817 | ||
894be9b7 YO |
4818 | STATIC SV* |
4819 | S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags) { | |
4820 | char *name_start = RExC_parse; | |
1f1031fe YO |
4821 | |
4822 | if (isIDFIRST_lazy_if(RExC_parse, UTF)) { | |
4823 | /* skip IDFIRST by using do...while */ | |
4824 | if (UTF) | |
4825 | do { | |
4826 | RExC_parse += UTF8SKIP(RExC_parse); | |
4827 | } while (isALNUM_utf8((U8*)RExC_parse)); | |
4828 | else | |
4829 | do { | |
4830 | RExC_parse++; | |
4831 | } while (isALNUM(*RExC_parse)); | |
894be9b7 | 4832 | } |
1f1031fe | 4833 | |
0a4db386 YO |
4834 | if ( flags ) { |
4835 | SV* sv_name = sv_2mortal(Perl_newSVpvn(aTHX_ name_start, | |
4836 | (int)(RExC_parse - name_start))); | |
894be9b7 | 4837 | if (UTF) |
0a4db386 YO |
4838 | SvUTF8_on(sv_name); |
4839 | if ( flags == REG_RSN_RETURN_NAME) | |
4840 | return sv_name; | |
4841 | else if (flags==REG_RSN_RETURN_DATA) { | |
4842 | HE *he_str = NULL; | |
4843 | SV *sv_dat = NULL; | |
4844 | if ( ! sv_name ) /* should not happen*/ | |
4845 | Perl_croak(aTHX_ "panic: no svname in reg_scan_name"); | |
4846 | if (RExC_paren_names) | |
4847 | he_str = hv_fetch_ent( RExC_paren_names, sv_name, 0, 0 ); | |
4848 | if ( he_str ) | |
4849 | sv_dat = HeVAL(he_str); | |
4850 | if ( ! sv_dat ) | |
4851 | vFAIL("Reference to nonexistent named group"); | |
4852 | return sv_dat; | |
4853 | } | |
4854 | else { | |
4855 | Perl_croak(aTHX_ "panic: bad flag in reg_scan_name"); | |
4856 | } | |
4857 | /* NOT REACHED */ | |
894be9b7 | 4858 | } |
0a4db386 | 4859 | return NULL; |
894be9b7 YO |
4860 | } |
4861 | ||
3dab1dad YO |
4862 | #define DEBUG_PARSE_MSG(funcname) DEBUG_PARSE_r({ \ |
4863 | int rem=(int)(RExC_end - RExC_parse); \ | |
4864 | int cut; \ | |
4865 | int num; \ | |
4866 | int iscut=0; \ | |
4867 | if (rem>10) { \ | |
4868 | rem=10; \ | |
4869 | iscut=1; \ | |
4870 | } \ | |
4871 | cut=10-rem; \ | |
4872 | if (RExC_lastparse!=RExC_parse) \ | |
4873 | PerlIO_printf(Perl_debug_log," >%.*s%-*s", \ | |
4874 | rem, RExC_parse, \ | |
4875 | cut + 4, \ | |
4876 | iscut ? "..." : "<" \ | |
4877 | ); \ | |
4878 | else \ | |
4879 | PerlIO_printf(Perl_debug_log,"%16s",""); \ | |
4880 | \ | |
4881 | if (SIZE_ONLY) \ | |
3b57cd43 | 4882 | num = RExC_size + 1; \ |
3dab1dad YO |
4883 | else \ |
4884 | num=REG_NODE_NUM(RExC_emit); \ | |
4885 | if (RExC_lastnum!=num) \ | |
0a4db386 | 4886 | PerlIO_printf(Perl_debug_log,"|%4d",num); \ |
3dab1dad | 4887 | else \ |
0a4db386 | 4888 | PerlIO_printf(Perl_debug_log,"|%4s",""); \ |
be8e71aa YO |
4889 | PerlIO_printf(Perl_debug_log,"|%*s%-4s", \ |
4890 | (int)((depth*2)), "", \ | |
3dab1dad YO |
4891 | (funcname) \ |
4892 | ); \ | |
4893 | RExC_lastnum=num; \ | |
4894 | RExC_lastparse=RExC_parse; \ | |
4895 | }) | |
4896 | ||
07be1b83 YO |
4897 | |
4898 | ||
3dab1dad YO |
4899 | #define DEBUG_PARSE(funcname) DEBUG_PARSE_r({ \ |
4900 | DEBUG_PARSE_MSG((funcname)); \ | |
4901 | PerlIO_printf(Perl_debug_log,"%4s","\n"); \ | |
4902 | }) | |
6bda09f9 YO |
4903 | #define DEBUG_PARSE_FMT(funcname,fmt,args) DEBUG_PARSE_r({ \ |
4904 | DEBUG_PARSE_MSG((funcname)); \ | |
4905 | PerlIO_printf(Perl_debug_log,fmt "\n",args); \ | |
4906 | }) | |
a687059c LW |
4907 | /* |
4908 | - reg - regular expression, i.e. main body or parenthesized thing | |
4909 | * | |
4910 | * Caller must absorb opening parenthesis. | |
4911 | * | |
4912 | * Combining parenthesis handling with the base level of regular expression | |
4913 | * is a trifle forced, but the need to tie the tails of the branches to what | |
4914 | * follows makes it hard to avoid. | |
4915 | */ | |
07be1b83 YO |
4916 | #define REGTAIL(x,y,z) regtail((x),(y),(z),depth+1) |
4917 | #ifdef DEBUGGING | |
4918 | #define REGTAIL_STUDY(x,y,z) regtail_study((x),(y),(z),depth+1) | |
4919 | #else | |
4920 | #define REGTAIL_STUDY(x,y,z) regtail((x),(y),(z),depth+1) | |
4921 | #endif | |
3dab1dad | 4922 | |
e2e6a0f1 YO |
4923 | /* this idea is borrowed from STR_WITH_LEN in handy.h */ |
4924 | #define CHECK_WORD(s,v,l) \ | |
4925 | (((sizeof(s)-1)==(l)) && (strnEQ(start_verb, (s ""), (sizeof(s)-1)))) | |
4926 | ||
76e3520e | 4927 | STATIC regnode * |
3dab1dad | 4928 | S_reg(pTHX_ RExC_state_t *pRExC_state, I32 paren, I32 *flagp,U32 depth) |
c277df42 | 4929 | /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */ |
a687059c | 4930 | { |
27da23d5 | 4931 | dVAR; |
c277df42 IZ |
4932 | register regnode *ret; /* Will be the head of the group. */ |
4933 | register regnode *br; | |
4934 | register regnode *lastbr; | |
cbbf8932 | 4935 | register regnode *ender = NULL; |
a0d0e21e | 4936 | register I32 parno = 0; |
cbbf8932 AL |
4937 | I32 flags; |
4938 | const I32 oregflags = RExC_flags; | |
6136c704 AL |
4939 | bool have_branch = 0; |
4940 | bool is_open = 0; | |
594d7033 YO |
4941 | I32 freeze_paren = 0; |
4942 | I32 after_freeze = 0; | |
9d1d55b5 JP |
4943 | |
4944 | /* for (?g), (?gc), and (?o) warnings; warning | |
4945 | about (?c) will warn about (?g) -- japhy */ | |
4946 | ||
6136c704 AL |
4947 | #define WASTED_O 0x01 |
4948 | #define WASTED_G 0x02 | |
4949 | #define WASTED_C 0x04 | |
4950 | #define WASTED_GC (0x02|0x04) | |
cbbf8932 | 4951 | I32 wastedflags = 0x00; |
9d1d55b5 | 4952 | |
fac92740 | 4953 | char * parse_start = RExC_parse; /* MJD */ |
a28509cc | 4954 | char * const oregcomp_parse = RExC_parse; |
a0d0e21e | 4955 | |
3dab1dad YO |
4956 | GET_RE_DEBUG_FLAGS_DECL; |
4957 | DEBUG_PARSE("reg "); | |
4958 | ||
4959 | ||
821b33a5 | 4960 | *flagp = 0; /* Tentatively. */ |
a0d0e21e | 4961 | |
9d1d55b5 | 4962 | |
a0d0e21e LW |
4963 | /* Make an OPEN node, if parenthesized. */ |
4964 | if (paren) { | |
e2e6a0f1 YO |
4965 | if ( *RExC_parse == '*') { /* (*VERB:ARG) */ |
4966 | char *start_verb = RExC_parse; | |
4967 | STRLEN verb_len = 0; | |
4968 | char *start_arg = NULL; | |
4969 | unsigned char op = 0; | |
4970 | int argok = 1; | |
4971 | int internal_argval = 0; /* internal_argval is only useful if !argok */ | |
4972 | while ( *RExC_parse && *RExC_parse != ')' ) { | |
4973 | if ( *RExC_parse == ':' ) { | |
4974 | start_arg = RExC_parse + 1; | |
4975 | break; | |
4976 | } | |
4977 | RExC_parse++; | |
4978 | } | |
4979 | ++start_verb; | |
4980 | verb_len = RExC_parse - start_verb; | |
4981 | if ( start_arg ) { | |
4982 | RExC_parse++; | |
4983 | while ( *RExC_parse && *RExC_parse != ')' ) | |
4984 | RExC_parse++; | |
4985 | if ( *RExC_parse != ')' ) | |
4986 | vFAIL("Unterminated verb pattern argument"); | |
4987 | if ( RExC_parse == start_arg ) | |
4988 | start_arg = NULL; | |
4989 | } else { | |
4990 | if ( *RExC_parse != ')' ) | |
4991 | vFAIL("Unterminated verb pattern"); | |
4992 | } | |
5d458dd8 | 4993 | |
e2e6a0f1 YO |
4994 | switch ( *start_verb ) { |
4995 | case 'A': /* (*ACCEPT) */ | |
4996 | if ( CHECK_WORD("ACCEPT",start_verb,verb_len) ) { | |
4997 | op = ACCEPT; | |
4998 | internal_argval = RExC_nestroot; | |
4999 | } | |
5000 | break; | |
5001 | case 'C': /* (*COMMIT) */ | |
5002 | if ( CHECK_WORD("COMMIT",start_verb,verb_len) ) | |
5003 | op = COMMIT; | |
e2e6a0f1 YO |
5004 | break; |
5005 | case 'F': /* (*FAIL) */ | |
5006 | if ( verb_len==1 || CHECK_WORD("FAIL",start_verb,verb_len) ) { | |
5007 | op = OPFAIL; | |
5008 | argok = 0; | |
5009 | } | |
5010 | break; | |
5d458dd8 YO |
5011 | case ':': /* (*:NAME) */ |
5012 | case 'M': /* (*MARK:NAME) */ | |
5013 | if ( verb_len==0 || CHECK_WORD("MARK",start_verb,verb_len) ) { | |
e2e6a0f1 | 5014 | op = MARKPOINT; |
5d458dd8 YO |
5015 | argok = -1; |
5016 | } | |
5017 | break; | |
5018 | case 'P': /* (*PRUNE) */ | |
5019 | if ( CHECK_WORD("PRUNE",start_verb,verb_len) ) | |
5020 | op = PRUNE; | |
e2e6a0f1 | 5021 | break; |
5d458dd8 YO |
5022 | case 'S': /* (*SKIP) */ |
5023 | if ( CHECK_WORD("SKIP",start_verb,verb_len) ) | |
5024 | op = SKIP; | |
5025 | break; | |
5026 | case 'T': /* (*THEN) */ | |
5027 | /* [19:06] <TimToady> :: is then */ | |
5028 | if ( CHECK_WORD("THEN",start_verb,verb_len) ) { | |
5029 | op = CUTGROUP; | |
5030 | RExC_seen |= REG_SEEN_CUTGROUP; | |
5031 | } | |
e2e6a0f1 YO |
5032 | break; |
5033 | } | |
5034 | if ( ! op ) { | |
5035 | RExC_parse++; | |
5036 | vFAIL3("Unknown verb pattern '%.*s'", | |
5037 | verb_len, start_verb); | |
5038 | } | |
5039 | if ( argok ) { | |
5040 | if ( start_arg && internal_argval ) { | |
5041 | vFAIL3("Verb pattern '%.*s' may not have an argument", | |
5042 | verb_len, start_verb); | |
5043 | } else if ( argok < 0 && !start_arg ) { | |
5044 | vFAIL3("Verb pattern '%.*s' has a mandatory argument", | |
5045 | verb_len, start_verb); | |
5046 | } else { | |
5047 | ret = reganode(pRExC_state, op, internal_argval); | |
5048 | if ( ! internal_argval && ! SIZE_ONLY ) { | |
5049 | if (start_arg) { | |
5050 | SV *sv = newSVpvn( start_arg, RExC_parse - start_arg); | |
5051 | ARG(ret) = add_data( pRExC_state, 1, "S" ); | |
f8fc2ecf | 5052 | RExC_rxi->data->data[ARG(ret)]=(void*)sv; |
e2e6a0f1 YO |
5053 | ret->flags = 0; |
5054 | } else { | |
5055 | ret->flags = 1; | |
5056 | } | |
5057 | } | |
5058 | } | |
5059 | if (!internal_argval) | |
5060 | RExC_seen |= REG_SEEN_VERBARG; | |
5061 | } else if ( start_arg ) { | |
5062 | vFAIL3("Verb pattern '%.*s' may not have an argument", | |
5063 | verb_len, start_verb); | |
5064 | } else { | |
5065 | ret = reg_node(pRExC_state, op); | |
5066 | } | |
5067 | nextchar(pRExC_state); | |
5068 | return ret; | |
5069 | } else | |
fac92740 | 5070 | if (*RExC_parse == '?') { /* (?...) */ |
6136c704 | 5071 | bool is_logical = 0; |
a28509cc | 5072 | const char * const seqstart = RExC_parse; |
ca9dfc88 | 5073 | |
830247a4 IZ |
5074 | RExC_parse++; |
5075 | paren = *RExC_parse++; | |
c277df42 | 5076 | ret = NULL; /* For look-ahead/behind. */ |
a0d0e21e | 5077 | switch (paren) { |
894be9b7 | 5078 | |
1f1031fe YO |
5079 | case 'P': /* (?P...) variants for those used to PCRE/Python */ |
5080 | paren = *RExC_parse++; | |
5081 | if ( paren == '<') /* (?P<...>) named capture */ | |
5082 | goto named_capture; | |
5083 | else if (paren == '>') { /* (?P>name) named recursion */ | |
5084 | goto named_recursion; | |
5085 | } | |
5086 | else if (paren == '=') { /* (?P=...) named backref */ | |
5087 | /* this pretty much dupes the code for \k<NAME> in regatom(), if | |
5088 | you change this make sure you change that */ | |
5089 | char* name_start = RExC_parse; | |
5090 | U32 num = 0; | |
5091 | SV *sv_dat = reg_scan_name(pRExC_state, | |
5092 | SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA); | |
5093 | if (RExC_parse == name_start || *RExC_parse != ')') | |
5094 | vFAIL2("Sequence %.3s... not terminated",parse_start); | |
5095 | ||
5096 | if (!SIZE_ONLY) { | |
5097 | num = add_data( pRExC_state, 1, "S" ); | |
5098 | RExC_rxi->data->data[num]=(void*)sv_dat; | |
5099 | SvREFCNT_inc(sv_dat); | |
5100 | } | |
5101 | RExC_sawback = 1; | |
5102 | ret = reganode(pRExC_state, | |
5103 | (U8)(FOLD ? (LOC ? NREFFL : NREFF) : NREF), | |
5104 | num); | |
5105 | *flagp |= HASWIDTH; | |
5106 | ||
5107 | Set_Node_Offset(ret, parse_start+1); | |
5108 | Set_Node_Cur_Length(ret); /* MJD */ | |
5109 | ||
5110 | nextchar(pRExC_state); | |
5111 | return ret; | |
5112 | } | |
57b84237 YO |
5113 | RExC_parse++; |
5114 | vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart); | |
5115 | /*NOTREACHED*/ | |
5116 | case '<': /* (?<...) */ | |
b81d288d | 5117 | if (*RExC_parse == '!') |
c277df42 | 5118 | paren = ','; |
0a4db386 | 5119 | else if (*RExC_parse != '=') |
1f1031fe | 5120 | named_capture: |
0a4db386 | 5121 | { /* (?<...>) */ |
81714fb9 | 5122 | char *name_start; |
894be9b7 | 5123 | SV *svname; |
81714fb9 YO |
5124 | paren= '>'; |
5125 | case '\'': /* (?'...') */ | |
5126 | name_start= RExC_parse; | |
0a4db386 YO |
5127 | svname = reg_scan_name(pRExC_state, |
5128 | SIZE_ONLY ? /* reverse test from the others */ | |
5129 | REG_RSN_RETURN_NAME : | |
5130 | REG_RSN_RETURN_NULL); | |
57b84237 YO |
5131 | if (RExC_parse == name_start) { |
5132 | RExC_parse++; | |
5133 | vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart); | |
5134 | /*NOTREACHED*/ | |
5135 | } | |
81714fb9 YO |
5136 | if (*RExC_parse != paren) |
5137 | vFAIL2("Sequence (?%c... not terminated", | |
5138 | paren=='>' ? '<' : paren); | |
5139 | if (SIZE_ONLY) { | |
e62cc96a YO |
5140 | HE *he_str; |
5141 | SV *sv_dat = NULL; | |
894be9b7 YO |
5142 | if (!svname) /* shouldnt happen */ |
5143 | Perl_croak(aTHX_ | |
5144 | "panic: reg_scan_name returned NULL"); | |
81714fb9 YO |
5145 | if (!RExC_paren_names) { |
5146 | RExC_paren_names= newHV(); | |
5147 | sv_2mortal((SV*)RExC_paren_names); | |
1f1031fe YO |
5148 | #ifdef DEBUGGING |
5149 | RExC_paren_name_list= newAV(); | |
5150 | sv_2mortal((SV*)RExC_paren_name_list); | |
5151 | #endif | |
81714fb9 YO |
5152 | } |
5153 | he_str = hv_fetch_ent( RExC_paren_names, svname, 1, 0 ); | |
e62cc96a | 5154 | if ( he_str ) |
81714fb9 | 5155 | sv_dat = HeVAL(he_str); |
e62cc96a | 5156 | if ( ! sv_dat ) { |
81714fb9 | 5157 | /* croak baby croak */ |
e62cc96a YO |
5158 | Perl_croak(aTHX_ |
5159 | "panic: paren_name hash element allocation failed"); | |
5160 | } else if ( SvPOK(sv_dat) ) { | |
76a476f9 YO |
5161 | /* (?|...) can mean we have dupes so scan to check |
5162 | its already been stored. Maybe a flag indicating | |
5163 | we are inside such a construct would be useful, | |
5164 | but the arrays are likely to be quite small, so | |
5165 | for now we punt -- dmq */ | |
5166 | IV count = SvIV(sv_dat); | |
5167 | I32 *pv = (I32*)SvPVX(sv_dat); | |
5168 | IV i; | |
5169 | for ( i = 0 ; i < count ; i++ ) { | |
5170 | if ( pv[i] == RExC_npar ) { | |
5171 | count = 0; | |
5172 | break; | |
5173 | } | |
5174 | } | |
5175 | if ( count ) { | |
5176 | pv = (I32*)SvGROW(sv_dat, SvCUR(sv_dat) + sizeof(I32)+1); | |
5177 | SvCUR_set(sv_dat, SvCUR(sv_dat) + sizeof(I32)); | |
5178 | pv[count] = RExC_npar; | |
5179 | SvIVX(sv_dat)++; | |
5180 | } | |
81714fb9 YO |
5181 | } else { |
5182 | (void)SvUPGRADE(sv_dat,SVt_PVNV); | |
5183 | sv_setpvn(sv_dat, (char *)&(RExC_npar), sizeof(I32)); | |
5184 | SvIOK_on(sv_dat); | |
5185 | SvIVX(sv_dat)= 1; | |
e62cc96a | 5186 | } |
1f1031fe YO |
5187 | #ifdef DEBUGGING |
5188 | if (!av_store(RExC_paren_name_list, RExC_npar, SvREFCNT_inc(svname))) | |
5189 | SvREFCNT_dec(svname); | |
5190 | #endif | |
e62cc96a | 5191 | |
81714fb9 YO |
5192 | /*sv_dump(sv_dat);*/ |
5193 | } | |
5194 | nextchar(pRExC_state); | |
5195 | paren = 1; | |
5196 | goto capturing_parens; | |
5197 | } | |
5198 | RExC_seen |= REG_SEEN_LOOKBEHIND; | |
830247a4 | 5199 | RExC_parse++; |
fac92740 MJD |
5200 | case '=': /* (?=...) */ |
5201 | case '!': /* (?!...) */ | |
830247a4 | 5202 | RExC_seen_zerolen++; |
e2e6a0f1 YO |
5203 | if (*RExC_parse == ')') { |
5204 | ret=reg_node(pRExC_state, OPFAIL); | |
5205 | nextchar(pRExC_state); | |
5206 | return ret; | |
5207 | } | |
594d7033 YO |
5208 | break; |
5209 | case '|': /* (?|...) */ | |
5210 | /* branch reset, behave like a (?:...) except that | |
5211 | buffers in alternations share the same numbers */ | |
5212 | paren = ':'; | |
5213 | after_freeze = freeze_paren = RExC_npar; | |
5214 | break; | |
fac92740 MJD |
5215 | case ':': /* (?:...) */ |
5216 | case '>': /* (?>...) */ | |
a0d0e21e | 5217 | break; |
fac92740 MJD |
5218 | case '$': /* (?$...) */ |
5219 | case '@': /* (?@...) */ | |
8615cb43 | 5220 | vFAIL2("Sequence (?%c...) not implemented", (int)paren); |
a0d0e21e | 5221 | break; |
fac92740 | 5222 | case '#': /* (?#...) */ |
830247a4 IZ |
5223 | while (*RExC_parse && *RExC_parse != ')') |
5224 | RExC_parse++; | |
5225 | if (*RExC_parse != ')') | |
c277df42 | 5226 | FAIL("Sequence (?#... not terminated"); |
830247a4 | 5227 | nextchar(pRExC_state); |
a0d0e21e LW |
5228 | *flagp = TRYAGAIN; |
5229 | return NULL; | |
894be9b7 YO |
5230 | case '0' : /* (?0) */ |
5231 | case 'R' : /* (?R) */ | |
5232 | if (*RExC_parse != ')') | |
6bda09f9 | 5233 | FAIL("Sequence (?R) not terminated"); |
1a147d38 | 5234 | ret = reg_node(pRExC_state, GOSTART); |
a3b492c3 | 5235 | *flagp |= POSTPONED; |
7f69552c YO |
5236 | nextchar(pRExC_state); |
5237 | return ret; | |
5238 | /*notreached*/ | |
894be9b7 YO |
5239 | { /* named and numeric backreferences */ |
5240 | I32 num; | |
894be9b7 YO |
5241 | case '&': /* (?&NAME) */ |
5242 | parse_start = RExC_parse - 1; | |
1f1031fe | 5243 | named_recursion: |
894be9b7 | 5244 | { |
0a4db386 YO |
5245 | SV *sv_dat = reg_scan_name(pRExC_state, |
5246 | SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA); | |
5247 | num = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0; | |
894be9b7 YO |
5248 | } |
5249 | goto gen_recurse_regop; | |
5250 | /* NOT REACHED */ | |
542fa716 YO |
5251 | case '+': |
5252 | if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) { | |
5253 | RExC_parse++; | |
5254 | vFAIL("Illegal pattern"); | |
5255 | } | |
5256 | goto parse_recursion; | |
5257 | /* NOT REACHED*/ | |
5258 | case '-': /* (?-1) */ | |
5259 | if (!(RExC_parse[0] >= '1' && RExC_parse[0] <= '9')) { | |
5260 | RExC_parse--; /* rewind to let it be handled later */ | |
5261 | goto parse_flags; | |
5262 | } | |
5263 | /*FALLTHROUGH */ | |
6bda09f9 YO |
5264 | case '1': case '2': case '3': case '4': /* (?1) */ |
5265 | case '5': case '6': case '7': case '8': case '9': | |
5266 | RExC_parse--; | |
542fa716 | 5267 | parse_recursion: |
894be9b7 YO |
5268 | num = atoi(RExC_parse); |
5269 | parse_start = RExC_parse - 1; /* MJD */ | |
542fa716 YO |
5270 | if (*RExC_parse == '-') |
5271 | RExC_parse++; | |
6bda09f9 YO |
5272 | while (isDIGIT(*RExC_parse)) |
5273 | RExC_parse++; | |
5274 | if (*RExC_parse!=')') | |
5275 | vFAIL("Expecting close bracket"); | |
894be9b7 YO |
5276 | |
5277 | gen_recurse_regop: | |
542fa716 YO |
5278 | if ( paren == '-' ) { |
5279 | /* | |
5280 | Diagram of capture buffer numbering. | |
5281 | Top line is the normal capture buffer numbers | |
5282 | Botton line is the negative indexing as from | |
5283 | the X (the (?-2)) | |
5284 | ||
5285 | + 1 2 3 4 5 X 6 7 | |
5286 | /(a(x)y)(a(b(c(?-2)d)e)f)(g(h))/ | |
5287 | - 5 4 3 2 1 X x x | |
5288 | ||
5289 | */ | |
5290 | num = RExC_npar + num; | |
5291 | if (num < 1) { | |
5292 | RExC_parse++; | |
5293 | vFAIL("Reference to nonexistent group"); | |
5294 | } | |
5295 | } else if ( paren == '+' ) { | |
5296 | num = RExC_npar + num - 1; | |
5297 | } | |
5298 | ||
1a147d38 | 5299 | ret = reganode(pRExC_state, GOSUB, num); |
6bda09f9 YO |
5300 | if (!SIZE_ONLY) { |
5301 | if (num > (I32)RExC_rx->nparens) { | |
5302 | RExC_parse++; | |
5303 | vFAIL("Reference to nonexistent group"); | |
5304 | } | |
40d049e4 | 5305 | ARG2L_SET( ret, RExC_recurse_count++); |
6bda09f9 | 5306 | RExC_emit++; |
226de585 | 5307 | DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log, |
acff02b8 | 5308 | "Recurse #%"UVuf" to %"IVdf"\n", (UV)ARG(ret), (IV)ARG2L(ret))); |
894be9b7 | 5309 | } else { |
6bda09f9 | 5310 | RExC_size++; |
6bda09f9 | 5311 | } |
0a4db386 | 5312 | RExC_seen |= REG_SEEN_RECURSE; |
6bda09f9 | 5313 | Set_Node_Length(ret, 1 + regarglen[OP(ret)]); /* MJD */ |
58663417 RGS |
5314 | Set_Node_Offset(ret, parse_start); /* MJD */ |
5315 | ||
a3b492c3 | 5316 | *flagp |= POSTPONED; |
6bda09f9 YO |
5317 | nextchar(pRExC_state); |
5318 | return ret; | |
894be9b7 YO |
5319 | } /* named and numeric backreferences */ |
5320 | /* NOT REACHED */ | |
5321 | ||
fac92740 | 5322 | case '?': /* (??...) */ |
6136c704 | 5323 | is_logical = 1; |
57b84237 YO |
5324 | if (*RExC_parse != '{') { |
5325 | RExC_parse++; | |
5326 | vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart); | |
5327 | /*NOTREACHED*/ | |
5328 | } | |
a3b492c3 | 5329 | *flagp |= POSTPONED; |
830247a4 | 5330 | paren = *RExC_parse++; |
0f5d15d6 | 5331 | /* FALL THROUGH */ |
fac92740 | 5332 | case '{': /* (?{...}) */ |
c277df42 | 5333 | { |
2eccd3b2 NC |
5334 | I32 count = 1; |
5335 | U32 n = 0; | |
c277df42 | 5336 | char c; |
830247a4 | 5337 | char *s = RExC_parse; |
c277df42 | 5338 | |
830247a4 IZ |
5339 | RExC_seen_zerolen++; |
5340 | RExC_seen |= REG_SEEN_EVAL; | |
5341 | while (count && (c = *RExC_parse)) { | |
6136c704 AL |
5342 | if (c == '\\') { |
5343 | if (RExC_parse[1]) | |
5344 | RExC_parse++; | |
5345 | } | |
b81d288d | 5346 | else if (c == '{') |
c277df42 | 5347 | count++; |
b81d288d | 5348 | else if (c == '}') |
c277df42 | 5349 | count--; |
830247a4 | 5350 | RExC_parse++; |
c277df42 | 5351 | } |
6136c704 | 5352 | if (*RExC_parse != ')') { |
b81d288d | 5353 | RExC_parse = s; |
b45f050a JF |
5354 | vFAIL("Sequence (?{...}) not terminated or not {}-balanced"); |
5355 | } | |
c277df42 | 5356 | if (!SIZE_ONLY) { |
f3548bdc | 5357 | PAD *pad; |
6136c704 AL |
5358 | OP_4tree *sop, *rop; |
5359 | SV * const sv = newSVpvn(s, RExC_parse - 1 - s); | |
c277df42 | 5360 | |
569233ed SB |
5361 | ENTER; |
5362 | Perl_save_re_context(aTHX); | |
f3548bdc | 5363 | rop = sv_compile_2op(sv, &sop, "re", &pad); |
9b978d73 DM |
5364 | sop->op_private |= OPpREFCOUNTED; |
5365 | /* re_dup will OpREFCNT_inc */ | |
5366 | OpREFCNT_set(sop, 1); | |
569233ed | 5367 | LEAVE; |
c277df42 | 5368 | |
830247a4 | 5369 | n = add_data(pRExC_state, 3, "nop"); |
f8fc2ecf YO |
5370 | RExC_rxi->data->data[n] = (void*)rop; |
5371 | RExC_rxi->data->data[n+1] = (void*)sop; | |
5372 | RExC_rxi->data->data[n+2] = (void*)pad; | |
c277df42 | 5373 | SvREFCNT_dec(sv); |
a0ed51b3 | 5374 | } |
e24b16f9 | 5375 | else { /* First pass */ |
830247a4 | 5376 | if (PL_reginterp_cnt < ++RExC_seen_evals |
923e4eb5 | 5377 | && IN_PERL_RUNTIME) |
2cd61cdb IZ |
5378 | /* No compiled RE interpolated, has runtime |
5379 | components ===> unsafe. */ | |
5380 | FAIL("Eval-group not allowed at runtime, use re 'eval'"); | |
5b61d3f7 | 5381 | if (PL_tainting && PL_tainted) |
cc6b7395 | 5382 | FAIL("Eval-group in insecure regular expression"); |
54df2634 | 5383 | #if PERL_VERSION > 8 |
923e4eb5 | 5384 | if (IN_PERL_COMPILETIME) |
b5c19bd7 | 5385 | PL_cv_has_eval = 1; |
54df2634 | 5386 | #endif |
c277df42 | 5387 | } |
b5c19bd7 | 5388 | |
830247a4 | 5389 | nextchar(pRExC_state); |
6136c704 | 5390 | if (is_logical) { |
830247a4 | 5391 | ret = reg_node(pRExC_state, LOGICAL); |
0f5d15d6 IZ |
5392 | if (!SIZE_ONLY) |
5393 | ret->flags = 2; | |
3dab1dad | 5394 | REGTAIL(pRExC_state, ret, reganode(pRExC_state, EVAL, n)); |
fac92740 | 5395 | /* deal with the length of this later - MJD */ |
0f5d15d6 IZ |
5396 | return ret; |
5397 | } | |
ccb2c380 MP |
5398 | ret = reganode(pRExC_state, EVAL, n); |
5399 | Set_Node_Length(ret, RExC_parse - parse_start + 1); | |
5400 | Set_Node_Offset(ret, parse_start); | |
5401 | return ret; | |
c277df42 | 5402 | } |
fac92740 | 5403 | case '(': /* (?(?{...})...) and (?(?=...)...) */ |
c277df42 | 5404 | { |
0a4db386 | 5405 | int is_define= 0; |
fac92740 | 5406 | if (RExC_parse[0] == '?') { /* (?(?...)) */ |
b81d288d AB |
5407 | if (RExC_parse[1] == '=' || RExC_parse[1] == '!' |
5408 | || RExC_parse[1] == '<' | |
830247a4 | 5409 | || RExC_parse[1] == '{') { /* Lookahead or eval. */ |
c277df42 IZ |
5410 | I32 flag; |
5411 | ||
830247a4 | 5412 | ret = reg_node(pRExC_state, LOGICAL); |
0f5d15d6 IZ |
5413 | if (!SIZE_ONLY) |
5414 | ret->flags = 1; | |
3dab1dad | 5415 | REGTAIL(pRExC_state, ret, reg(pRExC_state, 1, &flag,depth+1)); |
c277df42 | 5416 | goto insert_if; |
b81d288d | 5417 | } |
a0ed51b3 | 5418 | } |
0a4db386 YO |
5419 | else if ( RExC_parse[0] == '<' /* (?(<NAME>)...) */ |
5420 | || RExC_parse[0] == '\'' ) /* (?('NAME')...) */ | |
5421 | { | |
5422 | char ch = RExC_parse[0] == '<' ? '>' : '\''; | |
5423 | char *name_start= RExC_parse++; | |
2eccd3b2 | 5424 | U32 num = 0; |
0a4db386 YO |
5425 | SV *sv_dat=reg_scan_name(pRExC_state, |
5426 | SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA); | |
5427 | if (RExC_parse == name_start || *RExC_parse != ch) | |
5428 | vFAIL2("Sequence (?(%c... not terminated", | |
5429 | (ch == '>' ? '<' : ch)); | |
5430 | RExC_parse++; | |
5431 | if (!SIZE_ONLY) { | |
5432 | num = add_data( pRExC_state, 1, "S" ); | |
f8fc2ecf | 5433 | RExC_rxi->data->data[num]=(void*)sv_dat; |
0a4db386 YO |
5434 | SvREFCNT_inc(sv_dat); |
5435 | } | |
5436 | ret = reganode(pRExC_state,NGROUPP,num); | |
5437 | goto insert_if_check_paren; | |
5438 | } | |
5439 | else if (RExC_parse[0] == 'D' && | |
5440 | RExC_parse[1] == 'E' && | |
5441 | RExC_parse[2] == 'F' && | |
5442 | RExC_parse[3] == 'I' && | |
5443 | RExC_parse[4] == 'N' && | |
5444 | RExC_parse[5] == 'E') | |
5445 | { | |
5446 | ret = reganode(pRExC_state,DEFINEP,0); | |
5447 | RExC_parse +=6 ; | |
5448 | is_define = 1; | |
5449 | goto insert_if_check_paren; | |
5450 | } | |
5451 | else if (RExC_parse[0] == 'R') { | |
5452 | RExC_parse++; | |
5453 | parno = 0; | |
5454 | if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) { | |
5455 | parno = atoi(RExC_parse++); | |
5456 | while (isDIGIT(*RExC_parse)) | |
5457 | RExC_parse++; | |
5458 | } else if (RExC_parse[0] == '&') { | |
5459 | SV *sv_dat; | |
5460 | RExC_parse++; | |
5461 | sv_dat = reg_scan_name(pRExC_state, | |
5462 | SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA); | |
5463 | parno = sv_dat ? *((I32 *)SvPVX(sv_dat)) : 0; | |
5464 | } | |
1a147d38 | 5465 | ret = reganode(pRExC_state,INSUBP,parno); |
0a4db386 YO |
5466 | goto insert_if_check_paren; |
5467 | } | |
830247a4 | 5468 | else if (RExC_parse[0] >= '1' && RExC_parse[0] <= '9' ) { |
fac92740 | 5469 | /* (?(1)...) */ |
6136c704 | 5470 | char c; |
830247a4 | 5471 | parno = atoi(RExC_parse++); |
c277df42 | 5472 | |
830247a4 IZ |
5473 | while (isDIGIT(*RExC_parse)) |
5474 | RExC_parse++; | |
fac92740 | 5475 | ret = reganode(pRExC_state, GROUPP, parno); |
2af232bd | 5476 | |
0a4db386 | 5477 | insert_if_check_paren: |
830247a4 | 5478 | if ((c = *nextchar(pRExC_state)) != ')') |
b45f050a | 5479 | vFAIL("Switch condition not recognized"); |
c277df42 | 5480 | insert_if: |
3dab1dad YO |
5481 | REGTAIL(pRExC_state, ret, reganode(pRExC_state, IFTHEN, 0)); |
5482 | br = regbranch(pRExC_state, &flags, 1,depth+1); | |
c277df42 | 5483 | if (br == NULL) |
830247a4 | 5484 | br = reganode(pRExC_state, LONGJMP, 0); |
c277df42 | 5485 | else |
3dab1dad | 5486 | REGTAIL(pRExC_state, br, reganode(pRExC_state, LONGJMP, 0)); |
830247a4 | 5487 | c = *nextchar(pRExC_state); |
d1b80229 IZ |
5488 | if (flags&HASWIDTH) |
5489 | *flagp |= HASWIDTH; | |
c277df42 | 5490 | if (c == '|') { |
0a4db386 YO |
5491 | if (is_define) |
5492 | vFAIL("(?(DEFINE)....) does not allow branches"); | |
830247a4 | 5493 | lastbr = reganode(pRExC_state, IFTHEN, 0); /* Fake one for optimizer. */ |
3dab1dad YO |
5494 | regbranch(pRExC_state, &flags, 1,depth+1); |
5495 | REGTAIL(pRExC_state, ret, lastbr); | |
d1b80229 IZ |
5496 | if (flags&HASWIDTH) |
5497 | *flagp |= HASWIDTH; | |
830247a4 | 5498 | c = *nextchar(pRExC_state); |
a0ed51b3 LW |
5499 | } |
5500 | else | |
c277df42 IZ |
5501 | lastbr = NULL; |
5502 | if (c != ')') | |
8615cb43 | 5503 | vFAIL("Switch (?(condition)... contains too many branches"); |
830247a4 | 5504 | ender = reg_node(pRExC_state, TAIL); |
3dab1dad | 5505 | REGTAIL(pRExC_state, br, ender); |
c277df42 | 5506 | if (lastbr) { |
3dab1dad YO |
5507 | REGTAIL(pRExC_state, lastbr, ender); |
5508 | REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); | |
a0ed51b3 LW |
5509 | } |
5510 | else | |
3dab1dad | 5511 | REGTAIL(pRExC_state, ret, ender); |
3b57cd43 YO |
5512 | RExC_size++; /* XXX WHY do we need this?!! |
5513 | For large programs it seems to be required | |
5514 | but I can't figure out why. -- dmq*/ | |
c277df42 | 5515 | return ret; |
a0ed51b3 LW |
5516 | } |
5517 | else { | |
830247a4 | 5518 | vFAIL2("Unknown switch condition (?(%.2s", RExC_parse); |
c277df42 IZ |
5519 | } |
5520 | } | |
1b1626e4 | 5521 | case 0: |
830247a4 | 5522 | RExC_parse--; /* for vFAIL to print correctly */ |
8615cb43 | 5523 | vFAIL("Sequence (? incomplete"); |
1b1626e4 | 5524 | break; |
a0d0e21e | 5525 | default: |
cde0cee5 YO |
5526 | --RExC_parse; |
5527 | parse_flags: /* (?i) */ | |
5528 | { | |
5529 | U32 posflags = 0, negflags = 0; | |
5530 | U32 *flagsp = &posflags; | |
5531 | ||
5532 | while (*RExC_parse) { | |
5533 | /* && strchr("iogcmsx", *RExC_parse) */ | |
9d1d55b5 JP |
5534 | /* (?g), (?gc) and (?o) are useless here |
5535 | and must be globally applied -- japhy */ | |
cde0cee5 YO |
5536 | switch (*RExC_parse) { |
5537 | CASE_STD_PMMOD_FLAGS_PARSE_SET(flagsp); | |
5538 | case 'o': | |
5539 | case 'g': | |
9d1d55b5 | 5540 | if (SIZE_ONLY && ckWARN(WARN_REGEXP)) { |
6136c704 | 5541 | const I32 wflagbit = *RExC_parse == 'o' ? WASTED_O : WASTED_G; |
9d1d55b5 JP |
5542 | if (! (wastedflags & wflagbit) ) { |
5543 | wastedflags |= wflagbit; | |
5544 | vWARN5( | |
5545 | RExC_parse + 1, | |
5546 | "Useless (%s%c) - %suse /%c modifier", | |
5547 | flagsp == &negflags ? "?-" : "?", | |
5548 | *RExC_parse, | |
5549 | flagsp == &negflags ? "don't " : "", | |
5550 | *RExC_parse | |
5551 | ); | |
5552 | } | |
5553 | } | |
cde0cee5 YO |
5554 | break; |
5555 | ||
5556 | case 'c': | |
9d1d55b5 | 5557 | if (SIZE_ONLY && ckWARN(WARN_REGEXP)) { |
6136c704 AL |
5558 | if (! (wastedflags & WASTED_C) ) { |
5559 | wastedflags |= WASTED_GC; | |
9d1d55b5 JP |
5560 | vWARN3( |
5561 | RExC_parse + 1, | |
5562 | "Useless (%sc) - %suse /gc modifier", | |
5563 | flagsp == &negflags ? "?-" : "?", | |
5564 | flagsp == &negflags ? "don't " : "" | |
5565 | ); | |
5566 | } | |
5567 | } | |
cde0cee5 YO |
5568 | break; |
5569 | case 'k': | |
5570 | if (flagsp == &negflags) { | |
5571 | if (SIZE_ONLY && ckWARN(WARN_REGEXP)) | |
5572 | vWARN(RExC_parse + 1,"Useless use of (?-k)"); | |
5573 | } else { | |
5574 | *flagsp |= RXf_PMf_KEEPCOPY; | |
5575 | } | |
5576 | break; | |
5577 | case '-': | |
57b84237 YO |
5578 | if (flagsp == &negflags) { |
5579 | RExC_parse++; | |
5580 | vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart); | |
5581 | /*NOTREACHED*/ | |
5582 | } | |
cde0cee5 YO |
5583 | flagsp = &negflags; |
5584 | wastedflags = 0; /* reset so (?g-c) warns twice */ | |
5585 | break; | |
5586 | case ':': | |
5587 | paren = ':'; | |
5588 | /*FALLTHROUGH*/ | |
5589 | case ')': | |
5590 | RExC_flags |= posflags; | |
5591 | RExC_flags &= ~negflags; | |
5592 | nextchar(pRExC_state); | |
5593 | if (paren != ':') { | |
5594 | *flagp = TRYAGAIN; | |
5595 | return NULL; | |
5596 | } else { | |
5597 | ret = NULL; | |
5598 | goto parse_rest; | |
5599 | } | |
5600 | /*NOTREACHED*/ | |
5601 | default: | |
cde0cee5 YO |
5602 | RExC_parse++; |
5603 | vFAIL3("Sequence (%.*s...) not recognized", RExC_parse-seqstart, seqstart); | |
5604 | /*NOTREACHED*/ | |
5605 | } | |
830247a4 | 5606 | ++RExC_parse; |
48c036b1 | 5607 | } |
cde0cee5 | 5608 | }} /* one for the default block, one for the switch */ |
a0d0e21e | 5609 | } |
fac92740 | 5610 | else { /* (...) */ |
81714fb9 | 5611 | capturing_parens: |
830247a4 IZ |
5612 | parno = RExC_npar; |
5613 | RExC_npar++; | |
e2e6a0f1 | 5614 | |
830247a4 | 5615 | ret = reganode(pRExC_state, OPEN, parno); |
e2e6a0f1 YO |
5616 | if (!SIZE_ONLY ){ |
5617 | if (!RExC_nestroot) | |
5618 | RExC_nestroot = parno; | |
c009da3d YO |
5619 | if (RExC_seen & REG_SEEN_RECURSE |
5620 | && !RExC_open_parens[parno-1]) | |
5621 | { | |
e2e6a0f1 | 5622 | DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log, |
40d049e4 YO |
5623 | "Setting open paren #%"IVdf" to %d\n", |
5624 | (IV)parno, REG_NODE_NUM(ret))); | |
e2e6a0f1 YO |
5625 | RExC_open_parens[parno-1]= ret; |
5626 | } | |
6bda09f9 | 5627 | } |
fac92740 MJD |
5628 | Set_Node_Length(ret, 1); /* MJD */ |
5629 | Set_Node_Offset(ret, RExC_parse); /* MJD */ | |
6136c704 | 5630 | is_open = 1; |
a0d0e21e | 5631 | } |
a0ed51b3 | 5632 | } |
fac92740 | 5633 | else /* ! paren */ |
a0d0e21e | 5634 | ret = NULL; |
cde0cee5 YO |
5635 | |
5636 | parse_rest: | |
a0d0e21e | 5637 | /* Pick up the branches, linking them together. */ |
fac92740 | 5638 | parse_start = RExC_parse; /* MJD */ |
3dab1dad | 5639 | br = regbranch(pRExC_state, &flags, 1,depth+1); |
fac92740 | 5640 | /* branch_len = (paren != 0); */ |
2af232bd | 5641 | |
a0d0e21e LW |
5642 | if (br == NULL) |
5643 | return(NULL); | |
830247a4 IZ |
5644 | if (*RExC_parse == '|') { |
5645 | if (!SIZE_ONLY && RExC_extralen) { | |
6bda09f9 | 5646 | reginsert(pRExC_state, BRANCHJ, br, depth+1); |
a0ed51b3 | 5647 | } |
fac92740 | 5648 | else { /* MJD */ |
6bda09f9 | 5649 | reginsert(pRExC_state, BRANCH, br, depth+1); |
fac92740 MJD |
5650 | Set_Node_Length(br, paren != 0); |
5651 | Set_Node_Offset_To_R(br-RExC_emit_start, parse_start-RExC_start); | |
5652 | } | |
c277df42 IZ |
5653 | have_branch = 1; |
5654 | if (SIZE_ONLY) | |
830247a4 | 5655 | RExC_extralen += 1; /* For BRANCHJ-BRANCH. */ |
a0ed51b3 LW |
5656 | } |
5657 | else if (paren == ':') { | |
c277df42 IZ |
5658 | *flagp |= flags&SIMPLE; |
5659 | } | |
6136c704 | 5660 | if (is_open) { /* Starts with OPEN. */ |
3dab1dad | 5661 | REGTAIL(pRExC_state, ret, br); /* OPEN -> first. */ |
a0ed51b3 LW |
5662 | } |
5663 | else if (paren != '?') /* Not Conditional */ | |
a0d0e21e | 5664 | ret = br; |
8ae10a67 | 5665 | *flagp |= flags & (SPSTART | HASWIDTH | POSTPONED); |
c277df42 | 5666 | lastbr = br; |
830247a4 IZ |
5667 | while (*RExC_parse == '|') { |
5668 | if (!SIZE_ONLY && RExC_extralen) { | |
5669 | ender = reganode(pRExC_state, LONGJMP,0); | |
3dab1dad | 5670 | REGTAIL(pRExC_state, NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */ |
c277df42 IZ |
5671 | } |
5672 | if (SIZE_ONLY) | |
830247a4 IZ |
5673 | RExC_extralen += 2; /* Account for LONGJMP. */ |
5674 | nextchar(pRExC_state); | |
594d7033 YO |
5675 | if (freeze_paren) { |
5676 | if (RExC_npar > after_freeze) | |
5677 | after_freeze = RExC_npar; | |
5678 | RExC_npar = freeze_paren; | |
5679 | } | |
3dab1dad | 5680 | br = regbranch(pRExC_state, &flags, 0, depth+1); |
2af232bd | 5681 | |
a687059c | 5682 | if (br == NULL) |
a0d0e21e | 5683 | return(NULL); |
3dab1dad | 5684 | REGTAIL(pRExC_state, lastbr, br); /* BRANCH -> BRANCH. */ |
c277df42 | 5685 | lastbr = br; |
8ae10a67 | 5686 | *flagp |= flags & (SPSTART | HASWIDTH | POSTPONED); |
a0d0e21e LW |
5687 | } |
5688 | ||
c277df42 IZ |
5689 | if (have_branch || paren != ':') { |
5690 | /* Make a closing node, and hook it on the end. */ | |
5691 | switch (paren) { | |
5692 | case ':': | |
830247a4 | 5693 | ender = reg_node(pRExC_state, TAIL); |
c277df42 IZ |
5694 | break; |
5695 | case 1: | |
830247a4 | 5696 | ender = reganode(pRExC_state, CLOSE, parno); |
40d049e4 YO |
5697 | if (!SIZE_ONLY && RExC_seen & REG_SEEN_RECURSE) { |
5698 | DEBUG_OPTIMISE_MORE_r(PerlIO_printf(Perl_debug_log, | |
5699 | "Setting close paren #%"IVdf" to %d\n", | |
5700 | (IV)parno, REG_NODE_NUM(ender))); | |
5701 | RExC_close_parens[parno-1]= ender; | |
e2e6a0f1 YO |
5702 | if (RExC_nestroot == parno) |
5703 | RExC_nestroot = 0; | |
40d049e4 | 5704 | } |
fac92740 MJD |
5705 | Set_Node_Offset(ender,RExC_parse+1); /* MJD */ |
5706 | Set_Node_Length(ender,1); /* MJD */ | |
c277df42 IZ |
5707 | break; |
5708 | case '<': | |
c277df42 IZ |
5709 | case ',': |
5710 | case '=': | |
5711 | case '!': | |
c277df42 | 5712 | *flagp &= ~HASWIDTH; |
821b33a5 IZ |
5713 | /* FALL THROUGH */ |
5714 | case '>': | |
830247a4 | 5715 | ender = reg_node(pRExC_state, SUCCEED); |
c277df42 IZ |
5716 | break; |
5717 | case 0: | |
830247a4 | 5718 | ender = reg_node(pRExC_state, END); |
40d049e4 YO |
5719 | if (!SIZE_ONLY) { |
5720 | assert(!RExC_opend); /* there can only be one! */ | |
5721 | RExC_opend = ender; | |
5722 | } | |
c277df42 IZ |
5723 | break; |
5724 | } | |
eaf3ca90 | 5725 | REGTAIL(pRExC_state, lastbr, ender); |
a0d0e21e | 5726 | |
9674d46a | 5727 | if (have_branch && !SIZE_ONLY) { |
eaf3ca90 YO |
5728 | if (depth==1) |
5729 | RExC_seen |= REG_TOP_LEVEL_BRANCHES; | |
5730 | ||
c277df42 | 5731 | /* Hook the tails of the branches to the closing node. */ |
9674d46a AL |
5732 | for (br = ret; br; br = regnext(br)) { |
5733 | const U8 op = PL_regkind[OP(br)]; | |
5734 | if (op == BRANCH) { | |
07be1b83 | 5735 | REGTAIL_STUDY(pRExC_state, NEXTOPER(br), ender); |
9674d46a AL |
5736 | } |
5737 | else if (op == BRANCHJ) { | |
07be1b83 | 5738 | REGTAIL_STUDY(pRExC_state, NEXTOPER(NEXTOPER(br)), ender); |
9674d46a | 5739 | } |
c277df42 IZ |
5740 | } |
5741 | } | |
a0d0e21e | 5742 | } |
c277df42 IZ |
5743 | |
5744 | { | |
e1ec3a88 AL |
5745 | const char *p; |
5746 | static const char parens[] = "=!<,>"; | |
c277df42 IZ |
5747 | |
5748 | if (paren && (p = strchr(parens, paren))) { | |
eb160463 | 5749 | U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH; |
c277df42 IZ |
5750 | int flag = (p - parens) > 1; |
5751 | ||
5752 | if (paren == '>') | |
5753 | node = SUSPEND, flag = 0; | |
6bda09f9 | 5754 | reginsert(pRExC_state, node,ret, depth+1); |
45948336 EP |
5755 | Set_Node_Cur_Length(ret); |
5756 | Set_Node_Offset(ret, parse_start + 1); | |
c277df42 | 5757 | ret->flags = flag; |
07be1b83 | 5758 | REGTAIL_STUDY(pRExC_state, ret, reg_node(pRExC_state, TAIL)); |
c277df42 | 5759 | } |
a0d0e21e LW |
5760 | } |
5761 | ||
5762 | /* Check for proper termination. */ | |
ce3e6498 | 5763 | if (paren) { |
e2509266 | 5764 | RExC_flags = oregflags; |
830247a4 IZ |
5765 | if (RExC_parse >= RExC_end || *nextchar(pRExC_state) != ')') { |
5766 | RExC_parse = oregcomp_parse; | |
380a0633 | 5767 | vFAIL("Unmatched ("); |
ce3e6498 | 5768 | } |
a0ed51b3 | 5769 | } |
830247a4 IZ |
5770 | else if (!paren && RExC_parse < RExC_end) { |
5771 | if (*RExC_parse == ')') { | |
5772 | RExC_parse++; | |
380a0633 | 5773 | vFAIL("Unmatched )"); |
a0ed51b3 LW |
5774 | } |
5775 | else | |
b45f050a | 5776 | FAIL("Junk on end of regexp"); /* "Can't happen". */ |
a0d0e21e LW |
5777 | /* NOTREACHED */ |
5778 | } | |
594d7033 YO |
5779 | if (after_freeze) |
5780 | RExC_npar = after_freeze; | |
a0d0e21e | 5781 | return(ret); |
a687059c LW |
5782 | } |
5783 | ||
5784 | /* | |
5785 | - regbranch - one alternative of an | operator | |
5786 | * | |
5787 | * Implements the concatenation operator. | |
5788 | */ | |
76e3520e | 5789 | STATIC regnode * |
3dab1dad | 5790 | S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth) |
a687059c | 5791 | { |
97aff369 | 5792 | dVAR; |
c277df42 IZ |
5793 | register regnode *ret; |
5794 | register regnode *chain = NULL; | |
5795 | register regnode *latest; | |
5796 | I32 flags = 0, c = 0; | |
3dab1dad YO |
5797 | GET_RE_DEBUG_FLAGS_DECL; |
5798 | DEBUG_PARSE("brnc"); | |
b81d288d | 5799 | if (first) |
c277df42 IZ |
5800 | ret = NULL; |
5801 | else { | |
b81d288d | 5802 | if (!SIZE_ONLY && RExC_extralen) |
830247a4 | 5803 | ret = reganode(pRExC_state, BRANCHJ,0); |
fac92740 | 5804 | else { |
830247a4 | 5805 | ret = reg_node(pRExC_state, BRANCH); |
fac92740 MJD |
5806 | Set_Node_Length(ret, 1); |
5807 | } | |
c277df42 IZ |
5808 | } |
5809 | ||
b81d288d | 5810 | if (!first && SIZE_ONLY) |
830247a4 | 5811 | RExC_extralen += 1; /* BRANCHJ */ |
b81d288d | 5812 | |
c277df42 | 5813 | *flagp = WORST; /* Tentatively. */ |
a0d0e21e | 5814 | |
830247a4 IZ |
5815 | RExC_parse--; |
5816 | nextchar(pRExC_state); | |
5817 | while (RExC_parse < RExC_end && *RExC_parse != '|' && *RExC_parse != ')') { | |
a0d0e21e | 5818 | flags &= ~TRYAGAIN; |
3dab1dad | 5819 | latest = regpiece(pRExC_state, &flags,depth+1); |
a0d0e21e LW |
5820 | if (latest == NULL) { |
5821 | if (flags & TRYAGAIN) | |
5822 | continue; | |
5823 | return(NULL); | |
a0ed51b3 LW |
5824 | } |
5825 | else if (ret == NULL) | |
c277df42 | 5826 | ret = latest; |
8ae10a67 | 5827 | *flagp |= flags&(HASWIDTH|POSTPONED); |
c277df42 | 5828 | if (chain == NULL) /* First piece. */ |
a0d0e21e LW |
5829 | *flagp |= flags&SPSTART; |
5830 | else { | |
830247a4 | 5831 | RExC_naughty++; |
3dab1dad | 5832 | REGTAIL(pRExC_state, chain, latest); |
a687059c | 5833 | } |
a0d0e21e | 5834 | chain = latest; |
c277df42 IZ |
5835 | c++; |
5836 | } | |
5837 | if (chain == NULL) { /* Loop ran zero times. */ | |
830247a4 | 5838 | chain = reg_node(pRExC_state, NOTHING); |
c277df42 IZ |
5839 | if (ret == NULL) |
5840 | ret = chain; | |
5841 | } | |
5842 | if (c == 1) { | |
5843 | *flagp |= flags&SIMPLE; | |
a0d0e21e | 5844 | } |
a687059c | 5845 | |
d4c19fe8 | 5846 | return ret; |
a687059c LW |
5847 | } |
5848 | ||
5849 | /* | |
5850 | - regpiece - something followed by possible [*+?] | |
5851 | * | |
5852 | * Note that the branching code sequences used for ? and the general cases | |
5853 | * of * and + are somewhat optimized: they use the same NOTHING node as | |
5854 | * both the endmarker for their branch list and the body of the last branch. | |
5855 | * It might seem that this node could be dispensed with entirely, but the | |
5856 | * endmarker role is not redundant. | |
5857 | */ | |
76e3520e | 5858 | STATIC regnode * |
3dab1dad | 5859 | S_regpiece(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth) |
a687059c | 5860 | { |
97aff369 | 5861 | dVAR; |
c277df42 | 5862 | register regnode *ret; |
a0d0e21e LW |
5863 | register char op; |
5864 | register char *next; | |
5865 | I32 flags; | |
1df70142 | 5866 | const char * const origparse = RExC_parse; |
a0d0e21e | 5867 | I32 min; |
c277df42 | 5868 | I32 max = REG_INFTY; |
fac92740 | 5869 | char *parse_start; |
10edeb5d | 5870 | const char *maxpos = NULL; |
3dab1dad YO |
5871 | GET_RE_DEBUG_FLAGS_DECL; |
5872 | DEBUG_PARSE("piec"); | |
a0d0e21e | 5873 | |
3dab1dad | 5874 | ret = regatom(pRExC_state, &flags,depth+1); |
a0d0e21e LW |
5875 | if (ret == NULL) { |
5876 | if (flags & TRYAGAIN) | |
5877 | *flagp |= TRYAGAIN; | |
5878 | return(NULL); | |
5879 | } | |
5880 | ||
830247a4 | 5881 | op = *RExC_parse; |
a0d0e21e | 5882 | |
830247a4 | 5883 | if (op == '{' && regcurly(RExC_parse)) { |
10edeb5d | 5884 | maxpos = NULL; |
fac92740 | 5885 | parse_start = RExC_parse; /* MJD */ |
830247a4 | 5886 | next = RExC_parse + 1; |
a0d0e21e LW |
5887 | while (isDIGIT(*next) || *next == ',') { |
5888 | if (*next == ',') { | |
5889 | if (maxpos) | |
5890 | break; | |
5891 | else | |
5892 | maxpos = next; | |
a687059c | 5893 | } |
a0d0e21e LW |
5894 | next++; |
5895 | } | |
5896 | if (*next == '}') { /* got one */ | |
5897 | if (!maxpos) | |
5898 | maxpos = next; | |
830247a4 IZ |
5899 | RExC_parse++; |
5900 | min = atoi(RExC_parse); | |
a0d0e21e LW |
5901 | if (*maxpos == ',') |
5902 | maxpos++; | |
5903 | else | |
830247a4 | 5904 | maxpos = RExC_parse; |
a0d0e21e LW |
5905 | max = atoi(maxpos); |
5906 | if (!max && *maxpos != '0') | |
c277df42 IZ |
5907 | max = REG_INFTY; /* meaning "infinity" */ |
5908 | else if (max >= REG_INFTY) | |
8615cb43 | 5909 | vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1); |
830247a4 IZ |
5910 | RExC_parse = next; |
5911 | nextchar(pRExC_state); | |
a0d0e21e LW |
5912 | |
5913 | do_curly: | |
5914 | if ((flags&SIMPLE)) { | |
830247a4 | 5915 | RExC_naughty += 2 + RExC_naughty / 2; |
6bda09f9 | 5916 | reginsert(pRExC_state, CURLY, ret, depth+1); |
fac92740 MJD |
5917 | Set_Node_Offset(ret, parse_start+1); /* MJD */ |
5918 | Set_Node_Cur_Length(ret); | |
a0d0e21e LW |
5919 | } |
5920 | else { | |
3dab1dad | 5921 | regnode * const w = reg_node(pRExC_state, WHILEM); |
2c2d71f5 JH |
5922 | |
5923 | w->flags = 0; | |
3dab1dad | 5924 | REGTAIL(pRExC_state, ret, w); |
830247a4 | 5925 | if (!SIZE_ONLY && RExC_extralen) { |
6bda09f9 YO |
5926 | reginsert(pRExC_state, LONGJMP,ret, depth+1); |
5927 | reginsert(pRExC_state, NOTHING,ret, depth+1); | |
c277df42 IZ |
5928 | NEXT_OFF(ret) = 3; /* Go over LONGJMP. */ |
5929 | } | |
6bda09f9 | 5930 | reginsert(pRExC_state, CURLYX,ret, depth+1); |
fac92740 MJD |
5931 | /* MJD hk */ |
5932 | Set_Node_Offset(ret, parse_start+1); | |
2af232bd | 5933 | Set_Node_Length(ret, |
fac92740 | 5934 | op == '{' ? (RExC_parse - parse_start) : 1); |
2af232bd | 5935 | |
830247a4 | 5936 | if (!SIZE_ONLY && RExC_extralen) |
c277df42 | 5937 | NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */ |
3dab1dad | 5938 | REGTAIL(pRExC_state, ret, reg_node(pRExC_state, NOTHING)); |
c277df42 | 5939 | if (SIZE_ONLY) |
830247a4 IZ |
5940 | RExC_whilem_seen++, RExC_extralen += 3; |
5941 | RExC_naughty += 4 + RExC_naughty; /* compound interest */ | |
a0d0e21e | 5942 | } |
c277df42 | 5943 | ret->flags = 0; |
a0d0e21e LW |
5944 | |
5945 | if (min > 0) | |
821b33a5 IZ |
5946 | *flagp = WORST; |
5947 | if (max > 0) | |
5948 | *flagp |= HASWIDTH; | |
a0d0e21e | 5949 | if (max && max < min) |
8615cb43 | 5950 | vFAIL("Can't do {n,m} with n > m"); |
c277df42 | 5951 | if (!SIZE_ONLY) { |
eb160463 GS |
5952 | ARG1_SET(ret, (U16)min); |
5953 | ARG2_SET(ret, (U16)max); | |
a687059c | 5954 | } |
a687059c | 5955 | |
a0d0e21e | 5956 | goto nest_check; |
a687059c | 5957 | } |
a0d0e21e | 5958 | } |
a687059c | 5959 | |
a0d0e21e LW |
5960 | if (!ISMULT1(op)) { |
5961 | *flagp = flags; | |
a687059c | 5962 | return(ret); |
a0d0e21e | 5963 | } |
bb20fd44 | 5964 | |
c277df42 | 5965 | #if 0 /* Now runtime fix should be reliable. */ |
b45f050a JF |
5966 | |
5967 | /* if this is reinstated, don't forget to put this back into perldiag: | |
5968 | ||
5969 | =item Regexp *+ operand could be empty at {#} in regex m/%s/ | |
5970 | ||
5971 | (F) The part of the regexp subject to either the * or + quantifier | |
5972 | could match an empty string. The {#} shows in the regular | |
5973 | expression about where the problem was discovered. | |
5974 | ||
5975 | */ | |
5976 | ||
bb20fd44 | 5977 | if (!(flags&HASWIDTH) && op != '?') |
b45f050a | 5978 | vFAIL("Regexp *+ operand could be empty"); |
b81d288d | 5979 | #endif |
bb20fd44 | 5980 | |
fac92740 | 5981 | parse_start = RExC_parse; |
830247a4 | 5982 | nextchar(pRExC_state); |
a0d0e21e | 5983 | |
821b33a5 | 5984 | *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH); |
a0d0e21e LW |
5985 | |
5986 | if (op == '*' && (flags&SIMPLE)) { | |
6bda09f9 | 5987 | reginsert(pRExC_state, STAR, ret, depth+1); |
c277df42 | 5988 | ret->flags = 0; |
830247a4 | 5989 | RExC_naughty += 4; |
a0d0e21e LW |
5990 | } |
5991 | else if (op == '*') { | |
5992 | min = 0; | |
5993 | goto do_curly; | |
a0ed51b3 LW |
5994 | } |
5995 | else if (op == '+' && (flags&SIMPLE)) { | |
6bda09f9 | 5996 | reginsert(pRExC_state, PLUS, ret, depth+1); |
c277df42 | 5997 | ret->flags = 0; |
830247a4 | 5998 | RExC_naughty += 3; |
a0d0e21e LW |
5999 | } |
6000 | else if (op == '+') { | |
6001 | min = 1; | |
6002 | goto do_curly; | |
a0ed51b3 LW |
6003 | } |
6004 | else if (op == '?') { | |
a0d0e21e LW |
6005 | min = 0; max = 1; |
6006 | goto do_curly; | |
6007 | } | |
6008 | nest_check: | |
a3b492c3 | 6009 | if (!SIZE_ONLY && !(flags&(HASWIDTH|POSTPONED)) && max > REG_INFTY/3 && ckWARN(WARN_REGEXP)) { |
830247a4 | 6010 | vWARN3(RExC_parse, |
b45f050a | 6011 | "%.*s matches null string many times", |
afd78fd5 | 6012 | (int)(RExC_parse >= origparse ? RExC_parse - origparse : 0), |
b45f050a | 6013 | origparse); |
a0d0e21e LW |
6014 | } |
6015 | ||
b9b4dddf | 6016 | if (RExC_parse < RExC_end && *RExC_parse == '?') { |
830247a4 | 6017 | nextchar(pRExC_state); |
6bda09f9 | 6018 | reginsert(pRExC_state, MINMOD, ret, depth+1); |
3dab1dad | 6019 | REGTAIL(pRExC_state, ret, ret + NODE_STEP_REGNODE); |
a0d0e21e | 6020 | } |
b9b4dddf YO |
6021 | #ifndef REG_ALLOW_MINMOD_SUSPEND |
6022 | else | |
6023 | #endif | |
6024 | if (RExC_parse < RExC_end && *RExC_parse == '+') { | |
6025 | regnode *ender; | |
6026 | nextchar(pRExC_state); | |
6027 | ender = reg_node(pRExC_state, SUCCEED); | |
6028 | REGTAIL(pRExC_state, ret, ender); | |
6029 | reginsert(pRExC_state, SUSPEND, ret, depth+1); | |
6030 | ret->flags = 0; | |
6031 | ender = reg_node(pRExC_state, TAIL); | |
6032 | REGTAIL(pRExC_state, ret, ender); | |
6033 | /*ret= ender;*/ | |
6034 | } | |
6035 | ||
6036 | if (RExC_parse < RExC_end && ISMULT2(RExC_parse)) { | |
830247a4 | 6037 | RExC_parse++; |
b45f050a JF |
6038 | vFAIL("Nested quantifiers"); |
6039 | } | |
a0d0e21e LW |
6040 | |
6041 | return(ret); | |
a687059c LW |
6042 | } |
6043 | ||
fc8cd66c YO |
6044 | |
6045 | /* reg_namedseq(pRExC_state,UVp) | |
6046 | ||
6047 | This is expected to be called by a parser routine that has | |
6048 | recognized'\N' and needs to handle the rest. RExC_parse is | |
6049 | expected to point at the first char following the N at the time | |
6050 | of the call. | |
6051 | ||
6052 | If valuep is non-null then it is assumed that we are parsing inside | |
6053 | of a charclass definition and the first codepoint in the resolved | |
6054 | string is returned via *valuep and the routine will return NULL. | |
6055 | In this mode if a multichar string is returned from the charnames | |
6056 | handler a warning will be issued, and only the first char in the | |
6057 | sequence will be examined. If the string returned is zero length | |
6058 | then the value of *valuep is undefined and NON-NULL will | |
6059 | be returned to indicate failure. (This will NOT be a valid pointer | |
6060 | to a regnode.) | |
6061 | ||
6062 | If value is null then it is assumed that we are parsing normal text | |
6063 | and inserts a new EXACT node into the program containing the resolved | |
6064 | string and returns a pointer to the new node. If the string is | |
6065 | zerolength a NOTHING node is emitted. | |
6066 | ||
6067 | On success RExC_parse is set to the char following the endbrace. | |
6068 | Parsing failures will generate a fatal errorvia vFAIL(...) | |
6069 | ||
6070 | NOTE: We cache all results from the charnames handler locally in | |
6071 | the RExC_charnames hash (created on first use) to prevent a charnames | |
6072 | handler from playing silly-buggers and returning a short string and | |
6073 | then a long string for a given pattern. Since the regexp program | |
6074 | size is calculated during an initial parse this would result | |
6075 | in a buffer overrun so we cache to prevent the charname result from | |
6076 | changing during the course of the parse. | |
6077 | ||
6078 | */ | |
6079 | STATIC regnode * | |
6080 | S_reg_namedseq(pTHX_ RExC_state_t *pRExC_state, UV *valuep) | |
6081 | { | |
6082 | char * name; /* start of the content of the name */ | |
6083 | char * endbrace; /* endbrace following the name */ | |
6084 | SV *sv_str = NULL; | |
6085 | SV *sv_name = NULL; | |
6086 | STRLEN len; /* this has various purposes throughout the code */ | |
6087 | bool cached = 0; /* if this is true then we shouldn't refcount dev sv_str */ | |
6088 | regnode *ret = NULL; | |
6089 | ||
6090 | if (*RExC_parse != '{') { | |
6091 | vFAIL("Missing braces on \\N{}"); | |
6092 | } | |
6093 | name = RExC_parse+1; | |
6094 | endbrace = strchr(RExC_parse, '}'); | |
6095 | if ( ! endbrace ) { | |
6096 | RExC_parse++; | |
6097 | vFAIL("Missing right brace on \\N{}"); | |
6098 | } | |
6099 | RExC_parse = endbrace + 1; | |
6100 | ||
6101 | ||
6102 | /* RExC_parse points at the beginning brace, | |
6103 | endbrace points at the last */ | |
6104 | if ( name[0]=='U' && name[1]=='+' ) { | |
6105 | /* its a "unicode hex" notation {U+89AB} */ | |
6106 | I32 fl = PERL_SCAN_ALLOW_UNDERSCORES | |
6107 | | PERL_SCAN_DISALLOW_PREFIX | |
6108 | | (SIZE_ONLY ? PERL_SCAN_SILENT_ILLDIGIT : 0); | |
6109 | UV cp; | |
196f1508 | 6110 | len = (STRLEN)(endbrace - name - 2); |
fc8cd66c | 6111 | cp = grok_hex(name + 2, &len, &fl, NULL); |
196f1508 | 6112 | if ( len != (STRLEN)(endbrace - name - 2) ) { |
fc8cd66c YO |
6113 | cp = 0xFFFD; |
6114 | } | |
6115 | if (cp > 0xff) | |
6116 | RExC_utf8 = 1; | |
6117 | if ( valuep ) { | |
6118 | *valuep = cp; | |
6119 | return NULL; | |
6120 | } | |
6121 | sv_str= Perl_newSVpvf_nocontext("%c",(int)cp); | |
6122 | } else { | |
6123 | /* fetch the charnames handler for this scope */ | |
6124 | HV * const table = GvHV(PL_hintgv); | |
6125 | SV **cvp= table ? | |
6126 | hv_fetchs(table, "charnames", FALSE) : | |
6127 | NULL; | |
6128 | SV *cv= cvp ? *cvp : NULL; | |
6129 | HE *he_str; | |
6130 | int count; | |
6131 | /* create an SV with the name as argument */ | |
6132 | sv_name = newSVpvn(name, endbrace - name); | |
6133 | ||
6134 | if (!table || !(PL_hints & HINT_LOCALIZE_HH)) { | |
6135 | vFAIL2("Constant(\\N{%s}) unknown: " | |
6136 | "(possibly a missing \"use charnames ...\")", | |
6137 | SvPVX(sv_name)); | |
6138 | } | |
6139 | if (!cvp || !SvOK(*cvp)) { /* when $^H{charnames} = undef; */ | |
6140 | vFAIL2("Constant(\\N{%s}): " | |
6141 | "$^H{charnames} is not defined",SvPVX(sv_name)); | |
6142 | } | |
6143 | ||
6144 | ||
6145 | ||
6146 | if (!RExC_charnames) { | |
6147 | /* make sure our cache is allocated */ | |
6148 | RExC_charnames = newHV(); | |
6bda09f9 | 6149 | sv_2mortal((SV*)RExC_charnames); |
fc8cd66c YO |
6150 | } |
6151 | /* see if we have looked this one up before */ | |
6152 | he_str = hv_fetch_ent( RExC_charnames, sv_name, 0, 0 ); | |
6153 | if ( he_str ) { | |
6154 | sv_str = HeVAL(he_str); | |
6155 | cached = 1; | |
6156 | } else { | |
6157 | dSP ; | |
6158 | ||
6159 | ENTER ; | |
6160 | SAVETMPS ; | |
6161 | PUSHMARK(SP) ; | |
6162 | ||
6163 | XPUSHs(sv_name); | |
6164 | ||
6165 | PUTBACK ; | |
6166 | ||
6167 | count= call_sv(cv, G_SCALAR); | |
6168 | ||
6169 | if (count == 1) { /* XXXX is this right? dmq */ | |
6170 | sv_str = POPs; | |
6171 | SvREFCNT_inc_simple_void(sv_str); | |
6172 | } | |
6173 | ||
6174 | SPAGAIN ; | |
6175 | PUTBACK ; | |
6176 | FREETMPS ; | |
6177 | LEAVE ; | |
6178 | ||
6179 | if ( !sv_str || !SvOK(sv_str) ) { | |
6180 | vFAIL2("Constant(\\N{%s}): Call to &{$^H{charnames}} " | |
6181 | "did not return a defined value",SvPVX(sv_name)); | |
6182 | } | |
6183 | if (hv_store_ent( RExC_charnames, sv_name, sv_str, 0)) | |
6184 | cached = 1; | |
6185 | } | |
6186 | } | |
6187 | if (valuep) { | |
6188 | char *p = SvPV(sv_str, len); | |
6189 | if (len) { | |
6190 | STRLEN numlen = 1; | |
6191 | if ( SvUTF8(sv_str) ) { | |
196f1508 | 6192 | *valuep = utf8_to_uvchr((U8*)p, &numlen); |
fc8cd66c YO |
6193 | if (*valuep > 0x7F) |
6194 | RExC_utf8 = 1; | |
6195 | /* XXXX | |
6196 | We have to turn on utf8 for high bit chars otherwise | |
6197 | we get failures with | |
6198 | ||
6199 | "ss" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i | |
6200 | "SS" =~ /[\N{LATIN SMALL LETTER SHARP S}]/i | |
6201 | ||
6202 | This is different from what \x{} would do with the same | |
6203 | codepoint, where the condition is > 0xFF. | |
6204 | - dmq | |
6205 | */ | |
6206 | ||
6207 | ||
6208 | } else { | |
6209 | *valuep = (UV)*p; | |
6210 | /* warn if we havent used the whole string? */ | |
6211 | } | |
6212 | if (numlen<len && SIZE_ONLY && ckWARN(WARN_REGEXP)) { | |
6213 | vWARN2(RExC_parse, | |
6214 | "Ignoring excess chars from \\N{%s} in character class", | |
6215 | SvPVX(sv_name) | |
6216 | ); | |
6217 | } | |
6218 | } else if (SIZE_ONLY && ckWARN(WARN_REGEXP)) { | |
6219 | vWARN2(RExC_parse, | |
6220 | "Ignoring zero length \\N{%s} in character class", | |
6221 | SvPVX(sv_name) | |
6222 | ); | |
6223 | } | |
6224 | if (sv_name) | |
6225 | SvREFCNT_dec(sv_name); | |
6226 | if (!cached) | |
6227 | SvREFCNT_dec(sv_str); | |
6228 | return len ? NULL : (regnode *)&len; | |
6229 | } else if(SvCUR(sv_str)) { | |
6230 | ||
6231 | char *s; | |
6232 | char *p, *pend; | |
6233 | STRLEN charlen = 1; | |
d008bc60 | 6234 | #ifdef DEBUGGING |
fc8cd66c | 6235 | char * parse_start = name-3; /* needed for the offsets */ |
d008bc60 | 6236 | #endif |
fc8cd66c YO |
6237 | GET_RE_DEBUG_FLAGS_DECL; /* needed for the offsets */ |
6238 | ||
6239 | ret = reg_node(pRExC_state, | |
6240 | (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT)); | |
6241 | s= STRING(ret); | |
6242 | ||
6243 | if ( RExC_utf8 && !SvUTF8(sv_str) ) { | |
6244 | sv_utf8_upgrade(sv_str); | |
6245 | } else if ( !RExC_utf8 && SvUTF8(sv_str) ) { | |
6246 | RExC_utf8= 1; | |
6247 | } | |
6248 | ||
6249 | p = SvPV(sv_str, len); | |
6250 | pend = p + len; | |
6251 | /* len is the length written, charlen is the size the char read */ | |
6252 | for ( len = 0; p < pend; p += charlen ) { | |
6253 | if (UTF) { | |
196f1508 | 6254 | UV uvc = utf8_to_uvchr((U8*)p, &charlen); |
fc8cd66c YO |
6255 | if (FOLD) { |
6256 | STRLEN foldlen,numlen; | |
6257 | U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf; | |
6258 | uvc = toFOLD_uni(uvc, tmpbuf, &foldlen); | |
6259 | /* Emit all the Unicode characters. */ | |
6260 | ||
6261 | for (foldbuf = tmpbuf; | |
6262 | foldlen; | |
6263 | foldlen -= numlen) | |
6264 | { | |
6265 | uvc = utf8_to_uvchr(foldbuf, &numlen); | |
6266 | if (numlen > 0) { | |
6267 | const STRLEN unilen = reguni(pRExC_state, uvc, s); | |
6268 | s += unilen; | |
6269 | len += unilen; | |
6270 | /* In EBCDIC the numlen | |
6271 | * and unilen can differ. */ | |
6272 | foldbuf += numlen; | |
6273 | if (numlen >= foldlen) | |
6274 | break; | |
6275 | } | |
6276 | else | |
6277 | break; /* "Can't happen." */ | |
6278 | } | |
6279 | } else { | |
6280 | const STRLEN unilen = reguni(pRExC_state, uvc, s); | |
6281 | if (unilen > 0) { | |
6282 | s += unilen; | |
6283 | len += unilen; | |
6284 | } | |
6285 | } | |
6286 | } else { | |
6287 | len++; | |
6288 | REGC(*p, s++); | |
6289 | } | |
6290 | } | |
6291 | if (SIZE_ONLY) { | |
6292 | RExC_size += STR_SZ(len); | |
6293 | } else { | |
6294 | STR_LEN(ret) = len; | |
6295 | RExC_emit += STR_SZ(len); | |
6296 | } | |
6297 | Set_Node_Cur_Length(ret); /* MJD */ | |
6298 | RExC_parse--; | |
6299 | nextchar(pRExC_state); | |
6300 | } else { | |
6301 | ret = reg_node(pRExC_state,NOTHING); | |
6302 | } | |
6303 | if (!cached) { | |
6304 | SvREFCNT_dec(sv_str); | |
6305 | } | |
6306 | if (sv_name) { | |
6307 | SvREFCNT_dec(sv_name); | |
6308 | } | |
6309 | return ret; | |
6310 | ||
6311 | } | |
6312 | ||
6313 | ||
9e08bc66 TS |
6314 | /* |
6315 | * reg_recode | |
6316 | * | |
6317 | * It returns the code point in utf8 for the value in *encp. | |
6318 | * value: a code value in the source encoding | |
6319 | * encp: a pointer to an Encode object | |
6320 | * | |
6321 | * If the result from Encode is not a single character, | |
6322 | * it returns U+FFFD (Replacement character) and sets *encp to NULL. | |
6323 | */ | |
6324 | STATIC UV | |
6325 | S_reg_recode(pTHX_ const char value, SV **encp) | |
6326 | { | |
6327 | STRLEN numlen = 1; | |
6328 | SV * const sv = sv_2mortal(newSVpvn(&value, numlen)); | |
6329 | const char * const s = encp && *encp ? sv_recode_to_utf8(sv, *encp) | |
6330 | : SvPVX(sv); | |
6331 | const STRLEN newlen = SvCUR(sv); | |
6332 | UV uv = UNICODE_REPLACEMENT; | |
6333 | ||
6334 | if (newlen) | |
6335 | uv = SvUTF8(sv) | |
6336 | ? utf8n_to_uvchr((U8*)s, newlen, &numlen, UTF8_ALLOW_DEFAULT) | |
6337 | : *(U8*)s; | |
6338 | ||
6339 | if (!newlen || numlen != newlen) { | |
6340 | uv = UNICODE_REPLACEMENT; | |
6341 | if (encp) | |
6342 | *encp = NULL; | |
6343 | } | |
6344 | return uv; | |
6345 | } | |
6346 | ||
fc8cd66c | 6347 | |
a687059c LW |
6348 | /* |
6349 | - regatom - the lowest level | |
ee9b8eae YO |
6350 | |
6351 | Try to identify anything special at the start of the pattern. If there | |
6352 | is, then handle it as required. This may involve generating a single regop, | |
6353 | such as for an assertion; or it may involve recursing, such as to | |
6354 | handle a () structure. | |
6355 | ||
6356 | If the string doesn't start with something special then we gobble up | |
6357 | as much literal text as we can. | |
6358 | ||
6359 | Once we have been able to handle whatever type of thing started the | |
6360 | sequence, we return. | |
6361 | ||
6362 | Note: we have to be careful with escapes, as they can be both literal | |
6363 | and special, and in the case of \10 and friends can either, depending | |
6364 | on context. Specifically there are two seperate switches for handling | |
6365 | escape sequences, with the one for handling literal escapes requiring | |
6366 | a dummy entry for all of the special escapes that are actually handled | |
6367 | by the other. | |
6368 | */ | |
6369 | ||
76e3520e | 6370 | STATIC regnode * |
3dab1dad | 6371 | S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth) |
a687059c | 6372 | { |
97aff369 | 6373 | dVAR; |
cbbf8932 | 6374 | register regnode *ret = NULL; |
a0d0e21e | 6375 | I32 flags; |
45948336 | 6376 | char *parse_start = RExC_parse; |
3dab1dad YO |
6377 | GET_RE_DEBUG_FLAGS_DECL; |
6378 | DEBUG_PARSE("atom"); | |
a0d0e21e LW |
6379 | *flagp = WORST; /* Tentatively. */ |
6380 | ||
ee9b8eae | 6381 | |
a0d0e21e | 6382 | tryagain: |
830247a4 | 6383 | switch (*RExC_parse) { |
a0d0e21e | 6384 | case '^': |
830247a4 IZ |
6385 | RExC_seen_zerolen++; |
6386 | nextchar(pRExC_state); | |
bbe252da | 6387 | if (RExC_flags & RXf_PMf_MULTILINE) |
830247a4 | 6388 | ret = reg_node(pRExC_state, MBOL); |
bbe252da | 6389 | else if (RExC_flags & RXf_PMf_SINGLELINE) |
830247a4 | 6390 | ret = reg_node(pRExC_state, SBOL); |
a0d0e21e | 6391 | else |
830247a4 | 6392 | ret = reg_node(pRExC_state, BOL); |
fac92740 | 6393 | Set_Node_Length(ret, 1); /* MJD */ |
a0d0e21e LW |
6394 | break; |
6395 | case '$': | |
830247a4 | 6396 | nextchar(pRExC_state); |
b81d288d | 6397 | if (*RExC_parse) |
830247a4 | 6398 | RExC_seen_zerolen++; |
bbe252da | 6399 | if (RExC_flags & RXf_PMf_MULTILINE) |
830247a4 | 6400 | ret = reg_node(pRExC_state, MEOL); |
bbe252da | 6401 | else if (RExC_flags & RXf_PMf_SINGLELINE) |
830247a4 | 6402 | ret = reg_node(pRExC_state, SEOL); |
a0d0e21e | 6403 | else |
830247a4 | 6404 | ret = reg_node(pRExC_state, EOL); |
fac92740 | 6405 | Set_Node_Length(ret, 1); /* MJD */ |
a0d0e21e LW |
6406 | break; |
6407 | case '.': | |
830247a4 | 6408 | nextchar(pRExC_state); |
bbe252da | 6409 | if (RExC_flags & RXf_PMf_SINGLELINE) |
ffc61ed2 JH |
6410 | ret = reg_node(pRExC_state, SANY); |
6411 | else | |
6412 | ret = reg_node(pRExC_state, REG_ANY); | |
6413 | *flagp |= HASWIDTH|SIMPLE; | |
830247a4 | 6414 | RExC_naughty++; |
fac92740 | 6415 | Set_Node_Length(ret, 1); /* MJD */ |
a0d0e21e LW |
6416 | break; |
6417 | case '[': | |
b45f050a | 6418 | { |
3dab1dad YO |
6419 | char * const oregcomp_parse = ++RExC_parse; |
6420 | ret = regclass(pRExC_state,depth+1); | |
830247a4 IZ |
6421 | if (*RExC_parse != ']') { |
6422 | RExC_parse = oregcomp_parse; | |
b45f050a JF |
6423 | vFAIL("Unmatched ["); |
6424 | } | |
830247a4 | 6425 | nextchar(pRExC_state); |
a0d0e21e | 6426 | *flagp |= HASWIDTH|SIMPLE; |
fac92740 | 6427 | Set_Node_Length(ret, RExC_parse - oregcomp_parse + 1); /* MJD */ |
a0d0e21e | 6428 | break; |
b45f050a | 6429 | } |
a0d0e21e | 6430 | case '(': |
830247a4 | 6431 | nextchar(pRExC_state); |
3dab1dad | 6432 | ret = reg(pRExC_state, 1, &flags,depth+1); |
a0d0e21e | 6433 | if (ret == NULL) { |
bf93d4cc | 6434 | if (flags & TRYAGAIN) { |
830247a4 | 6435 | if (RExC_parse == RExC_end) { |
bf93d4cc GS |
6436 | /* Make parent create an empty node if needed. */ |
6437 | *flagp |= TRYAGAIN; | |
6438 | return(NULL); | |
6439 | } | |
a0d0e21e | 6440 | goto tryagain; |
bf93d4cc | 6441 | } |
a0d0e21e LW |
6442 | return(NULL); |
6443 | } | |
a3b492c3 | 6444 | *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE|POSTPONED); |
a0d0e21e LW |
6445 | break; |
6446 | case '|': | |
6447 | case ')': | |
6448 | if (flags & TRYAGAIN) { | |
6449 | *flagp |= TRYAGAIN; | |
6450 | return NULL; | |
6451 | } | |
b45f050a | 6452 | vFAIL("Internal urp"); |
a0d0e21e LW |
6453 | /* Supposed to be caught earlier. */ |
6454 | break; | |
85afd4ae | 6455 | case '{': |
830247a4 IZ |
6456 | if (!regcurly(RExC_parse)) { |
6457 | RExC_parse++; | |
85afd4ae CS |
6458 | goto defchar; |
6459 | } | |
6460 | /* FALL THROUGH */ | |
a0d0e21e LW |
6461 | case '?': |
6462 | case '+': | |
6463 | case '*': | |
830247a4 | 6464 | RExC_parse++; |
b45f050a | 6465 | vFAIL("Quantifier follows nothing"); |
a0d0e21e LW |
6466 | break; |
6467 | case '\\': | |
ee9b8eae YO |
6468 | /* Special Escapes |
6469 | ||
6470 | This switch handles escape sequences that resolve to some kind | |
6471 | of special regop and not to literal text. Escape sequnces that | |
6472 | resolve to literal text are handled below in the switch marked | |
6473 | "Literal Escapes". | |
6474 | ||
6475 | Every entry in this switch *must* have a corresponding entry | |
6476 | in the literal escape switch. However, the opposite is not | |
6477 | required, as the default for this switch is to jump to the | |
6478 | literal text handling code. | |
6479 | */ | |
830247a4 | 6480 | switch (*++RExC_parse) { |
ee9b8eae | 6481 | /* Special Escapes */ |
a0d0e21e | 6482 | case 'A': |
830247a4 IZ |
6483 | RExC_seen_zerolen++; |
6484 | ret = reg_node(pRExC_state, SBOL); | |
a0d0e21e | 6485 | *flagp |= SIMPLE; |
ee9b8eae | 6486 | goto finish_meta_pat; |
a0d0e21e | 6487 | case 'G': |
830247a4 IZ |
6488 | ret = reg_node(pRExC_state, GPOS); |
6489 | RExC_seen |= REG_SEEN_GPOS; | |
a0d0e21e | 6490 | *flagp |= SIMPLE; |
ee9b8eae YO |
6491 | goto finish_meta_pat; |
6492 | case 'K': | |
6493 | RExC_seen_zerolen++; | |
6494 | ret = reg_node(pRExC_state, KEEPS); | |
6495 | *flagp |= SIMPLE; | |
6496 | goto finish_meta_pat; | |
a0d0e21e | 6497 | case 'Z': |
830247a4 | 6498 | ret = reg_node(pRExC_state, SEOL); |
a0d0e21e | 6499 | *flagp |= SIMPLE; |
a1917ab9 | 6500 | RExC_seen_zerolen++; /* Do not optimize RE away */ |
ee9b8eae | 6501 | goto finish_meta_pat; |
b85d18e9 | 6502 | case 'z': |
830247a4 | 6503 | ret = reg_node(pRExC_state, EOS); |
b85d18e9 | 6504 | *flagp |= SIMPLE; |
830247a4 | 6505 | RExC_seen_zerolen++; /* Do not optimize RE away */ |
ee9b8eae | 6506 | goto finish_meta_pat; |
4a2d328f | 6507 | case 'C': |
f33976b4 DB |
6508 | ret = reg_node(pRExC_state, CANY); |
6509 | RExC_seen |= REG_SEEN_CANY; | |
a0ed51b3 | 6510 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6511 | goto finish_meta_pat; |
a0ed51b3 | 6512 | case 'X': |
830247a4 | 6513 | ret = reg_node(pRExC_state, CLUMP); |
a0ed51b3 | 6514 | *flagp |= HASWIDTH; |
ee9b8eae | 6515 | goto finish_meta_pat; |
a0d0e21e | 6516 | case 'w': |
eb160463 | 6517 | ret = reg_node(pRExC_state, (U8)(LOC ? ALNUML : ALNUM)); |
a0d0e21e | 6518 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6519 | goto finish_meta_pat; |
a0d0e21e | 6520 | case 'W': |
eb160463 | 6521 | ret = reg_node(pRExC_state, (U8)(LOC ? NALNUML : NALNUM)); |
a0d0e21e | 6522 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6523 | goto finish_meta_pat; |
a0d0e21e | 6524 | case 'b': |
830247a4 IZ |
6525 | RExC_seen_zerolen++; |
6526 | RExC_seen |= REG_SEEN_LOOKBEHIND; | |
eb160463 | 6527 | ret = reg_node(pRExC_state, (U8)(LOC ? BOUNDL : BOUND)); |
a0d0e21e | 6528 | *flagp |= SIMPLE; |
ee9b8eae | 6529 | goto finish_meta_pat; |
a0d0e21e | 6530 | case 'B': |
830247a4 IZ |
6531 | RExC_seen_zerolen++; |
6532 | RExC_seen |= REG_SEEN_LOOKBEHIND; | |
eb160463 | 6533 | ret = reg_node(pRExC_state, (U8)(LOC ? NBOUNDL : NBOUND)); |
a0d0e21e | 6534 | *flagp |= SIMPLE; |
ee9b8eae | 6535 | goto finish_meta_pat; |
a0d0e21e | 6536 | case 's': |
eb160463 | 6537 | ret = reg_node(pRExC_state, (U8)(LOC ? SPACEL : SPACE)); |
a0d0e21e | 6538 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6539 | goto finish_meta_pat; |
a0d0e21e | 6540 | case 'S': |
eb160463 | 6541 | ret = reg_node(pRExC_state, (U8)(LOC ? NSPACEL : NSPACE)); |
a0d0e21e | 6542 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6543 | goto finish_meta_pat; |
a0d0e21e | 6544 | case 'd': |
ffc61ed2 | 6545 | ret = reg_node(pRExC_state, DIGIT); |
a0d0e21e | 6546 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae | 6547 | goto finish_meta_pat; |
a0d0e21e | 6548 | case 'D': |
ffc61ed2 | 6549 | ret = reg_node(pRExC_state, NDIGIT); |
a0d0e21e | 6550 | *flagp |= HASWIDTH|SIMPLE; |
ee9b8eae YO |
6551 | goto finish_meta_pat; |
6552 | case 'v': | |
6553 | ret = reganode(pRExC_state, PRUNE, 0); | |
6554 | ret->flags = 1; | |
6555 | *flagp |= SIMPLE; | |
6556 | goto finish_meta_pat; | |
6557 | case 'V': | |
6558 | ret = reganode(pRExC_state, SKIP, 0); | |
6559 | ret->flags = 1; | |
6560 | *flagp |= SIMPLE; | |
6561 | finish_meta_pat: | |
830247a4 | 6562 | nextchar(pRExC_state); |
fac92740 | 6563 | Set_Node_Length(ret, 2); /* MJD */ |
ee9b8eae | 6564 | break; |
a14b48bc LW |
6565 | case 'p': |
6566 | case 'P': | |
3568d838 | 6567 | { |
3dab1dad | 6568 | char* const oldregxend = RExC_end; |
d008bc60 | 6569 | #ifdef DEBUGGING |
ccb2c380 | 6570 | char* parse_start = RExC_parse - 2; |
d008bc60 | 6571 | #endif |
a14b48bc | 6572 | |
830247a4 | 6573 | if (RExC_parse[1] == '{') { |
3568d838 | 6574 | /* a lovely hack--pretend we saw [\pX] instead */ |
830247a4 IZ |
6575 | RExC_end = strchr(RExC_parse, '}'); |
6576 | if (!RExC_end) { | |
3dab1dad | 6577 | const U8 c = (U8)*RExC_parse; |
830247a4 IZ |
6578 | RExC_parse += 2; |
6579 | RExC_end = oldregxend; | |
0da60cf5 | 6580 | vFAIL2("Missing right brace on \\%c{}", c); |
b45f050a | 6581 | } |
830247a4 | 6582 | RExC_end++; |
a14b48bc | 6583 | } |
af6f566e | 6584 | else { |
830247a4 | 6585 | RExC_end = RExC_parse + 2; |
af6f566e HS |
6586 | if (RExC_end > oldregxend) |
6587 | RExC_end = oldregxend; | |
6588 | } | |
830247a4 | 6589 | RExC_parse--; |
a14b48bc | 6590 | |
3dab1dad | 6591 | ret = regclass(pRExC_state,depth+1); |
a14b48bc | 6592 | |
830247a4 IZ |
6593 | RExC_end = oldregxend; |
6594 | RExC_parse--; | |
ccb2c380 MP |
6595 | |
6596 | Set_Node_Offset(ret, parse_start + 2); | |
6597 | Set_Node_Cur_Length(ret); | |
830247a4 | 6598 | nextchar(pRExC_state); |
a14b48bc LW |
6599 | *flagp |= HASWIDTH|SIMPLE; |
6600 | } | |
6601 | break; | |
fc8cd66c YO |
6602 | case 'N': |
6603 | /* Handle \N{NAME} here and not below because it can be | |
6604 | multicharacter. join_exact() will join them up later on. | |
6605 | Also this makes sure that things like /\N{BLAH}+/ and | |
6606 | \N{BLAH} being multi char Just Happen. dmq*/ | |
6607 | ++RExC_parse; | |
6608 | ret= reg_namedseq(pRExC_state, NULL); | |
6609 | break; | |
0a4db386 | 6610 | case 'k': /* Handle \k<NAME> and \k'NAME' */ |
1f1031fe | 6611 | parse_named_seq: |
81714fb9 YO |
6612 | { |
6613 | char ch= RExC_parse[1]; | |
1f1031fe YO |
6614 | if (ch != '<' && ch != '\'' && ch != '{') { |
6615 | RExC_parse++; | |
6616 | vFAIL2("Sequence %.2s... not terminated",parse_start); | |
81714fb9 | 6617 | } else { |
1f1031fe YO |
6618 | /* this pretty much dupes the code for (?P=...) in reg(), if |
6619 | you change this make sure you change that */ | |
81714fb9 | 6620 | char* name_start = (RExC_parse += 2); |
2eccd3b2 | 6621 | U32 num = 0; |
0a4db386 YO |
6622 | SV *sv_dat = reg_scan_name(pRExC_state, |
6623 | SIZE_ONLY ? REG_RSN_RETURN_NULL : REG_RSN_RETURN_DATA); | |
1f1031fe | 6624 | ch= (ch == '<') ? '>' : (ch == '{') ? '}' : '\''; |
81714fb9 | 6625 | if (RExC_parse == name_start || *RExC_parse != ch) |
1f1031fe YO |
6626 | vFAIL2("Sequence %.3s... not terminated",parse_start); |
6627 | ||
6628 | if (!SIZE_ONLY) { | |
6629 | num = add_data( pRExC_state, 1, "S" ); | |
6630 | RExC_rxi->data->data[num]=(void*)sv_dat; | |
6631 | SvREFCNT_inc(sv_dat); | |
6632 | } | |
6633 | ||
81714fb9 YO |
6634 | RExC_sawback = 1; |
6635 | ret = reganode(pRExC_state, | |
6636 | (U8)(FOLD ? (LOC ? NREFFL : NREFF) : NREF), | |
6637 | num); | |
6638 | *flagp |= HASWIDTH; | |
1f1031fe | 6639 | |
81714fb9 YO |
6640 | /* override incorrect value set in reganode MJD */ |
6641 | Set_Node_Offset(ret, parse_start+1); | |
6642 | Set_Node_Cur_Length(ret); /* MJD */ | |
6643 | nextchar(pRExC_state); | |
1f1031fe | 6644 | |
81714fb9 YO |
6645 | } |
6646 | break; | |
1f1031fe | 6647 | } |
2bf803e2 | 6648 | case 'g': |
a0d0e21e LW |
6649 | case '1': case '2': case '3': case '4': |
6650 | case '5': case '6': case '7': case '8': case '9': | |
6651 | { | |
c74340f9 | 6652 | I32 num; |
2bf803e2 YO |
6653 | bool isg = *RExC_parse == 'g'; |
6654 | bool isrel = 0; | |
6655 | bool hasbrace = 0; | |
6656 | if (isg) { | |
c74340f9 | 6657 | RExC_parse++; |
2bf803e2 YO |
6658 | if (*RExC_parse == '{') { |
6659 | RExC_parse++; | |
6660 | hasbrace = 1; | |
6661 | } | |
6662 | if (*RExC_parse == '-') { | |
6663 | RExC_parse++; | |
6664 | isrel = 1; | |
6665 | } | |
1f1031fe YO |
6666 | if (hasbrace && !isDIGIT(*RExC_parse)) { |
6667 | if (isrel) RExC_parse--; | |
6668 | RExC_parse -= 2; | |
6669 | goto parse_named_seq; | |
6670 | } } | |
c74340f9 YO |
6671 | num = atoi(RExC_parse); |
6672 | if (isrel) { | |
5624f11d | 6673 | num = RExC_npar - num; |
c74340f9 YO |
6674 | if (num < 1) |
6675 | vFAIL("Reference to nonexistent or unclosed group"); | |
6676 | } | |
2bf803e2 | 6677 | if (!isg && num > 9 && num >= RExC_npar) |
a0d0e21e LW |
6678 | goto defchar; |
6679 | else { | |
3dab1dad | 6680 | char * const parse_start = RExC_parse - 1; /* MJD */ |
830247a4 IZ |
6681 | while (isDIGIT(*RExC_parse)) |
6682 | RExC_parse++; | |
1f1031fe YO |
6683 | if (parse_start == RExC_parse - 1) |
6684 | vFAIL("Unterminated \\g... pattern"); | |
2bf803e2 YO |
6685 | if (hasbrace) { |
6686 | if (*RExC_parse != '}') | |
6687 | vFAIL("Unterminated \\g{...} pattern"); | |
6688 | RExC_parse++; | |
6689 | } | |
c74340f9 YO |
6690 | if (!SIZE_ONLY) { |
6691 | if (num > (I32)RExC_rx->nparens) | |
6692 | vFAIL("Reference to nonexistent group"); | |
c74340f9 | 6693 | } |
830247a4 | 6694 | RExC_sawback = 1; |
eb160463 GS |
6695 | ret = reganode(pRExC_state, |
6696 | (U8)(FOLD ? (LOC ? REFFL : REFF) : REF), | |
6697 | num); | |
a0d0e21e | 6698 | *flagp |= HASWIDTH; |
2af232bd | 6699 | |
fac92740 | 6700 | /* override incorrect value set in reganode MJD */ |
2af232bd | 6701 | Set_Node_Offset(ret, parse_start+1); |
fac92740 | 6702 | Set_Node_Cur_Length(ret); /* MJD */ |
830247a4 IZ |
6703 | RExC_parse--; |
6704 | nextchar(pRExC_state); | |
a0d0e21e LW |
6705 | } |
6706 | } | |
6707 | break; | |
6708 | case '\0': | |
830247a4 | 6709 | if (RExC_parse >= RExC_end) |
b45f050a | 6710 | FAIL("Trailing \\"); |
a0d0e21e LW |
6711 | /* FALL THROUGH */ |
6712 | default: | |
a0288114 | 6713 | /* Do not generate "unrecognized" warnings here, we fall |
c9f97d15 | 6714 | back into the quick-grab loop below */ |
45948336 | 6715 | parse_start--; |
a0d0e21e LW |
6716 | goto defchar; |
6717 | } | |
6718 | break; | |
4633a7c4 LW |
6719 | |
6720 | case '#': | |
bbe252da | 6721 | if (RExC_flags & RXf_PMf_EXTENDED) { |
bcdf7404 | 6722 | if ( reg_skipcomment( pRExC_state ) ) |
4633a7c4 LW |
6723 | goto tryagain; |
6724 | } | |
6725 | /* FALL THROUGH */ | |
6726 | ||
a0d0e21e | 6727 | default: { |
ba210ebe | 6728 | register STRLEN len; |
58ae7d3f | 6729 | register UV ender; |
a0d0e21e | 6730 | register char *p; |
3dab1dad | 6731 | char *s; |
80aecb99 | 6732 | STRLEN foldlen; |
89ebb4a3 | 6733 | U8 tmpbuf[UTF8_MAXBYTES_CASE+1], *foldbuf; |
f06dbbb7 JH |
6734 | |
6735 | parse_start = RExC_parse - 1; | |
a0d0e21e | 6736 | |
830247a4 | 6737 | RExC_parse++; |
a0d0e21e LW |
6738 | |
6739 | defchar: | |
58ae7d3f | 6740 | ender = 0; |
eb160463 GS |
6741 | ret = reg_node(pRExC_state, |
6742 | (U8)(FOLD ? (LOC ? EXACTFL : EXACTF) : EXACT)); | |
cd439c50 | 6743 | s = STRING(ret); |
830247a4 IZ |
6744 | for (len = 0, p = RExC_parse - 1; |
6745 | len < 127 && p < RExC_end; | |
a0d0e21e LW |
6746 | len++) |
6747 | { | |
3dab1dad | 6748 | char * const oldp = p; |
5b5a24f7 | 6749 | |
bbe252da | 6750 | if (RExC_flags & RXf_PMf_EXTENDED) |
bcdf7404 | 6751 | p = regwhite( pRExC_state, p ); |
a0d0e21e LW |
6752 | switch (*p) { |
6753 | case '^': | |
6754 | case '$': | |
6755 | case '.': | |
6756 | case '[': | |
6757 | case '(': | |
6758 | case ')': | |
6759 | case '|': | |
6760 | goto loopdone; | |
6761 | case '\\': | |
ee9b8eae YO |
6762 | /* Literal Escapes Switch |
6763 | ||
6764 | This switch is meant to handle escape sequences that | |
6765 | resolve to a literal character. | |
6766 | ||
6767 | Every escape sequence that represents something | |
6768 | else, like an assertion or a char class, is handled | |
6769 | in the switch marked 'Special Escapes' above in this | |
6770 | routine, but also has an entry here as anything that | |
6771 | isn't explicitly mentioned here will be treated as | |
6772 | an unescaped equivalent literal. | |
6773 | */ | |
6774 | ||
a0d0e21e | 6775 | switch (*++p) { |
ee9b8eae YO |
6776 | /* These are all the special escapes. */ |
6777 | case 'A': /* Start assertion */ | |
6778 | case 'b': case 'B': /* Word-boundary assertion*/ | |
6779 | case 'C': /* Single char !DANGEROUS! */ | |
6780 | case 'd': case 'D': /* digit class */ | |
6781 | case 'g': case 'G': /* generic-backref, pos assertion */ | |
6782 | case 'k': case 'K': /* named backref, keep marker */ | |
6783 | case 'N': /* named char sequence */ | |
6784 | case 'p': case 'P': /* unicode property */ | |
6785 | case 's': case 'S': /* space class */ | |
6786 | case 'v': case 'V': /* (*PRUNE) and (*SKIP) */ | |
6787 | case 'w': case 'W': /* word class */ | |
6788 | case 'X': /* eXtended Unicode "combining character sequence" */ | |
6789 | case 'z': case 'Z': /* End of line/string assertion */ | |
a0d0e21e LW |
6790 | --p; |
6791 | goto loopdone; | |
ee9b8eae YO |
6792 | |
6793 | /* Anything after here is an escape that resolves to a | |
6794 | literal. (Except digits, which may or may not) | |
6795 | */ | |
a0d0e21e LW |
6796 | case 'n': |
6797 | ender = '\n'; | |
6798 | p++; | |
a687059c | 6799 | break; |
a0d0e21e LW |
6800 | case 'r': |
6801 | ender = '\r'; | |
6802 | p++; | |
a687059c | 6803 | break; |
a0d0e21e LW |
6804 | case 't': |
6805 | ender = '\t'; | |
6806 | p++; | |
a687059c | 6807 | break; |
a0d0e21e LW |
6808 | case 'f': |
6809 | ender = '\f'; | |
6810 | p++; | |
a687059c | 6811 | break; |
a0d0e21e | 6812 | case 'e': |
c7f1f016 | 6813 | ender = ASCII_TO_NATIVE('\033'); |
a0d0e21e | 6814 | p++; |
a687059c | 6815 | break; |
a0d0e21e | 6816 | case 'a': |
c7f1f016 | 6817 | ender = ASCII_TO_NATIVE('\007'); |
a0d0e21e | 6818 | p++; |
a687059c | 6819 | break; |
a0d0e21e | 6820 | case 'x': |
a0ed51b3 | 6821 | if (*++p == '{') { |
1df70142 | 6822 | char* const e = strchr(p, '}'); |
b81d288d | 6823 | |
b45f050a | 6824 | if (!e) { |
830247a4 | 6825 | RExC_parse = p + 1; |
b45f050a JF |
6826 | vFAIL("Missing right brace on \\x{}"); |
6827 | } | |
de5f0749 | 6828 | else { |
a4c04bdc NC |
6829 | I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
6830 | | PERL_SCAN_DISALLOW_PREFIX; | |
1df70142 | 6831 | STRLEN numlen = e - p - 1; |
53305cf1 | 6832 | ender = grok_hex(p + 1, &numlen, &flags, NULL); |
aaa80028 JH |
6833 | if (ender > 0xff) |
6834 | RExC_utf8 = 1; | |
a0ed51b3 LW |
6835 | p = e + 1; |
6836 | } | |
a0ed51b3 LW |
6837 | } |
6838 | else { | |
a4c04bdc | 6839 | I32 flags = PERL_SCAN_DISALLOW_PREFIX; |
1df70142 | 6840 | STRLEN numlen = 2; |
53305cf1 | 6841 | ender = grok_hex(p, &numlen, &flags, NULL); |
a0ed51b3 LW |
6842 | p += numlen; |
6843 | } | |
9e08bc66 TS |
6844 | if (PL_encoding && ender < 0x100) |
6845 | goto recode_encoding; | |
a687059c | 6846 | break; |
a0d0e21e LW |
6847 | case 'c': |
6848 | p++; | |
bbce6d69 | 6849 | ender = UCHARAT(p++); |
6850 | ender = toCTRL(ender); | |
a687059c | 6851 | break; |
a0d0e21e LW |
6852 | case '0': case '1': case '2': case '3':case '4': |
6853 | case '5': case '6': case '7': case '8':case '9': | |
6854 | if (*p == '0' || | |
830247a4 | 6855 | (isDIGIT(p[1]) && atoi(p) >= RExC_npar) ) { |
53305cf1 | 6856 | I32 flags = 0; |
1df70142 | 6857 | STRLEN numlen = 3; |
53305cf1 | 6858 | ender = grok_oct(p, &numlen, &flags, NULL); |
a0d0e21e LW |
6859 | p += numlen; |
6860 | } | |
6861 | else { | |
6862 | --p; | |
6863 | goto loopdone; | |
a687059c | 6864 | } |
9e08bc66 TS |
6865 | if (PL_encoding && ender < 0x100) |
6866 | goto recode_encoding; | |
6867 | break; | |
6868 | recode_encoding: | |
6869 | { | |
6870 | SV* enc = PL_encoding; | |
6871 | ender = reg_recode((const char)(U8)ender, &enc); | |
6872 | if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP)) | |
6873 | vWARN(p, "Invalid escape in the specified encoding"); | |
6874 | RExC_utf8 = 1; | |
6875 | } | |
a687059c | 6876 | break; |
a0d0e21e | 6877 | case '\0': |
830247a4 | 6878 | if (p >= RExC_end) |
b45f050a | 6879 | FAIL("Trailing \\"); |
a687059c | 6880 | /* FALL THROUGH */ |
a0d0e21e | 6881 | default: |
041457d9 | 6882 | if (!SIZE_ONLY&& isALPHA(*p) && ckWARN(WARN_REGEXP)) |
4193bef7 | 6883 | vWARN2(p + 1, "Unrecognized escape \\%c passed through", UCHARAT(p)); |
a0ed51b3 | 6884 | goto normal_default; |
a0d0e21e LW |
6885 | } |
6886 | break; | |
a687059c | 6887 | default: |
a0ed51b3 | 6888 | normal_default: |
fd400ab9 | 6889 | if (UTF8_IS_START(*p) && UTF) { |
1df70142 | 6890 | STRLEN numlen; |
5e12f4fb | 6891 | ender = utf8n_to_uvchr((U8*)p, RExC_end - p, |
9f7f3913 | 6892 | &numlen, UTF8_ALLOW_DEFAULT); |
a0ed51b3 LW |
6893 | p += numlen; |
6894 | } | |
6895 | else | |
6896 | ender = *p++; | |
a0d0e21e | 6897 | break; |
a687059c | 6898 | } |
bcdf7404 YO |
6899 | if ( RExC_flags & RXf_PMf_EXTENDED) |
6900 | p = regwhite( pRExC_state, p ); | |
60a8b682 JH |
6901 | if (UTF && FOLD) { |
6902 | /* Prime the casefolded buffer. */ | |
ac7e0132 | 6903 | ender = toFOLD_uni(ender, tmpbuf, &foldlen); |
60a8b682 | 6904 | } |
bcdf7404 | 6905 | if (p < RExC_end && ISMULT2(p)) { /* Back off on ?+*. */ |
a0d0e21e LW |
6906 | if (len) |
6907 | p = oldp; | |
16ea2a2e | 6908 | else if (UTF) { |
80aecb99 | 6909 | if (FOLD) { |
60a8b682 | 6910 | /* Emit all the Unicode characters. */ |
1df70142 | 6911 | STRLEN numlen; |
80aecb99 JH |
6912 | for (foldbuf = tmpbuf; |
6913 | foldlen; | |
6914 | foldlen -= numlen) { | |
6915 | ender = utf8_to_uvchr(foldbuf, &numlen); | |
9dc45d57 | 6916 | if (numlen > 0) { |
71207a34 | 6917 | const STRLEN unilen = reguni(pRExC_state, ender, s); |
0ebc6274 JH |
6918 | s += unilen; |
6919 | len += unilen; | |
6920 | /* In EBCDIC the numlen | |
6921 | * and unilen can differ. */ | |
9dc45d57 | 6922 | foldbuf += numlen; |
47654450 JH |
6923 | if (numlen >= foldlen) |
6924 | break; | |
9dc45d57 JH |
6925 | } |
6926 | else | |
6927 | break; /* "Can't happen." */ | |
80aecb99 JH |
6928 | } |
6929 | } | |
6930 | else { | |
71207a34 | 6931 | const STRLEN unilen = reguni(pRExC_state, ender, s); |
9ede7db1 | 6932 | if (unilen > 0) { |
0ebc6274 JH |
6933 | s += unilen; |
6934 | len += unilen; | |
9dc45d57 | 6935 | } |
80aecb99 | 6936 | } |
a0ed51b3 | 6937 | } |
a0d0e21e LW |
6938 | else { |
6939 | len++; | |
eb160463 | 6940 | REGC((char)ender, s++); |
a0d0e21e LW |
6941 | } |
6942 | break; | |
a687059c | 6943 | } |
16ea2a2e | 6944 | if (UTF) { |
80aecb99 | 6945 | if (FOLD) { |
60a8b682 | 6946 | /* Emit all the Unicode characters. */ |
1df70142 | 6947 | STRLEN numlen; |
80aecb99 JH |
6948 | for (foldbuf = tmpbuf; |
6949 | foldlen; | |
6950 | foldlen -= numlen) { | |
6951 | ender = utf8_to_uvchr(foldbuf, &numlen); | |
9dc45d57 | 6952 | if (numlen > 0) { |
71207a34 | 6953 | const STRLEN unilen = reguni(pRExC_state, ender, s); |
0ebc6274 JH |
6954 | len += unilen; |
6955 | s += unilen; | |
6956 | /* In EBCDIC the numlen | |
6957 | * and unilen can differ. */ | |
9dc45d57 | 6958 | foldbuf += numlen; |
47654450 JH |
6959 | if (numlen >= foldlen) |
6960 | break; | |
9dc45d57 JH |
6961 | } |
6962 | else | |
6963 | break; | |
80aecb99 JH |
6964 | } |
6965 | } | |
6966 | else { | |
71207a34 | 6967 | const STRLEN unilen = reguni(pRExC_state, ender, s); |
9ede7db1 | 6968 | if (unilen > 0) { |
0ebc6274 JH |
6969 | s += unilen; |
6970 | len += unilen; | |
9dc45d57 | 6971 | } |
80aecb99 JH |
6972 | } |
6973 | len--; | |
a0ed51b3 LW |
6974 | } |
6975 | else | |
eb160463 | 6976 | REGC((char)ender, s++); |
a0d0e21e LW |
6977 | } |
6978 | loopdone: | |
830247a4 | 6979 | RExC_parse = p - 1; |
fac92740 | 6980 | Set_Node_Cur_Length(ret); /* MJD */ |
830247a4 | 6981 | nextchar(pRExC_state); |
793db0cb JH |
6982 | { |
6983 | /* len is STRLEN which is unsigned, need to copy to signed */ | |
6984 | IV iv = len; | |
6985 | if (iv < 0) | |
6986 | vFAIL("Internal disaster"); | |
6987 | } | |
a0d0e21e LW |
6988 | if (len > 0) |
6989 | *flagp |= HASWIDTH; | |
090f7165 | 6990 | if (len == 1 && UNI_IS_INVARIANT(ender)) |
a0d0e21e | 6991 | *flagp |= SIMPLE; |
3dab1dad | 6992 | |
cd439c50 | 6993 | if (SIZE_ONLY) |
830247a4 | 6994 | RExC_size += STR_SZ(len); |
3dab1dad YO |
6995 | else { |
6996 | STR_LEN(ret) = len; | |
830247a4 | 6997 | RExC_emit += STR_SZ(len); |
07be1b83 | 6998 | } |
3dab1dad | 6999 | } |
a0d0e21e LW |
7000 | break; |
7001 | } | |
a687059c | 7002 | |
a0d0e21e | 7003 | return(ret); |
a687059c LW |
7004 | } |
7005 | ||
873ef191 | 7006 | STATIC char * |
bcdf7404 | 7007 | S_regwhite( RExC_state_t *pRExC_state, char *p ) |
5b5a24f7 | 7008 | { |
bcdf7404 | 7009 | const char *e = RExC_end; |
5b5a24f7 CS |
7010 | while (p < e) { |
7011 | if (isSPACE(*p)) | |
7012 | ++p; | |
7013 | else if (*p == '#') { | |
bcdf7404 | 7014 | bool ended = 0; |
5b5a24f7 | 7015 | do { |
bcdf7404 YO |
7016 | if (*p++ == '\n') { |
7017 | ended = 1; | |
7018 | break; | |
7019 | } | |
7020 | } while (p < e); | |
7021 | if (!ended) | |
7022 | RExC_seen |= REG_SEEN_RUN_ON_COMMENT; | |
5b5a24f7 CS |
7023 | } |
7024 | else | |
7025 | break; | |
7026 | } | |
7027 | return p; | |
7028 | } | |
7029 | ||
b8c5462f JH |
7030 | /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]]. |
7031 | Character classes ([:foo:]) can also be negated ([:^foo:]). | |
7032 | Returns a named class id (ANYOF_XXX) if successful, -1 otherwise. | |
7033 | Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed, | |
beeb77fc | 7034 | but trigger failures because they are currently unimplemented. */ |
9a86a77b JH |
7035 | |
7036 | #define POSIXCC_DONE(c) ((c) == ':') | |
7037 | #define POSIXCC_NOTYET(c) ((c) == '=' || (c) == '.') | |
7038 | #define POSIXCC(c) (POSIXCC_DONE(c) || POSIXCC_NOTYET(c)) | |
7039 | ||
b8c5462f | 7040 | STATIC I32 |
830247a4 | 7041 | S_regpposixcc(pTHX_ RExC_state_t *pRExC_state, I32 value) |
620e46c5 | 7042 | { |
97aff369 | 7043 | dVAR; |
936ed897 | 7044 | I32 namedclass = OOB_NAMEDCLASS; |
620e46c5 | 7045 | |
830247a4 | 7046 | if (value == '[' && RExC_parse + 1 < RExC_end && |
620e46c5 | 7047 | /* I smell either [: or [= or [. -- POSIX has been here, right? */ |
9a86a77b | 7048 | POSIXCC(UCHARAT(RExC_parse))) { |
1df70142 | 7049 | const char c = UCHARAT(RExC_parse); |
097eb12c | 7050 | char* const s = RExC_parse++; |
b81d288d | 7051 | |
9a86a77b | 7052 | while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != c) |
830247a4 IZ |
7053 | RExC_parse++; |
7054 | if (RExC_parse == RExC_end) | |
620e46c5 | 7055 | /* Grandfather lone [:, [=, [. */ |
830247a4 | 7056 | RExC_parse = s; |
620e46c5 | 7057 | else { |
3dab1dad | 7058 | const char* const t = RExC_parse++; /* skip over the c */ |
80916619 NC |
7059 | assert(*t == c); |
7060 | ||
9a86a77b | 7061 | if (UCHARAT(RExC_parse) == ']') { |
3dab1dad | 7062 | const char *posixcc = s + 1; |
830247a4 | 7063 | RExC_parse++; /* skip over the ending ] */ |
3dab1dad | 7064 | |
b8c5462f | 7065 | if (*s == ':') { |
1df70142 AL |
7066 | const I32 complement = *posixcc == '^' ? *posixcc++ : 0; |
7067 | const I32 skip = t - posixcc; | |
80916619 NC |
7068 | |
7069 | /* Initially switch on the length of the name. */ | |
7070 | switch (skip) { | |
7071 | case 4: | |
3dab1dad YO |
7072 | if (memEQ(posixcc, "word", 4)) /* this is not POSIX, this is the Perl \w */ |
7073 | namedclass = complement ? ANYOF_NALNUM : ANYOF_ALNUM; | |
cc4319de | 7074 | break; |
80916619 NC |
7075 | case 5: |
7076 | /* Names all of length 5. */ | |
7077 | /* alnum alpha ascii blank cntrl digit graph lower | |
7078 | print punct space upper */ | |
7079 | /* Offset 4 gives the best switch position. */ | |
7080 | switch (posixcc[4]) { | |
7081 | case 'a': | |
3dab1dad YO |
7082 | if (memEQ(posixcc, "alph", 4)) /* alpha */ |
7083 | namedclass = complement ? ANYOF_NALPHA : ANYOF_ALPHA; | |
80916619 NC |
7084 | break; |
7085 | case 'e': | |
3dab1dad YO |
7086 | if (memEQ(posixcc, "spac", 4)) /* space */ |
7087 | namedclass = complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC; | |
80916619 NC |
7088 | break; |
7089 | case 'h': | |
3dab1dad YO |
7090 | if (memEQ(posixcc, "grap", 4)) /* graph */ |
7091 | namedclass = complement ? ANYOF_NGRAPH : ANYOF_GRAPH; | |
80916619 NC |
7092 | break; |
7093 | case 'i': | |
3dab1dad YO |
7094 | if (memEQ(posixcc, "asci", 4)) /* ascii */ |
7095 | namedclass = complement ? ANYOF_NASCII : ANYOF_ASCII; | |
80916619 NC |
7096 | break; |
7097 | case 'k': | |
3dab1dad YO |
7098 | if (memEQ(posixcc, "blan", 4)) /* blank */ |
7099 | namedclass = complement ? ANYOF_NBLANK : ANYOF_BLANK; | |
80916619 NC |
7100 | break; |
7101 | case 'l': | |
3dab1dad YO |
7102 | if (memEQ(posixcc, "cntr", 4)) /* cntrl */ |
7103 | namedclass = complement ? ANYOF_NCNTRL : ANYOF_CNTRL; | |
80916619 NC |
7104 | break; |
7105 | case 'm': | |
3dab1dad YO |
7106 | if (memEQ(posixcc, "alnu", 4)) /* alnum */ |
7107 | namedclass = complement ? ANYOF_NALNUMC : ANYOF_ALNUMC; | |
80916619 NC |
7108 | break; |
7109 | case 'r': | |
3dab1dad YO |
7110 | if (memEQ(posixcc, "lowe", 4)) /* lower */ |
7111 | namedclass = complement ? ANYOF_NLOWER : ANYOF_LOWER; | |
7112 | else if (memEQ(posixcc, "uppe", 4)) /* upper */ | |
7113 | namedclass = complement ? ANYOF_NUPPER : ANYOF_UPPER; | |
80916619 NC |
7114 | break; |
7115 | case 't': | |
3dab1dad YO |
7116 | if (memEQ(posixcc, "digi", 4)) /* digit */ |
7117 | namedclass = complement ? ANYOF_NDIGIT : ANYOF_DIGIT; | |
7118 | else if (memEQ(posixcc, "prin", 4)) /* print */ | |
7119 | namedclass = complement ? ANYOF_NPRINT : ANYOF_PRINT; | |
7120 | else if (memEQ(posixcc, "punc", 4)) /* punct */ | |
7121 | namedclass = complement ? ANYOF_NPUNCT : ANYOF_PUNCT; | |
80916619 | 7122 | break; |
b8c5462f JH |
7123 | } |
7124 | break; | |
80916619 | 7125 | case 6: |
3dab1dad YO |
7126 | if (memEQ(posixcc, "xdigit", 6)) |
7127 | namedclass = complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT; | |
b8c5462f JH |
7128 | break; |
7129 | } | |
80916619 NC |
7130 | |
7131 | if (namedclass == OOB_NAMEDCLASS) | |
b45f050a JF |
7132 | Simple_vFAIL3("POSIX class [:%.*s:] unknown", |
7133 | t - s - 1, s + 1); | |
80916619 NC |
7134 | assert (posixcc[skip] == ':'); |
7135 | assert (posixcc[skip+1] == ']'); | |
b45f050a | 7136 | } else if (!SIZE_ONLY) { |
b8c5462f | 7137 | /* [[=foo=]] and [[.foo.]] are still future. */ |
b45f050a | 7138 | |
830247a4 | 7139 | /* adjust RExC_parse so the warning shows after |
b45f050a | 7140 | the class closes */ |
9a86a77b | 7141 | while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse) != ']') |
830247a4 | 7142 | RExC_parse++; |
b45f050a JF |
7143 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); |
7144 | } | |
b8c5462f JH |
7145 | } else { |
7146 | /* Maternal grandfather: | |
7147 | * "[:" ending in ":" but not in ":]" */ | |
830247a4 | 7148 | RExC_parse = s; |
767d463e | 7149 | } |
620e46c5 JH |
7150 | } |
7151 | } | |
7152 | ||
b8c5462f JH |
7153 | return namedclass; |
7154 | } | |
7155 | ||
7156 | STATIC void | |
830247a4 | 7157 | S_checkposixcc(pTHX_ RExC_state_t *pRExC_state) |
b8c5462f | 7158 | { |
97aff369 | 7159 | dVAR; |
3dab1dad | 7160 | if (POSIXCC(UCHARAT(RExC_parse))) { |
1df70142 AL |
7161 | const char *s = RExC_parse; |
7162 | const char c = *s++; | |
b8c5462f | 7163 | |
3dab1dad | 7164 | while (isALNUM(*s)) |
b8c5462f JH |
7165 | s++; |
7166 | if (*s && c == *s && s[1] == ']') { | |
cd84f5b2 RGS |
7167 | if (ckWARN(WARN_REGEXP)) |
7168 | vWARN3(s+2, | |
7169 | "POSIX syntax [%c %c] belongs inside character classes", | |
7170 | c, c); | |
b45f050a JF |
7171 | |
7172 | /* [[=foo=]] and [[.foo.]] are still future. */ | |
9a86a77b | 7173 | if (POSIXCC_NOTYET(c)) { |
830247a4 | 7174 | /* adjust RExC_parse so the error shows after |
b45f050a | 7175 | the class closes */ |
9a86a77b | 7176 | while (UCHARAT(RExC_parse) && UCHARAT(RExC_parse++) != ']') |
3dab1dad | 7177 | NOOP; |
b45f050a JF |
7178 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); |
7179 | } | |
b8c5462f JH |
7180 | } |
7181 | } | |
620e46c5 JH |
7182 | } |
7183 | ||
7f6f358c | 7184 | |
89836f1f YO |
7185 | #define _C_C_T_(NAME,TEST,WORD) \ |
7186 | ANYOF_##NAME: \ | |
7187 | if (LOC) \ | |
7188 | ANYOF_CLASS_SET(ret, ANYOF_##NAME); \ | |
7189 | else { \ | |
7190 | for (value = 0; value < 256; value++) \ | |
7191 | if (TEST) \ | |
7192 | ANYOF_BITMAP_SET(ret, value); \ | |
7193 | } \ | |
7194 | yesno = '+'; \ | |
7195 | what = WORD; \ | |
7196 | break; \ | |
7197 | case ANYOF_N##NAME: \ | |
7198 | if (LOC) \ | |
7199 | ANYOF_CLASS_SET(ret, ANYOF_N##NAME); \ | |
7200 | else { \ | |
7201 | for (value = 0; value < 256; value++) \ | |
7202 | if (!TEST) \ | |
7203 | ANYOF_BITMAP_SET(ret, value); \ | |
7204 | } \ | |
7205 | yesno = '!'; \ | |
7206 | what = WORD; \ | |
7207 | break | |
7208 | ||
7209 | ||
7f6f358c YO |
7210 | /* |
7211 | parse a class specification and produce either an ANYOF node that | |
89836f1f YO |
7212 | matches the pattern or if the pattern matches a single char only and |
7213 | that char is < 256 and we are case insensitive then we produce an | |
7214 | EXACT node instead. | |
7f6f358c | 7215 | */ |
89836f1f | 7216 | |
76e3520e | 7217 | STATIC regnode * |
3dab1dad | 7218 | S_regclass(pTHX_ RExC_state_t *pRExC_state, U32 depth) |
a687059c | 7219 | { |
97aff369 | 7220 | dVAR; |
9ef43ace | 7221 | register UV value = 0; |
9a86a77b | 7222 | register UV nextvalue; |
3568d838 | 7223 | register IV prevvalue = OOB_UNICODE; |
ffc61ed2 | 7224 | register IV range = 0; |
c277df42 | 7225 | register regnode *ret; |
ba210ebe | 7226 | STRLEN numlen; |
ffc61ed2 | 7227 | IV namedclass; |
cbbf8932 | 7228 | char *rangebegin = NULL; |
936ed897 | 7229 | bool need_class = 0; |
c445ea15 | 7230 | SV *listsv = NULL; |
ffc61ed2 | 7231 | UV n; |
9e55ce06 | 7232 | bool optimize_invert = TRUE; |
cbbf8932 | 7233 | AV* unicode_alternate = NULL; |
1b2d223b JH |
7234 | #ifdef EBCDIC |
7235 | UV literal_endpoint = 0; | |
7236 | #endif | |
7f6f358c | 7237 | UV stored = 0; /* number of chars stored in the class */ |
ffc61ed2 | 7238 | |
3dab1dad | 7239 | regnode * const orig_emit = RExC_emit; /* Save the original RExC_emit in |
7f6f358c | 7240 | case we need to change the emitted regop to an EXACT. */ |
07be1b83 | 7241 | const char * orig_parse = RExC_parse; |
72f13be8 | 7242 | GET_RE_DEBUG_FLAGS_DECL; |
76e84362 SH |
7243 | #ifndef DEBUGGING |
7244 | PERL_UNUSED_ARG(depth); | |
7245 | #endif | |
72f13be8 | 7246 | |
3dab1dad | 7247 | DEBUG_PARSE("clas"); |
7f6f358c YO |
7248 | |
7249 | /* Assume we are going to generate an ANYOF node. */ | |
ffc61ed2 JH |
7250 | ret = reganode(pRExC_state, ANYOF, 0); |
7251 | ||
7252 | if (!SIZE_ONLY) | |
7253 | ANYOF_FLAGS(ret) = 0; | |
7254 | ||
9a86a77b | 7255 | if (UCHARAT(RExC_parse) == '^') { /* Complement of range. */ |
ffc61ed2 JH |
7256 | RExC_naughty++; |
7257 | RExC_parse++; | |
7258 | if (!SIZE_ONLY) | |
7259 | ANYOF_FLAGS(ret) |= ANYOF_INVERT; | |
7260 | } | |
a0d0e21e | 7261 | |
73060fc4 | 7262 | if (SIZE_ONLY) { |
830247a4 | 7263 | RExC_size += ANYOF_SKIP; |
73060fc4 JH |
7264 | listsv = &PL_sv_undef; /* For code scanners: listsv always non-NULL. */ |
7265 | } | |
936ed897 | 7266 | else { |
830247a4 | 7267 | RExC_emit += ANYOF_SKIP; |
936ed897 IZ |
7268 | if (FOLD) |
7269 | ANYOF_FLAGS(ret) |= ANYOF_FOLD; | |
7270 | if (LOC) | |
7271 | ANYOF_FLAGS(ret) |= ANYOF_LOCALE; | |
ffc61ed2 | 7272 | ANYOF_BITMAP_ZERO(ret); |
396482e1 | 7273 | listsv = newSVpvs("# comment\n"); |
a0d0e21e | 7274 | } |
b8c5462f | 7275 | |
9a86a77b JH |
7276 | nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0; |
7277 | ||
b938889d | 7278 | if (!SIZE_ONLY && POSIXCC(nextvalue)) |
830247a4 | 7279 | checkposixcc(pRExC_state); |
b8c5462f | 7280 | |
f064b6ad HS |
7281 | /* allow 1st char to be ] (allowing it to be - is dealt with later) */ |
7282 | if (UCHARAT(RExC_parse) == ']') | |
7283 | goto charclassloop; | |
ffc61ed2 | 7284 | |
fc8cd66c | 7285 | parseit: |
9a86a77b | 7286 | while (RExC_parse < RExC_end && UCHARAT(RExC_parse) != ']') { |
ffc61ed2 JH |
7287 | |
7288 | charclassloop: | |
7289 | ||
7290 | namedclass = OOB_NAMEDCLASS; /* initialize as illegal */ | |
7291 | ||
73b437c8 | 7292 | if (!range) |
830247a4 | 7293 | rangebegin = RExC_parse; |
ffc61ed2 | 7294 | if (UTF) { |
5e12f4fb | 7295 | value = utf8n_to_uvchr((U8*)RExC_parse, |
3568d838 | 7296 | RExC_end - RExC_parse, |
9f7f3913 | 7297 | &numlen, UTF8_ALLOW_DEFAULT); |
ffc61ed2 JH |
7298 | RExC_parse += numlen; |
7299 | } | |
7300 | else | |
7301 | value = UCHARAT(RExC_parse++); | |
7f6f358c | 7302 | |
9a86a77b JH |
7303 | nextvalue = RExC_parse < RExC_end ? UCHARAT(RExC_parse) : 0; |
7304 | if (value == '[' && POSIXCC(nextvalue)) | |
830247a4 | 7305 | namedclass = regpposixcc(pRExC_state, value); |
620e46c5 | 7306 | else if (value == '\\') { |
ffc61ed2 | 7307 | if (UTF) { |
5e12f4fb | 7308 | value = utf8n_to_uvchr((U8*)RExC_parse, |
ffc61ed2 | 7309 | RExC_end - RExC_parse, |
9f7f3913 | 7310 | &numlen, UTF8_ALLOW_DEFAULT); |
ffc61ed2 JH |
7311 | RExC_parse += numlen; |
7312 | } | |
7313 | else | |
7314 | value = UCHARAT(RExC_parse++); | |
470c3474 | 7315 | /* Some compilers cannot handle switching on 64-bit integer |
ffc61ed2 | 7316 | * values, therefore value cannot be an UV. Yes, this will |
e2962f66 JH |
7317 | * be a problem later if we want switch on Unicode. |
7318 | * A similar issue a little bit later when switching on | |
7319 | * namedclass. --jhi */ | |
ffc61ed2 | 7320 | switch ((I32)value) { |
b8c5462f JH |
7321 | case 'w': namedclass = ANYOF_ALNUM; break; |
7322 | case 'W': namedclass = ANYOF_NALNUM; break; | |
7323 | case 's': namedclass = ANYOF_SPACE; break; | |
7324 | case 'S': namedclass = ANYOF_NSPACE; break; | |
7325 | case 'd': namedclass = ANYOF_DIGIT; break; | |
7326 | case 'D': namedclass = ANYOF_NDIGIT; break; | |
fc8cd66c YO |
7327 | case 'N': /* Handle \N{NAME} in class */ |
7328 | { | |
7329 | /* We only pay attention to the first char of | |
7330 | multichar strings being returned. I kinda wonder | |
7331 | if this makes sense as it does change the behaviour | |
7332 | from earlier versions, OTOH that behaviour was broken | |
7333 | as well. */ | |
7334 | UV v; /* value is register so we cant & it /grrr */ | |
7335 | if (reg_namedseq(pRExC_state, &v)) { | |
7336 | goto parseit; | |
7337 | } | |
7338 | value= v; | |
7339 | } | |
7340 | break; | |
ffc61ed2 JH |
7341 | case 'p': |
7342 | case 'P': | |
3dab1dad YO |
7343 | { |
7344 | char *e; | |
af6f566e | 7345 | if (RExC_parse >= RExC_end) |
2a4859cd | 7346 | vFAIL2("Empty \\%c{}", (U8)value); |
ffc61ed2 | 7347 | if (*RExC_parse == '{') { |
1df70142 | 7348 | const U8 c = (U8)value; |
ffc61ed2 JH |
7349 | e = strchr(RExC_parse++, '}'); |
7350 | if (!e) | |
0da60cf5 | 7351 | vFAIL2("Missing right brace on \\%c{}", c); |
ab13f0c7 JH |
7352 | while (isSPACE(UCHARAT(RExC_parse))) |
7353 | RExC_parse++; | |
7354 | if (e == RExC_parse) | |
0da60cf5 | 7355 | vFAIL2("Empty \\%c{}", c); |
ffc61ed2 | 7356 | n = e - RExC_parse; |
ab13f0c7 JH |
7357 | while (isSPACE(UCHARAT(RExC_parse + n - 1))) |
7358 | n--; | |
ffc61ed2 JH |
7359 | } |
7360 | else { | |
7361 | e = RExC_parse; | |
7362 | n = 1; | |
7363 | } | |
7364 | if (!SIZE_ONLY) { | |
ab13f0c7 JH |
7365 | if (UCHARAT(RExC_parse) == '^') { |
7366 | RExC_parse++; | |
7367 | n--; | |
7368 | value = value == 'p' ? 'P' : 'p'; /* toggle */ | |
7369 | while (isSPACE(UCHARAT(RExC_parse))) { | |
7370 | RExC_parse++; | |
7371 | n--; | |
7372 | } | |
7373 | } | |
097eb12c AL |
7374 | Perl_sv_catpvf(aTHX_ listsv, "%cutf8::%.*s\n", |
7375 | (value=='p' ? '+' : '!'), (int)n, RExC_parse); | |
ffc61ed2 JH |
7376 | } |
7377 | RExC_parse = e + 1; | |
7378 | ANYOF_FLAGS(ret) |= ANYOF_UNICODE; | |
f81125e2 | 7379 | namedclass = ANYOF_MAX; /* no official name, but it's named */ |
3dab1dad | 7380 | } |
f81125e2 | 7381 | break; |
b8c5462f JH |
7382 | case 'n': value = '\n'; break; |
7383 | case 'r': value = '\r'; break; | |
7384 | case 't': value = '\t'; break; | |
7385 | case 'f': value = '\f'; break; | |
7386 | case 'b': value = '\b'; break; | |
c7f1f016 NIS |
7387 | case 'e': value = ASCII_TO_NATIVE('\033');break; |
7388 | case 'a': value = ASCII_TO_NATIVE('\007');break; | |
b8c5462f | 7389 | case 'x': |
ffc61ed2 | 7390 | if (*RExC_parse == '{') { |
a4c04bdc NC |
7391 | I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
7392 | | PERL_SCAN_DISALLOW_PREFIX; | |
3dab1dad | 7393 | char * const e = strchr(RExC_parse++, '}'); |
b81d288d | 7394 | if (!e) |
ffc61ed2 | 7395 | vFAIL("Missing right brace on \\x{}"); |
53305cf1 NC |
7396 | |
7397 | numlen = e - RExC_parse; | |
7398 | value = grok_hex(RExC_parse, &numlen, &flags, NULL); | |
ffc61ed2 JH |
7399 | RExC_parse = e + 1; |
7400 | } | |
7401 | else { | |
a4c04bdc | 7402 | I32 flags = PERL_SCAN_DISALLOW_PREFIX; |
53305cf1 NC |
7403 | numlen = 2; |
7404 | value = grok_hex(RExC_parse, &numlen, &flags, NULL); | |
ffc61ed2 JH |
7405 | RExC_parse += numlen; |
7406 | } | |
9e08bc66 TS |
7407 | if (PL_encoding && value < 0x100) |
7408 | goto recode_encoding; | |
b8c5462f JH |
7409 | break; |
7410 | case 'c': | |
830247a4 | 7411 | value = UCHARAT(RExC_parse++); |
b8c5462f JH |
7412 | value = toCTRL(value); |
7413 | break; | |
7414 | case '0': case '1': case '2': case '3': case '4': | |
7415 | case '5': case '6': case '7': case '8': case '9': | |
9e08bc66 TS |
7416 | { |
7417 | I32 flags = 0; | |
7418 | numlen = 3; | |
7419 | value = grok_oct(--RExC_parse, &numlen, &flags, NULL); | |
7420 | RExC_parse += numlen; | |
7421 | if (PL_encoding && value < 0x100) | |
7422 | goto recode_encoding; | |
7423 | break; | |
7424 | } | |
7425 | recode_encoding: | |
7426 | { | |
7427 | SV* enc = PL_encoding; | |
7428 | value = reg_recode((const char)(U8)value, &enc); | |
7429 | if (!enc && SIZE_ONLY && ckWARN(WARN_REGEXP)) | |
7430 | vWARN(RExC_parse, | |
7431 | "Invalid escape in the specified encoding"); | |
7432 | break; | |
7433 | } | |
1028017a | 7434 | default: |
041457d9 | 7435 | if (!SIZE_ONLY && isALPHA(value) && ckWARN(WARN_REGEXP)) |
ffc61ed2 JH |
7436 | vWARN2(RExC_parse, |
7437 | "Unrecognized escape \\%c in character class passed through", | |
7438 | (int)value); | |
1028017a | 7439 | break; |
b8c5462f | 7440 | } |
ffc61ed2 | 7441 | } /* end of \blah */ |
1b2d223b JH |
7442 | #ifdef EBCDIC |
7443 | else | |
7444 | literal_endpoint++; | |
7445 | #endif | |
ffc61ed2 JH |
7446 | |
7447 | if (namedclass > OOB_NAMEDCLASS) { /* this is a named class \blah */ | |
7448 | ||
7449 | if (!SIZE_ONLY && !need_class) | |
936ed897 | 7450 | ANYOF_CLASS_ZERO(ret); |
ffc61ed2 | 7451 | |
936ed897 | 7452 | need_class = 1; |
ffc61ed2 JH |
7453 | |
7454 | /* a bad range like a-\d, a-[:digit:] ? */ | |
7455 | if (range) { | |
73b437c8 | 7456 | if (!SIZE_ONLY) { |
afd78fd5 | 7457 | if (ckWARN(WARN_REGEXP)) { |
097eb12c | 7458 | const int w = |
afd78fd5 JH |
7459 | RExC_parse >= rangebegin ? |
7460 | RExC_parse - rangebegin : 0; | |
830247a4 | 7461 | vWARN4(RExC_parse, |
b45f050a | 7462 | "False [] range \"%*.*s\"", |
097eb12c | 7463 | w, w, rangebegin); |
afd78fd5 | 7464 | } |
3568d838 JH |
7465 | if (prevvalue < 256) { |
7466 | ANYOF_BITMAP_SET(ret, prevvalue); | |
ffc61ed2 JH |
7467 | ANYOF_BITMAP_SET(ret, '-'); |
7468 | } | |
7469 | else { | |
7470 | ANYOF_FLAGS(ret) |= ANYOF_UNICODE; | |
7471 | Perl_sv_catpvf(aTHX_ listsv, | |
3568d838 | 7472 | "%04"UVxf"\n%04"UVxf"\n", (UV)prevvalue, (UV) '-'); |
ffc61ed2 | 7473 | } |
b8c5462f | 7474 | } |
ffc61ed2 JH |
7475 | |
7476 | range = 0; /* this was not a true range */ | |
73b437c8 | 7477 | } |
ffc61ed2 | 7478 | |
89836f1f YO |
7479 | |
7480 | ||
73b437c8 | 7481 | if (!SIZE_ONLY) { |
c49a72a9 NC |
7482 | const char *what = NULL; |
7483 | char yesno = 0; | |
7484 | ||
3568d838 JH |
7485 | if (namedclass > OOB_NAMEDCLASS) |
7486 | optimize_invert = FALSE; | |
e2962f66 JH |
7487 | /* Possible truncation here but in some 64-bit environments |
7488 | * the compiler gets heartburn about switch on 64-bit values. | |
7489 | * A similar issue a little earlier when switching on value. | |
98f323fa | 7490 | * --jhi */ |
e2962f66 | 7491 | switch ((I32)namedclass) { |
89836f1f YO |
7492 | case _C_C_T_(ALNUM, isALNUM(value), "Word"); |
7493 | case _C_C_T_(ALNUMC, isALNUMC(value), "Alnum"); | |
7494 | case _C_C_T_(ALPHA, isALPHA(value), "Alpha"); | |
7495 | case _C_C_T_(BLANK, isBLANK(value), "Blank"); | |
7496 | case _C_C_T_(CNTRL, isCNTRL(value), "Cntrl"); | |
7497 | case _C_C_T_(GRAPH, isGRAPH(value), "Graph"); | |
7498 | case _C_C_T_(LOWER, isLOWER(value), "Lower"); | |
7499 | case _C_C_T_(PRINT, isPRINT(value), "Print"); | |
7500 | case _C_C_T_(PSXSPC, isPSXSPC(value), "Space"); | |
7501 | case _C_C_T_(PUNCT, isPUNCT(value), "Punct"); | |
7502 | case _C_C_T_(SPACE, isSPACE(value), "SpacePerl"); | |
7503 | case _C_C_T_(UPPER, isUPPER(value), "Upper"); | |
7504 | case _C_C_T_(XDIGIT, isXDIGIT(value), "XDigit"); | |
73b437c8 JH |
7505 | case ANYOF_ASCII: |
7506 | if (LOC) | |
936ed897 | 7507 | ANYOF_CLASS_SET(ret, ANYOF_ASCII); |
73b437c8 | 7508 | else { |
c7f1f016 | 7509 | #ifndef EBCDIC |
1ba5c669 JH |
7510 | for (value = 0; value < 128; value++) |
7511 | ANYOF_BITMAP_SET(ret, value); | |
7512 | #else /* EBCDIC */ | |
ffbc6a93 | 7513 | for (value = 0; value < 256; value++) { |
3a3c4447 JH |
7514 | if (isASCII(value)) |
7515 | ANYOF_BITMAP_SET(ret, value); | |
ffbc6a93 | 7516 | } |
1ba5c669 | 7517 | #endif /* EBCDIC */ |
73b437c8 | 7518 | } |
c49a72a9 NC |
7519 | yesno = '+'; |
7520 | what = "ASCII"; | |
73b437c8 JH |
7521 | break; |
7522 | case ANYOF_NASCII: | |
7523 | if (LOC) | |
936ed897 | 7524 | ANYOF_CLASS_SET(ret, ANYOF_NASCII); |
73b437c8 | 7525 | else { |
c7f1f016 | 7526 | #ifndef EBCDIC |
1ba5c669 JH |
7527 | for (value = 128; value < 256; value++) |
7528 | ANYOF_BITMAP_SET(ret, value); | |
7529 | #else /* EBCDIC */ | |
ffbc6a93 | 7530 | for (value = 0; value < 256; value++) { |
3a3c4447 JH |
7531 | if (!isASCII(value)) |
7532 | ANYOF_BITMAP_SET(ret, value); | |
ffbc6a93 | 7533 | } |
1ba5c669 | 7534 | #endif /* EBCDIC */ |
73b437c8 | 7535 | } |
c49a72a9 NC |
7536 | yesno = '!'; |
7537 | what = "ASCII"; | |
89836f1f | 7538 | break; |
ffc61ed2 JH |
7539 | case ANYOF_DIGIT: |
7540 | if (LOC) | |
7541 | ANYOF_CLASS_SET(ret, ANYOF_DIGIT); | |
7542 | else { | |
7543 | /* consecutive digits assumed */ | |
7544 | for (value = '0'; value <= '9'; value++) | |
7545 | ANYOF_BITMAP_SET(ret, value); | |
7546 | } | |
c49a72a9 NC |
7547 | yesno = '+'; |
7548 | what = "Digit"; | |
ffc61ed2 JH |
7549 | break; |
7550 | case ANYOF_NDIGIT: | |
7551 | if (LOC) | |
7552 | ANYOF_CLASS_SET(ret, ANYOF_NDIGIT); | |
7553 | else { | |
7554 | /* consecutive digits assumed */ | |
7555 | for (value = 0; value < '0'; value++) | |
7556 | ANYOF_BITMAP_SET(ret, value); | |
7557 | for (value = '9' + 1; value < 256; value++) | |
7558 | ANYOF_BITMAP_SET(ret, value); | |
7559 | } | |
c49a72a9 NC |
7560 | yesno = '!'; |
7561 | what = "Digit"; | |
89836f1f | 7562 | break; |
f81125e2 JP |
7563 | case ANYOF_MAX: |
7564 | /* this is to handle \p and \P */ | |
7565 | break; | |
73b437c8 | 7566 | default: |
b45f050a | 7567 | vFAIL("Invalid [::] class"); |
73b437c8 | 7568 | break; |
b8c5462f | 7569 | } |
c49a72a9 NC |
7570 | if (what) { |
7571 | /* Strings such as "+utf8::isWord\n" */ | |
7572 | Perl_sv_catpvf(aTHX_ listsv, "%cutf8::Is%s\n", yesno, what); | |
7573 | } | |
b8c5462f | 7574 | if (LOC) |
936ed897 | 7575 | ANYOF_FLAGS(ret) |= ANYOF_CLASS; |
73b437c8 | 7576 | continue; |
a0d0e21e | 7577 | } |
ffc61ed2 JH |
7578 | } /* end of namedclass \blah */ |
7579 | ||
a0d0e21e | 7580 | if (range) { |
eb160463 | 7581 | if (prevvalue > (IV)value) /* b-a */ { |
d4c19fe8 AL |
7582 | const int w = RExC_parse - rangebegin; |
7583 | Simple_vFAIL4("Invalid [] range \"%*.*s\"", w, w, rangebegin); | |
3568d838 | 7584 | range = 0; /* not a valid range */ |
73b437c8 | 7585 | } |
a0d0e21e LW |
7586 | } |
7587 | else { | |
3568d838 | 7588 | prevvalue = value; /* save the beginning of the range */ |
830247a4 IZ |
7589 | if (*RExC_parse == '-' && RExC_parse+1 < RExC_end && |
7590 | RExC_parse[1] != ']') { | |
7591 | RExC_parse++; | |
ffc61ed2 JH |
7592 | |
7593 | /* a bad range like \w-, [:word:]- ? */ | |
7594 | if (namedclass > OOB_NAMEDCLASS) { | |
afd78fd5 | 7595 | if (ckWARN(WARN_REGEXP)) { |
d4c19fe8 | 7596 | const int w = |
afd78fd5 JH |
7597 | RExC_parse >= rangebegin ? |
7598 | RExC_parse - rangebegin : 0; | |
830247a4 | 7599 | vWARN4(RExC_parse, |
b45f050a | 7600 | "False [] range \"%*.*s\"", |
097eb12c | 7601 | w, w, rangebegin); |
afd78fd5 | 7602 | } |
73b437c8 | 7603 | if (!SIZE_ONLY) |
936ed897 | 7604 | ANYOF_BITMAP_SET(ret, '-'); |
73b437c8 | 7605 | } else |
ffc61ed2 JH |
7606 | range = 1; /* yeah, it's a range! */ |
7607 | continue; /* but do it the next time */ | |
a0d0e21e | 7608 | } |
a687059c | 7609 | } |
ffc61ed2 | 7610 | |
93733859 | 7611 | /* now is the next time */ |
07be1b83 | 7612 | /*stored += (value - prevvalue + 1);*/ |
ae5c130c | 7613 | if (!SIZE_ONLY) { |
3568d838 | 7614 | if (prevvalue < 256) { |
1df70142 | 7615 | const IV ceilvalue = value < 256 ? value : 255; |
3dab1dad | 7616 | IV i; |
3568d838 | 7617 | #ifdef EBCDIC |
1b2d223b JH |
7618 | /* In EBCDIC [\x89-\x91] should include |
7619 | * the \x8e but [i-j] should not. */ | |
7620 | if (literal_endpoint == 2 && | |
7621 | ((isLOWER(prevvalue) && isLOWER(ceilvalue)) || | |
7622 | (isUPPER(prevvalue) && isUPPER(ceilvalue)))) | |
ffc61ed2 | 7623 | { |
3568d838 JH |
7624 | if (isLOWER(prevvalue)) { |
7625 | for (i = prevvalue; i <= ceilvalue; i++) | |
ffc61ed2 JH |
7626 | if (isLOWER(i)) |
7627 | ANYOF_BITMAP_SET(ret, i); | |
7628 | } else { | |
3568d838 | 7629 | for (i = prevvalue; i <= ceilvalue; i++) |
ffc61ed2 JH |
7630 | if (isUPPER(i)) |
7631 | ANYOF_BITMAP_SET(ret, i); | |
7632 | } | |
8ada0baa | 7633 | } |
ffc61ed2 | 7634 | else |
8ada0baa | 7635 | #endif |
07be1b83 YO |
7636 | for (i = prevvalue; i <= ceilvalue; i++) { |
7637 | if (!ANYOF_BITMAP_TEST(ret,i)) { | |
7638 | stored++; | |
7639 | ANYOF_BITMAP_SET(ret, i); | |
7640 | } | |
7641 | } | |
3568d838 | 7642 | } |
a5961de5 | 7643 | if (value > 255 || UTF) { |
1df70142 AL |
7644 | const UV prevnatvalue = NATIVE_TO_UNI(prevvalue); |
7645 | const UV natvalue = NATIVE_TO_UNI(value); | |
07be1b83 | 7646 | stored+=2; /* can't optimize this class */ |
ffc61ed2 | 7647 | ANYOF_FLAGS(ret) |= ANYOF_UNICODE; |
b08decb7 | 7648 | if (prevnatvalue < natvalue) { /* what about > ? */ |
ffc61ed2 | 7649 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n", |
b08decb7 JH |
7650 | prevnatvalue, natvalue); |
7651 | } | |
7652 | else if (prevnatvalue == natvalue) { | |
7653 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", natvalue); | |
09091399 | 7654 | if (FOLD) { |
89ebb4a3 | 7655 | U8 foldbuf[UTF8_MAXBYTES_CASE+1]; |
254ba52a | 7656 | STRLEN foldlen; |
1df70142 | 7657 | const UV f = to_uni_fold(natvalue, foldbuf, &foldlen); |
254ba52a | 7658 | |
e294cc5d JH |
7659 | #ifdef EBCDIC /* RD t/uni/fold ff and 6b */ |
7660 | if (RExC_precomp[0] == ':' && | |
7661 | RExC_precomp[1] == '[' && | |
7662 | (f == 0xDF || f == 0x92)) { | |
7663 | f = NATIVE_TO_UNI(f); | |
7664 | } | |
7665 | #endif | |
c840d2a2 JH |
7666 | /* If folding and foldable and a single |
7667 | * character, insert also the folded version | |
7668 | * to the charclass. */ | |
9e55ce06 | 7669 | if (f != value) { |
e294cc5d JH |
7670 | #ifdef EBCDIC /* RD tunifold ligatures s,t fb05, fb06 */ |
7671 | if ((RExC_precomp[0] == ':' && | |
7672 | RExC_precomp[1] == '[' && | |
7673 | (f == 0xA2 && | |
7674 | (value == 0xFB05 || value == 0xFB06))) ? | |
7675 | foldlen == ((STRLEN)UNISKIP(f) - 1) : | |
7676 | foldlen == (STRLEN)UNISKIP(f) ) | |
7677 | #else | |
eb160463 | 7678 | if (foldlen == (STRLEN)UNISKIP(f)) |
e294cc5d | 7679 | #endif |
9e55ce06 JH |
7680 | Perl_sv_catpvf(aTHX_ listsv, |
7681 | "%04"UVxf"\n", f); | |
7682 | else { | |
7683 | /* Any multicharacter foldings | |
7684 | * require the following transform: | |
7685 | * [ABCDEF] -> (?:[ABCabcDEFd]|pq|rst) | |
7686 | * where E folds into "pq" and F folds | |
7687 | * into "rst", all other characters | |
7688 | * fold to single characters. We save | |
7689 | * away these multicharacter foldings, | |
7690 | * to be later saved as part of the | |
7691 | * additional "s" data. */ | |
7692 | SV *sv; | |
7693 | ||
7694 | if (!unicode_alternate) | |
7695 | unicode_alternate = newAV(); | |
7696 | sv = newSVpvn((char*)foldbuf, foldlen); | |
7697 | SvUTF8_on(sv); | |
7698 | av_push(unicode_alternate, sv); | |
7699 | } | |
7700 | } | |
254ba52a | 7701 | |
60a8b682 JH |
7702 | /* If folding and the value is one of the Greek |
7703 | * sigmas insert a few more sigmas to make the | |
7704 | * folding rules of the sigmas to work right. | |
7705 | * Note that not all the possible combinations | |
7706 | * are handled here: some of them are handled | |
9e55ce06 JH |
7707 | * by the standard folding rules, and some of |
7708 | * them (literal or EXACTF cases) are handled | |
7709 | * during runtime in regexec.c:S_find_byclass(). */ | |
09091399 JH |
7710 | if (value == UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) { |
7711 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", | |
eb050b28 | 7712 | (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA); |
09091399 | 7713 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", |
eb050b28 | 7714 | (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA); |
09091399 JH |
7715 | } |
7716 | else if (value == UNICODE_GREEK_CAPITAL_LETTER_SIGMA) | |
7717 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\n", | |
eb050b28 | 7718 | (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA); |
09091399 JH |
7719 | } |
7720 | } | |
ffc61ed2 | 7721 | } |
1b2d223b JH |
7722 | #ifdef EBCDIC |
7723 | literal_endpoint = 0; | |
7724 | #endif | |
8ada0baa | 7725 | } |
ffc61ed2 JH |
7726 | |
7727 | range = 0; /* this range (if it was one) is done now */ | |
a0d0e21e | 7728 | } |
ffc61ed2 | 7729 | |
936ed897 | 7730 | if (need_class) { |
4f66b38d | 7731 | ANYOF_FLAGS(ret) |= ANYOF_LARGE; |
936ed897 | 7732 | if (SIZE_ONLY) |
830247a4 | 7733 | RExC_size += ANYOF_CLASS_ADD_SKIP; |
936ed897 | 7734 | else |
830247a4 | 7735 | RExC_emit += ANYOF_CLASS_ADD_SKIP; |
936ed897 | 7736 | } |
ffc61ed2 | 7737 | |
7f6f358c YO |
7738 | |
7739 | if (SIZE_ONLY) | |
7740 | return ret; | |
7741 | /****** !SIZE_ONLY AFTER HERE *********/ | |
7742 | ||
3b57cd43 | 7743 | if( stored == 1 && (value < 128 || (value < 256 && !UTF)) |
7f6f358c YO |
7744 | && !( ANYOF_FLAGS(ret) & ( ANYOF_FLAGS_ALL ^ ANYOF_FOLD ) ) |
7745 | ) { | |
7746 | /* optimize single char class to an EXACT node | |
7747 | but *only* when its not a UTF/high char */ | |
07be1b83 YO |
7748 | const char * cur_parse= RExC_parse; |
7749 | RExC_emit = (regnode *)orig_emit; | |
7750 | RExC_parse = (char *)orig_parse; | |
7f6f358c YO |
7751 | ret = reg_node(pRExC_state, |
7752 | (U8)((ANYOF_FLAGS(ret) & ANYOF_FOLD) ? EXACTF : EXACT)); | |
07be1b83 | 7753 | RExC_parse = (char *)cur_parse; |
7f6f358c YO |
7754 | *STRING(ret)= (char)value; |
7755 | STR_LEN(ret)= 1; | |
7756 | RExC_emit += STR_SZ(1); | |
7757 | return ret; | |
7758 | } | |
ae5c130c | 7759 | /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */ |
7f6f358c | 7760 | if ( /* If the only flag is folding (plus possibly inversion). */ |
516a5887 JH |
7761 | ((ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) |
7762 | ) { | |
a0ed51b3 | 7763 | for (value = 0; value < 256; ++value) { |
936ed897 | 7764 | if (ANYOF_BITMAP_TEST(ret, value)) { |
eb160463 | 7765 | UV fold = PL_fold[value]; |
ffc61ed2 JH |
7766 | |
7767 | if (fold != value) | |
7768 | ANYOF_BITMAP_SET(ret, fold); | |
ae5c130c GS |
7769 | } |
7770 | } | |
936ed897 | 7771 | ANYOF_FLAGS(ret) &= ~ANYOF_FOLD; |
ae5c130c | 7772 | } |
ffc61ed2 | 7773 | |
ae5c130c | 7774 | /* optimize inverted simple patterns (e.g. [^a-z]) */ |
7f6f358c | 7775 | if (optimize_invert && |
ffc61ed2 JH |
7776 | /* If the only flag is inversion. */ |
7777 | (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) { | |
b8c5462f | 7778 | for (value = 0; value < ANYOF_BITMAP_SIZE; ++value) |
936ed897 | 7779 | ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL; |
1aa99e6b | 7780 | ANYOF_FLAGS(ret) = ANYOF_UNICODE_ALL; |
ae5c130c | 7781 | } |
7f6f358c | 7782 | { |
097eb12c | 7783 | AV * const av = newAV(); |
ffc61ed2 | 7784 | SV *rv; |
9e55ce06 | 7785 | /* The 0th element stores the character class description |
6a0407ee | 7786 | * in its textual form: used later (regexec.c:Perl_regclass_swash()) |
9e55ce06 JH |
7787 | * to initialize the appropriate swash (which gets stored in |
7788 | * the 1st element), and also useful for dumping the regnode. | |
7789 | * The 2nd element stores the multicharacter foldings, | |
6a0407ee | 7790 | * used later (regexec.c:S_reginclass()). */ |
ffc61ed2 JH |
7791 | av_store(av, 0, listsv); |
7792 | av_store(av, 1, NULL); | |
9e55ce06 | 7793 | av_store(av, 2, (SV*)unicode_alternate); |
ffc61ed2 | 7794 | rv = newRV_noinc((SV*)av); |
19860706 | 7795 | n = add_data(pRExC_state, 1, "s"); |
f8fc2ecf | 7796 | RExC_rxi->data->data[n] = (void*)rv; |
ffc61ed2 | 7797 | ARG_SET(ret, n); |
a0ed51b3 | 7798 | } |
a0ed51b3 LW |
7799 | return ret; |
7800 | } | |
89836f1f YO |
7801 | #undef _C_C_T_ |
7802 | ||
a0ed51b3 | 7803 | |
bcdf7404 YO |
7804 | /* reg_skipcomment() |
7805 | ||
7806 | Absorbs an /x style # comments from the input stream. | |
7807 | Returns true if there is more text remaining in the stream. | |
7808 | Will set the REG_SEEN_RUN_ON_COMMENT flag if the comment | |
7809 | terminates the pattern without including a newline. | |
7810 | ||
7811 | Note its the callers responsibility to ensure that we are | |
7812 | actually in /x mode | |
7813 | ||
7814 | */ | |
7815 | ||
7816 | STATIC bool | |
7817 | S_reg_skipcomment(pTHX_ RExC_state_t *pRExC_state) | |
7818 | { | |
7819 | bool ended = 0; | |
7820 | while (RExC_parse < RExC_end) | |
7821 | if (*RExC_parse++ == '\n') { | |
7822 | ended = 1; | |
7823 | break; | |
7824 | } | |
7825 | if (!ended) { | |
7826 | /* we ran off the end of the pattern without ending | |
7827 | the comment, so we have to add an \n when wrapping */ | |
7828 | RExC_seen |= REG_SEEN_RUN_ON_COMMENT; | |
7829 | return 0; | |
7830 | } else | |
7831 | return 1; | |
7832 | } | |
7833 | ||
7834 | /* nextchar() | |
7835 | ||
7836 | Advance that parse position, and optionall absorbs | |
7837 | "whitespace" from the inputstream. | |
7838 | ||
7839 | Without /x "whitespace" means (?#...) style comments only, | |
7840 | with /x this means (?#...) and # comments and whitespace proper. | |
7841 | ||
7842 | Returns the RExC_parse point from BEFORE the scan occurs. | |
7843 | ||
7844 | This is the /x friendly way of saying RExC_parse++. | |
7845 | */ | |
7846 | ||
76e3520e | 7847 | STATIC char* |
830247a4 | 7848 | S_nextchar(pTHX_ RExC_state_t *pRExC_state) |
a0d0e21e | 7849 | { |
097eb12c | 7850 | char* const retval = RExC_parse++; |
a0d0e21e | 7851 | |
4633a7c4 | 7852 | for (;;) { |
830247a4 IZ |
7853 | if (*RExC_parse == '(' && RExC_parse[1] == '?' && |
7854 | RExC_parse[2] == '#') { | |
e994fd66 AE |
7855 | while (*RExC_parse != ')') { |
7856 | if (RExC_parse == RExC_end) | |
7857 | FAIL("Sequence (?#... not terminated"); | |
830247a4 | 7858 | RExC_parse++; |
e994fd66 | 7859 | } |
830247a4 | 7860 | RExC_parse++; |
4633a7c4 LW |
7861 | continue; |
7862 | } | |
bbe252da | 7863 | if (RExC_flags & RXf_PMf_EXTENDED) { |
830247a4 IZ |
7864 | if (isSPACE(*RExC_parse)) { |
7865 | RExC_parse++; | |
748a9306 LW |
7866 | continue; |
7867 | } | |
830247a4 | 7868 | else if (*RExC_parse == '#') { |
bcdf7404 YO |
7869 | if ( reg_skipcomment( pRExC_state ) ) |
7870 | continue; | |
748a9306 | 7871 | } |
748a9306 | 7872 | } |
4633a7c4 | 7873 | return retval; |
a0d0e21e | 7874 | } |
a687059c LW |
7875 | } |
7876 | ||
7877 | /* | |
c277df42 | 7878 | - reg_node - emit a node |
a0d0e21e | 7879 | */ |
76e3520e | 7880 | STATIC regnode * /* Location. */ |
830247a4 | 7881 | S_reg_node(pTHX_ RExC_state_t *pRExC_state, U8 op) |
a687059c | 7882 | { |
97aff369 | 7883 | dVAR; |
c277df42 | 7884 | register regnode *ptr; |
504618e9 | 7885 | regnode * const ret = RExC_emit; |
07be1b83 | 7886 | GET_RE_DEBUG_FLAGS_DECL; |
a687059c | 7887 | |
c277df42 | 7888 | if (SIZE_ONLY) { |
830247a4 IZ |
7889 | SIZE_ALIGN(RExC_size); |
7890 | RExC_size += 1; | |
a0d0e21e LW |
7891 | return(ret); |
7892 | } | |
3b57cd43 YO |
7893 | if (RExC_emit >= RExC_emit_bound) |
7894 | Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %d", op); | |
7895 | ||
c277df42 | 7896 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 7897 | ptr = ret; |
c277df42 | 7898 | FILL_ADVANCE_NODE(ptr, op); |
7122b237 | 7899 | #ifdef RE_TRACK_PATTERN_OFFSETS |
fac92740 | 7900 | if (RExC_offsets) { /* MJD */ |
07be1b83 | 7901 | MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n", |
fac92740 | 7902 | "reg_node", __LINE__, |
13d6edb4 | 7903 | PL_reg_name[op], |
07be1b83 YO |
7904 | (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] |
7905 | ? "Overwriting end of array!\n" : "OK", | |
7906 | (UV)(RExC_emit - RExC_emit_start), | |
7907 | (UV)(RExC_parse - RExC_start), | |
7908 | (UV)RExC_offsets[0])); | |
ccb2c380 | 7909 | Set_Node_Offset(RExC_emit, RExC_parse + (op == END)); |
fac92740 | 7910 | } |
7122b237 | 7911 | #endif |
830247a4 | 7912 | RExC_emit = ptr; |
a0d0e21e | 7913 | return(ret); |
a687059c LW |
7914 | } |
7915 | ||
7916 | /* | |
a0d0e21e LW |
7917 | - reganode - emit a node with an argument |
7918 | */ | |
76e3520e | 7919 | STATIC regnode * /* Location. */ |
830247a4 | 7920 | S_reganode(pTHX_ RExC_state_t *pRExC_state, U8 op, U32 arg) |
fe14fcc3 | 7921 | { |
97aff369 | 7922 | dVAR; |
c277df42 | 7923 | register regnode *ptr; |
504618e9 | 7924 | regnode * const ret = RExC_emit; |
07be1b83 | 7925 | GET_RE_DEBUG_FLAGS_DECL; |
fe14fcc3 | 7926 | |
c277df42 | 7927 | if (SIZE_ONLY) { |
830247a4 IZ |
7928 | SIZE_ALIGN(RExC_size); |
7929 | RExC_size += 2; | |
6bda09f9 YO |
7930 | /* |
7931 | We can't do this: | |
7932 | ||
7933 | assert(2==regarglen[op]+1); | |
7934 | ||
7935 | Anything larger than this has to allocate the extra amount. | |
7936 | If we changed this to be: | |
7937 | ||
7938 | RExC_size += (1 + regarglen[op]); | |
7939 | ||
7940 | then it wouldn't matter. Its not clear what side effect | |
7941 | might come from that so its not done so far. | |
7942 | -- dmq | |
7943 | */ | |
a0d0e21e LW |
7944 | return(ret); |
7945 | } | |
3b57cd43 YO |
7946 | if (RExC_emit >= RExC_emit_bound) |
7947 | Perl_croak(aTHX_ "panic: reg_node overrun trying to emit %d", op); | |
7948 | ||
c277df42 | 7949 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 7950 | ptr = ret; |
c277df42 | 7951 | FILL_ADVANCE_NODE_ARG(ptr, op, arg); |
7122b237 | 7952 | #ifdef RE_TRACK_PATTERN_OFFSETS |
fac92740 | 7953 | if (RExC_offsets) { /* MJD */ |
07be1b83 | 7954 | MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n", |
fac92740 | 7955 | "reganode", |
ccb2c380 | 7956 | __LINE__, |
13d6edb4 | 7957 | PL_reg_name[op], |
07be1b83 | 7958 | (UV)(RExC_emit - RExC_emit_start) > RExC_offsets[0] ? |
fac92740 | 7959 | "Overwriting end of array!\n" : "OK", |
07be1b83 YO |
7960 | (UV)(RExC_emit - RExC_emit_start), |
7961 | (UV)(RExC_parse - RExC_start), | |
7962 | (UV)RExC_offsets[0])); | |
ccb2c380 | 7963 | Set_Cur_Node_Offset; |
fac92740 | 7964 | } |
7122b237 | 7965 | #endif |
830247a4 | 7966 | RExC_emit = ptr; |
a0d0e21e | 7967 | return(ret); |
fe14fcc3 LW |
7968 | } |
7969 | ||
7970 | /* | |
cd439c50 | 7971 | - reguni - emit (if appropriate) a Unicode character |
a0ed51b3 | 7972 | */ |
71207a34 AL |
7973 | STATIC STRLEN |
7974 | S_reguni(pTHX_ const RExC_state_t *pRExC_state, UV uv, char* s) | |
a0ed51b3 | 7975 | { |
97aff369 | 7976 | dVAR; |
71207a34 | 7977 | return SIZE_ONLY ? UNISKIP(uv) : (uvchr_to_utf8((U8*)s, uv) - (U8*)s); |
a0ed51b3 LW |
7978 | } |
7979 | ||
7980 | /* | |
a0d0e21e LW |
7981 | - reginsert - insert an operator in front of already-emitted operand |
7982 | * | |
7983 | * Means relocating the operand. | |
7984 | */ | |
76e3520e | 7985 | STATIC void |
6bda09f9 | 7986 | S_reginsert(pTHX_ RExC_state_t *pRExC_state, U8 op, regnode *opnd, U32 depth) |
a687059c | 7987 | { |
97aff369 | 7988 | dVAR; |
c277df42 IZ |
7989 | register regnode *src; |
7990 | register regnode *dst; | |
7991 | register regnode *place; | |
504618e9 | 7992 | const int offset = regarglen[(U8)op]; |
6bda09f9 | 7993 | const int size = NODE_STEP_REGNODE + offset; |
07be1b83 | 7994 | GET_RE_DEBUG_FLAGS_DECL; |
def51078 | 7995 | PERL_UNUSED_ARG(depth); |
22c35a8c | 7996 | /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */ |
13d6edb4 | 7997 | DEBUG_PARSE_FMT("inst"," - %s",PL_reg_name[op]); |
c277df42 | 7998 | if (SIZE_ONLY) { |
6bda09f9 | 7999 | RExC_size += size; |
a0d0e21e LW |
8000 | return; |
8001 | } | |
a687059c | 8002 | |
830247a4 | 8003 | src = RExC_emit; |
6bda09f9 | 8004 | RExC_emit += size; |
830247a4 | 8005 | dst = RExC_emit; |
40d049e4 | 8006 | if (RExC_open_parens) { |
6bda09f9 | 8007 | int paren; |
3b57cd43 | 8008 | /*DEBUG_PARSE_FMT("inst"," - %"IVdf, (IV)RExC_npar);*/ |
6bda09f9 | 8009 | for ( paren=0 ; paren < RExC_npar ; paren++ ) { |
40d049e4 | 8010 | if ( RExC_open_parens[paren] >= opnd ) { |
3b57cd43 | 8011 | /*DEBUG_PARSE_FMT("open"," - %d",size);*/ |
40d049e4 YO |
8012 | RExC_open_parens[paren] += size; |
8013 | } else { | |
3b57cd43 | 8014 | /*DEBUG_PARSE_FMT("open"," - %s","ok");*/ |
40d049e4 YO |
8015 | } |
8016 | if ( RExC_close_parens[paren] >= opnd ) { | |
3b57cd43 | 8017 | /*DEBUG_PARSE_FMT("close"," - %d",size);*/ |
40d049e4 YO |
8018 | RExC_close_parens[paren] += size; |
8019 | } else { | |
3b57cd43 | 8020 | /*DEBUG_PARSE_FMT("close"," - %s","ok");*/ |
40d049e4 YO |
8021 | } |
8022 | } | |
6bda09f9 | 8023 | } |
40d049e4 | 8024 | |
fac92740 | 8025 | while (src > opnd) { |
c277df42 | 8026 | StructCopy(--src, --dst, regnode); |
7122b237 | 8027 | #ifdef RE_TRACK_PATTERN_OFFSETS |
fac92740 | 8028 | if (RExC_offsets) { /* MJD 20010112 */ |
07be1b83 | 8029 | MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s copy %"UVuf" -> %"UVuf" (max %"UVuf").\n", |
fac92740 | 8030 | "reg_insert", |
ccb2c380 | 8031 | __LINE__, |
13d6edb4 | 8032 | PL_reg_name[op], |
07be1b83 YO |
8033 | (UV)(dst - RExC_emit_start) > RExC_offsets[0] |
8034 | ? "Overwriting end of array!\n" : "OK", | |
8035 | (UV)(src - RExC_emit_start), | |
8036 | (UV)(dst - RExC_emit_start), | |
8037 | (UV)RExC_offsets[0])); | |
ccb2c380 MP |
8038 | Set_Node_Offset_To_R(dst-RExC_emit_start, Node_Offset(src)); |
8039 | Set_Node_Length_To_R(dst-RExC_emit_start, Node_Length(src)); | |
fac92740 | 8040 | } |
7122b237 | 8041 | #endif |
fac92740 MJD |
8042 | } |
8043 | ||
a0d0e21e LW |
8044 | |
8045 | place = opnd; /* Op node, where operand used to be. */ | |
7122b237 | 8046 | #ifdef RE_TRACK_PATTERN_OFFSETS |
fac92740 | 8047 | if (RExC_offsets) { /* MJD */ |
07be1b83 | 8048 | MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n", |
fac92740 | 8049 | "reginsert", |
ccb2c380 | 8050 | __LINE__, |
13d6edb4 | 8051 | PL_reg_name[op], |
07be1b83 | 8052 | (UV)(place - RExC_emit_start) > RExC_offsets[0] |
fac92740 | 8053 | ? "Overwriting end of array!\n" : "OK", |
07be1b83 YO |
8054 | (UV)(place - RExC_emit_start), |
8055 | (UV)(RExC_parse - RExC_start), | |
786e8c11 | 8056 | (UV)RExC_offsets[0])); |
ccb2c380 | 8057 | Set_Node_Offset(place, RExC_parse); |
45948336 | 8058 | Set_Node_Length(place, 1); |
fac92740 | 8059 | } |
7122b237 | 8060 | #endif |
c277df42 IZ |
8061 | src = NEXTOPER(place); |
8062 | FILL_ADVANCE_NODE(place, op); | |
8063 | Zero(src, offset, regnode); | |
a687059c LW |
8064 | } |
8065 | ||
8066 | /* | |
c277df42 | 8067 | - regtail - set the next-pointer at the end of a node chain of p to val. |
3dab1dad | 8068 | - SEE ALSO: regtail_study |
a0d0e21e | 8069 | */ |
097eb12c | 8070 | /* TODO: All three parms should be const */ |
76e3520e | 8071 | STATIC void |
3dab1dad | 8072 | S_regtail(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth) |
a687059c | 8073 | { |
97aff369 | 8074 | dVAR; |
c277df42 | 8075 | register regnode *scan; |
72f13be8 | 8076 | GET_RE_DEBUG_FLAGS_DECL; |
f9049ba1 SP |
8077 | #ifndef DEBUGGING |
8078 | PERL_UNUSED_ARG(depth); | |
8079 | #endif | |
a0d0e21e | 8080 | |
c277df42 | 8081 | if (SIZE_ONLY) |
a0d0e21e LW |
8082 | return; |
8083 | ||
8084 | /* Find last node. */ | |
8085 | scan = p; | |
8086 | for (;;) { | |
504618e9 | 8087 | regnode * const temp = regnext(scan); |
3dab1dad YO |
8088 | DEBUG_PARSE_r({ |
8089 | SV * const mysv=sv_newmortal(); | |
8090 | DEBUG_PARSE_MSG((scan==p ? "tail" : "")); | |
8091 | regprop(RExC_rx, mysv, scan); | |
eaf3ca90 YO |
8092 | PerlIO_printf(Perl_debug_log, "~ %s (%d) %s %s\n", |
8093 | SvPV_nolen_const(mysv), REG_NODE_NUM(scan), | |
8094 | (temp == NULL ? "->" : ""), | |
13d6edb4 | 8095 | (temp == NULL ? PL_reg_name[OP(val)] : "") |
eaf3ca90 | 8096 | ); |
3dab1dad YO |
8097 | }); |
8098 | if (temp == NULL) | |
8099 | break; | |
8100 | scan = temp; | |
8101 | } | |
8102 | ||
8103 | if (reg_off_by_arg[OP(scan)]) { | |
8104 | ARG_SET(scan, val - scan); | |
8105 | } | |
8106 | else { | |
8107 | NEXT_OFF(scan) = val - scan; | |
8108 | } | |
8109 | } | |
8110 | ||
07be1b83 | 8111 | #ifdef DEBUGGING |
3dab1dad YO |
8112 | /* |
8113 | - regtail_study - set the next-pointer at the end of a node chain of p to val. | |
8114 | - Look for optimizable sequences at the same time. | |
8115 | - currently only looks for EXACT chains. | |
07be1b83 YO |
8116 | |
8117 | This is expermental code. The idea is to use this routine to perform | |
8118 | in place optimizations on branches and groups as they are constructed, | |
8119 | with the long term intention of removing optimization from study_chunk so | |
8120 | that it is purely analytical. | |
8121 | ||
8122 | Currently only used when in DEBUG mode. The macro REGTAIL_STUDY() is used | |
8123 | to control which is which. | |
8124 | ||
3dab1dad YO |
8125 | */ |
8126 | /* TODO: All four parms should be const */ | |
07be1b83 | 8127 | |
3dab1dad YO |
8128 | STATIC U8 |
8129 | S_regtail_study(pTHX_ RExC_state_t *pRExC_state, regnode *p, const regnode *val,U32 depth) | |
8130 | { | |
8131 | dVAR; | |
8132 | register regnode *scan; | |
07be1b83 YO |
8133 | U8 exact = PSEUDO; |
8134 | #ifdef EXPERIMENTAL_INPLACESCAN | |
8135 | I32 min = 0; | |
8136 | #endif | |
8137 | ||
3dab1dad YO |
8138 | GET_RE_DEBUG_FLAGS_DECL; |
8139 | ||
07be1b83 | 8140 | |
3dab1dad YO |
8141 | if (SIZE_ONLY) |
8142 | return exact; | |
8143 | ||
8144 | /* Find last node. */ | |
8145 | ||
8146 | scan = p; | |
8147 | for (;;) { | |
8148 | regnode * const temp = regnext(scan); | |
07be1b83 YO |
8149 | #ifdef EXPERIMENTAL_INPLACESCAN |
8150 | if (PL_regkind[OP(scan)] == EXACT) | |
8151 | if (join_exact(pRExC_state,scan,&min,1,val,depth+1)) | |
8152 | return EXACT; | |
8153 | #endif | |
3dab1dad YO |
8154 | if ( exact ) { |
8155 | switch (OP(scan)) { | |
8156 | case EXACT: | |
8157 | case EXACTF: | |
8158 | case EXACTFL: | |
8159 | if( exact == PSEUDO ) | |
8160 | exact= OP(scan); | |
07be1b83 YO |
8161 | else if ( exact != OP(scan) ) |
8162 | exact= 0; | |
3dab1dad YO |
8163 | case NOTHING: |
8164 | break; | |
8165 | default: | |
8166 | exact= 0; | |
8167 | } | |
8168 | } | |
8169 | DEBUG_PARSE_r({ | |
8170 | SV * const mysv=sv_newmortal(); | |
8171 | DEBUG_PARSE_MSG((scan==p ? "tsdy" : "")); | |
8172 | regprop(RExC_rx, mysv, scan); | |
eaf3ca90 | 8173 | PerlIO_printf(Perl_debug_log, "~ %s (%d) -> %s\n", |
3dab1dad | 8174 | SvPV_nolen_const(mysv), |
eaf3ca90 | 8175 | REG_NODE_NUM(scan), |
13d6edb4 | 8176 | PL_reg_name[exact]); |
3dab1dad | 8177 | }); |
a0d0e21e LW |
8178 | if (temp == NULL) |
8179 | break; | |
8180 | scan = temp; | |
8181 | } | |
07be1b83 YO |
8182 | DEBUG_PARSE_r({ |
8183 | SV * const mysv_val=sv_newmortal(); | |
8184 | DEBUG_PARSE_MSG(""); | |
8185 | regprop(RExC_rx, mysv_val, val); | |
70685ca0 JH |
8186 | PerlIO_printf(Perl_debug_log, "~ attach to %s (%"IVdf") offset to %"IVdf"\n", |
8187 | SvPV_nolen_const(mysv_val), | |
8188 | (IV)REG_NODE_NUM(val), | |
8189 | (IV)(val - scan) | |
07be1b83 YO |
8190 | ); |
8191 | }); | |
c277df42 IZ |
8192 | if (reg_off_by_arg[OP(scan)]) { |
8193 | ARG_SET(scan, val - scan); | |
a0ed51b3 LW |
8194 | } |
8195 | else { | |
c277df42 IZ |
8196 | NEXT_OFF(scan) = val - scan; |
8197 | } | |
3dab1dad YO |
8198 | |
8199 | return exact; | |
a687059c | 8200 | } |
07be1b83 | 8201 | #endif |
a687059c LW |
8202 | |
8203 | /* | |
a687059c LW |
8204 | - regcurly - a little FSA that accepts {\d+,?\d*} |
8205 | */ | |
79072805 | 8206 | STATIC I32 |
5f66b61c | 8207 | S_regcurly(register const char *s) |
a687059c LW |
8208 | { |
8209 | if (*s++ != '{') | |
8210 | return FALSE; | |
f0fcb552 | 8211 | if (!isDIGIT(*s)) |
a687059c | 8212 | return FALSE; |
f0fcb552 | 8213 | while (isDIGIT(*s)) |
a687059c LW |
8214 | s++; |
8215 | if (*s == ',') | |
8216 | s++; | |
f0fcb552 | 8217 | while (isDIGIT(*s)) |
a687059c LW |
8218 | s++; |
8219 | if (*s != '}') | |
8220 | return FALSE; | |
8221 | return TRUE; | |
8222 | } | |
8223 | ||
a687059c LW |
8224 | |
8225 | /* | |
fd181c75 | 8226 | - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form |
a687059c LW |
8227 | */ |
8228 | void | |
097eb12c | 8229 | Perl_regdump(pTHX_ const regexp *r) |
a687059c | 8230 | { |
35ff7856 | 8231 | #ifdef DEBUGGING |
97aff369 | 8232 | dVAR; |
c445ea15 | 8233 | SV * const sv = sv_newmortal(); |
ab3bbdeb | 8234 | SV *dsv= sv_newmortal(); |
f8fc2ecf | 8235 | RXi_GET_DECL(r,ri); |
a687059c | 8236 | |
f8fc2ecf | 8237 | (void)dumpuntil(r, ri->program, ri->program + 1, NULL, NULL, sv, 0, 0); |
a0d0e21e LW |
8238 | |
8239 | /* Header fields of interest. */ | |
ab3bbdeb YO |
8240 | if (r->anchored_substr) { |
8241 | RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->anchored_substr), | |
8242 | RE_SV_DUMPLEN(r->anchored_substr), 30); | |
7b0972df | 8243 | PerlIO_printf(Perl_debug_log, |
ab3bbdeb YO |
8244 | "anchored %s%s at %"IVdf" ", |
8245 | s, RE_SV_TAIL(r->anchored_substr), | |
7b0972df | 8246 | (IV)r->anchored_offset); |
ab3bbdeb YO |
8247 | } else if (r->anchored_utf8) { |
8248 | RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->anchored_utf8), | |
8249 | RE_SV_DUMPLEN(r->anchored_utf8), 30); | |
33b8afdf | 8250 | PerlIO_printf(Perl_debug_log, |
ab3bbdeb YO |
8251 | "anchored utf8 %s%s at %"IVdf" ", |
8252 | s, RE_SV_TAIL(r->anchored_utf8), | |
33b8afdf | 8253 | (IV)r->anchored_offset); |
ab3bbdeb YO |
8254 | } |
8255 | if (r->float_substr) { | |
8256 | RE_PV_QUOTED_DECL(s, 0, dsv, SvPVX_const(r->float_substr), | |
8257 | RE_SV_DUMPLEN(r->float_substr), 30); | |
7b0972df | 8258 | PerlIO_printf(Perl_debug_log, |
ab3bbdeb YO |
8259 | "floating %s%s at %"IVdf"..%"UVuf" ", |
8260 | s, RE_SV_TAIL(r->float_substr), | |
7b0972df | 8261 | (IV)r->float_min_offset, (UV)r->float_max_offset); |
ab3bbdeb YO |
8262 | } else if (r->float_utf8) { |
8263 | RE_PV_QUOTED_DECL(s, 1, dsv, SvPVX_const(r->float_utf8), | |
8264 | RE_SV_DUMPLEN(r->float_utf8), 30); | |
33b8afdf | 8265 | PerlIO_printf(Perl_debug_log, |
ab3bbdeb YO |
8266 | "floating utf8 %s%s at %"IVdf"..%"UVuf" ", |
8267 | s, RE_SV_TAIL(r->float_utf8), | |
33b8afdf | 8268 | (IV)r->float_min_offset, (UV)r->float_max_offset); |
ab3bbdeb | 8269 | } |
33b8afdf | 8270 | if (r->check_substr || r->check_utf8) |
b81d288d | 8271 | PerlIO_printf(Perl_debug_log, |
10edeb5d JH |
8272 | (const char *) |
8273 | (r->check_substr == r->float_substr | |
8274 | && r->check_utf8 == r->float_utf8 | |
8275 | ? "(checking floating" : "(checking anchored")); | |
bbe252da | 8276 | if (r->extflags & RXf_NOSCAN) |
c277df42 | 8277 | PerlIO_printf(Perl_debug_log, " noscan"); |
bbe252da | 8278 | if (r->extflags & RXf_CHECK_ALL) |
c277df42 | 8279 | PerlIO_printf(Perl_debug_log, " isall"); |
33b8afdf | 8280 | if (r->check_substr || r->check_utf8) |
c277df42 IZ |
8281 | PerlIO_printf(Perl_debug_log, ") "); |
8282 | ||
f8fc2ecf YO |
8283 | if (ri->regstclass) { |
8284 | regprop(r, sv, ri->regstclass); | |
1de06328 | 8285 | PerlIO_printf(Perl_debug_log, "stclass %s ", SvPVX_const(sv)); |
46fc3d4c | 8286 | } |
bbe252da | 8287 | if (r->extflags & RXf_ANCH) { |
774d564b | 8288 | PerlIO_printf(Perl_debug_log, "anchored"); |
bbe252da | 8289 | if (r->extflags & RXf_ANCH_BOL) |
774d564b | 8290 | PerlIO_printf(Perl_debug_log, "(BOL)"); |
bbe252da | 8291 | if (r->extflags & RXf_ANCH_MBOL) |
c277df42 | 8292 | PerlIO_printf(Perl_debug_log, "(MBOL)"); |
bbe252da | 8293 | if (r->extflags & RXf_ANCH_SBOL) |
cad2e5aa | 8294 | PerlIO_printf(Perl_debug_log, "(SBOL)"); |
bbe252da | 8295 | if (r->extflags & RXf_ANCH_GPOS) |
774d564b | 8296 | PerlIO_printf(Perl_debug_log, "(GPOS)"); |
8297 | PerlIO_putc(Perl_debug_log, ' '); | |
8298 | } | |
bbe252da | 8299 | if (r->extflags & RXf_GPOS_SEEN) |
70685ca0 | 8300 | PerlIO_printf(Perl_debug_log, "GPOS:%"UVuf" ", (UV)r->gofs); |
bbe252da | 8301 | if (r->intflags & PREGf_SKIP) |
760ac839 | 8302 | PerlIO_printf(Perl_debug_log, "plus "); |
bbe252da | 8303 | if (r->intflags & PREGf_IMPLICIT) |
760ac839 | 8304 | PerlIO_printf(Perl_debug_log, "implicit "); |
70685ca0 | 8305 | PerlIO_printf(Perl_debug_log, "minlen %"IVdf" ", (IV)r->minlen); |
bbe252da | 8306 | if (r->extflags & RXf_EVAL_SEEN) |
ce862d02 | 8307 | PerlIO_printf(Perl_debug_log, "with eval "); |
760ac839 | 8308 | PerlIO_printf(Perl_debug_log, "\n"); |
65e66c80 | 8309 | #else |
96a5add6 | 8310 | PERL_UNUSED_CONTEXT; |
65e66c80 | 8311 | PERL_UNUSED_ARG(r); |
17c3b450 | 8312 | #endif /* DEBUGGING */ |
a687059c LW |
8313 | } |
8314 | ||
8315 | /* | |
a0d0e21e LW |
8316 | - regprop - printable representation of opcode |
8317 | */ | |
46fc3d4c | 8318 | void |
32fc9b6a | 8319 | Perl_regprop(pTHX_ const regexp *prog, SV *sv, const regnode *o) |
a687059c | 8320 | { |
35ff7856 | 8321 | #ifdef DEBUGGING |
97aff369 | 8322 | dVAR; |
9b155405 | 8323 | register int k; |
f8fc2ecf | 8324 | RXi_GET_DECL(prog,progi); |
1de06328 | 8325 | GET_RE_DEBUG_FLAGS_DECL; |
f8fc2ecf | 8326 | |
a0d0e21e | 8327 | |
54dc92de | 8328 | sv_setpvn(sv, "", 0); |
8aa23a47 | 8329 | |
03363afd | 8330 | if (OP(o) > REGNODE_MAX) /* regnode.type is unsigned */ |
830247a4 IZ |
8331 | /* It would be nice to FAIL() here, but this may be called from |
8332 | regexec.c, and it would be hard to supply pRExC_state. */ | |
a5ca303d | 8333 | Perl_croak(aTHX_ "Corrupted regexp opcode %d > %d", (int)OP(o), (int)REGNODE_MAX); |
13d6edb4 | 8334 | sv_catpv(sv, PL_reg_name[OP(o)]); /* Take off const! */ |
9b155405 | 8335 | |
3dab1dad | 8336 | k = PL_regkind[OP(o)]; |
9b155405 | 8337 | |
2a782b5b | 8338 | if (k == EXACT) { |
396482e1 | 8339 | SV * const dsv = sv_2mortal(newSVpvs("")); |
ab3bbdeb YO |
8340 | /* Using is_utf8_string() (via PERL_PV_UNI_DETECT) |
8341 | * is a crude hack but it may be the best for now since | |
8342 | * we have no flag "this EXACTish node was UTF-8" | |
8343 | * --jhi */ | |
8344 | const char * const s = | |
ddc5bc0f | 8345 | pv_pretty(dsv, STRING(o), STR_LEN(o), 60, |
ab3bbdeb YO |
8346 | PL_colors[0], PL_colors[1], |
8347 | PERL_PV_ESCAPE_UNI_DETECT | | |
8348 | PERL_PV_PRETTY_ELIPSES | | |
8349 | PERL_PV_PRETTY_LTGT | |
8350 | ); | |
8351 | Perl_sv_catpvf(aTHX_ sv, " %s", s ); | |
bb263b4e | 8352 | } else if (k == TRIE) { |
3dab1dad | 8353 | /* print the details of the trie in dumpuntil instead, as |
f8fc2ecf | 8354 | * progi->data isn't available here */ |
1de06328 | 8355 | const char op = OP(o); |
647f639f | 8356 | const U32 n = ARG(o); |
1de06328 | 8357 | const reg_ac_data * const ac = IS_TRIE_AC(op) ? |
f8fc2ecf | 8358 | (reg_ac_data *)progi->data->data[n] : |
1de06328 | 8359 | NULL; |
3251b653 NC |
8360 | const reg_trie_data * const trie |
8361 | = (reg_trie_data*)progi->data->data[!IS_TRIE_AC(op) ? n : ac->trie]; | |
1de06328 | 8362 | |
13d6edb4 | 8363 | Perl_sv_catpvf(aTHX_ sv, "-%s",PL_reg_name[o->flags]); |
1de06328 YO |
8364 | DEBUG_TRIE_COMPILE_r( |
8365 | Perl_sv_catpvf(aTHX_ sv, | |
8366 | "<S:%"UVuf"/%"IVdf" W:%"UVuf" L:%"UVuf"/%"UVuf" C:%"UVuf"/%"UVuf">", | |
8367 | (UV)trie->startstate, | |
1e2e3d02 | 8368 | (IV)trie->statecount-1, /* -1 because of the unused 0 element */ |
1de06328 YO |
8369 | (UV)trie->wordcount, |
8370 | (UV)trie->minlen, | |
8371 | (UV)trie->maxlen, | |
8372 | (UV)TRIE_CHARCOUNT(trie), | |
8373 | (UV)trie->uniquecharcount | |
8374 | ) | |
8375 | ); | |
8376 | if ( IS_ANYOF_TRIE(op) || trie->bitmap ) { | |
8377 | int i; | |
8378 | int rangestart = -1; | |
f46cb337 | 8379 | U8* bitmap = IS_ANYOF_TRIE(op) ? (U8*)ANYOF_BITMAP(o) : (U8*)TRIE_BITMAP(trie); |
1de06328 YO |
8380 | Perl_sv_catpvf(aTHX_ sv, "["); |
8381 | for (i = 0; i <= 256; i++) { | |
8382 | if (i < 256 && BITMAP_TEST(bitmap,i)) { | |
8383 | if (rangestart == -1) | |
8384 | rangestart = i; | |
8385 | } else if (rangestart != -1) { | |
8386 | if (i <= rangestart + 3) | |
8387 | for (; rangestart < i; rangestart++) | |
8388 | put_byte(sv, rangestart); | |
8389 | else { | |
8390 | put_byte(sv, rangestart); | |
8391 | sv_catpvs(sv, "-"); | |
8392 | put_byte(sv, i - 1); | |
8393 | } | |
8394 | rangestart = -1; | |
8395 | } | |
8396 | } | |
8397 | Perl_sv_catpvf(aTHX_ sv, "]"); | |
8398 | } | |
8399 | ||
a3621e74 | 8400 | } else if (k == CURLY) { |
cb434fcc | 8401 | if (OP(o) == CURLYM || OP(o) == CURLYN || OP(o) == CURLYX) |
cea2e8a9 GS |
8402 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */ |
8403 | Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o)); | |
a0d0e21e | 8404 | } |
2c2d71f5 JH |
8405 | else if (k == WHILEM && o->flags) /* Ordinal/of */ |
8406 | Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4); | |
1f1031fe | 8407 | else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP || OP(o)==ACCEPT) { |
894356b3 | 8408 | Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */ |
1f1031fe | 8409 | if ( prog->paren_names ) { |
ee9b8eae YO |
8410 | if ( k != REF || OP(o) < NREF) { |
8411 | AV *list= (AV *)progi->data->data[progi->name_list_idx]; | |
8412 | SV **name= av_fetch(list, ARG(o), 0 ); | |
8413 | if (name) | |
8414 | Perl_sv_catpvf(aTHX_ sv, " '%"SVf"'", SVfARG(*name)); | |
8415 | } | |
8416 | else { | |
8417 | AV *list= (AV *)progi->data->data[ progi->name_list_idx ]; | |
8418 | SV *sv_dat=(SV*)progi->data->data[ ARG( o ) ]; | |
8419 | I32 *nums=(I32*)SvPVX(sv_dat); | |
8420 | SV **name= av_fetch(list, nums[0], 0 ); | |
8421 | I32 n; | |
8422 | if (name) { | |
8423 | for ( n=0; n<SvIVX(sv_dat); n++ ) { | |
8424 | Perl_sv_catpvf(aTHX_ sv, "%s%"IVdf, | |
8425 | (n ? "," : ""), (IV)nums[n]); | |
8426 | } | |
8427 | Perl_sv_catpvf(aTHX_ sv, " '%"SVf"'", SVfARG(*name)); | |
1f1031fe | 8428 | } |
1f1031fe | 8429 | } |
ee9b8eae | 8430 | } |
1f1031fe | 8431 | } else if (k == GOSUB) |
6bda09f9 | 8432 | Perl_sv_catpvf(aTHX_ sv, "%d[%+d]", (int)ARG(o),(int)ARG2L(o)); /* Paren and offset */ |
e2e6a0f1 YO |
8433 | else if (k == VERB) { |
8434 | if (!o->flags) | |
8435 | Perl_sv_catpvf(aTHX_ sv, ":%"SVf, | |
be2597df | 8436 | SVfARG((SV*)progi->data->data[ ARG( o ) ])); |
e2e6a0f1 | 8437 | } else if (k == LOGICAL) |
04ebc1ab | 8438 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */ |
653099ff GS |
8439 | else if (k == ANYOF) { |
8440 | int i, rangestart = -1; | |
2d03de9c | 8441 | const U8 flags = ANYOF_FLAGS(o); |
0bd48802 AL |
8442 | |
8443 | /* Should be synchronized with * ANYOF_ #xdefines in regcomp.h */ | |
8444 | static const char * const anyofs[] = { | |
653099ff GS |
8445 | "\\w", |
8446 | "\\W", | |
8447 | "\\s", | |
8448 | "\\S", | |
8449 | "\\d", | |
8450 | "\\D", | |
8451 | "[:alnum:]", | |
8452 | "[:^alnum:]", | |
8453 | "[:alpha:]", | |
8454 | "[:^alpha:]", | |
8455 | "[:ascii:]", | |
8456 | "[:^ascii:]", | |
8457 | "[:ctrl:]", | |
8458 | "[:^ctrl:]", | |
8459 | "[:graph:]", | |
8460 | "[:^graph:]", | |
8461 | "[:lower:]", | |
8462 | "[:^lower:]", | |
8463 | "[:print:]", | |
8464 | "[:^print:]", | |
8465 | "[:punct:]", | |
8466 | "[:^punct:]", | |
8467 | "[:upper:]", | |
aaa51d5e | 8468 | "[:^upper:]", |
653099ff | 8469 | "[:xdigit:]", |
aaa51d5e JF |
8470 | "[:^xdigit:]", |
8471 | "[:space:]", | |
8472 | "[:^space:]", | |
8473 | "[:blank:]", | |
8474 | "[:^blank:]" | |
653099ff GS |
8475 | }; |
8476 | ||
19860706 | 8477 | if (flags & ANYOF_LOCALE) |
396482e1 | 8478 | sv_catpvs(sv, "{loc}"); |
19860706 | 8479 | if (flags & ANYOF_FOLD) |
396482e1 | 8480 | sv_catpvs(sv, "{i}"); |
653099ff | 8481 | Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]); |
19860706 | 8482 | if (flags & ANYOF_INVERT) |
396482e1 | 8483 | sv_catpvs(sv, "^"); |
ffc61ed2 JH |
8484 | for (i = 0; i <= 256; i++) { |
8485 | if (i < 256 && ANYOF_BITMAP_TEST(o,i)) { | |
8486 | if (rangestart == -1) | |
8487 | rangestart = i; | |
8488 | } else if (rangestart != -1) { | |
8489 | if (i <= rangestart + 3) | |
8490 | for (; rangestart < i; rangestart++) | |
653099ff | 8491 | put_byte(sv, rangestart); |
ffc61ed2 JH |
8492 | else { |
8493 | put_byte(sv, rangestart); | |
396482e1 | 8494 | sv_catpvs(sv, "-"); |
ffc61ed2 | 8495 | put_byte(sv, i - 1); |
653099ff | 8496 | } |
ffc61ed2 | 8497 | rangestart = -1; |
653099ff | 8498 | } |
847a199f | 8499 | } |
ffc61ed2 JH |
8500 | |
8501 | if (o->flags & ANYOF_CLASS) | |
bb7a0f54 | 8502 | for (i = 0; i < (int)(sizeof(anyofs)/sizeof(char*)); i++) |
ffc61ed2 JH |
8503 | if (ANYOF_CLASS_TEST(o,i)) |
8504 | sv_catpv(sv, anyofs[i]); | |
8505 | ||
8506 | if (flags & ANYOF_UNICODE) | |
396482e1 | 8507 | sv_catpvs(sv, "{unicode}"); |
1aa99e6b | 8508 | else if (flags & ANYOF_UNICODE_ALL) |
396482e1 | 8509 | sv_catpvs(sv, "{unicode_all}"); |
ffc61ed2 JH |
8510 | |
8511 | { | |
8512 | SV *lv; | |
32fc9b6a | 8513 | SV * const sw = regclass_swash(prog, o, FALSE, &lv, 0); |
b81d288d | 8514 | |
ffc61ed2 JH |
8515 | if (lv) { |
8516 | if (sw) { | |
89ebb4a3 | 8517 | U8 s[UTF8_MAXBYTES_CASE+1]; |
b81d288d | 8518 | |
ffc61ed2 | 8519 | for (i = 0; i <= 256; i++) { /* just the first 256 */ |
1df70142 | 8520 | uvchr_to_utf8(s, i); |
ffc61ed2 | 8521 | |
3568d838 | 8522 | if (i < 256 && swash_fetch(sw, s, TRUE)) { |
ffc61ed2 JH |
8523 | if (rangestart == -1) |
8524 | rangestart = i; | |
8525 | } else if (rangestart != -1) { | |
ffc61ed2 JH |
8526 | if (i <= rangestart + 3) |
8527 | for (; rangestart < i; rangestart++) { | |
2d03de9c AL |
8528 | const U8 * const e = uvchr_to_utf8(s,rangestart); |
8529 | U8 *p; | |
8530 | for(p = s; p < e; p++) | |
ffc61ed2 JH |
8531 | put_byte(sv, *p); |
8532 | } | |
8533 | else { | |
2d03de9c AL |
8534 | const U8 *e = uvchr_to_utf8(s,rangestart); |
8535 | U8 *p; | |
8536 | for (p = s; p < e; p++) | |
ffc61ed2 | 8537 | put_byte(sv, *p); |
396482e1 | 8538 | sv_catpvs(sv, "-"); |
2d03de9c AL |
8539 | e = uvchr_to_utf8(s, i-1); |
8540 | for (p = s; p < e; p++) | |
1df70142 | 8541 | put_byte(sv, *p); |
ffc61ed2 JH |
8542 | } |
8543 | rangestart = -1; | |
8544 | } | |
19860706 | 8545 | } |
ffc61ed2 | 8546 | |
396482e1 | 8547 | sv_catpvs(sv, "..."); /* et cetera */ |
19860706 | 8548 | } |
fde631ed | 8549 | |
ffc61ed2 | 8550 | { |
2e0de35c | 8551 | char *s = savesvpv(lv); |
c445ea15 | 8552 | char * const origs = s; |
b81d288d | 8553 | |
3dab1dad YO |
8554 | while (*s && *s != '\n') |
8555 | s++; | |
b81d288d | 8556 | |
ffc61ed2 | 8557 | if (*s == '\n') { |
2d03de9c | 8558 | const char * const t = ++s; |
ffc61ed2 JH |
8559 | |
8560 | while (*s) { | |
8561 | if (*s == '\n') | |
8562 | *s = ' '; | |
8563 | s++; | |
8564 | } | |
8565 | if (s[-1] == ' ') | |
8566 | s[-1] = 0; | |
8567 | ||
8568 | sv_catpv(sv, t); | |
fde631ed | 8569 | } |
b81d288d | 8570 | |
ffc61ed2 | 8571 | Safefree(origs); |
fde631ed JH |
8572 | } |
8573 | } | |
653099ff | 8574 | } |
ffc61ed2 | 8575 | |
653099ff GS |
8576 | Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]); |
8577 | } | |
9b155405 | 8578 | else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH)) |
07be1b83 | 8579 | Perl_sv_catpvf(aTHX_ sv, "[%d]", -(o->flags)); |
65e66c80 | 8580 | #else |
96a5add6 | 8581 | PERL_UNUSED_CONTEXT; |
65e66c80 SP |
8582 | PERL_UNUSED_ARG(sv); |
8583 | PERL_UNUSED_ARG(o); | |
f9049ba1 | 8584 | PERL_UNUSED_ARG(prog); |
17c3b450 | 8585 | #endif /* DEBUGGING */ |
35ff7856 | 8586 | } |
a687059c | 8587 | |
cad2e5aa JH |
8588 | SV * |
8589 | Perl_re_intuit_string(pTHX_ regexp *prog) | |
8590 | { /* Assume that RE_INTUIT is set */ | |
97aff369 | 8591 | dVAR; |
a3621e74 | 8592 | GET_RE_DEBUG_FLAGS_DECL; |
96a5add6 AL |
8593 | PERL_UNUSED_CONTEXT; |
8594 | ||
a3621e74 | 8595 | DEBUG_COMPILE_r( |
cfd0369c | 8596 | { |
2d03de9c | 8597 | const char * const s = SvPV_nolen_const(prog->check_substr |
cfd0369c | 8598 | ? prog->check_substr : prog->check_utf8); |
cad2e5aa JH |
8599 | |
8600 | if (!PL_colorset) reginitcolors(); | |
8601 | PerlIO_printf(Perl_debug_log, | |
a0288114 | 8602 | "%sUsing REx %ssubstr:%s \"%s%.60s%s%s\"\n", |
33b8afdf JH |
8603 | PL_colors[4], |
8604 | prog->check_substr ? "" : "utf8 ", | |
8605 | PL_colors[5],PL_colors[0], | |
cad2e5aa JH |
8606 | s, |
8607 | PL_colors[1], | |
8608 | (strlen(s) > 60 ? "..." : "")); | |
8609 | } ); | |
8610 | ||
33b8afdf | 8611 | return prog->check_substr ? prog->check_substr : prog->check_utf8; |
cad2e5aa JH |
8612 | } |
8613 | ||
84da74a7 | 8614 | /* |
f8149455 | 8615 | pregfree() |
84da74a7 | 8616 | |
f8149455 YO |
8617 | handles refcounting and freeing the perl core regexp structure. When |
8618 | it is necessary to actually free the structure the first thing it | |
8619 | does is call the 'free' method of the regexp_engine associated to to | |
8620 | the regexp, allowing the handling of the void *pprivate; member | |
8621 | first. (This routine is not overridable by extensions, which is why | |
8622 | the extensions free is called first.) | |
8623 | ||
8624 | See regdupe and regdupe_internal if you change anything here. | |
84da74a7 | 8625 | */ |
f8149455 | 8626 | #ifndef PERL_IN_XSUB_RE |
2b69d0c2 | 8627 | void |
864dbfa3 | 8628 | Perl_pregfree(pTHX_ struct regexp *r) |
a687059c | 8629 | { |
27da23d5 | 8630 | dVAR; |
fc32ee4a | 8631 | GET_RE_DEBUG_FLAGS_DECL; |
a3621e74 | 8632 | |
7821416a IZ |
8633 | if (!r || (--r->refcnt > 0)) |
8634 | return; | |
f8149455 YO |
8635 | |
8636 | CALLREGFREE_PVT(r); /* free the private data */ | |
ed252734 | 8637 | RX_MATCH_COPY_FREE(r); |
f8c7b90f | 8638 | #ifdef PERL_OLD_COPY_ON_WRITE |
ed252734 NC |
8639 | if (r->saved_copy) |
8640 | SvREFCNT_dec(r->saved_copy); | |
8641 | #endif | |
a193d654 GS |
8642 | if (r->substrs) { |
8643 | if (r->anchored_substr) | |
8644 | SvREFCNT_dec(r->anchored_substr); | |
33b8afdf JH |
8645 | if (r->anchored_utf8) |
8646 | SvREFCNT_dec(r->anchored_utf8); | |
a193d654 GS |
8647 | if (r->float_substr) |
8648 | SvREFCNT_dec(r->float_substr); | |
33b8afdf JH |
8649 | if (r->float_utf8) |
8650 | SvREFCNT_dec(r->float_utf8); | |
2779dcf1 | 8651 | Safefree(r->substrs); |
a193d654 | 8652 | } |
81714fb9 | 8653 | if (r->paren_names) |
bcdf7404 YO |
8654 | SvREFCNT_dec(r->paren_names); |
8655 | Safefree(r->wrapped); | |
f8149455 YO |
8656 | Safefree(r->startp); |
8657 | Safefree(r->endp); | |
8658 | Safefree(r); | |
8659 | } | |
8660 | #endif | |
8661 | ||
8662 | /* regfree_internal() | |
8663 | ||
8664 | Free the private data in a regexp. This is overloadable by | |
8665 | extensions. Perl takes care of the regexp structure in pregfree(), | |
8666 | this covers the *pprivate pointer which technically perldoesnt | |
8667 | know about, however of course we have to handle the | |
8668 | regexp_internal structure when no extension is in use. | |
8669 | ||
8670 | Note this is called before freeing anything in the regexp | |
8671 | structure. | |
8672 | */ | |
8673 | ||
8674 | void | |
8675 | Perl_regfree_internal(pTHX_ struct regexp *r) | |
8676 | { | |
8677 | dVAR; | |
8678 | RXi_GET_DECL(r,ri); | |
8679 | GET_RE_DEBUG_FLAGS_DECL; | |
8680 | ||
8681 | DEBUG_COMPILE_r({ | |
8682 | if (!PL_colorset) | |
8683 | reginitcolors(); | |
8684 | { | |
8685 | SV *dsv= sv_newmortal(); | |
8686 | RE_PV_QUOTED_DECL(s, (r->extflags & RXf_UTF8), | |
8687 | dsv, r->precomp, r->prelen, 60); | |
8688 | PerlIO_printf(Perl_debug_log,"%sFreeing REx:%s %s\n", | |
8689 | PL_colors[4],PL_colors[5],s); | |
8690 | } | |
8691 | }); | |
7122b237 YO |
8692 | #ifdef RE_TRACK_PATTERN_OFFSETS |
8693 | if (ri->u.offsets) | |
8694 | Safefree(ri->u.offsets); /* 20010421 MJD */ | |
8695 | #endif | |
f8fc2ecf YO |
8696 | if (ri->data) { |
8697 | int n = ri->data->count; | |
f3548bdc DM |
8698 | PAD* new_comppad = NULL; |
8699 | PAD* old_comppad; | |
4026c95a | 8700 | PADOFFSET refcnt; |
dfad63ad | 8701 | |
c277df42 | 8702 | while (--n >= 0) { |
261faec3 | 8703 | /* If you add a ->what type here, update the comment in regcomp.h */ |
f8fc2ecf | 8704 | switch (ri->data->what[n]) { |
c277df42 | 8705 | case 's': |
81714fb9 | 8706 | case 'S': |
55eed653 | 8707 | case 'u': |
f8fc2ecf | 8708 | SvREFCNT_dec((SV*)ri->data->data[n]); |
c277df42 | 8709 | break; |
653099ff | 8710 | case 'f': |
f8fc2ecf | 8711 | Safefree(ri->data->data[n]); |
653099ff | 8712 | break; |
dfad63ad | 8713 | case 'p': |
f8fc2ecf | 8714 | new_comppad = (AV*)ri->data->data[n]; |
dfad63ad | 8715 | break; |
c277df42 | 8716 | case 'o': |
dfad63ad | 8717 | if (new_comppad == NULL) |
cea2e8a9 | 8718 | Perl_croak(aTHX_ "panic: pregfree comppad"); |
f3548bdc DM |
8719 | PAD_SAVE_LOCAL(old_comppad, |
8720 | /* Watch out for global destruction's random ordering. */ | |
c445ea15 | 8721 | (SvTYPE(new_comppad) == SVt_PVAV) ? new_comppad : NULL |
f3548bdc | 8722 | ); |
b34c0dd4 | 8723 | OP_REFCNT_LOCK; |
f8fc2ecf | 8724 | refcnt = OpREFCNT_dec((OP_4tree*)ri->data->data[n]); |
4026c95a SH |
8725 | OP_REFCNT_UNLOCK; |
8726 | if (!refcnt) | |
f8fc2ecf | 8727 | op_free((OP_4tree*)ri->data->data[n]); |
9b978d73 | 8728 | |
f3548bdc | 8729 | PAD_RESTORE_LOCAL(old_comppad); |
dfad63ad HS |
8730 | SvREFCNT_dec((SV*)new_comppad); |
8731 | new_comppad = NULL; | |
c277df42 IZ |
8732 | break; |
8733 | case 'n': | |
9e55ce06 | 8734 | break; |
07be1b83 | 8735 | case 'T': |
be8e71aa YO |
8736 | { /* Aho Corasick add-on structure for a trie node. |
8737 | Used in stclass optimization only */ | |
07be1b83 | 8738 | U32 refcount; |
f8fc2ecf | 8739 | reg_ac_data *aho=(reg_ac_data*)ri->data->data[n]; |
07be1b83 YO |
8740 | OP_REFCNT_LOCK; |
8741 | refcount = --aho->refcount; | |
8742 | OP_REFCNT_UNLOCK; | |
8743 | if ( !refcount ) { | |
446bd890 NC |
8744 | PerlMemShared_free(aho->states); |
8745 | PerlMemShared_free(aho->fail); | |
446bd890 NC |
8746 | /* do this last!!!! */ |
8747 | PerlMemShared_free(ri->data->data[n]); | |
8748 | PerlMemShared_free(ri->regstclass); | |
07be1b83 YO |
8749 | } |
8750 | } | |
8751 | break; | |
a3621e74 | 8752 | case 't': |
07be1b83 | 8753 | { |
be8e71aa | 8754 | /* trie structure. */ |
07be1b83 | 8755 | U32 refcount; |
f8fc2ecf | 8756 | reg_trie_data *trie=(reg_trie_data*)ri->data->data[n]; |
07be1b83 YO |
8757 | OP_REFCNT_LOCK; |
8758 | refcount = --trie->refcount; | |
8759 | OP_REFCNT_UNLOCK; | |
8760 | if ( !refcount ) { | |
446bd890 | 8761 | PerlMemShared_free(trie->charmap); |
446bd890 NC |
8762 | PerlMemShared_free(trie->states); |
8763 | PerlMemShared_free(trie->trans); | |
07be1b83 | 8764 | if (trie->bitmap) |
446bd890 | 8765 | PerlMemShared_free(trie->bitmap); |
07be1b83 | 8766 | if (trie->wordlen) |
446bd890 | 8767 | PerlMemShared_free(trie->wordlen); |
786e8c11 | 8768 | if (trie->jump) |
446bd890 | 8769 | PerlMemShared_free(trie->jump); |
786e8c11 | 8770 | if (trie->nextword) |
446bd890 | 8771 | PerlMemShared_free(trie->nextword); |
446bd890 NC |
8772 | /* do this last!!!! */ |
8773 | PerlMemShared_free(ri->data->data[n]); | |
a3621e74 | 8774 | } |
07be1b83 YO |
8775 | } |
8776 | break; | |
c277df42 | 8777 | default: |
f8fc2ecf | 8778 | Perl_croak(aTHX_ "panic: regfree data code '%c'", ri->data->what[n]); |
c277df42 IZ |
8779 | } |
8780 | } | |
f8fc2ecf YO |
8781 | Safefree(ri->data->what); |
8782 | Safefree(ri->data); | |
a0d0e21e | 8783 | } |
f8fc2ecf YO |
8784 | if (ri->swap) { |
8785 | Safefree(ri->swap->startp); | |
8786 | Safefree(ri->swap->endp); | |
8787 | Safefree(ri->swap); | |
c74340f9 | 8788 | } |
f8fc2ecf | 8789 | Safefree(ri); |
a687059c | 8790 | } |
c277df42 | 8791 | |
84da74a7 YO |
8792 | #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t)) |
8793 | #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t)) | |
81714fb9 | 8794 | #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t)) |
84da74a7 YO |
8795 | #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL) |
8796 | ||
8797 | /* | |
8798 | regdupe - duplicate a regexp. | |
8799 | ||
8800 | This routine is called by sv.c's re_dup and is expected to clone a | |
8801 | given regexp structure. It is a no-op when not under USE_ITHREADS. | |
8802 | (Originally this *was* re_dup() for change history see sv.c) | |
8803 | ||
f8149455 YO |
8804 | After all of the core data stored in struct regexp is duplicated |
8805 | the regexp_engine.dupe method is used to copy any private data | |
8806 | stored in the *pprivate pointer. This allows extensions to handle | |
8807 | any duplication it needs to do. | |
8808 | ||
8809 | See pregfree() and regfree_internal() if you change anything here. | |
84da74a7 | 8810 | */ |
a3c0e9ca | 8811 | #if defined(USE_ITHREADS) |
f8149455 | 8812 | #ifndef PERL_IN_XSUB_RE |
84da74a7 | 8813 | regexp * |
f8149455 | 8814 | Perl_re_dup(pTHX_ const regexp *r, CLONE_PARAMS *param) |
84da74a7 | 8815 | { |
84da74a7 | 8816 | dVAR; |
f8fc2ecf | 8817 | regexp *ret; |
f8149455 | 8818 | int i, npar; |
84da74a7 | 8819 | struct reg_substr_datum *s; |
644c02aa | 8820 | |
84da74a7 YO |
8821 | if (!r) |
8822 | return (REGEXP *)NULL; | |
8823 | ||
8824 | if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r))) | |
8825 | return ret; | |
8826 | ||
f8149455 | 8827 | |
84da74a7 | 8828 | npar = r->nparens+1; |
f8fc2ecf | 8829 | Newxz(ret, 1, regexp); |
84da74a7 YO |
8830 | Newx(ret->startp, npar, I32); |
8831 | Copy(r->startp, ret->startp, npar, I32); | |
8832 | Newx(ret->endp, npar, I32); | |
f8149455 | 8833 | Copy(r->endp, ret->endp, npar, I32); |
84da74a7 | 8834 | |
c945c181 | 8835 | if (r->substrs) { |
785a26d5 YO |
8836 | Newx(ret->substrs, 1, struct reg_substr_data); |
8837 | for (s = ret->substrs->data, i = 0; i < 3; i++, s++) { | |
8838 | s->min_offset = r->substrs->data[i].min_offset; | |
8839 | s->max_offset = r->substrs->data[i].max_offset; | |
8840 | s->end_shift = r->substrs->data[i].end_shift; | |
8841 | s->substr = sv_dup_inc(r->substrs->data[i].substr, param); | |
8842 | s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param); | |
8843 | } | |
8844 | } else | |
8845 | ret->substrs = NULL; | |
f8149455 | 8846 | |
bcdf7404 YO |
8847 | ret->wrapped = SAVEPVN(r->wrapped, r->wraplen); |
8848 | ret->precomp = ret->wrapped + (r->precomp - r->wrapped); | |
8849 | ret->prelen = r->prelen; | |
8850 | ret->wraplen = r->wraplen; | |
8851 | ||
f8149455 YO |
8852 | ret->refcnt = r->refcnt; |
8853 | ret->minlen = r->minlen; | |
8854 | ret->minlenret = r->minlenret; | |
f8149455 YO |
8855 | ret->nparens = r->nparens; |
8856 | ret->lastparen = r->lastparen; | |
8857 | ret->lastcloseparen = r->lastcloseparen; | |
8858 | ret->intflags = r->intflags; | |
8859 | ret->extflags = r->extflags; | |
8860 | ||
8861 | ret->sublen = r->sublen; | |
8862 | ||
8863 | ret->engine = r->engine; | |
8864 | ||
8865 | ret->paren_names = hv_dup_inc(r->paren_names, param); | |
8866 | ||
8867 | if (RX_MATCH_COPIED(ret)) | |
8868 | ret->subbeg = SAVEPVN(r->subbeg, r->sublen); | |
8869 | else | |
8870 | ret->subbeg = NULL; | |
8871 | #ifdef PERL_OLD_COPY_ON_WRITE | |
8872 | ret->saved_copy = NULL; | |
8873 | #endif | |
8874 | ||
8875 | ret->pprivate = r->pprivate; | |
785a26d5 YO |
8876 | if (ret->pprivate) |
8877 | RXi_SET(ret,CALLREGDUPE_PVT(ret,param)); | |
f8149455 YO |
8878 | |
8879 | ptr_table_store(PL_ptr_table, r, ret); | |
8880 | return ret; | |
8881 | } | |
8882 | #endif /* PERL_IN_XSUB_RE */ | |
8883 | ||
8884 | /* | |
8885 | regdupe_internal() | |
8886 | ||
8887 | This is the internal complement to regdupe() which is used to copy | |
8888 | the structure pointed to by the *pprivate pointer in the regexp. | |
8889 | This is the core version of the extension overridable cloning hook. | |
8890 | The regexp structure being duplicated will be copied by perl prior | |
8891 | to this and will be provided as the regexp *r argument, however | |
8892 | with the /old/ structures pprivate pointer value. Thus this routine | |
8893 | may override any copying normally done by perl. | |
8894 | ||
8895 | It returns a pointer to the new regexp_internal structure. | |
8896 | */ | |
8897 | ||
8898 | void * | |
8899 | Perl_regdupe_internal(pTHX_ const regexp *r, CLONE_PARAMS *param) | |
8900 | { | |
8901 | dVAR; | |
8902 | regexp_internal *reti; | |
8903 | int len, npar; | |
8904 | RXi_GET_DECL(r,ri); | |
8905 | ||
8906 | npar = r->nparens+1; | |
7122b237 | 8907 | len = ProgLen(ri); |
f8149455 YO |
8908 | |
8909 | Newxc(reti, sizeof(regexp_internal) + (len+1)*sizeof(regnode), char, regexp_internal); | |
8910 | Copy(ri->program, reti->program, len+1, regnode); | |
8911 | ||
8912 | if(ri->swap) { | |
8913 | Newx(reti->swap, 1, regexp_paren_ofs); | |
8914 | /* no need to copy these */ | |
8915 | Newx(reti->swap->startp, npar, I32); | |
8916 | Newx(reti->swap->endp, npar, I32); | |
8917 | } else { | |
8918 | reti->swap = NULL; | |
8919 | } | |
8920 | ||
f8fc2ecf | 8921 | reti->regstclass = NULL; |
bcdf7404 | 8922 | |
f8fc2ecf | 8923 | if (ri->data) { |
84da74a7 | 8924 | struct reg_data *d; |
f8fc2ecf | 8925 | const int count = ri->data->count; |
84da74a7 YO |
8926 | int i; |
8927 | ||
8928 | Newxc(d, sizeof(struct reg_data) + count*sizeof(void *), | |
8929 | char, struct reg_data); | |
8930 | Newx(d->what, count, U8); | |
8931 | ||
8932 | d->count = count; | |
8933 | for (i = 0; i < count; i++) { | |
f8fc2ecf | 8934 | d->what[i] = ri->data->what[i]; |
84da74a7 | 8935 | switch (d->what[i]) { |
55eed653 | 8936 | /* legal options are one of: sSfpontTu |
84da74a7 YO |
8937 | see also regcomp.h and pregfree() */ |
8938 | case 's': | |
81714fb9 | 8939 | case 'S': |
0536c0a7 | 8940 | case 'p': /* actually an AV, but the dup function is identical. */ |
55eed653 | 8941 | case 'u': /* actually an HV, but the dup function is identical. */ |
f8fc2ecf | 8942 | d->data[i] = sv_dup_inc((SV *)ri->data->data[i], param); |
84da74a7 | 8943 | break; |
84da74a7 YO |
8944 | case 'f': |
8945 | /* This is cheating. */ | |
8946 | Newx(d->data[i], 1, struct regnode_charclass_class); | |
f8fc2ecf | 8947 | StructCopy(ri->data->data[i], d->data[i], |
84da74a7 | 8948 | struct regnode_charclass_class); |
f8fc2ecf | 8949 | reti->regstclass = (regnode*)d->data[i]; |
84da74a7 YO |
8950 | break; |
8951 | case 'o': | |
bbe252da YO |
8952 | /* Compiled op trees are readonly and in shared memory, |
8953 | and can thus be shared without duplication. */ | |
84da74a7 | 8954 | OP_REFCNT_LOCK; |
f8fc2ecf | 8955 | d->data[i] = (void*)OpREFCNT_inc((OP*)ri->data->data[i]); |
84da74a7 YO |
8956 | OP_REFCNT_UNLOCK; |
8957 | break; | |
23eab42c NC |
8958 | case 'T': |
8959 | /* Trie stclasses are readonly and can thus be shared | |
8960 | * without duplication. We free the stclass in pregfree | |
8961 | * when the corresponding reg_ac_data struct is freed. | |
8962 | */ | |
8963 | reti->regstclass= ri->regstclass; | |
8964 | /* Fall through */ | |
84da74a7 | 8965 | case 't': |
84da74a7 | 8966 | OP_REFCNT_LOCK; |
0536c0a7 | 8967 | ((reg_trie_data*)ri->data->data[i])->refcount++; |
84da74a7 | 8968 | OP_REFCNT_UNLOCK; |
0536c0a7 NC |
8969 | /* Fall through */ |
8970 | case 'n': | |
8971 | d->data[i] = ri->data->data[i]; | |
84da74a7 | 8972 | break; |
84da74a7 | 8973 | default: |
f8fc2ecf | 8974 | Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", ri->data->what[i]); |
84da74a7 YO |
8975 | } |
8976 | } | |
8977 | ||
f8fc2ecf | 8978 | reti->data = d; |
84da74a7 YO |
8979 | } |
8980 | else | |
f8fc2ecf | 8981 | reti->data = NULL; |
84da74a7 | 8982 | |
cde0cee5 YO |
8983 | reti->name_list_idx = ri->name_list_idx; |
8984 | ||
7122b237 YO |
8985 | #ifdef RE_TRACK_PATTERN_OFFSETS |
8986 | if (ri->u.offsets) { | |
8987 | Newx(reti->u.offsets, 2*len+1, U32); | |
8988 | Copy(ri->u.offsets, reti->u.offsets, 2*len+1, U32); | |
8989 | } | |
8990 | #else | |
8991 | SetProgLen(reti,len); | |
8992 | #endif | |
8993 | ||
f8149455 | 8994 | return (void*)reti; |
84da74a7 | 8995 | } |
f8149455 YO |
8996 | |
8997 | #endif /* USE_ITHREADS */ | |
84da74a7 | 8998 | |
de8c5301 YO |
8999 | /* |
9000 | reg_stringify() | |
9001 | ||
9002 | converts a regexp embedded in a MAGIC struct to its stringified form, | |
9003 | caching the converted form in the struct and returns the cached | |
9004 | string. | |
9005 | ||
9006 | If lp is nonnull then it is used to return the length of the | |
9007 | resulting string | |
9008 | ||
9009 | If flags is nonnull and the returned string contains UTF8 then | |
f8149455 | 9010 | (*flags & 1) will be true. |
de8c5301 YO |
9011 | |
9012 | If haseval is nonnull then it is used to return whether the pattern | |
9013 | contains evals. | |
9014 | ||
9015 | Normally called via macro: | |
9016 | ||
f8149455 | 9017 | CALLREG_STRINGIFY(mg,&len,&utf8); |
de8c5301 YO |
9018 | |
9019 | And internally with | |
9020 | ||
f8149455 | 9021 | CALLREG_AS_STR(mg,&lp,&flags,&haseval) |
de8c5301 YO |
9022 | |
9023 | See sv_2pv_flags() in sv.c for an example of internal usage. | |
9024 | ||
9025 | */ | |
f8149455 | 9026 | #ifndef PERL_IN_XSUB_RE |
bcdf7404 | 9027 | |
de8c5301 YO |
9028 | char * |
9029 | Perl_reg_stringify(pTHX_ MAGIC *mg, STRLEN *lp, U32 *flags, I32 *haseval ) { | |
9030 | dVAR; | |
9031 | const regexp * const re = (regexp *)mg->mg_obj; | |
de8c5301 | 9032 | if (haseval) |
f8149455 | 9033 | *haseval = re->seen_evals; |
de8c5301 | 9034 | if (flags) |
bbe252da | 9035 | *flags = ((re->extflags & RXf_UTF8) ? 1 : 0); |
de8c5301 | 9036 | if (lp) |
bcdf7404 YO |
9037 | *lp = re->wraplen; |
9038 | return re->wrapped; | |
de8c5301 YO |
9039 | } |
9040 | ||
c277df42 IZ |
9041 | /* |
9042 | - regnext - dig the "next" pointer out of a node | |
c277df42 IZ |
9043 | */ |
9044 | regnode * | |
864dbfa3 | 9045 | Perl_regnext(pTHX_ register regnode *p) |
c277df42 | 9046 | { |
97aff369 | 9047 | dVAR; |
c277df42 IZ |
9048 | register I32 offset; |
9049 | ||
f8fc2ecf | 9050 | if (!p) |
c277df42 IZ |
9051 | return(NULL); |
9052 | ||
9053 | offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p)); | |
9054 | if (offset == 0) | |
9055 | return(NULL); | |
9056 | ||
c277df42 | 9057 | return(p+offset); |
c277df42 | 9058 | } |
76234dfb | 9059 | #endif |
c277df42 | 9060 | |
01f988be | 9061 | STATIC void |
cea2e8a9 | 9062 | S_re_croak2(pTHX_ const char* pat1,const char* pat2,...) |
c277df42 IZ |
9063 | { |
9064 | va_list args; | |
9065 | STRLEN l1 = strlen(pat1); | |
9066 | STRLEN l2 = strlen(pat2); | |
9067 | char buf[512]; | |
06bf62c7 | 9068 | SV *msv; |
73d840c0 | 9069 | const char *message; |
c277df42 IZ |
9070 | |
9071 | if (l1 > 510) | |
9072 | l1 = 510; | |
9073 | if (l1 + l2 > 510) | |
9074 | l2 = 510 - l1; | |
9075 | Copy(pat1, buf, l1 , char); | |
9076 | Copy(pat2, buf + l1, l2 , char); | |
3b818b81 GS |
9077 | buf[l1 + l2] = '\n'; |
9078 | buf[l1 + l2 + 1] = '\0'; | |
8736538c AS |
9079 | #ifdef I_STDARG |
9080 | /* ANSI variant takes additional second argument */ | |
c277df42 | 9081 | va_start(args, pat2); |
8736538c AS |
9082 | #else |
9083 | va_start(args); | |
9084 | #endif | |
5a844595 | 9085 | msv = vmess(buf, &args); |
c277df42 | 9086 | va_end(args); |
cfd0369c | 9087 | message = SvPV_const(msv,l1); |
c277df42 IZ |
9088 | if (l1 > 512) |
9089 | l1 = 512; | |
9090 | Copy(message, buf, l1 , char); | |
197cf9b9 | 9091 | buf[l1-1] = '\0'; /* Overwrite \n */ |
cea2e8a9 | 9092 | Perl_croak(aTHX_ "%s", buf); |
c277df42 | 9093 | } |
a0ed51b3 LW |
9094 | |
9095 | /* XXX Here's a total kludge. But we need to re-enter for swash routines. */ | |
9096 | ||
76234dfb | 9097 | #ifndef PERL_IN_XSUB_RE |
a0ed51b3 | 9098 | void |
864dbfa3 | 9099 | Perl_save_re_context(pTHX) |
b81d288d | 9100 | { |
97aff369 | 9101 | dVAR; |
1ade1aa1 NC |
9102 | |
9103 | struct re_save_state *state; | |
9104 | ||
9105 | SAVEVPTR(PL_curcop); | |
9106 | SSGROW(SAVESTACK_ALLOC_FOR_RE_SAVE_STATE + 1); | |
9107 | ||
9108 | state = (struct re_save_state *)(PL_savestack + PL_savestack_ix); | |
9109 | PL_savestack_ix += SAVESTACK_ALLOC_FOR_RE_SAVE_STATE; | |
9110 | SSPUSHINT(SAVEt_RE_STATE); | |
9111 | ||
46ab3289 | 9112 | Copy(&PL_reg_state, state, 1, struct re_save_state); |
1ade1aa1 | 9113 | |
a0ed51b3 | 9114 | PL_reg_start_tmp = 0; |
a0ed51b3 | 9115 | PL_reg_start_tmpl = 0; |
c445ea15 | 9116 | PL_reg_oldsaved = NULL; |
a5db57d6 | 9117 | PL_reg_oldsavedlen = 0; |
a5db57d6 | 9118 | PL_reg_maxiter = 0; |
a5db57d6 | 9119 | PL_reg_leftiter = 0; |
c445ea15 | 9120 | PL_reg_poscache = NULL; |
a5db57d6 | 9121 | PL_reg_poscache_size = 0; |
1ade1aa1 NC |
9122 | #ifdef PERL_OLD_COPY_ON_WRITE |
9123 | PL_nrs = NULL; | |
9124 | #endif | |
ada6e8a9 | 9125 | |
c445ea15 AL |
9126 | /* Save $1..$n (#18107: UTF-8 s/(\w+)/uc($1)/e); AMS 20021106. */ |
9127 | if (PL_curpm) { | |
9128 | const REGEXP * const rx = PM_GETRE(PL_curpm); | |
9129 | if (rx) { | |
1df70142 | 9130 | U32 i; |
ada6e8a9 | 9131 | for (i = 1; i <= rx->nparens; i++) { |
1df70142 | 9132 | char digits[TYPE_CHARS(long)]; |
d9fad198 | 9133 | const STRLEN len = my_snprintf(digits, sizeof(digits), "%lu", (long)i); |
49f27e4b NC |
9134 | GV *const *const gvp |
9135 | = (GV**)hv_fetch(PL_defstash, digits, len, 0); | |
9136 | ||
b37c2d43 AL |
9137 | if (gvp) { |
9138 | GV * const gv = *gvp; | |
9139 | if (SvTYPE(gv) == SVt_PVGV && GvSV(gv)) | |
9140 | save_scalar(gv); | |
49f27e4b | 9141 | } |
ada6e8a9 AMS |
9142 | } |
9143 | } | |
9144 | } | |
a0ed51b3 | 9145 | } |
76234dfb | 9146 | #endif |
51371543 | 9147 | |
51371543 | 9148 | static void |
acfe0abc | 9149 | clear_re(pTHX_ void *r) |
51371543 | 9150 | { |
97aff369 | 9151 | dVAR; |
51371543 GS |
9152 | ReREFCNT_dec((regexp *)r); |
9153 | } | |
ffbc6a93 | 9154 | |
a28509cc AL |
9155 | #ifdef DEBUGGING |
9156 | ||
9157 | STATIC void | |
9158 | S_put_byte(pTHX_ SV *sv, int c) | |
9159 | { | |
9160 | if (isCNTRL(c) || c == 255 || !isPRINT(c)) | |
9161 | Perl_sv_catpvf(aTHX_ sv, "\\%o", c); | |
9162 | else if (c == '-' || c == ']' || c == '\\' || c == '^') | |
9163 | Perl_sv_catpvf(aTHX_ sv, "\\%c", c); | |
9164 | else | |
9165 | Perl_sv_catpvf(aTHX_ sv, "%c", c); | |
9166 | } | |
9167 | ||
786e8c11 | 9168 | |
3dab1dad YO |
9169 | #define CLEAR_OPTSTART \ |
9170 | if (optstart) STMT_START { \ | |
70685ca0 | 9171 | DEBUG_OPTIMISE_r(PerlIO_printf(Perl_debug_log, " (%"IVdf" nodes)\n", (IV)(node - optstart))); \ |
3dab1dad YO |
9172 | optstart=NULL; \ |
9173 | } STMT_END | |
9174 | ||
786e8c11 | 9175 | #define DUMPUNTIL(b,e) CLEAR_OPTSTART; node=dumpuntil(r,start,(b),(e),last,sv,indent+1,depth+1); |
3dab1dad | 9176 | |
b5a2f8d8 NC |
9177 | STATIC const regnode * |
9178 | S_dumpuntil(pTHX_ const regexp *r, const regnode *start, const regnode *node, | |
786e8c11 YO |
9179 | const regnode *last, const regnode *plast, |
9180 | SV* sv, I32 indent, U32 depth) | |
a28509cc | 9181 | { |
97aff369 | 9182 | dVAR; |
786e8c11 | 9183 | register U8 op = PSEUDO; /* Arbitrary non-END op. */ |
b5a2f8d8 | 9184 | register const regnode *next; |
3dab1dad | 9185 | const regnode *optstart= NULL; |
1f1031fe | 9186 | |
f8fc2ecf | 9187 | RXi_GET_DECL(r,ri); |
3dab1dad | 9188 | GET_RE_DEBUG_FLAGS_DECL; |
1f1031fe | 9189 | |
786e8c11 YO |
9190 | #ifdef DEBUG_DUMPUNTIL |
9191 | PerlIO_printf(Perl_debug_log, "--- %d : %d - %d - %d\n",indent,node-start, | |
9192 | last ? last-start : 0,plast ? plast-start : 0); | |
9193 | #endif | |
9194 | ||
9195 | if (plast && plast < last) | |
9196 | last= plast; | |
9197 | ||
9198 | while (PL_regkind[op] != END && (!last || node < last)) { | |
a28509cc | 9199 | /* While that wasn't END last time... */ |
a28509cc AL |
9200 | NODE_ALIGN(node); |
9201 | op = OP(node); | |
de734bd5 | 9202 | if (op == CLOSE || op == WHILEM) |
786e8c11 | 9203 | indent--; |
b5a2f8d8 | 9204 | next = regnext((regnode *)node); |
1f1031fe | 9205 | |
a28509cc | 9206 | /* Where, what. */ |
8e11feef | 9207 | if (OP(node) == OPTIMIZED) { |
e68ec53f | 9208 | if (!optstart && RE_DEBUG_FLAG(RE_DEBUG_COMPILE_OPTIMISE)) |
8e11feef | 9209 | optstart = node; |
3dab1dad | 9210 | else |
8e11feef | 9211 | goto after_print; |
3dab1dad YO |
9212 | } else |
9213 | CLEAR_OPTSTART; | |
1f1031fe | 9214 | |
32fc9b6a | 9215 | regprop(r, sv, node); |
a28509cc | 9216 | PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start), |
786e8c11 | 9217 | (int)(2*indent + 1), "", SvPVX_const(sv)); |
1f1031fe YO |
9218 | |
9219 | if (OP(node) != OPTIMIZED) { | |
9220 | if (next == NULL) /* Next ptr. */ | |
9221 | PerlIO_printf(Perl_debug_log, " (0)"); | |
9222 | else if (PL_regkind[(U8)op] == BRANCH && PL_regkind[OP(next)] != BRANCH ) | |
9223 | PerlIO_printf(Perl_debug_log, " (FAIL)"); | |
9224 | else | |
9225 | PerlIO_printf(Perl_debug_log, " (%"IVdf")", (IV)(next - start)); | |
9226 | (void)PerlIO_putc(Perl_debug_log, '\n'); | |
9227 | } | |
9228 | ||
a28509cc AL |
9229 | after_print: |
9230 | if (PL_regkind[(U8)op] == BRANCHJ) { | |
be8e71aa YO |
9231 | assert(next); |
9232 | { | |
9233 | register const regnode *nnode = (OP(next) == LONGJMP | |
b5a2f8d8 NC |
9234 | ? regnext((regnode *)next) |
9235 | : next); | |
be8e71aa YO |
9236 | if (last && nnode > last) |
9237 | nnode = last; | |
786e8c11 | 9238 | DUMPUNTIL(NEXTOPER(NEXTOPER(node)), nnode); |
be8e71aa | 9239 | } |
a28509cc AL |
9240 | } |
9241 | else if (PL_regkind[(U8)op] == BRANCH) { | |
be8e71aa | 9242 | assert(next); |
786e8c11 | 9243 | DUMPUNTIL(NEXTOPER(node), next); |
a28509cc AL |
9244 | } |
9245 | else if ( PL_regkind[(U8)op] == TRIE ) { | |
7f69552c | 9246 | const regnode *this_trie = node; |
1de06328 | 9247 | const char op = OP(node); |
647f639f | 9248 | const U32 n = ARG(node); |
1de06328 | 9249 | const reg_ac_data * const ac = op>=AHOCORASICK ? |
f8fc2ecf | 9250 | (reg_ac_data *)ri->data->data[n] : |
1de06328 | 9251 | NULL; |
3251b653 NC |
9252 | const reg_trie_data * const trie = |
9253 | (reg_trie_data*)ri->data->data[op<AHOCORASICK ? n : ac->trie]; | |
2b8b4781 NC |
9254 | #ifdef DEBUGGING |
9255 | AV *const trie_words = (AV *) ri->data->data[n + TRIE_WORDS_OFFSET]; | |
9256 | #endif | |
786e8c11 | 9257 | const regnode *nextbranch= NULL; |
a28509cc | 9258 | I32 word_idx; |
1de06328 | 9259 | sv_setpvn(sv, "", 0); |
786e8c11 | 9260 | for (word_idx= 0; word_idx < (I32)trie->wordcount; word_idx++) { |
2b8b4781 | 9261 | SV ** const elem_ptr = av_fetch(trie_words,word_idx,0); |
786e8c11 YO |
9262 | |
9263 | PerlIO_printf(Perl_debug_log, "%*s%s ", | |
9264 | (int)(2*(indent+3)), "", | |
9265 | elem_ptr ? pv_pretty(sv, SvPV_nolen_const(*elem_ptr), SvCUR(*elem_ptr), 60, | |
ab3bbdeb YO |
9266 | PL_colors[0], PL_colors[1], |
9267 | (SvUTF8(*elem_ptr) ? PERL_PV_ESCAPE_UNI : 0) | | |
9268 | PERL_PV_PRETTY_ELIPSES | | |
7f69552c | 9269 | PERL_PV_PRETTY_LTGT |
786e8c11 YO |
9270 | ) |
9271 | : "???" | |
9272 | ); | |
9273 | if (trie->jump) { | |
40d049e4 | 9274 | U16 dist= trie->jump[word_idx+1]; |
70685ca0 JH |
9275 | PerlIO_printf(Perl_debug_log, "(%"UVuf")\n", |
9276 | (UV)((dist ? this_trie + dist : next) - start)); | |
786e8c11 YO |
9277 | if (dist) { |
9278 | if (!nextbranch) | |
24b23f37 | 9279 | nextbranch= this_trie + trie->jump[0]; |
7f69552c YO |
9280 | DUMPUNTIL(this_trie + dist, nextbranch); |
9281 | } | |
786e8c11 YO |
9282 | if (nextbranch && PL_regkind[OP(nextbranch)]==BRANCH) |
9283 | nextbranch= regnext((regnode *)nextbranch); | |
9284 | } else { | |
9285 | PerlIO_printf(Perl_debug_log, "\n"); | |
a28509cc | 9286 | } |
786e8c11 YO |
9287 | } |
9288 | if (last && next > last) | |
9289 | node= last; | |
9290 | else | |
9291 | node= next; | |
a28509cc | 9292 | } |
786e8c11 YO |
9293 | else if ( op == CURLY ) { /* "next" might be very big: optimizer */ |
9294 | DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, | |
9295 | NEXTOPER(node) + EXTRA_STEP_2ARGS + 1); | |
a28509cc AL |
9296 | } |
9297 | else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) { | |
be8e71aa | 9298 | assert(next); |
786e8c11 | 9299 | DUMPUNTIL(NEXTOPER(node) + EXTRA_STEP_2ARGS, next); |
a28509cc AL |
9300 | } |
9301 | else if ( op == PLUS || op == STAR) { | |
786e8c11 | 9302 | DUMPUNTIL(NEXTOPER(node), NEXTOPER(node) + 1); |
a28509cc AL |
9303 | } |
9304 | else if (op == ANYOF) { | |
9305 | /* arglen 1 + class block */ | |
9306 | node += 1 + ((ANYOF_FLAGS(node) & ANYOF_LARGE) | |
9307 | ? ANYOF_CLASS_SKIP : ANYOF_SKIP); | |
9308 | node = NEXTOPER(node); | |
9309 | } | |
9310 | else if (PL_regkind[(U8)op] == EXACT) { | |
9311 | /* Literal string, where present. */ | |
9312 | node += NODE_SZ_STR(node) - 1; | |
9313 | node = NEXTOPER(node); | |
9314 | } | |
9315 | else { | |
9316 | node = NEXTOPER(node); | |
9317 | node += regarglen[(U8)op]; | |
9318 | } | |
9319 | if (op == CURLYX || op == OPEN) | |
786e8c11 | 9320 | indent++; |
a28509cc | 9321 | } |
3dab1dad | 9322 | CLEAR_OPTSTART; |
786e8c11 | 9323 | #ifdef DEBUG_DUMPUNTIL |
70685ca0 | 9324 | PerlIO_printf(Perl_debug_log, "--- %d\n", (int)indent); |
786e8c11 | 9325 | #endif |
1de06328 | 9326 | return node; |
a28509cc AL |
9327 | } |
9328 | ||
9329 | #endif /* DEBUGGING */ | |
9330 | ||
241d1a3b NC |
9331 | /* |
9332 | * Local variables: | |
9333 | * c-indentation-style: bsd | |
9334 | * c-basic-offset: 4 | |
9335 | * indent-tabs-mode: t | |
9336 | * End: | |
9337 | * | |
37442d52 RGS |
9338 | * ex: set ts=8 sts=4 sw=4 noet: |
9339 | */ |