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