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 | */ | |
a4eb266f | 223 | #define FAIL(msg) \ |
8615cb43 | 224 | STMT_START { \ |
a4eb266f | 225 | char *ellipses = ""; \ |
b45f050a JF |
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; \ | |
a4eb266f | 234 | ellipses = "..."; \ |
b45f050a JF |
235 | } \ |
236 | Perl_croak(aTHX_ "%s in regex m/%.*s%s/", \ | |
d2560b70 | 237 | msg, (int)len, PL_regprecomp, ellipses); \ |
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 | */ | |
a4eb266f | 245 | #define FAIL2(pat,msg) \ |
8615cb43 | 246 | STMT_START { \ |
a4eb266f | 247 | char *ellipses = ""; \ |
b45f050a JF |
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; \ | |
a4eb266f | 256 | ellipses = "..."; \ |
b45f050a JF |
257 | } \ |
258 | S_re_croak2(aTHX_ pat, " in regex m/%.*s%s/", \ | |
d2560b70 | 259 | msg, (int)len, PL_regprecomp, ellipses); \ |
b45f050a JF |
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, \ | |
d2560b70 | 271 | m, (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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, \ | |
d2560b70 | 292 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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, \ | |
d2560b70 | 314 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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,\ | |
d2560b70 | 335 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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,\ | |
d2560b70 | 345 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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,\ | |
d2560b70 | 353 | m, (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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, \ | |
d2560b70 | 362 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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, \ | |
d2560b70 | 370 | (int)offset, PL_regprecomp, PL_regprecomp + offset); \ |
b45f050a JF |
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, \ | |
d2560b70 | 378 | (int)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 | ||
aaa51d5e | 446 | for (value = 0; value <= ANYOF_MAX; value += 2) |
653099ff GS |
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 | 1965 | |
569233ed SB |
1966 | ENTER; |
1967 | Perl_save_re_context(aTHX); | |
c277df42 | 1968 | rop = sv_compile_2op(sv, &sop, "re", &av); |
569233ed | 1969 | LEAVE; |
c277df42 | 1970 | |
dfad63ad | 1971 | n = add_data(3, "nop"); |
3280af22 | 1972 | PL_regcomp_rx->data->data[n] = (void*)rop; |
dfad63ad HS |
1973 | PL_regcomp_rx->data->data[n+1] = (void*)sop; |
1974 | PL_regcomp_rx->data->data[n+2] = (void*)av; | |
c277df42 | 1975 | SvREFCNT_dec(sv); |
a0ed51b3 | 1976 | } |
e24b16f9 GS |
1977 | else { /* First pass */ |
1978 | if (PL_reginterp_cnt < ++PL_seen_evals | |
1979 | && PL_curcop != &PL_compiling) | |
2cd61cdb IZ |
1980 | /* No compiled RE interpolated, has runtime |
1981 | components ===> unsafe. */ | |
1982 | FAIL("Eval-group not allowed at runtime, use re 'eval'"); | |
3280af22 | 1983 | if (PL_tainted) |
cc6b7395 | 1984 | FAIL("Eval-group in insecure regular expression"); |
c277df42 IZ |
1985 | } |
1986 | ||
1987 | nextchar(); | |
0f5d15d6 IZ |
1988 | if (logical) { |
1989 | ret = reg_node(LOGICAL); | |
1990 | if (!SIZE_ONLY) | |
1991 | ret->flags = 2; | |
1992 | regtail(ret, reganode(EVAL, n)); | |
1993 | return ret; | |
1994 | } | |
c277df42 IZ |
1995 | return reganode(EVAL, n); |
1996 | } | |
1997 | case '(': | |
1998 | { | |
3280af22 NIS |
1999 | if (PL_regcomp_parse[0] == '?') { |
2000 | if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!' | |
2001 | || PL_regcomp_parse[1] == '<' | |
2002 | || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */ | |
c277df42 IZ |
2003 | I32 flag; |
2004 | ||
2005 | ret = reg_node(LOGICAL); | |
0f5d15d6 IZ |
2006 | if (!SIZE_ONLY) |
2007 | ret->flags = 1; | |
c277df42 IZ |
2008 | regtail(ret, reg(1, &flag)); |
2009 | goto insert_if; | |
2010 | } | |
a0ed51b3 LW |
2011 | } |
2012 | else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) { | |
3280af22 | 2013 | parno = atoi(PL_regcomp_parse++); |
c277df42 | 2014 | |
3280af22 NIS |
2015 | while (isDIGIT(*PL_regcomp_parse)) |
2016 | PL_regcomp_parse++; | |
c277df42 IZ |
2017 | ret = reganode(GROUPP, parno); |
2018 | if ((c = *nextchar()) != ')') | |
b45f050a | 2019 | vFAIL("Switch condition not recognized"); |
c277df42 IZ |
2020 | insert_if: |
2021 | regtail(ret, reganode(IFTHEN, 0)); | |
2022 | br = regbranch(&flags, 1); | |
2023 | if (br == NULL) | |
2024 | br = reganode(LONGJMP, 0); | |
2025 | else | |
2026 | regtail(br, reganode(LONGJMP, 0)); | |
2027 | c = *nextchar(); | |
d1b80229 IZ |
2028 | if (flags&HASWIDTH) |
2029 | *flagp |= HASWIDTH; | |
c277df42 IZ |
2030 | if (c == '|') { |
2031 | lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */ | |
2032 | regbranch(&flags, 1); | |
2033 | regtail(ret, lastbr); | |
d1b80229 IZ |
2034 | if (flags&HASWIDTH) |
2035 | *flagp |= HASWIDTH; | |
c277df42 | 2036 | c = *nextchar(); |
a0ed51b3 LW |
2037 | } |
2038 | else | |
c277df42 IZ |
2039 | lastbr = NULL; |
2040 | if (c != ')') | |
8615cb43 | 2041 | vFAIL("Switch (?(condition)... contains too many branches"); |
c277df42 IZ |
2042 | ender = reg_node(TAIL); |
2043 | regtail(br, ender); | |
2044 | if (lastbr) { | |
2045 | regtail(lastbr, ender); | |
2046 | regtail(NEXTOPER(NEXTOPER(lastbr)), ender); | |
a0ed51b3 LW |
2047 | } |
2048 | else | |
c277df42 IZ |
2049 | regtail(ret, ender); |
2050 | return ret; | |
a0ed51b3 LW |
2051 | } |
2052 | else { | |
b45f050a | 2053 | vFAIL2("Unknown switch condition (?(%.2s", PL_regcomp_parse); |
c277df42 IZ |
2054 | } |
2055 | } | |
1b1626e4 | 2056 | case 0: |
b45f050a | 2057 | PL_regcomp_parse--; /* for vFAIL to print correctly */ |
8615cb43 | 2058 | vFAIL("Sequence (? incomplete"); |
1b1626e4 | 2059 | break; |
a0d0e21e | 2060 | default: |
3280af22 | 2061 | --PL_regcomp_parse; |
ca9dfc88 | 2062 | parse_flags: |
3280af22 NIS |
2063 | while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) { |
2064 | if (*PL_regcomp_parse != 'o') | |
2065 | pmflag(flagsp, *PL_regcomp_parse); | |
2066 | ++PL_regcomp_parse; | |
ca9dfc88 | 2067 | } |
3280af22 | 2068 | if (*PL_regcomp_parse == '-') { |
ca9dfc88 | 2069 | flagsp = &negflags; |
3280af22 | 2070 | ++PL_regcomp_parse; |
ca9dfc88 | 2071 | goto parse_flags; |
48c036b1 | 2072 | } |
3280af22 NIS |
2073 | PL_regflags |= posflags; |
2074 | PL_regflags &= ~negflags; | |
2075 | if (*PL_regcomp_parse == ':') { | |
2076 | PL_regcomp_parse++; | |
ca9dfc88 IZ |
2077 | paren = ':'; |
2078 | break; | |
2079 | } | |
c277df42 | 2080 | unknown: |
b45f050a JF |
2081 | if (*PL_regcomp_parse != ')') { |
2082 | PL_regcomp_parse++; | |
2083 | vFAIL3("Sequence (%.*s...) not recognized", PL_regcomp_parse-seqstart, seqstart); | |
2084 | } | |
a0d0e21e LW |
2085 | nextchar(); |
2086 | *flagp = TRYAGAIN; | |
2087 | return NULL; | |
2088 | } | |
2089 | } | |
2090 | else { | |
3280af22 NIS |
2091 | parno = PL_regnpar; |
2092 | PL_regnpar++; | |
a0d0e21e | 2093 | ret = reganode(OPEN, parno); |
c277df42 | 2094 | open = 1; |
a0d0e21e | 2095 | } |
a0ed51b3 LW |
2096 | } |
2097 | else | |
a0d0e21e LW |
2098 | ret = NULL; |
2099 | ||
2100 | /* Pick up the branches, linking them together. */ | |
c277df42 | 2101 | br = regbranch(&flags, 1); |
a0d0e21e LW |
2102 | if (br == NULL) |
2103 | return(NULL); | |
3280af22 NIS |
2104 | if (*PL_regcomp_parse == '|') { |
2105 | if (!SIZE_ONLY && PL_extralen) { | |
c277df42 | 2106 | reginsert(BRANCHJ, br); |
a0ed51b3 LW |
2107 | } |
2108 | else | |
c277df42 IZ |
2109 | reginsert(BRANCH, br); |
2110 | have_branch = 1; | |
2111 | if (SIZE_ONLY) | |
3280af22 | 2112 | PL_extralen += 1; /* For BRANCHJ-BRANCH. */ |
a0ed51b3 LW |
2113 | } |
2114 | else if (paren == ':') { | |
c277df42 IZ |
2115 | *flagp |= flags&SIMPLE; |
2116 | } | |
2117 | if (open) { /* Starts with OPEN. */ | |
2118 | regtail(ret, br); /* OPEN -> first. */ | |
a0ed51b3 LW |
2119 | } |
2120 | else if (paren != '?') /* Not Conditional */ | |
a0d0e21e | 2121 | ret = br; |
821b33a5 IZ |
2122 | if (flags&HASWIDTH) |
2123 | *flagp |= HASWIDTH; | |
a0d0e21e | 2124 | *flagp |= flags&SPSTART; |
c277df42 | 2125 | lastbr = br; |
3280af22 NIS |
2126 | while (*PL_regcomp_parse == '|') { |
2127 | if (!SIZE_ONLY && PL_extralen) { | |
c277df42 IZ |
2128 | ender = reganode(LONGJMP,0); |
2129 | regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */ | |
2130 | } | |
2131 | if (SIZE_ONLY) | |
3280af22 | 2132 | PL_extralen += 2; /* Account for LONGJMP. */ |
a0d0e21e | 2133 | nextchar(); |
c277df42 | 2134 | br = regbranch(&flags, 0); |
a687059c | 2135 | if (br == NULL) |
a0d0e21e | 2136 | return(NULL); |
c277df42 IZ |
2137 | regtail(lastbr, br); /* BRANCH -> BRANCH. */ |
2138 | lastbr = br; | |
821b33a5 IZ |
2139 | if (flags&HASWIDTH) |
2140 | *flagp |= HASWIDTH; | |
a687059c | 2141 | *flagp |= flags&SPSTART; |
a0d0e21e LW |
2142 | } |
2143 | ||
c277df42 IZ |
2144 | if (have_branch || paren != ':') { |
2145 | /* Make a closing node, and hook it on the end. */ | |
2146 | switch (paren) { | |
2147 | case ':': | |
2148 | ender = reg_node(TAIL); | |
2149 | break; | |
2150 | case 1: | |
2151 | ender = reganode(CLOSE, parno); | |
2152 | break; | |
2153 | case '<': | |
c277df42 IZ |
2154 | case ',': |
2155 | case '=': | |
2156 | case '!': | |
c277df42 | 2157 | *flagp &= ~HASWIDTH; |
821b33a5 IZ |
2158 | /* FALL THROUGH */ |
2159 | case '>': | |
2160 | ender = reg_node(SUCCEED); | |
c277df42 IZ |
2161 | break; |
2162 | case 0: | |
2163 | ender = reg_node(END); | |
2164 | break; | |
2165 | } | |
2166 | regtail(lastbr, ender); | |
a0d0e21e | 2167 | |
c277df42 IZ |
2168 | if (have_branch) { |
2169 | /* Hook the tails of the branches to the closing node. */ | |
2170 | for (br = ret; br != NULL; br = regnext(br)) { | |
2171 | regoptail(br, ender); | |
2172 | } | |
2173 | } | |
a0d0e21e | 2174 | } |
c277df42 IZ |
2175 | |
2176 | { | |
2177 | char *p; | |
2178 | static char parens[] = "=!<,>"; | |
2179 | ||
2180 | if (paren && (p = strchr(parens, paren))) { | |
2181 | int node = ((p - parens) % 2) ? UNLESSM : IFMATCH; | |
2182 | int flag = (p - parens) > 1; | |
2183 | ||
2184 | if (paren == '>') | |
2185 | node = SUSPEND, flag = 0; | |
2186 | reginsert(node,ret); | |
c277df42 | 2187 | ret->flags = flag; |
c277df42 IZ |
2188 | regtail(ret, reg_node(TAIL)); |
2189 | } | |
a0d0e21e LW |
2190 | } |
2191 | ||
2192 | /* Check for proper termination. */ | |
ce3e6498 HS |
2193 | if (paren) { |
2194 | PL_regflags = oregflags; | |
2195 | if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') { | |
380a0633 JH |
2196 | PL_regcomp_parse = oregcomp_parse; |
2197 | vFAIL("Unmatched ("); | |
ce3e6498 | 2198 | } |
a0ed51b3 LW |
2199 | } |
2200 | else if (!paren && PL_regcomp_parse < PL_regxend) { | |
3280af22 | 2201 | if (*PL_regcomp_parse == ')') { |
380a0633 JH |
2202 | PL_regcomp_parse++; |
2203 | vFAIL("Unmatched )"); | |
a0ed51b3 LW |
2204 | } |
2205 | else | |
b45f050a | 2206 | FAIL("Junk on end of regexp"); /* "Can't happen". */ |
a0d0e21e LW |
2207 | /* NOTREACHED */ |
2208 | } | |
a687059c | 2209 | |
a0d0e21e | 2210 | return(ret); |
a687059c LW |
2211 | } |
2212 | ||
2213 | /* | |
2214 | - regbranch - one alternative of an | operator | |
2215 | * | |
2216 | * Implements the concatenation operator. | |
2217 | */ | |
76e3520e | 2218 | STATIC regnode * |
cea2e8a9 | 2219 | S_regbranch(pTHX_ I32 *flagp, I32 first) |
a687059c | 2220 | { |
5c0ca799 | 2221 | dTHR; |
c277df42 IZ |
2222 | register regnode *ret; |
2223 | register regnode *chain = NULL; | |
2224 | register regnode *latest; | |
2225 | I32 flags = 0, c = 0; | |
a0d0e21e | 2226 | |
c277df42 IZ |
2227 | if (first) |
2228 | ret = NULL; | |
2229 | else { | |
3280af22 | 2230 | if (!SIZE_ONLY && PL_extralen) |
c277df42 IZ |
2231 | ret = reganode(BRANCHJ,0); |
2232 | else | |
2233 | ret = reg_node(BRANCH); | |
2234 | } | |
2235 | ||
2236 | if (!first && SIZE_ONLY) | |
3280af22 | 2237 | PL_extralen += 1; /* BRANCHJ */ |
c277df42 IZ |
2238 | |
2239 | *flagp = WORST; /* Tentatively. */ | |
a0d0e21e | 2240 | |
3280af22 | 2241 | PL_regcomp_parse--; |
a0d0e21e | 2242 | nextchar(); |
3280af22 | 2243 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') { |
a0d0e21e LW |
2244 | flags &= ~TRYAGAIN; |
2245 | latest = regpiece(&flags); | |
2246 | if (latest == NULL) { | |
2247 | if (flags & TRYAGAIN) | |
2248 | continue; | |
2249 | return(NULL); | |
a0ed51b3 LW |
2250 | } |
2251 | else if (ret == NULL) | |
c277df42 | 2252 | ret = latest; |
a0d0e21e | 2253 | *flagp |= flags&HASWIDTH; |
c277df42 | 2254 | if (chain == NULL) /* First piece. */ |
a0d0e21e LW |
2255 | *flagp |= flags&SPSTART; |
2256 | else { | |
3280af22 | 2257 | PL_regnaughty++; |
a0d0e21e | 2258 | regtail(chain, latest); |
a687059c | 2259 | } |
a0d0e21e | 2260 | chain = latest; |
c277df42 IZ |
2261 | c++; |
2262 | } | |
2263 | if (chain == NULL) { /* Loop ran zero times. */ | |
2264 | chain = reg_node(NOTHING); | |
2265 | if (ret == NULL) | |
2266 | ret = chain; | |
2267 | } | |
2268 | if (c == 1) { | |
2269 | *flagp |= flags&SIMPLE; | |
a0d0e21e | 2270 | } |
a687059c | 2271 | |
a0d0e21e | 2272 | return(ret); |
a687059c LW |
2273 | } |
2274 | ||
2275 | /* | |
2276 | - regpiece - something followed by possible [*+?] | |
2277 | * | |
2278 | * Note that the branching code sequences used for ? and the general cases | |
2279 | * of * and + are somewhat optimized: they use the same NOTHING node as | |
2280 | * both the endmarker for their branch list and the body of the last branch. | |
2281 | * It might seem that this node could be dispensed with entirely, but the | |
2282 | * endmarker role is not redundant. | |
2283 | */ | |
76e3520e | 2284 | STATIC regnode * |
cea2e8a9 | 2285 | S_regpiece(pTHX_ I32 *flagp) |
a687059c | 2286 | { |
5c0ca799 | 2287 | dTHR; |
c277df42 | 2288 | register regnode *ret; |
a0d0e21e LW |
2289 | register char op; |
2290 | register char *next; | |
2291 | I32 flags; | |
3280af22 | 2292 | char *origparse = PL_regcomp_parse; |
a0d0e21e LW |
2293 | char *maxpos; |
2294 | I32 min; | |
c277df42 | 2295 | I32 max = REG_INFTY; |
a0d0e21e LW |
2296 | |
2297 | ret = regatom(&flags); | |
2298 | if (ret == NULL) { | |
2299 | if (flags & TRYAGAIN) | |
2300 | *flagp |= TRYAGAIN; | |
2301 | return(NULL); | |
2302 | } | |
2303 | ||
3280af22 | 2304 | op = *PL_regcomp_parse; |
a0d0e21e | 2305 | |
3280af22 NIS |
2306 | if (op == '{' && regcurly(PL_regcomp_parse)) { |
2307 | next = PL_regcomp_parse + 1; | |
a0d0e21e LW |
2308 | maxpos = Nullch; |
2309 | while (isDIGIT(*next) || *next == ',') { | |
2310 | if (*next == ',') { | |
2311 | if (maxpos) | |
2312 | break; | |
2313 | else | |
2314 | maxpos = next; | |
a687059c | 2315 | } |
a0d0e21e LW |
2316 | next++; |
2317 | } | |
2318 | if (*next == '}') { /* got one */ | |
2319 | if (!maxpos) | |
2320 | maxpos = next; | |
3280af22 NIS |
2321 | PL_regcomp_parse++; |
2322 | min = atoi(PL_regcomp_parse); | |
a0d0e21e LW |
2323 | if (*maxpos == ',') |
2324 | maxpos++; | |
2325 | else | |
3280af22 | 2326 | maxpos = PL_regcomp_parse; |
a0d0e21e LW |
2327 | max = atoi(maxpos); |
2328 | if (!max && *maxpos != '0') | |
c277df42 IZ |
2329 | max = REG_INFTY; /* meaning "infinity" */ |
2330 | else if (max >= REG_INFTY) | |
8615cb43 | 2331 | vFAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1); |
3280af22 | 2332 | PL_regcomp_parse = next; |
a0d0e21e LW |
2333 | nextchar(); |
2334 | ||
2335 | do_curly: | |
2336 | if ((flags&SIMPLE)) { | |
3280af22 | 2337 | PL_regnaughty += 2 + PL_regnaughty / 2; |
a0d0e21e LW |
2338 | reginsert(CURLY, ret); |
2339 | } | |
2340 | else { | |
2c2d71f5 JH |
2341 | regnode *w = reg_node(WHILEM); |
2342 | ||
2343 | w->flags = 0; | |
2344 | regtail(ret, w); | |
3280af22 | 2345 | if (!SIZE_ONLY && PL_extralen) { |
c277df42 IZ |
2346 | reginsert(LONGJMP,ret); |
2347 | reginsert(NOTHING,ret); | |
2348 | NEXT_OFF(ret) = 3; /* Go over LONGJMP. */ | |
2349 | } | |
a0d0e21e | 2350 | reginsert(CURLYX,ret); |
3280af22 | 2351 | if (!SIZE_ONLY && PL_extralen) |
c277df42 IZ |
2352 | NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */ |
2353 | regtail(ret, reg_node(NOTHING)); | |
2354 | if (SIZE_ONLY) | |
2c2d71f5 JH |
2355 | PL_reg_whilem_seen++, PL_extralen += 3; |
2356 | PL_regnaughty += 4 + PL_regnaughty; /* compound interest */ | |
a0d0e21e | 2357 | } |
c277df42 | 2358 | ret->flags = 0; |
a0d0e21e LW |
2359 | |
2360 | if (min > 0) | |
821b33a5 IZ |
2361 | *flagp = WORST; |
2362 | if (max > 0) | |
2363 | *flagp |= HASWIDTH; | |
a0d0e21e | 2364 | if (max && max < min) |
8615cb43 | 2365 | vFAIL("Can't do {n,m} with n > m"); |
c277df42 IZ |
2366 | if (!SIZE_ONLY) { |
2367 | ARG1_SET(ret, min); | |
2368 | ARG2_SET(ret, max); | |
a687059c | 2369 | } |
a687059c | 2370 | |
a0d0e21e | 2371 | goto nest_check; |
a687059c | 2372 | } |
a0d0e21e | 2373 | } |
a687059c | 2374 | |
a0d0e21e LW |
2375 | if (!ISMULT1(op)) { |
2376 | *flagp = flags; | |
a687059c | 2377 | return(ret); |
a0d0e21e | 2378 | } |
bb20fd44 | 2379 | |
c277df42 | 2380 | #if 0 /* Now runtime fix should be reliable. */ |
b45f050a JF |
2381 | |
2382 | /* if this is reinstated, don't forget to put this back into perldiag: | |
2383 | ||
2384 | =item Regexp *+ operand could be empty at {#} in regex m/%s/ | |
2385 | ||
2386 | (F) The part of the regexp subject to either the * or + quantifier | |
2387 | could match an empty string. The {#} shows in the regular | |
2388 | expression about where the problem was discovered. | |
2389 | ||
2390 | */ | |
2391 | ||
bb20fd44 | 2392 | if (!(flags&HASWIDTH) && op != '?') |
b45f050a | 2393 | vFAIL("Regexp *+ operand could be empty"); |
c277df42 | 2394 | #endif |
bb20fd44 | 2395 | |
a0d0e21e LW |
2396 | nextchar(); |
2397 | ||
821b33a5 | 2398 | *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH); |
a0d0e21e LW |
2399 | |
2400 | if (op == '*' && (flags&SIMPLE)) { | |
2401 | reginsert(STAR, ret); | |
c277df42 | 2402 | ret->flags = 0; |
3280af22 | 2403 | PL_regnaughty += 4; |
a0d0e21e LW |
2404 | } |
2405 | else if (op == '*') { | |
2406 | min = 0; | |
2407 | goto do_curly; | |
a0ed51b3 LW |
2408 | } |
2409 | else if (op == '+' && (flags&SIMPLE)) { | |
a0d0e21e | 2410 | reginsert(PLUS, ret); |
c277df42 | 2411 | ret->flags = 0; |
3280af22 | 2412 | PL_regnaughty += 3; |
a0d0e21e LW |
2413 | } |
2414 | else if (op == '+') { | |
2415 | min = 1; | |
2416 | goto do_curly; | |
a0ed51b3 LW |
2417 | } |
2418 | else if (op == '?') { | |
a0d0e21e LW |
2419 | min = 0; max = 1; |
2420 | goto do_curly; | |
2421 | } | |
2422 | nest_check: | |
e476b1b5 | 2423 | if (ckWARN(WARN_REGEXP) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) { |
b45f050a JF |
2424 | vWARN3(PL_regcomp_parse, |
2425 | "%.*s matches null string many times", | |
2426 | PL_regcomp_parse - origparse, | |
2427 | origparse); | |
a0d0e21e LW |
2428 | } |
2429 | ||
3280af22 | 2430 | if (*PL_regcomp_parse == '?') { |
a0d0e21e LW |
2431 | nextchar(); |
2432 | reginsert(MINMOD, ret); | |
c277df42 | 2433 | regtail(ret, ret + NODE_STEP_REGNODE); |
a0d0e21e | 2434 | } |
b45f050a JF |
2435 | if (ISMULT2(PL_regcomp_parse)) { |
2436 | PL_regcomp_parse++; | |
2437 | vFAIL("Nested quantifiers"); | |
2438 | } | |
a0d0e21e LW |
2439 | |
2440 | return(ret); | |
a687059c LW |
2441 | } |
2442 | ||
2443 | /* | |
2444 | - regatom - the lowest level | |
2445 | * | |
2446 | * Optimization: gobbles an entire sequence of ordinary characters so that | |
2447 | * it can turn them into a single node, which is smaller to store and | |
2448 | * faster to run. Backslashed characters are exceptions, each becoming a | |
2449 | * separate node; the code is simpler that way and it's not worth fixing. | |
2450 | * | |
b45f050a | 2451 | * [Yes, it is worth fixing, some scripts can run twice the speed.] */ |
76e3520e | 2452 | STATIC regnode * |
cea2e8a9 | 2453 | S_regatom(pTHX_ I32 *flagp) |
a687059c | 2454 | { |
5c0ca799 | 2455 | dTHR; |
c277df42 | 2456 | register regnode *ret = 0; |
a0d0e21e LW |
2457 | I32 flags; |
2458 | ||
2459 | *flagp = WORST; /* Tentatively. */ | |
2460 | ||
2461 | tryagain: | |
3280af22 | 2462 | switch (*PL_regcomp_parse) { |
a0d0e21e | 2463 | case '^': |
3280af22 | 2464 | PL_seen_zerolen++; |
a0d0e21e | 2465 | nextchar(); |
3280af22 | 2466 | if (PL_regflags & PMf_MULTILINE) |
c277df42 | 2467 | ret = reg_node(MBOL); |
3280af22 | 2468 | else if (PL_regflags & PMf_SINGLELINE) |
c277df42 | 2469 | ret = reg_node(SBOL); |
a0d0e21e | 2470 | else |
c277df42 | 2471 | ret = reg_node(BOL); |
a0d0e21e LW |
2472 | break; |
2473 | case '$': | |
2474 | nextchar(); | |
769cfde8 HS |
2475 | if (*PL_regcomp_parse) |
2476 | PL_seen_zerolen++; | |
3280af22 | 2477 | if (PL_regflags & PMf_MULTILINE) |
c277df42 | 2478 | ret = reg_node(MEOL); |
3280af22 | 2479 | else if (PL_regflags & PMf_SINGLELINE) |
c277df42 | 2480 | ret = reg_node(SEOL); |
a0d0e21e | 2481 | else |
c277df42 | 2482 | ret = reg_node(EOL); |
a0d0e21e LW |
2483 | break; |
2484 | case '.': | |
2485 | nextchar(); | |
a0ed51b3 LW |
2486 | if (UTF) { |
2487 | if (PL_regflags & PMf_SINGLELINE) | |
2488 | ret = reg_node(SANYUTF8); | |
2489 | else | |
2490 | ret = reg_node(ANYUTF8); | |
2491 | *flagp |= HASWIDTH; | |
2492 | } | |
2493 | else { | |
2494 | if (PL_regflags & PMf_SINGLELINE) | |
2495 | ret = reg_node(SANY); | |
2496 | else | |
22c35a8c | 2497 | ret = reg_node(REG_ANY); |
a0ed51b3 LW |
2498 | *flagp |= HASWIDTH|SIMPLE; |
2499 | } | |
3280af22 | 2500 | PL_regnaughty++; |
a0d0e21e LW |
2501 | break; |
2502 | case '[': | |
b45f050a JF |
2503 | { |
2504 | char *oregcomp_parse = ++PL_regcomp_parse; | |
a0ed51b3 | 2505 | ret = (UTF ? regclassutf8() : regclass()); |
b45f050a JF |
2506 | if (*PL_regcomp_parse != ']') { |
2507 | PL_regcomp_parse = oregcomp_parse; | |
2508 | vFAIL("Unmatched ["); | |
2509 | } | |
a14b48bc | 2510 | nextchar(); |
a0d0e21e LW |
2511 | *flagp |= HASWIDTH|SIMPLE; |
2512 | break; | |
b45f050a | 2513 | } |
a0d0e21e LW |
2514 | case '(': |
2515 | nextchar(); | |
2516 | ret = reg(1, &flags); | |
2517 | if (ret == NULL) { | |
bf93d4cc GS |
2518 | if (flags & TRYAGAIN) { |
2519 | if (PL_regcomp_parse == PL_regxend) { | |
2520 | /* Make parent create an empty node if needed. */ | |
2521 | *flagp |= TRYAGAIN; | |
2522 | return(NULL); | |
2523 | } | |
a0d0e21e | 2524 | goto tryagain; |
bf93d4cc | 2525 | } |
a0d0e21e LW |
2526 | return(NULL); |
2527 | } | |
c277df42 | 2528 | *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE); |
a0d0e21e LW |
2529 | break; |
2530 | case '|': | |
2531 | case ')': | |
2532 | if (flags & TRYAGAIN) { | |
2533 | *flagp |= TRYAGAIN; | |
2534 | return NULL; | |
2535 | } | |
b45f050a | 2536 | vFAIL("Internal urp"); |
a0d0e21e LW |
2537 | /* Supposed to be caught earlier. */ |
2538 | break; | |
85afd4ae | 2539 | case '{': |
3280af22 NIS |
2540 | if (!regcurly(PL_regcomp_parse)) { |
2541 | PL_regcomp_parse++; | |
85afd4ae CS |
2542 | goto defchar; |
2543 | } | |
2544 | /* FALL THROUGH */ | |
a0d0e21e LW |
2545 | case '?': |
2546 | case '+': | |
2547 | case '*': | |
b45f050a JF |
2548 | PL_regcomp_parse++; |
2549 | vFAIL("Quantifier follows nothing"); | |
a0d0e21e LW |
2550 | break; |
2551 | case '\\': | |
3280af22 | 2552 | switch (*++PL_regcomp_parse) { |
a0d0e21e | 2553 | case 'A': |
3280af22 | 2554 | PL_seen_zerolen++; |
c277df42 | 2555 | ret = reg_node(SBOL); |
a0d0e21e LW |
2556 | *flagp |= SIMPLE; |
2557 | nextchar(); | |
2558 | break; | |
2559 | case 'G': | |
c277df42 | 2560 | ret = reg_node(GPOS); |
3280af22 | 2561 | PL_regseen |= REG_SEEN_GPOS; |
a0d0e21e LW |
2562 | *flagp |= SIMPLE; |
2563 | nextchar(); | |
2564 | break; | |
2565 | case 'Z': | |
c277df42 | 2566 | ret = reg_node(SEOL); |
a0d0e21e LW |
2567 | *flagp |= SIMPLE; |
2568 | nextchar(); | |
2569 | break; | |
b85d18e9 IZ |
2570 | case 'z': |
2571 | ret = reg_node(EOS); | |
2572 | *flagp |= SIMPLE; | |
3280af22 | 2573 | PL_seen_zerolen++; /* Do not optimize RE away */ |
b85d18e9 IZ |
2574 | nextchar(); |
2575 | break; | |
4a2d328f | 2576 | case 'C': |
a0ed51b3 LW |
2577 | ret = reg_node(SANY); |
2578 | *flagp |= HASWIDTH|SIMPLE; | |
2579 | nextchar(); | |
2580 | break; | |
2581 | case 'X': | |
2582 | ret = reg_node(CLUMP); | |
2583 | *flagp |= HASWIDTH; | |
2584 | nextchar(); | |
2585 | if (UTF && !PL_utf8_mark) | |
dfe13c55 | 2586 | is_utf8_mark((U8*)"~"); /* preload table */ |
a0ed51b3 | 2587 | break; |
a0d0e21e | 2588 | case 'w': |
a0ed51b3 LW |
2589 | ret = reg_node( |
2590 | UTF | |
2591 | ? (LOC ? ALNUMLUTF8 : ALNUMUTF8) | |
2592 | : (LOC ? ALNUML : ALNUM)); | |
a0d0e21e LW |
2593 | *flagp |= HASWIDTH|SIMPLE; |
2594 | nextchar(); | |
a0ed51b3 | 2595 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2596 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2597 | break; |
2598 | case 'W': | |
a0ed51b3 LW |
2599 | ret = reg_node( |
2600 | UTF | |
2601 | ? (LOC ? NALNUMLUTF8 : NALNUMUTF8) | |
2602 | : (LOC ? NALNUML : NALNUM)); | |
a0d0e21e LW |
2603 | *flagp |= HASWIDTH|SIMPLE; |
2604 | nextchar(); | |
a0ed51b3 | 2605 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2606 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2607 | break; |
2608 | case 'b': | |
3280af22 | 2609 | PL_seen_zerolen++; |
f5c9036e | 2610 | PL_regseen |= REG_SEEN_LOOKBEHIND; |
a0ed51b3 LW |
2611 | ret = reg_node( |
2612 | UTF | |
2613 | ? (LOC ? BOUNDLUTF8 : BOUNDUTF8) | |
2614 | : (LOC ? BOUNDL : BOUND)); | |
a0d0e21e LW |
2615 | *flagp |= SIMPLE; |
2616 | nextchar(); | |
a0ed51b3 | 2617 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2618 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2619 | break; |
2620 | case 'B': | |
3280af22 | 2621 | PL_seen_zerolen++; |
f5c9036e | 2622 | PL_regseen |= REG_SEEN_LOOKBEHIND; |
a0ed51b3 LW |
2623 | ret = reg_node( |
2624 | UTF | |
2625 | ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8) | |
2626 | : (LOC ? NBOUNDL : NBOUND)); | |
a0d0e21e LW |
2627 | *flagp |= SIMPLE; |
2628 | nextchar(); | |
a0ed51b3 | 2629 | if (UTF && !PL_utf8_alnum) |
dfe13c55 | 2630 | is_utf8_alnum((U8*)"a"); /* preload table */ |
a0d0e21e LW |
2631 | break; |
2632 | case 's': | |
a0ed51b3 LW |
2633 | ret = reg_node( |
2634 | UTF | |
2635 | ? (LOC ? SPACELUTF8 : SPACEUTF8) | |
2636 | : (LOC ? SPACEL : SPACE)); | |
a0d0e21e LW |
2637 | *flagp |= HASWIDTH|SIMPLE; |
2638 | nextchar(); | |
a0ed51b3 | 2639 | if (UTF && !PL_utf8_space) |
dfe13c55 | 2640 | is_utf8_space((U8*)" "); /* preload table */ |
a0d0e21e LW |
2641 | break; |
2642 | case 'S': | |
a0ed51b3 LW |
2643 | ret = reg_node( |
2644 | UTF | |
2645 | ? (LOC ? NSPACELUTF8 : NSPACEUTF8) | |
2646 | : (LOC ? NSPACEL : NSPACE)); | |
a0d0e21e LW |
2647 | *flagp |= HASWIDTH|SIMPLE; |
2648 | nextchar(); | |
a0ed51b3 | 2649 | if (UTF && !PL_utf8_space) |
dfe13c55 | 2650 | is_utf8_space((U8*)" "); /* preload table */ |
a0d0e21e LW |
2651 | break; |
2652 | case 'd': | |
a0ed51b3 | 2653 | ret = reg_node(UTF ? DIGITUTF8 : DIGIT); |
a0d0e21e LW |
2654 | *flagp |= HASWIDTH|SIMPLE; |
2655 | nextchar(); | |
a0ed51b3 | 2656 | if (UTF && !PL_utf8_digit) |
dfe13c55 | 2657 | is_utf8_digit((U8*)"1"); /* preload table */ |
a0d0e21e LW |
2658 | break; |
2659 | case 'D': | |
a0ed51b3 | 2660 | ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT); |
a0d0e21e LW |
2661 | *flagp |= HASWIDTH|SIMPLE; |
2662 | nextchar(); | |
a0ed51b3 | 2663 | if (UTF && !PL_utf8_digit) |
dfe13c55 | 2664 | is_utf8_digit((U8*)"1"); /* preload table */ |
a0d0e21e | 2665 | break; |
a14b48bc LW |
2666 | case 'p': |
2667 | case 'P': | |
2668 | { /* a lovely hack--pretend we saw [\pX] instead */ | |
2669 | char* oldregxend = PL_regxend; | |
2670 | ||
2671 | if (PL_regcomp_parse[1] == '{') { | |
2672 | PL_regxend = strchr(PL_regcomp_parse, '}'); | |
b45f050a JF |
2673 | if (!PL_regxend) { |
2674 | PL_regcomp_parse += 2; | |
2675 | PL_regxend = oldregxend; | |
2676 | vFAIL("Missing right brace on \\p{}"); | |
2677 | } | |
a14b48bc LW |
2678 | PL_regxend++; |
2679 | } | |
2680 | else | |
2681 | PL_regxend = PL_regcomp_parse + 2; | |
2682 | PL_regcomp_parse--; | |
2683 | ||
2684 | ret = regclassutf8(); | |
2685 | ||
2686 | PL_regxend = oldregxend; | |
2687 | PL_regcomp_parse--; | |
2688 | nextchar(); | |
2689 | *flagp |= HASWIDTH|SIMPLE; | |
2690 | } | |
2691 | break; | |
a0d0e21e LW |
2692 | case 'n': |
2693 | case 'r': | |
2694 | case 't': | |
2695 | case 'f': | |
2696 | case 'e': | |
2697 | case 'a': | |
2698 | case 'x': | |
2699 | case 'c': | |
2700 | case '0': | |
2701 | goto defchar; | |
2702 | case '1': case '2': case '3': case '4': | |
2703 | case '5': case '6': case '7': case '8': case '9': | |
2704 | { | |
3280af22 | 2705 | I32 num = atoi(PL_regcomp_parse); |
a0d0e21e | 2706 | |
3280af22 | 2707 | if (num > 9 && num >= PL_regnpar) |
a0d0e21e LW |
2708 | goto defchar; |
2709 | else { | |
380a0633 JH |
2710 | while (isDIGIT(*PL_regcomp_parse)) |
2711 | PL_regcomp_parse++; | |
b45f050a | 2712 | |
3280af22 | 2713 | if (!SIZE_ONLY && num > PL_regcomp_rx->nparens) |
9baa0206 | 2714 | vFAIL("Reference to nonexistent group"); |
3280af22 | 2715 | PL_regsawback = 1; |
a0ed51b3 LW |
2716 | ret = reganode(FOLD |
2717 | ? (LOC ? REFFL : REFF) | |
c8756f30 | 2718 | : REF, num); |
a0d0e21e | 2719 | *flagp |= HASWIDTH; |
3280af22 | 2720 | PL_regcomp_parse--; |
a0d0e21e LW |
2721 | nextchar(); |
2722 | } | |
2723 | } | |
2724 | break; | |
2725 | case '\0': | |
3280af22 | 2726 | if (PL_regcomp_parse >= PL_regxend) |
b45f050a | 2727 | FAIL("Trailing \\"); |
a0d0e21e LW |
2728 | /* FALL THROUGH */ |
2729 | default: | |
c9f97d15 IZ |
2730 | /* Do not generate `unrecognized' warnings here, we fall |
2731 | back into the quick-grab loop below */ | |
a0d0e21e LW |
2732 | goto defchar; |
2733 | } | |
2734 | break; | |
4633a7c4 LW |
2735 | |
2736 | case '#': | |
3280af22 NIS |
2737 | if (PL_regflags & PMf_EXTENDED) { |
2738 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++; | |
2739 | if (PL_regcomp_parse < PL_regxend) | |
4633a7c4 LW |
2740 | goto tryagain; |
2741 | } | |
2742 | /* FALL THROUGH */ | |
2743 | ||
a0d0e21e | 2744 | default: { |
ba210ebe | 2745 | register STRLEN len; |
a0ed51b3 | 2746 | register UV ender; |
a0d0e21e | 2747 | register char *p; |
c277df42 | 2748 | char *oldp, *s; |
ba210ebe | 2749 | STRLEN numlen; |
a0d0e21e | 2750 | |
3280af22 | 2751 | PL_regcomp_parse++; |
a0d0e21e LW |
2752 | |
2753 | defchar: | |
a0ed51b3 LW |
2754 | ret = reg_node(FOLD |
2755 | ? (LOC ? EXACTFL : EXACTF) | |
bbce6d69 | 2756 | : EXACT); |
cd439c50 | 2757 | s = STRING(ret); |
3280af22 NIS |
2758 | for (len = 0, p = PL_regcomp_parse - 1; |
2759 | len < 127 && p < PL_regxend; | |
a0d0e21e LW |
2760 | len++) |
2761 | { | |
2762 | oldp = p; | |
5b5a24f7 | 2763 | |
3280af22 NIS |
2764 | if (PL_regflags & PMf_EXTENDED) |
2765 | p = regwhite(p, PL_regxend); | |
a0d0e21e LW |
2766 | switch (*p) { |
2767 | case '^': | |
2768 | case '$': | |
2769 | case '.': | |
2770 | case '[': | |
2771 | case '(': | |
2772 | case ')': | |
2773 | case '|': | |
2774 | goto loopdone; | |
2775 | case '\\': | |
2776 | switch (*++p) { | |
2777 | case 'A': | |
2778 | case 'G': | |
2779 | case 'Z': | |
b85d18e9 | 2780 | case 'z': |
a0d0e21e LW |
2781 | case 'w': |
2782 | case 'W': | |
2783 | case 'b': | |
2784 | case 'B': | |
2785 | case 's': | |
2786 | case 'S': | |
2787 | case 'd': | |
2788 | case 'D': | |
a14b48bc LW |
2789 | case 'p': |
2790 | case 'P': | |
a0d0e21e LW |
2791 | --p; |
2792 | goto loopdone; | |
2793 | case 'n': | |
2794 | ender = '\n'; | |
2795 | p++; | |
a687059c | 2796 | break; |
a0d0e21e LW |
2797 | case 'r': |
2798 | ender = '\r'; | |
2799 | p++; | |
a687059c | 2800 | break; |
a0d0e21e LW |
2801 | case 't': |
2802 | ender = '\t'; | |
2803 | p++; | |
a687059c | 2804 | break; |
a0d0e21e LW |
2805 | case 'f': |
2806 | ender = '\f'; | |
2807 | p++; | |
a687059c | 2808 | break; |
a0d0e21e | 2809 | case 'e': |
0407a77b GS |
2810 | #ifdef ASCIIish |
2811 | ender = '\033'; | |
2812 | #else | |
2813 | ender = '\047'; | |
2814 | #endif | |
a0d0e21e | 2815 | p++; |
a687059c | 2816 | break; |
a0d0e21e | 2817 | case 'a': |
0407a77b GS |
2818 | #ifdef ASCIIish |
2819 | ender = '\007'; | |
2820 | #else | |
2821 | ender = '\057'; | |
2822 | #endif | |
a0d0e21e | 2823 | p++; |
a687059c | 2824 | break; |
a0d0e21e | 2825 | case 'x': |
a0ed51b3 LW |
2826 | if (*++p == '{') { |
2827 | char* e = strchr(p, '}'); | |
2828 | ||
b45f050a JF |
2829 | if (!e) { |
2830 | PL_regcomp_parse = p + 1; | |
2831 | vFAIL("Missing right brace on \\x{}"); | |
2832 | } | |
a0ed51b3 | 2833 | else if (UTF) { |
b21ed0a9 | 2834 | numlen = 1; /* allow underscores */ |
de35ba6f | 2835 | ender = (UV)scan_hex(p + 1, e - p - 1, &numlen); |
b21ed0a9 GS |
2836 | /* numlen is generous */ |
2837 | if (numlen + len >= 127) { | |
a0ed51b3 LW |
2838 | p--; |
2839 | goto loopdone; | |
2840 | } | |
2841 | p = e + 1; | |
2842 | } | |
2843 | else | |
b45f050a JF |
2844 | { |
2845 | PL_regcomp_parse = e + 1; | |
8615cb43 | 2846 | vFAIL("Can't use \\x{} without 'use utf8' declaration"); |
b45f050a JF |
2847 | } |
2848 | ||
a0ed51b3 LW |
2849 | } |
2850 | else { | |
b21ed0a9 | 2851 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 2852 | ender = (UV)scan_hex(p, 2, &numlen); |
a0ed51b3 LW |
2853 | p += numlen; |
2854 | } | |
a687059c | 2855 | break; |
a0d0e21e LW |
2856 | case 'c': |
2857 | p++; | |
bbce6d69 | 2858 | ender = UCHARAT(p++); |
2859 | ender = toCTRL(ender); | |
a687059c | 2860 | break; |
a0d0e21e LW |
2861 | case '0': case '1': case '2': case '3':case '4': |
2862 | case '5': case '6': case '7': case '8':case '9': | |
2863 | if (*p == '0' || | |
3280af22 | 2864 | (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) { |
b21ed0a9 | 2865 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 2866 | ender = (UV)scan_oct(p, 3, &numlen); |
a0d0e21e LW |
2867 | p += numlen; |
2868 | } | |
2869 | else { | |
2870 | --p; | |
2871 | goto loopdone; | |
a687059c LW |
2872 | } |
2873 | break; | |
a0d0e21e | 2874 | case '\0': |
3280af22 | 2875 | if (p >= PL_regxend) |
b45f050a | 2876 | FAIL("Trailing \\"); |
a687059c | 2877 | /* FALL THROUGH */ |
a0d0e21e | 2878 | default: |
e476b1b5 | 2879 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(*p)) |
b45f050a | 2880 | vWARN2(p +1, "Unrecognized escape \\%c passed through", *p); |
a0ed51b3 | 2881 | goto normal_default; |
a0d0e21e LW |
2882 | } |
2883 | break; | |
a687059c | 2884 | default: |
a0ed51b3 LW |
2885 | normal_default: |
2886 | if ((*p & 0xc0) == 0xc0 && UTF) { | |
dcad2880 | 2887 | ender = utf8_to_uv((U8*)p, PL_regxend - p, |
ba210ebe | 2888 | &numlen, 0); |
a0ed51b3 LW |
2889 | p += numlen; |
2890 | } | |
2891 | else | |
2892 | ender = *p++; | |
a0d0e21e | 2893 | break; |
a687059c | 2894 | } |
3280af22 NIS |
2895 | if (PL_regflags & PMf_EXTENDED) |
2896 | p = regwhite(p, PL_regxend); | |
a0ed51b3 LW |
2897 | if (UTF && FOLD) { |
2898 | if (LOC) | |
2899 | ender = toLOWER_LC_uni(ender); | |
2900 | else | |
2901 | ender = toLOWER_uni(ender); | |
2902 | } | |
a0d0e21e LW |
2903 | if (ISMULT2(p)) { /* Back off on ?+*. */ |
2904 | if (len) | |
2905 | p = oldp; | |
a0ed51b3 LW |
2906 | else if (ender >= 0x80 && UTF) { |
2907 | reguni(ender, s, &numlen); | |
2908 | s += numlen; | |
2909 | len += numlen; | |
2910 | } | |
a0d0e21e LW |
2911 | else { |
2912 | len++; | |
cd439c50 | 2913 | REGC(ender, s++); |
a0d0e21e LW |
2914 | } |
2915 | break; | |
a687059c | 2916 | } |
a0ed51b3 LW |
2917 | if (ender >= 0x80 && UTF) { |
2918 | reguni(ender, s, &numlen); | |
2919 | s += numlen; | |
2920 | len += numlen - 1; | |
2921 | } | |
2922 | else | |
cd439c50 | 2923 | REGC(ender, s++); |
a0d0e21e LW |
2924 | } |
2925 | loopdone: | |
3280af22 | 2926 | PL_regcomp_parse = p - 1; |
a0d0e21e LW |
2927 | nextchar(); |
2928 | if (len < 0) | |
b45f050a | 2929 | vFAIL("Internal disaster"); |
a0d0e21e LW |
2930 | if (len > 0) |
2931 | *flagp |= HASWIDTH; | |
2932 | if (len == 1) | |
2933 | *flagp |= SIMPLE; | |
c277df42 | 2934 | if (!SIZE_ONLY) |
cd439c50 IZ |
2935 | STR_LEN(ret) = len; |
2936 | if (SIZE_ONLY) | |
2937 | PL_regsize += STR_SZ(len); | |
2938 | else | |
2939 | PL_regcode += STR_SZ(len); | |
a687059c | 2940 | } |
a0d0e21e LW |
2941 | break; |
2942 | } | |
a687059c | 2943 | |
a0d0e21e | 2944 | return(ret); |
a687059c LW |
2945 | } |
2946 | ||
873ef191 | 2947 | STATIC char * |
cea2e8a9 | 2948 | S_regwhite(pTHX_ char *p, char *e) |
5b5a24f7 CS |
2949 | { |
2950 | while (p < e) { | |
2951 | if (isSPACE(*p)) | |
2952 | ++p; | |
2953 | else if (*p == '#') { | |
2954 | do { | |
2955 | p++; | |
2956 | } while (p < e && *p != '\n'); | |
2957 | } | |
2958 | else | |
2959 | break; | |
2960 | } | |
2961 | return p; | |
2962 | } | |
2963 | ||
b8c5462f JH |
2964 | /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]]. |
2965 | Character classes ([:foo:]) can also be negated ([:^foo:]). | |
2966 | Returns a named class id (ANYOF_XXX) if successful, -1 otherwise. | |
2967 | Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed, | |
2968 | but trigger warnings because they are currently unimplemented. */ | |
2969 | STATIC I32 | |
cea2e8a9 | 2970 | S_regpposixcc(pTHX_ I32 value) |
620e46c5 | 2971 | { |
11b8faa4 | 2972 | dTHR; |
620e46c5 | 2973 | char *posixcc = 0; |
936ed897 | 2974 | I32 namedclass = OOB_NAMEDCLASS; |
620e46c5 JH |
2975 | |
2976 | if (value == '[' && PL_regcomp_parse + 1 < PL_regxend && | |
2977 | /* I smell either [: or [= or [. -- POSIX has been here, right? */ | |
2978 | (*PL_regcomp_parse == ':' || | |
2979 | *PL_regcomp_parse == '=' || | |
2980 | *PL_regcomp_parse == '.')) { | |
2981 | char c = *PL_regcomp_parse; | |
2982 | char* s = PL_regcomp_parse++; | |
2983 | ||
2984 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c) | |
2985 | PL_regcomp_parse++; | |
2986 | if (PL_regcomp_parse == PL_regxend) | |
2987 | /* Grandfather lone [:, [=, [. */ | |
2988 | PL_regcomp_parse = s; | |
2989 | else { | |
b8c5462f JH |
2990 | char* t = PL_regcomp_parse++; /* skip over the c */ |
2991 | ||
2992 | if (*PL_regcomp_parse == ']') { | |
2993 | PL_regcomp_parse++; /* skip over the ending ] */ | |
2994 | posixcc = s + 1; | |
2995 | if (*s == ':') { | |
2996 | I32 complement = *posixcc == '^' ? *posixcc++ : 0; | |
2997 | I32 skip = 5; /* the most common skip */ | |
2998 | ||
2999 | switch (*posixcc) { | |
3000 | case 'a': | |
3001 | if (strnEQ(posixcc, "alnum", 5)) | |
3002 | namedclass = | |
3003 | complement ? ANYOF_NALNUMC : ANYOF_ALNUMC; | |
3004 | else if (strnEQ(posixcc, "alpha", 5)) | |
3005 | namedclass = | |
3006 | complement ? ANYOF_NALPHA : ANYOF_ALPHA; | |
3007 | else if (strnEQ(posixcc, "ascii", 5)) | |
3008 | namedclass = | |
3009 | complement ? ANYOF_NASCII : ANYOF_ASCII; | |
3010 | break; | |
aaa51d5e JF |
3011 | case 'b': |
3012 | if (strnEQ(posixcc, "blank", 5)) | |
3013 | namedclass = | |
3014 | complement ? ANYOF_NBLANK : ANYOF_BLANK; | |
3015 | break; | |
b8c5462f JH |
3016 | case 'c': |
3017 | if (strnEQ(posixcc, "cntrl", 5)) | |
3018 | namedclass = | |
3019 | complement ? ANYOF_NCNTRL : ANYOF_CNTRL; | |
3020 | break; | |
3021 | case 'd': | |
3022 | if (strnEQ(posixcc, "digit", 5)) | |
3023 | namedclass = | |
3024 | complement ? ANYOF_NDIGIT : ANYOF_DIGIT; | |
3025 | break; | |
3026 | case 'g': | |
3027 | if (strnEQ(posixcc, "graph", 5)) | |
3028 | namedclass = | |
3029 | complement ? ANYOF_NGRAPH : ANYOF_GRAPH; | |
3030 | break; | |
3031 | case 'l': | |
3032 | if (strnEQ(posixcc, "lower", 5)) | |
3033 | namedclass = | |
3034 | complement ? ANYOF_NLOWER : ANYOF_LOWER; | |
3035 | break; | |
3036 | case 'p': | |
3037 | if (strnEQ(posixcc, "print", 5)) | |
3038 | namedclass = | |
3039 | complement ? ANYOF_NPRINT : ANYOF_PRINT; | |
3040 | else if (strnEQ(posixcc, "punct", 5)) | |
3041 | namedclass = | |
3042 | complement ? ANYOF_NPUNCT : ANYOF_PUNCT; | |
3043 | break; | |
3044 | case 's': | |
3045 | if (strnEQ(posixcc, "space", 5)) | |
3046 | namedclass = | |
aaa51d5e | 3047 | complement ? ANYOF_NPSXSPC : ANYOF_PSXSPC; |
cc4319de | 3048 | break; |
b8c5462f JH |
3049 | case 'u': |
3050 | if (strnEQ(posixcc, "upper", 5)) | |
3051 | namedclass = | |
3052 | complement ? ANYOF_NUPPER : ANYOF_UPPER; | |
3053 | break; | |
3054 | case 'w': /* this is not POSIX, this is the Perl \w */ | |
3055 | if (strnEQ(posixcc, "word", 4)) { | |
3056 | namedclass = | |
3057 | complement ? ANYOF_NALNUM : ANYOF_ALNUM; | |
3058 | skip = 4; | |
3059 | } | |
3060 | break; | |
3061 | case 'x': | |
3062 | if (strnEQ(posixcc, "xdigit", 6)) { | |
3063 | namedclass = | |
3064 | complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT; | |
3065 | skip = 6; | |
3066 | } | |
3067 | break; | |
3068 | } | |
ac561586 JH |
3069 | if (namedclass == OOB_NAMEDCLASS || |
3070 | posixcc[skip] != ':' || | |
3071 | posixcc[skip+1] != ']') | |
b45f050a JF |
3072 | { |
3073 | Simple_vFAIL3("POSIX class [:%.*s:] unknown", | |
3074 | t - s - 1, s + 1); | |
3075 | } | |
3076 | } else if (!SIZE_ONLY) { | |
b8c5462f | 3077 | /* [[=foo=]] and [[.foo.]] are still future. */ |
b45f050a JF |
3078 | |
3079 | /* adjust PL_regcomp_parse so the warning shows after | |
3080 | the class closes */ | |
3081 | while (*PL_regcomp_parse && *PL_regcomp_parse != ']') | |
3082 | PL_regcomp_parse++; | |
3083 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); | |
3084 | } | |
b8c5462f JH |
3085 | } else { |
3086 | /* Maternal grandfather: | |
3087 | * "[:" ending in ":" but not in ":]" */ | |
767d463e HS |
3088 | PL_regcomp_parse = s; |
3089 | } | |
620e46c5 JH |
3090 | } |
3091 | } | |
3092 | ||
b8c5462f JH |
3093 | return namedclass; |
3094 | } | |
3095 | ||
3096 | STATIC void | |
3097 | S_checkposixcc(pTHX) | |
3098 | { | |
e476b1b5 | 3099 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && |
b8c5462f JH |
3100 | (*PL_regcomp_parse == ':' || |
3101 | *PL_regcomp_parse == '=' || | |
3102 | *PL_regcomp_parse == '.')) { | |
3103 | char *s = PL_regcomp_parse; | |
93733859 | 3104 | char c = *s++; |
b8c5462f JH |
3105 | |
3106 | while(*s && isALNUM(*s)) | |
3107 | s++; | |
3108 | if (*s && c == *s && s[1] == ']') { | |
b45f050a JF |
3109 | vWARN3(s+2, "POSIX syntax [%c %c] belongs inside character classes", c, c); |
3110 | ||
3111 | /* [[=foo=]] and [[.foo.]] are still future. */ | |
b8c5462f | 3112 | if (c == '=' || c == '.') |
b45f050a JF |
3113 | { |
3114 | /* adjust PL_regcomp_parse so the error shows after | |
3115 | the class closes */ | |
3116 | while (*PL_regcomp_parse && *PL_regcomp_parse++ != ']') | |
3117 | ; | |
3118 | Simple_vFAIL3("POSIX syntax [%c %c] is reserved for future extensions", c, c); | |
3119 | } | |
b8c5462f JH |
3120 | } |
3121 | } | |
620e46c5 JH |
3122 | } |
3123 | ||
76e3520e | 3124 | STATIC regnode * |
cea2e8a9 | 3125 | S_regclass(pTHX) |
a687059c | 3126 | { |
5c0ca799 | 3127 | dTHR; |
470c3474 | 3128 | register U32 value; |
b8c5462f | 3129 | register I32 lastvalue = OOB_CHAR8; |
a0d0e21e | 3130 | register I32 range = 0; |
c277df42 | 3131 | register regnode *ret; |
ba210ebe | 3132 | STRLEN numlen; |
b8c5462f | 3133 | I32 namedclass; |
73b437c8 | 3134 | char *rangebegin; |
936ed897 | 3135 | bool need_class = 0; |
a0d0e21e | 3136 | |
c277df42 | 3137 | ret = reg_node(ANYOF); |
936ed897 IZ |
3138 | if (SIZE_ONLY) |
3139 | PL_regsize += ANYOF_SKIP; | |
3140 | else { | |
3141 | ret->flags = 0; | |
3142 | ANYOF_BITMAP_ZERO(ret); | |
3143 | PL_regcode += ANYOF_SKIP; | |
3144 | if (FOLD) | |
3145 | ANYOF_FLAGS(ret) |= ANYOF_FOLD; | |
3146 | if (LOC) | |
3147 | ANYOF_FLAGS(ret) |= ANYOF_LOCALE; | |
3148 | } | |
3280af22 NIS |
3149 | if (*PL_regcomp_parse == '^') { /* Complement of range. */ |
3150 | PL_regnaughty++; | |
3151 | PL_regcomp_parse++; | |
c277df42 | 3152 | if (!SIZE_ONLY) |
936ed897 | 3153 | ANYOF_FLAGS(ret) |= ANYOF_INVERT; |
a0d0e21e | 3154 | } |
b8c5462f | 3155 | |
e476b1b5 | 3156 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP)) |
936ed897 | 3157 | checkposixcc(); |
b8c5462f | 3158 | |
3280af22 | 3159 | if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-') |
a0d0e21e | 3160 | goto skipcond; /* allow 1st char to be ] or - */ |
3280af22 | 3161 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') { |
a0d0e21e | 3162 | skipcond: |
93733859 | 3163 | namedclass = OOB_NAMEDCLASS; |
73b437c8 JH |
3164 | if (!range) |
3165 | rangebegin = PL_regcomp_parse; | |
a0ed51b3 | 3166 | value = UCHARAT(PL_regcomp_parse++); |
620e46c5 | 3167 | if (value == '[') |
b8c5462f | 3168 | namedclass = regpposixcc(value); |
620e46c5 | 3169 | else if (value == '\\') { |
a0ed51b3 | 3170 | value = UCHARAT(PL_regcomp_parse++); |
470c3474 | 3171 | /* Some compilers cannot handle switching on 64-bit integer |
aaa51d5e | 3172 | * values, therefore the 'value' cannot be an UV. --jhi */ |
a0ed51b3 | 3173 | switch (value) { |
b8c5462f JH |
3174 | case 'w': namedclass = ANYOF_ALNUM; break; |
3175 | case 'W': namedclass = ANYOF_NALNUM; break; | |
3176 | case 's': namedclass = ANYOF_SPACE; break; | |
3177 | case 'S': namedclass = ANYOF_NSPACE; break; | |
3178 | case 'd': namedclass = ANYOF_DIGIT; break; | |
3179 | case 'D': namedclass = ANYOF_NDIGIT; break; | |
3180 | case 'n': value = '\n'; break; | |
3181 | case 'r': value = '\r'; break; | |
3182 | case 't': value = '\t'; break; | |
3183 | case 'f': value = '\f'; break; | |
3184 | case 'b': value = '\b'; break; | |
0407a77b | 3185 | #ifdef ASCIIish |
b8c5462f JH |
3186 | case 'e': value = '\033'; break; |
3187 | case 'a': value = '\007'; break; | |
0407a77b GS |
3188 | #else |
3189 | case 'e': value = '\047'; break; | |
3190 | case 'a': value = '\057'; break; | |
3191 | #endif | |
b8c5462f | 3192 | case 'x': |
b21ed0a9 | 3193 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3194 | value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen); |
b8c5462f JH |
3195 | PL_regcomp_parse += numlen; |
3196 | break; | |
3197 | case 'c': | |
3198 | value = UCHARAT(PL_regcomp_parse++); | |
3199 | value = toCTRL(value); | |
3200 | break; | |
3201 | case '0': case '1': case '2': case '3': case '4': | |
3202 | case '5': case '6': case '7': case '8': case '9': | |
b21ed0a9 | 3203 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3204 | value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen); |
b8c5462f JH |
3205 | PL_regcomp_parse += numlen; |
3206 | break; | |
1028017a | 3207 | default: |
e476b1b5 | 3208 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value)) |
b45f050a JF |
3209 | |
3210 | vWARN2(PL_regcomp_parse, "Unrecognized escape \\%c in character class passed through", (int)value); | |
1028017a | 3211 | break; |
b8c5462f JH |
3212 | } |
3213 | } | |
73b437c8 | 3214 | if (namedclass > OOB_NAMEDCLASS) { |
936ed897 IZ |
3215 | if (!need_class && !SIZE_ONLY) |
3216 | ANYOF_CLASS_ZERO(ret); | |
3217 | need_class = 1; | |
73b437c8 JH |
3218 | if (range) { /* a-\d, a-[:digit:] */ |
3219 | if (!SIZE_ONLY) { | |
e476b1b5 | 3220 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3221 | vWARN4(PL_regcomp_parse, |
3222 | "False [] range \"%*.*s\"", | |
3223 | PL_regcomp_parse - rangebegin, | |
3224 | PL_regcomp_parse - rangebegin, | |
3225 | rangebegin); | |
936ed897 IZ |
3226 | ANYOF_BITMAP_SET(ret, lastvalue); |
3227 | ANYOF_BITMAP_SET(ret, '-'); | |
b8c5462f | 3228 | } |
73b437c8 JH |
3229 | range = 0; /* this is not a true range */ |
3230 | } | |
3231 | if (!SIZE_ONLY) { | |
3232 | switch (namedclass) { | |
3233 | case ANYOF_ALNUM: | |
3234 | if (LOC) | |
936ed897 | 3235 | ANYOF_CLASS_SET(ret, ANYOF_ALNUM); |
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_NALNUM: | |
3243 | if (LOC) | |
936ed897 | 3244 | ANYOF_CLASS_SET(ret, ANYOF_NALNUM); |
73b437c8 JH |
3245 | else { |
3246 | for (value = 0; value < 256; value++) | |
3247 | if (!isALNUM(value)) | |
936ed897 | 3248 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3249 | } |
3250 | break; | |
3251 | case ANYOF_SPACE: | |
3252 | if (LOC) | |
936ed897 | 3253 | ANYOF_CLASS_SET(ret, ANYOF_SPACE); |
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_NSPACE: | |
3261 | if (LOC) | |
936ed897 | 3262 | ANYOF_CLASS_SET(ret, ANYOF_NSPACE); |
73b437c8 JH |
3263 | else { |
3264 | for (value = 0; value < 256; value++) | |
3265 | if (!isSPACE(value)) | |
936ed897 | 3266 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3267 | } |
3268 | break; | |
3269 | case ANYOF_DIGIT: | |
3270 | if (LOC) | |
936ed897 | 3271 | ANYOF_CLASS_SET(ret, ANYOF_DIGIT); |
73b437c8 JH |
3272 | else { |
3273 | for (value = '0'; value <= '9'; value++) | |
936ed897 | 3274 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3275 | } |
3276 | break; | |
3277 | case ANYOF_NDIGIT: | |
3278 | if (LOC) | |
936ed897 | 3279 | ANYOF_CLASS_SET(ret, ANYOF_NDIGIT); |
73b437c8 JH |
3280 | else { |
3281 | for (value = 0; value < '0'; value++) | |
936ed897 | 3282 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 | 3283 | for (value = '9' + 1; value < 256; value++) |
936ed897 | 3284 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3285 | } |
3286 | break; | |
3287 | case ANYOF_NALNUMC: | |
3288 | if (LOC) | |
936ed897 | 3289 | ANYOF_CLASS_SET(ret, ANYOF_NALNUMC); |
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_ALNUMC: | |
3297 | if (LOC) | |
936ed897 | 3298 | ANYOF_CLASS_SET(ret, ANYOF_ALNUMC); |
73b437c8 JH |
3299 | else { |
3300 | for (value = 0; value < 256; value++) | |
3301 | if (isALNUMC(value)) | |
936ed897 | 3302 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3303 | } |
3304 | break; | |
3305 | case ANYOF_ALPHA: | |
3306 | if (LOC) | |
936ed897 | 3307 | ANYOF_CLASS_SET(ret, ANYOF_ALPHA); |
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_NALPHA: | |
3315 | if (LOC) | |
936ed897 | 3316 | ANYOF_CLASS_SET(ret, ANYOF_NALPHA); |
73b437c8 JH |
3317 | else { |
3318 | for (value = 0; value < 256; value++) | |
3319 | if (!isALPHA(value)) | |
936ed897 | 3320 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3321 | } |
3322 | break; | |
3323 | case ANYOF_ASCII: | |
3324 | if (LOC) | |
936ed897 | 3325 | ANYOF_CLASS_SET(ret, ANYOF_ASCII); |
73b437c8 | 3326 | else { |
a5993822 | 3327 | #ifdef ASCIIish |
73b437c8 | 3328 | for (value = 0; value < 128; value++) |
936ed897 | 3329 | ANYOF_BITMAP_SET(ret, value); |
a5993822 PP |
3330 | #else /* EBCDIC */ |
3331 | for (value = 0; value < 256; value++) | |
3332 | if (isASCII(value)) | |
3333 | ANYOF_BITMAP_SET(ret, value); | |
3334 | #endif /* EBCDIC */ | |
73b437c8 JH |
3335 | } |
3336 | break; | |
3337 | case ANYOF_NASCII: | |
3338 | if (LOC) | |
936ed897 | 3339 | ANYOF_CLASS_SET(ret, ANYOF_NASCII); |
73b437c8 | 3340 | else { |
a5993822 | 3341 | #ifdef ASCIIish |
73b437c8 | 3342 | for (value = 128; value < 256; value++) |
936ed897 | 3343 | ANYOF_BITMAP_SET(ret, value); |
a5993822 PP |
3344 | #else /* EBCDIC */ |
3345 | for (value = 0; value < 256; value++) | |
3346 | if (!isASCII(value)) | |
3347 | ANYOF_BITMAP_SET(ret, value); | |
3348 | #endif /* EBCDIC */ | |
73b437c8 JH |
3349 | } |
3350 | break; | |
aaa51d5e JF |
3351 | case ANYOF_BLANK: |
3352 | if (LOC) | |
3353 | ANYOF_CLASS_SET(ret, ANYOF_BLANK); | |
3354 | else { | |
3355 | for (value = 0; value < 256; value++) | |
3356 | if (isBLANK(value)) | |
3357 | ANYOF_BITMAP_SET(ret, value); | |
3358 | } | |
3359 | break; | |
3360 | case ANYOF_NBLANK: | |
3361 | if (LOC) | |
3362 | ANYOF_CLASS_SET(ret, ANYOF_NBLANK); | |
3363 | else { | |
3364 | for (value = 0; value < 256; value++) | |
3365 | if (!isBLANK(value)) | |
3366 | ANYOF_BITMAP_SET(ret, value); | |
3367 | } | |
3368 | break; | |
73b437c8 JH |
3369 | case ANYOF_CNTRL: |
3370 | if (LOC) | |
936ed897 | 3371 | ANYOF_CLASS_SET(ret, ANYOF_CNTRL); |
73b437c8 JH |
3372 | else { |
3373 | for (value = 0; value < 256; value++) | |
3374 | if (isCNTRL(value)) | |
936ed897 | 3375 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3376 | } |
3377 | lastvalue = OOB_CHAR8; | |
3378 | break; | |
3379 | case ANYOF_NCNTRL: | |
3380 | if (LOC) | |
936ed897 | 3381 | ANYOF_CLASS_SET(ret, ANYOF_NCNTRL); |
73b437c8 JH |
3382 | else { |
3383 | for (value = 0; value < 256; value++) | |
3384 | if (!isCNTRL(value)) | |
936ed897 | 3385 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3386 | } |
3387 | break; | |
3388 | case ANYOF_GRAPH: | |
3389 | if (LOC) | |
936ed897 | 3390 | ANYOF_CLASS_SET(ret, ANYOF_GRAPH); |
73b437c8 JH |
3391 | else { |
3392 | for (value = 0; value < 256; value++) | |
3393 | if (isGRAPH(value)) | |
936ed897 | 3394 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3395 | } |
3396 | break; | |
3397 | case ANYOF_NGRAPH: | |
3398 | if (LOC) | |
936ed897 | 3399 | ANYOF_CLASS_SET(ret, ANYOF_NGRAPH); |
73b437c8 JH |
3400 | else { |
3401 | for (value = 0; value < 256; value++) | |
3402 | if (!isGRAPH(value)) | |
936ed897 | 3403 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3404 | } |
3405 | break; | |
3406 | case ANYOF_LOWER: | |
3407 | if (LOC) | |
936ed897 | 3408 | ANYOF_CLASS_SET(ret, ANYOF_LOWER); |
73b437c8 JH |
3409 | else { |
3410 | for (value = 0; value < 256; value++) | |
3411 | if (isLOWER(value)) | |
936ed897 | 3412 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3413 | } |
3414 | break; | |
3415 | case ANYOF_NLOWER: | |
3416 | if (LOC) | |
936ed897 | 3417 | ANYOF_CLASS_SET(ret, ANYOF_NLOWER); |
73b437c8 JH |
3418 | else { |
3419 | for (value = 0; value < 256; value++) | |
3420 | if (!isLOWER(value)) | |
936ed897 | 3421 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3422 | } |
3423 | break; | |
3424 | case ANYOF_PRINT: | |
3425 | if (LOC) | |
936ed897 | 3426 | ANYOF_CLASS_SET(ret, ANYOF_PRINT); |
73b437c8 JH |
3427 | else { |
3428 | for (value = 0; value < 256; value++) | |
3429 | if (isPRINT(value)) | |
936ed897 | 3430 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3431 | } |
3432 | break; | |
3433 | case ANYOF_NPRINT: | |
3434 | if (LOC) | |
936ed897 | 3435 | ANYOF_CLASS_SET(ret, ANYOF_NPRINT); |
73b437c8 JH |
3436 | else { |
3437 | for (value = 0; value < 256; value++) | |
3438 | if (!isPRINT(value)) | |
936ed897 | 3439 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3440 | } |
3441 | break; | |
aaa51d5e JF |
3442 | case ANYOF_PSXSPC: |
3443 | if (LOC) | |
3444 | ANYOF_CLASS_SET(ret, ANYOF_PSXSPC); | |
3445 | else { | |
3446 | for (value = 0; value < 256; value++) | |
3447 | if (isPSXSPC(value)) | |
3448 | ANYOF_BITMAP_SET(ret, value); | |
3449 | } | |
3450 | break; | |
3451 | case ANYOF_NPSXSPC: | |
3452 | if (LOC) | |
3453 | ANYOF_CLASS_SET(ret, ANYOF_NPSXSPC); | |
3454 | else { | |
3455 | for (value = 0; value < 256; value++) | |
3456 | if (!isPSXSPC(value)) | |
3457 | ANYOF_BITMAP_SET(ret, value); | |
3458 | } | |
3459 | break; | |
73b437c8 JH |
3460 | case ANYOF_PUNCT: |
3461 | if (LOC) | |
936ed897 | 3462 | ANYOF_CLASS_SET(ret, ANYOF_PUNCT); |
73b437c8 JH |
3463 | else { |
3464 | for (value = 0; value < 256; value++) | |
3465 | if (isPUNCT(value)) | |
936ed897 | 3466 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3467 | } |
3468 | break; | |
3469 | case ANYOF_NPUNCT: | |
3470 | if (LOC) | |
936ed897 | 3471 | ANYOF_CLASS_SET(ret, ANYOF_NPUNCT); |
73b437c8 JH |
3472 | else { |
3473 | for (value = 0; value < 256; value++) | |
3474 | if (!isPUNCT(value)) | |
936ed897 | 3475 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3476 | } |
3477 | break; | |
3478 | case ANYOF_UPPER: | |
3479 | if (LOC) | |
936ed897 | 3480 | ANYOF_CLASS_SET(ret, ANYOF_UPPER); |
73b437c8 JH |
3481 | else { |
3482 | for (value = 0; value < 256; value++) | |
3483 | if (isUPPER(value)) | |
936ed897 | 3484 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3485 | } |
3486 | break; | |
3487 | case ANYOF_NUPPER: | |
3488 | if (LOC) | |
936ed897 | 3489 | ANYOF_CLASS_SET(ret, ANYOF_NUPPER); |
73b437c8 JH |
3490 | else { |
3491 | for (value = 0; value < 256; value++) | |
3492 | if (!isUPPER(value)) | |
936ed897 | 3493 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3494 | } |
3495 | break; | |
3496 | case ANYOF_XDIGIT: | |
3497 | if (LOC) | |
936ed897 | 3498 | ANYOF_CLASS_SET(ret, ANYOF_XDIGIT); |
73b437c8 JH |
3499 | else { |
3500 | for (value = 0; value < 256; value++) | |
3501 | if (isXDIGIT(value)) | |
936ed897 | 3502 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3503 | } |
3504 | break; | |
3505 | case ANYOF_NXDIGIT: | |
3506 | if (LOC) | |
936ed897 | 3507 | ANYOF_CLASS_SET(ret, ANYOF_NXDIGIT); |
73b437c8 JH |
3508 | else { |
3509 | for (value = 0; value < 256; value++) | |
3510 | if (!isXDIGIT(value)) | |
936ed897 | 3511 | ANYOF_BITMAP_SET(ret, value); |
73b437c8 JH |
3512 | } |
3513 | break; | |
3514 | default: | |
b45f050a | 3515 | vFAIL("Invalid [::] class"); |
73b437c8 | 3516 | break; |
b8c5462f | 3517 | } |
b8c5462f | 3518 | if (LOC) |
936ed897 | 3519 | ANYOF_FLAGS(ret) |= ANYOF_CLASS; |
73b437c8 | 3520 | continue; |
a0d0e21e LW |
3521 | } |
3522 | } | |
3523 | if (range) { | |
73b437c8 | 3524 | if (lastvalue > value) /* b-a */ { |
b45f050a JF |
3525 | Simple_vFAIL4("Invalid [] range \"%*.*s\"", |
3526 | PL_regcomp_parse - rangebegin, | |
3527 | PL_regcomp_parse - rangebegin, | |
3528 | rangebegin); | |
73b437c8 | 3529 | } |
a0d0e21e LW |
3530 | range = 0; |
3531 | } | |
3532 | else { | |
a0ed51b3 | 3533 | lastvalue = value; |
3280af22 | 3534 | if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend && |
93733859 | 3535 | PL_regcomp_parse[1] != ']') { |
3280af22 | 3536 | PL_regcomp_parse++; |
73b437c8 | 3537 | if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */ |
e476b1b5 | 3538 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3539 | vWARN4(PL_regcomp_parse, |
3540 | "False [] range \"%*.*s\"", | |
3541 | PL_regcomp_parse - rangebegin, | |
3542 | PL_regcomp_parse - rangebegin, | |
3543 | rangebegin); | |
73b437c8 | 3544 | if (!SIZE_ONLY) |
936ed897 | 3545 | ANYOF_BITMAP_SET(ret, '-'); |
73b437c8 JH |
3546 | } else |
3547 | range = 1; | |
a0d0e21e LW |
3548 | continue; /* do it next time */ |
3549 | } | |
a687059c | 3550 | } |
93733859 | 3551 | /* now is the next time */ |
ae5c130c | 3552 | if (!SIZE_ONLY) { |
93733859 | 3553 | #ifndef ASCIIish /* EBCDIC, for example. */ |
8ada0baa | 3554 | if ((isLOWER(lastvalue) && isLOWER(value)) || |
c8dba6f3 GS |
3555 | (isUPPER(lastvalue) && isUPPER(value))) |
3556 | { | |
3557 | I32 i; | |
8ada0baa JH |
3558 | if (isLOWER(lastvalue)) { |
3559 | for (i = lastvalue; i <= value; i++) | |
3560 | if (isLOWER(i)) | |
936ed897 | 3561 | ANYOF_BITMAP_SET(ret, i); |
8ada0baa JH |
3562 | } else { |
3563 | for (i = lastvalue; i <= value; i++) | |
3564 | if (isUPPER(i)) | |
936ed897 | 3565 | ANYOF_BITMAP_SET(ret, i); |
8ada0baa JH |
3566 | } |
3567 | } | |
3568 | else | |
3569 | #endif | |
3570 | for ( ; lastvalue <= value; lastvalue++) | |
936ed897 | 3571 | ANYOF_BITMAP_SET(ret, lastvalue); |
8ada0baa | 3572 | } |
93733859 | 3573 | range = 0; |
a0d0e21e | 3574 | } |
936ed897 IZ |
3575 | if (need_class) { |
3576 | if (SIZE_ONLY) | |
3577 | PL_regsize += ANYOF_CLASS_ADD_SKIP; | |
3578 | else | |
3579 | PL_regcode += ANYOF_CLASS_ADD_SKIP; | |
3580 | } | |
ae5c130c | 3581 | /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */ |
b8c5462f | 3582 | if (!SIZE_ONLY && |
936ed897 | 3583 | (ANYOF_FLAGS(ret) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) { |
a0ed51b3 | 3584 | for (value = 0; value < 256; ++value) { |
936ed897 | 3585 | if (ANYOF_BITMAP_TEST(ret, value)) { |
22c35a8c | 3586 | I32 cf = PL_fold[value]; |
936ed897 | 3587 | ANYOF_BITMAP_SET(ret, cf); |
ae5c130c GS |
3588 | } |
3589 | } | |
936ed897 | 3590 | ANYOF_FLAGS(ret) &= ~ANYOF_FOLD; |
ae5c130c GS |
3591 | } |
3592 | /* optimize inverted simple patterns (e.g. [^a-z]) */ | |
936ed897 | 3593 | if (!SIZE_ONLY && (ANYOF_FLAGS(ret) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) { |
b8c5462f | 3594 | for (value = 0; value < ANYOF_BITMAP_SIZE; ++value) |
936ed897 IZ |
3595 | ANYOF_BITMAP(ret)[value] ^= ANYOF_FLAGS_ALL; |
3596 | ANYOF_FLAGS(ret) = 0; | |
ae5c130c | 3597 | } |
a0d0e21e LW |
3598 | return ret; |
3599 | } | |
3600 | ||
a0ed51b3 | 3601 | STATIC regnode * |
cea2e8a9 | 3602 | S_regclassutf8(pTHX) |
a0ed51b3 | 3603 | { |
b8c5462f | 3604 | dTHR; |
936ed897 | 3605 | register char *e; |
470c3474 | 3606 | register U32 value; |
b8c5462f | 3607 | register U32 lastvalue = OOB_UTF8; |
a0ed51b3 LW |
3608 | register I32 range = 0; |
3609 | register regnode *ret; | |
ba210ebe | 3610 | STRLEN numlen; |
a0ed51b3 LW |
3611 | I32 n; |
3612 | SV *listsv; | |
3613 | U8 flags = 0; | |
b8c5462f | 3614 | I32 namedclass; |
73b437c8 | 3615 | char *rangebegin; |
a0ed51b3 LW |
3616 | |
3617 | if (*PL_regcomp_parse == '^') { /* Complement of range. */ | |
3618 | PL_regnaughty++; | |
3619 | PL_regcomp_parse++; | |
3620 | if (!SIZE_ONLY) | |
3621 | flags |= ANYOF_INVERT; | |
3622 | } | |
3623 | if (!SIZE_ONLY) { | |
3624 | if (FOLD) | |
3625 | flags |= ANYOF_FOLD; | |
3626 | if (LOC) | |
3627 | flags |= ANYOF_LOCALE; | |
79cb57f6 | 3628 | listsv = newSVpvn("# comment\n",10); |
a0ed51b3 LW |
3629 | } |
3630 | ||
e476b1b5 | 3631 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP)) |
936ed897 | 3632 | checkposixcc(); |
b8c5462f | 3633 | |
a0ed51b3 LW |
3634 | if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-') |
3635 | goto skipcond; /* allow 1st char to be ] or - */ | |
3636 | ||
3637 | while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') { | |
3638 | skipcond: | |
93733859 | 3639 | namedclass = OOB_NAMEDCLASS; |
73b437c8 JH |
3640 | if (!range) |
3641 | rangebegin = PL_regcomp_parse; | |
dcad2880 | 3642 | value = utf8_to_uv((U8*)PL_regcomp_parse, |
ba210ebe JH |
3643 | PL_regxend - PL_regcomp_parse, |
3644 | &numlen, 0); | |
a0ed51b3 | 3645 | PL_regcomp_parse += numlen; |
620e46c5 | 3646 | if (value == '[') |
b8c5462f | 3647 | namedclass = regpposixcc(value); |
620e46c5 | 3648 | else if (value == '\\') { |
dcad2880 | 3649 | value = (U32)utf8_to_uv((U8*)PL_regcomp_parse, |
ba210ebe JH |
3650 | PL_regxend - PL_regcomp_parse, |
3651 | &numlen, 0); | |
a0ed51b3 | 3652 | PL_regcomp_parse += numlen; |
470c3474 JH |
3653 | /* Some compilers cannot handle switching on 64-bit integer |
3654 | * values, therefore value cannot be an UV. Yes, this will | |
3655 | * be a problem later if we want switch on Unicode. --jhi */ | |
a0ed51b3 | 3656 | switch (value) { |
b8c5462f JH |
3657 | case 'w': namedclass = ANYOF_ALNUM; break; |
3658 | case 'W': namedclass = ANYOF_NALNUM; break; | |
3659 | case 's': namedclass = ANYOF_SPACE; break; | |
3660 | case 'S': namedclass = ANYOF_NSPACE; break; | |
3661 | case 'd': namedclass = ANYOF_DIGIT; break; | |
3662 | case 'D': namedclass = ANYOF_NDIGIT; break; | |
a0ed51b3 LW |
3663 | case 'p': |
3664 | case 'P': | |
3665 | if (*PL_regcomp_parse == '{') { | |
3666 | e = strchr(PL_regcomp_parse++, '}'); | |
3667 | if (!e) | |
b45f050a | 3668 | vFAIL("Missing right brace on \\p{}"); |
a0ed51b3 LW |
3669 | n = e - PL_regcomp_parse; |
3670 | } | |
3671 | else { | |
3672 | e = PL_regcomp_parse; | |
3673 | n = 1; | |
3674 | } | |
3675 | if (!SIZE_ONLY) { | |
3676 | if (value == 'p') | |
b8c5462f | 3677 | Perl_sv_catpvf(aTHX_ listsv, |
894356b3 | 3678 | "+utf8::%.*s\n", (int)n, PL_regcomp_parse); |
a0ed51b3 | 3679 | else |
cea2e8a9 | 3680 | Perl_sv_catpvf(aTHX_ listsv, |
894356b3 | 3681 | "!utf8::%.*s\n", (int)n, PL_regcomp_parse); |
a0ed51b3 LW |
3682 | } |
3683 | PL_regcomp_parse = e + 1; | |
b8c5462f | 3684 | lastvalue = OOB_UTF8; |
a0ed51b3 | 3685 | continue; |
b8c5462f JH |
3686 | case 'n': value = '\n'; break; |
3687 | case 'r': value = '\r'; break; | |
3688 | case 't': value = '\t'; break; | |
3689 | case 'f': value = '\f'; break; | |
3690 | case 'b': value = '\b'; break; | |
0407a77b | 3691 | #ifdef ASCIIish |
b8c5462f JH |
3692 | case 'e': value = '\033'; break; |
3693 | case 'a': value = '\007'; break; | |
0407a77b GS |
3694 | #else |
3695 | case 'e': value = '\047'; break; | |
3696 | case 'a': value = '\057'; break; | |
3697 | #endif | |
a0ed51b3 LW |
3698 | case 'x': |
3699 | if (*PL_regcomp_parse == '{') { | |
3700 | e = strchr(PL_regcomp_parse++, '}'); | |
b45f050a JF |
3701 | if (!e) |
3702 | vFAIL("Missing right brace on \\x{}"); | |
b21ed0a9 | 3703 | numlen = 1; /* allow underscores */ |
dff6d3cd | 3704 | value = (UV)scan_hex(PL_regcomp_parse, |
b8c5462f JH |
3705 | e - PL_regcomp_parse, |
3706 | &numlen); | |
a0ed51b3 LW |
3707 | PL_regcomp_parse = e + 1; |
3708 | } | |
3709 | else { | |
b21ed0a9 | 3710 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3711 | value = (UV)scan_hex(PL_regcomp_parse, 2, &numlen); |
a0ed51b3 LW |
3712 | PL_regcomp_parse += numlen; |
3713 | } | |
3714 | break; | |
3715 | case 'c': | |
3716 | value = UCHARAT(PL_regcomp_parse++); | |
3717 | value = toCTRL(value); | |
3718 | break; | |
3719 | case '0': case '1': case '2': case '3': case '4': | |
3720 | case '5': case '6': case '7': case '8': case '9': | |
b21ed0a9 | 3721 | numlen = 0; /* disallow underscores */ |
dff6d3cd | 3722 | value = (UV)scan_oct(--PL_regcomp_parse, 3, &numlen); |
a0ed51b3 LW |
3723 | PL_regcomp_parse += numlen; |
3724 | break; | |
1028017a | 3725 | default: |
e476b1b5 | 3726 | if (!SIZE_ONLY && ckWARN(WARN_REGEXP) && isALPHA(value)) |
b45f050a JF |
3727 | vWARN2(PL_regcomp_parse, |
3728 | "Unrecognized escape \\%c in character class passed through", | |
3729 | (int)value); | |
1028017a | 3730 | break; |
a0ed51b3 LW |
3731 | } |
3732 | } | |
73b437c8 JH |
3733 | if (namedclass > OOB_NAMEDCLASS) { |
3734 | if (range) { /* a-\d, a-[:digit:] */ | |
3735 | if (!SIZE_ONLY) { | |
e476b1b5 | 3736 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3737 | vWARN4(PL_regcomp_parse, |
3738 | "False [] range \"%*.*s\"", | |
3739 | PL_regcomp_parse - rangebegin, | |
3740 | PL_regcomp_parse - rangebegin, | |
3741 | rangebegin); | |
73b437c8 JH |
3742 | Perl_sv_catpvf(aTHX_ listsv, |
3743 | /* 0x002D is Unicode for '-' */ | |
3744 | "%04"UVxf"\n002D\n", (UV)lastvalue); | |
3745 | } | |
3746 | range = 0; | |
3747 | } | |
3748 | if (!SIZE_ONLY) { | |
3749 | switch (namedclass) { | |
3750 | case ANYOF_ALNUM: | |
3751 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break; | |
3752 | case ANYOF_NALNUM: | |
3753 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break; | |
3754 | case ANYOF_ALNUMC: | |
3755 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break; | |
3756 | case ANYOF_NALNUMC: | |
3757 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break; | |
3758 | case ANYOF_ALPHA: | |
3759 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break; | |
3760 | case ANYOF_NALPHA: | |
3761 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break; | |
3762 | case ANYOF_ASCII: | |
3763 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break; | |
3764 | case ANYOF_NASCII: | |
3765 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break; | |
3766 | case ANYOF_CNTRL: | |
3767 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break; | |
3768 | case ANYOF_NCNTRL: | |
3769 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break; | |
3770 | case ANYOF_GRAPH: | |
3771 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break; | |
3772 | case ANYOF_NGRAPH: | |
3773 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break; | |
3774 | case ANYOF_DIGIT: | |
3775 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break; | |
3776 | case ANYOF_NDIGIT: | |
3777 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break; | |
3778 | case ANYOF_LOWER: | |
3779 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break; | |
3780 | case ANYOF_NLOWER: | |
3781 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break; | |
3782 | case ANYOF_PRINT: | |
3783 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break; | |
3784 | case ANYOF_NPRINT: | |
3785 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break; | |
3786 | case ANYOF_PUNCT: | |
3787 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break; | |
3788 | case ANYOF_NPUNCT: | |
3789 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break; | |
3790 | case ANYOF_SPACE: | |
aaa51d5e JF |
3791 | case ANYOF_PSXSPC: |
3792 | case ANYOF_BLANK: | |
73b437c8 JH |
3793 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break; |
3794 | case ANYOF_NSPACE: | |
aaa51d5e JF |
3795 | case ANYOF_NPSXSPC: |
3796 | case ANYOF_NBLANK: | |
73b437c8 JH |
3797 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break; |
3798 | case ANYOF_UPPER: | |
3799 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break; | |
3800 | case ANYOF_NUPPER: | |
3801 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break; | |
3802 | case ANYOF_XDIGIT: | |
3803 | Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break; | |
3804 | case ANYOF_NXDIGIT: | |
3805 | Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break; | |
3806 | } | |
3807 | continue; | |
b8c5462f JH |
3808 | } |
3809 | } | |
b8c5462f | 3810 | if (range) { |
73b437c8 | 3811 | if (lastvalue > value) { /* b-a */ |
b45f050a JF |
3812 | Simple_vFAIL4("invalid [] range \"%*.*s\"", |
3813 | PL_regcomp_parse - rangebegin, | |
3814 | PL_regcomp_parse - rangebegin, | |
3815 | rangebegin); | |
73b437c8 | 3816 | } |
a0ed51b3 LW |
3817 | range = 0; |
3818 | } | |
3819 | else { | |
3820 | lastvalue = value; | |
3821 | if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend && | |
93733859 | 3822 | PL_regcomp_parse[1] != ']') { |
a0ed51b3 | 3823 | PL_regcomp_parse++; |
73b437c8 | 3824 | if (namedclass > OOB_NAMEDCLASS) { /* \w-, [:word:]- */ |
e476b1b5 | 3825 | if (ckWARN(WARN_REGEXP)) |
b45f050a JF |
3826 | vWARN4(PL_regcomp_parse, |
3827 | "False [] range \"%*.*s\"", | |
3828 | PL_regcomp_parse - rangebegin, | |
3829 | PL_regcomp_parse - rangebegin, | |
3830 | rangebegin); | |
73b437c8 JH |
3831 | if (!SIZE_ONLY) |
3832 | Perl_sv_catpvf(aTHX_ listsv, | |
3833 | /* 0x002D is Unicode for '-' */ | |
3834 | "002D\n"); | |
3835 | } else | |
3836 | range = 1; | |
a0ed51b3 LW |
3837 | continue; /* do it next time */ |
3838 | } | |
93733859 JH |
3839 | } |
3840 | /* now is the next time */ | |
93733859 | 3841 | if (!SIZE_ONLY) |
73b437c8 JH |
3842 | Perl_sv_catpvf(aTHX_ listsv, "%04"UVxf"\t%04"UVxf"\n", |
3843 | (UV)lastvalue, (UV)value); | |
93733859 | 3844 | range = 0; |
a0ed51b3 | 3845 | } |
a0ed51b3 LW |
3846 | |
3847 | ret = reganode(ANYOFUTF8, 0); | |
3848 | ||
3849 | if (!SIZE_ONLY) { | |
3850 | SV *rv = swash_init("utf8", "", listsv, 1, 0); | |
3851 | SvREFCNT_dec(listsv); | |
3852 | n = add_data(1,"s"); | |
3853 | PL_regcomp_rx->data->data[n] = (void*)rv; | |
3854 | ARG1_SET(ret, flags); | |
3855 | ARG2_SET(ret, n); | |
3856 | } | |
3857 | ||
3858 | return ret; | |
3859 | } | |
3860 | ||
76e3520e | 3861 | STATIC char* |
cea2e8a9 | 3862 | S_nextchar(pTHX) |
a0d0e21e | 3863 | { |
5c0ca799 | 3864 | dTHR; |
3280af22 | 3865 | char* retval = PL_regcomp_parse++; |
a0d0e21e | 3866 | |
4633a7c4 | 3867 | for (;;) { |
3280af22 NIS |
3868 | if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' && |
3869 | PL_regcomp_parse[2] == '#') { | |
3870 | while (*PL_regcomp_parse && *PL_regcomp_parse != ')') | |
3871 | PL_regcomp_parse++; | |
3872 | PL_regcomp_parse++; | |
4633a7c4 LW |
3873 | continue; |
3874 | } | |
3280af22 NIS |
3875 | if (PL_regflags & PMf_EXTENDED) { |
3876 | if (isSPACE(*PL_regcomp_parse)) { | |
3877 | PL_regcomp_parse++; | |
748a9306 LW |
3878 | continue; |
3879 | } | |
3280af22 NIS |
3880 | else if (*PL_regcomp_parse == '#') { |
3881 | while (*PL_regcomp_parse && *PL_regcomp_parse != '\n') | |
3882 | PL_regcomp_parse++; | |
3883 | PL_regcomp_parse++; | |
748a9306 LW |
3884 | continue; |
3885 | } | |
748a9306 | 3886 | } |
4633a7c4 | 3887 | return retval; |
a0d0e21e | 3888 | } |
a687059c LW |
3889 | } |
3890 | ||
3891 | /* | |
c277df42 | 3892 | - reg_node - emit a node |
a0d0e21e | 3893 | */ |
76e3520e | 3894 | STATIC regnode * /* Location. */ |
cea2e8a9 | 3895 | S_reg_node(pTHX_ U8 op) |
a687059c | 3896 | { |
5c0ca799 | 3897 | dTHR; |
c277df42 IZ |
3898 | register regnode *ret; |
3899 | register regnode *ptr; | |
a687059c | 3900 | |
3280af22 | 3901 | ret = PL_regcode; |
c277df42 | 3902 | if (SIZE_ONLY) { |
6b88bc9c | 3903 | SIZE_ALIGN(PL_regsize); |
3280af22 | 3904 | PL_regsize += 1; |
a0d0e21e LW |
3905 | return(ret); |
3906 | } | |
a687059c | 3907 | |
c277df42 | 3908 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 3909 | ptr = ret; |
c277df42 | 3910 | FILL_ADVANCE_NODE(ptr, op); |
3280af22 | 3911 | PL_regcode = ptr; |
a687059c | 3912 | |
a0d0e21e | 3913 | return(ret); |
a687059c LW |
3914 | } |
3915 | ||
3916 | /* | |
a0d0e21e LW |
3917 | - reganode - emit a node with an argument |
3918 | */ | |
76e3520e | 3919 | STATIC regnode * /* Location. */ |
cea2e8a9 | 3920 | S_reganode(pTHX_ U8 op, U32 arg) |
fe14fcc3 | 3921 | { |
5c0ca799 | 3922 | dTHR; |
c277df42 IZ |
3923 | register regnode *ret; |
3924 | register regnode *ptr; | |
fe14fcc3 | 3925 | |
3280af22 | 3926 | ret = PL_regcode; |
c277df42 | 3927 | if (SIZE_ONLY) { |
6b88bc9c | 3928 | SIZE_ALIGN(PL_regsize); |
3280af22 | 3929 | PL_regsize += 2; |
a0d0e21e LW |
3930 | return(ret); |
3931 | } | |
fe14fcc3 | 3932 | |
c277df42 | 3933 | NODE_ALIGN_FILL(ret); |
a0d0e21e | 3934 | ptr = ret; |
c277df42 | 3935 | FILL_ADVANCE_NODE_ARG(ptr, op, arg); |
3280af22 | 3936 | PL_regcode = ptr; |
fe14fcc3 | 3937 | |
a0d0e21e | 3938 | return(ret); |
fe14fcc3 LW |
3939 | } |
3940 | ||
3941 | /* | |
cd439c50 | 3942 | - reguni - emit (if appropriate) a Unicode character |
a0ed51b3 LW |
3943 | */ |
3944 | STATIC void | |
ba210ebe | 3945 | S_reguni(pTHX_ UV uv, char* s, STRLEN* lenp) |
a0ed51b3 | 3946 | { |
c485e607 | 3947 | dTHR; |
a0ed51b3 | 3948 | if (SIZE_ONLY) { |
806e7201 | 3949 | U8 tmpbuf[UTF8_MAXLEN]; |
a0ed51b3 LW |
3950 | *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf; |
3951 | } | |
3952 | else | |
dfe13c55 | 3953 | *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s; |
a0ed51b3 LW |
3954 | |
3955 | } | |
3956 | ||
3957 | /* | |
a0d0e21e LW |
3958 | - reginsert - insert an operator in front of already-emitted operand |
3959 | * | |
3960 | * Means relocating the operand. | |
3961 | */ | |
76e3520e | 3962 | STATIC void |
cea2e8a9 | 3963 | S_reginsert(pTHX_ U8 op, regnode *opnd) |
a687059c | 3964 | { |
5c0ca799 | 3965 | dTHR; |
c277df42 IZ |
3966 | register regnode *src; |
3967 | register regnode *dst; | |
3968 | register regnode *place; | |
3969 | register int offset = regarglen[(U8)op]; | |
3970 | ||
22c35a8c | 3971 | /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */ |
c277df42 IZ |
3972 | |
3973 | if (SIZE_ONLY) { | |
3280af22 | 3974 | PL_regsize += NODE_STEP_REGNODE + offset; |
a0d0e21e LW |
3975 | return; |
3976 | } | |
a687059c | 3977 | |
3280af22 NIS |
3978 | src = PL_regcode; |
3979 | PL_regcode += NODE_STEP_REGNODE + offset; | |
3980 | dst = PL_regcode; | |
a0d0e21e | 3981 | while (src > opnd) |
c277df42 | 3982 | StructCopy(--src, --dst, regnode); |
a0d0e21e LW |
3983 | |
3984 | place = opnd; /* Op node, where operand used to be. */ | |
c277df42 IZ |
3985 | src = NEXTOPER(place); |
3986 | FILL_ADVANCE_NODE(place, op); | |
3987 | Zero(src, offset, regnode); | |
a687059c LW |
3988 | } |
3989 | ||
3990 | /* | |
c277df42 | 3991 | - regtail - set the next-pointer at the end of a node chain of p to val. |
a0d0e21e | 3992 | */ |
76e3520e | 3993 | STATIC void |
cea2e8a9 | 3994 | S_regtail(pTHX_ regnode *p, regnode *val) |
a687059c | 3995 | { |
5c0ca799 | 3996 | dTHR; |
c277df42 IZ |
3997 | register regnode *scan; |
3998 | register regnode *temp; | |
a0d0e21e | 3999 | |
c277df42 | 4000 | if (SIZE_ONLY) |
a0d0e21e LW |
4001 | return; |
4002 | ||
4003 | /* Find last node. */ | |
4004 | scan = p; | |
4005 | for (;;) { | |
4006 | temp = regnext(scan); | |
4007 | if (temp == NULL) | |
4008 | break; | |
4009 | scan = temp; | |
4010 | } | |
a687059c | 4011 | |
c277df42 IZ |
4012 | if (reg_off_by_arg[OP(scan)]) { |
4013 | ARG_SET(scan, val - scan); | |
a0ed51b3 LW |
4014 | } |
4015 | else { | |
c277df42 IZ |
4016 | NEXT_OFF(scan) = val - scan; |
4017 | } | |
a687059c LW |
4018 | } |
4019 | ||
4020 | /* | |
a0d0e21e LW |
4021 | - regoptail - regtail on operand of first argument; nop if operandless |
4022 | */ | |
76e3520e | 4023 | STATIC void |
cea2e8a9 | 4024 | S_regoptail(pTHX_ regnode *p, regnode *val) |
a687059c | 4025 | { |
5c0ca799 | 4026 | dTHR; |
a0d0e21e | 4027 | /* "Operandless" and "op != BRANCH" are synonymous in practice. */ |
c277df42 IZ |
4028 | if (p == NULL || SIZE_ONLY) |
4029 | return; | |
22c35a8c | 4030 | if (PL_regkind[(U8)OP(p)] == BRANCH) { |
c277df42 | 4031 | regtail(NEXTOPER(p), val); |
a0ed51b3 | 4032 | } |
22c35a8c | 4033 | else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) { |
c277df42 | 4034 | regtail(NEXTOPER(NEXTOPER(p)), val); |
a0ed51b3 LW |
4035 | } |
4036 | else | |
a0d0e21e | 4037 | return; |
a687059c LW |
4038 | } |
4039 | ||
4040 | /* | |
4041 | - regcurly - a little FSA that accepts {\d+,?\d*} | |
4042 | */ | |
79072805 | 4043 | STATIC I32 |
cea2e8a9 | 4044 | S_regcurly(pTHX_ register char *s) |
a687059c LW |
4045 | { |
4046 | if (*s++ != '{') | |
4047 | return FALSE; | |
f0fcb552 | 4048 | if (!isDIGIT(*s)) |
a687059c | 4049 | return FALSE; |
f0fcb552 | 4050 | while (isDIGIT(*s)) |
a687059c LW |
4051 | s++; |
4052 | if (*s == ',') | |
4053 | s++; | |
f0fcb552 | 4054 | while (isDIGIT(*s)) |
a687059c LW |
4055 | s++; |
4056 | if (*s != '}') | |
4057 | return FALSE; | |
4058 | return TRUE; | |
4059 | } | |
4060 | ||
a687059c | 4061 | |
76e3520e | 4062 | STATIC regnode * |
cea2e8a9 | 4063 | S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l) |
c277df42 | 4064 | { |
35ff7856 | 4065 | #ifdef DEBUGGING |
f248d071 | 4066 | register U8 op = EXACT; /* Arbitrary non-END op. */ |
155aba94 | 4067 | register regnode *next; |
c277df42 IZ |
4068 | |
4069 | while (op != END && (!last || node < last)) { | |
4070 | /* While that wasn't END last time... */ | |
4071 | ||
4072 | NODE_ALIGN(node); | |
4073 | op = OP(node); | |
4074 | if (op == CLOSE) | |
4075 | l--; | |
4076 | next = regnext(node); | |
4077 | /* Where, what. */ | |
4078 | if (OP(node) == OPTIMIZED) | |
4079 | goto after_print; | |
4080 | regprop(sv, node); | |
b900a521 | 4081 | PerlIO_printf(Perl_debug_log, "%4"IVdf":%*s%s", (IV)(node - start), |
f1dbda3d | 4082 | (int)(2*l + 1), "", SvPVX(sv)); |
c277df42 IZ |
4083 | if (next == NULL) /* Next ptr. */ |
4084 | PerlIO_printf(Perl_debug_log, "(0)"); | |
4085 | else | |
b900a521 | 4086 | PerlIO_printf(Perl_debug_log, "(%"IVdf")", (IV)(next - start)); |
c277df42 IZ |
4087 | (void)PerlIO_putc(Perl_debug_log, '\n'); |
4088 | after_print: | |
22c35a8c | 4089 | if (PL_regkind[(U8)op] == BRANCHJ) { |
c277df42 IZ |
4090 | register regnode *nnode = (OP(next) == LONGJMP |
4091 | ? regnext(next) | |
4092 | : next); | |
4093 | if (last && nnode > last) | |
4094 | nnode = last; | |
4095 | node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1); | |
a0ed51b3 | 4096 | } |
22c35a8c | 4097 | else if (PL_regkind[(U8)op] == BRANCH) { |
c277df42 | 4098 | node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1); |
a0ed51b3 LW |
4099 | } |
4100 | else if ( op == CURLY) { /* `next' might be very big: optimizer */ | |
c277df42 IZ |
4101 | node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS, |
4102 | NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1); | |
a0ed51b3 | 4103 | } |
22c35a8c | 4104 | else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) { |
c277df42 IZ |
4105 | node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS, |
4106 | next, sv, l + 1); | |
a0ed51b3 LW |
4107 | } |
4108 | else if ( op == PLUS || op == STAR) { | |
c277df42 | 4109 | node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1); |
a0ed51b3 LW |
4110 | } |
4111 | else if (op == ANYOF) { | |
c277df42 | 4112 | node = NEXTOPER(node); |
936ed897 | 4113 | node += ANYOF_SKIP; |
a0ed51b3 | 4114 | } |
22c35a8c | 4115 | else if (PL_regkind[(U8)op] == EXACT) { |
c277df42 | 4116 | /* Literal string, where present. */ |
cd439c50 | 4117 | node += NODE_SZ_STR(node) - 1; |
c277df42 | 4118 | node = NEXTOPER(node); |
a0ed51b3 LW |
4119 | } |
4120 | else { | |
c277df42 IZ |
4121 | node = NEXTOPER(node); |
4122 | node += regarglen[(U8)op]; | |
4123 | } | |
4124 | if (op == CURLYX || op == OPEN) | |
4125 | l++; | |
4126 | else if (op == WHILEM) | |
4127 | l--; | |
4128 | } | |
17c3b450 | 4129 | #endif /* DEBUGGING */ |
c277df42 IZ |
4130 | return node; |
4131 | } | |
4132 | ||
a687059c | 4133 | /* |
fd181c75 | 4134 | - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form |
a687059c LW |
4135 | */ |
4136 | void | |
864dbfa3 | 4137 | Perl_regdump(pTHX_ regexp *r) |
a687059c | 4138 | { |
35ff7856 | 4139 | #ifdef DEBUGGING |
5c0ca799 | 4140 | dTHR; |
46fc3d4c | 4141 | SV *sv = sv_newmortal(); |
a687059c | 4142 | |
c277df42 | 4143 | (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0); |
a0d0e21e LW |
4144 | |
4145 | /* Header fields of interest. */ | |
c277df42 | 4146 | if (r->anchored_substr) |
7b0972df JH |
4147 | PerlIO_printf(Perl_debug_log, |
4148 | "anchored `%s%.*s%s'%s at %"IVdf" ", | |
3280af22 | 4149 | PL_colors[0], |
7b0972df | 4150 | (int)(SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0)), |
c277df42 | 4151 | SvPVX(r->anchored_substr), |
3280af22 | 4152 | PL_colors[1], |
c277df42 | 4153 | SvTAIL(r->anchored_substr) ? "$" : "", |
7b0972df | 4154 | (IV)r->anchored_offset); |
c277df42 | 4155 | if (r->float_substr) |
7b0972df JH |
4156 | PerlIO_printf(Perl_debug_log, |
4157 | "floating `%s%.*s%s'%s at %"IVdf"..%"UVuf" ", | |
3280af22 | 4158 | PL_colors[0], |
7b0972df | 4159 | (int)(SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0)), |
2c2d71f5 | 4160 | SvPVX(r->float_substr), |
3280af22 | 4161 | PL_colors[1], |
c277df42 | 4162 | SvTAIL(r->float_substr) ? "$" : "", |
7b0972df | 4163 | (IV)r->float_min_offset, (UV)r->float_max_offset); |
c277df42 IZ |
4164 | if (r->check_substr) |
4165 | PerlIO_printf(Perl_debug_log, | |
4166 | r->check_substr == r->float_substr | |
4167 | ? "(checking floating" : "(checking anchored"); | |
4168 | if (r->reganch & ROPT_NOSCAN) | |
4169 | PerlIO_printf(Perl_debug_log, " noscan"); | |
4170 | if (r->reganch & ROPT_CHECK_ALL) | |
4171 | PerlIO_printf(Perl_debug_log, " isall"); | |
4172 | if (r->check_substr) | |
4173 | PerlIO_printf(Perl_debug_log, ") "); | |
4174 | ||
46fc3d4c | 4175 | if (r->regstclass) { |
4176 | regprop(sv, r->regstclass); | |
4177 | PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv)); | |
4178 | } | |
774d564b | 4179 | if (r->reganch & ROPT_ANCH) { |
4180 | PerlIO_printf(Perl_debug_log, "anchored"); | |
4181 | if (r->reganch & ROPT_ANCH_BOL) | |
4182 | PerlIO_printf(Perl_debug_log, "(BOL)"); | |
c277df42 IZ |
4183 | if (r->reganch & ROPT_ANCH_MBOL) |
4184 | PerlIO_printf(Perl_debug_log, "(MBOL)"); | |
cad2e5aa JH |
4185 | if (r->reganch & ROPT_ANCH_SBOL) |
4186 | PerlIO_printf(Perl_debug_log, "(SBOL)"); | |
774d564b | 4187 | if (r->reganch & ROPT_ANCH_GPOS) |
4188 | PerlIO_printf(Perl_debug_log, "(GPOS)"); | |
4189 | PerlIO_putc(Perl_debug_log, ' '); | |
4190 | } | |
c277df42 IZ |
4191 | if (r->reganch & ROPT_GPOS_SEEN) |
4192 | PerlIO_printf(Perl_debug_log, "GPOS "); | |
a0d0e21e | 4193 | if (r->reganch & ROPT_SKIP) |
760ac839 | 4194 | PerlIO_printf(Perl_debug_log, "plus "); |
a0d0e21e | 4195 | if (r->reganch & ROPT_IMPLICIT) |
760ac839 | 4196 | PerlIO_printf(Perl_debug_log, "implicit "); |
760ac839 | 4197 | PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen); |
ce862d02 IZ |
4198 | if (r->reganch & ROPT_EVAL_SEEN) |
4199 | PerlIO_printf(Perl_debug_log, "with eval "); | |
760ac839 | 4200 | PerlIO_printf(Perl_debug_log, "\n"); |
17c3b450 | 4201 | #endif /* DEBUGGING */ |
a687059c LW |
4202 | } |
4203 | ||
653099ff GS |
4204 | STATIC void |
4205 | S_put_byte(pTHX_ SV *sv, int c) | |
4206 | { | |
4207 | if (c <= ' ' || c == 127 || c == 255) | |
4208 | Perl_sv_catpvf(aTHX_ sv, "\\%o", c); | |
4209 | else if (c == '-' || c == ']' || c == '\\' || c == '^') | |
4210 | Perl_sv_catpvf(aTHX_ sv, "\\%c", c); | |
4211 | else | |
4212 | Perl_sv_catpvf(aTHX_ sv, "%c", c); | |
4213 | } | |
4214 | ||
a687059c | 4215 | /* |
a0d0e21e LW |
4216 | - regprop - printable representation of opcode |
4217 | */ | |
46fc3d4c | 4218 | void |
864dbfa3 | 4219 | Perl_regprop(pTHX_ SV *sv, regnode *o) |
a687059c | 4220 | { |
35ff7856 | 4221 | #ifdef DEBUGGING |
5c0ca799 | 4222 | dTHR; |
9b155405 | 4223 | register int k; |
a0d0e21e | 4224 | |
54dc92de | 4225 | sv_setpvn(sv, "", 0); |
9b155405 | 4226 | if (OP(o) >= reg_num) /* regnode.type is unsigned */ |
b45f050a | 4227 | FAIL("Corrupted regexp opcode"); |
9b155405 IZ |
4228 | sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */ |
4229 | ||
4230 | k = PL_regkind[(U8)OP(o)]; | |
4231 | ||
4232 | if (k == EXACT) | |
7821416a | 4233 | Perl_sv_catpvf(aTHX_ sv, " <%s%.*s%s>", PL_colors[0], |
cd439c50 | 4234 | STR_LEN(o), STRING(o), PL_colors[1]); |
9b155405 IZ |
4235 | else if (k == CURLY) { |
4236 | if (OP(o) == CURLYM || OP(o) == CURLYN) | |
cea2e8a9 GS |
4237 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */ |
4238 | Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o)); | |
a0d0e21e | 4239 | } |
2c2d71f5 JH |
4240 | else if (k == WHILEM && o->flags) /* Ordinal/of */ |
4241 | Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4); | |
9b155405 | 4242 | else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP ) |
894356b3 | 4243 | Perl_sv_catpvf(aTHX_ sv, "%d", (int)ARG(o)); /* Parenth number */ |
9b155405 | 4244 | else if (k == LOGICAL) |
04ebc1ab | 4245 | Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* 2: embedded, otherwise 1 */ |
653099ff GS |
4246 | else if (k == ANYOF) { |
4247 | int i, rangestart = -1; | |
4248 | const char * const out[] = { /* Should be syncronized with | |
aaa51d5e | 4249 | ANYOF_ #xdefines in regcomp.h */ |
653099ff GS |
4250 | "\\w", |
4251 | "\\W", | |
4252 | "\\s", | |
4253 | "\\S", | |
4254 | "\\d", | |
4255 | "\\D", | |
4256 | "[:alnum:]", | |
4257 | "[:^alnum:]", | |
4258 | "[:alpha:]", | |
4259 | "[:^alpha:]", | |
4260 | "[:ascii:]", | |
4261 | "[:^ascii:]", | |
4262 | "[:ctrl:]", | |
4263 | "[:^ctrl:]", | |
4264 | "[:graph:]", | |
4265 | "[:^graph:]", | |
4266 | "[:lower:]", | |
4267 | "[:^lower:]", | |
4268 | "[:print:]", | |
4269 | "[:^print:]", | |
4270 | "[:punct:]", | |
4271 | "[:^punct:]", | |
4272 | "[:upper:]", | |
aaa51d5e | 4273 | "[:^upper:]", |
653099ff | 4274 | "[:xdigit:]", |
aaa51d5e JF |
4275 | "[:^xdigit:]", |
4276 | "[:space:]", | |
4277 | "[:^space:]", | |
4278 | "[:blank:]", | |
4279 | "[:^blank:]" | |
653099ff GS |
4280 | }; |
4281 | ||
4282 | if (o->flags & ANYOF_LOCALE) | |
4283 | sv_catpv(sv, "{loc}"); | |
4284 | if (o->flags & ANYOF_FOLD) | |
4285 | sv_catpv(sv, "{i}"); | |
4286 | Perl_sv_catpvf(aTHX_ sv, "[%s", PL_colors[0]); | |
4287 | if (o->flags & ANYOF_INVERT) | |
4288 | sv_catpv(sv, "^"); | |
4289 | for (i = 0; i <= 256; i++) { | |
4290 | if (i < 256 && ANYOF_BITMAP_TEST(o,i)) { | |
4291 | if (rangestart == -1) | |
4292 | rangestart = i; | |
4293 | } else if (rangestart != -1) { | |
4294 | if (i <= rangestart + 3) | |
4295 | for (; rangestart < i; rangestart++) | |
4296 | put_byte(sv, rangestart); | |
4297 | else { | |
4298 | put_byte(sv, rangestart); | |
4299 | sv_catpv(sv, "-"); | |
4300 | put_byte(sv, i - 1); | |
4301 | } | |
4302 | rangestart = -1; | |
4303 | } | |
4304 | } | |
4305 | if (o->flags & ANYOF_CLASS) | |
4306 | for (i = 0; i < sizeof(out)/sizeof(char*); i++) | |
4307 | if (ANYOF_CLASS_TEST(o,i)) | |
4308 | sv_catpv(sv, out[i]); | |
4309 | Perl_sv_catpvf(aTHX_ sv, "%s]", PL_colors[1]); | |
4310 | } | |
9b155405 | 4311 | else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH)) |
cea2e8a9 | 4312 | Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags); |
17c3b450 | 4313 | #endif /* DEBUGGING */ |
35ff7856 | 4314 | } |
a687059c | 4315 | |
cad2e5aa JH |
4316 | SV * |
4317 | Perl_re_intuit_string(pTHX_ regexp *prog) | |
4318 | { /* Assume that RE_INTUIT is set */ | |
4319 | DEBUG_r( | |
4320 | { STRLEN n_a; | |
4321 | char *s = SvPV(prog->check_substr,n_a); | |
4322 | ||
4323 | if (!PL_colorset) reginitcolors(); | |
4324 | PerlIO_printf(Perl_debug_log, | |
4325 | "%sUsing REx substr:%s `%s%.60s%s%s'\n", | |
4326 | PL_colors[4],PL_colors[5],PL_colors[0], | |
4327 | s, | |
4328 | PL_colors[1], | |
4329 | (strlen(s) > 60 ? "..." : "")); | |
4330 | } ); | |
4331 | ||
4332 | return prog->check_substr; | |
4333 | } | |
4334 | ||
2b69d0c2 | 4335 | void |
864dbfa3 | 4336 | Perl_pregfree(pTHX_ struct regexp *r) |
a687059c | 4337 | { |
5c0ca799 | 4338 | dTHR; |
adac82c7 | 4339 | DEBUG_r(if (!PL_colorset) reginitcolors()); |
7821416a IZ |
4340 | |
4341 | if (!r || (--r->refcnt > 0)) | |
4342 | return; | |
cad2e5aa JH |
4343 | DEBUG_r(PerlIO_printf(Perl_debug_log, |
4344 | "%sFreeing REx:%s `%s%.60s%s%s'\n", | |
4345 | PL_colors[4],PL_colors[5],PL_colors[0], | |
4346 | r->precomp, | |
4347 | PL_colors[1], | |
4348 | (strlen(r->precomp) > 60 ? "..." : ""))); | |
4349 | ||
c277df42 | 4350 | if (r->precomp) |
a0d0e21e | 4351 | Safefree(r->precomp); |
cf93c79d IZ |
4352 | if (RX_MATCH_COPIED(r)) |
4353 | Safefree(r->subbeg); | |
a193d654 GS |
4354 | if (r->substrs) { |
4355 | if (r->anchored_substr) | |
4356 | SvREFCNT_dec(r->anchored_substr); | |
4357 | if (r->float_substr) | |
4358 | SvREFCNT_dec(r->float_substr); | |
2779dcf1 | 4359 | Safefree(r->substrs); |
a193d654 | 4360 | } |
c277df42 IZ |
4361 | if (r->data) { |
4362 | int n = r->data->count; | |
dfad63ad HS |
4363 | AV* new_comppad = NULL; |
4364 | AV* old_comppad; | |
4365 | SV** old_curpad; | |
4366 | ||
c277df42 IZ |
4367 | while (--n >= 0) { |
4368 | switch (r->data->what[n]) { | |
4369 | case 's': | |
4370 | SvREFCNT_dec((SV*)r->data->data[n]); | |
4371 | break; | |
653099ff GS |
4372 | case 'f': |
4373 | Safefree(r->data->data[n]); | |
4374 | break; | |
dfad63ad HS |
4375 | case 'p': |
4376 | new_comppad = (AV*)r->data->data[n]; | |
4377 | break; | |
c277df42 | 4378 | case 'o': |
dfad63ad | 4379 | if (new_comppad == NULL) |
cea2e8a9 | 4380 | Perl_croak(aTHX_ "panic: pregfree comppad"); |
dfad63ad HS |
4381 | old_comppad = PL_comppad; |
4382 | old_curpad = PL_curpad; | |
1e6dc0b6 SB |
4383 | /* Watch out for global destruction's random ordering. */ |
4384 | if (SvTYPE(new_comppad) == SVt_PVAV) { | |
4385 | PL_comppad = new_comppad; | |
4386 | PL_curpad = AvARRAY(new_comppad); | |
4387 | } | |
4388 | else | |
4389 | PL_curpad = NULL; | |
c277df42 | 4390 | op_free((OP_4tree*)r->data->data[n]); |
dfad63ad HS |
4391 | PL_comppad = old_comppad; |
4392 | PL_curpad = old_curpad; | |
4393 | SvREFCNT_dec((SV*)new_comppad); | |
4394 | new_comppad = NULL; | |
c277df42 IZ |
4395 | break; |
4396 | case 'n': | |
4397 | break; | |
4398 | default: | |
4399 | FAIL2("panic: regfree data code '%c'", r->data->what[n]); | |
4400 | } | |
4401 | } | |
4402 | Safefree(r->data->what); | |
4403 | Safefree(r->data); | |
a0d0e21e LW |
4404 | } |
4405 | Safefree(r->startp); | |
4406 | Safefree(r->endp); | |
4407 | Safefree(r); | |
a687059c | 4408 | } |
c277df42 IZ |
4409 | |
4410 | /* | |
4411 | - regnext - dig the "next" pointer out of a node | |
4412 | * | |
4413 | * [Note, when REGALIGN is defined there are two places in regmatch() | |
4414 | * that bypass this code for speed.] | |
4415 | */ | |
4416 | regnode * | |
864dbfa3 | 4417 | Perl_regnext(pTHX_ register regnode *p) |
c277df42 | 4418 | { |
5c0ca799 | 4419 | dTHR; |
c277df42 IZ |
4420 | register I32 offset; |
4421 | ||
3280af22 | 4422 | if (p == &PL_regdummy) |
c277df42 IZ |
4423 | return(NULL); |
4424 | ||
4425 | offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p)); | |
4426 | if (offset == 0) | |
4427 | return(NULL); | |
4428 | ||
c277df42 | 4429 | return(p+offset); |
c277df42 IZ |
4430 | } |
4431 | ||
01f988be | 4432 | STATIC void |
cea2e8a9 | 4433 | S_re_croak2(pTHX_ const char* pat1,const char* pat2,...) |
c277df42 IZ |
4434 | { |
4435 | va_list args; | |
4436 | STRLEN l1 = strlen(pat1); | |
4437 | STRLEN l2 = strlen(pat2); | |
4438 | char buf[512]; | |
06bf62c7 | 4439 | SV *msv; |
c277df42 IZ |
4440 | char *message; |
4441 | ||
4442 | if (l1 > 510) | |
4443 | l1 = 510; | |
4444 | if (l1 + l2 > 510) | |
4445 | l2 = 510 - l1; | |
4446 | Copy(pat1, buf, l1 , char); | |
4447 | Copy(pat2, buf + l1, l2 , char); | |
3b818b81 GS |
4448 | buf[l1 + l2] = '\n'; |
4449 | buf[l1 + l2 + 1] = '\0'; | |
8736538c AS |
4450 | #ifdef I_STDARG |
4451 | /* ANSI variant takes additional second argument */ | |
c277df42 | 4452 | va_start(args, pat2); |
8736538c AS |
4453 | #else |
4454 | va_start(args); | |
4455 | #endif | |
5a844595 | 4456 | msv = vmess(buf, &args); |
c277df42 | 4457 | va_end(args); |
06bf62c7 | 4458 | message = SvPV(msv,l1); |
c277df42 IZ |
4459 | if (l1 > 512) |
4460 | l1 = 512; | |
4461 | Copy(message, buf, l1 , char); | |
4462 | buf[l1] = '\0'; /* Overwrite \n */ | |
cea2e8a9 | 4463 | Perl_croak(aTHX_ "%s", buf); |
c277df42 | 4464 | } |
a0ed51b3 LW |
4465 | |
4466 | /* XXX Here's a total kludge. But we need to re-enter for swash routines. */ | |
4467 | ||
4468 | void | |
864dbfa3 | 4469 | Perl_save_re_context(pTHX) |
c485e607 NIS |
4470 | { |
4471 | dTHR; | |
a0ed51b3 LW |
4472 | SAVEPPTR(PL_bostr); |
4473 | SAVEPPTR(PL_regprecomp); /* uncompiled string. */ | |
4474 | SAVEI32(PL_regnpar); /* () count. */ | |
4475 | SAVEI32(PL_regsize); /* Code size. */ | |
4476 | SAVEI16(PL_regflags); /* are we folding, multilining? */ | |
4477 | SAVEPPTR(PL_reginput); /* String-input pointer. */ | |
4478 | SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */ | |
4479 | SAVEPPTR(PL_regeol); /* End of input, for $ check. */ | |
7766f137 GS |
4480 | SAVEVPTR(PL_regstartp); /* Pointer to startp array. */ |
4481 | SAVEVPTR(PL_regendp); /* Ditto for endp. */ | |
4482 | SAVEVPTR(PL_reglastparen); /* Similarly for lastparen. */ | |
a0ed51b3 | 4483 | SAVEPPTR(PL_regtill); /* How far we are required to go. */ |
e8347627 | 4484 | SAVEI8(PL_regprev); /* char before regbol, \n if none */ |
7766f137 | 4485 | SAVEVPTR(PL_reg_start_tmp); /* from regexec.c */ |
a0ed51b3 LW |
4486 | PL_reg_start_tmp = 0; |
4487 | SAVEFREEPV(PL_reg_start_tmp); | |
4488 | SAVEI32(PL_reg_start_tmpl); /* from regexec.c */ | |
4489 | PL_reg_start_tmpl = 0; | |
7766f137 | 4490 | SAVEVPTR(PL_regdata); |
a0ed51b3 LW |
4491 | SAVEI32(PL_reg_flags); /* from regexec.c */ |
4492 | SAVEI32(PL_reg_eval_set); /* from regexec.c */ | |
4493 | SAVEI32(PL_regnarrate); /* from regexec.c */ | |
7766f137 | 4494 | SAVEVPTR(PL_regprogram); /* from regexec.c */ |
a0ed51b3 | 4495 | SAVEINT(PL_regindent); /* from regexec.c */ |
7766f137 GS |
4496 | SAVEVPTR(PL_regcc); /* from regexec.c */ |
4497 | SAVEVPTR(PL_curcop); | |
4498 | SAVEVPTR(PL_regcomp_rx); /* from regcomp.c */ | |
a0ed51b3 LW |
4499 | SAVEI32(PL_regseen); /* from regcomp.c */ |
4500 | SAVEI32(PL_regsawback); /* Did we see \1, ...? */ | |
4501 | SAVEI32(PL_regnaughty); /* How bad is this pattern? */ | |
7766f137 | 4502 | SAVEVPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */ |
a0ed51b3 LW |
4503 | SAVEPPTR(PL_regxend); /* End of input for compile */ |
4504 | SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */ | |
7766f137 GS |
4505 | SAVEVPTR(PL_reg_call_cc); /* from regexec.c */ |
4506 | SAVEVPTR(PL_reg_re); /* from regexec.c */ | |
54b6e2fa IZ |
4507 | SAVEPPTR(PL_reg_ganch); /* from regexec.c */ |
4508 | SAVESPTR(PL_reg_sv); /* from regexec.c */ | |
7766f137 | 4509 | SAVEVPTR(PL_reg_magic); /* from regexec.c */ |
54b6e2fa | 4510 | SAVEI32(PL_reg_oldpos); /* from regexec.c */ |
7766f137 GS |
4511 | SAVEVPTR(PL_reg_oldcurpm); /* from regexec.c */ |
4512 | SAVEVPTR(PL_reg_curpm); /* from regexec.c */ | |
54b6e2fa IZ |
4513 | #ifdef DEBUGGING |
4514 | SAVEPPTR(PL_reg_starttry); /* from regexec.c */ | |
4515 | #endif | |
a0ed51b3 | 4516 | } |
51371543 GS |
4517 | |
4518 | #ifdef PERL_OBJECT | |
51371543 GS |
4519 | #include "XSUB.h" |
4520 | #undef this | |
4521 | #define this pPerl | |
4522 | #endif | |
4523 | ||
4524 | static void | |
4525 | clear_re(pTHXo_ void *r) | |
4526 | { | |
4527 | ReREFCNT_dec((regexp *)r); | |
4528 | } | |
4529 |