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