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