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