Commit | Line | Data |
---|---|---|
a0d0e21e LW |
1 | /* regcomp.c |
2 | */ | |
3 | ||
4 | /* | |
5 | * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee | |
6 | */ | |
7 | ||
a687059c LW |
8 | /* NOTE: this is derived from Henry Spencer's regexp code, and should not |
9 | * confused with the original package (see point 3 below). Thanks, Henry! | |
10 | */ | |
11 | ||
12 | /* Additional note: this code is very heavily munged from Henry's version | |
13 | * in places. In some spots I've traded clarity for efficiency, so don't | |
14 | * blame Henry for some of the lack of readability. | |
15 | */ | |
16 | ||
e50aee73 AD |
17 | /* The names of the functions have been changed from regcomp and |
18 | * regexec to pregcomp and pregexec in order to avoid conflicts | |
19 | * with the POSIX routines of the same names. | |
20 | */ | |
21 | ||
b9d5759e AD |
22 | #ifdef PERL_EXT_RE_BUILD |
23 | /* need to replace pregcomp et al, so enable that */ | |
24 | # ifndef PERL_IN_XSUB_RE | |
25 | # define PERL_IN_XSUB_RE | |
26 | # endif | |
27 | /* need access to debugger hooks */ | |
cad2e5aa | 28 | # if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING) |
b9d5759e AD |
29 | # define DEBUGGING |
30 | # endif | |
31 | #endif | |
32 | ||
33 | #ifdef PERL_IN_XSUB_RE | |
d06ea78c | 34 | /* We *really* need to overwrite these symbols: */ |
56953603 IZ |
35 | # define Perl_pregcomp my_regcomp |
36 | # define Perl_regdump my_regdump | |
37 | # define Perl_regprop my_regprop | |
d06ea78c | 38 | # define Perl_pregfree my_regfree |
cad2e5aa JH |
39 | # define Perl_re_intuit_string my_re_intuit_string |
40 | /* *These* symbols are masked to allow static link. */ | |
d06ea78c | 41 | # define Perl_regnext my_regnext |
f0b8d043 | 42 | # define Perl_save_re_context my_save_re_context |
d88dccdf | 43 | # define Perl_reginitcolors my_reginitcolors |
c5be433b GS |
44 | |
45 | # define PERL_NO_GET_CONTEXT | |
56953603 IZ |
46 | #endif |
47 | ||
f0fcb552 | 48 | /*SUPPRESS 112*/ |
a687059c | 49 | /* |
e50aee73 | 50 | * pregcomp and pregexec -- regsub and regerror are not used in perl |
a687059c LW |
51 | * |
52 | * Copyright (c) 1986 by University of Toronto. | |
53 | * Written by Henry Spencer. Not derived from licensed software. | |
54 | * | |
55 | * Permission is granted to anyone to use this software for any | |
56 | * purpose on any computer system, and to redistribute it freely, | |
57 | * subject to the following restrictions: | |
58 | * | |
59 | * 1. The author is not responsible for the consequences of use of | |
60 | * this software, no matter how awful, even if they arise | |
61 | * from defects in it. | |
62 | * | |
63 | * 2. The origin of this software must not be misrepresented, either | |
64 | * by explicit claim or by omission. | |
65 | * | |
66 | * 3. Altered versions must be plainly marked as such, and must not | |
67 | * be misrepresented as being the original software. | |
68 | * | |
69 | * | |
70 | **** Alterations to Henry's code are... | |
71 | **** | |
3818b22b | 72 | **** Copyright (c) 1991-2000, Larry Wall |
a687059c | 73 | **** |
9ef589d8 LW |
74 | **** You may distribute under the terms of either the GNU General Public |
75 | **** License or the Artistic License, as specified in the README file. | |
76 | ||
a687059c LW |
77 | * |
78 | * Beware that some of this code is subtly aware of the way operator | |
79 | * precedence is structured in regular expressions. Serious changes in | |
80 | * regular-expression syntax might require a total rethink. | |
81 | */ | |
82 | #include "EXTERN.h" | |
864dbfa3 | 83 | #define PERL_IN_REGCOMP_C |
a687059c | 84 | #include "perl.h" |
d06ea78c | 85 | |
c5be433b GS |
86 | #ifdef PERL_IN_XSUB_RE |
87 | # if defined(PERL_CAPI) || defined(PERL_OBJECT) | |
88 | # include "XSUB.h" | |
89 | # endif | |
90 | #else | |
d06ea78c GS |
91 | # include "INTERN.h" |
92 | #endif | |
c277df42 IZ |
93 | |
94 | #define REG_COMP_C | |
a687059c LW |
95 | #include "regcomp.h" |
96 | ||
d4cce5f1 | 97 | #ifdef op |
11343788 | 98 | #undef op |
d4cce5f1 | 99 | #endif /* op */ |
11343788 | 100 | |
fe14fcc3 LW |
101 | #ifdef MSDOS |
102 | # if defined(BUGGY_MSC6) | |
103 | /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */ | |
104 | # pragma optimize("a",off) | |
105 | /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/ | |
106 | # pragma optimize("w",on ) | |
107 | # endif /* BUGGY_MSC6 */ | |
108 | #endif /* MSDOS */ | |
109 | ||
a687059c LW |
110 | #ifndef STATIC |
111 | #define STATIC static | |
112 | #endif | |
113 | ||
114 | #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?') | |
115 | #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \ | |
116 | ((*s) == '{' && regcurly(s))) | |
2b69d0c2 LW |
117 | #ifdef atarist |
118 | #define PERL_META "^$.[()|?+*\\" | |
119 | #else | |
a687059c | 120 | #define META "^$.[()|?+*\\" |
2b69d0c2 | 121 | #endif |
a687059c | 122 | |
35c8bce7 LW |
123 | #ifdef SPSTART |
124 | #undef SPSTART /* dratted cpp namespace... */ | |
125 | #endif | |
a687059c LW |
126 | /* |
127 | * Flags to be passed up and down. | |
128 | */ | |
a687059c | 129 | #define WORST 0 /* Worst case. */ |
821b33a5 | 130 | #define HASWIDTH 0x1 /* Known to match non-null strings. */ |
a0d0e21e LW |
131 | #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */ |
132 | #define SPSTART 0x4 /* Starts with * or +. */ | |
133 | #define TRYAGAIN 0x8 /* Weeded out a declaration. */ | |
a687059c | 134 | |
2c2d71f5 JH |
135 | /* Length of a variant. */ |
136 | ||
137 | typedef struct scan_data_t { | |
138 | I32 len_min; | |
139 | I32 len_delta; | |
140 | I32 pos_min; | |
141 | I32 pos_delta; | |
142 | SV *last_found; | |
143 | I32 last_end; /* min value, <0 unless valid. */ | |
144 | I32 last_start_min; | |
145 | I32 last_start_max; | |
146 | SV **longest; /* Either &l_fixed, or &l_float. */ | |
147 | SV *longest_fixed; | |
148 | I32 offset_fixed; | |
149 | SV *longest_float; | |
150 | I32 offset_float_min; | |
151 | I32 offset_float_max; | |
152 | I32 flags; | |
153 | I32 whilem_c; | |
653099ff | 154 | struct regnode_charclass_class *start_class; |
2c2d71f5 JH |
155 | } scan_data_t; |
156 | ||
a687059c | 157 | /* |
e50aee73 | 158 | * Forward declarations for pregcomp()'s friends. |
a687059c | 159 | */ |
a0d0e21e | 160 | |
cd488c12 | 161 | static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
653099ff | 162 | 0, 0, 0, 0, 0 }; |
c277df42 IZ |
163 | |
164 | #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL) | |
165 | #define SF_BEFORE_SEOL 0x1 | |
166 | #define SF_BEFORE_MEOL 0x2 | |
167 | #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL) | |
168 | #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL) | |
169 | ||
09b7f37c CB |
170 | #ifdef NO_UNARY_PLUS |
171 | # define SF_FIX_SHIFT_EOL (0+2) | |
172 | # define SF_FL_SHIFT_EOL (0+4) | |
173 | #else | |
174 | # define SF_FIX_SHIFT_EOL (+2) | |
175 | # define SF_FL_SHIFT_EOL (+4) | |
176 | #endif | |
c277df42 IZ |
177 | |
178 | #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL) | |
179 | #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL) | |
180 | ||
181 | #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL) | |
182 | #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */ | |
183 | #define SF_IS_INF 0x40 | |
184 | #define SF_HAS_PAR 0x80 | |
185 | #define SF_IN_PAR 0x100 | |
186 | #define SF_HAS_EVAL 0x200 | |
4bfe0158 | 187 | #define SCF_DO_SUBSTR 0x400 |
653099ff GS |
188 | #define SCF_DO_STCLASS_AND 0x0800 |
189 | #define SCF_DO_STCLASS_OR 0x1000 | |
190 | #define SCF_DO_STCLASS (SCF_DO_STCLASS_AND|SCF_DO_STCLASS_OR) | |
c277df42 | 191 | |
a0ed51b3 LW |
192 | #define RF_utf8 8 |
193 | #define UTF (PL_reg_flags & RF_utf8) | |
194 | #define LOC (PL_regflags & PMf_LOCALE) | |
195 | #define FOLD (PL_regflags & PMf_FOLD) | |
196 | ||
b8c5462f JH |
197 | #define OOB_CHAR8 1234 |
198 | #define OOB_UTF8 123456 | |
93733859 | 199 | #define OOB_NAMEDCLASS -1 |
b8c5462f | 200 | |
a0ed51b3 LW |
201 | #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv)) |
202 | #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b) | |
203 | ||
8615cb43 | 204 | |
b45f050a JF |
205 | /* length of regex to show in messages that don't mark a position within */ |
206 | #define RegexLengthToShowInErrorMessages 127 | |
207 | ||
208 | /* | |
209 | * If MARKER[12] are adjusted, be sure to adjust the constants at the top | |
210 | * of t/op/regmesg.t, the tests in t/op/re_tests, and those in | |
211 | * op/pragma/warn/regcomp. | |
212 | */ | |
79eeca27 JH |
213 | #define MARKER1 "HERE" /* marker as it appears in the description */ |
214 | #define MARKER2 " << HERE " /* marker as it appears within the regex */ | |
b45f050a | 215 | |
79eeca27 | 216 | #define REPORT_LOCATION " before " MARKER1 " mark in regex m/%.*s" MARKER2 "%s/" |
b45f050a JF |
217 | |
218 | /* | |
219 | * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given | |
220 | * arg. Show regex, up to a maximum length. If it's too long, chop and add | |
221 | * "...". | |
222 | */ | |
223 | #define FAIL(m) \ | |
8615cb43 | 224 | STMT_START { \ |
b45f050a JF |
225 | char *elipises = ""; \ |
226 | unsigned len = strlen(PL_regprecomp); \ | |
227 | \ | |
8615cb43 JF |
228 | if (!SIZE_ONLY) \ |
229 | SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \ | |
b45f050a JF |
230 | \ |
231 | if (len > RegexLengthToShowInErrorMessages) { \ | |
232 | /* chop 10 shorter than the max, to ensure meaning of "..." */ \ | |
233 | len = RegexLengthToShowInErrorMessages - 10; \ | |
234 | elipises = "..."; \ | |
235 | } \ | |
236 | Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \ | |
237 | m, len, PL_regprecomp, elipises); \ | |
8615cb43 JF |
238 | } STMT_END |
239 | ||
b45f050a JF |
240 | /* |
241 | * Calls SAVEDESTRUCTOR_X if needed, then calls Perl_croak with the given | |
242 | * args. Show regex, up to a maximum length. If it's too long, chop and add | |
243 | * "...". | |
244 | */ | |
245 | #define FAIL2(pat,m) \ | |
8615cb43 | 246 | STMT_START { \ |
b45f050a JF |
247 | char *elipises = ""; \ |
248 | unsigned len = strlen(PL_regprecomp); \ | |
249 | \ | |
8615cb43 JF |
250 | if (!SIZE_ONLY) \ |
251 | SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \ | |
252 | \ | |
b45f050a JF |
253 | if (len > RegexLengthToShowInErrorMessages) { \ |
254 | /* chop 10 shorter than the max, to ensure meaning of "..." */ \ | |
255 | len = RegexLengthToShowInErrorMessages - 10; \ | |
256 | elipises = "..."; \ | |
257 | } \ | |
258 | S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \ | |
259 | m, len, PL_regprecomp, elipises); \ | |
260 | } STMT_END | |
261 | ||
262 | ||
263 | /* | |
264 | * Simple_vFAIL -- like FAIL, but marks the current location in the scan | |
265 | */ | |
266 | #define Simple_vFAIL(m) \ | |
267 | STMT_START { \ | |
268 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \ | |
269 | \ | |
270 | Perl_croak(aTHX_ "%s" REPORT_LOCATION, \ | |
271 | m, offset, PL_regprecomp, PL_regprecomp + offset); \ | |
272 | } STMT_END | |
273 | ||
274 | /* | |
275 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL() | |
276 | */ | |
277 | #define vFAIL(m) \ | |
278 | STMT_START { \ | |
279 | if (!SIZE_ONLY) \ | |
280 | SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \ | |
281 | Simple_vFAIL(m); \ | |
282 | } STMT_END | |
283 | ||
284 | /* | |
285 | * Like Simple_vFAIL(), but accepts two arguments. | |
286 | */ | |
287 | #define Simple_vFAIL2(m,a1) \ | |
288 | STMT_START { \ | |
289 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \ | |
290 | \ | |
291 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, \ | |
292 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
293 | } STMT_END | |
294 | ||
295 | /* | |
296 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL2(). | |
297 | */ | |
298 | #define vFAIL2(m,a1) \ | |
299 | STMT_START { \ | |
300 | if (!SIZE_ONLY) \ | |
301 | SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \ | |
302 | Simple_vFAIL2(m, a1); \ | |
303 | } STMT_END | |
304 | ||
305 | ||
306 | /* | |
307 | * Like Simple_vFAIL(), but accepts three arguments. | |
308 | */ | |
309 | #define Simple_vFAIL3(m, a1, a2) \ | |
310 | STMT_START { \ | |
311 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \ | |
312 | \ | |
313 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, \ | |
314 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
315 | } STMT_END | |
316 | ||
317 | /* | |
318 | * Calls SAVEDESTRUCTOR_X if needed, then Simple_vFAIL3(). | |
319 | */ | |
320 | #define vFAIL3(m,a1,a2) \ | |
321 | STMT_START { \ | |
322 | if (!SIZE_ONLY) \ | |
323 | SAVEDESTRUCTOR_X(clear_re,(void*)PL_regcomp_rx); \ | |
324 | Simple_vFAIL3(m, a1, a2); \ | |
325 | } STMT_END | |
326 | ||
327 | /* | |
328 | * Like Simple_vFAIL(), but accepts four arguments. | |
329 | */ | |
330 | #define Simple_vFAIL4(m, a1, a2, a3) \ | |
331 | STMT_START { \ | |
332 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \ | |
333 | \ | |
334 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3,\ | |
335 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
336 | } STMT_END | |
337 | ||
338 | /* | |
339 | * Like Simple_vFAIL(), but accepts five arguments. | |
340 | */ | |
341 | #define Simple_vFAIL5(m, a1, a2, a3, a4) \ | |
342 | STMT_START { \ | |
343 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-PL_regcomp_parse); \ | |
344 | S_re_croak2(aTHX_ m, REPORT_LOCATION, a1, a2, a3, a4,\ | |
345 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
346 | } STMT_END | |
347 | ||
348 | ||
349 | #define vWARN(loc,m) \ | |
350 | STMT_START { \ | |
351 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \ | |
352 | Perl_warner(aTHX_ WARN_REGEXP, "%s" REPORT_LOCATION,\ | |
353 | m, offset, PL_regprecomp, PL_regprecomp + offset); \ | |
354 | } STMT_END \ | |
355 | ||
356 | ||
357 | #define vWARN2(loc, m, a1) \ | |
358 | STMT_START { \ | |
359 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \ | |
360 | Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\ | |
361 | a1, \ | |
362 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
363 | } STMT_END | |
364 | ||
365 | #define vWARN3(loc, m, a1, a2) \ | |
366 | STMT_START { \ | |
367 | unsigned offset = strlen(PL_regprecomp) - (PL_regxend - (loc)); \ | |
368 | Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION, \ | |
369 | a1, a2, \ | |
370 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
371 | } STMT_END | |
372 | ||
373 | #define vWARN4(loc, m, a1, a2, a3) \ | |
374 | STMT_START { \ | |
375 | unsigned offset = strlen(PL_regprecomp)-(PL_regxend-(loc)); \ | |
376 | Perl_warner(aTHX_ WARN_REGEXP, m REPORT_LOCATION,\ | |
377 | a1, a2, a3, \ | |
378 | offset, PL_regprecomp, PL_regprecomp + offset); \ | |
8615cb43 JF |
379 | } STMT_END |
380 | ||
381 | ||
382 | ||
cd439c50 IZ |
383 | /* Allow for side effects in s */ |
384 | #define REGC(c,s) STMT_START { if (!SIZE_ONLY) *(s) = (c); else (s);} STMT_END | |
385 | ||
51371543 | 386 | static void clear_re(pTHXo_ void *r); |
4327152a | 387 | |
653099ff GS |
388 | /* Mark that we cannot extend a found fixed substring at this point. |
389 | Updata the longest found anchored substring and the longest found | |
390 | floating substrings if needed. */ | |
391 | ||
4327152a | 392 | STATIC void |
cea2e8a9 | 393 | S_scan_commit(pTHX_ scan_data_t *data) |
c277df42 | 394 | { |
c485e607 | 395 | dTHR; |
a0ed51b3 LW |
396 | STRLEN l = CHR_SVLEN(data->last_found); |
397 | STRLEN old_l = CHR_SVLEN(*data->longest); | |
c277df42 IZ |
398 | |
399 | if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) { | |
400 | sv_setsv(*data->longest, data->last_found); | |
401 | if (*data->longest == data->longest_fixed) { | |
402 | data->offset_fixed = l ? data->last_start_min : data->pos_min; | |
403 | if (data->flags & SF_BEFORE_EOL) | |
404 | data->flags | |
405 | |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL); | |
406 | else | |
407 | data->flags &= ~SF_FIX_BEFORE_EOL; | |
a0ed51b3 LW |
408 | } |
409 | else { | |
c277df42 IZ |
410 | data->offset_float_min = l ? data->last_start_min : data->pos_min; |
411 | data->offset_float_max = (l | |
412 | ? data->last_start_max | |
413 | : data->pos_min + data->pos_delta); | |
414 | if (data->flags & SF_BEFORE_EOL) | |
415 | data->flags | |
416 | |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL); | |
417 | else | |
418 | data->flags &= ~SF_FL_BEFORE_EOL; | |
419 | } | |
420 | } | |
421 | SvCUR_set(data->last_found, 0); | |
422 | data->last_end = -1; | |
423 | data->flags &= ~SF_BEFORE_EOL; | |
424 | } | |
425 | ||
653099ff GS |
426 | /* Can match anything (initialization) */ |
427 | STATIC void | |
428 | S_cl_anything(pTHX_ struct regnode_charclass_class *cl) | |
429 | { | |
430 | int value; | |
431 | ||
432 | ANYOF_CLASS_ZERO(cl); | |
433 | for (value = 0; value < 256; ++value) | |
434 | ANYOF_BITMAP_SET(cl, value); | |
435 | cl->flags = ANYOF_EOS; | |
436 | if (LOC) | |
437 | cl->flags |= ANYOF_LOCALE; | |
438 | } | |
439 | ||
440 | /* Can match anything (initialization) */ | |
441 | STATIC int | |
442 | S_cl_is_anything(pTHX_ struct regnode_charclass_class *cl) | |
443 | { | |
444 | int value; | |
445 | ||
446 | for (value = 0; value < ANYOF_MAX; value += 2) | |
447 | if (ANYOF_CLASS_TEST(cl, value) && ANYOF_CLASS_TEST(cl, value + 1)) | |
448 | return 1; | |
449 | for (value = 0; value < 256; ++value) | |
450 | if (!ANYOF_BITMAP_TEST(cl, value)) | |
451 | return 0; | |
452 | return 1; | |
453 | } | |
454 | ||
455 | /* Can match anything (initialization) */ | |
456 | STATIC void | |
457 | S_cl_init(pTHX_ struct regnode_charclass_class *cl) | |
458 | { | |
8ecf7187 | 459 | Zero(cl, 1, struct regnode_charclass_class); |
653099ff GS |
460 | cl->type = ANYOF; |
461 | cl_anything(cl); | |
462 | } | |
463 | ||
464 | STATIC void | |
465 | S_cl_init_zero(pTHX_ struct regnode_charclass_class *cl) | |
466 | { | |
8ecf7187 | 467 | Zero(cl, 1, struct regnode_charclass_class); |
653099ff GS |
468 | cl->type = ANYOF; |
469 | cl_anything(cl); | |
653099ff GS |
470 | if (LOC) |
471 | cl->flags |= ANYOF_LOCALE; | |
472 | } | |
473 | ||
474 | /* 'And' a given class with another one. Can create false positives */ | |
475 | /* We assume that cl is not inverted */ | |
476 | STATIC void | |
477 | S_cl_and(pTHX_ struct regnode_charclass_class *cl, | |
478 | struct regnode_charclass_class *and_with) | |
479 | { | |
653099ff GS |
480 | if (!(and_with->flags & ANYOF_CLASS) |
481 | && !(cl->flags & ANYOF_CLASS) | |
482 | && (and_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
483 | && !(and_with->flags & ANYOF_FOLD) | |
484 | && !(cl->flags & ANYOF_FOLD)) { | |
485 | int i; | |
486 | ||
487 | if (and_with->flags & ANYOF_INVERT) | |
488 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
489 | cl->bitmap[i] &= ~and_with->bitmap[i]; | |
490 | else | |
491 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
492 | cl->bitmap[i] &= and_with->bitmap[i]; | |
493 | } /* XXXX: logic is complicated otherwise, leave it along for a moment. */ | |
494 | if (!(and_with->flags & ANYOF_EOS)) | |
495 | cl->flags &= ~ANYOF_EOS; | |
496 | } | |
497 | ||
498 | /* 'OR' a given class with another one. Can create false positives */ | |
499 | /* We assume that cl is not inverted */ | |
500 | STATIC void | |
501 | S_cl_or(pTHX_ struct regnode_charclass_class *cl, struct regnode_charclass_class *or_with) | |
502 | { | |
653099ff GS |
503 | if (or_with->flags & ANYOF_INVERT) { |
504 | /* We do not use | |
505 | * (B1 | CL1) | (!B2 & !CL2) = (B1 | !B2 & !CL2) | (CL1 | (!B2 & !CL2)) | |
506 | * <= (B1 | !B2) | (CL1 | !CL2) | |
507 | * which is wasteful if CL2 is small, but we ignore CL2: | |
508 | * (B1 | CL1) | (!B2 & !CL2) <= (B1 | CL1) | !B2 = (B1 | !B2) | CL1 | |
509 | * XXXX Can we handle case-fold? Unclear: | |
510 | * (OK1(i) | OK1(i')) | !(OK1(i) | OK1(i')) = | |
511 | * (OK1(i) | OK1(i')) | (!OK1(i) & !OK1(i')) | |
512 | */ | |
513 | if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
514 | && !(or_with->flags & ANYOF_FOLD) | |
515 | && !(cl->flags & ANYOF_FOLD) ) { | |
516 | int i; | |
517 | ||
518 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
519 | cl->bitmap[i] |= ~or_with->bitmap[i]; | |
520 | } /* XXXX: logic is complicated otherwise */ | |
521 | else { | |
522 | cl_anything(cl); | |
523 | } | |
524 | } else { | |
525 | /* (B1 | CL1) | (B2 | CL2) = (B1 | B2) | (CL1 | CL2)) */ | |
526 | if ( (or_with->flags & ANYOF_LOCALE) == (cl->flags & ANYOF_LOCALE) | |
527 | && (!(or_with->flags & ANYOF_FOLD) | |
528 | || (cl->flags & ANYOF_FOLD)) ) { | |
529 | int i; | |
530 | ||
531 | /* OR char bitmap and class bitmap separately */ | |
532 | for (i = 0; i < ANYOF_BITMAP_SIZE; i++) | |
533 | cl->bitmap[i] |= or_with->bitmap[i]; | |
534 | if (or_with->flags & ANYOF_CLASS) { | |
535 | for (i = 0; i < ANYOF_CLASSBITMAP_SIZE; i++) | |
536 | cl->classflags[i] |= or_with->classflags[i]; | |
537 | cl->flags |= ANYOF_CLASS; | |
538 | } | |
539 | } | |
540 | else { /* XXXX: logic is complicated, leave it along for a moment. */ | |
541 | cl_anything(cl); | |
542 | } | |
543 | } | |
544 | if (or_with->flags & ANYOF_EOS) | |
545 | cl->flags |= ANYOF_EOS; | |
546 | } | |
547 | ||
548 | /* REx optimizer. Converts nodes into quickier variants "in place". | |
549 | Finds fixed substrings. */ | |
550 | ||
c277df42 IZ |
551 | /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set |
552 | to the position after last scanned or to NULL. */ | |
553 | ||
76e3520e | 554 | STATIC I32 |
cea2e8a9 | 555 | S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags) |
c277df42 IZ |
556 | /* scanp: Start here (read-write). */ |
557 | /* deltap: Write maxlen-minlen here. */ | |
558 | /* last: Stop before this one. */ | |
559 | { | |
5c0ca799 | 560 | dTHR; |
c277df42 IZ |
561 | I32 min = 0, pars = 0, code; |
562 | regnode *scan = *scanp, *next; | |
563 | I32 delta = 0; | |
564 | int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF); | |
aca2d497 | 565 | int is_inf_internal = 0; /* The studied chunk is infinite */ |
c277df42 IZ |
566 | I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0; |
567 | scan_data_t data_fake; | |
653099ff | 568 | struct regnode_charclass_class and_with; /* Valid if flags & SCF_DO_STCLASS_OR */ |
c277df42 IZ |
569 | |
570 | while (scan && OP(scan) != END && scan < last) { | |
571 | /* Peephole optimizer: */ | |
572 | ||
22c35a8c | 573 | if (PL_regkind[(U8)OP(scan)] == EXACT) { |
653099ff | 574 | /* Merge several consecutive EXACTish nodes into one. */ |
c277df42 IZ |
575 | regnode *n = regnext(scan); |
576 | U32 stringok = 1; | |
577 | #ifdef DEBUGGING | |
578 | regnode *stop = scan; | |
579 | #endif | |
580 | ||
cd439c50 | 581 | next = scan + NODE_SZ_STR(scan); |
c277df42 IZ |
582 | /* Skip NOTHING, merge EXACT*. */ |
583 | while (n && | |
22c35a8c | 584 | ( PL_regkind[(U8)OP(n)] == NOTHING || |
c277df42 IZ |
585 | (stringok && (OP(n) == OP(scan)))) |
586 | && NEXT_OFF(n) | |
587 | && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) { | |
588 | if (OP(n) == TAIL || n > next) | |
589 | stringok = 0; | |
22c35a8c | 590 | if (PL_regkind[(U8)OP(n)] == NOTHING) { |
c277df42 IZ |
591 | NEXT_OFF(scan) += NEXT_OFF(n); |
592 | next = n + NODE_STEP_REGNODE; | |
593 | #ifdef DEBUGGING | |
594 | if (stringok) | |
595 | stop = n; | |
596 | #endif | |
597 | n = regnext(n); | |
a0ed51b3 LW |
598 | } |
599 | else { | |
cd439c50 | 600 | int oldl = STR_LEN(scan); |
c277df42 IZ |
601 | regnode *nnext = regnext(n); |
602 | ||
cd439c50 | 603 | if (oldl + STR_LEN(n) > U8_MAX) |
c277df42 IZ |
604 | break; |
605 | NEXT_OFF(scan) += NEXT_OFF(n); | |
cd439c50 IZ |
606 | STR_LEN(scan) += STR_LEN(n); |
607 | next = n + NODE_SZ_STR(n); | |
c277df42 | 608 | /* Now we can overwrite *n : */ |
cd439c50 IZ |
609 | Move(STRING(n), STRING(scan) + oldl, |
610 | STR_LEN(n), char); | |
c277df42 IZ |
611 | #ifdef DEBUGGING |
612 | if (stringok) | |
613 | stop = next - 1; | |
614 | #endif | |
615 | n = nnext; | |
616 | } | |
617 | } | |
618 | #ifdef DEBUGGING | |
619 | /* Allow dumping */ | |
cd439c50 | 620 | n = scan + NODE_SZ_STR(scan); |
c277df42 | 621 | while (n <= stop) { |
22c35a8c | 622 | if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) { |
c277df42 IZ |
623 | OP(n) = OPTIMIZED; |
624 | NEXT_OFF(n) = 0; | |
625 | } | |
626 | n++; | |
627 | } | |
653099ff | 628 | #endif |
c277df42 | 629 | } |
653099ff GS |
630 | /* Follow the next-chain of the current node and optimize |
631 | away all the NOTHINGs from it. */ | |
c277df42 | 632 | if (OP(scan) != CURLYX) { |
048cfca1 GS |
633 | int max = (reg_off_by_arg[OP(scan)] |
634 | ? I32_MAX | |
635 | /* I32 may be smaller than U16 on CRAYs! */ | |
636 | : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX)); | |
c277df42 IZ |
637 | int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan)); |
638 | int noff; | |
639 | regnode *n = scan; | |
640 | ||
641 | /* Skip NOTHING and LONGJMP. */ | |
642 | while ((n = regnext(n)) | |
22c35a8c | 643 | && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n))) |
c277df42 IZ |
644 | || ((OP(n) == LONGJMP) && (noff = ARG(n)))) |
645 | && off + noff < max) | |
646 | off += noff; | |
647 | if (reg_off_by_arg[OP(scan)]) | |
648 | ARG(scan) = off; | |
649 | else | |
650 | NEXT_OFF(scan) = off; | |
651 | } | |
653099ff GS |
652 | /* The principal pseudo-switch. Cannot be a switch, since we |
653 | look into several different things. */ | |
c277df42 IZ |
654 | if (OP(scan) == BRANCH || OP(scan) == BRANCHJ |
655 | || OP(scan) == IFTHEN || OP(scan) == SUSPEND) { | |
656 | next = regnext(scan); | |
657 | code = OP(scan); | |
658 | ||
659 | if (OP(next) == code || code == IFTHEN || code == SUSPEND) { | |
660 | I32 max1 = 0, min1 = I32_MAX, num = 0; | |
653099ff | 661 | struct regnode_charclass_class accum; |
c277df42 | 662 | |
653099ff GS |
663 | if (flags & SCF_DO_SUBSTR) /* XXXX Add !SUSPEND? */ |
664 | scan_commit(data); /* Cannot merge strings after this. */ | |
665 | if (flags & SCF_DO_STCLASS) | |
666 | cl_init_zero(&accum); | |
c277df42 | 667 | while (OP(scan) == code) { |
653099ff GS |
668 | I32 deltanext, minnext, f = 0; |
669 | struct regnode_charclass_class this_class; | |
c277df42 IZ |
670 | |
671 | num++; | |
672 | data_fake.flags = 0; | |
2c2d71f5 JH |
673 | if (data) |
674 | data_fake.whilem_c = data->whilem_c; | |
c277df42 IZ |
675 | next = regnext(scan); |
676 | scan = NEXTOPER(scan); | |
677 | if (code != BRANCH) | |
678 | scan = NEXTOPER(scan); | |
653099ff GS |
679 | if (flags & SCF_DO_STCLASS) { |
680 | cl_init(&this_class); | |
681 | data_fake.start_class = &this_class; | |
682 | f = SCF_DO_STCLASS_AND; | |
683 | } | |
684 | /* we suppose the run is continuous, last=next...*/ | |
c277df42 | 685 | minnext = study_chunk(&scan, &deltanext, next, |
653099ff | 686 | &data_fake, f); |
c277df42 IZ |
687 | if (min1 > minnext) |
688 | min1 = minnext; | |
689 | if (max1 < minnext + deltanext) | |
690 | max1 = minnext + deltanext; | |
691 | if (deltanext == I32_MAX) | |
aca2d497 | 692 | is_inf = is_inf_internal = 1; |
c277df42 IZ |
693 | scan = next; |
694 | if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
695 | pars++; | |
405ff068 | 696 | if (data && (data_fake.flags & SF_HAS_EVAL)) |
c277df42 | 697 | data->flags |= SF_HAS_EVAL; |
2c2d71f5 JH |
698 | if (data) |
699 | data->whilem_c = data_fake.whilem_c; | |
653099ff GS |
700 | if (flags & SCF_DO_STCLASS) |
701 | cl_or(&accum, &this_class); | |
c277df42 IZ |
702 | if (code == SUSPEND) |
703 | break; | |
704 | } | |
705 | if (code == IFTHEN && num < 2) /* Empty ELSE branch */ | |
706 | min1 = 0; | |
707 | if (flags & SCF_DO_SUBSTR) { | |
708 | data->pos_min += min1; | |
709 | data->pos_delta += max1 - min1; | |
710 | if (max1 != min1 || is_inf) | |
711 | data->longest = &(data->longest_float); | |
712 | } | |
713 | min += min1; | |
714 | delta += max1 - min1; | |
653099ff GS |
715 | if (flags & SCF_DO_STCLASS_OR) { |
716 | cl_or(data->start_class, &accum); | |
717 | if (min1) { | |
718 | cl_and(data->start_class, &and_with); | |
719 | flags &= ~SCF_DO_STCLASS; | |
720 | } | |
721 | } | |
722 | else if (flags & SCF_DO_STCLASS_AND) { | |
de0c8cb8 GS |
723 | if (min1) { |
724 | cl_and(data->start_class, &accum); | |
653099ff | 725 | flags &= ~SCF_DO_STCLASS; |
de0c8cb8 GS |
726 | } |
727 | else { | |
728 | /* Switch to OR mode: cache the old value of | |
729 | * data->start_class */ | |
730 | StructCopy(data->start_class, &and_with, | |
731 | struct regnode_charclass_class); | |
732 | flags &= ~SCF_DO_STCLASS_AND; | |
733 | StructCopy(&accum, data->start_class, | |
734 | struct regnode_charclass_class); | |
735 | flags |= SCF_DO_STCLASS_OR; | |
736 | data->start_class->flags |= ANYOF_EOS; | |
737 | } | |
653099ff | 738 | } |
a0ed51b3 LW |
739 | } |
740 | else if (code == BRANCHJ) /* single branch is optimized. */ | |
c277df42 IZ |
741 | scan = NEXTOPER(NEXTOPER(scan)); |
742 | else /* single branch is optimized. */ | |
743 | scan = NEXTOPER(scan); | |
744 | continue; | |
a0ed51b3 LW |
745 | } |
746 | else if (OP(scan) == EXACT) { | |
cd439c50 | 747 | I32 l = STR_LEN(scan); |
a0ed51b3 | 748 | if (UTF) { |
cd439c50 | 749 | unsigned char *s = (unsigned char *)STRING(scan); |
a0ed51b3 LW |
750 | unsigned char *e = s + l; |
751 | I32 newl = 0; | |
752 | while (s < e) { | |
753 | newl++; | |
754 | s += UTF8SKIP(s); | |
755 | } | |
756 | l = newl; | |
757 | } | |
758 | min += l; | |
c277df42 | 759 | if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */ |
c277df42 IZ |
760 | /* The code below prefers earlier match for fixed |
761 | offset, later match for variable offset. */ | |
762 | if (data->last_end == -1) { /* Update the start info. */ | |
763 | data->last_start_min = data->pos_min; | |
764 | data->last_start_max = is_inf | |
765 | ? I32_MAX : data->pos_min + data->pos_delta; | |
766 | } | |
cd439c50 | 767 | sv_catpvn(data->last_found, STRING(scan), STR_LEN(scan)); |
c277df42 IZ |
768 | data->last_end = data->pos_min + l; |
769 | data->pos_min += l; /* As in the first entry. */ | |
770 | data->flags &= ~SF_BEFORE_EOL; | |
771 | } | |
653099ff GS |
772 | if (flags & SCF_DO_STCLASS_AND) { |
773 | /* Check whether it is compatible with what we know already! */ | |
774 | int compat = 1; | |
775 | ||
776 | if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE)) | |
777 | && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan)) | |
778 | && (!(data->start_class->flags & ANYOF_FOLD) | |
779 | || !ANYOF_BITMAP_TEST(data->start_class, | |
155aba94 | 780 | PL_fold[*(U8*)STRING(scan)]))) |
653099ff GS |
781 | compat = 0; |
782 | ANYOF_CLASS_ZERO(data->start_class); | |
783 | ANYOF_BITMAP_ZERO(data->start_class); | |
784 | if (compat) | |
785 | ANYOF_BITMAP_SET(data->start_class, *STRING(scan)); | |
786 | data->start_class->flags &= ~ANYOF_EOS; | |
787 | } | |
788 | else if (flags & SCF_DO_STCLASS_OR) { | |
789 | /* false positive possible if the class is case-folded */ | |
790 | ANYOF_BITMAP_SET(data->start_class, *STRING(scan)); | |
791 | data->start_class->flags &= ~ANYOF_EOS; | |
792 | cl_and(data->start_class, &and_with); | |
793 | } | |
794 | flags &= ~SCF_DO_STCLASS; | |
a0ed51b3 | 795 | } |
653099ff | 796 | else if (PL_regkind[(U8)OP(scan)] == EXACT) { /* But OP != EXACT! */ |
cd439c50 | 797 | I32 l = STR_LEN(scan); |
653099ff GS |
798 | |
799 | /* Search for fixed substrings supports EXACT only. */ | |
c277df42 IZ |
800 | if (flags & SCF_DO_SUBSTR) |
801 | scan_commit(data); | |
a0ed51b3 | 802 | if (UTF) { |
cd439c50 | 803 | unsigned char *s = (unsigned char *)STRING(scan); |
a0ed51b3 LW |
804 | unsigned char *e = s + l; |
805 | I32 newl = 0; | |
806 | while (s < e) { | |
807 | newl++; | |
808 | s += UTF8SKIP(s); | |
809 | } | |
810 | l = newl; | |
811 | } | |
812 | min += l; | |
c277df42 | 813 | if (data && (flags & SCF_DO_SUBSTR)) |
a0ed51b3 | 814 | data->pos_min += l; |
653099ff GS |
815 | if (flags & SCF_DO_STCLASS_AND) { |
816 | /* Check whether it is compatible with what we know already! */ | |
817 | int compat = 1; | |
818 | ||
819 | if (!(data->start_class->flags & (ANYOF_CLASS | ANYOF_LOCALE)) | |
820 | && !ANYOF_BITMAP_TEST(data->start_class, *STRING(scan)) | |
821 | && !ANYOF_BITMAP_TEST(data->start_class, | |
155aba94 | 822 | PL_fold[*(U8*)STRING(scan)])) |
653099ff GS |
823 | compat = 0; |
824 | ANYOF_CLASS_ZERO(data->start_class); | |
825 | ANYOF_BITMAP_ZERO(data->start_class); | |
826 | if (compat) { | |
827 | ANYOF_BITMAP_SET(data->start_class, *STRING(scan)); | |
828 | data->start_class->flags &= ~ANYOF_EOS; | |
829 | data->start_class->flags |= ANYOF_FOLD; | |
830 | if (OP(scan) == EXACTFL) | |
831 | data->start_class->flags |= ANYOF_LOCALE; | |
832 | } | |
833 | } | |
834 | else if (flags & SCF_DO_STCLASS_OR) { | |
835 | if (data->start_class->flags & ANYOF_FOLD) { | |
836 | /* false positive possible if the class is case-folded. | |
837 | Assume that the locale settings are the same... */ | |
838 | ANYOF_BITMAP_SET(data->start_class, *STRING(scan)); | |
839 | data->start_class->flags &= ~ANYOF_EOS; | |
840 | } | |
841 | cl_and(data->start_class, &and_with); | |
842 | } | |
843 | flags &= ~SCF_DO_STCLASS; | |
a0ed51b3 | 844 | } |
4d61ec05 | 845 | else if (strchr((char*)PL_varies,OP(scan))) { |
c277df42 | 846 | I32 mincount, maxcount, minnext, deltanext, pos_before, fl; |
653099ff | 847 | I32 f = flags; |
c277df42 | 848 | regnode *oscan = scan; |
653099ff GS |
849 | struct regnode_charclass_class this_class; |
850 | struct regnode_charclass_class *oclass = NULL; | |
851 | ||
22c35a8c | 852 | switch (PL_regkind[(U8)OP(scan)]) { |
653099ff | 853 | case WHILEM: /* End of (?:...)* . */ |
c277df42 IZ |
854 | scan = NEXTOPER(scan); |
855 | goto finish; | |
856 | case PLUS: | |
653099ff | 857 | if (flags & (SCF_DO_SUBSTR | SCF_DO_STCLASS)) { |
c277df42 | 858 | next = NEXTOPER(scan); |
653099ff | 859 | if (OP(next) == EXACT || (flags & SCF_DO_STCLASS)) { |
c277df42 IZ |
860 | mincount = 1; |
861 | maxcount = REG_INFTY; | |
862 | next = regnext(scan); | |
863 | scan = NEXTOPER(scan); | |
864 | goto do_curly; | |
865 | } | |
866 | } | |
867 | if (flags & SCF_DO_SUBSTR) | |
868 | data->pos_min++; | |
869 | min++; | |
870 | /* Fall through. */ | |
871 | case STAR: | |
653099ff GS |
872 | if (flags & SCF_DO_STCLASS) { |
873 | mincount = 0; | |
874 | maxcount = REG_INFTY; | |
875 | next = regnext(scan); | |
876 | scan = NEXTOPER(scan); | |
877 | goto do_curly; | |
878 | } | |
aca2d497 | 879 | is_inf = is_inf_internal = 1; |
c277df42 IZ |
880 | scan = regnext(scan); |
881 | if (flags & SCF_DO_SUBSTR) { | |
653099ff | 882 | scan_commit(data); /* Cannot extend fixed substrings */ |
c277df42 IZ |
883 | data->longest = &(data->longest_float); |
884 | } | |
885 | goto optimize_curly_tail; | |
886 | case CURLY: | |
887 | mincount = ARG1(scan); | |
888 | maxcount = ARG2(scan); | |
889 | next = regnext(scan); | |
890 | scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS; | |
891 | do_curly: | |
892 | if (flags & SCF_DO_SUBSTR) { | |
653099ff | 893 | if (mincount == 0) scan_commit(data); /* Cannot extend fixed substrings */ |
c277df42 IZ |
894 | pos_before = data->pos_min; |
895 | } | |
896 | if (data) { | |
897 | fl = data->flags; | |
898 | data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL); | |
899 | if (is_inf) | |
900 | data->flags |= SF_IS_INF; | |
901 | } | |
653099ff GS |
902 | if (flags & SCF_DO_STCLASS) { |
903 | cl_init(&this_class); | |
904 | oclass = data->start_class; | |
905 | data->start_class = &this_class; | |
906 | f |= SCF_DO_STCLASS_AND; | |
907 | f &= ~SCF_DO_STCLASS_OR; | |
908 | } | |
909 | ||
c277df42 IZ |
910 | /* This will finish on WHILEM, setting scan, or on NULL: */ |
911 | minnext = study_chunk(&scan, &deltanext, last, data, | |
912 | mincount == 0 | |
653099ff GS |
913 | ? (f & ~SCF_DO_SUBSTR) : f); |
914 | ||
915 | if (flags & SCF_DO_STCLASS) | |
916 | data->start_class = oclass; | |
917 | if (mincount == 0 || minnext == 0) { | |
918 | if (flags & SCF_DO_STCLASS_OR) { | |
919 | cl_or(data->start_class, &this_class); | |
920 | } | |
921 | else if (flags & SCF_DO_STCLASS_AND) { | |
922 | /* Switch to OR mode: cache the old value of | |
923 | * data->start_class */ | |
924 | StructCopy(data->start_class, &and_with, | |
925 | struct regnode_charclass_class); | |
926 | flags &= ~SCF_DO_STCLASS_AND; | |
927 | StructCopy(&this_class, data->start_class, | |
928 | struct regnode_charclass_class); | |
929 | flags |= SCF_DO_STCLASS_OR; | |
930 | data->start_class->flags |= ANYOF_EOS; | |
931 | } | |
932 | } else { /* Non-zero len */ | |
933 | if (flags & SCF_DO_STCLASS_OR) { | |
934 | cl_or(data->start_class, &this_class); | |
935 | cl_and(data->start_class, &and_with); | |
936 | } | |
937 | else if (flags & SCF_DO_STCLASS_AND) | |
938 | cl_and(data->start_class, &this_class); | |
939 | flags &= ~SCF_DO_STCLASS; | |
940 | } | |
c277df42 IZ |
941 | if (!scan) /* It was not CURLYX, but CURLY. */ |
942 | scan = next; | |
e476b1b5 | 943 | if (ckWARN(WARN_REGEXP) && (minnext + deltanext == 0) |
821b33a5 | 944 | && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)) |
17feb5d5 | 945 | && maxcount <= REG_INFTY/3) /* Complement check for big count */ |
b45f050a JF |
946 | { |
947 | vWARN(PL_regcomp_parse, | |
948 | "Quantifier unexpected on zero-length expression"); | |
949 | } | |
950 | ||
c277df42 | 951 | min += minnext * mincount; |
155aba94 GS |
952 | is_inf_internal |= ((maxcount == REG_INFTY |
953 | && (minnext + deltanext) > 0) | |
954 | || deltanext == I32_MAX); | |
aca2d497 | 955 | is_inf |= is_inf_internal; |
c277df42 IZ |
956 | delta += (minnext + deltanext) * maxcount - minnext * mincount; |
957 | ||
958 | /* Try powerful optimization CURLYX => CURLYN. */ | |
c277df42 IZ |
959 | if ( OP(oscan) == CURLYX && data |
960 | && data->flags & SF_IN_PAR | |
961 | && !(data->flags & SF_HAS_EVAL) | |
962 | && !deltanext && minnext == 1 ) { | |
963 | /* Try to optimize to CURLYN. */ | |
964 | regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; | |
965 | regnode *nxt1 = nxt, *nxt2; | |
966 | ||
967 | /* Skip open. */ | |
968 | nxt = regnext(nxt); | |
4d61ec05 | 969 | if (!strchr((char*)PL_simple,OP(nxt)) |
22c35a8c | 970 | && !(PL_regkind[(U8)OP(nxt)] == EXACT |
cd439c50 | 971 | && STR_LEN(nxt) == 1)) |
c277df42 IZ |
972 | goto nogo; |
973 | nxt2 = nxt; | |
974 | nxt = regnext(nxt); | |
975 | if (OP(nxt) != CLOSE) | |
976 | goto nogo; | |
977 | /* Now we know that nxt2 is the only contents: */ | |
978 | oscan->flags = ARG(nxt); | |
979 | OP(oscan) = CURLYN; | |
980 | OP(nxt1) = NOTHING; /* was OPEN. */ | |
981 | #ifdef DEBUGGING | |
982 | OP(nxt1 + 1) = OPTIMIZED; /* was count. */ | |
983 | NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */ | |
984 | NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */ | |
985 | OP(nxt) = OPTIMIZED; /* was CLOSE. */ | |
986 | OP(nxt + 1) = OPTIMIZED; /* was count. */ | |
987 | NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */ | |
988 | #endif | |
989 | } | |
c277df42 IZ |
990 | nogo: |
991 | ||
992 | /* Try optimization CURLYX => CURLYM. */ | |
993 | if ( OP(oscan) == CURLYX && data | |
c277df42 | 994 | && !(data->flags & SF_HAS_PAR) |
c277df42 IZ |
995 | && !(data->flags & SF_HAS_EVAL) |
996 | && !deltanext ) { | |
997 | /* XXXX How to optimize if data == 0? */ | |
998 | /* Optimize to a simpler form. */ | |
999 | regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */ | |
1000 | regnode *nxt2; | |
1001 | ||
1002 | OP(oscan) = CURLYM; | |
1003 | while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/ | |
1004 | && (OP(nxt2) != WHILEM)) | |
1005 | nxt = nxt2; | |
1006 | OP(nxt2) = SUCCEED; /* Whas WHILEM */ | |
c277df42 IZ |
1007 | /* Need to optimize away parenths. */ |
1008 | if (data->flags & SF_IN_PAR) { | |
1009 | /* Set the parenth number. */ | |
1010 | regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/ | |
1011 | ||
1012 | if (OP(nxt) != CLOSE) | |
b45f050a | 1013 | FAIL("Panic opt close"); |
c277df42 IZ |
1014 | oscan->flags = ARG(nxt); |
1015 | OP(nxt1) = OPTIMIZED; /* was OPEN. */ | |
1016 | OP(nxt) = OPTIMIZED; /* was CLOSE. */ | |
1017 | #ifdef DEBUGGING | |
1018 | OP(nxt1 + 1) = OPTIMIZED; /* was count. */ | |
1019 | OP(nxt + 1) = OPTIMIZED; /* was count. */ | |
1020 | NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */ | |
1021 | NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */ | |
1022 | #endif | |
1023 | #if 0 | |
1024 | while ( nxt1 && (OP(nxt1) != WHILEM)) { | |
1025 | regnode *nnxt = regnext(nxt1); | |
1026 | ||
1027 | if (nnxt == nxt) { | |
1028 | if (reg_off_by_arg[OP(nxt1)]) | |
1029 | ARG_SET(nxt1, nxt2 - nxt1); | |
1030 | else if (nxt2 - nxt1 < U16_MAX) | |
1031 | NEXT_OFF(nxt1) = nxt2 - nxt1; | |
1032 | else | |
1033 | OP(nxt) = NOTHING; /* Cannot beautify */ | |
1034 | } | |
1035 | nxt1 = nnxt; | |
1036 | } | |
1037 | #endif | |
1038 | /* Optimize again: */ | |
1039 | study_chunk(&nxt1, &deltanext, nxt, NULL, 0); | |
a0ed51b3 LW |
1040 | } |
1041 | else | |
c277df42 | 1042 | oscan->flags = 0; |
c277df42 | 1043 | } |
2c2d71f5 JH |
1044 | else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) { |
1045 | /* This stays as CURLYX, and can put the count/of pair. */ | |
1046 | /* Find WHILEM (as in regexec.c) */ | |
1047 | regnode *nxt = oscan + NEXT_OFF(oscan); | |
1048 | ||
1049 | if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */ | |
1050 | nxt += ARG(nxt); | |
1051 | PREVOPER(nxt)->flags = data->whilem_c | |
1052 | | (PL_reg_whilem_seen << 4); /* On WHILEM */ | |
1053 | } | |
c277df42 IZ |
1054 | if (data && fl & (SF_HAS_PAR|SF_IN_PAR)) |
1055 | pars++; | |
1056 | if (flags & SCF_DO_SUBSTR) { | |
1057 | SV *last_str = Nullsv; | |
1058 | int counted = mincount != 0; | |
1059 | ||
1060 | if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */ | |
1061 | I32 b = pos_before >= data->last_start_min | |
1062 | ? pos_before : data->last_start_min; | |
1063 | STRLEN l; | |
1064 | char *s = SvPV(data->last_found, l); | |
a0ed51b3 LW |
1065 | I32 old = b - data->last_start_min; |
1066 | ||
1067 | if (UTF) | |
1068 | old = utf8_hop((U8*)s, old) - (U8*)s; | |
c277df42 | 1069 | |
a0ed51b3 | 1070 | l -= old; |
c277df42 | 1071 | /* Get the added string: */ |
79cb57f6 | 1072 | last_str = newSVpvn(s + old, l); |
c277df42 IZ |
1073 | if (deltanext == 0 && pos_before == b) { |
1074 | /* What was added is a constant string */ | |
1075 | if (mincount > 1) { | |
1076 | SvGROW(last_str, (mincount * l) + 1); | |
1077 | repeatcpy(SvPVX(last_str) + l, | |
1078 | SvPVX(last_str), l, mincount - 1); | |
1079 | SvCUR(last_str) *= mincount; | |
1080 | /* Add additional parts. */ | |
1081 | SvCUR_set(data->last_found, | |
1082 | SvCUR(data->last_found) - l); | |
1083 | sv_catsv(data->last_found, last_str); | |
1084 | data->last_end += l * (mincount - 1); | |
1085 | } | |
2a8d9689 HS |
1086 | } else { |
1087 | /* start offset must point into the last copy */ | |
1088 | data->last_start_min += minnext * (mincount - 1); | |
4b2cff9a HS |
1089 | data->last_start_max += is_inf ? 0 : (maxcount - 1) |
1090 | * (minnext + data->pos_delta); | |
c277df42 IZ |
1091 | } |
1092 | } | |
1093 | /* It is counted once already... */ | |
1094 | data->pos_min += minnext * (mincount - counted); | |
1095 | data->pos_delta += - counted * deltanext + | |
1096 | (minnext + deltanext) * maxcount - minnext * mincount; | |
1097 | if (mincount != maxcount) { | |
653099ff GS |
1098 | /* Cannot extend fixed substrings found inside |
1099 | the group. */ | |
c277df42 IZ |
1100 | scan_commit(data); |
1101 | if (mincount && last_str) { | |
1102 | sv_setsv(data->last_found, last_str); | |
1103 | data->last_end = data->pos_min; | |
1104 | data->last_start_min = | |
a0ed51b3 | 1105 | data->pos_min - CHR_SVLEN(last_str); |
c277df42 IZ |
1106 | data->last_start_max = is_inf |
1107 | ? I32_MAX | |
1108 | : data->pos_min + data->pos_delta | |
a0ed51b3 | 1109 | - CHR_SVLEN(last_str); |
c277df42 IZ |
1110 | } |
1111 | data->longest = &(data->longest_float); | |
1112 | } | |
aca2d497 | 1113 | SvREFCNT_dec(last_str); |
c277df42 | 1114 | } |
405ff068 | 1115 | if (data && (fl & SF_HAS_EVAL)) |
c277df42 IZ |
1116 | data->flags |= SF_HAS_EVAL; |
1117 | optimize_curly_tail: | |
c277df42 | 1118 | if (OP(oscan) != CURLYX) { |
22c35a8c | 1119 | while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING |
c277df42 IZ |
1120 | && NEXT_OFF(next)) |
1121 | NEXT_OFF(oscan) += NEXT_OFF(next); | |
1122 | } | |
c277df42 | 1123 | continue; |
653099ff | 1124 | default: /* REF and CLUMP only? */ |
c277df42 | 1125 | if (flags & SCF_DO_SUBSTR) { |
653099ff | 1126 | scan_commit(data); /* Cannot expect anything... */ |
c277df42 IZ |
1127 | data->longest = &(data->longest_float); |
1128 | } | |
aca2d497 | 1129 | is_inf = is_inf_internal = 1; |
653099ff GS |
1130 | if (flags & SCF_DO_STCLASS_OR) |
1131 | cl_anything(data->start_class); | |
1132 | flags &= ~SCF_DO_STCLASS; | |
c277df42 IZ |
1133 | break; |
1134 | } | |
a0ed51b3 | 1135 | } |
4d61ec05 | 1136 | else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) { |
653099ff GS |
1137 | int value; |
1138 | ||
c277df42 IZ |
1139 | if (flags & SCF_DO_SUBSTR) { |
1140 | scan_commit(data); | |
1141 | data->pos_min++; | |
1142 | } | |
1143 | min++; | |
653099ff GS |
1144 | if (flags & SCF_DO_STCLASS) { |
1145 | data->start_class->flags &= ~ANYOF_EOS; /* No match on empty */ | |
1146 | ||
1147 | /* Some of the logic below assumes that switching | |
1148 | locale on will only add false positives. */ | |
1149 | switch (PL_regkind[(U8)OP(scan)]) { | |
1150 | case ANYUTF8: | |
1151 | case SANY: | |
1152 | case SANYUTF8: | |
1153 | case ALNUMUTF8: | |
1154 | case ANYOFUTF8: | |
1155 | case ALNUMLUTF8: | |
1156 | case NALNUMUTF8: | |
1157 | case NALNUMLUTF8: | |
1158 | case SPACEUTF8: | |
1159 | case NSPACEUTF8: | |
1160 | case SPACELUTF8: | |
1161 | case NSPACELUTF8: | |
1162 | case DIGITUTF8: | |
1163 | case NDIGITUTF8: | |
1164 | default: | |
1165 | do_default: | |
1166 | /* Perl_croak(aTHX_ "panic: unexpected simple REx opcode %d", OP(scan)); */ | |
1167 | if (flags & SCF_DO_STCLASS_OR) /* Allow everything */ | |
1168 | cl_anything(data->start_class); | |
1169 | break; | |
1170 | case REG_ANY: | |
1171 | if (OP(scan) == SANY) | |
1172 | goto do_default; | |
1173 | if (flags & SCF_DO_STCLASS_OR) { /* Everything but \n */ | |
1174 | value = (ANYOF_BITMAP_TEST(data->start_class,'\n') | |
1175 | || (data->start_class->flags & ANYOF_CLASS)); | |
1176 | cl_anything(data->start_class); | |
1177 | } | |
1178 | if (flags & SCF_DO_STCLASS_AND || !value) | |
1179 | ANYOF_BITMAP_CLEAR(data->start_class,'\n'); | |
1180 | break; | |
1181 | case ANYOF: | |
1182 | if (flags & SCF_DO_STCLASS_AND) | |
1183 | cl_and(data->start_class, | |
1184 | (struct regnode_charclass_class*)scan); | |
1185 | else | |
1186 | cl_or(data->start_class, | |
1187 | (struct regnode_charclass_class*)scan); | |
1188 | break; | |
1189 | case ALNUM: | |
1190 | if (flags & SCF_DO_STCLASS_AND) { | |
1191 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
1192 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM); | |
1193 | for (value = 0; value < 256; value++) | |
1194 | if (!isALNUM(value)) | |
1195 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1196 | } | |
1197 | } | |
1198 | else { | |
1199 | if (data->start_class->flags & ANYOF_LOCALE) | |
1200 | ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM); | |
1201 | else { | |
1202 | for (value = 0; value < 256; value++) | |
1203 | if (isALNUM(value)) | |
1204 | ANYOF_BITMAP_SET(data->start_class, value); | |
1205 | } | |
1206 | } | |
1207 | break; | |
1208 | case ALNUML: | |
1209 | if (flags & SCF_DO_STCLASS_AND) { | |
1210 | if (data->start_class->flags & ANYOF_LOCALE) | |
1211 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NALNUM); | |
1212 | } | |
1213 | else { | |
1214 | ANYOF_CLASS_SET(data->start_class,ANYOF_ALNUM); | |
1215 | data->start_class->flags |= ANYOF_LOCALE; | |
1216 | } | |
1217 | break; | |
1218 | case NALNUM: | |
1219 | if (flags & SCF_DO_STCLASS_AND) { | |
1220 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
1221 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM); | |
1222 | for (value = 0; value < 256; value++) | |
1223 | if (isALNUM(value)) | |
1224 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1225 | } | |
1226 | } | |
1227 | else { | |
1228 | if (data->start_class->flags & ANYOF_LOCALE) | |
1229 | ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM); | |
1230 | else { | |
1231 | for (value = 0; value < 256; value++) | |
1232 | if (!isALNUM(value)) | |
1233 | ANYOF_BITMAP_SET(data->start_class, value); | |
1234 | } | |
1235 | } | |
1236 | break; | |
1237 | case NALNUML: | |
1238 | if (flags & SCF_DO_STCLASS_AND) { | |
1239 | if (data->start_class->flags & ANYOF_LOCALE) | |
1240 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_ALNUM); | |
1241 | } | |
1242 | else { | |
1243 | data->start_class->flags |= ANYOF_LOCALE; | |
1244 | ANYOF_CLASS_SET(data->start_class,ANYOF_NALNUM); | |
1245 | } | |
1246 | break; | |
1247 | case SPACE: | |
1248 | if (flags & SCF_DO_STCLASS_AND) { | |
1249 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
1250 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE); | |
1251 | for (value = 0; value < 256; value++) | |
1252 | if (!isSPACE(value)) | |
1253 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1254 | } | |
1255 | } | |
1256 | else { | |
1257 | if (data->start_class->flags & ANYOF_LOCALE) | |
1258 | ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE); | |
1259 | else { | |
1260 | for (value = 0; value < 256; value++) | |
1261 | if (isSPACE(value)) | |
1262 | ANYOF_BITMAP_SET(data->start_class, value); | |
1263 | } | |
1264 | } | |
1265 | break; | |
1266 | case SPACEL: | |
1267 | if (flags & SCF_DO_STCLASS_AND) { | |
1268 | if (data->start_class->flags & ANYOF_LOCALE) | |
1269 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NSPACE); | |
1270 | } | |
1271 | else { | |
1272 | data->start_class->flags |= ANYOF_LOCALE; | |
1273 | ANYOF_CLASS_SET(data->start_class,ANYOF_SPACE); | |
1274 | } | |
1275 | break; | |
1276 | case NSPACE: | |
1277 | if (flags & SCF_DO_STCLASS_AND) { | |
1278 | if (!(data->start_class->flags & ANYOF_LOCALE)) { | |
1279 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE); | |
1280 | for (value = 0; value < 256; value++) | |
1281 | if (isSPACE(value)) | |
1282 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1283 | } | |
1284 | } | |
1285 | else { | |
1286 | if (data->start_class->flags & ANYOF_LOCALE) | |
1287 | ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE); | |
1288 | else { | |
1289 | for (value = 0; value < 256; value++) | |
1290 | if (!isSPACE(value)) | |
1291 | ANYOF_BITMAP_SET(data->start_class, value); | |
1292 | } | |
1293 | } | |
1294 | break; | |
1295 | case NSPACEL: | |
1296 | if (flags & SCF_DO_STCLASS_AND) { | |
1297 | if (data->start_class->flags & ANYOF_LOCALE) { | |
1298 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_SPACE); | |
1299 | for (value = 0; value < 256; value++) | |
1300 | if (!isSPACE(value)) | |
1301 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1302 | } | |
1303 | } | |
1304 | else { | |
1305 | data->start_class->flags |= ANYOF_LOCALE; | |
1306 | ANYOF_CLASS_SET(data->start_class,ANYOF_NSPACE); | |
1307 | } | |
1308 | break; | |
1309 | case DIGIT: | |
1310 | if (flags & SCF_DO_STCLASS_AND) { | |
1311 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_NDIGIT); | |
1312 | for (value = 0; value < 256; value++) | |
1313 | if (!isDIGIT(value)) | |
1314 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1315 | } | |
1316 | else { | |
1317 | if (data->start_class->flags & ANYOF_LOCALE) | |
1318 | ANYOF_CLASS_SET(data->start_class,ANYOF_DIGIT); | |
1319 | else { | |
1320 | for (value = 0; value < 256; value++) | |
1321 | if (isDIGIT(value)) | |
1322 | ANYOF_BITMAP_SET(data->start_class, value); | |
1323 | } | |
1324 | } | |
1325 | break; | |
1326 | case NDIGIT: | |
1327 | if (flags & SCF_DO_STCLASS_AND) { | |
1328 | ANYOF_CLASS_CLEAR(data->start_class,ANYOF_DIGIT); | |
1329 | for (value = 0; value < 256; value++) | |
1330 | if (isDIGIT(value)) | |
1331 | ANYOF_BITMAP_CLEAR(data->start_class, value); | |
1332 | } | |
1333 | else { | |
1334 | if (data->start_class->flags & ANYOF_LOCALE) | |
1335 | ANYOF_CLASS_SET(data->start_class,ANYOF_NDIGIT); | |
1336 | else { | |
1337 | for (value = 0; value < 256; value++) | |
1338 | if (!isDIGIT(value)) | |
1339 | ANYOF_BITMAP_SET(data->start_class, value); | |
1340 | } | |
1341 | } | |
1342 | break; | |
1343 | } | |
1344 | if (flags & SCF_DO_STCLASS_OR) | |
1345 | cl_and(data->start_class, &and_with); | |
1346 | flags &= ~SCF_DO_STCLASS; | |
1347 | } | |
a0ed51b3 | 1348 | } |
22c35a8c | 1349 | else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) { |
c277df42 IZ |
1350 | data->flags |= (OP(scan) == MEOL |
1351 | ? SF_BEFORE_MEOL | |
1352 | : SF_BEFORE_SEOL); | |
a0ed51b3 | 1353 | } |
653099ff GS |
1354 | else if ( PL_regkind[(U8)OP(scan)] == BRANCHJ |
1355 | /* Lookbehind, or need to calculate parens/evals/stclass: */ | |
1356 | && (scan->flags || data || (flags & SCF_DO_STCLASS)) | |
c277df42 | 1357 | && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) { |
653099ff | 1358 | /* Lookahead/lookbehind */ |
c277df42 IZ |
1359 | I32 deltanext, minnext; |
1360 | regnode *nscan; | |
653099ff GS |
1361 | struct regnode_charclass_class intrnl; |
1362 | int f = 0; | |
c277df42 IZ |
1363 | |
1364 | data_fake.flags = 0; | |
2c2d71f5 JH |
1365 | if (data) |
1366 | data_fake.whilem_c = data->whilem_c; | |
653099ff GS |
1367 | if ( flags & SCF_DO_STCLASS && !scan->flags |
1368 | && OP(scan) == IFMATCH ) { /* Lookahead */ | |
1369 | cl_init(&intrnl); | |
1370 | data_fake.start_class = &intrnl; | |
1371 | f = SCF_DO_STCLASS_AND; | |
1372 | } | |
c277df42 IZ |
1373 | next = regnext(scan); |
1374 | nscan = NEXTOPER(NEXTOPER(scan)); | |
653099ff | 1375 | minnext = study_chunk(&nscan, &deltanext, last, &data_fake, f); |
c277df42 IZ |
1376 | if (scan->flags) { |
1377 | if (deltanext) { | |
9baa0206 | 1378 | vFAIL("Variable length lookbehind not implemented"); |
a0ed51b3 LW |
1379 | } |
1380 | else if (minnext > U8_MAX) { | |
9baa0206 | 1381 | vFAIL2("Lookbehind longer than %"UVuf" not implemented", (UV)U8_MAX); |
c277df42 IZ |
1382 | } |
1383 | scan->flags = minnext; | |
1384 | } | |
1385 | if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR)) | |
1386 | pars++; | |
405ff068 | 1387 | if (data && (data_fake.flags & SF_HAS_EVAL)) |
c277df42 | 1388 | data->flags |= SF_HAS_EVAL; |
2c2d71f5 JH |
1389 | if (data) |
1390 | data->whilem_c = data_fake.whilem_c; | |
653099ff GS |
1391 | if (f) { |
1392 | int was = (data->start_class->flags & ANYOF_EOS); | |
1393 | ||
1394 | cl_and(data->start_class, &intrnl); | |
1395 | if (was) | |
1396 | data->start_class->flags |= ANYOF_EOS; | |
1397 | } | |
a0ed51b3 LW |
1398 | } |
1399 | else if (OP(scan) == OPEN) { | |
c277df42 | 1400 | pars++; |
a0ed51b3 LW |
1401 | } |
1402 | else if (OP(scan) == CLOSE && ARG(scan) == is_par) { | |
c277df42 IZ |
1403 | next = regnext(scan); |
1404 | ||
1405 | if ( next && (OP(next) != WHILEM) && next < last) | |
c277df42 | 1406 | is_par = 0; /* Disable optimization */ |
a0ed51b3 LW |
1407 | } |
1408 | else if (OP(scan) == EVAL) { | |
c277df42 IZ |
1409 | if (data) |
1410 | data->flags |= SF_HAS_EVAL; | |
1411 | } | |
96776eda | 1412 | else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded follows */ |
0f5d15d6 IZ |
1413 | if (flags & SCF_DO_SUBSTR) { |
1414 | scan_commit(data); | |
1415 | data->longest = &(data->longest_float); | |
1416 | } | |
1417 | is_inf = is_inf_internal = 1; | |
653099ff GS |
1418 | if (flags & SCF_DO_STCLASS_OR) /* Allow everything */ |
1419 | cl_anything(data->start_class); | |
96776eda | 1420 | flags &= ~SCF_DO_STCLASS; |
0f5d15d6 | 1421 | } |
c277df42 IZ |
1422 | /* Else: zero-length, ignore. */ |
1423 | scan = regnext(scan); | |
1424 | } | |
1425 | ||
1426 | finish: | |
1427 | *scanp = scan; | |
aca2d497 | 1428 | *deltap = is_inf_internal ? I32_MAX : delta; |
c277df42 IZ |
1429 | if (flags & SCF_DO_SUBSTR && is_inf) |
1430 | data->pos_delta = I32_MAX - data->pos_min; | |
1431 | if (is_par > U8_MAX) | |
1432 | is_par = 0; | |
1433 | if (is_par && pars==1 && data) { | |
1434 | data->flags |= SF_IN_PAR; | |
1435 | data->flags &= ~SF_HAS_PAR; | |
a0ed51b3 LW |
1436 | } |
1437 | else if (pars && data) { | |
c277df42 IZ |
1438 | data->flags |= SF_HAS_PAR; |
1439 | data->flags &= ~SF_IN_PAR; | |
1440 | } | |
653099ff GS |
1441 | if (flags & SCF_DO_STCLASS_OR) |
1442 | cl_and(data->start_class, &and_with); | |
c277df42 IZ |
1443 | return min; |
1444 | } | |
1445 | ||
76e3520e | 1446 | STATIC I32 |
cea2e8a9 | 1447 | S_add_data(pTHX_ I32 n, char *s) |
c277df42 | 1448 | { |
5c0ca799 | 1449 | dTHR; |
3280af22 NIS |
1450 | if (PL_regcomp_rx->data) { |
1451 | Renewc(PL_regcomp_rx->data, | |
1452 | sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1), | |
c277df42 | 1453 | char, struct reg_data); |
3280af22 NIS |
1454 | Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8); |
1455 | PL_regcomp_rx->data->count += n; | |
a0ed51b3 LW |
1456 | } |
1457 | else { | |
3280af22 | 1458 | Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1), |
c277df42 | 1459 | char, struct reg_data); |
3280af22 NIS |
1460 | New(1208, PL_regcomp_rx->data->what, n, U8); |
1461 | PL_regcomp_rx->data->count = n; | |
c277df42 | 1462 | } |
3280af22 NIS |
1463 | Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8); |
1464 | return PL_regcomp_rx->data->count - n; | |
c277df42 IZ |
1465 | } |
1466 | ||
d88dccdf | 1467 | void |
864dbfa3 | 1468 | Perl_reginitcolors(pTHX) |
d88dccdf IZ |
1469 | { |
1470 | dTHR; | |
1471 | int i = 0; | |
1472 | char *s = PerlEnv_getenv("PERL_RE_COLORS"); | |
1473 | ||
1474 | if (s) { | |
1475 | PL_colors[0] = s = savepv(s); | |
1476 | while (++i < 6) { | |
1477 | s = strchr(s, '\t'); | |
1478 | if (s) { | |
1479 | *s = '\0'; | |
1480 | PL_colors[i] = ++s; | |
1481 | } | |
1482 | else | |
c712d376 | 1483 | PL_colors[i] = s = ""; |
d88dccdf IZ |
1484 | } |
1485 | } else { | |
1486 | while (i < 6) | |
1487 | PL_colors[i++] = ""; | |
1488 | } | |
1489 | PL_colorset = 1; | |
1490 | } | |
1491 | ||
8615cb43 | 1492 | |
a687059c | 1493 | /* |
e50aee73 | 1494 | - pregcomp - compile a regular expression into internal code |
a687059c LW |
1495 | * |
1496 | * We can't allocate space until we know how big the compiled form will be, | |
1497 | * but we can't compile it (and thus know how big it is) until we've got a | |
1498 | * place to put the code. So we cheat: we compile it twice, once with code | |
1499 | * generation turned off and size counting turned on, and once "for real". | |
1500 | * This also means that we don't allocate space until we are sure that the | |
1501 | * thing really will compile successfully, and we never have to move the | |
1502 | * code and thus invalidate pointers into it. (Note that it has to be in | |
1503 | * one piece because free() must be able to free it all.) [NB: not true in perl] | |
1504 | * | |
1505 | * Beware that the optimization-preparation code in here knows about some | |
1506 | * of the structure of the compiled regexp. [I'll say.] | |
1507 | */ | |
1508 | regexp * | |
864dbfa3 | 1509 | Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm) |
a687059c | 1510 | { |
5c0ca799 | 1511 | dTHR; |
a0d0e21e | 1512 | register regexp *r; |
c277df42 | 1513 | regnode *scan; |
c277df42 | 1514 | regnode *first; |
a0d0e21e | 1515 | I32 flags; |
a0d0e21e LW |
1516 | I32 minlen = 0; |
1517 | I32 sawplus = 0; | |
1518 | I32 sawopen = 0; | |
2c2d71f5 | 1519 | scan_data_t data; |
a0d0e21e LW |
1520 | |
1521 | if (exp == NULL) | |
c277df42 | 1522 | FAIL("NULL regexp argument"); |
a0d0e21e | 1523 | |
393fec97 | 1524 | if (pm->op_pmdynflags & PMdf_UTF8) { |
a0ed51b3 | 1525 | PL_reg_flags |= RF_utf8; |
7e2040f0 | 1526 | } |
a0ed51b3 LW |
1527 | else |
1528 | PL_reg_flags = 0; | |
1529 | ||
3280af22 | 1530 | PL_regprecomp = savepvn(exp, xend - exp); |
35ef4773 | 1531 | DEBUG_r(if (!PL_colorset) reginitcolors()); |
2c2d71f5 | 1532 | DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n", |
d88dccdf | 1533 | PL_colors[4],PL_colors[5],PL_colors[0], |
b900a521 | 1534 | (int)(xend - exp), PL_regprecomp, PL_colors[1])); |
3280af22 NIS |
1535 | PL_regflags = pm->op_pmflags; |
1536 | PL_regsawback = 0; | |
bbce6d69 | 1537 | |
3280af22 NIS |
1538 | PL_regseen = 0; |
1539 | PL_seen_zerolen = *exp == '^' ? -1 : 0; | |
1540 | PL_seen_evals = 0; | |
1541 | PL_extralen = 0; | |
c277df42 | 1542 | |
bbce6d69 | 1543 | /* First pass: determine size, legality. */ |
3280af22 NIS |
1544 | PL_regcomp_parse = exp; |
1545 | PL_regxend = xend; | |
1546 | PL_regnaughty = 0; | |
1547 | PL_regnpar = 1; | |
1548 | PL_regsize = 0L; | |
1549 | PL_regcode = &PL_regdummy; | |
2c2d71f5 | 1550 | PL_reg_whilem_seen = 0; |
85ddcde9 JH |
1551 | #if 0 /* REGC() is (currently) a NOP at the first pass. |
1552 | * Clever compilers notice this and complain. --jhi */ | |
cd439c50 | 1553 | REGC((U8)REG_MAGIC, (char*)PL_regcode); |
85ddcde9 | 1554 | #endif |
a0d0e21e | 1555 | if (reg(0, &flags) == NULL) { |
3280af22 NIS |
1556 | Safefree(PL_regprecomp); |
1557 | PL_regprecomp = Nullch; | |
a0d0e21e LW |
1558 | return(NULL); |
1559 | } | |
faccc32b | 1560 | DEBUG_r(PerlIO_printf(Perl_debug_log, "size %"IVdf" ", (IV)PL_regsize)); |
c277df42 | 1561 | |
c277df42 IZ |
1562 | /* Small enough for pointer-storage convention? |
1563 | If extralen==0, this means that we will not need long jumps. */ | |
3280af22 NIS |
1564 | if (PL_regsize >= 0x10000L && PL_extralen) |
1565 | PL_regsize += PL_extralen; | |
c277df42 | 1566 | else |
3280af22 | 1567 | PL_extralen = 0; |
2c2d71f5 JH |
1568 | if (PL_reg_whilem_seen > 15) |
1569 | PL_reg_whilem_seen = 15; | |
a0d0e21e | 1570 | |
bbce6d69 | 1571 | /* Allocate space and initialize. */ |
3280af22 | 1572 | Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode), |
c277df42 | 1573 | char, regexp); |
a0d0e21e | 1574 | if (r == NULL) |
b45f050a JF |
1575 | FAIL("Regexp out of space"); |
1576 | ||
0f79a09d GS |
1577 | #ifdef DEBUGGING |
1578 | /* avoid reading uninitialized memory in DEBUGGING code in study_chunk() */ | |
1579 | Zero(r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode), char); | |
1580 | #endif | |
c277df42 | 1581 | r->refcnt = 1; |
bbce6d69 | 1582 | r->prelen = xend - exp; |
3280af22 | 1583 | r->precomp = PL_regprecomp; |
cf93c79d IZ |
1584 | r->subbeg = NULL; |
1585 | r->reganch = pm->op_pmflags & PMf_COMPILETIME; | |
4327152a IZ |
1586 | r->nparens = PL_regnpar - 1; /* set early to validate backrefs */ |
1587 | ||
1588 | r->substrs = 0; /* Useful during FAIL. */ | |
1589 | r->startp = 0; /* Useful during FAIL. */ | |
1590 | r->endp = 0; /* Useful during FAIL. */ | |
1591 | ||
3280af22 | 1592 | PL_regcomp_rx = r; |
bbce6d69 | 1593 | |
1594 | /* Second pass: emit code. */ | |
3280af22 NIS |
1595 | PL_regcomp_parse = exp; |
1596 | PL_regxend = xend; | |
1597 | PL_regnaughty = 0; | |
1598 | PL_regnpar = 1; | |
1599 | PL_regcode = r->program; | |
2cd61cdb | 1600 | /* Store the count of eval-groups for security checks: */ |
3280af22 | 1601 | PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals); |
cd439c50 | 1602 | REGC((U8)REG_MAGIC, (char*) PL_regcode++); |
c277df42 | 1603 | r->data = 0; |
a0d0e21e LW |
1604 | if (reg(0, &flags) == NULL) |
1605 | return(NULL); | |
1606 | ||
1607 | /* Dig out information for optimizations. */ | |
cf93c79d | 1608 | r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */ |
3280af22 | 1609 | pm->op_pmflags = PL_regflags; |
a0ed51b3 LW |
1610 | if (UTF) |
1611 | r->reganch |= ROPT_UTF8; | |
c277df42 | 1612 | r->regstclass = NULL; |
a0ed51b3 LW |
1613 | if (PL_regnaughty >= 10) /* Probably an expensive pattern. */ |
1614 | r->reganch |= ROPT_NAUGHTY; | |
c277df42 | 1615 | scan = r->program + 1; /* First BRANCH. */ |
2779dcf1 IZ |
1616 | |
1617 | /* XXXX To minimize changes to RE engine we always allocate | |
1618 | 3-units-long substrs field. */ | |
1619 | Newz(1004, r->substrs, 1, struct reg_substr_data); | |
1620 | ||
2c2d71f5 | 1621 | StructCopy(&zero_scan_data, &data, scan_data_t); |
653099ff | 1622 | /* XXXX Should not we check for something else? Usually it is OPEN1... */ |
c277df42 | 1623 | if (OP(scan) != BRANCH) { /* Only one top-level choice. */ |
c277df42 | 1624 | I32 fake; |
c5254dd6 | 1625 | STRLEN longest_float_length, longest_fixed_length; |
653099ff GS |
1626 | struct regnode_charclass_class ch_class; |
1627 | int stclass_flag; | |
a0d0e21e LW |
1628 | |
1629 | first = scan; | |
c277df42 | 1630 | /* Skip introductions and multiplicators >= 1. */ |
a0d0e21e | 1631 | while ((OP(first) == OPEN && (sawopen = 1)) || |
653099ff | 1632 | /* An OR of *one* alternative - should not happen now. */ |
a0d0e21e LW |
1633 | (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) || |
1634 | (OP(first) == PLUS) || | |
1635 | (OP(first) == MINMOD) || | |
653099ff | 1636 | /* An {n,m} with n>0 */ |
22c35a8c | 1637 | (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) { |
a0d0e21e LW |
1638 | if (OP(first) == PLUS) |
1639 | sawplus = 1; | |
1640 | else | |
1641 | first += regarglen[(U8)OP(first)]; | |
1642 | first = NEXTOPER(first); | |
a687059c LW |
1643 | } |
1644 | ||
a0d0e21e LW |
1645 | /* Starting-point info. */ |
1646 | again: | |
653099ff | 1647 | if (PL_regkind[(U8)OP(first)] == EXACT) { |
b3c9acc1 IZ |
1648 | if (OP(first) == EXACT); /* Empty, get anchored substr later. */ |
1649 | else if ((OP(first) == EXACTF || OP(first) == EXACTFL) | |
1650 | && !UTF) | |
1651 | r->regstclass = first; | |
1652 | } | |
653099ff | 1653 | else if (strchr((char*)PL_simple,OP(first))) |
a0d0e21e | 1654 | r->regstclass = first; |
22c35a8c GS |
1655 | else if (PL_regkind[(U8)OP(first)] == BOUND || |
1656 | PL_regkind[(U8)OP(first)] == NBOUND) | |
a0d0e21e | 1657 | r->regstclass = first; |
22c35a8c | 1658 | else if (PL_regkind[(U8)OP(first)] == BOL) { |
cad2e5aa JH |
1659 | r->reganch |= (OP(first) == MBOL |
1660 | ? ROPT_ANCH_MBOL | |
1661 | : (OP(first) == SBOL | |
1662 | ? ROPT_ANCH_SBOL | |
1663 | : ROPT_ANCH_BOL)); | |
a0d0e21e | 1664 | first = NEXTOPER(first); |
774d564b | 1665 | goto again; |
1666 | } | |
1667 | else if (OP(first) == GPOS) { | |
1668 | r->reganch |= ROPT_ANCH_GPOS; | |
1669 | first = NEXTOPER(first); | |
1670 | goto again; | |
a0d0e21e LW |
1671 | } |
1672 | else if ((OP(first) == STAR && | |
22c35a8c | 1673 | PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) && |
a0d0e21e LW |
1674 | !(r->reganch & ROPT_ANCH) ) |
1675 | { | |
1676 | /* turn .* into ^.* with an implied $*=1 */ | |
cad2e5aa JH |
1677 | int type = OP(NEXTOPER(first)); |
1678 | ||
1679 | if (type == REG_ANY || type == ANYUTF8) | |
1680 | type = ROPT_ANCH_MBOL; | |
1681 | else | |
1682 | type = ROPT_ANCH_SBOL; | |
1683 | ||
1684 | r->reganch |= type | ROPT_IMPLICIT; | |
a0d0e21e | 1685 | first = NEXTOPER(first); |
774d564b | 1686 | goto again; |
a0d0e21e | 1687 | } |
cad2e5aa JH |
1688 | if (sawplus && (!sawopen || !PL_regsawback) |
1689 | && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */ | |
1690 | /* x+ must match at the 1st pos of run of x's */ | |
1691 | r->reganch |= ROPT_SKIP; | |
a0d0e21e | 1692 | |
c277df42 | 1693 | /* Scan is after the zeroth branch, first is atomic matcher. */ |
b900a521 JH |
1694 | DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %"IVdf"\n", |
1695 | (IV)(first - scan + 1))); | |
a0d0e21e LW |
1696 | /* |
1697 | * If there's something expensive in the r.e., find the | |
1698 | * longest literal string that must appear and make it the | |
1699 | * regmust. Resolve ties in favor of later strings, since | |
1700 | * the regstart check works with the beginning of the r.e. | |
1701 | * and avoiding duplication strengthens checking. Not a | |
1702 | * strong reason, but sufficient in the absence of others. | |
1703 | * [Now we resolve ties in favor of the earlier string if | |
c277df42 | 1704 | * it happens that c_offset_min has been invalidated, since the |
a0d0e21e LW |
1705 | * earlier string may buy us something the later one won't.] |
1706 | */ | |
a0d0e21e | 1707 | minlen = 0; |
a687059c | 1708 | |
79cb57f6 GS |
1709 | data.longest_fixed = newSVpvn("",0); |
1710 | data.longest_float = newSVpvn("",0); | |
1711 | data.last_found = newSVpvn("",0); | |
c277df42 IZ |
1712 | data.longest = &(data.longest_fixed); |
1713 | first = scan; | |
653099ff GS |
1714 | if (!r->regstclass) { |
1715 | cl_init(&ch_class); | |
1716 | data.start_class = &ch_class; | |
1717 | stclass_flag = SCF_DO_STCLASS_AND; | |
1718 | } else /* XXXX Check for BOUND? */ | |
1719 | stclass_flag = 0; | |
1720 | ||
3280af22 | 1721 | minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */ |
653099ff | 1722 | &data, SCF_DO_SUBSTR | stclass_flag); |
3280af22 | 1723 | if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed) |
c277df42 | 1724 | && data.last_start_min == 0 && data.last_end > 0 |
3280af22 NIS |
1725 | && !PL_seen_zerolen |
1726 | && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS))) | |
c277df42 IZ |
1727 | r->reganch |= ROPT_CHECK_ALL; |
1728 | scan_commit(&data); | |
1729 | SvREFCNT_dec(data.last_found); | |
1730 | ||
a0ed51b3 | 1731 | longest_float_length = CHR_SVLEN(data.longest_float); |
c5254dd6 | 1732 | if (longest_float_length |
c277df42 IZ |
1733 | || (data.flags & SF_FL_BEFORE_EOL |
1734 | && (!(data.flags & SF_FL_BEFORE_MEOL) | |
3280af22 | 1735 | || (PL_regflags & PMf_MULTILINE)))) { |
cf93c79d IZ |
1736 | int t; |
1737 | ||
a0ed51b3 | 1738 | if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */ |
aca2d497 IZ |
1739 | && data.offset_fixed == data.offset_float_min |
1740 | && SvCUR(data.longest_fixed) == SvCUR(data.longest_float)) | |
1741 | goto remove_float; /* As in (a)+. */ | |
1742 | ||
c277df42 IZ |
1743 | r->float_substr = data.longest_float; |
1744 | r->float_min_offset = data.offset_float_min; | |
1745 | r->float_max_offset = data.offset_float_max; | |
cf93c79d IZ |
1746 | t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */ |
1747 | && (!(data.flags & SF_FL_BEFORE_MEOL) | |
1748 | || (PL_regflags & PMf_MULTILINE))); | |
1749 | fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0); | |
a0ed51b3 LW |
1750 | } |
1751 | else { | |
aca2d497 | 1752 | remove_float: |
c277df42 IZ |
1753 | r->float_substr = Nullsv; |
1754 | SvREFCNT_dec(data.longest_float); | |
c5254dd6 | 1755 | longest_float_length = 0; |
a0d0e21e | 1756 | } |
c277df42 | 1757 | |
a0ed51b3 | 1758 | longest_fixed_length = CHR_SVLEN(data.longest_fixed); |
c5254dd6 | 1759 | if (longest_fixed_length |
c277df42 IZ |
1760 | || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */ |
1761 | && (!(data.flags & SF_FIX_BEFORE_MEOL) | |
3280af22 | 1762 | || (PL_regflags & PMf_MULTILINE)))) { |
cf93c79d IZ |
1763 | int t; |
1764 | ||
c277df42 IZ |
1765 | r->anchored_substr = data.longest_fixed; |
1766 | r->anchored_offset = data.offset_fixed; | |
cf93c79d IZ |
1767 | t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */ |
1768 | && (!(data.flags & SF_FIX_BEFORE_MEOL) | |
1769 | || (PL_regflags & PMf_MULTILINE))); | |
1770 | fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0); | |
a0ed51b3 LW |
1771 | } |
1772 | else { | |
c277df42 IZ |
1773 | r->anchored_substr = Nullsv; |
1774 | SvREFCNT_dec(data.longest_fixed); | |
c5254dd6 | 1775 | longest_fixed_length = 0; |
a0d0e21e | 1776 | } |
653099ff GS |
1777 | if (r->regstclass |
1778 | && (OP(r->regstclass) == REG_ANY || OP(r->regstclass) == ANYUTF8 | |
1779 | || OP(r->regstclass) == SANYUTF8 || OP(r->regstclass) == SANY)) | |
1780 | r->regstclass = NULL; | |
1781 | if ((!r->anchored_substr || r->anchored_offset) && stclass_flag | |
1782 | && !(data.start_class->flags & ANYOF_EOS) | |
1783 | && !cl_is_anything(data.start_class)) { | |
1784 | SV *sv; | |
1785 | I32 n = add_data(1, "f"); | |
1786 | ||
1787 | New(1006, PL_regcomp_rx->data->data[n], 1, | |
1788 | struct regnode_charclass_class); | |
1789 | StructCopy(data.start_class, | |
1790 | (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n], | |
1791 | struct regnode_charclass_class); | |
1792 | r->regstclass = (regnode*)PL_regcomp_rx->data->data[n]; | |
1793 | r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */ | |
1794 | DEBUG_r((sv = sv_newmortal(), | |
1795 | regprop(sv, (regnode*)data.start_class), | |
894356b3 | 1796 | PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n", |
653099ff GS |
1797 | SvPVX(sv)))); |
1798 | } | |
c277df42 IZ |
1799 | |
1800 | /* A temporary algorithm prefers floated substr to fixed one to dig more info. */ | |
c5254dd6 | 1801 | if (longest_fixed_length > longest_float_length) { |
c277df42 IZ |
1802 | r->check_substr = r->anchored_substr; |
1803 | r->check_offset_min = r->check_offset_max = r->anchored_offset; | |
1804 | if (r->reganch & ROPT_ANCH_SINGLE) | |
1805 | r->reganch |= ROPT_NOSCAN; | |
a0ed51b3 LW |
1806 | } |
1807 | else { | |
c277df42 IZ |
1808 | r->check_substr = r->float_substr; |
1809 | r->check_offset_min = data.offset_float_min; | |
1810 | r->check_offset_max = data.offset_float_max; | |
a0d0e21e | 1811 | } |
30382c73 IZ |
1812 | /* XXXX Currently intuiting is not compatible with ANCH_GPOS. |
1813 | This should be changed ASAP! */ | |
1814 | if (r->check_substr && !(r->reganch & ROPT_ANCH_GPOS)) { | |
cad2e5aa JH |
1815 | r->reganch |= RE_USE_INTUIT; |
1816 | if (SvTAIL(r->check_substr)) | |
1817 | r->reganch |= RE_INTUIT_TAIL; | |
1818 | } | |
a0ed51b3 LW |
1819 | } |
1820 | else { | |
c277df42 IZ |
1821 | /* Several toplevels. Best we can is to set minlen. */ |
1822 | I32 fake; | |
653099ff | 1823 | struct regnode_charclass_class ch_class; |
c277df42 IZ |
1824 | |
1825 | DEBUG_r(PerlIO_printf(Perl_debug_log, "\n")); | |
1826 | scan = r->program + 1; | |
653099ff GS |
1827 | cl_init(&ch_class); |
1828 | data.start_class = &ch_class; | |
1829 | minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, SCF_DO_STCLASS_AND); | |
c277df42 | 1830 | r->check_substr = r->anchored_substr = r->float_substr = Nullsv; |
653099ff GS |
1831 | if (!(data.start_class->flags & ANYOF_EOS) |
1832 | && !cl_is_anything(data.start_class)) { | |
1833 | SV *sv; | |
1834 | I32 n = add_data(1, "f"); | |
1835 | ||
1836 | New(1006, PL_regcomp_rx->data->data[n], 1, | |
1837 | struct regnode_charclass_class); | |
1838 | StructCopy(data.start_class, | |
1839 | (struct regnode_charclass_class*)PL_regcomp_rx->data->data[n], | |
1840 | struct regnode_charclass_class); | |
1841 | r->regstclass = (regnode*)PL_regcomp_rx->data->data[n]; | |
1842 | r->reganch &= ~ROPT_SKIP; /* Used in find_byclass(). */ | |
1843 | DEBUG_r((sv = sv_newmortal(), | |
1844 | regprop(sv, (regnode*)data.start_class), | |
894356b3 | 1845 | PerlIO_printf(Perl_debug_log, "synthetic stclass `%s'.\n", |
653099ff GS |
1846 | SvPVX(sv)))); |
1847 | } | |
a0d0e21e LW |
1848 | } |
1849 | ||
a0d0e21e | 1850 | r->minlen = minlen; |
3280af22 | 1851 | if (PL_regseen & REG_SEEN_GPOS) |
c277df42 | 1852 | r->reganch |= ROPT_GPOS_SEEN; |
3280af22 | 1853 | if (PL_regseen & REG_SEEN_LOOKBEHIND) |
c277df42 | 1854 | r->reganch |= ROPT_LOOKBEHIND_SEEN; |
3280af22 | 1855 | if (PL_regseen & REG_SEEN_EVAL) |
ce862d02 | 1856 | r->reganch |= ROPT_EVAL_SEEN; |
cf93c79d IZ |
1857 | Newz(1002, r->startp, PL_regnpar, I32); |
1858 | Newz(1002, r->endp, PL_regnpar, I32); | |
a0d0e21e LW |
1859 | DEBUG_r(regdump(r)); |
1860 | return(r); | |
a687059c LW |
1861 | } |
1862 | ||
1863 | /* | |
1864 | - reg - regular expression, i.e. main body or parenthesized thing | |
1865 | * | |
1866 | * Caller must absorb opening parenthesis. | |
1867 | * | |
1868 | * Combining parenthesis handling with the base level of regular expression | |
1869 | * is a trifle forced, but the need to tie the tails of the branches to what | |
1870 | * follows makes it hard to avoid. | |
1871 | */ | |
76e3520e | 1872 | STATIC regnode * |
cea2e8a9 | 1873 | S_reg(pTHX_ I32 paren, I32 *flagp) |
c277df42 | 1874 | /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */ |
a687059c | 1875 | { |
5c0ca799 | 1876 | dTHR; |
c277df42 IZ |
1877 | register regnode *ret; /* Will be the head of the group. */ |
1878 | register regnode *br; | |
1879 | register regnode *lastbr; | |
1880 | register regnode *ender = 0; | |
a0d0e21e | 1881 | register I32 parno = 0; |
3280af22 | 1882 | I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0; |
b45f050a | 1883 | char *oregcomp_parse = PL_regcomp_parse; |
c277df42 | 1884 | char c; |
a0d0e21e | 1885 | |
821b33a5 | 1886 | *flagp = 0; /* Tentatively. */ |
a0d0e21e LW |
1887 | |
1888 | /* Make an OPEN node, if parenthesized. */ | |
1889 | if (paren) { | |
3280af22 | 1890 | if (*PL_regcomp_parse == '?') { |
ca9dfc88 IZ |
1891 | U16 posflags = 0, negflags = 0; |
1892 | U16 *flagsp = &posflags; | |
0f5d15d6 | 1893 | int logical = 0; |
b45f050a | 1894 | char *seqstart = PL_regcomp_parse; |
ca9dfc88 | 1895 | |
3280af22 NIS |
1896 | PL_regcomp_parse++; |
1897 | paren = *PL_regcomp_parse++; | |
c277df42 | 1898 | ret = NULL; /* For look-ahead/behind. */ |
a0d0e21e | 1899 | switch (paren) { |
c277df42 | 1900 | case '<': |
3280af22 NIS |
1901 | PL_regseen |= REG_SEEN_LOOKBEHIND; |
1902 | if (*PL_regcomp_parse == '!') | |
c277df42 | 1903 | paren = ','; |
3280af22 | 1904 | if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!') |
c277df42 | 1905 | goto unknown; |
3280af22 | 1906 | PL_regcomp_parse++; |
a0d0e21e LW |
1907 | case '=': |
1908 | case '!': | |
3280af22 | 1909 | PL_seen_zerolen++; |
c277df42 IZ |
1910 | case ':': |
1911 | case '>': | |
a0d0e21e LW |
1912 | break; |
1913 | case '$': | |
1914 | case '@': | |
8615cb43 | 1915 | vFAIL2("Sequence (?%c...) not implemented", (int)paren); |
a0d0e21e LW |
1916 | break; |
1917 | case '#': | |
3280af22 NIS |
1918 | while (*PL_regcomp_parse && *PL_regcomp_parse != ')') |
1919 | PL_regcomp_parse++; | |
1920 | if (*PL_regcomp_parse != ')') | |
c277df42 | 1921 | FAIL("Sequence (?#... not terminated"); |
a0d0e21e LW |
1922 | nextchar(); |
1923 | *flagp = TRYAGAIN; | |
1924 | return NULL; | |
8c8ad484 | 1925 | case 'p': |
d7e9e385 | 1926 | if (SIZE_ONLY) |
b45f050a | 1927 | vWARN(PL_regcomp_parse, "(?p{}) is deprecated - use (??{})"); |
8c8ad484 | 1928 | /* FALL THROUGH*/ |
14455d6c | 1929 | case '?': |
0f5d15d6 IZ |
1930 | logical = 1; |
1931 | paren = *PL_regcomp_parse++; | |
1932 | /* FALL THROUGH */ | |
c277df42 IZ |
1933 | case '{': |
1934 | { | |
1935 | dTHR; | |
1936 | I32 count = 1, n = 0; | |
1937 | char c; | |
3280af22 | 1938 | char *s = PL_regcomp_parse; |
c277df42 IZ |
1939 | SV *sv; |
1940 | OP_4tree *sop, *rop; | |
1941 | ||
3280af22 NIS |
1942 | PL_seen_zerolen++; |
1943 | PL_regseen |= REG_SEEN_EVAL; | |
1944 | while (count && (c = *PL_regcomp_parse)) { | |
1945 | if (c == '\\' && PL_regcomp_parse[1]) | |
1946 | PL_regcomp_parse++; | |
c277df42 IZ |
1947 | else if (c == '{') |
1948 | count++; | |
1949 | else if (c == '}') | |
1950 | count--; | |
3280af22 | 1951 | PL_regcomp_parse++; |
c277df42 | 1952 | } |
3280af22 | 1953 | if (*PL_regcomp_parse != ')') |
b45f050a JF |
1954 | { |
1955 | PL_regcomp_parse = s; | |
1956 | vFAIL("Sequence (?{...}) not terminated or not {}-balanced"); | |
1957 | } | |
c277df42 IZ |
1958 | if (!SIZE_ONLY) { |
1959 | AV *av; | |
1960 | ||
3280af22 | 1961 | if (PL_regcomp_parse - 1 - s) |
79cb57f6 | 1962 | sv = newSVpvn(s, PL_regcomp_parse - 1 - s); |
c277df42 | 1963 | else |
79cb57f6 | 1964 | sv = newSVpvn("", 0); |
c277df42 IZ |
1965 | |
1966 | rop = sv_compile_2op(sv, &sop, "re", &av); | |
1967 | ||
dfad63ad | 1968 | n = add_data(3, "nop"); |
3280af22 | 1969 | PL_regcomp_rx->data->data[n] = (void*)rop; |
dfad63ad HS |
1970 | PL_regcomp_rx->data->data[n+1] = (void*)sop; |
1971 | PL_regcomp_rx->data->data[n+2] = (void*)av; | |
c277df42 | 1972 | SvREFCNT_dec(sv); |
a0ed51b3 | 1973 | } |
e24b16f9 GS |
1974 | else { /* First pass */ |
1975 | if (PL_reginterp_cnt < ++PL_seen_evals | |
1976 | && PL_curcop != &PL_compiling) | |
2cd61cdb IZ |
1977 | /* No compiled RE interpolated, has runtime |
1978 | components ===> unsafe. */ | |
1979 | FAIL("Eval-group not allowed at runtime, use re 'eval'"); | |
3280af22 | 1980 | if (PL_tainted) |
cc6b7395 | 1981 | FAIL("Eval-group in insecure regular expression"); |
c277df42 IZ |
1982 | } |
1983 | ||
1984 | nextchar(); | |
0f5d15d6 IZ |
1985 | if (logical) { |
1986 | ret = reg_node(LOGICAL); | |
1987 | if (!SIZE_ONLY) | |
1988 | ret->flags = 2; | |
1989 | regtail(ret, reganode(EVAL, n)); | |
1990 | return ret; | |
1991 | } | |
c277df42 IZ |
1992 | return reganode(EVAL, n); |
1993 | } | |
1994 | case '(': | |
1995 | { | |
3280af22 NIS |
1996 | if (PL_regcomp_parse[0] == '?') { |
1997 | if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!' | |
1998 | || PL_regcomp_parse[1] == '<' | |
1999 | || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */ | |
c277df42 IZ |
2000 | I32 flag; |
2001 | ||
2002 | ret = reg_node(LOGICAL); | |
0f5d15d6 IZ |
2003 | if (!SIZE_ONLY) |
2004 | ret->flags = 1; | |
c277df42 IZ |
2005 | regtail(ret, reg(1, &flag)); |
2006 | goto insert_if; | |
2007 | } | |
a0ed51b3 LW |
2008 | } |
2009 | else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) { | |
3280af22 | 2010 | parno = atoi(PL_regcomp_parse++); |
c277df42 | 2011 | |
3280af22 NIS |
2012 | while (isDIGIT(*PL_regcomp_parse)) |
2013 | PL_regcomp_parse++; | |
c277df42 IZ |
2014 | ret = reganode(GROUPP, parno); |
2015 | if ((c = *nextchar()) != ')') | |
b45f050a | 2016 | vFAIL("Switch condition not recognized"); |
c277df42 IZ |
2017 | insert_if: |
2018 | regtail(ret, reganode(IFTHEN, 0)); | |
2019 | br = regbranch(&flags, 1); | |
2020 | if (br == NULL) | |
2021 | br = reganode(LONGJMP, 0); | |
2022 | else | |
2023 | regtail(br, reganode(LONGJMP, 0)); | |
2024 | c = *nextchar(); | |
d1b80229 IZ |
2025 | if (flags&HASWIDTH) |
2026 | *flagp |= HASWIDTH; | |
c277df42 IZ |
2027 | if (c == '|') { |
2028 | lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */ | |
2029 | regbranch(&flags, 1); | |
2030 | regtail(ret, lastbr); | |
d1b80229 IZ |
2031 | if (flags&HASWIDTH) |
2032 | *flagp |= HASWIDTH; | |
c277df42 | 2033 | c = *nextchar(); |
a0ed51b3 LW |
2034 | } |
2035 | else | |
c277df42 IZ |
2036 | lastbr = NULL; |
2037 | if (c != ')') | |
8615cb43 | 2038 | vFAIL("Switch (?(condition)... contains too many branches"); |
c277df42 IZ |
2039 | ender = reg_node(TAIL); |
2040 | regtail(br, ender); | |
2041 | if (lastbr) { | |
2042 | regtail(lastbr, ender); | |
2043 | regtail(NEXTOPER(NEXTOPER(lastbr)), ender); | |
a0ed51b3 LW |
2044 | } |
2045 | else | |
c277df42 IZ |
2046 | regtail(ret, ender); |
2047 | return ret; | |
a0ed51b3 LW |
2048 | } |
2049 | else { | |
b45f050a | 2050 | vFAIL2("Unknown switch condition (?(%.2s", PL_regcomp_parse); |
c277df42 IZ |
2051 | } |
2052 | } | |
1b1626e4 | 2053 | case 0: |
b45f050a | 2054 | PL_regcomp_parse--; /* for vFAIL to print correctly */ |
8615cb43 | 2055 | vFAIL("Sequence (? incomplete"); |
1b1626e4 | 2056 | break; |
a0d0e21e | 2057 | default: |
3280af22 | 2058 | --PL_regcomp_parse; |
ca9dfc88 | 2059 | parse_flags: |
3280af22 NIS |
2060 | while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) { |
2061 | if (*PL_regcomp_parse != 'o') | |
2062 | pmflag(flagsp, *PL_regcomp_parse); | |
2063 | ++PL_regcomp_parse; | |
ca9dfc88 | 2064 | } |
3280af22 | 2065 | if (*PL_regcomp_parse == '-') { |
ca9dfc88 | 2066 | flagsp = &negflags; |
3280af22 | 2067 | ++PL_regcomp_parse; |
ca9dfc88 | 2068 | goto parse_flags; |
48c036b1 | 2069 | } |
3280af22 NIS |
2070 | PL_regflags |= posflags; |
2071 | PL_regflags &= ~negflags; | |
2072 | if (*PL_regcomp_parse == ':') { | |
2073 | PL_regcomp_parse++; | |
ca9dfc88 IZ |
2074 | paren = ':'; |
2075 | break; | |
2076 | } | |
c277df42 | 2077 | unknown: |
b45f050a JF |
2078 | if (*PL_regcomp_parse != ')') { |
2079 | PL_regcomp_parse++; | |
2080 | vFAIL3("Sequence (%.*s...) not recognized", PL_regcomp_parse-seqstart, seqstart); | |
2081 | } | |
a0d0e21e LW |
2082 | nextchar(); |
2083 | *flagp = TRYAGAIN; | |
2084 | return NULL; | |
2085 | } | |
2086 | } | |
2087 | else { | |
3280af22 NIS |
2088 | parno = PL_regnpar; |
2089 | PL_regnpar++; | |
a0d0e21e | 2090 | ret = reganode(OPEN, parno); |
c277df42 | 2091 | open = 1; |
a0d0e21e | 2092 | } |
a0ed51b3 LW |
2093 | } |
2094 | else | |
a0d0e21e LW |
2095 | ret = NULL; |
2096 | ||
2097 | /* Pick up the branches, linking them together. */ | |
c277df42 | 2098 | br = regbranch(&flags, 1); |
a0d0e21e LW |
2099 | if (br == NULL) |
2100 | return(NULL); | |
3280af22 NIS |
2101 | if (*PL_regcomp_parse == '|') { |
2102 | if (!SIZE_ONLY && PL_extralen) { | |
c277df42 | 2103 | reginsert(BRANCHJ, br); |
a0ed51b3 LW |
2104 | } |
2105 | else | |
c277df42 IZ |
2106 | reginsert(BRANCH, br); |
2107 | have_branch = 1; | |
2108 | if (SIZE_ONLY) | |
3280af22 | 2109 | PL_extralen += 1; /* For BRANCHJ-BRANCH. */ |
a0ed51b3 LW |
2110 | } |
2111 | else if (paren == ':') { | |
c277df42 IZ |
2112 | *flagp |= flags&SIMPLE; |
2113 | } | |
2114 | if (open) { /* Starts with OPEN. */ | |
2115 | regtail(ret, br); /* OPEN -> first. */ | |
a0ed51b3 LW |
2116 | } |
2117 | else if (paren != '?') /* Not Conditional */ | |
a0d0e21e | 2118 | ret = br; |
821b33a5 IZ |
2119 | if (flags&HASWIDTH) |
2120 | *flagp |= HASWIDTH; | |
a0d0e21e | 2121 | *flagp |= flags&SPSTART; |
c277df42 | 2122 | lastbr = br; |
3280af22 NIS |
2123 | while (*PL_regcomp_parse == '|') { |
2124 | if (!SIZE_ONLY && PL_extralen) { | |
c277df42 IZ |
2125 | ender = reganode(LONGJMP,0); |
2126 | regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */ | |
2127 | } | |
2128 | if (SIZE_ONLY) | |
3280af22 | 2129 | PL_extralen += 2; /* Account for LONGJMP. */ |
a0d0e21e | 2130 | nextchar(); |
c277df42 | 2131 | br = regbranch(&flags, 0); |
a687059c | 2132 | if (br == NULL) |
a0d0e21e | 2133 | return(NULL); |
c277df42 IZ |
2134 | regtail(lastbr, br); /* BRANCH -> BRANCH. */ |
2135 | lastbr = br; | |
821b33a5 IZ |
2136 | if (flags&HASWIDTH) |
2137 | *flagp |= HASWIDTH; | |
a687059c | 2138 | *flagp |= flags&SPSTART; |
a0d0e21e LW |
2139 | } |
2140 | ||
c277df42 IZ |
2141 | if (have_branch || paren != ':') { |
2142 | /* Make a closing node, and hook it on the end. */ | |
2143 | switch (paren) { | |
2144 | case ':': | |
2145 | ender = reg_node(TAIL); | |
2146 | break; | |
2147 | case 1: | |
2148 | ender = reganode(CLOSE, parno); | |
2149 | break; | |
2150 | case '<': | |
c277df42 IZ |
2151 | case ',': |
2152 | case '=': | |
2153 | case '!': | |
c277df42 | 2154 | *flagp &= ~HASWIDTH; |
821b33a5 IZ |
2155 | /* FALL THROUGH */ |
2156 | case '>': | |
2157 | ender = reg_node(SUCCEED); | |
c277df42 IZ |
2158 | break; |
2159 | case 0: | |
2160 | ender = reg_node(END); | |
2161 | break; | |
2162 | } | |
2163 | regtail(lastbr, ender); | |
a0d0e21e | 2164 | |
c277df42 IZ |
2165 | if (have_branch) { |
2166 | /* Hook the tails of the branches to the closing node. */ | |
2167 | for (br = ret; br != NULL; br = regnext(br)) { | |
2168 | regoptail(br, ender); | |
2169 | } | |
2170 | } | |
a0d0e21e | 2171 | } |
c277df42 IZ |
2172 | |
2173 | { | |
2174 | char *p; | |
2175 | static char parens[] = "=!<,>"; | |
2176 | ||
2177 | if (paren && (p = strchr(parens, paren))) { | |
2178 | int node = ((p - parens) % 2) ? UNLESSM : IFMATCH; | |
2179 | int flag = (p - parens) > 1; | |
2180 | ||
2181 | if (paren == '>') | |
2182 | node = SUSPEND, flag = 0; | |
2183 | reginsert(node,ret); | |
c277df42 | 2184 | ret->flags = flag; |
c277df42 IZ |
2185 | regtail(ret, reg_node(TAIL)); |
2186 | } | |
a0d0e21e LW |
2187 | } |
2188 | ||
2189 | /* Check for proper termination. */ | |
ce3e6498 HS |
2190 | if (paren) { |
2191 | PL_regflags = oregflags; | |
2192 | if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') { | |
380a0633 JH |
2193 | PL_regcomp_parse = oregcomp_parse; |
2194 | vFAIL("Unmatched ("); | |
ce3e6498 | 2195 | } |
a0ed51b3 LW |
2196 | } |
2197 | else if (!paren && PL_regcomp_parse < PL_regxend) { | |
3280af22 | 2198 | if (*PL_regcomp_parse == ')') { |
380a0633 JH |
2199 | PL_regcomp_parse++; |
2200 | vFAIL("Unmatched )"); | |
a0ed51b3 LW |
2201 | } |
2202 | else | |
b45f050a | 2203 | FAIL("Junk on end of regexp"); /* "Can't happen". */ |
a0d0e21e LW |
2204 | /* NOTREACHED */ |
2205 | } | |
a687059c | 2206 | |
a0d0e21e | 2207 | return(ret); |
a687059c LW |
2208 | } |
2209 | ||
2210 | /* | |
2211 | - regbranch - one alternative of an | operator | |
2212 | * | |
2213 | * Implements the concatenation operator. | |
2214 | */ | |
76e3520e | 2215 | STATIC regnode * |
cea2e8a9 | 2216 | S_regbranch(pTHX_ I32 *flagp, I32 first) |
a687059c | 2217 | { |
5c0ca799 | 2218 | dTHR; |
c277df42 IZ |
2219 | register regnode *ret; |
2220 | register regnode *chain = NULL; | |
2221 | register regnode *latest; | |
2222 | I32 flags = 0, c = 0; | |
a0d0e21e | 2223 | |
c277df42 IZ |
2224 | if (first) |
2225 | ret = NULL; | |
2226 | else { | |
3280af22 | 2227 | if (!SIZE_ONLY && PL_extralen) |
c277df42 IZ |
2228 | ret = reganode(BRANCHJ,0); |
2229 | else | |
2230 | ret = reg_node(BRANCH); | |
2231 | } | |
2232 | ||
2233 | if (!first && SIZE_ONLY) | |
3280af22 | 2234 | PL_extralen += 1; /* BRANCHJ */ |
c277df42 IZ |
2235 | |
2236 | *flagp = WORST; /* Tentatively. */ | |
a0d0e21e | 2237 | |
3280af22 | 2238 | PL_regcomp_parse--; |
a0d0e21e | 2239 | nextchar(); |
3280af22 | 2240 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') { |
a0d0e21e LW |
2241 | flags &= ~TRYAGAIN; |
2242 | latest = regpiece(&flags); | |
2243 | if (latest == NULL) { | |
2244 | if (flags & TRYAGAIN) | |
2245 | continue; | |
2246 | return(NULL); | |
a0ed51b3 LW |
2247 | } |
2248 | else if (ret == NULL) | |
c277df42 | 2249 | ret = latest; |
a0d0e21e | 2250 | *flagp |= flags&HASWIDTH; |
c277df42 | 2251 | if (chain == NULL) /* First piece. */ |
a0d0e21e LW |
2252 | *flagp |= flags&SPSTART; |
2253 | else { | |
3280af22 | 2254 | PL_regnaughty++; |
a0d0e21e | 2255 | regtail(chain, latest); |
a687059c | 2256 | } |
a0d0e21e | 2257 | chain = latest; |
c277df42 IZ |
2258 | c++; |
2259 | } | |
2260 | if (chain == NULL) { /* Loop ran zero times. */ | |
2261 | chain = reg_node(NOTHING); | |
2262 | if (ret == NULL) | |
2263 | ret = chain; | |
2264 | } | |
2265 | if (c == 1) { | |
2266 | *flagp |= flags&SIMPLE; | |
a0d0e21e | 2267 | } |
a687059c | 2268 | |
a0d0e21e | 2269 | return(ret); |
a687059c LW |
2270 | } |
2271 | ||
2272 | /* | |
2273 | - regpiece - something followed by possible [*+?] | |
2274 | * | |
2275 | * Note that the branching code sequences used for ? and the general cases | |
2276 | * of * and + are somewhat optimized: they use the same NOTHING node as | |
2277 | * both the endmarker for their branch list and the body of the last branch. | |
2278 | * It might seem that this node could be dispensed with entirely, but the | |
2279 | * endmarker role is not redundant. | |
2280 | */ | |
76e3520e | 2281 | STATIC regnode * |
cea2e8a9 | 2282 | S_regpiece(pTHX_ I32 *flagp) |
a687059c | 2283 | { |
5c0ca799 | 2284 | dTHR; |
c277df42 | 2285 | register regnode *ret; |
a0d0e21e LW |
2286 | register char op; |
2287 | register char *next; | |
2288 | I32 flags; | |
3280af22 | 2289 | char *origparse = PL_regcomp_parse; |
a0d0e21e LW |
2290 | char *maxpos; |
2291 | I32 min; | |
c277df42 | 2292 | I32 max = REG_INFTY; |
a0d0e21e LW |
2293 | |
2294 | ret = regatom(&flags); | |
2295 | if (ret == NULL) { | |
2296 | if (flags & TRYAGAIN) | |
2297 | *flagp |= TRYAGAIN; | |
2298 | return(NULL); | |
2299 | } | |
2300 | ||
3280af22 | 2301 | op = *PL_regcomp_parse; |
a0d0e21e | 2302 | |
3280af22 NIS |
2303 | if (op == '{' && regcurly(PL_regcomp_parse)) { |
2304 | next = PL_regcomp_parse + 1; | |
a0d0e21e LW |
2305 | maxpos = Nullch; |
2306 | while (isDIGIT(*next) || *next == ',') { | |
2307 | if (*next == ',') { | |
2308 | if (maxpos) | |
2309 | break; | |
2310 | else | |
2311 | maxpos = next; | |
a687059c | 2312 | } |
a0d0e21e LW |
2313 | next++; |
2314 | } | |
2315 | if (*next == '}') { /* got one */ | |
2316 | if (!maxpos) | |
2317 | maxpos = next; | |
3280af22 NIS |
2318 | PL_regcomp_parse++; |
2319 | min = atoi(PL_regcomp_parse); | |
a0d0e21e LW |
2320 | if (*maxpos == ',') |
2321 | maxpos++; | |
2322 | else | |
3280af22 | 2323 | maxpos = PL_regcomp_parse; |
a0d0e21e LW |
2324 | max = atoi(maxpos); |
2325 | if (!max && *maxpos != '0') | |
c277df42 IZ |
2326 | max = REG_INFTY; /* meaning "infinity" */ |
2327 | else if (max >= REG_INFTY) | |
8615cb43 | 2328 | vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1); |
3280af22 | 2329 | PL_regcomp_parse = next; |
a0d0e21e LW |
2330 | nextchar(); |
2331 | ||
2332 | do_curly: | |
2333 | if ((flags&SIMPLE)) { | |
3280af22 | 2334 | PL_regnaughty += 2 + PL_regnaughty / 2; |
a0d0e21e LW |
2335 | reginsert(CURLY, ret); |
2336 | } | |
2337 | else { | |
2c2d71f5 JH |
2338 | regnode *w = reg_node(WHILEM); |
2339 | ||
2340 | w->flags = 0; | |
2341 | regtail(ret, w); | |
3280af22 | 2342 | if (!SIZE_ONLY && PL_extralen) { |
c277df42 IZ |
2343 | reginsert(LONGJMP,ret); |
2344 | reginsert(NOTHING,ret); | |
2345 | NEXT_OFF(ret) = 3; /* Go over LONGJMP. */ | |
2346 | } | |
a0d0e21e | 2347 | reginsert(CURLYX,ret); |
3280af22 | 2348 | if (!SIZE_ONLY && PL_extralen) |
c277df42 IZ |
2349 | NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */ |
2350 | regtail(ret, reg_node(NOTHING)); | |
2351 | if (SIZE_ONLY) | |
2c2d71f5 JH |
2352 | PL_reg_whilem_seen++, PL_extralen += 3; |
2353 | PL_regnaughty += 4 + PL_regnaughty; /* compound interest */ | |
a0d0e21e | 2354 | } |
c277df42 | 2355 | ret->flags = 0; |
a0d0e21e LW |
2356 | |
2357 | if (min > 0) | |
821b33a5 IZ |
2358 | *flagp = WORST; |
2359 | if (max > 0) | |
2360 | *flagp |= HASWIDTH; | |
a0d0e21e | 2361 | if (max && max < min) |
8615cb43 | 2362 | vFAIL("Can't do {n,m} with n > m"); |
c277df42 IZ |
2363 | if (!SIZE_ONLY) { |
2364 | ARG1_SET(ret, min); | |
2365 | ARG2_SET(ret, max); | |
a687059c | 2366 | } |
a687059c | 2367 | |
a0d0e21e | 2368 | goto nest_check; |
a687059c | 2369 | } |
a0d0e21e | 2370 | } |
a687059c | 2371 | |
a0d0e21e LW |
2372 | if (!ISMULT1(op)) { |
2373 | *flagp = flags; | |
a687059c | 2374 | return(ret); |
a0d0e21e | 2375 | } |
bb20fd44 | 2376 | |
c277df42 | 2377 | #if 0 /* Now runtime fix should be reliable. */ |
b45f050a JF |
2378 | |
2379 | /* if this is reinstated, don't forget to put this back into perldiag: | |
2380 | ||
2381 | =item Regexp *+ operand could be empty at {#} in regex m/%s/ | |
2382 | ||
2383 | (F) The part of the regexp subject to either the * or + quantifier | |
2384 | could match an empty string. The {#} shows in the regular | |
2385 | expression about where the problem was discovered. | |
2386 | ||
2387 | */ | |
2388 | ||
bb20fd44 | 2389 | if (!(flags&HASWIDTH) && op != '?') |
b45f050a | 2390 | vFAIL("Regexp *+ operand could be empty"); |
c277df42 | 2391 | #endif |
bb20fd44 | 2392 | |
a0d0e21e LW |
2393 | nextchar(); |
2394 | ||
821b33a5 | 2395 | *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH); |
a0d0e21e LW |
2396 | |
2397 | if (op == '*' && (flags&SIMPLE)) { | |
2398 | reginsert(STAR, ret); | |
c277df42 | 2399 | ret->flags = 0; |
3280af22 | 2400 | PL_regnaughty += 4; |
a0d0e21e LW |
2401 | } |
2402 | else if (op == '*') { | |
2403 | min = 0; | |
2404 | goto do_curly; | |
a0ed51b3 LW |
2405 | } |
2406 | else if (op == '+' && (flags&SIMPLE)) { | |
a0d0e21e | 2407 | reginsert(PLUS, ret); |
c277df42 | 2408 | ret->flags = 0; |
3280af22 | 2409 | PL_regnaughty += 3; |
a0d0e21e LW |
2410 | } |
2411 | else if (op == '+') { | |
2412 | min = 1; | |
2413 | goto do_curly; | |
a0ed51b3 LW |
2414 | } |
2415 | else if (op == '?') { | |
a0d0e21e LW |
2416 | min = 0; max = 1; |
2417 | goto do_curly; | |
2418 | } | |
2419 | nest_check: | |
e476b1b5 | 2420 | if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) { |
b45f050a JF |
2421 | vWARN3(PL_regcomp_parse, |
2422 | "%.*s matches null string many times", | |
2423 | PL_regcomp_parse - origparse, | |
2424 | origparse); | |
a0d0e21e LW |
2425 | } |
2426 | ||
3280af22 | 2427 | if (*PL_regcomp_parse == '?') { |
a0d0e21e LW |
2428 | nextchar(); |
2429 | reginsert(MINMOD, ret); | |
c277df42 | 2430 | regtail(ret, ret + NODE_STEP_REGNODE); |
a0d0e21e | 2431 | } |
b45f050a JF |
2432 | if (ISMULT2(PL_regcomp_parse)) { |
2433 | PL_regcomp_parse++; | |
2434 | vFAIL("Nested quantifiers"); | |
2435 | } | |
a0d0e21e LW |
2436 | |
2437 | return(ret); | |
a687059c LW |
2438 | } |
2439 | ||
2440 | /* | |
2441 | - regatom - the lowest level | |
2442 | * | |
2443 | * Optimization: gobbles an entire sequence of ordinary characters so that | |
2444 | * it can turn them into a single node, which is smaller to store and | |
2445 | * faster to run. Backslashed characters are exceptions, each becoming a | |
2446 | * separate node; the code is simpler that way and it's not worth fixing. | |
2447 | * | |
b45f050a | 2448 | * [Yes, it is worth fixing, some scripts can run twice the speed.] */ |
76e3520e | 2449 | STATIC regnode * |
cea2e8a9 | 2450 | S_regatom(pTHX_ I32 *flagp) |
a687059c | 2451 | { |
5c0ca799 | 2452 | dTHR; |
c277df42 | 2453 | register regnode *ret = 0; |
a0d0e21e LW |
2454 | I32 flags; |
2455 | ||
2456 | *flagp = WORST; /* Tentatively. */ | |
2457 | ||
2458 | tryagain: | |
3280af22 | 2459 | switch (*PL_regcomp_parse) { |
a0d0e21e | 2460 | case '^': |
3280af22 | 2461 | PL_seen_zerolen++; |
a0d0e21e | 2462 | nextchar(); |
3280af22 | 2463 | if (PL_regflags & PMf_MULTILINE) |
c277df42 | 2464 | ret = reg_node(MBOL); |
3280af22 | 2465 | else if (PL_regflags & PMf_SINGLELINE) |
c277df42 | 2466 | ret = reg_node(SBOL); |
a0d0e21e | 2467 | else |
c277df42 | 2468 | ret = reg_node(BOL); |
a0d0e21e LW |
2469 | break; |
2470 | case '$': | |
3280af22 NIS |
2471 | if (PL_regcomp_parse[1]) |
2472 | PL_seen_zerolen++; | |
a0d0e21e | 2473 | nextchar(); |
3280af22 | 2474 | if (PL_regflags & PMf_MULTILINE) |
c277df42 | 2475 | ret = reg_node(MEOL); |
3280af22 | 2476 | else if (PL_regflags & PMf_SINGLELINE) |
c277df42 | 2477 | ret = reg_node(SEOL); |
a0d0e21e | 2478 | else |
c277df42 | 2479 | ret = reg_node(EOL); |
a0d0e21e LW |
2480 | break; |
2481 | case '.': | |
2482 | nextchar(); | |
a0ed51b3 LW |
2483 | if (UTF) { |
2484 | if (PL_regflags & PMf_SINGLELINE) | |
2485 | ret = reg_node(SANYUTF8); | |
2486 | else | |
2487 | ret = reg_node(ANYUTF8); | |
2488 | *flagp |= HASWIDTH; | |
2489 | } | |
2490 | else { | |
2491 | if (PL_regflags & PMf_SINGLELINE) | |
2492 | ret = reg_node(SANY); | |
2493 | else | |
22c35a8c | 2494 | ret = reg_node(REG_ANY); |
a0ed51b3 LW |
2495 | *flagp |= HASWIDTH|SIMPLE; |
2496 | } | |
3280af22 | 2497 | PL_regnaughty++; |
a0d0e21e LW |
2498 | break; |
2499 | case '[': | |
b45f050a JF |
2500 | { |
2501 | char *oregcomp_parse = ++PL_regcomp_parse; | |
a0ed51b3 | 2502 | ret = (UTF ? regclassutf8() : regclass()); |
b45f050a JF |
2503 | if (*PL_regcomp_parse != ']') { |
2504 | PL_regcomp_parse = oregcomp_parse; | |
2505 | vFAIL("Unmatched ["); | |
2506 | } | |
a14b48bc | 2507 | nextchar(); |
a0d0e21e LW |
2508 | *flagp |= HASWIDTH|SIMPLE; |
2509 | break; | |
b45f050a | 2510 | } |
a0d0e21e LW |
2511 | case '(': |
2512 | nextchar(); | |
2513 | ret = reg(1, &flags); | |
2514 | if (ret == NULL) { | |
bf93d4cc GS |
2515 | if (flags & TRYAGAIN) { |
2516 | if (PL_regcomp_parse == PL_regxend) { | |
2517 | /* Make parent create an empty node if needed. */ | |
2518 | *flagp |= TRYAGAIN; | |
2519 | return(NULL); | |
2520 | } | |
a0d0e21e | 2521 | goto tryagain; |
bf93d4cc | 2522 | } |
a0d0e21e LW |
2523 | return(NULL); |
2524 | } | |
c277df42 | 2525 | *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE); |
a0d0e21e LW |
2526 | break; |
2527 | case '|': | |
2528 | case ')': | |
2529 | if (flags & TRYAGAIN) { | |
2530 | *flagp |= TRYAGAIN; | |
2531 | return NULL; | |
2532 | } | |
b45f050a | 2533 | vFAIL("Internal urp"); |
a0d0e21e LW |
2534 | /* Supposed to be caught earlier. */ |
2535 | break; | |
85afd4ae | 2536 | case '{': |
3280af22 NIS |
2537 | if (!regcurly(PL_regcomp_parse)) { |
2538 | PL_regcomp_parse++; | |
85afd4ae CS |
2539 | goto defchar; |
2540 | } | |
2541 | /* FALL THROUGH */ | |
a0d0e21e LW |
2542 | case '?': |
2543 | case '+': | |
2544 | case '*': | |
b45f050a JF |
2545 | PL_regcomp_parse++; |
2546 | vFAIL("Quantifier follows nothing"); | |
a0d0e21e LW |
2547 | break; |
2548 | case '\\': | |
3280af22 | 2549 | switch (*++PL_regcomp_parse) { |
a0d0e21e | 2550 | case 'A': |
3280af22 | 2551 | PL_seen_zerolen++; |
c277df42 | 2552 | ret = reg_node(SBOL); |
a0d0e21e LW |
2553 | *flagp |= SIMPLE; |
2554 | nextchar(); | |
2555 | break; | |
2556 | case 'G': | |
c277df42 | 2557 | ret = reg_node(GPOS); |
3280af22 | 2558 | PL_regseen |= REG_SEEN_GPOS; |
a0d0e21e LW |
2559 | *flagp |= SIMPLE; |
2560 | nextchar(); | |
2561 | break; | |
2562 | case 'Z': | |
c277df42 | 2563 | ret = reg_node(SEOL); |
a0d0e21e LW |
2564 | *flagp |= SIMPLE; |
2565 | nextchar(); | |
2566 | break; | |
b85d18e9 IZ |
2567 | case 'z': |
2568 | ret = reg_node(EOS); | |
2569 | *flagp |= SIMPLE; | |
3280af22 | 2570 | PL_seen_zerolen++; /* Do not optimize RE away */ |
b85d18e9 IZ |
2571 | nextchar(); |
2572 | break; | |
4a2d328f | 2573 | case 'C': |
a0ed51b3 LW |
2574 | ret = reg_node(SANY); |
2575 | *flagp |= HASWIDTH|SIMPLE; | |
2576 | nextchar(); | |
2577 | break; | |
2578 | case 'X': | |
2579 | ret = reg_node(CLUMP); | |
2580 | *flagp |= HASWIDTH; | |
2581 | nextchar(); | |
2582 | if (UTF && !PL_utf8_mark) | |
dfe13c55 | 2583 | is_utf8_mark((U8*)"~"); /* preload table */ |
a0ed51b3 | 2584 | break; |
a0d0e21e | 2585 | case 'w': |
a0ed51b3 LW |
2586 | ret = reg_node( |
2587 | UTF | |
2588 | ? (LOC ? ALNUMLUTF8 : ALNUMUTF8) | |
2589 | : (LOC ? ALNUML : ALNUM)); | |
a0d0e21e LW |
2590 | *flagp |= HASWIDTH|SIMPLE; |
2591 | nextchar(); | |
a0ed51b3 | 2592 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2593 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2594 | break; |
2595 | case 'W': | |
a0ed51b3 LW |
2596 | ret = reg_node( |
2597 | UTF | |
2598 | ? (LOC ? NALNUMLUTF8 : NALNUMUTF8) | |
2599 | : (LOC ? NALNUML : NALNUM)); | |
a0d0e21e LW |
2600 | *flagp |= HASWIDTH|SIMPLE; |
2601 | nextchar(); | |
a0ed51b3 | 2602 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2603 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2604 | break; |
2605 | case 'b': | |
3280af22 | 2606 | PL_seen_zerolen++; |
f5c9036e | 2607 | PL_regseen |= REG_SEEN_LOOKBEHIND; |
a0ed51b3 LW |
2608 | ret = reg_node( |
2609 | UTF | |
2610 | ? (LOC ? BOUNDLUTF8 : BOUNDUTF8) | |
2611 | : (LOC ? BOUNDL : BOUND)); | |
a0d0e21e LW |
2612 | *flagp |= SIMPLE; |
2613 | nextchar(); | |
a0ed51b3 | 2614 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2615 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2616 | break; |
2617 | case 'B': | |
3280af22 | 2618 | PL_seen_zerolen++; |
f5c9036e | 2619 | PL_regseen |= REG_SEEN_LOOKBEHIND; |
a0ed51b3 LW |
2620 | ret = reg_node( |
2621 | UTF | |
2622 | ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8) | |
2623 | : (LOC ? NBOUNDL : NBOUND)); | |
a0d0e21e LW |
2624 | *flagp |= SIMPLE; |
2625 | nextchar(); | |
a0ed51b3 | 2626 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2627 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2628 | break; |
2629 | case 's': | |
a0ed51b3 LW |
2630 | ret = reg_node( |
2631 | UTF | |
2632 | ? (LOC ? SPACELUTF8 : SPACEUTF8) | |
2633 | : (LOC ? SPACEL : SPACE)); | |
a0d0e21e LW |
2634 | *flagp |= HASWIDTH|SIMPLE; |
2635 | nextchar(); | |
a0ed51b3 | 2636 | if (UTF && !PL_utf8_space) |
dfe13c55 | 2637 | is_utf8_space((U8*)" "); /* preload table */ |
a0d0e21e LW |
2638 | break; |
2639 | case 'S': | |
a0ed51b3 LW |
2640 | ret = reg_node( |
2641 | UTF | |
2642 | ? (LOC ? NSPACELUTF8 : NSPACEUTF8) | |
2643 | : (LOC ? NSPACEL : NSPACE)); | |
a0d0e21e LW |
2644 | *flagp |= HASWIDTH|SIMPLE; |
2645 | nextchar(); | |
a0ed51b3 | 2646 | if (UTF && !PL_utf8_space) |
dfe13c55 | 2647 | is_utf8_space((U8*)" "); /* preload table */ |
a0d0e21e LW |
2648 | break; |
2649 | case 'd': | |
a0ed51b3 | 2650 | ret = reg_node(UTF ? DIGITUTF8 : DIGIT); |
a0d0e21e LW |
2651 | *flagp |= HASWIDTH|SIMPLE; |
2652 | nextchar(); | |
a0ed51b3 | 2653 | if (UTF && !PL_utf8_digit) |
dfe13c55 | 2654 | is_utf8_digit((U8*)"1"); /* preload table */ |
a0d0e21e LW |
2655 | break; |
2656 | case 'D': | |
a0ed51b3 | 2657 | ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT); |
a0d0e21e LW |
2658 | *flagp |= HASWIDTH|SIMPLE; |
2659 | nextchar(); | |
a0ed51b3 | 2660 | if (UTF && !PL_utf8_digit) |
dfe13c55 | 2661 | is_utf8_digit((U8*)"1"); /* preload table */ |
a0d0e21e | 2662 | break; |
a14b48bc LW |
2663 | case 'p': |
2664 | case 'P': | |
2665 | { /* a lovely hack--pretend we saw [\pX] instead */ | |
2666 | char* oldregxend = PL_regxend; | |
2667 | ||
2668 | if (PL_regcomp_parse[1] == '{') { | |
2669 | PL_regxend = strchr(PL_regcomp_parse, '}'); | |
b45f050a JF |
2670 | if (!PL_regxend) { |
2671 | PL_regcomp_parse += 2; | |
2672 | PL_regxend = oldregxend; | |
2673 | vFAIL("Missing right brace on \\p{}"); | |
2674 | } | |
a14b48bc LW |
2675 | PL_regxend++; |
2676 | } | |
2677 | else | |
2678 | PL_regxend = PL_regcomp_parse + 2; | |
2679 | PL_regcomp_parse--; | |
2680 | ||
2681 | ret = regclassutf8(); | |
2682 | ||
2683 | PL_regxend = oldregxend; | |
2684 | PL_regcomp_parse--; | |
2685 | nextchar(); | |
2686 | *flagp |= HASWIDTH|SIMPLE; | |
2687 | } | |
2688 | break; | |
a0d0e21e LW |
2689 | case 'n': |
2690 | case 'r': | |
2691 | case 't': | |
2692 | case 'f': | |
2693 | case 'e': | |
2694 | case 'a': | |
2695 | case 'x': | |
2696 | case 'c': | |
2697 | case '0': | |
2698 | goto defchar; | |
2699 | case '1': case '2': case '3': case '4': | |
2700 | case '5': case '6': case '7': case '8': case '9': | |
2701 | { | |
3280af22 | 2702 | I32 num = atoi(PL_regcomp_parse); |
a0d0e21e | 2703 | |
3280af22 | 2704 | if (num > 9 && num >= PL_regnpar) |
a0d0e21e LW |
2705 | goto defchar; |
2706 | else { | |
380a0633 JH |
2707 | while (isDIGIT(*PL_regcomp_parse)) |
2708 | PL_regcomp_parse++; | |
b45f050a | 2709 | |
3280af22 | 2710 | if (!SIZE_ONLY && num > PL_regcomp_rx->nparens) |
9baa0206 | 2711 | vFAIL("Reference to nonexistent group"); |
3280af22 | 2712 | PL_regsawback = 1; |
a0ed51b3 LW |
2713 | ret = reganode(FOLD |
2714 | ? (LOC ? REFFL : REFF) | |
c8756f30 | 2715 | : REF, num); |
a0d0e21e | 2716 | *flagp |= HASWIDTH; |
3280af22 | 2717 | PL_regcomp_parse--; |
a0d0e21e LW |
2718 | nextchar(); |
2719 | } | |
2720 | } | |
2721 | break; | |
2722 | case '\0': | |
3280af22 | 2723 | if (PL_regcomp_parse >= PL_regxend) |
b45f050a | 2724 | FAIL("Trailing \\"); |
a0d0e21e LW |
2725 | /* FALL THROUGH */ |
2726 | default: | |
c9f97d15 IZ |
2727 | /* Do not generate `unrecognized' warnings here, we fall |
2728 | back into the quick-grab loop below */ | |
a0d0e21e LW |
2729 | goto defchar; |
2730 | } | |
2731 | break; | |
4633a7c4 LW |
2732 | |
2733 | case '#': | |
3280af22 NIS |
2734 | if (PL_regflags & PMf_EXTENDED) { |
2735 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++; | |
2736 | if (PL_regcomp_parse < PL_regxend) | |
4633a7c4 LW |
2737 | goto tryagain; |
2738 | } | |
2739 | /* FALL THROUGH */ | |
2740 | ||
a0d0e21e LW |
2741 | default: { |
2742 | register I32 len; | |
a0ed51b3 | 2743 | register UV ender; |
a0d0e21e | 2744 | register char *p; |
c277df42 | 2745 | char *oldp, *s; |
a0d0e21e LW |
2746 | I32 numlen; |
2747 | ||
3280af22 | 2748 | PL_regcomp_parse++; |
a0d0e21e LW |
2749 | |
2750 | defchar: | |
a0ed51b3 LW |
2751 | ret = reg_node(FOLD |
2752 | ? (LOC ? EXACTFL : EXACTF) | |
bbce6d69 | 2753 | : EXACT); |
cd439c50 | 2754 | s = STRING(ret); |
3280af22 NIS |
2755 | for (len = 0, p = PL_regcomp_parse - 1; |
2756 | len < 127 && p < PL_regxend; | |
a0d0e21e LW |
2757 | len++) |
2758 | { | |
2759 | oldp = p; | |
5b5a24f7 | 2760 | |
3280af22 NIS |
2761 | if (PL_regflags & PMf_EXTENDED) |
2762 | p = regwhite(p, PL_regxend); | |
a0d0e21e LW |
2763 | switch (*p) { |
2764 | case '^': | |
2765 | case '$': | |
2766 | case '.': | |
2767 | case '[': | |
2768 | case '(': | |
2769 | case ')': | |
2770 | case '|': | |
2771 | goto loopdone; | |
2772 | case '\\': | |
2773 | switch (*++p) { | |
2774 | case 'A': | |
2775 | case 'G': | |
2776 | case 'Z': | |
b85d18e9 | 2777 | case 'z': |
a0d0e21e LW |
2778 | case 'w': |
2779 | case 'W': | |
2780 | case 'b': | |
2781 | case 'B': | |
2782 | case 's': | |
2783 | case 'S': | |
2784 | case 'd': | |
2785 | case 'D': | |
a14b48bc LW |
2786 | case 'p': |
2787 | case 'P': | |
a0d0e21e LW |
2788 | --p; |
2789 | goto loopdone; | |
2790 | case 'n': | |
2791 | ender = '\n'; | |
2792 | p++; | |
a687059c | 2793 | break; |
a0d0e21e LW |
2794 | case 'r': |
2795 | ender = '\r'; | |
2796 | p++; | |
a687059c | 2797 | break; |
a0d0e21e LW |
2798 | case 't': |
2799 | ender = '\t'; | |
2800 | p++; | |
a687059c | 2801 | break; |
a0d0e21e LW |
2802 | case 'f': |
2803 | ender = '\f'; | |
2804 | p++; | |
a687059c | 2805 | break; |
a0d0e21e | 2806 | case 'e': |
0407a77b GS |
2807 | #ifdef ASCIIish |
2808 | ender = '\033'; | |
2809 | #else | |
2810 | ender = '\047'; | |
2811 | #endif | |
a0d0e21e | 2812 | p++; |
a687059c | 2813 | break; |
a0d0e21e | 2814 | case 'a': |
0407a77b GS |
2815 | #ifdef ASCIIish |
2816 | ender = '\007'; | |
2817 | #else | |
2818 | ender = '\057'; | |
2819 | #endif | |
a0d0e21e | 2820 | p++; |
a687059c | 2821 | break; |
a0d0e21e | 2822 | case 'x': |
a0ed51b3 LW |
2823 | if (*++p == '{') { |
2824 | char* e = strchr(p, '}'); | |
2825 | ||
b45f050a JF |
2826 | if (!e) { |
2827 | PL_regcomp_parse = p + 1; | |
2828 | vFAIL("Missing right brace on \\x{}"); | |
2829 | } | |
a0ed51b3 | 2830 | else if (UTF) { |
b21ed0a9 | 2831 | numlen = 1; /* allow underscores */ |
de35ba6f | 2832 | ender = (UV)scan_hex(p + 1, e - p - 1, &numlen); |
b21ed0a9 GS |
2833 | /* numlen is generous */ |
2834 | if (numlen + len >= 127) { | |
a0ed51b3 LW |
2835 | p--; |
2836 | goto loopdone; | |
2837 | } | |
2838 | p = e + 1; | |
2839 | } | |
2840 | else | |
b45f050a JF |
2841 | { |
2842 | PL_regcomp_parse = e + 1; | |
8615cb43 | 2843 | vFAIL("Can't use \\x{} without 'use utf8' declaration"); |
b45f050a JF |
2844 | } |
2845 | ||
a0ed51b3 LW |
2846 | } |
2847 | else { | |
b21ed0a9 | 2848 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 2849 | ender = (UV)scan_hex(p, 2, &numlen); |
a0ed51b3 LW |
2850 | p += numlen; |
2851 | } | |
a687059c | 2852 | break; |
a0d0e21e LW |
2853 | case 'c': |
2854 | p++; | |
bbce6d69 | 2855 | ender = UCHARAT(p++); |
2856 | ender = toCTRL(ender); | |
a687059c | 2857 | break; |
a0d0e21e LW |
2858 | case '0': case '1': case '2': case '3':case '4': |
2859 | case '5': case '6': case '7': case '8':case '9': | |
2860 | if (*p == '0' || | |
3280af22 | 2861 | (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) { |
b21ed0a9 | 2862 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 2863 | ender = (UV)scan_oct(p, 3, &numlen); |
a0d0e21e LW |
2864 | p += numlen; |
2865 | } | |
2866 | else { | |
2867 | --p; | |
2868 | goto loopdone; | |
a687059c LW |
2869 | } |
2870 | break; | |
a0d0e21e | 2871 | case '\0': |
3280af22 | 2872 | if (p >= PL_regxend) |
b45f050a | 2873 | FAIL("Trailing \\"); |
a687059c | 2874 | /* FALL THROUGH */ |
a0d0e21e | 2875 | default: |
e476b1b5 | 2876 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p)) |
b45f050a | 2877 | vWARN2(p +1, "Unrecognized escape \\%c passed through", *p); |
a0ed51b3 | 2878 | goto normal_default; |
a0d0e21e LW |
2879 | } |
2880 | break; | |
a687059c | 2881 | default: |
a0ed51b3 LW |
2882 | normal_default: |
2883 | if ((*p & 0xc0) == 0xc0 && UTF) { | |
dfe13c55 | 2884 | ender = utf8_to_uv((U8*)p, &numlen); |
a0ed51b3 LW |
2885 | p += numlen; |
2886 | } | |
2887 | else | |
2888 | ender = *p++; | |
a0d0e21e | 2889 | break; |
a687059c | 2890 | } |
3280af22 NIS |
2891 | if (PL_regflags & PMf_EXTENDED) |
2892 | p = regwhite(p, PL_regxend); | |
a0ed51b3 LW |
2893 | if (UTF && FOLD) { |
2894 | if (LOC) | |
2895 | ender = toLOWER_LC_uni(ender); | |
2896 | else | |
2897 | ender = toLOWER_uni(ender); | |
2898 | } | |
a0d0e21e LW |
2899 | if (ISMULT2(p)) { /* Back off on ?+*. */ |
2900 | if (len) | |
2901 | p = oldp; | |
a0ed51b3 LW |
2902 | else if (ender >= 0x80 && UTF) { |
2903 | reguni(ender, s, &numlen); | |
2904 | s += numlen; | |
2905 | len += numlen; | |
2906 | } | |
a0d0e21e LW |
2907 | else { |
2908 | len++; | |
cd439c50 | 2909 | REGC(ender, s++); |
a0d0e21e LW |
2910 | } |
2911 | break; | |
a687059c | 2912 | } |
a0ed51b3 LW |
2913 | if (ender >= 0x80 && UTF) { |
2914 | reguni(ender, s, &numlen); | |
2915 | s += numlen; | |
2916 | len += numlen - 1; | |
2917 | } | |
2918 | else | |
cd439c50 | 2919 | REGC(ender, s++); |
a0d0e21e LW |
2920 | } |
2921 | loopdone: | |
3280af22 | 2922 | PL_regcomp_parse = p - 1; |
a0d0e21e LW |
2923 | nextchar(); |
2924 | if (len < 0) | |
b45f050a | 2925 | vFAIL("Internal disaster"); |
a0d0e21e LW |
2926 | if (len > 0) |
2927 | *flagp |= HASWIDTH; | |
2928 | if (len == 1) | |
2929 | *flagp |= SIMPLE; | |
c277df42 | 2930 | if (!SIZE_ONLY) |
cd439c50 IZ |
2931 | STR_LEN(ret) = len; |
2932 | if (SIZE_ONLY) | |
2933 | PL_regsize += STR_SZ(len); | |
2934 | else | |
2935 | PL_regcode += STR_SZ(len); | |
a687059c | 2936 | } |
a0d0e21e LW |
2937 | break; |
2938 | } | |
a687059c | 2939 | |
a0d0e21e | 2940 | return(ret); |
a687059c LW |
2941 | } |
2942 | ||
873ef191 | 2943 | STATIC char * |
cea2e8a9 | 2944 | S_regwhite(pTHX_ char *p, char *e) |
5b5a24f7 CS |
2945 | { |
2946 | while (p < e) { | |
2947 | if (isSPACE(*p)) | |
2948 | ++p; | |
2949 | else if (*p == '#') { | |
2950 | do { | |
2951 | p++; | |
2952 | } while (p < e && *p != '\n'); | |
2953 | } | |
2954 | else | |
2955 | break; | |
2956 | } | |
2957 | return p; | |
2958 | } | |
2959 | ||
b8c5462f JH |
2960 | /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]]. |
2961 | Character classes ([:foo:]) can also be negated ([:^foo:]). | |
2962 | Returns a named class id (ANYOF_XXX) if successful, -1 otherwise. | |
2963 | Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed, | |
2964 | but trigger warnings because they are currently unimplemented. */ | |
2965 | STATIC I32 | |
cea2e8a9 | 2966 | S_regpposixcc(pTHX_ I32 value) |
620e46c5 | 2967 | { |
11b8faa4 | 2968 | dTHR; |
620e46c5 | 2969 | char *posixcc = 0; |
936ed897 | 2970 | I32 namedclass = OOB_NAMEDCLASS; |
620e46c5 JH |
2971 | |
2972 | if (value == '[' && PL_regcomp_parse + 1 < PL_regxend && | |
2973 | /* I smell either [: or [= or [. -- POSIX has been here, right? */ | |
2974 | (*PL_regcomp_parse == ':' || | |
2975 | *PL_regcomp_parse == '=' || | |
2976 | *PL_regcomp_parse == '.')) { | |
2977 | char c = *PL_regcomp_parse; | |
2978 | char* s = PL_regcomp_parse++; | |
2979 | ||
2980 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c) | |
2981 | PL_regcomp_parse++; | |
2982 | if (PL_regcomp_parse == PL_regxend) | |
2983 | /* Grandfather lone [:, [=, [. */ | |
2984 | PL_regcomp_parse = s; | |
2985 | else { | |
b8c5462f JH |
2986 | char* t = PL_regcomp_parse++; /* skip over the c */ |
2987 | ||
2988 | if (*PL_regcomp_parse == ']') { | |
2989 | PL_regcomp_parse++; /* skip over the ending ] */ | |
2990 | posixcc = s + 1; | |
2991 | if (*s == ':') { | |
2992 | I32 complement = *posixcc == '^' ? *posixcc++ : 0; | |
2993 | I32 skip = 5; /* the most common skip */ | |
2994 | ||
2995 | switch (*posixcc) { | |
2996 | case 'a': | |
2997 | if (strnEQ(posixcc, "alnum", 5)) | |
2998 | namedclass = | |
2999 | complement ? ANYOF_NALNUMC : ANYOF_ALNUMC; | |
3000 | else if (strnEQ(posixcc, "alpha", 5)) | |
3001 | namedclass = | |
3002 | complement ? ANYOF_NALPHA : ANYOF_ALPHA; | |
3003 | else if (strnEQ(posixcc, "ascii", 5)) | |
3004 | namedclass = | |
3005 | complement ? ANYOF_NASCII : ANYOF_ASCII; | |
3006 | break; | |
3007 | case 'c': | |
3008 | if (strnEQ(posixcc, "cntrl", 5)) | |
3009 | namedclass = | |
3010 | complement ? ANYOF_NCNTRL : ANYOF_CNTRL; | |
3011 | break; | |
3012 | case 'd': | |
3013 | if (strnEQ(posixcc, "digit", 5)) | |
3014 | namedclass = | |
3015 | complement ? ANYOF_NDIGIT : ANYOF_DIGIT; | |
3016 | break; | |
3017 | case 'g': | |
3018 | if (strnEQ(posixcc, "graph", 5)) | |
3019 | namedclass = | |
3020 | complement ? ANYOF_NGRAPH : ANYOF_GRAPH; | |
3021 | break; | |
3022 | case 'l': | |
3023 | if (strnEQ(posixcc, "lower", 5)) | |
3024 | namedclass = | |
3025 | complement ? ANYOF_NLOWER : ANYOF_LOWER; | |
3026 | break; | |
3027 | case 'p': | |
3028 | if (strnEQ(posixcc, "print", 5)) | |
3029 | namedclass = | |
3030 | complement ? ANYOF_NPRINT : ANYOF_PRINT; | |
3031 | else if (strnEQ(posixcc, "punct", 5)) | |
3032 | namedclass = | |
3033 | complement ? ANYOF_NPUNCT : ANYOF_PUNCT; | |
3034 | break; | |
3035 | case 's': | |
3036 | if (strnEQ(posixcc, "space", 5)) | |
3037 | namedclass = | |
3038 | complement ? ANYOF_NSPACE : ANYOF_SPACE; | |
cc4319de | 3039 | break; |
b8c5462f JH |
3040 | case 'u': |
3041 | if (strnEQ(posixcc, "upper", 5)) | |
3042 | namedclass = | |
3043 | complement ? ANYOF_NUPPER : ANYOF_UPPER; | |
3044 | break; | |
3045 | case 'w': /* this is not POSIX, this is the Perl \w */ | |
3046 | if (strnEQ(posixcc, "word", 4)) { | |
3047 | namedclass = | |
3048 | complement ? ANYOF_NALNUM : ANYOF_ALNUM; | |
3049 | skip = 4; | |
3050 | } | |
3051 | break; | |
3052 | case 'x': | |
3053 | if (strnEQ(posixcc, "xdigit", 6)) { | |
3054 | namedclass = | |
3055 | complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT; | |
3056 | skip = 6; | |
3057 | } | |
3058 | break; | |
3059 | } | |
ac561586 JH |
3060 | if (namedclass == OOB_NAMEDCLASS || |
3061 | posixcc[skip] != ':' || | |
3062 | posixcc[skip+1] != ']') | |
b45f050a JF |
3063 | { |
3064 | Simple_vFAIL3("POSIX class [:%.*s:] unknown", | |
3065 | t - s - 1, s + 1); | |
3066 | } | |
3067 | } else if (!SIZE_ONLY) { | |
b8c5462f | 3068 | /* [[=foo=]] and [[.foo.]] are still future. */ |
b45f050a JF |
3069 | |
3070 | /* adjust PL_regcomp_parse so the warning shows after | |
3071 | the class closes */ | |
3072 | while (*PL_regcomp_parse && *PL_regcomp_parse != ']') | |
3073 | PL_regcomp_parse++; | |
3074 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); | |
3075 | } | |
b8c5462f JH |
3076 | } else { |
3077 | /* Maternal grandfather: | |
3078 | * "[:" ending in ":" but not in ":]" */ | |
767d463e HS |
3079 | PL_regcomp_parse = s; |
3080 | } | |
620e46c5 JH |
3081 | } |
3082 | } | |
3083 | ||
b8c5462f JH |
3084 | return namedclass; |
3085 | } | |
3086 | ||
3087 | STATIC void | |
3088 | S_checkposixcc(pTHX) | |
3089 | { | |
e476b1b5 | 3090 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && |
b8c5462f JH |
3091 | (*PL_regcomp_parse == ':' || |
3092 | *PL_regcomp_parse == '=' || | |
3093 | *PL_regcomp_parse == '.')) { | |
3094 | char *s = PL_regcomp_parse; | |
93733859 | 3095 | char c = *s++; |
b8c5462f JH |
3096 | |
3097 | while(*s && isALNUM(*s)) | |
3098 | s++; | |
3099 | if (*s && c == *s && s[1] == ']') { | |
b45f050a JF |
3100 | vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c); |
3101 | ||
3102 | /* [[=foo=]] and [[.foo.]] are still future. */ | |
b8c5462f | 3103 | if (c == '=' || c == '.') |
b45f050a JF |
3104 | { |
3105 | /* adjust PL_regcomp_parse so the error shows after | |
3106 | the class closes */ | |
3107 | while (*PL_regcomp_parse && *PL_regcomp_parse++ != ']') | |
3108 | ; | |
3109 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); | |
3110 | } | |
b8c5462f JH |
3111 | } |
3112 | } | |
620e46c5 JH |
3113 | } |
3114 | ||
76e3520e | 3115 | STATIC regnode * |
cea2e8a9 | 3116 | S_regclass(pTHX) |
a687059c | 3117 | { |
5c0ca799 | 3118 | dTHR; |
470c3474 | 3119 | register U32 value; |
b8c5462f | 3120 | register I32 lastvalue = OOB_CHAR8; |
a0d0e21e | 3121 | register I32 range = 0; |
c277df42 | 3122 | register regnode *ret; |
a0d0e21e | 3123 | I32 numlen; |
b8c5462f | 3124 | I32 namedclass; |
73b437c8 | 3125 | char *rangebegin; |
936ed897 | 3126 | bool need_class = 0; |
a0d0e21e | 3127 | |
c277df42 | 3128 | ret = reg_node(ANYOF); |
936ed897 IZ |
3129 | if (SIZE_ONLY) |
3130 | PL_regsize += ANYOF_SKIP; | |
3131 | else { | |
3132 | ret->flags = 0; | |
3133 | ANYOF_BITMAP_ZERO(ret); | |
3134 | PL_regcode += ANYOF_SKIP; | |
3135 | if (FOLD) | |
3136 | ANYOF_FLAGS(ret) |= ANYOF_FOLD; | |
3137 | if (LOC) | |
3138 | ANYOF_FLAGS(ret) |= ANYOF_LOCALE; | |
3139 | } | |
3280af22 NIS |
3140 | if (*PL_regcomp_parse == '^') { /* Complement of range. */ |
3141 | PL_regnaughty++; | |
3142 | PL_regcomp_parse++; | |
c277df42 | 3143 | if (!SIZE_ONLY) |
936ed897 | 3144 | ANYOF_FLAGS(ret) |= ANYOF_INVERT; |
a0d0e21e | 3145 | } |
b8c5462f | 3146 | |
e476b1b5 | 3147 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP)) |
936ed897 | 3148 | checkposixcc(); |
b8c5462f | 3149 | |
3280af22 | 3150 | if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-') |
a0d0e21e | 3151 | goto skipcond; /* allow 1st char to be ] or - */ |
3280af22 | 3152 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') { |
a0d0e21e | 3153 | skipcond: |
93733859 | 3154 | namedclass = OOB_NAMEDCLASS; |
73b437c8 JH |
3155 | if (!range) |
3156 | rangebegin = PL_regcomp_parse; | |
a0ed51b3 | 3157 | value = UCHARAT(PL_regcomp_parse++); |
620e46c5 | 3158 | if (value == '[') |
b8c5462f | 3159 | namedclass = regpposixcc(value); |
620e46c5 | 3160 | else if (value == '\\') { |
a0ed51b3 | 3161 | value = UCHARAT(PL_regcomp_parse++); |
470c3474 JH |
3162 | /* Some compilers cannot handle switching on 64-bit integer |
3163 | * values, therefore value cannot be an UV. --jhi */ | |
a0ed51b3 | 3164 | switch (value) { |
b8c5462f JH |
3165 | case 'w': namedclass = ANYOF_ALNUM; break; |
3166 | case 'W': namedclass = ANYOF_NALNUM; break; | |
3167 | case 's': namedclass = ANYOF_SPACE; break; | |
3168 | case 'S': namedclass = ANYOF_NSPACE; break; | |
3169 | case 'd': namedclass = ANYOF_DIGIT; break; | |
3170 | case 'D': namedclass = ANYOF_NDIGIT; break; | |
3171 | case 'n': value = '\n'; break; | |
3172 | case 'r': value = '\r'; break; | |
3173 | case 't': value = '\t'; break; | |
3174 | case 'f': value = '\f'; break; | |
3175 | case 'b': value = '\b'; break; | |
0407a77b | 3176 | #ifdef ASCIIish |
b8c5462f JH |
3177 | case 'e': value = '\033'; break; |
3178 | case 'a': value = '\007'; break; | |
0407a77b GS |
3179 | #else |
3180 | case 'e': value = '\047'; break; | |
3181 | case 'a': value = '\057'; break; | |
3182 | #endif | |
b8c5462f | 3183 | case 'x': |
b21ed0a9 | 3184 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3185 | value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen); |
b8c5462f JH |
3186 | PL_regcomp_parse += numlen; |
3187 | break; | |
3188 | case 'c': | |
3189 | value = UCHARAT(PL_regcomp_parse++); | |
3190 | value = toCTRL(value); | |
3191 | break; | |
3192 | case '0': case '1': case '2': case '3': case '4': | |
3193 | case '5': case '6': case '7': case '8': case '9': | |
b21ed0a9 | 3194 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3195 | value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen); |
b8c5462f JH |
3196 | PL_regcomp_parse += numlen; |
3197 | break; | |
1028017a | 3198 | default: |
e476b1b5 | 3199 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value)) |
b45f050a JF |
3200 | |
3201 | vWARN2(PL_regcomp_parse, "Unrecognized escape \\%c in character class passed through", (int)value); | |
1028017a | 3202 | break; |
b8c5462f JH |
3203 | } |
3204 | } | |
73b437c8 | 3205 | if (namedclass > OOB_NAMEDCLASS) { |
936ed897 IZ |
3206 | if (!need_class && !SIZE_ONLY) |
3207 | ANYOF_CLASS_ZERO(ret); | |
3208 | need_class = 1; | |
73b437c8 JH |
3209 | if (range) { /* a-\d, a-[:digit:] */ |
3210 | if (!SIZE_ONLY) { | |
e476b1b5 | 3211 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3212 | vWARN4(PL_regcomp_parse, |
3213 | "False [] range \"%*.*s\"", | |
3214 | PL_regcomp_parse - rangebegin, | |
3215 | PL_regcomp_parse - rangebegin, | |
3216 | rangebegin); | |
936ed897 IZ |
3217 | ANYOF_BITMAP_SET(ret, lastvalue); |
3218 | ANYOF_BITMAP_SET(ret, '-'); | |
b8c5462f | 3219 | } |
73b437c8 JH |
3220 | range = 0; /* this is not a true range */ |
3221 | } | |
3222 | if (!SIZE_ONLY) { | |
3223 | switch (namedclass) { | |
3224 | case ANYOF_ALNUM: | |
3225 | if (LOC) | |
936ed897 | 3226 | ANYOF_CLASS_SET(ret, ANYOF_ALNUM); |
73b437c8 JH |
3227 | else { |
3228 | for (value = 0; value < 256; value++) | |
3229 | if (isALNUM(value)) | |
936ed897 | 3230 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3231 | } |
3232 | break; | |
3233 | case ANYOF_NALNUM: | |
3234 | if (LOC) | |
936ed897 | 3235 | ANYOF_CLASS_SET(ret, ANYOF_NALNUM); |
73b437c8 JH |
3236 | else { |
3237 | for (value = 0; value < 256; value++) | |
3238 | if (!isALNUM(value)) | |
936ed897 | 3239 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3240 | } |
3241 | break; | |
3242 | case ANYOF_SPACE: | |
3243 | if (LOC) | |
936ed897 | 3244 | ANYOF_CLASS_SET(ret, ANYOF_SPACE); |
73b437c8 JH |
3245 | else { |
3246 | for (value = 0; value < 256; value++) | |
3247 | if (isSPACE(value)) | |
936ed897 | 3248 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3249 | } |
3250 | break; | |
3251 | case ANYOF_NSPACE: | |
3252 | if (LOC) | |
936ed897 | 3253 | ANYOF_CLASS_SET(ret, ANYOF_NSPACE); |
73b437c8 JH |
3254 | else { |
3255 | for (value = 0; value < 256; value++) | |
3256 | if (!isSPACE(value)) | |
936ed897 | 3257 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3258 | } |
3259 | break; | |
3260 | case ANYOF_DIGIT: | |
3261 | if (LOC) | |
936ed897 | 3262 | ANYOF_CLASS_SET(ret, ANYOF_DIGIT); |
73b437c8 JH |
3263 | else { |
3264 | for (value = '0'; value <= '9'; value++) | |
936ed897 | 3265 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3266 | } |
3267 | break; | |
3268 | case ANYOF_NDIGIT: | |
3269 | if (LOC) | |
936ed897 | 3270 | ANYOF_CLASS_SET(ret, ANYOF_NDIGIT); |
73b437c8 JH |
3271 | else { |
3272 | for (value = 0; value < '0'; value++) | |
936ed897 | 3273 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 | 3274 | for (value = '9' + 1; value < 256; value++) |
936ed897 | 3275 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3276 | } |
3277 | break; | |
3278 | case ANYOF_NALNUMC: | |
3279 | if (LOC) | |
936ed897 | 3280 | ANYOF_CLASS_SET(ret, ANYOF_NALNUMC); |
73b437c8 JH |
3281 | else { |
3282 | for (value = 0; value < 256; value++) | |
3283 | if (!isALNUMC(value)) | |
936ed897 | 3284 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3285 | } |
3286 | break; | |
3287 | case ANYOF_ALNUMC: | |
3288 | if (LOC) | |
936ed897 | 3289 | ANYOF_CLASS_SET(ret, ANYOF_ALNUMC); |
73b437c8 JH |
3290 | else { |
3291 | for (value = 0; value < 256; value++) | |
3292 | if (isALNUMC(value)) | |
936ed897 | 3293 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3294 | } |
3295 | break; | |
3296 | case ANYOF_ALPHA: | |
3297 | if (LOC) | |
936ed897 | 3298 | ANYOF_CLASS_SET(ret, ANYOF_ALPHA); |
73b437c8 JH |
3299 | else { |
3300 | for (value = 0; value < 256; value++) | |
3301 | if (isALPHA(value)) | |
936ed897 | 3302 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3303 | } |
3304 | break; | |
3305 | case ANYOF_NALPHA: | |
3306 | if (LOC) | |
936ed897 | 3307 | ANYOF_CLASS_SET(ret, ANYOF_NALPHA); |
73b437c8 JH |
3308 | else { |
3309 | for (value = 0; value < 256; value++) | |
3310 | if (!isALPHA(value)) | |
936ed897 | 3311 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3312 | } |
3313 | break; | |
3314 | case ANYOF_ASCII: | |
3315 | if (LOC) | |
936ed897 | 3316 | ANYOF_CLASS_SET(ret, ANYOF_ASCII); |
73b437c8 | 3317 | else { |
a5993822 | 3318 | #ifdef ASCIIish |
73b437c8 | 3319 | for (value = 0; value < 128; value++) |
936ed897 | 3320 | ANYOF_BITMAP_SET(ret, value); |
a5993822 PP |
3321 | #else /* EBCDIC */ |
3322 | for (value = 0; value < 256; value++) | |
3323 | if (isASCII(value)) | |
3324 | ANYOF_BITMAP_SET(ret, value); | |
3325 | #endif /* EBCDIC */ | |
73b437c8 JH |
3326 | } |
3327 | break; | |
3328 | case ANYOF_NASCII: | |
3329 | if (LOC) | |
936ed897 | 3330 | ANYOF_CLASS_SET(ret, ANYOF_NASCII); |
73b437c8 | 3331 | else { |
a5993822 | 3332 | #ifdef ASCIIish |
73b437c8 | 3333 | for (value = 128; value < 256; value++) |
936ed897 | 3334 | ANYOF_BITMAP_SET(ret, value); |
a5993822 PP |
3335 | #else /* EBCDIC */ |
3336 | for (value = 0; value < 256; value++) | |
3337 | if (!isASCII(value)) | |
3338 | ANYOF_BITMAP_SET(ret, value); | |
3339 | #endif /* EBCDIC */ | |
73b437c8 JH |
3340 | } |
3341 | break; | |
3342 | case ANYOF_CNTRL: | |
3343 | if (LOC) | |
936ed897 | 3344 | ANYOF_CLASS_SET(ret, ANYOF_CNTRL); |
73b437c8 JH |
3345 | else { |
3346 | for (value = 0; value < 256; value++) | |
3347 | if (isCNTRL(value)) | |
936ed897 | 3348 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3349 | } |
3350 | lastvalue = OOB_CHAR8; | |
3351 | break; | |
3352 | case ANYOF_NCNTRL: | |
3353 | if (LOC) | |
936ed897 | 3354 | ANYOF_CLASS_SET(ret, ANYOF_NCNTRL); |
73b437c8 JH |
3355 | else { |
3356 | for (value = 0; value < 256; value++) | |
3357 | if (!isCNTRL(value)) | |
936ed897 | 3358 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3359 | } |
3360 | break; | |
3361 | case ANYOF_GRAPH: | |
3362 | if (LOC) | |
936ed897 | 3363 | ANYOF_CLASS_SET(ret, ANYOF_GRAPH); |
73b437c8 JH |
3364 | else { |
3365 | for (value = 0; value < 256; value++) | |
3366 | if (isGRAPH(value)) | |
936ed897 | 3367 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3368 | } |
3369 | break; | |
3370 | case ANYOF_NGRAPH: | |
3371 | if (LOC) | |
936ed897 | 3372 | ANYOF_CLASS_SET(ret, ANYOF_NGRAPH); |
73b437c8 JH |
3373 | else { |
3374 | for (value = 0; value < 256; value++) | |
3375 | if (!isGRAPH(value)) | |
936ed897 | 3376 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3377 | } |
3378 | break; | |
3379 | case ANYOF_LOWER: | |
3380 | if (LOC) | |
936ed897 | 3381 | ANYOF_CLASS_SET(ret, ANYOF_LOWER); |
73b437c8 JH |
3382 | else { |
3383 | for (value = 0; value < 256; value++) | |
3384 | if (isLOWER(value)) | |
936ed897 | 3385 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3386 | } |
3387 | break; | |
3388 | case ANYOF_NLOWER: | |
3389 | if (LOC) | |
936ed897 | 3390 | ANYOF_CLASS_SET(ret, ANYOF_NLOWER); |
73b437c8 JH |
3391 | else { |
3392 | for (value = 0; value < 256; value++) | |
3393 | if (!isLOWER(value)) | |
936ed897 | 3394 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3395 | } |
3396 | break; | |
3397 | case ANYOF_PRINT: | |
3398 | if (LOC) | |
936ed897 | 3399 | ANYOF_CLASS_SET(ret, ANYOF_PRINT); |
73b437c8 JH |
3400 | else { |
3401 | for (value = 0; value < 256; value++) | |
3402 | if (isPRINT(value)) | |
936ed897 | 3403 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3404 | } |
3405 | break; | |
3406 | case ANYOF_NPRINT: | |
3407 | if (LOC) | |
936ed897 | 3408 | ANYOF_CLASS_SET(ret, ANYOF_NPRINT); |
73b437c8 JH |
3409 | else { |
3410 | for (value = 0; value < 256; value++) | |
3411 | if (!isPRINT(value)) | |
936ed897 | 3412 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3413 | } |
3414 | break; | |
3415 | case ANYOF_PUNCT: | |
3416 | if (LOC) | |
936ed897 | 3417 | ANYOF_CLASS_SET(ret, ANYOF_PUNCT); |
73b437c8 JH |
3418 | else { |
3419 | for (value = 0; value < 256; value++) | |
3420 | if (isPUNCT(value)) | |
936ed897 | 3421 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3422 | } |
3423 | break; | |
3424 | case ANYOF_NPUNCT: | |
3425 | if (LOC) | |
936ed897 | 3426 | ANYOF_CLASS_SET(ret, ANYOF_NPUNCT); |
73b437c8 JH |
3427 | else { |
3428 | for (value = 0; value < 256; value++) | |
3429 | if (!isPUNCT(value)) | |
936ed897 | 3430 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3431 | } |
3432 | break; | |
3433 | case ANYOF_UPPER: | |
3434 | if (LOC) | |
936ed897 | 3435 | ANYOF_CLASS_SET(ret, ANYOF_UPPER); |
73b437c8 JH |
3436 | else { |
3437 | for (value = 0; value < 256; value++) | |
3438 | if (isUPPER(value)) | |
936ed897 | 3439 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3440 | } |
3441 | break; | |
3442 | case ANYOF_NUPPER: | |
3443 | if (LOC) | |
936ed897 | 3444 | ANYOF_CLASS_SET(ret, ANYOF_NUPPER); |
73b437c8 JH |
3445 | else { |
3446 | for (value = 0; value < 256; value++) | |
3447 | if (!isUPPER(value)) | |
936ed897 | 3448 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3449 | } |
3450 | break; | |
3451 | case ANYOF_XDIGIT: | |
3452 | if (LOC) | |
936ed897 | 3453 | ANYOF_CLASS_SET(ret, ANYOF_XDIGIT); |
73b437c8 JH |
3454 | else { |
3455 | for (value = 0; value < 256; value++) | |
3456 | if (isXDIGIT(value)) | |
936ed897 | 3457 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3458 | } |
3459 | break; | |
3460 | case ANYOF_NXDIGIT: | |
3461 | if (LOC) | |
936ed897 | 3462 | ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT); |
73b437c8 JH |
3463 | else { |
3464 | for (value = 0; value < 256; value++) | |
3465 | if (!isXDIGIT(value)) | |
936ed897 | 3466 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3467 | } |
3468 | break; | |
3469 | default: | |
b45f050a | 3470 | vFAIL("Invalid [::] class"); |
73b437c8 | 3471 | break; |
b8c5462f | 3472 | } |
b8c5462f | 3473 | if (LOC) |
936ed897 | 3474 | ANYOF_FLAGS(ret) |= ANYOF_CLASS; |
73b437c8 | 3475 | continue; |
a0d0e21e LW |
3476 | } |
3477 | } | |
3478 | if (range) { | |
73b437c8 | 3479 | if (lastvalue > value) /* b-a */ { |
b45f050a JF |
3480 | Simple_vFAIL4("Invalid [] range \"%*.*s\"", |
3481 | PL_regcomp_parse - rangebegin, | |
3482 | PL_regcomp_parse - rangebegin, | |
3483 | rangebegin); | |
73b437c8 | 3484 | } |
a0d0e21e LW |
3485 | range = 0; |
3486 | } | |
3487 | else { | |
a0ed51b3 | 3488 | lastvalue = value; |
3280af22 | 3489 | if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend && |
93733859 | 3490 | PL_regcomp_parse[1] != ']') { |
3280af22 | 3491 | PL_regcomp_parse++; |
73b437c8 | 3492 | if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */ |
e476b1b5 | 3493 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3494 | vWARN4(PL_regcomp_parse, |
3495 | "False [] range \"%*.*s\"", | |
3496 | PL_regcomp_parse - rangebegin, | |
3497 | PL_regcomp_parse - rangebegin, | |
3498 | rangebegin); | |
73b437c8 | 3499 | if (!SIZE_ONLY) |
936ed897 | 3500 | ANYOF_BITMAP_SET(ret, '-'); |
73b437c8 JH |
3501 | } else |
3502 | range = 1; | |
a0d0e21e LW |
3503 | continue; /* do it next time */ |
3504 | } | |
a687059c | 3505 | } |
93733859 | 3506 | /* now is the next time */ |
ae5c130c | 3507 | if (!SIZE_ONLY) { |
93733859 | 3508 | #ifndef ASCIIish /* EBCDIC, for example. */ |
8ada0baa | 3509 | if ((isLOWER(lastvalue) && isLOWER(value)) || |
c8dba6f3 GS |
3510 | (isUPPER(lastvalue) && isUPPER(value))) |
3511 | { | |
3512 | I32 i; | |
8ada0baa JH |
3513 | if (isLOWER(lastvalue)) { |
3514 | for (i = lastvalue; i <= value; i++) | |
3515 | if (isLOWER(i)) | |
936ed897 | 3516 | ANYOF_BITMAP_SET(ret, i); |
8ada0baa JH |
3517 | } else { |
3518 | for (i = lastvalue; i <= value; i++) | |
3519 | if (isUPPER(i)) | |
936ed897 | 3520 | ANYOF_BITMAP_SET(ret, i); |
8ada0baa JH |
3521 | } |
3522 | } | |
3523 | else | |
3524 | #endif | |
3525 | for ( ; lastvalue <= value; lastvalue++) | |
936ed897 | 3526 | ANYOF_BITMAP_SET(ret, lastvalue); |
8ada0baa | 3527 | } |
93733859 | 3528 | range = 0; |
a0d0e21e | 3529 | } |
936ed897 IZ |
3530 | if (need_class) { |
3531 | if (SIZE_ONLY) | |
3532 | PL_regsize += ANYOF_CLASS_ADD_SKIP; | |
3533 | else | |
3534 | PL_regcode += ANYOF_CLASS_ADD_SKIP; | |
3535 | } | |
ae5c130c | 3536 | /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */ |
b8c5462f | 3537 | if (!SIZE_ONLY && |
936ed897 | 3538 | (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) { |
a0ed51b3 | 3539 | for (value = 0; value < 256; ++value) { |
936ed897 | 3540 | if (ANYOF_BITMAP_TEST(ret, value)) { |
22c35a8c | 3541 | I32 cf = PL_fold[value]; |
936ed897 | 3542 | ANYOF_BITMAP_SET(ret, cf); |
ae5c130c GS |
3543 | } |
3544 | } | |
936ed897 | 3545 | ANYOF_FLAGS(ret) &= ~ANYOF_FOLD; |
ae5c130c GS |
3546 | } |
3547 | /* optimize inverted simple patterns (e.g. [^a-z]) */ | |
936ed897 | 3548 | if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) { |
b8c5462f | 3549 | for (value = 0; value < ANYOF_BITMAP_SIZE; ++value) |
936ed897 IZ |
3550 | ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL; |
3551 | ANYOF_FLAGS(ret) = 0; | |
ae5c130c | 3552 | } |
a0d0e21e LW |
3553 | return ret; |
3554 | } | |
3555 | ||
a0ed51b3 | 3556 | STATIC regnode * |
cea2e8a9 | 3557 | S_regclassutf8(pTHX) |
a0ed51b3 | 3558 | { |
b8c5462f | 3559 | dTHR; |
936ed897 | 3560 | register char *e; |
470c3474 | 3561 | register U32 value; |
b8c5462f | 3562 | register U32 lastvalue = OOB_UTF8; |
a0ed51b3 LW |
3563 | register I32 range = 0; |
3564 | register regnode *ret; | |
3565 | I32 numlen; | |
3566 | I32 n; | |
3567 | SV *listsv; | |
3568 | U8 flags = 0; | |
b8c5462f | 3569 | I32 namedclass; |
73b437c8 | 3570 | char *rangebegin; |
a0ed51b3 LW |
3571 | |
3572 | if (*PL_regcomp_parse == '^') { /* Complement of range. */ | |
3573 | PL_regnaughty++; | |
3574 | PL_regcomp_parse++; | |
3575 | if (!SIZE_ONLY) | |
3576 | flags |= ANYOF_INVERT; | |
3577 | } | |
3578 | if (!SIZE_ONLY) { | |
3579 | if (FOLD) | |
3580 | flags |= ANYOF_FOLD; | |
3581 | if (LOC) | |
3582 | flags |= ANYOF_LOCALE; | |
79cb57f6 | 3583 | listsv = newSVpvn("# comment\n",10); |
a0ed51b3 LW |
3584 | } |
3585 | ||
e476b1b5 | 3586 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP)) |
936ed897 | 3587 | checkposixcc(); |
b8c5462f | 3588 | |
a0ed51b3 LW |
3589 | if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-') |
3590 | goto skipcond; /* allow 1st char to be ] or - */ | |
3591 | ||
3592 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') { | |
3593 | skipcond: | |
93733859 | 3594 | namedclass = OOB_NAMEDCLASS; |
73b437c8 JH |
3595 | if (!range) |
3596 | rangebegin = PL_regcomp_parse; | |
dfe13c55 | 3597 | value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen); |
a0ed51b3 | 3598 | PL_regcomp_parse += numlen; |
620e46c5 | 3599 | if (value == '[') |
b8c5462f | 3600 | namedclass = regpposixcc(value); |
620e46c5 | 3601 | else if (value == '\\') { |
470c3474 | 3602 | value = (U32)utf8_to_uv((U8*)PL_regcomp_parse, &numlen); |
a0ed51b3 | 3603 | PL_regcomp_parse += numlen; |
470c3474 JH |
3604 | /* Some compilers cannot handle switching on 64-bit integer |
3605 | * values, therefore value cannot be an UV. Yes, this will | |
3606 | * be a problem later if we want switch on Unicode. --jhi */ | |
a0ed51b3 | 3607 | switch (value) { |
b8c5462f JH |
3608 | case 'w': namedclass = ANYOF_ALNUM; break; |
3609 | case 'W': namedclass = ANYOF_NALNUM; break; | |
3610 | case 's': namedclass = ANYOF_SPACE; break; | |
3611 | case 'S': namedclass = ANYOF_NSPACE; break; | |
3612 | case 'd': namedclass = ANYOF_DIGIT; break; | |
3613 | case 'D': namedclass = ANYOF_NDIGIT; break; | |
a0ed51b3 LW |
3614 | case 'p': |
3615 | case 'P': | |
3616 | if (*PL_regcomp_parse == '{') { | |
3617 | e = strchr(PL_regcomp_parse++, '}'); | |
3618 | if (!e) | |
b45f050a | 3619 | vFAIL("Missing right brace on \\p{}"); |
a0ed51b3 LW |
3620 | n = e - PL_regcomp_parse; |
3621 | } | |
3622 | else { | |
3623 | e = PL_regcomp_parse; | |
3624 | n = 1; | |
3625 | } | |
3626 | if (!SIZE_ONLY) { | |
3627 | if (value == 'p') | |
b8c5462f | 3628 | Perl_sv_catpvf(aTHX_ listsv, |
894356b3 | 3629 | "+utf8::%.*s\n", (int)n, PL_regcomp_parse); |
a0ed51b3 | 3630 | else |
cea2e8a9 | 3631 | Perl_sv_catpvf(aTHX_ listsv, |
894356b3 | 3632 | "!utf8::%.*s\n", (int)n, PL_regcomp_parse); |
a0ed51b3 LW |
3633 | } |
3634 | PL_regcomp_parse = e + 1; | |
b8c5462f | 3635 | lastvalue = OOB_UTF8; |
a0ed51b3 | 3636 | continue; |
b8c5462f JH |
3637 | case 'n': value = '\n'; break; |
3638 | case 'r': value = '\r'; break; | |
3639 | case 't': value = '\t'; break; | |
3640 | case 'f': value = '\f'; break; | |
3641 | case 'b': value = '\b'; break; | |
0407a77b | 3642 | #ifdef ASCIIish |
b8c5462f JH |
3643 | case 'e': value = '\033'; break; |
3644 | case 'a': value = '\007'; break; | |
0407a77b GS |
3645 | #else |
3646 | case 'e': value = '\047'; break; | |
3647 | case 'a': value = '\057'; break; | |
3648 | #endif | |
a0ed51b3 LW |
3649 | case 'x': |
3650 | if (*PL_regcomp_parse == '{') { | |
3651 | e = strchr(PL_regcomp_parse++, '}'); | |
b45f050a JF |
3652 | if (!e) |
3653 | vFAIL("Missing right brace on \\x{}"); | |
b21ed0a9 | 3654 | numlen = 1; /* allow underscores */ |
dff6d3cd | 3655 | value = (UV)scan_hex(PL_regcomp_parse, |
b8c5462f JH |
3656 | e - PL_regcomp_parse, |
3657 | &numlen); | |
a0ed51b3 LW |
3658 | PL_regcomp_parse = e + 1; |
3659 | } | |
3660 | else { | |
b21ed0a9 | 3661 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3662 | value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen); |
a0ed51b3 LW |
3663 | PL_regcomp_parse += numlen; |
3664 | } | |
3665 | break; | |
3666 | case 'c': | |
3667 | value = UCHARAT(PL_regcomp_parse++); | |
3668 | value = toCTRL(value); | |
3669 | break; | |
3670 | case '0': case '1': case '2': case '3': case '4': | |
3671 | case '5': case '6': case '7': case '8': case '9': | |
b21ed0a9 | 3672 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3673 | value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen); |
a0ed51b3 LW |
3674 | PL_regcomp_parse += numlen; |
3675 | break; | |
1028017a | 3676 | default: |
e476b1b5 | 3677 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value)) |
b45f050a JF |
3678 | vWARN2(PL_regcomp_parse, |
3679 | "Unrecognized escape \\%c in character class passed through", | |
3680 | (int)value); | |
1028017a | 3681 | break; |
a0ed51b3 LW |
3682 | } |
3683 | } | |
73b437c8 JH |
3684 | if (namedclass > OOB_NAMEDCLASS) { |
3685 | if (range) { /* a-\d, a-[:digit:] */ | |
3686 | if (!SIZE_ONLY) { | |
e476b1b5 | 3687 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3688 | vWARN4(PL_regcomp_parse, |
3689 | "False [] range \"%*.*s\"", | |
3690 | PL_regcomp_parse - rangebegin, | |
3691 | PL_regcomp_parse - rangebegin, | |
3692 | rangebegin); | |
73b437c8 JH |
3693 | Perl_sv_catpvf(aTHX_ listsv, |
3694 | /* 0x002D is Unicode for '-' */ | |
3695 | "%04"UVxf"\n002D\n", (UV)lastvalue); | |
3696 | } | |
3697 | range = 0; | |
3698 | } | |
3699 | if (!SIZE_ONLY) { | |
3700 | switch (namedclass) { | |
3701 | case ANYOF_ALNUM: | |
3702 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break; | |
3703 | case ANYOF_NALNUM: | |
3704 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break; | |
3705 | case ANYOF_ALNUMC: | |
3706 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break; | |
3707 | case ANYOF_NALNUMC: | |
3708 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break; | |
3709 | case ANYOF_ALPHA: | |
3710 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break; | |
3711 | case ANYOF_NALPHA: | |
3712 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break; | |
3713 | case ANYOF_ASCII: | |
3714 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break; | |
3715 | case ANYOF_NASCII: | |
3716 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break; | |
3717 | case ANYOF_CNTRL: | |
3718 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break; | |
3719 | case ANYOF_NCNTRL: | |
3720 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break; | |
3721 | case ANYOF_GRAPH: | |
3722 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break; | |
3723 | case ANYOF_NGRAPH: | |
3724 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break; | |
3725 | case ANYOF_DIGIT: | |
3726 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break; | |
3727 | case ANYOF_NDIGIT: | |
3728 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break; | |
3729 | case ANYOF_LOWER: | |
3730 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break; | |
3731 | case ANYOF_NLOWER: | |
3732 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break; | |
3733 | case ANYOF_PRINT: | |
3734 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break; | |
3735 | case ANYOF_NPRINT: | |
3736 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break; | |
3737 | case ANYOF_PUNCT: | |
3738 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break; | |
3739 | case ANYOF_NPUNCT: | |
3740 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break; | |
3741 | case ANYOF_SPACE: | |
3742 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break; | |
3743 | case ANYOF_NSPACE: | |
3744 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break; | |
3745 | case ANYOF_UPPER: | |
3746 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break; | |
3747 | case ANYOF_NUPPER: | |
3748 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break; | |
3749 | case ANYOF_XDIGIT: | |
3750 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break; | |
3751 | case ANYOF_NXDIGIT: | |
3752 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break; | |
3753 | } | |
3754 | continue; | |
b8c5462f JH |
3755 | } |
3756 | } | |
b8c5462f | 3757 | if (range) { |
73b437c8 | 3758 | if (lastvalue > value) { /* b-a */ |
b45f050a JF |
3759 | Simple_vFAIL4("invalid [] range \"%*.*s\"", |
3760 | PL_regcomp_parse - rangebegin, | |
3761 | PL_regcomp_parse - rangebegin, | |
3762 | rangebegin); | |
73b437c8 | 3763 | } |
a0ed51b3 LW |
3764 | range = 0; |
3765 | } | |
3766 | else { | |
3767 | lastvalue = value; | |
3768 | if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend && | |
93733859 | 3769 | PL_regcomp_parse[1] != ']') { |
a0ed51b3 | 3770 | PL_regcomp_parse++; |
73b437c8 | 3771 | if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */ |
e476b1b5 | 3772 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3773 | vWARN4(PL_regcomp_parse, |
3774 | "False [] range \"%*.*s\"", | |
3775 | PL_regcomp_parse - rangebegin, | |
3776 | PL_regcomp_parse - rangebegin, | |
3777 | rangebegin); | |
73b437c8 JH |
3778 | if (!SIZE_ONLY) |
3779 | Perl_sv_catpvf(aTHX_ listsv, | |
3780 | /* 0x002D is Unicode for '-' */ | |
3781 | "002D\n"); | |
3782 | } else | |
3783 | range = 1; | |
a0ed51b3 LW |
3784 | continue; /* do it next time */ |
3785 | } | |
93733859 JH |
3786 | } |
3787 | /* now is the next time */ | |
93733859 | 3788 | if (!SIZE_ONLY) |
73b437c8 JH |
3789 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n", |
3790 | (UV)lastvalue, (UV)value); | |
93733859 | 3791 | range = 0; |
a0ed51b3 | 3792 | } |
a0ed51b3 LW |
3793 | |
3794 | ret = reganode(ANYOFUTF8, 0); | |
3795 | ||
3796 | if (!SIZE_ONLY) { | |
3797 | SV *rv = swash_init("utf8", "", listsv, 1, 0); | |
3798 | SvREFCNT_dec(listsv); | |
3799 | n = add_data(1,"s"); | |
3800 | PL_regcomp_rx->data->data[n] = (void*)rv; | |
3801 | ARG1_SET(ret, flags); | |
3802 | ARG2_SET(ret, n); | |
3803 | } | |
3804 | ||
3805 | return ret; | |
3806 | } | |
3807 | ||
76e3520e | 3808 | STATIC char* |
cea2e8a9 | 3809 | S_nextchar(pTHX) |
a0d0e21e | 3810 | { |
5c0ca799 | 3811 | dTHR; |
3280af22 | 3812 | char* retval = PL_regcomp_parse++; |
a0d0e21e | 3813 | |
4633a7c4 | 3814 | for (;;) { |
3280af22 NIS |
3815 | if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' && |
3816 | PL_regcomp_parse[2] == '#') { | |
3817 | while (*PL_regcomp_parse && *PL_regcomp_parse != ')') | |
3818 | PL_regcomp_parse++; | |
3819 | PL_regcomp_parse++; | |
4633a7c4 LW |
3820 | continue; |
3821 | } | |
3280af22 NIS |
3822 | if (PL_regflags & PMf_EXTENDED) { |
3823 | if (isSPACE(*PL_regcomp_parse)) { | |
3824 | PL_regcomp_parse++; | |
748a9306 LW |
3825 | continue; |
3826 | } | |
3280af22 NIS |
3827 | else if (*PL_regcomp_parse == '#') { |
3828 | while (*PL_regcomp_parse && *PL_regcomp_parse != '\n') | |
3829 | PL_regcomp_parse++; | |
3830 | PL_regcomp_parse++; | |
748a9306 LW |
3831 | continue; |
3832 | } | |
748a9306 | 3833 | } |
4633a7c4 | 3834 | return retval; |
a0d0e21e | 3835 | } |
a687059c LW |
3836 | } |
3837 | ||
3838 | /* | |
c277df42 | 3839 | - reg_node - emit a node |
a0d0e21e | 3840 | */ |
76e3520e | 3841 | STATIC regnode * /* Location. */ |
cea2e8a9 | 3842 | S_reg_node(pTHX_ U8 op) |
a687059c | 3843 | { |
5c0ca799 | 3844 | dTHR; |
c277df42 IZ |
3845 | register regnode *ret; |
3846 | register regnode *ptr; | |
a687059c | 3847 | |
3280af22 | 3848 | ret = PL_regcode; |
c277df42 | 3849 | if (SIZE_ONLY) { |
6b88bc9c | 3850 | SIZE_ALIGN(PL_regsize); |
3280af22 | 3851 | PL_regsize += 1; |
a0d0e21e LW |
3852 | return(ret); |
3853 | } | |
a687059c | 3854 | |
c277df42 | 3855 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 3856 | ptr = ret; |
c277df42 | 3857 | FILL_ADVANCE_NODE(ptr, op); |
3280af22 | 3858 | PL_regcode = ptr; |
a687059c | 3859 | |
a0d0e21e | 3860 | return(ret); |
a687059c LW |
3861 | } |
3862 | ||
3863 | /* | |
a0d0e21e LW |
3864 | - reganode - emit a node with an argument |
3865 | */ | |
76e3520e | 3866 | STATIC regnode * /* Location. */ |
cea2e8a9 | 3867 | S_reganode(pTHX_ U8 op, U32 arg) |
fe14fcc3 | 3868 | { |
5c0ca799 | 3869 | dTHR; |
c277df42 IZ |
3870 | register regnode *ret; |
3871 | register regnode *ptr; | |
fe14fcc3 | 3872 | |
3280af22 | 3873 | ret = PL_regcode; |
c277df42 | 3874 | if (SIZE_ONLY) { |
6b88bc9c | 3875 | SIZE_ALIGN(PL_regsize); |
3280af22 | 3876 | PL_regsize += 2; |
a0d0e21e LW |
3877 | return(ret); |
3878 | } | |
fe14fcc3 | 3879 | |
c277df42 | 3880 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 3881 | ptr = ret; |
c277df42 | 3882 | FILL_ADVANCE_NODE_ARG(ptr, op, arg); |
3280af22 | 3883 | PL_regcode = ptr; |
fe14fcc3 | 3884 | |
a0d0e21e | 3885 | return(ret); |
fe14fcc3 LW |
3886 | } |
3887 | ||
3888 | /* | |
cd439c50 | 3889 | - reguni - emit (if appropriate) a Unicode character |
a0ed51b3 LW |
3890 | */ |
3891 | STATIC void | |
cea2e8a9 | 3892 | S_reguni(pTHX_ UV uv, char* s, I32* lenp) |
a0ed51b3 | 3893 | { |
c485e607 | 3894 | dTHR; |
a0ed51b3 | 3895 | if (SIZE_ONLY) { |
806e7201 | 3896 | U8 tmpbuf[UTF8_MAXLEN]; |
a0ed51b3 LW |
3897 | *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf; |
3898 | } | |
3899 | else | |
dfe13c55 | 3900 | *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s; |
a0ed51b3 LW |
3901 | |
3902 | } | |
3903 | ||
3904 | /* | |
a0d0e21e LW |
3905 | - reginsert - insert an operator in front of already-emitted operand |
3906 | * | |
3907 | * Means relocating the operand. | |
3908 | */ | |
76e3520e | 3909 | STATIC void |
cea2e8a9 | 3910 | S_reginsert(pTHX_ U8 op, regnode *opnd) |
a687059c | 3911 | { |
5c0ca799 | 3912 | dTHR; |
c277df42 IZ |
3913 | register regnode *src; |
3914 | register regnode *dst; | |
3915 | register regnode *place; | |
3916 | register int offset = regarglen[(U8)op]; | |
3917 | ||
22c35a8c | 3918 | /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */ |
c277df42 IZ |
3919 | |
3920 | if (SIZE_ONLY) { | |
3280af22 | 3921 | PL_regsize += NODE_STEP_REGNODE + offset; |
a0d0e21e LW |
3922 | return; |
3923 | } | |
a687059c | 3924 | |
3280af22 NIS |
3925 | src = PL_regcode; |
3926 | PL_regcode += NODE_STEP_REGNODE + offset; | |
3927 | dst = PL_regcode; | |
a0d0e21e | 3928 | while (src > opnd) |
c277df42 | 3929 | StructCopy(--src, --dst, regnode); |
a0d0e21e LW |
3930 | |
3931 | place = opnd; /* Op node, where operand used to be. */ | |
c277df42 IZ |
3932 | src = NEXTOPER(place); |
3933 | FILL_ADVANCE_NODE(place, op); | |
3934 | Zero(src, offset, regnode); | |
a687059c LW |
3935 | } |
3936 | ||
3937 | /* | |
c277df42 | 3938 | - regtail - set the next-pointer at the end of a node chain of p to val. |
a0d0e21e | 3939 | */ |
76e3520e | 3940 | STATIC void |
cea2e8a9 | 3941 | S_regtail(pTHX_ regnode *p, regnode *val) |
a687059c | 3942 | { |
5c0ca799 | 3943 | dTHR; |
c277df42 IZ |
3944 | register regnode *scan; |
3945 | register regnode *temp; | |
a0d0e21e | 3946 | |
c277df42 | 3947 | if (SIZE_ONLY) |
a0d0e21e LW |
3948 | return; |
3949 | ||
3950 | /* Find last node. */ | |
3951 | scan = p; | |
3952 | for (;;) { | |
3953 | temp = regnext(scan); | |
3954 | if (temp == NULL) | |
3955 | break; | |
3956 | scan = temp; | |
3957 | } | |
a687059c | 3958 | |
c277df42 IZ |
3959 | if (reg_off_by_arg[OP(scan)]) { |
3960 | ARG_SET(scan, val - scan); | |
a0ed51b3 LW |
3961 | } |
3962 | else { | |
c277df42 IZ |
3963 | NEXT_OFF(scan) = val - scan; |
3964 | } | |
a687059c LW |
3965 | } |
3966 | ||
3967 | /* | |
a0d0e21e LW |
3968 | - regoptail - regtail on operand of first argument; nop if operandless |
3969 | */ | |
76e3520e | 3970 | STATIC void |
cea2e8a9 | 3971 | S_regoptail(pTHX_ regnode *p, regnode *val) |
a687059c | 3972 | { |
5c0ca799 | 3973 | dTHR; |
a0d0e21e | 3974 | /* "Operandless" and "op != BRANCH" are synonymous in practice. */ |
c277df42 IZ |
3975 | if (p == NULL || SIZE_ONLY) |
3976 | return; | |
22c35a8c | 3977 | if (PL_regkind[(U8)OP(p)] == BRANCH) { |
c277df42 | 3978 | regtail(NEXTOPER(p), val); |
a0ed51b3 | 3979 | } |
22c35a8c | 3980 | else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) { |
c277df42 | 3981 | regtail(NEXTOPER(NEXTOPER(p)), val); |
a0ed51b3 LW |
3982 | } |
3983 | else | |
a0d0e21e | 3984 | return; |
a687059c LW |
3985 | } |
3986 | ||
3987 | /* | |
3988 | - regcurly - a little FSA that accepts {\d+,?\d*} | |
3989 | */ | |
79072805 | 3990 | STATIC I32 |
cea2e8a9 | 3991 | S_regcurly(pTHX_ register char *s) |
a687059c LW |
3992 | { |
3993 | if (*s++ != '{') | |
3994 | return FALSE; | |
f0fcb552 | 3995 | if (!isDIGIT(*s)) |
a687059c | 3996 | return FALSE; |
f0fcb552 | 3997 | while (isDIGIT(*s)) |
a687059c LW |
3998 | s++; |
3999 | if (*s == ',') | |
4000 | s++; | |
f0fcb552 | 4001 | while (isDIGIT(*s)) |
a687059c LW |
4002 | s++; |
4003 | if (*s != '}') | |
4004 | return FALSE; | |
4005 | return TRUE; | |
4006 | } | |
4007 | ||
a687059c | 4008 | |
76e3520e | 4009 | STATIC regnode * |
cea2e8a9 | 4010 | S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l) |
c277df42 | 4011 | { |
35ff7856 | 4012 | #ifdef DEBUGGING |
f248d071 | 4013 | register U8 op = EXACT; /* Arbitrary non-END op. */ |
155aba94 | 4014 | register regnode *next; |
c277df42 IZ |
4015 | |
4016 | while (op != END && (!last || node < last)) { | |
4017 | /* While that wasn't END last time... */ | |
4018 | ||
4019 | NODE_ALIGN(node); | |
4020 | op = OP(node); | |
4021 | if (op == CLOSE) | |
4022 | l--; | |
4023 | next = regnext(node); | |
4024 | /* Where, what. */ | |
4025 | if (OP(node) == OPTIMIZED) | |
4026 | goto after_print; | |
4027 | regprop(sv, node); | |
b900a521 | 4028 | PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start), |
f1dbda3d | 4029 | (int)(2*l + 1), "", SvPVX(sv)); |
c277df42 IZ |
4030 | if (next == NULL) /* Next ptr. */ |
4031 | PerlIO_printf(Perl_debug_log, "(0)"); | |
4032 | else | |
b900a521 | 4033 | PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start)); |
c277df42 IZ |
4034 | (void)PerlIO_putc(Perl_debug_log, '\n'); |
4035 | after_print: | |
22c35a8c | 4036 | if (PL_regkind[(U8)op] == BRANCHJ) { |
c277df42 IZ |
4037 | register regnode *nnode = (OP(next) == LONGJMP |
4038 | ? regnext(next) | |
4039 | : next); | |
4040 | if (last && nnode > last) | |
4041 | nnode = last; | |
4042 | node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1); | |
a0ed51b3 | 4043 | } |
22c35a8c | 4044 | else if (PL_regkind[(U8)op] == BRANCH) { |
c277df42 | 4045 | node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1); |
a0ed51b3 LW |
4046 | } |
4047 | else if ( op == CURLY) { /* `next' might be very big: optimizer */ | |
c277df42 IZ |
4048 | node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS, |
4049 | NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1); | |
a0ed51b3 | 4050 | } |
22c35a8c | 4051 | else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) { |
c277df42 IZ |
4052 | node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS, |
4053 | next, sv, l + 1); | |
a0ed51b3 LW |
4054 | } |
4055 | else if ( op == PLUS || op == STAR) { | |
c277df42 | 4056 | node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1); |
a0ed51b3 LW |
4057 | } |
4058 | else if (op == ANYOF) { | |
c277df42 | 4059 | node = NEXTOPER(node); |
936ed897 | 4060 | node += ANYOF_SKIP; |
a0ed51b3 | 4061 | } |
22c35a8c | 4062 | else if (PL_regkind[(U8)op] == EXACT) { |
c277df42 | 4063 | /* Literal string, where present. */ |
cd439c50 | 4064 | node += NODE_SZ_STR(node) - 1; |
c277df42 | 4065 | node = NEXTOPER(node); |
a0ed51b3 LW |
4066 | } |
4067 | else { | |
c277df42 IZ |
4068 | node = NEXTOPER(node); |
4069 | node += regarglen[(U8)op]; | |
4070 | } | |
4071 | if (op == CURLYX || op == OPEN) | |
4072 | l++; | |
4073 | else if (op == WHILEM) | |
4074 | l--; | |
4075 | } | |
17c3b450 | 4076 | #endif /* DEBUGGING */ |
c277df42 IZ |
4077 | return node; |
4078 | } | |
4079 | ||
a687059c | 4080 | /* |
fd181c75 | 4081 | - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form |
a687059c LW |
4082 | */ |
4083 | void | |
864dbfa3 | 4084 | Perl_regdump(pTHX_ regexp *r) |
a687059c | 4085 | { |
35ff7856 | 4086 | #ifdef DEBUGGING |
5c0ca799 | 4087 | dTHR; |
46fc3d4c | 4088 | SV *sv = sv_newmortal(); |
a687059c | 4089 | |
c277df42 | 4090 | (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0); |
a0d0e21e LW |
4091 | |
4092 | /* Header fields of interest. */ | |
c277df42 | 4093 | if (r->anchored_substr) |
7b0972df JH |
4094 | PerlIO_printf(Perl_debug_log, |
4095 | "anchored `%s%.*s%s'%s at %"IVdf" ", | |
3280af22 | 4096 | PL_colors[0], |
7b0972df | 4097 | (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)), |
c277df42 | 4098 | SvPVX(r->anchored_substr), |
3280af22 | 4099 | PL_colors[1], |
c277df42 | 4100 | SvTAIL(r->anchored_substr) ? "$" : "", |
7b0972df | 4101 | (IV)r->anchored_offset); |
c277df42 | 4102 | if (r->float_substr) |
7b0972df JH |
4103 | PerlIO_printf(Perl_debug_log, |
4104 | "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ", | |
3280af22 | 4105 | PL_colors[0], |
7b0972df | 4106 | (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)), |
2c2d71f5 | 4107 | SvPVX(r->float_substr), |
3280af22 | 4108 | PL_colors[1], |
c277df42 | 4109 | SvTAIL(r->float_substr) ? "$" : "", |
7b0972df | 4110 | (IV)r->float_min_offset, (UV)r->float_max_offset); |
c277df42 IZ |
4111 | if (r->check_substr) |
4112 | PerlIO_printf(Perl_debug_log, | |
4113 | r->check_substr == r->float_substr | |
4114 | ? "(checking floating" : "(checking anchored"); | |
4115 | if (r->reganch & ROPT_NOSCAN) | |
4116 | PerlIO_printf(Perl_debug_log, " noscan"); | |
4117 | if (r->reganch & ROPT_CHECK_ALL) | |
4118 | PerlIO_printf(Perl_debug_log, " isall"); | |
4119 | if (r->check_substr) | |
4120 | PerlIO_printf(Perl_debug_log, ") "); | |
4121 | ||
46fc3d4c | 4122 | if (r->regstclass) { |
4123 | regprop(sv, r->regstclass); | |
4124 | PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv)); | |
4125 | } | |
774d564b | 4126 | if (r->reganch & ROPT_ANCH) { |
4127 | PerlIO_printf(Perl_debug_log, "anchored"); | |
4128 | if (r->reganch & ROPT_ANCH_BOL) | |
4129 | PerlIO_printf(Perl_debug_log, "(BOL)"); | |
c277df42 IZ |
4130 | if (r->reganch & ROPT_ANCH_MBOL) |
4131 | PerlIO_printf(Perl_debug_log, "(MBOL)"); | |
cad2e5aa JH |
4132 | if (r->reganch & ROPT_ANCH_SBOL) |
4133 | PerlIO_printf(Perl_debug_log, "(SBOL)"); | |
774d564b | 4134 | if (r->reganch & ROPT_ANCH_GPOS) |
4135 | PerlIO_printf(Perl_debug_log, "(GPOS)"); | |
4136 | PerlIO_putc(Perl_debug_log, ' '); | |
4137 | } | |
c277df42 IZ |
4138 | if (r->reganch & ROPT_GPOS_SEEN) |
4139 | PerlIO_printf(Perl_debug_log, "GPOS "); | |
a0d0e21e | 4140 | if (r->reganch & ROPT_SKIP) |
760ac839 | 4141 | PerlIO_printf(Perl_debug_log, "plus "); |
a0d0e21e | 4142 | if (r->reganch & ROPT_IMPLICIT) |
760ac839 | 4143 | PerlIO_printf(Perl_debug_log, "implicit "); |
760ac839 | 4144 | PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen); |
ce862d02 IZ |
4145 | if (r->reganch & ROPT_EVAL_SEEN) |
4146 | PerlIO_printf(Perl_debug_log, "with eval "); | |
760ac839 | 4147 | PerlIO_printf(Perl_debug_log, "\n"); |
17c3b450 | 4148 | #endif /* DEBUGGING */ |
a687059c LW |
4149 | } |
4150 | ||
653099ff GS |
4151 | STATIC void |
4152 | S_put_byte(pTHX_ SV *sv, int c) | |
4153 | { | |
4154 | if (c <= ' ' || c == 127 || c == 255) | |
4155 | Perl_sv_catpvf(aTHX_ sv, "\\%o", c); | |
4156 | else if (c == '-' || c == ']' || c == '\\' || c == '^') | |
4157 | Perl_sv_catpvf(aTHX_ sv, "\\%c", c); | |
4158 | else | |
4159 | Perl_sv_catpvf(aTHX_ sv, "%c", c); | |
4160 | } | |
4161 | ||
a687059c | 4162 | /* |
a0d0e21e LW |
4163 | - regprop - printable representation of opcode |
4164 | */ | |
46fc3d4c | 4165 | void |
864dbfa3 | 4166 | Perl_regprop(pTHX_ SV *sv, regnode *o) |
a687059c | 4167 | { |
35ff7856 | 4168 | #ifdef DEBUGGING |
5c0ca799 | 4169 | dTHR; |
9b155405 | 4170 | register int k; |
a0d0e21e | 4171 | |
54dc92de | 4172 | sv_setpvn(sv, "", 0); |
9b155405 | 4173 | if (OP(o) >= reg_num) /* regnode.type is unsigned */ |
b45f050a | 4174 | FAIL("Corrupted regexp opcode"); |
9b155405 IZ |
4175 | sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */ |
4176 | ||
4177 | k = PL_regkind[(U8)OP(o)]; | |
4178 | ||
4179 | if (k == EXACT) | |
7821416a | 4180 | Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0], |
cd439c50 | 4181 | STR_LEN(o), STRING(o), PL_colors[1]); |
9b155405 IZ |
4182 | else if (k == CURLY) { |
4183 | if (OP(o) == CURLYM || OP(o) == CURLYN) | |
cea2e8a9 GS |
4184 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */ |
4185 | Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o)); | |
a0d0e21e | 4186 | } |
2c2d71f5 JH |
4187 | else if (k == WHILEM && o->flags) /* Ordinal/of */ |
4188 | Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4); | |
9b155405 | 4189 | else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP ) |
894356b3 | 4190 | Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */ |
9b155405 | 4191 | else if (k == LOGICAL) |
04ebc1ab | 4192 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */ |
653099ff GS |
4193 | else if (k == ANYOF) { |
4194 | int i, rangestart = -1; | |
4195 | const char * const out[] = { /* Should be syncronized with | |
4196 | a table in regcomp.h */ | |
4197 | "\\w", | |
4198 | "\\W", | |
4199 | "\\s", | |
4200 | "\\S", | |
4201 | "\\d", | |
4202 | "\\D", | |
4203 | "[:alnum:]", | |
4204 | "[:^alnum:]", | |
4205 | "[:alpha:]", | |
4206 | "[:^alpha:]", | |
4207 | "[:ascii:]", | |
4208 | "[:^ascii:]", | |
4209 | "[:ctrl:]", | |
4210 | "[:^ctrl:]", | |
4211 | "[:graph:]", | |
4212 | "[:^graph:]", | |
4213 | "[:lower:]", | |
4214 | "[:^lower:]", | |
4215 | "[:print:]", | |
4216 | "[:^print:]", | |
4217 | "[:punct:]", | |
4218 | "[:^punct:]", | |
4219 | "[:upper:]", | |
4220 | "[:!upper:]", | |
4221 | "[:xdigit:]", | |
4222 | "[:^xdigit:]" | |
4223 | }; | |
4224 | ||
4225 | if (o->flags & ANYOF_LOCALE) | |
4226 | sv_catpv(sv, "{loc}"); | |
4227 | if (o->flags & ANYOF_FOLD) | |
4228 | sv_catpv(sv, "{i}"); | |
4229 | Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]); | |
4230 | if (o->flags & ANYOF_INVERT) | |
4231 | sv_catpv(sv, "^"); | |
4232 | for (i = 0; i <= 256; i++) { | |
4233 | if (i < 256 && ANYOF_BITMAP_TEST(o,i)) { | |
4234 | if (rangestart == -1) | |
4235 | rangestart = i; | |
4236 | } else if (rangestart != -1) { | |
4237 | if (i <= rangestart + 3) | |
4238 | for (; rangestart < i; rangestart++) | |
4239 | put_byte(sv, rangestart); | |
4240 | else { | |
4241 | put_byte(sv, rangestart); | |
4242 | sv_catpv(sv, "-"); | |
4243 | put_byte(sv, i - 1); | |
4244 | } | |
4245 | rangestart = -1; | |
4246 | } | |
4247 | } | |
4248 | if (o->flags & ANYOF_CLASS) | |
4249 | for (i = 0; i < sizeof(out)/sizeof(char*); i++) | |
4250 | if (ANYOF_CLASS_TEST(o,i)) | |
4251 | sv_catpv(sv, out[i]); | |
4252 | Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]); | |
4253 | } | |
9b155405 | 4254 | else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH)) |
cea2e8a9 | 4255 | Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags); |
17c3b450 | 4256 | #endif /* DEBUGGING */ |
35ff7856 | 4257 | } |
a687059c | 4258 | |
cad2e5aa JH |
4259 | SV * |
4260 | Perl_re_intuit_string(pTHX_ regexp *prog) | |
4261 | { /* Assume that RE_INTUIT is set */ | |
4262 | DEBUG_r( | |
4263 | { STRLEN n_a; | |
4264 | char *s = SvPV(prog->check_substr,n_a); | |
4265 | ||
4266 | if (!PL_colorset) reginitcolors(); | |
4267 | PerlIO_printf(Perl_debug_log, | |
4268 | "%sUsing REx substr:%s `%s%.60s%s%s'\n", | |
4269 | PL_colors[4],PL_colors[5],PL_colors[0], | |
4270 | s, | |
4271 | PL_colors[1], | |
4272 | (strlen(s) > 60 ? "..." : "")); | |
4273 | } ); | |
4274 | ||
4275 | return prog->check_substr; | |
4276 | } | |
4277 | ||
2b69d0c2 | 4278 | void |
864dbfa3 | 4279 | Perl_pregfree(pTHX_ struct regexp *r) |
a687059c | 4280 | { |
5c0ca799 | 4281 | dTHR; |
adac82c7 | 4282 | DEBUG_r(if (!PL_colorset) reginitcolors()); |
7821416a IZ |
4283 | |
4284 | if (!r || (--r->refcnt > 0)) | |
4285 | return; | |
cad2e5aa JH |
4286 | DEBUG_r(PerlIO_printf(Perl_debug_log, |
4287 | "%sFreeing REx:%s `%s%.60s%s%s'\n", | |
4288 | PL_colors[4],PL_colors[5],PL_colors[0], | |
4289 | r->precomp, | |
4290 | PL_colors[1], | |
4291 | (strlen(r->precomp) > 60 ? "..." : ""))); | |
4292 | ||
c277df42 | 4293 | if (r->precomp) |
a0d0e21e | 4294 | Safefree(r->precomp); |
cf93c79d IZ |
4295 | if (RX_MATCH_COPIED(r)) |
4296 | Safefree(r->subbeg); | |
a193d654 GS |
4297 | if (r->substrs) { |
4298 | if (r->anchored_substr) | |
4299 | SvREFCNT_dec(r->anchored_substr); | |
4300 | if (r->float_substr) | |
4301 | SvREFCNT_dec(r->float_substr); | |
2779dcf1 | 4302 | Safefree(r->substrs); |
a193d654 | 4303 | } |
c277df42 IZ |
4304 | if (r->data) { |
4305 | int n = r->data->count; | |
dfad63ad HS |
4306 | AV* new_comppad = NULL; |
4307 | AV* old_comppad; | |
4308 | SV** old_curpad; | |
4309 | ||
c277df42 IZ |
4310 | while (--n >= 0) { |
4311 | switch (r->data->what[n]) { | |
4312 | case 's': | |
4313 | SvREFCNT_dec((SV*)r->data->data[n]); | |
4314 | break; | |
653099ff GS |
4315 | case 'f': |
4316 | Safefree(r->data->data[n]); | |
4317 | break; | |
dfad63ad HS |
4318 | case 'p': |
4319 | new_comppad = (AV*)r->data->data[n]; | |
4320 | break; | |
c277df42 | 4321 | case 'o': |
dfad63ad | 4322 | if (new_comppad == NULL) |
cea2e8a9 | 4323 | Perl_croak(aTHX_ "panic: pregfree comppad"); |
dfad63ad HS |
4324 | old_comppad = PL_comppad; |
4325 | old_curpad = PL_curpad; | |
4326 | PL_comppad = new_comppad; | |
4327 | PL_curpad = AvARRAY(new_comppad); | |
c277df42 | 4328 | op_free((OP_4tree*)r->data->data[n]); |
dfad63ad HS |
4329 | PL_comppad = old_comppad; |
4330 | PL_curpad = old_curpad; | |
4331 | SvREFCNT_dec((SV*)new_comppad); | |
4332 | new_comppad = NULL; | |
c277df42 IZ |
4333 | break; |
4334 | case 'n': | |
4335 | break; | |
4336 | default: | |
4337 | FAIL2("panic: regfree data code '%c'", r->data->what[n]); | |
4338 | } | |
4339 | } | |
4340 | Safefree(r->data->what); | |
4341 | Safefree(r->data); | |
a0d0e21e LW |
4342 | } |
4343 | Safefree(r->startp); | |
4344 | Safefree(r->endp); | |
4345 | Safefree(r); | |
a687059c | 4346 | } |
c277df42 IZ |
4347 | |
4348 | /* | |
4349 | - regnext - dig the "next" pointer out of a node | |
4350 | * | |
4351 | * [Note, when REGALIGN is defined there are two places in regmatch() | |
4352 | * that bypass this code for speed.] | |
4353 | */ | |
4354 | regnode * | |
864dbfa3 | 4355 | Perl_regnext(pTHX_ register regnode *p) |
c277df42 | 4356 | { |
5c0ca799 | 4357 | dTHR; |
c277df42 IZ |
4358 | register I32 offset; |
4359 | ||
3280af22 | 4360 | if (p == &PL_regdummy) |
c277df42 IZ |
4361 | return(NULL); |
4362 | ||
4363 | offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p)); | |
4364 | if (offset == 0) | |
4365 | return(NULL); | |
4366 | ||
c277df42 | 4367 | return(p+offset); |
c277df42 IZ |
4368 | } |
4369 | ||
01f988be | 4370 | STATIC void |
cea2e8a9 | 4371 | S_re_croak2(pTHX_ const char* pat1,const char* pat2,...) |
c277df42 IZ |
4372 | { |
4373 | va_list args; | |
4374 | STRLEN l1 = strlen(pat1); | |
4375 | STRLEN l2 = strlen(pat2); | |
4376 | char buf[512]; | |
06bf62c7 | 4377 | SV *msv; |
c277df42 IZ |
4378 | char *message; |
4379 | ||
4380 | if (l1 > 510) | |
4381 | l1 = 510; | |
4382 | if (l1 + l2 > 510) | |
4383 | l2 = 510 - l1; | |
4384 | Copy(pat1, buf, l1 , char); | |
4385 | Copy(pat2, buf + l1, l2 , char); | |
3b818b81 GS |
4386 | buf[l1 + l2] = '\n'; |
4387 | buf[l1 + l2 + 1] = '\0'; | |
8736538c AS |
4388 | #ifdef I_STDARG |
4389 | /* ANSI variant takes additional second argument */ | |
c277df42 | 4390 | va_start(args, pat2); |
8736538c AS |
4391 | #else |
4392 | va_start(args); | |
4393 | #endif | |
5a844595 | 4394 | msv = vmess(buf, &args); |
c277df42 | 4395 | va_end(args); |
06bf62c7 | 4396 | message = SvPV(msv,l1); |
c277df42 IZ |
4397 | if (l1 > 512) |
4398 | l1 = 512; | |
4399 | Copy(message, buf, l1 , char); | |
4400 | buf[l1] = '\0'; /* Overwrite \n */ | |
cea2e8a9 | 4401 | Perl_croak(aTHX_ "%s", buf); |
c277df42 | 4402 | } |
a0ed51b3 LW |
4403 | |
4404 | /* XXX Here's a total kludge. But we need to re-enter for swash routines. */ | |
4405 | ||
4406 | void | |
864dbfa3 | 4407 | Perl_save_re_context(pTHX) |
c485e607 NIS |
4408 | { |
4409 | dTHR; | |
a0ed51b3 LW |
4410 | SAVEPPTR(PL_bostr); |
4411 | SAVEPPTR(PL_regprecomp); /* uncompiled string. */ | |
4412 | SAVEI32(PL_regnpar); /* () count. */ | |
4413 | SAVEI32(PL_regsize); /* Code size. */ | |
4414 | SAVEI16(PL_regflags); /* are we folding, multilining? */ | |
4415 | SAVEPPTR(PL_reginput); /* String-input pointer. */ | |
4416 | SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */ | |
4417 | SAVEPPTR(PL_regeol); /* End of input, for $ check. */ | |
7766f137 GS |
4418 | SAVEVPTR(PL_regstartp); /* Pointer to startp array. */ |
4419 | SAVEVPTR(PL_regendp); /* Ditto for endp. */ | |
4420 | SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */ | |
a0ed51b3 | 4421 | SAVEPPTR(PL_regtill); /* How far we are required to go. */ |
e8347627 | 4422 | SAVEI8(PL_regprev); /* char before regbol, \n if none */ |
7766f137 | 4423 | SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */ |
a0ed51b3 LW |
4424 | PL_reg_start_tmp = 0; |
4425 | SAVEFREEPV(PL_reg_start_tmp); | |
4426 | SAVEI32(PL_reg_start_tmpl); /* from regexec.c */ | |
4427 | PL_reg_start_tmpl = 0; | |
7766f137 | 4428 | SAVEVPTR(PL_regdata); |
a0ed51b3 LW |
4429 | SAVEI32(PL_reg_flags); /* from regexec.c */ |
4430 | SAVEI32(PL_reg_eval_set); /* from regexec.c */ | |
4431 | SAVEI32(PL_regnarrate); /* from regexec.c */ | |
7766f137 | 4432 | SAVEVPTR(PL_regprogram); /* from regexec.c */ |
a0ed51b3 | 4433 | SAVEINT(PL_regindent); /* from regexec.c */ |
7766f137 GS |
4434 | SAVEVPTR(PL_regcc); /* from regexec.c */ |
4435 | SAVEVPTR(PL_curcop); | |
4436 | SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */ | |
a0ed51b3 LW |
4437 | SAVEI32(PL_regseen); /* from regcomp.c */ |
4438 | SAVEI32(PL_regsawback); /* Did we see \1, ...? */ | |
4439 | SAVEI32(PL_regnaughty); /* How bad is this pattern? */ | |
7766f137 | 4440 | SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */ |
a0ed51b3 LW |
4441 | SAVEPPTR(PL_regxend); /* End of input for compile */ |
4442 | SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */ | |
7766f137 GS |
4443 | SAVEVPTR(PL_reg_call_cc); /* from regexec.c */ |
4444 | SAVEVPTR(PL_reg_re); /* from regexec.c */ | |
54b6e2fa IZ |
4445 | SAVEPPTR(PL_reg_ganch); /* from regexec.c */ |
4446 | SAVESPTR(PL_reg_sv); /* from regexec.c */ | |
7766f137 | 4447 | SAVEVPTR(PL_reg_magic); /* from regexec.c */ |
54b6e2fa | 4448 | SAVEI32(PL_reg_oldpos); /* from regexec.c */ |
7766f137 GS |
4449 | SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */ |
4450 | SAVEVPTR(PL_reg_curpm); /* from regexec.c */ | |
54b6e2fa IZ |
4451 | #ifdef DEBUGGING |
4452 | SAVEPPTR(PL_reg_starttry); /* from regexec.c */ | |
4453 | #endif | |
a0ed51b3 | 4454 | } |
51371543 GS |
4455 | |
4456 | #ifdef PERL_OBJECT | |
51371543 GS |
4457 | #include "XSUB.h" |
4458 | #undef this | |
4459 | #define this pPerl | |
4460 | #endif | |
4461 | ||
4462 | static void | |
4463 | clear_re(pTHXo_ void *r) | |
4464 | { | |
4465 | ReREFCNT_dec((regexp *)r); | |
4466 | } | |
4467 |