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