Commit | Line | Data |
---|---|---|
a0d0e21e LW |
1 | /* regexec.c |
2 | */ | |
3 | ||
4 | /* | |
5 | * "One Ring to rule them all, One Ring to find them..." | |
6 | */ | |
7 | ||
61296642 DM |
8 | /* This file contains functions for executing a regular expression. See |
9 | * also regcomp.c which funnily enough, contains functions for compiling | |
166f8a29 | 10 | * a regular expression. |
e4a054ea DM |
11 | * |
12 | * This file is also copied at build time to ext/re/re_exec.c, where | |
13 | * it's built with -DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT. | |
14 | * This causes the main functions to be compiled under new names and with | |
15 | * debugging support added, which makes "use re 'debug'" work. | |
16 | ||
166f8a29 DM |
17 | */ |
18 | ||
a687059c LW |
19 | /* NOTE: this is derived from Henry Spencer's regexp code, and should not |
20 | * confused with the original package (see point 3 below). Thanks, Henry! | |
21 | */ | |
22 | ||
23 | /* Additional note: this code is very heavily munged from Henry's version | |
24 | * in places. In some spots I've traded clarity for efficiency, so don't | |
25 | * blame Henry for some of the lack of readability. | |
26 | */ | |
27 | ||
e50aee73 AD |
28 | /* The names of the functions have been changed from regcomp and |
29 | * regexec to pregcomp and pregexec in order to avoid conflicts | |
30 | * with the POSIX routines of the same names. | |
31 | */ | |
32 | ||
b9d5759e AD |
33 | #ifdef PERL_EXT_RE_BUILD |
34 | /* need to replace pregcomp et al, so enable that */ | |
35 | # ifndef PERL_IN_XSUB_RE | |
36 | # define PERL_IN_XSUB_RE | |
37 | # endif | |
38 | /* need access to debugger hooks */ | |
cad2e5aa | 39 | # if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING) |
b9d5759e AD |
40 | # define DEBUGGING |
41 | # endif | |
42 | #endif | |
43 | ||
44 | #ifdef PERL_IN_XSUB_RE | |
d06ea78c | 45 | /* We *really* need to overwrite these symbols: */ |
56953603 IZ |
46 | # define Perl_regexec_flags my_regexec |
47 | # define Perl_regdump my_regdump | |
48 | # define Perl_regprop my_regprop | |
cad2e5aa | 49 | # define Perl_re_intuit_start my_re_intuit_start |
d06ea78c GS |
50 | /* *These* symbols are masked to allow static link. */ |
51 | # define Perl_pregexec my_pregexec | |
9041c2e3 | 52 | # define Perl_reginitcolors my_reginitcolors |
490a3f88 | 53 | # define Perl_regclass_swash my_regclass_swash |
c5be433b GS |
54 | |
55 | # define PERL_NO_GET_CONTEXT | |
9041c2e3 | 56 | #endif |
56953603 | 57 | |
a687059c | 58 | /* |
e50aee73 | 59 | * pregcomp and pregexec -- regsub and regerror are not used in perl |
a687059c LW |
60 | * |
61 | * Copyright (c) 1986 by University of Toronto. | |
62 | * Written by Henry Spencer. Not derived from licensed software. | |
63 | * | |
64 | * Permission is granted to anyone to use this software for any | |
65 | * purpose on any computer system, and to redistribute it freely, | |
66 | * subject to the following restrictions: | |
67 | * | |
68 | * 1. The author is not responsible for the consequences of use of | |
69 | * this software, no matter how awful, even if they arise | |
70 | * from defects in it. | |
71 | * | |
72 | * 2. The origin of this software must not be misrepresented, either | |
73 | * by explicit claim or by omission. | |
74 | * | |
75 | * 3. Altered versions must be plainly marked as such, and must not | |
76 | * be misrepresented as being the original software. | |
77 | * | |
78 | **** Alterations to Henry's code are... | |
79 | **** | |
4bb101f2 | 80 | **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, |
b94e2f88 | 81 | **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others |
a687059c | 82 | **** |
9ef589d8 LW |
83 | **** You may distribute under the terms of either the GNU General Public |
84 | **** License or the Artistic License, as specified in the README file. | |
a687059c LW |
85 | * |
86 | * Beware that some of this code is subtly aware of the way operator | |
87 | * precedence is structured in regular expressions. Serious changes in | |
88 | * regular-expression syntax might require a total rethink. | |
89 | */ | |
90 | #include "EXTERN.h" | |
864dbfa3 | 91 | #define PERL_IN_REGEXEC_C |
a687059c | 92 | #include "perl.h" |
0f5d15d6 | 93 | |
a687059c LW |
94 | #include "regcomp.h" |
95 | ||
c277df42 IZ |
96 | #define RF_tainted 1 /* tainted information used? */ |
97 | #define RF_warned 2 /* warned about big count? */ | |
ce862d02 | 98 | #define RF_evaled 4 /* Did an EVAL with setting? */ |
a0ed51b3 LW |
99 | #define RF_utf8 8 /* String contains multibyte chars? */ |
100 | ||
eb160463 | 101 | #define UTF ((PL_reg_flags & RF_utf8) != 0) |
ce862d02 IZ |
102 | |
103 | #define RS_init 1 /* eval environment created */ | |
104 | #define RS_set 2 /* replsv value is set */ | |
c277df42 | 105 | |
a687059c LW |
106 | #ifndef STATIC |
107 | #define STATIC static | |
108 | #endif | |
109 | ||
32fc9b6a | 110 | #define REGINCLASS(prog,p,c) (ANYOF_FLAGS(p) ? reginclass(prog,p,c,0,0) : ANYOF_BITMAP_TEST(p,*(c))) |
7d3e948e | 111 | |
c277df42 IZ |
112 | /* |
113 | * Forwards. | |
114 | */ | |
115 | ||
33b8afdf | 116 | #define CHR_SVLEN(sv) (do_utf8 ? sv_len_utf8(sv) : SvCUR(sv)) |
53c4c00c | 117 | #define CHR_DIST(a,b) (PL_reg_match_utf8 ? utf8_distance(a,b) : a - b) |
a0ed51b3 | 118 | |
52657f30 AL |
119 | #define HOPc(pos,off) ((char *)(PL_reg_match_utf8 \ |
120 | ? reghop3((U8*)pos, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr)) \ | |
121 | : (U8*)(pos + off))) | |
122 | #define HOPBACKc(pos, off) ((char*) \ | |
123 | ((PL_reg_match_utf8) \ | |
124 | ? reghopmaybe3((U8*)pos, -off, ((U8*)(off < 0 ? PL_regeol : PL_bostr))) \ | |
efb30f32 HS |
125 | : (pos - off >= PL_bostr) \ |
126 | ? (U8*)(pos - off) \ | |
52657f30 | 127 | : (U8*)NULL) \ |
efb30f32 | 128 | ) |
efb30f32 | 129 | |
1aa99e6b | 130 | #define reghopmaybe3_c(pos,off,lim) ((char*)reghopmaybe3((U8*)pos, off, (U8*)lim)) |
53c4c00c | 131 | #define HOP3(pos,off,lim) (PL_reg_match_utf8 ? reghop3((U8*)pos, off, (U8*)lim) : (U8*)(pos + off)) |
1aa99e6b | 132 | #define HOP3c(pos,off,lim) ((char*)HOP3(pos,off,lim)) |
1aa99e6b | 133 | |
1a4fad37 AL |
134 | #define LOAD_UTF8_CHARCLASS(class,str) STMT_START { \ |
135 | if (!CAT2(PL_utf8_,class)) { bool ok; ENTER; save_re_context(); ok=CAT2(is_utf8_,class)((const U8*)str); assert(ok); LEAVE; } } STMT_END | |
136 | #define LOAD_UTF8_CHARCLASS_ALNUM() LOAD_UTF8_CHARCLASS(alnum,"a") | |
137 | #define LOAD_UTF8_CHARCLASS_DIGIT() LOAD_UTF8_CHARCLASS(digit,"0") | |
138 | #define LOAD_UTF8_CHARCLASS_SPACE() LOAD_UTF8_CHARCLASS(space," ") | |
139 | #define LOAD_UTF8_CHARCLASS_MARK() LOAD_UTF8_CHARCLASS(mark, "\xcd\x86") | |
51371543 | 140 | |
5f80c4cf | 141 | /* for use after a quantifier and before an EXACT-like node -- japhy */ |
e2d8ce26 JP |
142 | #define JUMPABLE(rn) ( \ |
143 | OP(rn) == OPEN || OP(rn) == CLOSE || OP(rn) == EVAL || \ | |
cca55fe3 JP |
144 | OP(rn) == SUSPEND || OP(rn) == IFMATCH || \ |
145 | OP(rn) == PLUS || OP(rn) == MINMOD || \ | |
146 | (PL_regkind[(U8)OP(rn)] == CURLY && ARG1(rn) > 0) \ | |
e2d8ce26 JP |
147 | ) |
148 | ||
cca55fe3 JP |
149 | #define HAS_TEXT(rn) ( \ |
150 | PL_regkind[(U8)OP(rn)] == EXACT || PL_regkind[(U8)OP(rn)] == REF \ | |
151 | ) | |
e2d8ce26 | 152 | |
a84d97b6 HS |
153 | /* |
154 | Search for mandatory following text node; for lookahead, the text must | |
155 | follow but for lookbehind (rn->flags != 0) we skip to the next step. | |
156 | */ | |
cca55fe3 | 157 | #define FIND_NEXT_IMPT(rn) STMT_START { \ |
e2d8ce26 | 158 | while (JUMPABLE(rn)) \ |
a84d97b6 | 159 | if (OP(rn) == SUSPEND || PL_regkind[(U8)OP(rn)] == CURLY) \ |
e2d8ce26 | 160 | rn = NEXTOPER(NEXTOPER(rn)); \ |
cca55fe3 JP |
161 | else if (OP(rn) == PLUS) \ |
162 | rn = NEXTOPER(rn); \ | |
a84d97b6 HS |
163 | else if (OP(rn) == IFMATCH) \ |
164 | rn = (rn->flags == 0) ? NEXTOPER(NEXTOPER(rn)) : rn + ARG(rn); \ | |
e2d8ce26 | 165 | else rn += NEXT_OFF(rn); \ |
5f80c4cf | 166 | } STMT_END |
74750237 | 167 | |
acfe0abc | 168 | static void restore_pos(pTHX_ void *arg); |
51371543 | 169 | |
76e3520e | 170 | STATIC CHECKPOINT |
cea2e8a9 | 171 | S_regcppush(pTHX_ I32 parenfloor) |
a0d0e21e | 172 | { |
97aff369 | 173 | dVAR; |
a3b680e6 | 174 | const int retval = PL_savestack_ix; |
b1ce53c5 | 175 | #define REGCP_PAREN_ELEMS 4 |
a3b680e6 | 176 | const int paren_elems_to_push = (PL_regsize - parenfloor) * REGCP_PAREN_ELEMS; |
a0d0e21e LW |
177 | int p; |
178 | ||
e49a9654 IH |
179 | if (paren_elems_to_push < 0) |
180 | Perl_croak(aTHX_ "panic: paren_elems_to_push < 0"); | |
181 | ||
a01268b5 | 182 | #define REGCP_OTHER_ELEMS 6 |
4b3c1a47 | 183 | SSGROW(paren_elems_to_push + REGCP_OTHER_ELEMS); |
3280af22 | 184 | for (p = PL_regsize; p > parenfloor; p--) { |
b1ce53c5 | 185 | /* REGCP_PARENS_ELEMS are pushed per pairs of parentheses. */ |
cf93c79d IZ |
186 | SSPUSHINT(PL_regendp[p]); |
187 | SSPUSHINT(PL_regstartp[p]); | |
3280af22 | 188 | SSPUSHPTR(PL_reg_start_tmp[p]); |
a0d0e21e LW |
189 | SSPUSHINT(p); |
190 | } | |
b1ce53c5 | 191 | /* REGCP_OTHER_ELEMS are pushed in any case, parentheses or no. */ |
3280af22 NIS |
192 | SSPUSHINT(PL_regsize); |
193 | SSPUSHINT(*PL_reglastparen); | |
a01268b5 | 194 | SSPUSHINT(*PL_reglastcloseparen); |
3280af22 | 195 | SSPUSHPTR(PL_reginput); |
41123dfd JH |
196 | #define REGCP_FRAME_ELEMS 2 |
197 | /* REGCP_FRAME_ELEMS are part of the REGCP_OTHER_ELEMS and | |
198 | * are needed for the regexp context stack bookkeeping. */ | |
199 | SSPUSHINT(paren_elems_to_push + REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS); | |
b1ce53c5 | 200 | SSPUSHINT(SAVEt_REGCONTEXT); /* Magic cookie. */ |
41123dfd | 201 | |
a0d0e21e LW |
202 | return retval; |
203 | } | |
204 | ||
c277df42 | 205 | /* These are needed since we do not localize EVAL nodes: */ |
a3621e74 | 206 | # define REGCP_SET(cp) DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, \ |
faccc32b | 207 | " Setting an EVAL scope, savestack=%"IVdf"\n", \ |
02db2b7b | 208 | (IV)PL_savestack_ix)); cp = PL_savestack_ix |
c3464db5 | 209 | |
a3621e74 | 210 | # define REGCP_UNWIND(cp) DEBUG_EXECUTE_r(cp != PL_savestack_ix ? \ |
c3464db5 | 211 | PerlIO_printf(Perl_debug_log, \ |
faccc32b | 212 | " Clearing an EVAL scope, savestack=%"IVdf"..%"IVdf"\n", \ |
02db2b7b | 213 | (IV)(cp), (IV)PL_savestack_ix) : 0); regcpblow(cp) |
c277df42 | 214 | |
76e3520e | 215 | STATIC char * |
097eb12c | 216 | S_regcppop(pTHX_ const regexp *rex) |
a0d0e21e | 217 | { |
97aff369 | 218 | dVAR; |
b1ce53c5 | 219 | I32 i; |
a0d0e21e | 220 | char *input; |
b1ce53c5 | 221 | |
a3621e74 YO |
222 | GET_RE_DEBUG_FLAGS_DECL; |
223 | ||
b1ce53c5 | 224 | /* Pop REGCP_OTHER_ELEMS before the parentheses loop starts. */ |
a0d0e21e | 225 | i = SSPOPINT; |
b1ce53c5 JH |
226 | assert(i == SAVEt_REGCONTEXT); /* Check that the magic cookie is there. */ |
227 | i = SSPOPINT; /* Parentheses elements to pop. */ | |
a0d0e21e | 228 | input = (char *) SSPOPPTR; |
a01268b5 | 229 | *PL_reglastcloseparen = SSPOPINT; |
3280af22 NIS |
230 | *PL_reglastparen = SSPOPINT; |
231 | PL_regsize = SSPOPINT; | |
b1ce53c5 JH |
232 | |
233 | /* Now restore the parentheses context. */ | |
41123dfd JH |
234 | for (i -= (REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS); |
235 | i > 0; i -= REGCP_PAREN_ELEMS) { | |
1df70142 | 236 | I32 tmps; |
097eb12c | 237 | U32 paren = (U32)SSPOPINT; |
3280af22 | 238 | PL_reg_start_tmp[paren] = (char *) SSPOPPTR; |
cf93c79d IZ |
239 | PL_regstartp[paren] = SSPOPINT; |
240 | tmps = SSPOPINT; | |
3280af22 NIS |
241 | if (paren <= *PL_reglastparen) |
242 | PL_regendp[paren] = tmps; | |
a3621e74 | 243 | DEBUG_EXECUTE_r( |
c3464db5 | 244 | PerlIO_printf(Perl_debug_log, |
b900a521 | 245 | " restoring \\%"UVuf" to %"IVdf"(%"IVdf")..%"IVdf"%s\n", |
9041c2e3 | 246 | (UV)paren, (IV)PL_regstartp[paren], |
b900a521 | 247 | (IV)(PL_reg_start_tmp[paren] - PL_bostr), |
9041c2e3 | 248 | (IV)PL_regendp[paren], |
3280af22 | 249 | (paren > *PL_reglastparen ? "(no)" : "")); |
c277df42 | 250 | ); |
a0d0e21e | 251 | } |
a3621e74 | 252 | DEBUG_EXECUTE_r( |
4f639d21 | 253 | if ((I32)(*PL_reglastparen + 1) <= rex->nparens) { |
c3464db5 | 254 | PerlIO_printf(Perl_debug_log, |
faccc32b | 255 | " restoring \\%"IVdf"..\\%"IVdf" to undef\n", |
4f639d21 | 256 | (IV)(*PL_reglastparen + 1), (IV)rex->nparens); |
c277df42 IZ |
257 | } |
258 | ); | |
daf18116 | 259 | #if 1 |
dafc8851 JH |
260 | /* It would seem that the similar code in regtry() |
261 | * already takes care of this, and in fact it is in | |
262 | * a better location to since this code can #if 0-ed out | |
263 | * but the code in regtry() is needed or otherwise tests | |
264 | * requiring null fields (pat.t#187 and split.t#{13,14} | |
daf18116 JH |
265 | * (as of patchlevel 7877) will fail. Then again, |
266 | * this code seems to be necessary or otherwise | |
267 | * building DynaLoader will fail: | |
268 | * "Error: '*' not in typemap in DynaLoader.xs, line 164" | |
269 | * --jhi */ | |
097eb12c AL |
270 | for (i = *PL_reglastparen + 1; i <= rex->nparens; i++) { |
271 | if (i > PL_regsize) | |
272 | PL_regstartp[i] = -1; | |
273 | PL_regendp[i] = -1; | |
a0d0e21e | 274 | } |
dafc8851 | 275 | #endif |
a0d0e21e LW |
276 | return input; |
277 | } | |
278 | ||
02db2b7b | 279 | #define regcpblow(cp) LEAVE_SCOPE(cp) /* Ignores regcppush()ed data. */ |
a0d0e21e | 280 | |
95b24440 | 281 | #define TRYPAREN(paren, n, input, where) { \ |
29d1e993 HS |
282 | if (paren) { \ |
283 | if (n) { \ | |
284 | PL_regstartp[paren] = HOPc(input, -1) - PL_bostr; \ | |
285 | PL_regendp[paren] = input - PL_bostr; \ | |
286 | } \ | |
287 | else \ | |
288 | PL_regendp[paren] = -1; \ | |
289 | } \ | |
95b24440 DM |
290 | REGMATCH(next, where); \ |
291 | if (result) \ | |
29d1e993 HS |
292 | sayYES; \ |
293 | if (paren && n) \ | |
294 | PL_regendp[paren] = -1; \ | |
295 | } | |
296 | ||
297 | ||
a687059c | 298 | /* |
e50aee73 | 299 | * pregexec and friends |
a687059c LW |
300 | */ |
301 | ||
302 | /* | |
c277df42 | 303 | - pregexec - match a regexp against a string |
a687059c | 304 | */ |
c277df42 | 305 | I32 |
864dbfa3 | 306 | Perl_pregexec(pTHX_ register regexp *prog, char *stringarg, register char *strend, |
c3464db5 | 307 | char *strbeg, I32 minend, SV *screamer, U32 nosave) |
c277df42 IZ |
308 | /* strend: pointer to null at end of string */ |
309 | /* strbeg: real beginning of string */ | |
310 | /* minend: end of match must be >=minend after stringarg. */ | |
311 | /* nosave: For optimizations. */ | |
312 | { | |
313 | return | |
9041c2e3 | 314 | regexec_flags(prog, stringarg, strend, strbeg, minend, screamer, NULL, |
c277df42 IZ |
315 | nosave ? 0 : REXEC_COPY_STR); |
316 | } | |
0f5d15d6 | 317 | |
22e551b9 | 318 | |
9041c2e3 | 319 | /* |
cad2e5aa JH |
320 | * Need to implement the following flags for reg_anch: |
321 | * | |
322 | * USE_INTUIT_NOML - Useful to call re_intuit_start() first | |
323 | * USE_INTUIT_ML | |
324 | * INTUIT_AUTORITATIVE_NOML - Can trust a positive answer | |
325 | * INTUIT_AUTORITATIVE_ML | |
326 | * INTUIT_ONCE_NOML - Intuit can match in one location only. | |
327 | * INTUIT_ONCE_ML | |
328 | * | |
329 | * Another flag for this function: SECOND_TIME (so that float substrs | |
330 | * with giant delta may be not rechecked). | |
331 | */ | |
332 | ||
333 | /* Assumptions: if ANCH_GPOS, then strpos is anchored. XXXX Check GPOS logic */ | |
334 | ||
3f7c398e | 335 | /* If SCREAM, then SvPVX_const(sv) should be compatible with strpos and strend. |
cad2e5aa JH |
336 | Otherwise, only SvCUR(sv) is used to get strbeg. */ |
337 | ||
338 | /* XXXX We assume that strpos is strbeg unless sv. */ | |
339 | ||
6eb5f6b9 JH |
340 | /* XXXX Some places assume that there is a fixed substring. |
341 | An update may be needed if optimizer marks as "INTUITable" | |
342 | RExen without fixed substrings. Similarly, it is assumed that | |
343 | lengths of all the strings are no more than minlen, thus they | |
344 | cannot come from lookahead. | |
345 | (Or minlen should take into account lookahead.) */ | |
346 | ||
2c2d71f5 JH |
347 | /* A failure to find a constant substring means that there is no need to make |
348 | an expensive call to REx engine, thus we celebrate a failure. Similarly, | |
349 | finding a substring too deep into the string means that less calls to | |
30944b6d IZ |
350 | regtry() should be needed. |
351 | ||
352 | REx compiler's optimizer found 4 possible hints: | |
353 | a) Anchored substring; | |
354 | b) Fixed substring; | |
355 | c) Whether we are anchored (beginning-of-line or \G); | |
356 | d) First node (of those at offset 0) which may distingush positions; | |
6eb5f6b9 | 357 | We use a)b)d) and multiline-part of c), and try to find a position in the |
30944b6d IZ |
358 | string which does not contradict any of them. |
359 | */ | |
2c2d71f5 | 360 | |
6eb5f6b9 JH |
361 | /* Most of decisions we do here should have been done at compile time. |
362 | The nodes of the REx which we used for the search should have been | |
363 | deleted from the finite automaton. */ | |
364 | ||
cad2e5aa JH |
365 | char * |
366 | Perl_re_intuit_start(pTHX_ regexp *prog, SV *sv, char *strpos, | |
367 | char *strend, U32 flags, re_scream_pos_data *data) | |
368 | { | |
97aff369 | 369 | dVAR; |
b7953727 | 370 | register I32 start_shift = 0; |
cad2e5aa | 371 | /* Should be nonnegative! */ |
b7953727 | 372 | register I32 end_shift = 0; |
2c2d71f5 JH |
373 | register char *s; |
374 | register SV *check; | |
a1933d95 | 375 | char *strbeg; |
cad2e5aa | 376 | char *t; |
a3b680e6 | 377 | const int do_utf8 = sv ? SvUTF8(sv) : 0; /* if no sv we have to assume bytes */ |
cad2e5aa | 378 | I32 ml_anch; |
bd61b366 SS |
379 | register char *other_last = NULL; /* other substr checked before this */ |
380 | char *check_at = NULL; /* check substr found at this pos */ | |
1df70142 | 381 | const I32 multiline = prog->reganch & PMf_MULTILINE; |
30944b6d | 382 | #ifdef DEBUGGING |
890ce7af AL |
383 | const char * const i_strpos = strpos; |
384 | SV * const dsv = PERL_DEBUG_PAD_ZERO(0); | |
30944b6d | 385 | #endif |
a3621e74 YO |
386 | |
387 | GET_RE_DEBUG_FLAGS_DECL; | |
388 | ||
a30b2f1f | 389 | RX_MATCH_UTF8_set(prog,do_utf8); |
cad2e5aa | 390 | |
b8d68ded | 391 | if (prog->reganch & ROPT_UTF8) { |
a3621e74 | 392 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
b8d68ded JH |
393 | "UTF-8 regex...\n")); |
394 | PL_reg_flags |= RF_utf8; | |
395 | } | |
396 | ||
a3621e74 | 397 | DEBUG_EXECUTE_r({ |
1df70142 | 398 | const char *s = PL_reg_match_utf8 ? |
c728cb41 JH |
399 | sv_uni_display(dsv, sv, 60, UNI_DISPLAY_REGEX) : |
400 | strpos; | |
1df70142 | 401 | const int len = PL_reg_match_utf8 ? |
b8d68ded | 402 | strlen(s) : strend - strpos; |
2a782b5b JH |
403 | if (!PL_colorset) |
404 | reginitcolors(); | |
b8d68ded | 405 | if (PL_reg_match_utf8) |
a3621e74 | 406 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
b8d68ded | 407 | "UTF-8 target...\n")); |
2a782b5b | 408 | PerlIO_printf(Perl_debug_log, |
a0288114 | 409 | "%sGuessing start of match, REx%s \"%s%.60s%s%s\" against \"%s%.*s%s%s\"...\n", |
e4584336 | 410 | PL_colors[4], PL_colors[5], PL_colors[0], |
2a782b5b JH |
411 | prog->precomp, |
412 | PL_colors[1], | |
413 | (strlen(prog->precomp) > 60 ? "..." : ""), | |
414 | PL_colors[0], | |
415 | (int)(len > 60 ? 60 : len), | |
416 | s, PL_colors[1], | |
417 | (len > 60 ? "..." : "") | |
418 | ); | |
419 | }); | |
cad2e5aa | 420 | |
c344f387 JH |
421 | /* CHR_DIST() would be more correct here but it makes things slow. */ |
422 | if (prog->minlen > strend - strpos) { | |
a3621e74 | 423 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
a72c7584 | 424 | "String too short... [re_intuit_start]\n")); |
cad2e5aa | 425 | goto fail; |
2c2d71f5 | 426 | } |
a1933d95 | 427 | strbeg = (sv && SvPOK(sv)) ? strend - SvCUR(sv) : strpos; |
1aa99e6b | 428 | PL_regeol = strend; |
33b8afdf JH |
429 | if (do_utf8) { |
430 | if (!prog->check_utf8 && prog->check_substr) | |
431 | to_utf8_substr(prog); | |
432 | check = prog->check_utf8; | |
433 | } else { | |
434 | if (!prog->check_substr && prog->check_utf8) | |
435 | to_byte_substr(prog); | |
436 | check = prog->check_substr; | |
437 | } | |
438 | if (check == &PL_sv_undef) { | |
a3621e74 | 439 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
33b8afdf JH |
440 | "Non-utf string cannot match utf check string\n")); |
441 | goto fail; | |
442 | } | |
2c2d71f5 | 443 | if (prog->reganch & ROPT_ANCH) { /* Match at beg-of-str or after \n */ |
cad2e5aa JH |
444 | ml_anch = !( (prog->reganch & ROPT_ANCH_SINGLE) |
445 | || ( (prog->reganch & ROPT_ANCH_BOL) | |
7fba1cd6 | 446 | && !multiline ) ); /* Check after \n? */ |
cad2e5aa | 447 | |
7e25d62c JH |
448 | if (!ml_anch) { |
449 | if ( !(prog->reganch & (ROPT_ANCH_GPOS /* Checked by the caller */ | |
450 | | ROPT_IMPLICIT)) /* not a real BOL */ | |
3f7c398e | 451 | /* SvCUR is not set on references: SvRV and SvPVX_const overlap */ |
7e25d62c JH |
452 | && sv && !SvROK(sv) |
453 | && (strpos != strbeg)) { | |
a3621e74 | 454 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not at start...\n")); |
7e25d62c JH |
455 | goto fail; |
456 | } | |
457 | if (prog->check_offset_min == prog->check_offset_max && | |
cce850e4 | 458 | !(prog->reganch & ROPT_CANY_SEEN)) { |
2c2d71f5 | 459 | /* Substring at constant offset from beg-of-str... */ |
cad2e5aa JH |
460 | I32 slen; |
461 | ||
1aa99e6b | 462 | s = HOP3c(strpos, prog->check_offset_min, strend); |
653099ff GS |
463 | if (SvTAIL(check)) { |
464 | slen = SvCUR(check); /* >= 1 */ | |
cad2e5aa | 465 | |
9041c2e3 | 466 | if ( strend - s > slen || strend - s < slen - 1 |
2c2d71f5 | 467 | || (strend - s == slen && strend[-1] != '\n')) { |
a3621e74 | 468 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String too long...\n")); |
2c2d71f5 | 469 | goto fail_finish; |
cad2e5aa JH |
470 | } |
471 | /* Now should match s[0..slen-2] */ | |
472 | slen--; | |
3f7c398e | 473 | if (slen && (*SvPVX_const(check) != *s |
cad2e5aa | 474 | || (slen > 1 |
3f7c398e | 475 | && memNE(SvPVX_const(check), s, slen)))) { |
2c2d71f5 | 476 | report_neq: |
a3621e74 | 477 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String not equal...\n")); |
2c2d71f5 JH |
478 | goto fail_finish; |
479 | } | |
cad2e5aa | 480 | } |
3f7c398e | 481 | else if (*SvPVX_const(check) != *s |
653099ff | 482 | || ((slen = SvCUR(check)) > 1 |
3f7c398e | 483 | && memNE(SvPVX_const(check), s, slen))) |
2c2d71f5 | 484 | goto report_neq; |
c315bfe8 | 485 | check_at = s; |
2c2d71f5 | 486 | goto success_at_start; |
7e25d62c | 487 | } |
cad2e5aa | 488 | } |
2c2d71f5 | 489 | /* Match is anchored, but substr is not anchored wrt beg-of-str. */ |
cad2e5aa | 490 | s = strpos; |
2c2d71f5 | 491 | start_shift = prog->check_offset_min; /* okay to underestimate on CC */ |
2c2d71f5 | 492 | end_shift = prog->minlen - start_shift - |
653099ff | 493 | CHR_SVLEN(check) + (SvTAIL(check) != 0); |
2c2d71f5 | 494 | if (!ml_anch) { |
a3b680e6 | 495 | const I32 end = prog->check_offset_max + CHR_SVLEN(check) |
653099ff | 496 | - (SvTAIL(check) != 0); |
a3b680e6 | 497 | const I32 eshift = CHR_DIST((U8*)strend, (U8*)s) - end; |
2c2d71f5 JH |
498 | |
499 | if (end_shift < eshift) | |
500 | end_shift = eshift; | |
501 | } | |
cad2e5aa | 502 | } |
2c2d71f5 | 503 | else { /* Can match at random position */ |
cad2e5aa JH |
504 | ml_anch = 0; |
505 | s = strpos; | |
2c2d71f5 JH |
506 | start_shift = prog->check_offset_min; /* okay to underestimate on CC */ |
507 | /* Should be nonnegative! */ | |
508 | end_shift = prog->minlen - start_shift - | |
653099ff | 509 | CHR_SVLEN(check) + (SvTAIL(check) != 0); |
cad2e5aa JH |
510 | } |
511 | ||
2c2d71f5 | 512 | #ifdef DEBUGGING /* 7/99: reports of failure (with the older version) */ |
0033605d | 513 | if (end_shift < 0) |
6bbae5e6 | 514 | Perl_croak(aTHX_ "panic: end_shift"); |
2c2d71f5 JH |
515 | #endif |
516 | ||
2c2d71f5 JH |
517 | restart: |
518 | /* Find a possible match in the region s..strend by looking for | |
519 | the "check" substring in the region corrected by start/end_shift. */ | |
cad2e5aa | 520 | if (flags & REXEC_SCREAM) { |
cad2e5aa | 521 | I32 p = -1; /* Internal iterator of scream. */ |
a3b680e6 | 522 | I32 * const pp = data ? data->scream_pos : &p; |
cad2e5aa | 523 | |
2c2d71f5 JH |
524 | if (PL_screamfirst[BmRARE(check)] >= 0 |
525 | || ( BmRARE(check) == '\n' | |
526 | && (BmPREVIOUS(check) == SvCUR(check) - 1) | |
527 | && SvTAIL(check) )) | |
9041c2e3 | 528 | s = screaminstr(sv, check, |
2c2d71f5 | 529 | start_shift + (s - strbeg), end_shift, pp, 0); |
cad2e5aa | 530 | else |
2c2d71f5 | 531 | goto fail_finish; |
4addbd3b HS |
532 | /* we may be pointing at the wrong string */ |
533 | if (s && RX_MATCH_COPIED(prog)) | |
3f7c398e | 534 | s = strbeg + (s - SvPVX_const(sv)); |
cad2e5aa JH |
535 | if (data) |
536 | *data->scream_olds = s; | |
537 | } | |
f33976b4 | 538 | else if (prog->reganch & ROPT_CANY_SEEN) |
3baa4c62 JH |
539 | s = fbm_instr((U8*)(s + start_shift), |
540 | (U8*)(strend - end_shift), | |
7fba1cd6 | 541 | check, multiline ? FBMrf_MULTILINE : 0); |
cad2e5aa | 542 | else |
1aa99e6b IH |
543 | s = fbm_instr(HOP3(s, start_shift, strend), |
544 | HOP3(strend, -end_shift, strbeg), | |
7fba1cd6 | 545 | check, multiline ? FBMrf_MULTILINE : 0); |
cad2e5aa JH |
546 | |
547 | /* Update the count-of-usability, remove useless subpatterns, | |
548 | unshift s. */ | |
2c2d71f5 | 549 | |
a0288114 | 550 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s %s substr \"%s%.*s%s\"%s%s", |
2c2d71f5 | 551 | (s ? "Found" : "Did not find"), |
33b8afdf | 552 | (check == (do_utf8 ? prog->anchored_utf8 : prog->anchored_substr) ? "anchored" : "floating"), |
2c2d71f5 | 553 | PL_colors[0], |
7b0972df | 554 | (int)(SvCUR(check) - (SvTAIL(check)!=0)), |
3f7c398e | 555 | SvPVX_const(check), |
2c2d71f5 JH |
556 | PL_colors[1], (SvTAIL(check) ? "$" : ""), |
557 | (s ? " at offset " : "...\n") ) ); | |
558 | ||
559 | if (!s) | |
560 | goto fail_finish; | |
561 | ||
6eb5f6b9 JH |
562 | check_at = s; |
563 | ||
2c2d71f5 | 564 | /* Finish the diagnostic message */ |
a3621e74 | 565 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%ld...\n", (long)(s - i_strpos)) ); |
2c2d71f5 JH |
566 | |
567 | /* Got a candidate. Check MBOL anchoring, and the *other* substr. | |
568 | Start with the other substr. | |
569 | XXXX no SCREAM optimization yet - and a very coarse implementation | |
a0288114 | 570 | XXXX /ttx+/ results in anchored="ttx", floating="x". floating will |
2c2d71f5 JH |
571 | *always* match. Probably should be marked during compile... |
572 | Probably it is right to do no SCREAM here... | |
573 | */ | |
574 | ||
33b8afdf | 575 | if (do_utf8 ? (prog->float_utf8 && prog->anchored_utf8) : (prog->float_substr && prog->anchored_substr)) { |
30944b6d | 576 | /* Take into account the "other" substring. */ |
2c2d71f5 JH |
577 | /* XXXX May be hopelessly wrong for UTF... */ |
578 | if (!other_last) | |
6eb5f6b9 | 579 | other_last = strpos; |
33b8afdf | 580 | if (check == (do_utf8 ? prog->float_utf8 : prog->float_substr)) { |
30944b6d IZ |
581 | do_other_anchored: |
582 | { | |
890ce7af AL |
583 | char * const last = HOP3c(s, -start_shift, strbeg); |
584 | char *last1, *last2; | |
2c2d71f5 | 585 | char *s1 = s; |
33b8afdf | 586 | SV* must; |
2c2d71f5 | 587 | |
2c2d71f5 JH |
588 | t = s - prog->check_offset_max; |
589 | if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */ | |
1d86a7f9 | 590 | && (!do_utf8 |
1aa99e6b | 591 | || ((t = reghopmaybe3_c(s, -(prog->check_offset_max), strpos)) |
2c2d71f5 | 592 | && t > strpos))) |
30944b6d | 593 | /* EMPTY */; |
2c2d71f5 JH |
594 | else |
595 | t = strpos; | |
1aa99e6b | 596 | t = HOP3c(t, prog->anchored_offset, strend); |
6eb5f6b9 JH |
597 | if (t < other_last) /* These positions already checked */ |
598 | t = other_last; | |
1aa99e6b | 599 | last2 = last1 = HOP3c(strend, -prog->minlen, strbeg); |
2c2d71f5 JH |
600 | if (last < last1) |
601 | last1 = last; | |
602 | /* XXXX It is not documented what units *_offsets are in. Assume bytes. */ | |
603 | /* On end-of-str: see comment below. */ | |
33b8afdf JH |
604 | must = do_utf8 ? prog->anchored_utf8 : prog->anchored_substr; |
605 | if (must == &PL_sv_undef) { | |
606 | s = (char*)NULL; | |
a3621e74 | 607 | DEBUG_EXECUTE_r(must = prog->anchored_utf8); /* for debug */ |
33b8afdf JH |
608 | } |
609 | else | |
610 | s = fbm_instr( | |
611 | (unsigned char*)t, | |
612 | HOP3(HOP3(last1, prog->anchored_offset, strend) | |
613 | + SvCUR(must), -(SvTAIL(must)!=0), strbeg), | |
614 | must, | |
7fba1cd6 | 615 | multiline ? FBMrf_MULTILINE : 0 |
33b8afdf | 616 | ); |
a3621e74 | 617 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
a0288114 | 618 | "%s anchored substr \"%s%.*s%s\"%s", |
2c2d71f5 JH |
619 | (s ? "Found" : "Contradicts"), |
620 | PL_colors[0], | |
33b8afdf JH |
621 | (int)(SvCUR(must) |
622 | - (SvTAIL(must)!=0)), | |
3f7c398e | 623 | SvPVX_const(must), |
33b8afdf | 624 | PL_colors[1], (SvTAIL(must) ? "$" : ""))); |
2c2d71f5 JH |
625 | if (!s) { |
626 | if (last1 >= last2) { | |
a3621e74 | 627 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
2c2d71f5 JH |
628 | ", giving up...\n")); |
629 | goto fail_finish; | |
630 | } | |
a3621e74 | 631 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
2c2d71f5 | 632 | ", trying floating at offset %ld...\n", |
1aa99e6b IH |
633 | (long)(HOP3c(s1, 1, strend) - i_strpos))); |
634 | other_last = HOP3c(last1, prog->anchored_offset+1, strend); | |
635 | s = HOP3c(last, 1, strend); | |
2c2d71f5 JH |
636 | goto restart; |
637 | } | |
638 | else { | |
a3621e74 | 639 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n", |
30944b6d | 640 | (long)(s - i_strpos))); |
1aa99e6b IH |
641 | t = HOP3c(s, -prog->anchored_offset, strbeg); |
642 | other_last = HOP3c(s, 1, strend); | |
30944b6d | 643 | s = s1; |
2c2d71f5 JH |
644 | if (t == strpos) |
645 | goto try_at_start; | |
2c2d71f5 JH |
646 | goto try_at_offset; |
647 | } | |
30944b6d | 648 | } |
2c2d71f5 JH |
649 | } |
650 | else { /* Take into account the floating substring. */ | |
33b8afdf JH |
651 | char *last, *last1; |
652 | char *s1 = s; | |
653 | SV* must; | |
654 | ||
655 | t = HOP3c(s, -start_shift, strbeg); | |
656 | last1 = last = | |
657 | HOP3c(strend, -prog->minlen + prog->float_min_offset, strbeg); | |
658 | if (CHR_DIST((U8*)last, (U8*)t) > prog->float_max_offset) | |
659 | last = HOP3c(t, prog->float_max_offset, strend); | |
660 | s = HOP3c(t, prog->float_min_offset, strend); | |
661 | if (s < other_last) | |
662 | s = other_last; | |
2c2d71f5 | 663 | /* XXXX It is not documented what units *_offsets are in. Assume bytes. */ |
33b8afdf JH |
664 | must = do_utf8 ? prog->float_utf8 : prog->float_substr; |
665 | /* fbm_instr() takes into account exact value of end-of-str | |
666 | if the check is SvTAIL(ed). Since false positives are OK, | |
667 | and end-of-str is not later than strend we are OK. */ | |
668 | if (must == &PL_sv_undef) { | |
669 | s = (char*)NULL; | |
a3621e74 | 670 | DEBUG_EXECUTE_r(must = prog->float_utf8); /* for debug message */ |
33b8afdf JH |
671 | } |
672 | else | |
2c2d71f5 | 673 | s = fbm_instr((unsigned char*)s, |
33b8afdf JH |
674 | (unsigned char*)last + SvCUR(must) |
675 | - (SvTAIL(must)!=0), | |
7fba1cd6 | 676 | must, multiline ? FBMrf_MULTILINE : 0); |
a0288114 | 677 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s floating substr \"%s%.*s%s\"%s", |
33b8afdf JH |
678 | (s ? "Found" : "Contradicts"), |
679 | PL_colors[0], | |
680 | (int)(SvCUR(must) - (SvTAIL(must)!=0)), | |
3f7c398e | 681 | SvPVX_const(must), |
33b8afdf JH |
682 | PL_colors[1], (SvTAIL(must) ? "$" : ""))); |
683 | if (!s) { | |
684 | if (last1 == last) { | |
a3621e74 | 685 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
33b8afdf JH |
686 | ", giving up...\n")); |
687 | goto fail_finish; | |
2c2d71f5 | 688 | } |
a3621e74 | 689 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
33b8afdf JH |
690 | ", trying anchored starting at offset %ld...\n", |
691 | (long)(s1 + 1 - i_strpos))); | |
692 | other_last = last; | |
693 | s = HOP3c(t, 1, strend); | |
694 | goto restart; | |
695 | } | |
696 | else { | |
a3621e74 | 697 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n", |
33b8afdf JH |
698 | (long)(s - i_strpos))); |
699 | other_last = s; /* Fix this later. --Hugo */ | |
700 | s = s1; | |
701 | if (t == strpos) | |
702 | goto try_at_start; | |
703 | goto try_at_offset; | |
704 | } | |
2c2d71f5 | 705 | } |
cad2e5aa | 706 | } |
2c2d71f5 JH |
707 | |
708 | t = s - prog->check_offset_max; | |
2c2d71f5 | 709 | if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */ |
1d86a7f9 | 710 | && (!do_utf8 |
1aa99e6b IH |
711 | || ((t = reghopmaybe3_c(s, -prog->check_offset_max, strpos)) |
712 | && t > strpos))) { | |
2c2d71f5 JH |
713 | /* Fixed substring is found far enough so that the match |
714 | cannot start at strpos. */ | |
715 | try_at_offset: | |
cad2e5aa | 716 | if (ml_anch && t[-1] != '\n') { |
30944b6d IZ |
717 | /* Eventually fbm_*() should handle this, but often |
718 | anchored_offset is not 0, so this check will not be wasted. */ | |
719 | /* XXXX In the code below we prefer to look for "^" even in | |
720 | presence of anchored substrings. And we search even | |
721 | beyond the found float position. These pessimizations | |
722 | are historical artefacts only. */ | |
723 | find_anchor: | |
2c2d71f5 | 724 | while (t < strend - prog->minlen) { |
cad2e5aa | 725 | if (*t == '\n') { |
4ee3650e | 726 | if (t < check_at - prog->check_offset_min) { |
33b8afdf | 727 | if (do_utf8 ? prog->anchored_utf8 : prog->anchored_substr) { |
4ee3650e GS |
728 | /* Since we moved from the found position, |
729 | we definitely contradict the found anchored | |
30944b6d IZ |
730 | substr. Due to the above check we do not |
731 | contradict "check" substr. | |
732 | Thus we can arrive here only if check substr | |
733 | is float. Redo checking for "other"=="fixed". | |
734 | */ | |
9041c2e3 | 735 | strpos = t + 1; |
a3621e74 | 736 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld, rescanning for anchored from offset %ld...\n", |
e4584336 | 737 | PL_colors[0], PL_colors[1], (long)(strpos - i_strpos), (long)(strpos - i_strpos + prog->anchored_offset))); |
30944b6d IZ |
738 | goto do_other_anchored; |
739 | } | |
4ee3650e GS |
740 | /* We don't contradict the found floating substring. */ |
741 | /* XXXX Why not check for STCLASS? */ | |
cad2e5aa | 742 | s = t + 1; |
a3621e74 | 743 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld...\n", |
e4584336 | 744 | PL_colors[0], PL_colors[1], (long)(s - i_strpos))); |
cad2e5aa JH |
745 | goto set_useful; |
746 | } | |
4ee3650e GS |
747 | /* Position contradicts check-string */ |
748 | /* XXXX probably better to look for check-string | |
749 | than for "\n", so one should lower the limit for t? */ | |
a3621e74 | 750 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m, restarting lookup for check-string at offset %ld...\n", |
e4584336 | 751 | PL_colors[0], PL_colors[1], (long)(t + 1 - i_strpos))); |
0e41cd87 | 752 | other_last = strpos = s = t + 1; |
cad2e5aa JH |
753 | goto restart; |
754 | } | |
755 | t++; | |
756 | } | |
a3621e74 | 757 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Did not find /%s^%s/m...\n", |
e4584336 | 758 | PL_colors[0], PL_colors[1])); |
2c2d71f5 | 759 | goto fail_finish; |
cad2e5aa | 760 | } |
f5952150 | 761 | else { |
a3621e74 | 762 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Starting position does not contradict /%s^%s/m...\n", |
e4584336 | 763 | PL_colors[0], PL_colors[1])); |
f5952150 | 764 | } |
cad2e5aa JH |
765 | s = t; |
766 | set_useful: | |
33b8afdf | 767 | ++BmUSEFUL(do_utf8 ? prog->check_utf8 : prog->check_substr); /* hooray/5 */ |
cad2e5aa JH |
768 | } |
769 | else { | |
f5952150 | 770 | /* The found string does not prohibit matching at strpos, |
2c2d71f5 | 771 | - no optimization of calling REx engine can be performed, |
f5952150 GS |
772 | unless it was an MBOL and we are not after MBOL, |
773 | or a future STCLASS check will fail this. */ | |
2c2d71f5 JH |
774 | try_at_start: |
775 | /* Even in this situation we may use MBOL flag if strpos is offset | |
776 | wrt the start of the string. */ | |
05b4157f | 777 | if (ml_anch && sv && !SvROK(sv) /* See prev comment on SvROK */ |
a1933d95 | 778 | && (strpos != strbeg) && strpos[-1] != '\n' |
d506a20d IZ |
779 | /* May be due to an implicit anchor of m{.*foo} */ |
780 | && !(prog->reganch & ROPT_IMPLICIT)) | |
781 | { | |
cad2e5aa JH |
782 | t = strpos; |
783 | goto find_anchor; | |
784 | } | |
a3621e74 | 785 | DEBUG_EXECUTE_r( if (ml_anch) |
f5952150 | 786 | PerlIO_printf(Perl_debug_log, "Position at offset %ld does not contradict /%s^%s/m...\n", |
e4584336 | 787 | (long)(strpos - i_strpos), PL_colors[0], PL_colors[1]); |
30944b6d | 788 | ); |
2c2d71f5 | 789 | success_at_start: |
30944b6d | 790 | if (!(prog->reganch & ROPT_NAUGHTY) /* XXXX If strpos moved? */ |
33b8afdf JH |
791 | && (do_utf8 ? ( |
792 | prog->check_utf8 /* Could be deleted already */ | |
793 | && --BmUSEFUL(prog->check_utf8) < 0 | |
794 | && (prog->check_utf8 == prog->float_utf8) | |
795 | ) : ( | |
796 | prog->check_substr /* Could be deleted already */ | |
797 | && --BmUSEFUL(prog->check_substr) < 0 | |
798 | && (prog->check_substr == prog->float_substr) | |
799 | ))) | |
66e933ab | 800 | { |
cad2e5aa | 801 | /* If flags & SOMETHING - do not do it many times on the same match */ |
a3621e74 | 802 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "... Disabling check substring...\n")); |
33b8afdf JH |
803 | SvREFCNT_dec(do_utf8 ? prog->check_utf8 : prog->check_substr); |
804 | if (do_utf8 ? prog->check_substr : prog->check_utf8) | |
805 | SvREFCNT_dec(do_utf8 ? prog->check_substr : prog->check_utf8); | |
a0714e2c SS |
806 | prog->check_substr = prog->check_utf8 = NULL; /* disable */ |
807 | prog->float_substr = prog->float_utf8 = NULL; /* clear */ | |
808 | check = NULL; /* abort */ | |
cad2e5aa | 809 | s = strpos; |
3cf5c195 IZ |
810 | /* XXXX This is a remnant of the old implementation. It |
811 | looks wasteful, since now INTUIT can use many | |
6eb5f6b9 | 812 | other heuristics. */ |
cad2e5aa JH |
813 | prog->reganch &= ~RE_USE_INTUIT; |
814 | } | |
815 | else | |
816 | s = strpos; | |
817 | } | |
818 | ||
6eb5f6b9 JH |
819 | /* Last resort... */ |
820 | /* XXXX BmUSEFUL already changed, maybe multiple change is meaningful... */ | |
821 | if (prog->regstclass) { | |
822 | /* minlen == 0 is possible if regstclass is \b or \B, | |
823 | and the fixed substr is ''$. | |
824 | Since minlen is already taken into account, s+1 is before strend; | |
825 | accidentally, minlen >= 1 guaranties no false positives at s + 1 | |
826 | even for \b or \B. But (minlen? 1 : 0) below assumes that | |
827 | regstclass does not come from lookahead... */ | |
828 | /* If regstclass takes bytelength more than 1: If charlength==1, OK. | |
829 | This leaves EXACTF only, which is dealt with in find_byclass(). */ | |
890ce7af | 830 | const U8* const str = (U8*)STRING(prog->regstclass); |
06b5626a | 831 | const int cl_l = (PL_regkind[(U8)OP(prog->regstclass)] == EXACT |
1aa99e6b | 832 | ? CHR_DIST(str+STR_LEN(prog->regstclass), str) |
66e933ab | 833 | : 1); |
a3b680e6 | 834 | const char * const endpos = (prog->anchored_substr || prog->anchored_utf8 || ml_anch) |
1aa99e6b | 835 | ? HOP3c(s, (prog->minlen ? cl_l : 0), strend) |
33b8afdf | 836 | : (prog->float_substr || prog->float_utf8 |
1aa99e6b IH |
837 | ? HOP3c(HOP3c(check_at, -start_shift, strbeg), |
838 | cl_l, strend) | |
839 | : strend); | |
6eb5f6b9 JH |
840 | |
841 | t = s; | |
3b0527fe | 842 | s = find_byclass(prog, prog->regstclass, s, endpos, NULL); |
6eb5f6b9 JH |
843 | if (!s) { |
844 | #ifdef DEBUGGING | |
cbbf8932 | 845 | const char *what = NULL; |
6eb5f6b9 JH |
846 | #endif |
847 | if (endpos == strend) { | |
a3621e74 | 848 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
6eb5f6b9 JH |
849 | "Could not match STCLASS...\n") ); |
850 | goto fail; | |
851 | } | |
a3621e74 | 852 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
66e933ab | 853 | "This position contradicts STCLASS...\n") ); |
653099ff GS |
854 | if ((prog->reganch & ROPT_ANCH) && !ml_anch) |
855 | goto fail; | |
6eb5f6b9 | 856 | /* Contradict one of substrings */ |
33b8afdf JH |
857 | if (prog->anchored_substr || prog->anchored_utf8) { |
858 | if ((do_utf8 ? prog->anchored_utf8 : prog->anchored_substr) == check) { | |
a3621e74 | 859 | DEBUG_EXECUTE_r( what = "anchored" ); |
6eb5f6b9 | 860 | hop_and_restart: |
1aa99e6b | 861 | s = HOP3c(t, 1, strend); |
66e933ab GS |
862 | if (s + start_shift + end_shift > strend) { |
863 | /* XXXX Should be taken into account earlier? */ | |
a3621e74 | 864 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
66e933ab GS |
865 | "Could not match STCLASS...\n") ); |
866 | goto fail; | |
867 | } | |
5e39e1e5 HS |
868 | if (!check) |
869 | goto giveup; | |
a3621e74 | 870 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
f5952150 | 871 | "Looking for %s substr starting at offset %ld...\n", |
6eb5f6b9 JH |
872 | what, (long)(s + start_shift - i_strpos)) ); |
873 | goto restart; | |
874 | } | |
66e933ab | 875 | /* Have both, check_string is floating */ |
6eb5f6b9 JH |
876 | if (t + start_shift >= check_at) /* Contradicts floating=check */ |
877 | goto retry_floating_check; | |
878 | /* Recheck anchored substring, but not floating... */ | |
9041c2e3 | 879 | s = check_at; |
5e39e1e5 HS |
880 | if (!check) |
881 | goto giveup; | |
a3621e74 | 882 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
f5952150 | 883 | "Looking for anchored substr starting at offset %ld...\n", |
6eb5f6b9 JH |
884 | (long)(other_last - i_strpos)) ); |
885 | goto do_other_anchored; | |
886 | } | |
60e71179 GS |
887 | /* Another way we could have checked stclass at the |
888 | current position only: */ | |
889 | if (ml_anch) { | |
890 | s = t = t + 1; | |
5e39e1e5 HS |
891 | if (!check) |
892 | goto giveup; | |
a3621e74 | 893 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, |
f5952150 | 894 | "Looking for /%s^%s/m starting at offset %ld...\n", |
e4584336 | 895 | PL_colors[0], PL_colors[1], (long)(t - i_strpos)) ); |
60e71179 | 896 | goto try_at_offset; |
66e933ab | 897 | } |
33b8afdf | 898 | if (!(do_utf8 ? prog->float_utf8 : prog->float_substr)) /* Could have been deleted */ |
60e71179 | 899 | goto fail; |
6eb5f6b9 JH |
900 | /* Check is floating subtring. */ |
901 | retry_floating_check: | |
902 | t = check_at - start_shift; | |
a3621e74 | 903 | DEBUG_EXECUTE_r( what = "floating" ); |
6eb5f6b9 JH |
904 | goto hop_and_restart; |
905 | } | |
b7953727 | 906 | if (t != s) { |
a3621e74 | 907 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
6eb5f6b9 | 908 | "By STCLASS: moving %ld --> %ld\n", |
b7953727 JH |
909 | (long)(t - i_strpos), (long)(s - i_strpos)) |
910 | ); | |
911 | } | |
912 | else { | |
a3621e74 | 913 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
b7953727 JH |
914 | "Does not contradict STCLASS...\n"); |
915 | ); | |
916 | } | |
6eb5f6b9 | 917 | } |
5e39e1e5 | 918 | giveup: |
a3621e74 | 919 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s%s:%s match at offset %ld\n", |
5e39e1e5 HS |
920 | PL_colors[4], (check ? "Guessed" : "Giving up"), |
921 | PL_colors[5], (long)(s - i_strpos)) ); | |
cad2e5aa | 922 | return s; |
2c2d71f5 JH |
923 | |
924 | fail_finish: /* Substring not found */ | |
33b8afdf JH |
925 | if (prog->check_substr || prog->check_utf8) /* could be removed already */ |
926 | BmUSEFUL(do_utf8 ? prog->check_utf8 : prog->check_substr) += 5; /* hooray */ | |
cad2e5aa | 927 | fail: |
a3621e74 | 928 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch rejected by optimizer%s\n", |
e4584336 | 929 | PL_colors[4], PL_colors[5])); |
bd61b366 | 930 | return NULL; |
cad2e5aa | 931 | } |
9661b544 | 932 | |
6eb5f6b9 | 933 | /* We know what class REx starts with. Try to find this position... */ |
3b0527fe DM |
934 | /* if reginfo is NULL, its a dryrun */ |
935 | ||
3c3eec57 | 936 | STATIC char * |
3b0527fe DM |
937 | S_find_byclass(pTHX_ regexp * prog, const regnode *c, char *s, const char |
938 | *strend, const regmatch_info *reginfo) | |
a687059c | 939 | { |
27da23d5 | 940 | dVAR; |
1df70142 | 941 | const I32 doevery = (prog->reganch & ROPT_SKIP) == 0; |
6eb5f6b9 | 942 | char *m; |
d8093b23 | 943 | STRLEN ln; |
5dab1207 | 944 | STRLEN lnc; |
078c425b | 945 | register STRLEN uskip; |
d8093b23 G |
946 | unsigned int c1; |
947 | unsigned int c2; | |
6eb5f6b9 JH |
948 | char *e; |
949 | register I32 tmp = 1; /* Scratch variable? */ | |
a3b680e6 | 950 | register const bool do_utf8 = PL_reg_match_utf8; |
cad2e5aa | 951 | |
6eb5f6b9 JH |
952 | /* We know what class it must start with. */ |
953 | switch (OP(c)) { | |
6eb5f6b9 | 954 | case ANYOF: |
388cc4de | 955 | if (do_utf8) { |
078c425b | 956 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
388cc4de HS |
957 | if ((ANYOF_FLAGS(c) & ANYOF_UNICODE) || |
958 | !UTF8_IS_INVARIANT((U8)s[0]) ? | |
32fc9b6a DM |
959 | reginclass(prog, c, (U8*)s, 0, do_utf8) : |
960 | REGINCLASS(prog, c, (U8*)s)) { | |
3b0527fe | 961 | if (tmp && (!reginfo || regtry(reginfo, s))) |
388cc4de HS |
962 | goto got_it; |
963 | else | |
964 | tmp = doevery; | |
965 | } | |
966 | else | |
967 | tmp = 1; | |
078c425b | 968 | s += uskip; |
388cc4de HS |
969 | } |
970 | } | |
971 | else { | |
972 | while (s < strend) { | |
973 | STRLEN skip = 1; | |
974 | ||
32fc9b6a | 975 | if (REGINCLASS(prog, c, (U8*)s) || |
388cc4de HS |
976 | (ANYOF_FOLD_SHARP_S(c, s, strend) && |
977 | /* The assignment of 2 is intentional: | |
978 | * for the folded sharp s, the skip is 2. */ | |
979 | (skip = SHARP_S_SKIP))) { | |
3b0527fe | 980 | if (tmp && (!reginfo || regtry(reginfo, s))) |
388cc4de HS |
981 | goto got_it; |
982 | else | |
983 | tmp = doevery; | |
984 | } | |
985 | else | |
986 | tmp = 1; | |
987 | s += skip; | |
988 | } | |
a0d0e21e | 989 | } |
6eb5f6b9 | 990 | break; |
f33976b4 DB |
991 | case CANY: |
992 | while (s < strend) { | |
3b0527fe | 993 | if (tmp && (!reginfo || regtry(reginfo, s))) |
f33976b4 DB |
994 | goto got_it; |
995 | else | |
996 | tmp = doevery; | |
997 | s++; | |
998 | } | |
999 | break; | |
6eb5f6b9 | 1000 | case EXACTF: |
5dab1207 NIS |
1001 | m = STRING(c); |
1002 | ln = STR_LEN(c); /* length to match in octets/bytes */ | |
1003 | lnc = (I32) ln; /* length to match in characters */ | |
1aa99e6b | 1004 | if (UTF) { |
a2a2844f | 1005 | STRLEN ulen1, ulen2; |
5dab1207 | 1006 | U8 *sm = (U8 *) m; |
89ebb4a3 JH |
1007 | U8 tmpbuf1[UTF8_MAXBYTES_CASE+1]; |
1008 | U8 tmpbuf2[UTF8_MAXBYTES_CASE+1]; | |
4ad0818d | 1009 | const U32 uniflags = UTF8_ALLOW_DEFAULT; |
a2a2844f JH |
1010 | |
1011 | to_utf8_lower((U8*)m, tmpbuf1, &ulen1); | |
1012 | to_utf8_upper((U8*)m, tmpbuf2, &ulen2); | |
1013 | ||
89ebb4a3 | 1014 | c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXBYTES_CASE, |
041457d9 | 1015 | 0, uniflags); |
89ebb4a3 | 1016 | c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXBYTES_CASE, |
041457d9 | 1017 | 0, uniflags); |
5dab1207 NIS |
1018 | lnc = 0; |
1019 | while (sm < ((U8 *) m + ln)) { | |
1020 | lnc++; | |
1021 | sm += UTF8SKIP(sm); | |
1022 | } | |
1aa99e6b IH |
1023 | } |
1024 | else { | |
1025 | c1 = *(U8*)m; | |
1026 | c2 = PL_fold[c1]; | |
1027 | } | |
6eb5f6b9 JH |
1028 | goto do_exactf; |
1029 | case EXACTFL: | |
5dab1207 NIS |
1030 | m = STRING(c); |
1031 | ln = STR_LEN(c); | |
1032 | lnc = (I32) ln; | |
d8093b23 | 1033 | c1 = *(U8*)m; |
6eb5f6b9 JH |
1034 | c2 = PL_fold_locale[c1]; |
1035 | do_exactf: | |
db12adc6 | 1036 | e = HOP3c(strend, -((I32)lnc), s); |
b3c9acc1 | 1037 | |
3b0527fe | 1038 | if (!reginfo && e < s) |
6eb5f6b9 | 1039 | e = s; /* Due to minlen logic of intuit() */ |
1aa99e6b | 1040 | |
60a8b682 JH |
1041 | /* The idea in the EXACTF* cases is to first find the |
1042 | * first character of the EXACTF* node and then, if | |
1043 | * necessary, case-insensitively compare the full | |
1044 | * text of the node. The c1 and c2 are the first | |
1045 | * characters (though in Unicode it gets a bit | |
1046 | * more complicated because there are more cases | |
7f16dd3d JH |
1047 | * than just upper and lower: one needs to use |
1048 | * the so-called folding case for case-insensitive | |
1049 | * matching (called "loose matching" in Unicode). | |
1050 | * ibcmp_utf8() will do just that. */ | |
60a8b682 | 1051 | |
1aa99e6b | 1052 | if (do_utf8) { |
575cac57 | 1053 | UV c, f; |
89ebb4a3 | 1054 | U8 tmpbuf [UTF8_MAXBYTES+1]; |
575cac57 | 1055 | STRLEN len, foldlen; |
4ad0818d | 1056 | const U32 uniflags = UTF8_ALLOW_DEFAULT; |
09091399 | 1057 | if (c1 == c2) { |
5dab1207 NIS |
1058 | /* Upper and lower of 1st char are equal - |
1059 | * probably not a "letter". */ | |
1aa99e6b | 1060 | while (s <= e) { |
89ebb4a3 | 1061 | c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len, |
041457d9 | 1062 | uniflags); |
80aecb99 JH |
1063 | if ( c == c1 |
1064 | && (ln == len || | |
66423254 | 1065 | ibcmp_utf8(s, (char **)0, 0, do_utf8, |
eb160463 | 1066 | m, (char **)0, ln, (bool)UTF)) |
3b0527fe | 1067 | && (!reginfo || regtry(reginfo, s)) ) |
1aa99e6b | 1068 | goto got_it; |
80aecb99 | 1069 | else { |
1df70142 | 1070 | U8 foldbuf[UTF8_MAXBYTES_CASE+1]; |
80aecb99 | 1071 | uvchr_to_utf8(tmpbuf, c); |
ac7e0132 | 1072 | f = to_utf8_fold(tmpbuf, foldbuf, &foldlen); |
80aecb99 JH |
1073 | if ( f != c |
1074 | && (f == c1 || f == c2) | |
1075 | && (ln == foldlen || | |
66423254 JH |
1076 | !ibcmp_utf8((char *) foldbuf, |
1077 | (char **)0, foldlen, do_utf8, | |
d07ddd77 | 1078 | m, |
eb160463 | 1079 | (char **)0, ln, (bool)UTF)) |
3b0527fe | 1080 | && (!reginfo || regtry(reginfo, s)) ) |
80aecb99 JH |
1081 | goto got_it; |
1082 | } | |
1aa99e6b IH |
1083 | s += len; |
1084 | } | |
09091399 JH |
1085 | } |
1086 | else { | |
1aa99e6b | 1087 | while (s <= e) { |
89ebb4a3 | 1088 | c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len, |
041457d9 | 1089 | uniflags); |
80aecb99 | 1090 | |
60a8b682 | 1091 | /* Handle some of the three Greek sigmas cases. |
8c01da3c JH |
1092 | * Note that not all the possible combinations |
1093 | * are handled here: some of them are handled | |
1094 | * by the standard folding rules, and some of | |
1095 | * them (the character class or ANYOF cases) | |
1096 | * are handled during compiletime in | |
1097 | * regexec.c:S_regclass(). */ | |
880bd946 JH |
1098 | if (c == (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA || |
1099 | c == (UV)UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA) | |
1100 | c = (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA; | |
80aecb99 JH |
1101 | |
1102 | if ( (c == c1 || c == c2) | |
1103 | && (ln == len || | |
66423254 | 1104 | ibcmp_utf8(s, (char **)0, 0, do_utf8, |
eb160463 | 1105 | m, (char **)0, ln, (bool)UTF)) |
3b0527fe | 1106 | && (!reginfo || regtry(reginfo, s)) ) |
1aa99e6b | 1107 | goto got_it; |
80aecb99 | 1108 | else { |
1df70142 | 1109 | U8 foldbuf[UTF8_MAXBYTES_CASE+1]; |
80aecb99 | 1110 | uvchr_to_utf8(tmpbuf, c); |
ac7e0132 | 1111 | f = to_utf8_fold(tmpbuf, foldbuf, &foldlen); |
80aecb99 JH |
1112 | if ( f != c |
1113 | && (f == c1 || f == c2) | |
1114 | && (ln == foldlen || | |
a6872d42 | 1115 | !ibcmp_utf8((char *) foldbuf, |
66423254 | 1116 | (char **)0, foldlen, do_utf8, |
d07ddd77 | 1117 | m, |
eb160463 | 1118 | (char **)0, ln, (bool)UTF)) |
3b0527fe | 1119 | && (!reginfo || regtry(reginfo, s)) ) |
80aecb99 JH |
1120 | goto got_it; |
1121 | } | |
1aa99e6b IH |
1122 | s += len; |
1123 | } | |
09091399 | 1124 | } |
1aa99e6b IH |
1125 | } |
1126 | else { | |
1127 | if (c1 == c2) | |
1128 | while (s <= e) { | |
1129 | if ( *(U8*)s == c1 | |
1130 | && (ln == 1 || !(OP(c) == EXACTF | |
1131 | ? ibcmp(s, m, ln) | |
1132 | : ibcmp_locale(s, m, ln))) | |
3b0527fe | 1133 | && (!reginfo || regtry(reginfo, s)) ) |
1aa99e6b IH |
1134 | goto got_it; |
1135 | s++; | |
1136 | } | |
1137 | else | |
1138 | while (s <= e) { | |
1139 | if ( (*(U8*)s == c1 || *(U8*)s == c2) | |
1140 | && (ln == 1 || !(OP(c) == EXACTF | |
1141 | ? ibcmp(s, m, ln) | |
1142 | : ibcmp_locale(s, m, ln))) | |
3b0527fe | 1143 | && (!reginfo || regtry(reginfo, s)) ) |
1aa99e6b IH |
1144 | goto got_it; |
1145 | s++; | |
1146 | } | |
b3c9acc1 IZ |
1147 | } |
1148 | break; | |
bbce6d69 | 1149 | case BOUNDL: |
3280af22 | 1150 | PL_reg_flags |= RF_tainted; |
bbce6d69 | 1151 | /* FALL THROUGH */ |
a0d0e21e | 1152 | case BOUND: |
ffc61ed2 | 1153 | if (do_utf8) { |
12d33761 | 1154 | if (s == PL_bostr) |
ffc61ed2 JH |
1155 | tmp = '\n'; |
1156 | else { | |
6136c704 | 1157 | U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr); |
4ad0818d | 1158 | tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT); |
ffc61ed2 JH |
1159 | } |
1160 | tmp = ((OP(c) == BOUND ? | |
9041c2e3 | 1161 | isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0); |
1a4fad37 | 1162 | LOAD_UTF8_CHARCLASS_ALNUM(); |
078c425b | 1163 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1164 | if (tmp == !(OP(c) == BOUND ? |
3568d838 | 1165 | swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) : |
ffc61ed2 JH |
1166 | isALNUM_LC_utf8((U8*)s))) |
1167 | { | |
1168 | tmp = !tmp; | |
3b0527fe | 1169 | if ((!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1170 | goto got_it; |
1171 | } | |
078c425b | 1172 | s += uskip; |
a687059c | 1173 | } |
a0d0e21e | 1174 | } |
667bb95a | 1175 | else { |
12d33761 | 1176 | tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n'; |
ffc61ed2 JH |
1177 | tmp = ((OP(c) == BOUND ? isALNUM(tmp) : isALNUM_LC(tmp)) != 0); |
1178 | while (s < strend) { | |
1179 | if (tmp == | |
1180 | !(OP(c) == BOUND ? isALNUM(*s) : isALNUM_LC(*s))) { | |
1181 | tmp = !tmp; | |
3b0527fe | 1182 | if ((!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1183 | goto got_it; |
1184 | } | |
1185 | s++; | |
a0ed51b3 | 1186 | } |
a0ed51b3 | 1187 | } |
3b0527fe | 1188 | if ((!prog->minlen && tmp) && (!reginfo || regtry(reginfo, s))) |
a0ed51b3 LW |
1189 | goto got_it; |
1190 | break; | |
bbce6d69 | 1191 | case NBOUNDL: |
3280af22 | 1192 | PL_reg_flags |= RF_tainted; |
bbce6d69 | 1193 | /* FALL THROUGH */ |
a0d0e21e | 1194 | case NBOUND: |
ffc61ed2 | 1195 | if (do_utf8) { |
12d33761 | 1196 | if (s == PL_bostr) |
ffc61ed2 JH |
1197 | tmp = '\n'; |
1198 | else { | |
6136c704 | 1199 | U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr); |
4ad0818d | 1200 | tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT); |
ffc61ed2 JH |
1201 | } |
1202 | tmp = ((OP(c) == NBOUND ? | |
9041c2e3 | 1203 | isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0); |
1a4fad37 | 1204 | LOAD_UTF8_CHARCLASS_ALNUM(); |
078c425b | 1205 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1206 | if (tmp == !(OP(c) == NBOUND ? |
3568d838 | 1207 | swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) : |
ffc61ed2 JH |
1208 | isALNUM_LC_utf8((U8*)s))) |
1209 | tmp = !tmp; | |
3b0527fe | 1210 | else if ((!reginfo || regtry(reginfo, s))) |
ffc61ed2 | 1211 | goto got_it; |
078c425b | 1212 | s += uskip; |
ffc61ed2 | 1213 | } |
a0d0e21e | 1214 | } |
667bb95a | 1215 | else { |
12d33761 | 1216 | tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n'; |
ffc61ed2 JH |
1217 | tmp = ((OP(c) == NBOUND ? |
1218 | isALNUM(tmp) : isALNUM_LC(tmp)) != 0); | |
1219 | while (s < strend) { | |
1220 | if (tmp == | |
1221 | !(OP(c) == NBOUND ? isALNUM(*s) : isALNUM_LC(*s))) | |
1222 | tmp = !tmp; | |
3b0527fe | 1223 | else if ((!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1224 | goto got_it; |
1225 | s++; | |
1226 | } | |
a0ed51b3 | 1227 | } |
3b0527fe | 1228 | if ((!prog->minlen && !tmp) && (!reginfo || regtry(reginfo, s))) |
a0ed51b3 LW |
1229 | goto got_it; |
1230 | break; | |
a0d0e21e | 1231 | case ALNUM: |
ffc61ed2 | 1232 | if (do_utf8) { |
1a4fad37 | 1233 | LOAD_UTF8_CHARCLASS_ALNUM(); |
078c425b | 1234 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1235 | if (swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8)) { |
3b0527fe | 1236 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1237 | goto got_it; |
1238 | else | |
1239 | tmp = doevery; | |
1240 | } | |
bbce6d69 | 1241 | else |
ffc61ed2 | 1242 | tmp = 1; |
078c425b | 1243 | s += uskip; |
bbce6d69 | 1244 | } |
bbce6d69 | 1245 | } |
ffc61ed2 JH |
1246 | else { |
1247 | while (s < strend) { | |
1248 | if (isALNUM(*s)) { | |
3b0527fe | 1249 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1250 | goto got_it; |
1251 | else | |
1252 | tmp = doevery; | |
1253 | } | |
a0ed51b3 | 1254 | else |
ffc61ed2 JH |
1255 | tmp = 1; |
1256 | s++; | |
a0ed51b3 | 1257 | } |
a0ed51b3 LW |
1258 | } |
1259 | break; | |
bbce6d69 | 1260 | case ALNUML: |
3280af22 | 1261 | PL_reg_flags |= RF_tainted; |
ffc61ed2 | 1262 | if (do_utf8) { |
078c425b | 1263 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1264 | if (isALNUM_LC_utf8((U8*)s)) { |
3b0527fe | 1265 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1266 | goto got_it; |
1267 | else | |
1268 | tmp = doevery; | |
1269 | } | |
a687059c | 1270 | else |
ffc61ed2 | 1271 | tmp = 1; |
078c425b | 1272 | s += uskip; |
a0d0e21e | 1273 | } |
a0d0e21e | 1274 | } |
ffc61ed2 JH |
1275 | else { |
1276 | while (s < strend) { | |
1277 | if (isALNUM_LC(*s)) { | |
3b0527fe | 1278 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1279 | goto got_it; |
1280 | else | |
1281 | tmp = doevery; | |
1282 | } | |
a0ed51b3 | 1283 | else |
ffc61ed2 JH |
1284 | tmp = 1; |
1285 | s++; | |
a0ed51b3 | 1286 | } |
a0ed51b3 LW |
1287 | } |
1288 | break; | |
a0d0e21e | 1289 | case NALNUM: |
ffc61ed2 | 1290 | if (do_utf8) { |
1a4fad37 | 1291 | LOAD_UTF8_CHARCLASS_ALNUM(); |
078c425b | 1292 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1293 | if (!swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8)) { |
3b0527fe | 1294 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1295 | goto got_it; |
1296 | else | |
1297 | tmp = doevery; | |
1298 | } | |
bbce6d69 | 1299 | else |
ffc61ed2 | 1300 | tmp = 1; |
078c425b | 1301 | s += uskip; |
bbce6d69 | 1302 | } |
bbce6d69 | 1303 | } |
ffc61ed2 JH |
1304 | else { |
1305 | while (s < strend) { | |
1306 | if (!isALNUM(*s)) { | |
3b0527fe | 1307 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1308 | goto got_it; |
1309 | else | |
1310 | tmp = doevery; | |
1311 | } | |
a0ed51b3 | 1312 | else |
ffc61ed2 JH |
1313 | tmp = 1; |
1314 | s++; | |
a0ed51b3 | 1315 | } |
a0ed51b3 LW |
1316 | } |
1317 | break; | |
bbce6d69 | 1318 | case NALNUML: |
3280af22 | 1319 | PL_reg_flags |= RF_tainted; |
ffc61ed2 | 1320 | if (do_utf8) { |
078c425b | 1321 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1322 | if (!isALNUM_LC_utf8((U8*)s)) { |
3b0527fe | 1323 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1324 | goto got_it; |
1325 | else | |
1326 | tmp = doevery; | |
1327 | } | |
a687059c | 1328 | else |
ffc61ed2 | 1329 | tmp = 1; |
078c425b | 1330 | s += uskip; |
a687059c | 1331 | } |
a0d0e21e | 1332 | } |
ffc61ed2 JH |
1333 | else { |
1334 | while (s < strend) { | |
1335 | if (!isALNUM_LC(*s)) { | |
3b0527fe | 1336 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1337 | goto got_it; |
1338 | else | |
1339 | tmp = doevery; | |
1340 | } | |
a0ed51b3 | 1341 | else |
ffc61ed2 JH |
1342 | tmp = 1; |
1343 | s++; | |
a0ed51b3 | 1344 | } |
a0ed51b3 LW |
1345 | } |
1346 | break; | |
a0d0e21e | 1347 | case SPACE: |
ffc61ed2 | 1348 | if (do_utf8) { |
1a4fad37 | 1349 | LOAD_UTF8_CHARCLASS_SPACE(); |
078c425b | 1350 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1351 | if (*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8)) { |
3b0527fe | 1352 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1353 | goto got_it; |
1354 | else | |
1355 | tmp = doevery; | |
1356 | } | |
a0d0e21e | 1357 | else |
ffc61ed2 | 1358 | tmp = 1; |
078c425b | 1359 | s += uskip; |
2304df62 | 1360 | } |
a0d0e21e | 1361 | } |
ffc61ed2 JH |
1362 | else { |
1363 | while (s < strend) { | |
1364 | if (isSPACE(*s)) { | |
3b0527fe | 1365 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1366 | goto got_it; |
1367 | else | |
1368 | tmp = doevery; | |
1369 | } | |
a0ed51b3 | 1370 | else |
ffc61ed2 JH |
1371 | tmp = 1; |
1372 | s++; | |
a0ed51b3 | 1373 | } |
a0ed51b3 LW |
1374 | } |
1375 | break; | |
bbce6d69 | 1376 | case SPACEL: |
3280af22 | 1377 | PL_reg_flags |= RF_tainted; |
ffc61ed2 | 1378 | if (do_utf8) { |
078c425b | 1379 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1380 | if (*s == ' ' || isSPACE_LC_utf8((U8*)s)) { |
3b0527fe | 1381 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1382 | goto got_it; |
1383 | else | |
1384 | tmp = doevery; | |
1385 | } | |
bbce6d69 | 1386 | else |
ffc61ed2 | 1387 | tmp = 1; |
078c425b | 1388 | s += uskip; |
bbce6d69 | 1389 | } |
bbce6d69 | 1390 | } |
ffc61ed2 JH |
1391 | else { |
1392 | while (s < strend) { | |
1393 | if (isSPACE_LC(*s)) { | |
3b0527fe | 1394 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1395 | goto got_it; |
1396 | else | |
1397 | tmp = doevery; | |
1398 | } | |
a0ed51b3 | 1399 | else |
ffc61ed2 JH |
1400 | tmp = 1; |
1401 | s++; | |
a0ed51b3 | 1402 | } |
a0ed51b3 LW |
1403 | } |
1404 | break; | |
a0d0e21e | 1405 | case NSPACE: |
ffc61ed2 | 1406 | if (do_utf8) { |
1a4fad37 | 1407 | LOAD_UTF8_CHARCLASS_SPACE(); |
078c425b | 1408 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1409 | if (!(*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8))) { |
3b0527fe | 1410 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1411 | goto got_it; |
1412 | else | |
1413 | tmp = doevery; | |
1414 | } | |
a0d0e21e | 1415 | else |
ffc61ed2 | 1416 | tmp = 1; |
078c425b | 1417 | s += uskip; |
a687059c | 1418 | } |
a0d0e21e | 1419 | } |
ffc61ed2 JH |
1420 | else { |
1421 | while (s < strend) { | |
1422 | if (!isSPACE(*s)) { | |
3b0527fe | 1423 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1424 | goto got_it; |
1425 | else | |
1426 | tmp = doevery; | |
1427 | } | |
a0ed51b3 | 1428 | else |
ffc61ed2 JH |
1429 | tmp = 1; |
1430 | s++; | |
a0ed51b3 | 1431 | } |
a0ed51b3 LW |
1432 | } |
1433 | break; | |
bbce6d69 | 1434 | case NSPACEL: |
3280af22 | 1435 | PL_reg_flags |= RF_tainted; |
ffc61ed2 | 1436 | if (do_utf8) { |
078c425b | 1437 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1438 | if (!(*s == ' ' || isSPACE_LC_utf8((U8*)s))) { |
3b0527fe | 1439 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1440 | goto got_it; |
1441 | else | |
1442 | tmp = doevery; | |
1443 | } | |
bbce6d69 | 1444 | else |
ffc61ed2 | 1445 | tmp = 1; |
078c425b | 1446 | s += uskip; |
bbce6d69 | 1447 | } |
bbce6d69 | 1448 | } |
ffc61ed2 JH |
1449 | else { |
1450 | while (s < strend) { | |
1451 | if (!isSPACE_LC(*s)) { | |
3b0527fe | 1452 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1453 | goto got_it; |
1454 | else | |
1455 | tmp = doevery; | |
1456 | } | |
a0ed51b3 | 1457 | else |
ffc61ed2 JH |
1458 | tmp = 1; |
1459 | s++; | |
a0ed51b3 | 1460 | } |
a0ed51b3 LW |
1461 | } |
1462 | break; | |
a0d0e21e | 1463 | case DIGIT: |
ffc61ed2 | 1464 | if (do_utf8) { |
1a4fad37 | 1465 | LOAD_UTF8_CHARCLASS_DIGIT(); |
078c425b | 1466 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1467 | if (swash_fetch(PL_utf8_digit,(U8*)s, do_utf8)) { |
3b0527fe | 1468 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1469 | goto got_it; |
1470 | else | |
1471 | tmp = doevery; | |
1472 | } | |
a0d0e21e | 1473 | else |
ffc61ed2 | 1474 | tmp = 1; |
078c425b | 1475 | s += uskip; |
2b69d0c2 | 1476 | } |
a0d0e21e | 1477 | } |
ffc61ed2 JH |
1478 | else { |
1479 | while (s < strend) { | |
1480 | if (isDIGIT(*s)) { | |
3b0527fe | 1481 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1482 | goto got_it; |
1483 | else | |
1484 | tmp = doevery; | |
1485 | } | |
a0ed51b3 | 1486 | else |
ffc61ed2 JH |
1487 | tmp = 1; |
1488 | s++; | |
a0ed51b3 | 1489 | } |
a0ed51b3 LW |
1490 | } |
1491 | break; | |
b8c5462f JH |
1492 | case DIGITL: |
1493 | PL_reg_flags |= RF_tainted; | |
ffc61ed2 | 1494 | if (do_utf8) { |
078c425b | 1495 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1496 | if (isDIGIT_LC_utf8((U8*)s)) { |
3b0527fe | 1497 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1498 | goto got_it; |
1499 | else | |
1500 | tmp = doevery; | |
1501 | } | |
b8c5462f | 1502 | else |
ffc61ed2 | 1503 | tmp = 1; |
078c425b | 1504 | s += uskip; |
b8c5462f | 1505 | } |
b8c5462f | 1506 | } |
ffc61ed2 JH |
1507 | else { |
1508 | while (s < strend) { | |
1509 | if (isDIGIT_LC(*s)) { | |
3b0527fe | 1510 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1511 | goto got_it; |
1512 | else | |
1513 | tmp = doevery; | |
1514 | } | |
b8c5462f | 1515 | else |
ffc61ed2 JH |
1516 | tmp = 1; |
1517 | s++; | |
b8c5462f | 1518 | } |
b8c5462f JH |
1519 | } |
1520 | break; | |
a0d0e21e | 1521 | case NDIGIT: |
ffc61ed2 | 1522 | if (do_utf8) { |
1a4fad37 | 1523 | LOAD_UTF8_CHARCLASS_DIGIT(); |
078c425b | 1524 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
3568d838 | 1525 | if (!swash_fetch(PL_utf8_digit,(U8*)s, do_utf8)) { |
3b0527fe | 1526 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1527 | goto got_it; |
1528 | else | |
1529 | tmp = doevery; | |
1530 | } | |
a0d0e21e | 1531 | else |
ffc61ed2 | 1532 | tmp = 1; |
078c425b | 1533 | s += uskip; |
a687059c | 1534 | } |
a0d0e21e | 1535 | } |
ffc61ed2 JH |
1536 | else { |
1537 | while (s < strend) { | |
1538 | if (!isDIGIT(*s)) { | |
3b0527fe | 1539 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1540 | goto got_it; |
1541 | else | |
1542 | tmp = doevery; | |
1543 | } | |
a0ed51b3 | 1544 | else |
ffc61ed2 JH |
1545 | tmp = 1; |
1546 | s++; | |
a0ed51b3 | 1547 | } |
a0ed51b3 LW |
1548 | } |
1549 | break; | |
b8c5462f JH |
1550 | case NDIGITL: |
1551 | PL_reg_flags |= RF_tainted; | |
ffc61ed2 | 1552 | if (do_utf8) { |
078c425b | 1553 | while (s + (uskip = UTF8SKIP(s)) <= strend) { |
ffc61ed2 | 1554 | if (!isDIGIT_LC_utf8((U8*)s)) { |
3b0527fe | 1555 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1556 | goto got_it; |
1557 | else | |
1558 | tmp = doevery; | |
1559 | } | |
b8c5462f | 1560 | else |
ffc61ed2 | 1561 | tmp = 1; |
078c425b | 1562 | s += uskip; |
b8c5462f | 1563 | } |
a0ed51b3 | 1564 | } |
ffc61ed2 JH |
1565 | else { |
1566 | while (s < strend) { | |
1567 | if (!isDIGIT_LC(*s)) { | |
3b0527fe | 1568 | if (tmp && (!reginfo || regtry(reginfo, s))) |
ffc61ed2 JH |
1569 | goto got_it; |
1570 | else | |
1571 | tmp = doevery; | |
1572 | } | |
cf93c79d | 1573 | else |
ffc61ed2 JH |
1574 | tmp = 1; |
1575 | s++; | |
b8c5462f | 1576 | } |
b8c5462f JH |
1577 | } |
1578 | break; | |
b3c9acc1 | 1579 | default: |
3c3eec57 GS |
1580 | Perl_croak(aTHX_ "panic: unknown regstclass %d", (int)OP(c)); |
1581 | break; | |
d6a28714 | 1582 | } |
6eb5f6b9 JH |
1583 | return 0; |
1584 | got_it: | |
1585 | return s; | |
1586 | } | |
1587 | ||
1588 | /* | |
1589 | - regexec_flags - match a regexp against a string | |
1590 | */ | |
1591 | I32 | |
1592 | Perl_regexec_flags(pTHX_ register regexp *prog, char *stringarg, register char *strend, | |
1593 | char *strbeg, I32 minend, SV *sv, void *data, U32 flags) | |
1594 | /* strend: pointer to null at end of string */ | |
1595 | /* strbeg: real beginning of string */ | |
1596 | /* minend: end of match must be >=minend after stringarg. */ | |
1597 | /* data: May be used for some additional optimizations. */ | |
1598 | /* nosave: For optimizations. */ | |
1599 | { | |
97aff369 | 1600 | dVAR; |
6eb5f6b9 JH |
1601 | register char *s; |
1602 | register regnode *c; | |
1603 | register char *startpos = stringarg; | |
6eb5f6b9 JH |
1604 | I32 minlen; /* must match at least this many chars */ |
1605 | I32 dontbother = 0; /* how many characters not to try at end */ | |
6eb5f6b9 JH |
1606 | I32 end_shift = 0; /* Same for the end. */ /* CC */ |
1607 | I32 scream_pos = -1; /* Internal iterator of scream. */ | |
ccac19ea | 1608 | char *scream_olds = NULL; |
6eb5f6b9 | 1609 | SV* oreplsv = GvSV(PL_replgv); |
1df70142 | 1610 | const bool do_utf8 = DO_UTF8(sv); |
2757e526 | 1611 | I32 multiline; |
2a782b5b | 1612 | #ifdef DEBUGGING |
2757e526 JH |
1613 | SV* dsv0; |
1614 | SV* dsv1; | |
2a782b5b | 1615 | #endif |
3b0527fe | 1616 | regmatch_info reginfo; /* create some info to pass to regtry etc */ |
a3621e74 YO |
1617 | |
1618 | GET_RE_DEBUG_FLAGS_DECL; | |
1619 | ||
9d4ba2ae | 1620 | PERL_UNUSED_ARG(data); |
6eb5f6b9 JH |
1621 | |
1622 | /* Be paranoid... */ | |
1623 | if (prog == NULL || startpos == NULL) { | |
1624 | Perl_croak(aTHX_ "NULL regexp parameter"); | |
1625 | return 0; | |
1626 | } | |
1627 | ||
2757e526 | 1628 | multiline = prog->reganch & PMf_MULTILINE; |
3b0527fe | 1629 | reginfo.prog = prog; |
2757e526 JH |
1630 | |
1631 | #ifdef DEBUGGING | |
1632 | dsv0 = PERL_DEBUG_PAD_ZERO(0); | |
1633 | dsv1 = PERL_DEBUG_PAD_ZERO(1); | |
1634 | #endif | |
1635 | ||
bac06658 JH |
1636 | RX_MATCH_UTF8_set(prog, do_utf8); |
1637 | ||
6eb5f6b9 | 1638 | minlen = prog->minlen; |
61a36c01 | 1639 | if (strend - startpos < minlen) { |
a3621e74 | 1640 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
a72c7584 JH |
1641 | "String too short [regexec_flags]...\n")); |
1642 | goto phooey; | |
1aa99e6b | 1643 | } |
6eb5f6b9 | 1644 | |
6eb5f6b9 JH |
1645 | /* Check validity of program. */ |
1646 | if (UCHARAT(prog->program) != REG_MAGIC) { | |
1647 | Perl_croak(aTHX_ "corrupted regexp program"); | |
1648 | } | |
1649 | ||
1650 | PL_reg_flags = 0; | |
1651 | PL_reg_eval_set = 0; | |
1652 | PL_reg_maxiter = 0; | |
1653 | ||
1654 | if (prog->reganch & ROPT_UTF8) | |
1655 | PL_reg_flags |= RF_utf8; | |
1656 | ||
1657 | /* Mark beginning of line for ^ and lookbehind. */ | |
3b0527fe | 1658 | reginfo.bol = startpos; /* XXX not used ??? */ |
6eb5f6b9 | 1659 | PL_bostr = strbeg; |
3b0527fe | 1660 | reginfo.sv = sv; |
6eb5f6b9 JH |
1661 | |
1662 | /* Mark end of line for $ (and such) */ | |
1663 | PL_regeol = strend; | |
1664 | ||
1665 | /* see how far we have to get to not match where we matched before */ | |
3b0527fe | 1666 | reginfo.till = startpos+minend; |
6eb5f6b9 | 1667 | |
6eb5f6b9 JH |
1668 | /* If there is a "must appear" string, look for it. */ |
1669 | s = startpos; | |
1670 | ||
3b0527fe | 1671 | if (prog->reganch & ROPT_GPOS_SEEN) { /* Need to set reginfo->ganch */ |
6eb5f6b9 JH |
1672 | MAGIC *mg; |
1673 | ||
1674 | if (flags & REXEC_IGNOREPOS) /* Means: check only at start */ | |
3b0527fe | 1675 | reginfo.ganch = startpos; |
6eb5f6b9 JH |
1676 | else if (sv && SvTYPE(sv) >= SVt_PVMG |
1677 | && SvMAGIC(sv) | |
14befaf4 DM |
1678 | && (mg = mg_find(sv, PERL_MAGIC_regex_global)) |
1679 | && mg->mg_len >= 0) { | |
3b0527fe | 1680 | reginfo.ganch = strbeg + mg->mg_len; /* Defined pos() */ |
6eb5f6b9 | 1681 | if (prog->reganch & ROPT_ANCH_GPOS) { |
3b0527fe | 1682 | if (s > reginfo.ganch) |
6eb5f6b9 | 1683 | goto phooey; |
3b0527fe | 1684 | s = reginfo.ganch; |
6eb5f6b9 JH |
1685 | } |
1686 | } | |
1687 | else /* pos() not defined */ | |
3b0527fe | 1688 | reginfo.ganch = strbeg; |
6eb5f6b9 JH |
1689 | } |
1690 | ||
a0714e2c | 1691 | if (!(flags & REXEC_CHECKED) && (prog->check_substr != NULL || prog->check_utf8 != NULL)) { |
6eb5f6b9 JH |
1692 | re_scream_pos_data d; |
1693 | ||
1694 | d.scream_olds = &scream_olds; | |
1695 | d.scream_pos = &scream_pos; | |
1696 | s = re_intuit_start(prog, sv, s, strend, flags, &d); | |
3fa9c3d7 | 1697 | if (!s) { |
a3621e74 | 1698 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not present...\n")); |
6eb5f6b9 | 1699 | goto phooey; /* not present */ |
3fa9c3d7 | 1700 | } |
6eb5f6b9 JH |
1701 | } |
1702 | ||
a3621e74 | 1703 | DEBUG_EXECUTE_r({ |
1df70142 AL |
1704 | const char * const s0 = UTF |
1705 | ? pv_uni_display(dsv0, (U8*)prog->precomp, prog->prelen, 60, | |
1706 | UNI_DISPLAY_REGEX) | |
1707 | : prog->precomp; | |
1708 | const int len0 = UTF ? SvCUR(dsv0) : prog->prelen; | |
1709 | const char * const s1 = do_utf8 ? sv_uni_display(dsv1, sv, 60, | |
c728cb41 | 1710 | UNI_DISPLAY_REGEX) : startpos; |
1df70142 | 1711 | const int len1 = do_utf8 ? SvCUR(dsv1) : strend - startpos; |
2a782b5b JH |
1712 | if (!PL_colorset) |
1713 | reginitcolors(); | |
1714 | PerlIO_printf(Perl_debug_log, | |
a0288114 | 1715 | "%sMatching REx%s \"%s%*.*s%s%s\" against \"%s%.*s%s%s\"\n", |
e4584336 | 1716 | PL_colors[4], PL_colors[5], PL_colors[0], |
9e55ce06 | 1717 | len0, len0, s0, |
2a782b5b | 1718 | PL_colors[1], |
9e55ce06 | 1719 | len0 > 60 ? "..." : "", |
2a782b5b | 1720 | PL_colors[0], |
9e55ce06 JH |
1721 | (int)(len1 > 60 ? 60 : len1), |
1722 | s1, PL_colors[1], | |
1723 | (len1 > 60 ? "..." : "") | |
2a782b5b JH |
1724 | ); |
1725 | }); | |
6eb5f6b9 JH |
1726 | |
1727 | /* Simplest case: anchored match need be tried only once. */ | |
1728 | /* [unless only anchor is BOL and multiline is set] */ | |
1729 | if (prog->reganch & (ROPT_ANCH & ~ROPT_ANCH_GPOS)) { | |
3b0527fe | 1730 | if (s == startpos && regtry(®info, startpos)) |
6eb5f6b9 | 1731 | goto got_it; |
7fba1cd6 | 1732 | else if (multiline || (prog->reganch & ROPT_IMPLICIT) |
6eb5f6b9 JH |
1733 | || (prog->reganch & ROPT_ANCH_MBOL)) /* XXXX SBOL? */ |
1734 | { | |
1735 | char *end; | |
1736 | ||
1737 | if (minlen) | |
1738 | dontbother = minlen - 1; | |
1aa99e6b | 1739 | end = HOP3c(strend, -dontbother, strbeg) - 1; |
6eb5f6b9 | 1740 | /* for multiline we only have to try after newlines */ |
33b8afdf | 1741 | if (prog->check_substr || prog->check_utf8) { |
6eb5f6b9 JH |
1742 | if (s == startpos) |
1743 | goto after_try; | |
1744 | while (1) { | |
3b0527fe | 1745 | if (regtry(®info, s)) |
6eb5f6b9 JH |
1746 | goto got_it; |
1747 | after_try: | |
1748 | if (s >= end) | |
1749 | goto phooey; | |
1750 | if (prog->reganch & RE_USE_INTUIT) { | |
1751 | s = re_intuit_start(prog, sv, s + 1, strend, flags, NULL); | |
1752 | if (!s) | |
1753 | goto phooey; | |
1754 | } | |
1755 | else | |
1756 | s++; | |
1757 | } | |
1758 | } else { | |
1759 | if (s > startpos) | |
1760 | s--; | |
1761 | while (s < end) { | |
1762 | if (*s++ == '\n') { /* don't need PL_utf8skip here */ | |
3b0527fe | 1763 | if (regtry(®info, s)) |
6eb5f6b9 JH |
1764 | goto got_it; |
1765 | } | |
1766 | } | |
1767 | } | |
1768 | } | |
1769 | goto phooey; | |
1770 | } else if (prog->reganch & ROPT_ANCH_GPOS) { | |
3b0527fe | 1771 | if (regtry(®info, reginfo.ganch)) |
6eb5f6b9 JH |
1772 | goto got_it; |
1773 | goto phooey; | |
1774 | } | |
1775 | ||
1776 | /* Messy cases: unanchored match. */ | |
33b8afdf | 1777 | if ((prog->anchored_substr || prog->anchored_utf8) && prog->reganch & ROPT_SKIP) { |
6eb5f6b9 JH |
1778 | /* we have /x+whatever/ */ |
1779 | /* it must be a one character string (XXXX Except UTF?) */ | |
33b8afdf | 1780 | char ch; |
bf93d4cc GS |
1781 | #ifdef DEBUGGING |
1782 | int did_match = 0; | |
1783 | #endif | |
33b8afdf JH |
1784 | if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)) |
1785 | do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog); | |
3f7c398e | 1786 | ch = SvPVX_const(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)[0]; |
bf93d4cc | 1787 | |
1aa99e6b | 1788 | if (do_utf8) { |
6eb5f6b9 JH |
1789 | while (s < strend) { |
1790 | if (*s == ch) { | |
a3621e74 | 1791 | DEBUG_EXECUTE_r( did_match = 1 ); |
3b0527fe | 1792 | if (regtry(®info, s)) goto got_it; |
6eb5f6b9 JH |
1793 | s += UTF8SKIP(s); |
1794 | while (s < strend && *s == ch) | |
1795 | s += UTF8SKIP(s); | |
1796 | } | |
1797 | s += UTF8SKIP(s); | |
1798 | } | |
1799 | } | |
1800 | else { | |
1801 | while (s < strend) { | |
1802 | if (*s == ch) { | |
a3621e74 | 1803 | DEBUG_EXECUTE_r( did_match = 1 ); |
3b0527fe | 1804 | if (regtry(®info, s)) goto got_it; |
6eb5f6b9 JH |
1805 | s++; |
1806 | while (s < strend && *s == ch) | |
1807 | s++; | |
1808 | } | |
1809 | s++; | |
1810 | } | |
1811 | } | |
a3621e74 | 1812 | DEBUG_EXECUTE_r(if (!did_match) |
bf93d4cc | 1813 | PerlIO_printf(Perl_debug_log, |
b7953727 JH |
1814 | "Did not find anchored character...\n") |
1815 | ); | |
6eb5f6b9 | 1816 | } |
a0714e2c SS |
1817 | else if (prog->anchored_substr != NULL |
1818 | || prog->anchored_utf8 != NULL | |
1819 | || ((prog->float_substr != NULL || prog->float_utf8 != NULL) | |
33b8afdf JH |
1820 | && prog->float_max_offset < strend - s)) { |
1821 | SV *must; | |
1822 | I32 back_max; | |
1823 | I32 back_min; | |
1824 | char *last; | |
6eb5f6b9 | 1825 | char *last1; /* Last position checked before */ |
bf93d4cc GS |
1826 | #ifdef DEBUGGING |
1827 | int did_match = 0; | |
1828 | #endif | |
33b8afdf JH |
1829 | if (prog->anchored_substr || prog->anchored_utf8) { |
1830 | if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)) | |
1831 | do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog); | |
1832 | must = do_utf8 ? prog->anchored_utf8 : prog->anchored_substr; | |
1833 | back_max = back_min = prog->anchored_offset; | |
1834 | } else { | |
1835 | if (!(do_utf8 ? prog->float_utf8 : prog->float_substr)) | |
1836 | do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog); | |
1837 | must = do_utf8 ? prog->float_utf8 : prog->float_substr; | |
1838 | back_max = prog->float_max_offset; | |
1839 | back_min = prog->float_min_offset; | |
1840 | } | |
1841 | if (must == &PL_sv_undef) | |
1842 | /* could not downgrade utf8 check substring, so must fail */ | |
1843 | goto phooey; | |
1844 | ||
1845 | last = HOP3c(strend, /* Cannot start after this */ | |
1846 | -(I32)(CHR_SVLEN(must) | |
1847 | - (SvTAIL(must) != 0) + back_min), strbeg); | |
6eb5f6b9 JH |
1848 | |
1849 | if (s > PL_bostr) | |
1850 | last1 = HOPc(s, -1); | |
1851 | else | |
1852 | last1 = s - 1; /* bogus */ | |
1853 | ||
a0288114 | 1854 | /* XXXX check_substr already used to find "s", can optimize if |
6eb5f6b9 JH |
1855 | check_substr==must. */ |
1856 | scream_pos = -1; | |
1857 | dontbother = end_shift; | |
1858 | strend = HOPc(strend, -dontbother); | |
1859 | while ( (s <= last) && | |
9041c2e3 | 1860 | ((flags & REXEC_SCREAM) |
1aa99e6b | 1861 | ? (s = screaminstr(sv, must, HOP3c(s, back_min, strend) - strbeg, |
6eb5f6b9 | 1862 | end_shift, &scream_pos, 0)) |
1aa99e6b | 1863 | : (s = fbm_instr((unsigned char*)HOP3(s, back_min, strend), |
9041c2e3 | 1864 | (unsigned char*)strend, must, |
7fba1cd6 | 1865 | multiline ? FBMrf_MULTILINE : 0))) ) { |
4addbd3b HS |
1866 | /* we may be pointing at the wrong string */ |
1867 | if ((flags & REXEC_SCREAM) && RX_MATCH_COPIED(prog)) | |
3f7c398e | 1868 | s = strbeg + (s - SvPVX_const(sv)); |
a3621e74 | 1869 | DEBUG_EXECUTE_r( did_match = 1 ); |
6eb5f6b9 JH |
1870 | if (HOPc(s, -back_max) > last1) { |
1871 | last1 = HOPc(s, -back_min); | |
1872 | s = HOPc(s, -back_max); | |
1873 | } | |
1874 | else { | |
52657f30 | 1875 | char * const t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1; |
6eb5f6b9 JH |
1876 | |
1877 | last1 = HOPc(s, -back_min); | |
52657f30 | 1878 | s = t; |
6eb5f6b9 | 1879 | } |
1aa99e6b | 1880 | if (do_utf8) { |
6eb5f6b9 | 1881 | while (s <= last1) { |
3b0527fe | 1882 | if (regtry(®info, s)) |
6eb5f6b9 JH |
1883 | goto got_it; |
1884 | s += UTF8SKIP(s); | |
1885 | } | |
1886 | } | |
1887 | else { | |
1888 | while (s <= last1) { | |
3b0527fe | 1889 | if (regtry(®info, s)) |
6eb5f6b9 JH |
1890 | goto got_it; |
1891 | s++; | |
1892 | } | |
1893 | } | |
1894 | } | |
a3621e74 | 1895 | DEBUG_EXECUTE_r(if (!did_match) |
b7953727 | 1896 | PerlIO_printf(Perl_debug_log, |
a0288114 | 1897 | "Did not find %s substr \"%s%.*s%s\"%s...\n", |
33b8afdf | 1898 | ((must == prog->anchored_substr || must == prog->anchored_utf8) |
bf93d4cc GS |
1899 | ? "anchored" : "floating"), |
1900 | PL_colors[0], | |
1901 | (int)(SvCUR(must) - (SvTAIL(must)!=0)), | |
3f7c398e | 1902 | SvPVX_const(must), |
b7953727 JH |
1903 | PL_colors[1], (SvTAIL(must) ? "$" : "")) |
1904 | ); | |
6eb5f6b9 JH |
1905 | goto phooey; |
1906 | } | |
155aba94 | 1907 | else if ((c = prog->regstclass)) { |
f14c76ed RGS |
1908 | if (minlen) { |
1909 | I32 op = (U8)OP(prog->regstclass); | |
66e933ab | 1910 | /* don't bother with what can't match */ |
f14c76ed RGS |
1911 | if (PL_regkind[op] != EXACT && op != CANY) |
1912 | strend = HOPc(strend, -(minlen - 1)); | |
1913 | } | |
a3621e74 | 1914 | DEBUG_EXECUTE_r({ |
ffc61ed2 | 1915 | SV *prop = sv_newmortal(); |
cfd0369c NC |
1916 | const char *s0; |
1917 | const char *s1; | |
9e55ce06 JH |
1918 | int len0; |
1919 | int len1; | |
1920 | ||
32fc9b6a | 1921 | regprop(prog, prop, c); |
9e55ce06 | 1922 | s0 = UTF ? |
3f7c398e | 1923 | pv_uni_display(dsv0, (U8*)SvPVX_const(prop), SvCUR(prop), 60, |
c728cb41 | 1924 | UNI_DISPLAY_REGEX) : |
cfd0369c | 1925 | SvPVX_const(prop); |
9e55ce06 JH |
1926 | len0 = UTF ? SvCUR(dsv0) : SvCUR(prop); |
1927 | s1 = UTF ? | |
c728cb41 | 1928 | sv_uni_display(dsv1, sv, 60, UNI_DISPLAY_REGEX) : s; |
9e55ce06 JH |
1929 | len1 = UTF ? SvCUR(dsv1) : strend - s; |
1930 | PerlIO_printf(Perl_debug_log, | |
a0288114 | 1931 | "Matching stclass \"%*.*s\" against \"%*.*s\"\n", |
9e55ce06 JH |
1932 | len0, len0, s0, |
1933 | len1, len1, s1); | |
ffc61ed2 | 1934 | }); |
3b0527fe | 1935 | if (find_byclass(prog, c, s, strend, ®info)) |
6eb5f6b9 | 1936 | goto got_it; |
a3621e74 | 1937 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass...\n")); |
d6a28714 JH |
1938 | } |
1939 | else { | |
1940 | dontbother = 0; | |
a0714e2c | 1941 | if (prog->float_substr != NULL || prog->float_utf8 != NULL) { |
33b8afdf | 1942 | /* Trim the end. */ |
d6a28714 | 1943 | char *last; |
33b8afdf JH |
1944 | SV* float_real; |
1945 | ||
1946 | if (!(do_utf8 ? prog->float_utf8 : prog->float_substr)) | |
1947 | do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog); | |
1948 | float_real = do_utf8 ? prog->float_utf8 : prog->float_substr; | |
d6a28714 JH |
1949 | |
1950 | if (flags & REXEC_SCREAM) { | |
33b8afdf | 1951 | last = screaminstr(sv, float_real, s - strbeg, |
d6a28714 JH |
1952 | end_shift, &scream_pos, 1); /* last one */ |
1953 | if (!last) | |
ffc61ed2 | 1954 | last = scream_olds; /* Only one occurrence. */ |
4addbd3b HS |
1955 | /* we may be pointing at the wrong string */ |
1956 | else if (RX_MATCH_COPIED(prog)) | |
3f7c398e | 1957 | s = strbeg + (s - SvPVX_const(sv)); |
b8c5462f | 1958 | } |
d6a28714 JH |
1959 | else { |
1960 | STRLEN len; | |
cfd0369c | 1961 | const char * const little = SvPV_const(float_real, len); |
d6a28714 | 1962 | |
33b8afdf | 1963 | if (SvTAIL(float_real)) { |
d6a28714 JH |
1964 | if (memEQ(strend - len + 1, little, len - 1)) |
1965 | last = strend - len + 1; | |
7fba1cd6 | 1966 | else if (!multiline) |
9041c2e3 | 1967 | last = memEQ(strend - len, little, len) |
bd61b366 | 1968 | ? strend - len : NULL; |
b8c5462f | 1969 | else |
d6a28714 JH |
1970 | goto find_last; |
1971 | } else { | |
1972 | find_last: | |
9041c2e3 | 1973 | if (len) |
d6a28714 | 1974 | last = rninstr(s, strend, little, little + len); |
b8c5462f | 1975 | else |
a0288114 | 1976 | last = strend; /* matching "$" */ |
b8c5462f | 1977 | } |
b8c5462f | 1978 | } |
bf93d4cc | 1979 | if (last == NULL) { |
a3621e74 | 1980 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
bf93d4cc | 1981 | "%sCan't trim the tail, match fails (should not happen)%s\n", |
e4584336 | 1982 | PL_colors[4], PL_colors[5])); |
bf93d4cc GS |
1983 | goto phooey; /* Should not happen! */ |
1984 | } | |
d6a28714 JH |
1985 | dontbother = strend - last + prog->float_min_offset; |
1986 | } | |
1987 | if (minlen && (dontbother < minlen)) | |
1988 | dontbother = minlen - 1; | |
1989 | strend -= dontbother; /* this one's always in bytes! */ | |
1990 | /* We don't know much -- general case. */ | |
1aa99e6b | 1991 | if (do_utf8) { |
d6a28714 | 1992 | for (;;) { |
3b0527fe | 1993 | if (regtry(®info, s)) |
d6a28714 JH |
1994 | goto got_it; |
1995 | if (s >= strend) | |
1996 | break; | |
b8c5462f | 1997 | s += UTF8SKIP(s); |
d6a28714 JH |
1998 | }; |
1999 | } | |
2000 | else { | |
2001 | do { | |
3b0527fe | 2002 | if (regtry(®info, s)) |
d6a28714 JH |
2003 | goto got_it; |
2004 | } while (s++ < strend); | |
2005 | } | |
2006 | } | |
2007 | ||
2008 | /* Failure. */ | |
2009 | goto phooey; | |
2010 | ||
2011 | got_it: | |
2012 | RX_MATCH_TAINTED_set(prog, PL_reg_flags & RF_tainted); | |
2013 | ||
2014 | if (PL_reg_eval_set) { | |
2015 | /* Preserve the current value of $^R */ | |
2016 | if (oreplsv != GvSV(PL_replgv)) | |
2017 | sv_setsv(oreplsv, GvSV(PL_replgv));/* So that when GvSV(replgv) is | |
2018 | restored, the value remains | |
2019 | the same. */ | |
4f639d21 | 2020 | restore_pos(aTHX_ prog); |
d6a28714 JH |
2021 | } |
2022 | ||
2023 | /* make sure $`, $&, $', and $digit will work later */ | |
2024 | if ( !(flags & REXEC_NOT_FIRST) ) { | |
ed252734 | 2025 | RX_MATCH_COPY_FREE(prog); |
d6a28714 JH |
2026 | if (flags & REXEC_COPY_STR) { |
2027 | I32 i = PL_regeol - startpos + (stringarg - strbeg); | |
f8c7b90f | 2028 | #ifdef PERL_OLD_COPY_ON_WRITE |
ed252734 NC |
2029 | if ((SvIsCOW(sv) |
2030 | || (SvFLAGS(sv) & CAN_COW_MASK) == CAN_COW_FLAGS)) { | |
2031 | if (DEBUG_C_TEST) { | |
2032 | PerlIO_printf(Perl_debug_log, | |
2033 | "Copy on write: regexp capture, type %d\n", | |
2034 | (int) SvTYPE(sv)); | |
2035 | } | |
2036 | prog->saved_copy = sv_setsv_cow(prog->saved_copy, sv); | |
d5263905 | 2037 | prog->subbeg = (char *)SvPVX_const(prog->saved_copy); |
ed252734 NC |
2038 | assert (SvPOKp(prog->saved_copy)); |
2039 | } else | |
2040 | #endif | |
2041 | { | |
2042 | RX_MATCH_COPIED_on(prog); | |
2043 | s = savepvn(strbeg, i); | |
2044 | prog->subbeg = s; | |
2045 | } | |
d6a28714 | 2046 | prog->sublen = i; |
d6a28714 JH |
2047 | } |
2048 | else { | |
2049 | prog->subbeg = strbeg; | |
2050 | prog->sublen = PL_regeol - strbeg; /* strend may have been modified */ | |
2051 | } | |
2052 | } | |
9041c2e3 | 2053 | |
d6a28714 JH |
2054 | return 1; |
2055 | ||
2056 | phooey: | |
a3621e74 | 2057 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n", |
e4584336 | 2058 | PL_colors[4], PL_colors[5])); |
d6a28714 | 2059 | if (PL_reg_eval_set) |
4f639d21 | 2060 | restore_pos(aTHX_ prog); |
d6a28714 JH |
2061 | return 0; |
2062 | } | |
2063 | ||
2064 | /* | |
2065 | - regtry - try match at specific point | |
2066 | */ | |
2067 | STATIC I32 /* 0 failure, 1 success */ | |
3b0527fe | 2068 | S_regtry(pTHX_ const regmatch_info *reginfo, char *startpos) |
d6a28714 | 2069 | { |
97aff369 | 2070 | dVAR; |
d6a28714 JH |
2071 | register I32 *sp; |
2072 | register I32 *ep; | |
2073 | CHECKPOINT lastcp; | |
3b0527fe | 2074 | regexp *prog = reginfo->prog; |
a3621e74 | 2075 | GET_RE_DEBUG_FLAGS_DECL; |
d6a28714 | 2076 | |
02db2b7b IZ |
2077 | #ifdef DEBUGGING |
2078 | PL_regindent = 0; /* XXXX Not good when matches are reenterable... */ | |
2079 | #endif | |
d6a28714 JH |
2080 | if ((prog->reganch & ROPT_EVAL_SEEN) && !PL_reg_eval_set) { |
2081 | MAGIC *mg; | |
2082 | ||
2083 | PL_reg_eval_set = RS_init; | |
a3621e74 | 2084 | DEBUG_EXECUTE_r(DEBUG_s( |
b900a521 JH |
2085 | PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n", |
2086 | (IV)(PL_stack_sp - PL_stack_base)); | |
d6a28714 | 2087 | )); |
e8347627 | 2088 | SAVEI32(cxstack[cxstack_ix].blk_oldsp); |
d6a28714 JH |
2089 | cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base; |
2090 | /* Otherwise OP_NEXTSTATE will free whatever on stack now. */ | |
2091 | SAVETMPS; | |
2092 | /* Apparently this is not needed, judging by wantarray. */ | |
e8347627 | 2093 | /* SAVEI8(cxstack[cxstack_ix].blk_gimme); |
d6a28714 JH |
2094 | cxstack[cxstack_ix].blk_gimme = G_SCALAR; */ |
2095 | ||
3b0527fe | 2096 | if (reginfo->sv) { |
d6a28714 | 2097 | /* Make $_ available to executed code. */ |
3b0527fe | 2098 | if (reginfo->sv != DEFSV) { |
59f00321 | 2099 | SAVE_DEFSV; |
3b0527fe | 2100 | DEFSV = reginfo->sv; |
b8c5462f | 2101 | } |
d6a28714 | 2102 | |
3b0527fe DM |
2103 | if (!(SvTYPE(reginfo->sv) >= SVt_PVMG && SvMAGIC(reginfo->sv) |
2104 | && (mg = mg_find(reginfo->sv, PERL_MAGIC_regex_global)))) { | |
d6a28714 | 2105 | /* prepare for quick setting of pos */ |
d300d9fa NC |
2106 | #ifdef PERL_OLD_COPY_ON_WRITE |
2107 | if (SvIsCOW(sv)) | |
2108 | sv_force_normal_flags(sv, 0); | |
2109 | #endif | |
3b0527fe | 2110 | mg = sv_magicext(reginfo->sv, (SV*)0, PERL_MAGIC_regex_global, |
d300d9fa | 2111 | &PL_vtbl_mglob, NULL, 0); |
d6a28714 | 2112 | mg->mg_len = -1; |
b8c5462f | 2113 | } |
d6a28714 JH |
2114 | PL_reg_magic = mg; |
2115 | PL_reg_oldpos = mg->mg_len; | |
4f639d21 | 2116 | SAVEDESTRUCTOR_X(restore_pos, prog); |
d6a28714 | 2117 | } |
09687e5a | 2118 | if (!PL_reg_curpm) { |
a02a5408 | 2119 | Newxz(PL_reg_curpm, 1, PMOP); |
09687e5a AB |
2120 | #ifdef USE_ITHREADS |
2121 | { | |
2122 | SV* repointer = newSViv(0); | |
577e12cc | 2123 | /* so we know which PL_regex_padav element is PL_reg_curpm */ |
35061a7e | 2124 | SvFLAGS(repointer) |= SVf_BREAK; |
09687e5a AB |
2125 | av_push(PL_regex_padav,repointer); |
2126 | PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav); | |
2127 | PL_regex_pad = AvARRAY(PL_regex_padav); | |
2128 | } | |
2129 | #endif | |
2130 | } | |
aaa362c4 | 2131 | PM_SETRE(PL_reg_curpm, prog); |
d6a28714 JH |
2132 | PL_reg_oldcurpm = PL_curpm; |
2133 | PL_curpm = PL_reg_curpm; | |
2134 | if (RX_MATCH_COPIED(prog)) { | |
2135 | /* Here is a serious problem: we cannot rewrite subbeg, | |
2136 | since it may be needed if this match fails. Thus | |
2137 | $` inside (?{}) could fail... */ | |
2138 | PL_reg_oldsaved = prog->subbeg; | |
2139 | PL_reg_oldsavedlen = prog->sublen; | |
f8c7b90f | 2140 | #ifdef PERL_OLD_COPY_ON_WRITE |
ed252734 NC |
2141 | PL_nrs = prog->saved_copy; |
2142 | #endif | |
d6a28714 JH |
2143 | RX_MATCH_COPIED_off(prog); |
2144 | } | |
2145 | else | |
bd61b366 | 2146 | PL_reg_oldsaved = NULL; |
d6a28714 JH |
2147 | prog->subbeg = PL_bostr; |
2148 | prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */ | |
2149 | } | |
973dddac | 2150 | prog->startp[0] = startpos - PL_bostr; |
d6a28714 JH |
2151 | PL_reginput = startpos; |
2152 | PL_regstartp = prog->startp; | |
2153 | PL_regendp = prog->endp; | |
2154 | PL_reglastparen = &prog->lastparen; | |
a01268b5 | 2155 | PL_reglastcloseparen = &prog->lastcloseparen; |
d6a28714 | 2156 | prog->lastparen = 0; |
03994de8 | 2157 | prog->lastcloseparen = 0; |
d6a28714 | 2158 | PL_regsize = 0; |
a3621e74 | 2159 | DEBUG_EXECUTE_r(PL_reg_starttry = startpos); |
d6a28714 JH |
2160 | if (PL_reg_start_tmpl <= prog->nparens) { |
2161 | PL_reg_start_tmpl = prog->nparens*3/2 + 3; | |
2162 | if(PL_reg_start_tmp) | |
2163 | Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*); | |
2164 | else | |
a02a5408 | 2165 | Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*); |
d6a28714 JH |
2166 | } |
2167 | ||
2168 | /* XXXX What this code is doing here?!!! There should be no need | |
2169 | to do this again and again, PL_reglastparen should take care of | |
3dd2943c | 2170 | this! --ilya*/ |
dafc8851 JH |
2171 | |
2172 | /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code. | |
2173 | * Actually, the code in regcppop() (which Ilya may be meaning by | |
daf18116 JH |
2174 | * PL_reglastparen), is not needed at all by the test suite |
2175 | * (op/regexp, op/pat, op/split), but that code is needed, oddly | |
2176 | * enough, for building DynaLoader, or otherwise this | |
2177 | * "Error: '*' not in typemap in DynaLoader.xs, line 164" | |
2178 | * will happen. Meanwhile, this code *is* needed for the | |
2179 | * above-mentioned test suite tests to succeed. The common theme | |
2180 | * on those tests seems to be returning null fields from matches. | |
2181 | * --jhi */ | |
dafc8851 | 2182 | #if 1 |
d6a28714 JH |
2183 | sp = prog->startp; |
2184 | ep = prog->endp; | |
2185 | if (prog->nparens) { | |
097eb12c | 2186 | register I32 i; |
eb160463 | 2187 | for (i = prog->nparens; i > (I32)*PL_reglastparen; i--) { |
d6a28714 JH |
2188 | *++sp = -1; |
2189 | *++ep = -1; | |
2190 | } | |
2191 | } | |
dafc8851 | 2192 | #endif |
02db2b7b | 2193 | REGCP_SET(lastcp); |
3b0527fe | 2194 | if (regmatch(reginfo, prog->program + 1)) { |
d6a28714 JH |
2195 | prog->endp[0] = PL_reginput - PL_bostr; |
2196 | return 1; | |
2197 | } | |
02db2b7b | 2198 | REGCP_UNWIND(lastcp); |
d6a28714 JH |
2199 | return 0; |
2200 | } | |
2201 | ||
02db2b7b IZ |
2202 | #define RE_UNWIND_BRANCH 1 |
2203 | #define RE_UNWIND_BRANCHJ 2 | |
2204 | ||
2205 | union re_unwind_t; | |
2206 | ||
2207 | typedef struct { /* XX: makes sense to enlarge it... */ | |
2208 | I32 type; | |
2209 | I32 prev; | |
2210 | CHECKPOINT lastcp; | |
2211 | } re_unwind_generic_t; | |
2212 | ||
2213 | typedef struct { | |
2214 | I32 type; | |
2215 | I32 prev; | |
2216 | CHECKPOINT lastcp; | |
2217 | I32 lastparen; | |
2218 | regnode *next; | |
2219 | char *locinput; | |
2220 | I32 nextchr; | |
3a2830be | 2221 | int minmod; |
02db2b7b IZ |
2222 | #ifdef DEBUGGING |
2223 | int regindent; | |
2224 | #endif | |
2225 | } re_unwind_branch_t; | |
2226 | ||
2227 | typedef union re_unwind_t { | |
2228 | I32 type; | |
2229 | re_unwind_generic_t generic; | |
2230 | re_unwind_branch_t branch; | |
2231 | } re_unwind_t; | |
2232 | ||
8ba1375e MJD |
2233 | #define sayYES goto yes |
2234 | #define sayNO goto no | |
e0f9d4a8 | 2235 | #define sayNO_ANYOF goto no_anyof |
8ba1375e MJD |
2236 | #define sayYES_FINAL goto yes_final |
2237 | #define sayYES_LOUD goto yes_loud | |
2238 | #define sayNO_FINAL goto no_final | |
2239 | #define sayNO_SILENT goto do_no | |
2240 | #define saySAME(x) if (x) goto yes; else goto no | |
2241 | ||
3ab3c9b4 HS |
2242 | #define POSCACHE_SUCCESS 0 /* caching success rather than failure */ |
2243 | #define POSCACHE_SEEN 1 /* we know what we're caching */ | |
2244 | #define POSCACHE_START 2 /* the real cache: this bit maps to pos 0 */ | |
2245 | #define CACHEsayYES STMT_START { \ | |
d8319b27 | 2246 | if (st->u.whilem.cache_offset | st->u.whilem.cache_bit) { \ |
3ab3c9b4 HS |
2247 | if (!(PL_reg_poscache[0] & (1<<POSCACHE_SEEN))) \ |
2248 | PL_reg_poscache[0] |= (1<<POSCACHE_SUCCESS) || (1<<POSCACHE_SEEN); \ | |
2249 | else if (!(PL_reg_poscache[0] & (1<<POSCACHE_SUCCESS))) { \ | |
2250 | /* cache records failure, but this is success */ \ | |
2251 | DEBUG_r( \ | |
2252 | PerlIO_printf(Perl_debug_log, \ | |
2253 | "%*s (remove success from failure cache)\n", \ | |
2254 | REPORT_CODE_OFF+PL_regindent*2, "") \ | |
2255 | ); \ | |
d8319b27 | 2256 | PL_reg_poscache[st->u.whilem.cache_offset] &= ~(1<<st->u.whilem.cache_bit); \ |
3ab3c9b4 HS |
2257 | } \ |
2258 | } \ | |
2259 | sayYES; \ | |
2260 | } STMT_END | |
2261 | #define CACHEsayNO STMT_START { \ | |
d8319b27 | 2262 | if (st->u.whilem.cache_offset | st->u.whilem.cache_bit) { \ |
3ab3c9b4 HS |
2263 | if (!(PL_reg_poscache[0] & (1<<POSCACHE_SEEN))) \ |
2264 | PL_reg_poscache[0] |= (1<<POSCACHE_SEEN); \ | |
2265 | else if ((PL_reg_poscache[0] & (1<<POSCACHE_SUCCESS))) { \ | |
2266 | /* cache records success, but this is failure */ \ | |
2267 | DEBUG_r( \ | |
2268 | PerlIO_printf(Perl_debug_log, \ | |
2269 | "%*s (remove failure from success cache)\n", \ | |
2270 | REPORT_CODE_OFF+PL_regindent*2, "") \ | |
2271 | ); \ | |
d8319b27 | 2272 | PL_reg_poscache[st->u.whilem.cache_offset] &= ~(1<<st->u.whilem.cache_bit); \ |
3ab3c9b4 HS |
2273 | } \ |
2274 | } \ | |
2275 | sayNO; \ | |
2276 | } STMT_END | |
2277 | ||
a3621e74 YO |
2278 | /* this is used to determine how far from the left messages like |
2279 | 'failed...' are printed. Currently 29 makes these messages line | |
2280 | up with the opcode they refer to. Earlier perls used 25 which | |
2281 | left these messages outdented making reviewing a debug output | |
2282 | quite difficult. | |
2283 | */ | |
2284 | #define REPORT_CODE_OFF 29 | |
2285 | ||
2286 | ||
2287 | /* Make sure there is a test for this +1 options in re_tests */ | |
2288 | #define TRIE_INITAL_ACCEPT_BUFFLEN 4; | |
2289 | ||
86545054 DM |
2290 | #define SLAB_FIRST(s) (&(s)->states[0]) |
2291 | #define SLAB_LAST(s) (&(s)->states[PERL_REGMATCH_SLAB_SLOTS-1]) | |
2292 | ||
5d9a96ca DM |
2293 | /* grab a new slab and return the first slot in it */ |
2294 | ||
2295 | STATIC regmatch_state * | |
2296 | S_push_slab(pTHX) | |
2297 | { | |
2298 | regmatch_slab *s = PL_regmatch_slab->next; | |
2299 | if (!s) { | |
2300 | Newx(s, 1, regmatch_slab); | |
2301 | s->prev = PL_regmatch_slab; | |
2302 | s->next = NULL; | |
2303 | PL_regmatch_slab->next = s; | |
2304 | } | |
2305 | PL_regmatch_slab = s; | |
86545054 | 2306 | return SLAB_FIRST(s); |
5d9a96ca | 2307 | } |
5b47454d | 2308 | |
95b24440 DM |
2309 | /* simulate a recursive call to regmatch */ |
2310 | ||
2311 | #define REGMATCH(ns, where) \ | |
5d9a96ca DM |
2312 | st->scan = scan; \ |
2313 | scan = (ns); \ | |
2314 | st->resume_state = resume_##where; \ | |
95b24440 DM |
2315 | goto start_recurse; \ |
2316 | resume_point_##where: | |
2317 | ||
aa283a38 DM |
2318 | |
2319 | /* push a new regex state. Set newst to point to it */ | |
2320 | ||
2321 | #define PUSH_STATE(newst, resume) \ | |
2322 | depth++; \ | |
2323 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "PUSH STATE(%d)\n", depth)); \ | |
2324 | st->scan = scan; \ | |
2325 | st->next = next; \ | |
2326 | st->n = n; \ | |
2327 | st->locinput = locinput; \ | |
2328 | st->resume_state = resume; \ | |
2329 | newst = st+1; \ | |
86545054 | 2330 | if (newst > SLAB_LAST(PL_regmatch_slab)) \ |
aa283a38 DM |
2331 | newst = S_push_slab(aTHX); \ |
2332 | PL_regmatch_state = newst; \ | |
2333 | newst->cc = 0; \ | |
2334 | newst->minmod = 0; \ | |
2335 | newst->sw = 0; \ | |
2336 | newst->logical = 0; \ | |
2337 | newst->unwind = 0; \ | |
2338 | locinput = PL_reginput; \ | |
2339 | nextchr = UCHARAT(locinput); | |
2340 | ||
2341 | #define POP_STATE \ | |
2342 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "POP STATE(%d)\n", depth)); \ | |
2343 | depth--; \ | |
2344 | st--; \ | |
86545054 | 2345 | if (st < SLAB_FIRST(PL_regmatch_slab)) { \ |
aa283a38 | 2346 | PL_regmatch_slab = PL_regmatch_slab->prev; \ |
86545054 | 2347 | st = SLAB_LAST(PL_regmatch_slab); \ |
aa283a38 DM |
2348 | } \ |
2349 | PL_regmatch_state = st; \ | |
2350 | scan = st->scan; \ | |
2351 | next = st->next; \ | |
2352 | n = st->n; \ | |
2353 | locinput = st->locinput; \ | |
2354 | nextchr = UCHARAT(locinput); | |
2355 | ||
d6a28714 JH |
2356 | /* |
2357 | - regmatch - main matching routine | |
2358 | * | |
2359 | * Conceptually the strategy is simple: check to see whether the current | |
2360 | * node matches, call self recursively to see whether the rest matches, | |
2361 | * and then act accordingly. In practice we make some effort to avoid | |
2362 | * recursion, in particular by going through "ordinary" nodes (that don't | |
2363 | * need to know whether the rest of the match failed) by a loop instead of | |
2364 | * by recursion. | |
2365 | */ | |
2366 | /* [lwall] I've hoisted the register declarations to the outer block in order to | |
2367 | * maybe save a little bit of pushing and popping on the stack. It also takes | |
2368 | * advantage of machines that use a register save mask on subroutine entry. | |
95b24440 DM |
2369 | * |
2370 | * This function used to be heavily recursive, but since this had the | |
2371 | * effect of blowing the CPU stack on complex regexes, it has been | |
2372 | * restructured to be iterative, and to save state onto the heap rather | |
2373 | * than the stack. Essentially whereever regmatch() used to be called, it | |
2374 | * pushes the current state, notes where to return, then jumps back into | |
2375 | * the main loop. | |
2376 | * | |
2377 | * Originally the structure of this function used to look something like | |
2378 | ||
2379 | S_regmatch() { | |
2380 | int a = 1, b = 2; | |
2381 | ... | |
2382 | while (scan != NULL) { | |
5d9a96ca | 2383 | a++; // do stuff with a and b |
95b24440 DM |
2384 | ... |
2385 | switch (OP(scan)) { | |
2386 | case FOO: { | |
2387 | int local = 3; | |
2388 | ... | |
2389 | if (regmatch(...)) // recurse | |
2390 | goto yes; | |
2391 | } | |
2392 | ... | |
2393 | } | |
2394 | } | |
2395 | yes: | |
2396 | return 1; | |
2397 | } | |
2398 | ||
2399 | * Now it looks something like this: | |
2400 | ||
5d9a96ca | 2401 | typedef struct { |
95b24440 DM |
2402 | int a, b, local; |
2403 | int resume_state; | |
5d9a96ca | 2404 | } regmatch_state; |
95b24440 DM |
2405 | |
2406 | S_regmatch() { | |
5d9a96ca DM |
2407 | regmatch_state *st = new(); |
2408 | int depth=0; | |
2409 | st->a++; // do stuff with a and b | |
95b24440 DM |
2410 | ... |
2411 | while (scan != NULL) { | |
2412 | ... | |
2413 | switch (OP(scan)) { | |
2414 | case FOO: { | |
5d9a96ca | 2415 | st->local = 3; |
95b24440 | 2416 | ... |
5d9a96ca DM |
2417 | st->scan = scan; |
2418 | scan = ...; | |
2419 | st->resume_state = resume_FOO; | |
2420 | goto start_recurse; // recurse | |
95b24440 | 2421 | |
5d9a96ca DM |
2422 | resume_point_FOO: |
2423 | if (result) | |
95b24440 DM |
2424 | goto yes; |
2425 | } | |
2426 | ... | |
2427 | } | |
5d9a96ca DM |
2428 | start_recurse: |
2429 | st = new(); push a new state | |
2430 | st->a = 1; st->b = 2; | |
2431 | depth++; | |
95b24440 | 2432 | } |
5d9a96ca | 2433 | yes: |
95b24440 | 2434 | result = 1; |
5d9a96ca DM |
2435 | if (depth--) { |
2436 | st = pop(); | |
95b24440 DM |
2437 | switch (resume_state) { |
2438 | case resume_FOO: | |
2439 | goto resume_point_FOO; | |
2440 | ... | |
2441 | } | |
2442 | } | |
2443 | return result | |
2444 | } | |
2445 | ||
2446 | * WARNING: this means that any line in this function that contains a | |
2447 | * REGMATCH() or TRYPAREN() is actually simulating a recursive call to | |
2448 | * regmatch() using gotos instead. Thus the values of any local variables | |
2449 | * not saved in the regmatch_state structure will have been lost when | |
2450 | * execution resumes on the next line . | |
5d9a96ca DM |
2451 | * |
2452 | * States (ie the st pointer) are allocated in slabs of about 4K in size. | |
2453 | * PL_regmatch_state always points to the currently active state, and | |
2454 | * PL_regmatch_slab points to the slab currently containing PL_regmatch_state. | |
2455 | * The first time regmatch is called, the first slab is allocated, and is | |
2456 | * never freed until interpreter desctruction. When the slab is full, | |
2457 | * a new one is allocated chained to the end. At exit from regmatch, slabs | |
2458 | * allocated since entry are freed. | |
d6a28714 | 2459 | */ |
95b24440 DM |
2460 | |
2461 | ||
d6a28714 | 2462 | STATIC I32 /* 0 failure, 1 success */ |
3b0527fe | 2463 | S_regmatch(pTHX_ const regmatch_info *reginfo, regnode *prog) |
d6a28714 | 2464 | { |
27da23d5 | 2465 | dVAR; |
95b24440 | 2466 | register const bool do_utf8 = PL_reg_match_utf8; |
4ad0818d | 2467 | const U32 uniflags = UTF8_ALLOW_DEFAULT; |
95b24440 | 2468 | |
3b0527fe DM |
2469 | regexp *rex = reginfo->prog; |
2470 | ||
5d9a96ca DM |
2471 | regmatch_slab *orig_slab; |
2472 | regmatch_state *orig_state; | |
a3621e74 | 2473 | |
5d9a96ca DM |
2474 | /* the current state. This is a cached copy of PL_regmatch_state */ |
2475 | register regmatch_state *st; | |
95b24440 | 2476 | |
5d9a96ca DM |
2477 | /* cache heavy used fields of st in registers */ |
2478 | register regnode *scan; | |
2479 | register regnode *next; | |
2480 | register I32 n = 0; /* initialize to shut up compiler warning */ | |
2481 | register char *locinput = PL_reginput; | |
95b24440 | 2482 | |
5d9a96ca DM |
2483 | /* these variables are NOT saved during a recusive RFEGMATCH: */ |
2484 | register I32 nextchr; /* is always set to UCHARAT(locinput) */ | |
2485 | bool result; /* return value of S_regmatch */ | |
2486 | regnode *inner; /* Next node in internal branch. */ | |
2487 | int depth = 0; /* depth of recursion */ | |
aa283a38 DM |
2488 | regmatch_state *newst; /* when pushing a state, this is the new one */ |
2489 | regmatch_state *cur_eval = NULL; /* most recent (??{}) state */ | |
95b24440 DM |
2490 | |
2491 | #ifdef DEBUGGING | |
ab74612d | 2492 | SV *re_debug_flags = NULL; |
a3621e74 | 2493 | GET_RE_DEBUG_FLAGS; |
d6a28714 JH |
2494 | PL_regindent++; |
2495 | #endif | |
2496 | ||
5d9a96ca DM |
2497 | /* on first ever call to regmatch, allocate first slab */ |
2498 | if (!PL_regmatch_slab) { | |
2499 | Newx(PL_regmatch_slab, 1, regmatch_slab); | |
2500 | PL_regmatch_slab->prev = NULL; | |
2501 | PL_regmatch_slab->next = NULL; | |
86545054 | 2502 | PL_regmatch_state = SLAB_FIRST(PL_regmatch_slab); |
5d9a96ca DM |
2503 | } |
2504 | ||
2505 | /* remember current high-water mark for exit */ | |
2506 | /* XXX this should be done with SAVE* instead */ | |
2507 | orig_slab = PL_regmatch_slab; | |
2508 | orig_state = PL_regmatch_state; | |
2509 | ||
2510 | /* grab next free state slot */ | |
2511 | st = ++PL_regmatch_state; | |
86545054 | 2512 | if (st > SLAB_LAST(PL_regmatch_slab)) |
5d9a96ca DM |
2513 | st = PL_regmatch_state = S_push_slab(aTHX); |
2514 | ||
2515 | st->minmod = 0; | |
2516 | st->sw = 0; | |
2517 | st->logical = 0; | |
2518 | st->unwind = 0; | |
2519 | st->cc = NULL; | |
d6a28714 JH |
2520 | /* Note that nextchr is a byte even in UTF */ |
2521 | nextchr = UCHARAT(locinput); | |
2522 | scan = prog; | |
2523 | while (scan != NULL) { | |
8ba1375e | 2524 | |
a3621e74 | 2525 | DEBUG_EXECUTE_r( { |
6136c704 | 2526 | SV * const prop = sv_newmortal(); |
1df70142 AL |
2527 | const int docolor = *PL_colors[0]; |
2528 | const int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */ | |
1aa99e6b | 2529 | int l = (PL_regeol - locinput) > taill ? taill : (PL_regeol - locinput); |
d6a28714 JH |
2530 | /* The part of the string before starttry has one color |
2531 | (pref0_len chars), between starttry and current | |
2532 | position another one (pref_len - pref0_len chars), | |
2533 | after the current position the third one. | |
2534 | We assume that pref0_len <= pref_len, otherwise we | |
2535 | decrease pref0_len. */ | |
9041c2e3 | 2536 | int pref_len = (locinput - PL_bostr) > (5 + taill) - l |
1aa99e6b IH |
2537 | ? (5 + taill) - l : locinput - PL_bostr; |
2538 | int pref0_len; | |
d6a28714 | 2539 | |
df1ffd02 | 2540 | while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len))) |
1aa99e6b IH |
2541 | pref_len++; |
2542 | pref0_len = pref_len - (locinput - PL_reg_starttry); | |
d6a28714 | 2543 | if (l + pref_len < (5 + taill) && l < PL_regeol - locinput) |
9041c2e3 | 2544 | l = ( PL_regeol - locinput > (5 + taill) - pref_len |
d6a28714 | 2545 | ? (5 + taill) - pref_len : PL_regeol - locinput); |
df1ffd02 | 2546 | while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput + l))) |
1aa99e6b | 2547 | l--; |
d6a28714 JH |
2548 | if (pref0_len < 0) |
2549 | pref0_len = 0; | |
2550 | if (pref0_len > pref_len) | |
2551 | pref0_len = pref_len; | |
32fc9b6a | 2552 | regprop(rex, prop, scan); |
2a782b5b | 2553 | { |
1df70142 | 2554 | const char * const s0 = |
f14c76ed | 2555 | do_utf8 && OP(scan) != CANY ? |
95b24440 | 2556 | pv_uni_display(PERL_DEBUG_PAD(0), (U8*)(locinput - pref_len), |
c728cb41 | 2557 | pref0_len, 60, UNI_DISPLAY_REGEX) : |
2a782b5b | 2558 | locinput - pref_len; |
1df70142 AL |
2559 | const int len0 = do_utf8 ? strlen(s0) : pref0_len; |
2560 | const char * const s1 = do_utf8 && OP(scan) != CANY ? | |
95b24440 DM |
2561 | pv_uni_display(PERL_DEBUG_PAD(1), |
2562 | (U8*)(locinput - pref_len + pref0_len), | |
c728cb41 | 2563 | pref_len - pref0_len, 60, UNI_DISPLAY_REGEX) : |
2a782b5b | 2564 | locinput - pref_len + pref0_len; |
1df70142 AL |
2565 | const int len1 = do_utf8 ? strlen(s1) : pref_len - pref0_len; |
2566 | const char * const s2 = do_utf8 && OP(scan) != CANY ? | |
95b24440 | 2567 | pv_uni_display(PERL_DEBUG_PAD(2), (U8*)locinput, |
c728cb41 | 2568 | PL_regeol - locinput, 60, UNI_DISPLAY_REGEX) : |
2a782b5b | 2569 | locinput; |
1df70142 | 2570 | const int len2 = do_utf8 ? strlen(s2) : l; |
2a782b5b JH |
2571 | PerlIO_printf(Perl_debug_log, |
2572 | "%4"IVdf" <%s%.*s%s%s%.*s%s%s%s%.*s%s>%*s|%3"IVdf":%*s%s\n", | |
2573 | (IV)(locinput - PL_bostr), | |
2574 | PL_colors[4], | |
2575 | len0, s0, | |
2576 | PL_colors[5], | |
2577 | PL_colors[2], | |
2578 | len1, s1, | |
2579 | PL_colors[3], | |
2580 | (docolor ? "" : "> <"), | |
2581 | PL_colors[0], | |
2582 | len2, s2, | |
2583 | PL_colors[1], | |
2584 | 15 - l - pref_len + 1, | |
2585 | "", | |
4f639d21 | 2586 | (IV)(scan - rex->program), PL_regindent*2, "", |
3f7c398e | 2587 | SvPVX_const(prop)); |
2a782b5b JH |
2588 | } |
2589 | }); | |
d6a28714 JH |
2590 | |
2591 | next = scan + NEXT_OFF(scan); | |
2592 | if (next == scan) | |
2593 | next = NULL; | |
2594 | ||
2595 | switch (OP(scan)) { | |
2596 | case BOL: | |
7fba1cd6 | 2597 | if (locinput == PL_bostr) |
d6a28714 | 2598 | { |
3b0527fe | 2599 | /* reginfo->till = reginfo->bol; */ |
b8c5462f JH |
2600 | break; |
2601 | } | |
d6a28714 JH |
2602 | sayNO; |
2603 | case MBOL: | |
12d33761 HS |
2604 | if (locinput == PL_bostr || |
2605 | ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n')) | |
d6a28714 | 2606 | { |
b8c5462f JH |
2607 | break; |
2608 | } | |
d6a28714 JH |
2609 | sayNO; |
2610 | case SBOL: | |
c2a73568 | 2611 | if (locinput == PL_bostr) |
b8c5462f | 2612 | break; |
d6a28714 JH |
2613 | sayNO; |
2614 | case GPOS: | |
3b0527fe | 2615 | if (locinput == reginfo->ganch) |
d6a28714 JH |
2616 | break; |
2617 | sayNO; | |
2618 | case EOL: | |
d6a28714 JH |
2619 | goto seol; |
2620 | case MEOL: | |
d6a28714 | 2621 | if ((nextchr || locinput < PL_regeol) && nextchr != '\n') |
b8c5462f | 2622 | sayNO; |
b8c5462f | 2623 | break; |
d6a28714 JH |
2624 | case SEOL: |
2625 | seol: | |
2626 | if ((nextchr || locinput < PL_regeol) && nextchr != '\n') | |
b8c5462f | 2627 | sayNO; |
d6a28714 | 2628 | if (PL_regeol - locinput > 1) |
b8c5462f | 2629 | sayNO; |
b8c5462f | 2630 | break; |
d6a28714 JH |
2631 | case EOS: |
2632 | if (PL_regeol != locinput) | |
b8c5462f | 2633 | sayNO; |
d6a28714 | 2634 | break; |
ffc61ed2 | 2635 | case SANY: |
d6a28714 | 2636 | if (!nextchr && locinput >= PL_regeol) |
4633a7c4 | 2637 | sayNO; |
f33976b4 DB |
2638 | if (do_utf8) { |
2639 | locinput += PL_utf8skip[nextchr]; | |
2640 | if (locinput > PL_regeol) | |
2641 | sayNO; | |
2642 | nextchr = UCHARAT(locinput); | |
2643 | } | |
2644 | else | |
2645 | nextchr = UCHARAT(++locinput); | |
2646 | break; | |
2647 | case CANY: | |
2648 | if (!nextchr && locinput >= PL_regeol) | |
2649 | sayNO; | |
b8c5462f | 2650 | nextchr = UCHARAT(++locinput); |
a0d0e21e | 2651 | break; |
ffc61ed2 | 2652 | case REG_ANY: |
1aa99e6b IH |
2653 | if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n') |
2654 | sayNO; | |
2655 | if (do_utf8) { | |
b8c5462f | 2656 | locinput += PL_utf8skip[nextchr]; |
d6a28714 JH |
2657 | if (locinput > PL_regeol) |
2658 | sayNO; | |
a0ed51b3 | 2659 | nextchr = UCHARAT(locinput); |
a0ed51b3 | 2660 | } |
1aa99e6b IH |
2661 | else |
2662 | nextchr = UCHARAT(++locinput); | |
a0ed51b3 | 2663 | break; |
a3621e74 YO |
2664 | |
2665 | ||
2666 | ||
2667 | /* | |
2668 | traverse the TRIE keeping track of all accepting states | |
2669 | we transition through until we get to a failing node. | |
2670 | ||
a3621e74 YO |
2671 | |
2672 | */ | |
5b47454d | 2673 | case TRIE: |
a3621e74 YO |
2674 | case TRIEF: |
2675 | case TRIEFL: | |
2676 | { | |
a3621e74 YO |
2677 | U8 *uc = ( U8* )locinput; |
2678 | U32 state = 1; | |
2679 | U16 charid = 0; | |
2680 | U32 base = 0; | |
2681 | UV uvc = 0; | |
2682 | STRLEN len = 0; | |
2683 | STRLEN foldlen = 0; | |
a3621e74 YO |
2684 | U8 *uscan = (U8*)NULL; |
2685 | STRLEN bufflen=0; | |
95b24440 | 2686 | SV *sv_accept_buff = NULL; |
5b47454d DM |
2687 | const enum { trie_plain, trie_utf8, trie_uft8_fold } |
2688 | trie_type = do_utf8 ? | |
2689 | (OP(scan) == TRIE ? trie_utf8 : trie_uft8_fold) | |
2690 | : trie_plain; | |
2691 | ||
7087a21c NC |
2692 | /* what trie are we using right now */ |
2693 | reg_trie_data *trie | |
32fc9b6a | 2694 | = (reg_trie_data*)rex->data->data[ ARG( scan ) ]; |
d8319b27 | 2695 | st->u.trie.accepted = 0; /* how many accepting states we have seen */ |
95b24440 | 2696 | result = 0; |
a3621e74 YO |
2697 | |
2698 | while ( state && uc <= (U8*)PL_regeol ) { | |
2699 | ||
5b47454d | 2700 | if (trie->states[ state ].wordnum) { |
d8319b27 | 2701 | if (!st->u.trie.accepted ) { |
5b47454d DM |
2702 | ENTER; |
2703 | SAVETMPS; | |
2704 | bufflen = TRIE_INITAL_ACCEPT_BUFFLEN; | |
2705 | sv_accept_buff=newSV(bufflen * | |
2706 | sizeof(reg_trie_accepted) - 1); | |
2707 | SvCUR_set(sv_accept_buff, | |
2708 | sizeof(reg_trie_accepted)); | |
2709 | SvPOK_on(sv_accept_buff); | |
2710 | sv_2mortal(sv_accept_buff); | |
d8319b27 | 2711 | st->u.trie.accept_buff = |
5b47454d DM |
2712 | (reg_trie_accepted*)SvPV_nolen(sv_accept_buff ); |
2713 | } | |
2714 | else { | |
d8319b27 | 2715 | if (st->u.trie.accepted >= bufflen) { |
5b47454d | 2716 | bufflen *= 2; |
d8319b27 | 2717 | st->u.trie.accept_buff =(reg_trie_accepted*) |
5b47454d DM |
2718 | SvGROW(sv_accept_buff, |
2719 | bufflen * sizeof(reg_trie_accepted)); | |
2720 | } | |
2721 | SvCUR_set(sv_accept_buff,SvCUR(sv_accept_buff) | |
2722 | + sizeof(reg_trie_accepted)); | |
2723 | } | |
d8319b27 DM |
2724 | st->u.trie.accept_buff[st->u.trie.accepted].wordnum = trie->states[state].wordnum; |
2725 | st->u.trie.accept_buff[st->u.trie.accepted].endpos = uc; | |
2726 | ++st->u.trie.accepted; | |
5b47454d | 2727 | } |
a3621e74 YO |
2728 | |
2729 | base = trie->states[ state ].trans.base; | |
2730 | ||
2731 | DEBUG_TRIE_EXECUTE_r( | |
2732 | PerlIO_printf( Perl_debug_log, | |
e4584336 | 2733 | "%*s %sState: %4"UVxf", Base: %4"UVxf", Accepted: %4"UVxf" ", |
a3621e74 | 2734 | REPORT_CODE_OFF + PL_regindent * 2, "", PL_colors[4], |
d8319b27 | 2735 | (UV)state, (UV)base, (UV)st->u.trie.accepted ); |
a3621e74 YO |
2736 | ); |
2737 | ||
2738 | if ( base ) { | |
5b47454d DM |
2739 | switch (trie_type) { |
2740 | case trie_uft8_fold: | |
a3621e74 YO |
2741 | if ( foldlen>0 ) { |
2742 | uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); | |
2743 | foldlen -= len; | |
2744 | uscan += len; | |
2745 | len=0; | |
2746 | } else { | |
1df70142 | 2747 | U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ]; |
a3621e74 YO |
2748 | uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); |
2749 | uvc = to_uni_fold( uvc, foldbuf, &foldlen ); | |
2750 | foldlen -= UNISKIP( uvc ); | |
2751 | uscan = foldbuf + UNISKIP( uvc ); | |
2752 | } | |
5b47454d DM |
2753 | break; |
2754 | case trie_utf8: | |
2755 | uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, | |
2756 | &len, uniflags ); | |
2757 | break; | |
2758 | case trie_plain: | |
e4584336 | 2759 | uvc = (UV)*uc; |
a3621e74 YO |
2760 | len = 1; |
2761 | } | |
2762 | ||
5b47454d DM |
2763 | if (uvc < 256) { |
2764 | charid = trie->charmap[ uvc ]; | |
2765 | } | |
2766 | else { | |
2767 | charid = 0; | |
2768 | if (trie->widecharmap) { | |
2769 | SV** svpp = (SV**)NULL; | |
2770 | svpp = hv_fetch(trie->widecharmap, | |
2771 | (char*)&uvc, sizeof(UV), 0); | |
2772 | if (svpp) | |
2773 | charid = (U16)SvIV(*svpp); | |
2774 | } | |
2775 | } | |
a3621e74 | 2776 | |
5b47454d DM |
2777 | if (charid && |
2778 | (base + charid > trie->uniquecharcount ) | |
2779 | && (base + charid - 1 - trie->uniquecharcount | |
2780 | < trie->lasttrans) | |
2781 | && trie->trans[base + charid - 1 - | |
2782 | trie->uniquecharcount].check == state) | |
2783 | { | |
2784 | state = trie->trans[base + charid - 1 - | |
2785 | trie->uniquecharcount ].next; | |
2786 | } | |
2787 | else { | |
2788 | state = 0; | |
2789 | } | |
2790 | uc += len; | |
2791 | ||
2792 | } | |
2793 | else { | |
a3621e74 YO |
2794 | state = 0; |
2795 | } | |
2796 | DEBUG_TRIE_EXECUTE_r( | |
e4584336 RB |
2797 | PerlIO_printf( Perl_debug_log, |
2798 | "Charid:%3x CV:%4"UVxf" After State: %4"UVxf"%s\n", | |
2799 | charid, uvc, (UV)state, PL_colors[5] ); | |
a3621e74 YO |
2800 | ); |
2801 | } | |
d8319b27 | 2802 | if (!st->u.trie.accepted ) |
a3621e74 | 2803 | sayNO; |
a3621e74 YO |
2804 | |
2805 | /* | |
2806 | There was at least one accepting state that we | |
2807 | transitioned through. Presumably the number of accepting | |
2808 | states is going to be low, typically one or two. So we | |
2809 | simply scan through to find the one with lowest wordnum. | |
2810 | Once we find it, we swap the last state into its place | |
2811 | and decrement the size. We then try to match the rest of | |
2812 | the pattern at the point where the word ends, if we | |
2813 | succeed then we end the loop, otherwise the loop | |
2814 | eventually terminates once all of the accepting states | |
2815 | have been tried. | |
2816 | */ | |
a3621e74 | 2817 | |
d8319b27 | 2818 | if ( st->u.trie.accepted == 1 ) { |
a3621e74 | 2819 | DEBUG_EXECUTE_r({ |
097eb12c | 2820 | SV ** const tmp = av_fetch( trie->words, st->u.trie.accept_buff[ 0 ].wordnum-1, 0 ); |
a3621e74 YO |
2821 | PerlIO_printf( Perl_debug_log, |
2822 | "%*s %sonly one match : #%d <%s>%s\n", | |
e4584336 | 2823 | REPORT_CODE_OFF+PL_regindent*2, "", PL_colors[4], |
d8319b27 | 2824 | st->u.trie.accept_buff[ 0 ].wordnum, |
cfd0369c | 2825 | tmp ? SvPV_nolen_const( *tmp ) : "not compiled under -Dr", |
a3621e74 YO |
2826 | PL_colors[5] ); |
2827 | }); | |
d8319b27 | 2828 | PL_reginput = (char *)st->u.trie.accept_buff[ 0 ].endpos; |
a3621e74 YO |
2829 | /* in this case we free tmps/leave before we call regmatch |
2830 | as we wont be using accept_buff again. */ | |
2831 | FREETMPS; | |
2832 | LEAVE; | |
95b24440 DM |
2833 | REGMATCH(scan + NEXT_OFF(scan), TRIE1); |
2834 | /*** all unsaved local vars undefined at this point */ | |
a3621e74 YO |
2835 | } else { |
2836 | DEBUG_EXECUTE_r( | |
e4584336 | 2837 | PerlIO_printf( Perl_debug_log,"%*s %sgot %"IVdf" possible matches%s\n", |
d8319b27 | 2838 | REPORT_CODE_OFF + PL_regindent * 2, "", PL_colors[4], (IV)st->u.trie.accepted, |
a3621e74 YO |
2839 | PL_colors[5] ); |
2840 | ); | |
d8319b27 | 2841 | while ( !result && st->u.trie.accepted-- ) { |
a3621e74 YO |
2842 | U32 best = 0; |
2843 | U32 cur; | |
d8319b27 | 2844 | for( cur = 1 ; cur <= st->u.trie.accepted ; cur++ ) { |
e4584336 RB |
2845 | DEBUG_TRIE_EXECUTE_r( |
2846 | PerlIO_printf( Perl_debug_log, | |
2847 | "%*s %sgot %"IVdf" (%d) as best, looking at %"IVdf" (%d)%s\n", | |
2848 | REPORT_CODE_OFF + PL_regindent * 2, "", PL_colors[4], | |
d8319b27 DM |
2849 | (IV)best, st->u.trie.accept_buff[ best ].wordnum, (IV)cur, |
2850 | st->u.trie.accept_buff[ cur ].wordnum, PL_colors[5] ); | |
e4584336 | 2851 | ); |
a3621e74 | 2852 | |
d8319b27 DM |
2853 | if (st->u.trie.accept_buff[cur].wordnum < |
2854 | st->u.trie.accept_buff[best].wordnum) | |
e822a8b4 | 2855 | best = cur; |
a3621e74 YO |
2856 | } |
2857 | DEBUG_EXECUTE_r({ | |
87830502 | 2858 | reg_trie_data * const trie = (reg_trie_data*) |
32fc9b6a | 2859 | rex->data->data[ARG(scan)]; |
d8319b27 | 2860 | SV ** const tmp = av_fetch( trie->words, st->u.trie.accept_buff[ best ].wordnum - 1, 0 ); |
a3621e74 | 2861 | PerlIO_printf( Perl_debug_log, "%*s %strying alternation #%d <%s> at 0x%p%s\n", |
e4584336 | 2862 | REPORT_CODE_OFF+PL_regindent*2, "", PL_colors[4], |
d8319b27 | 2863 | st->u.trie.accept_buff[best].wordnum, |
cfd0369c | 2864 | tmp ? SvPV_nolen_const( *tmp ) : "not compiled under -Dr",scan, |
a3621e74 YO |
2865 | PL_colors[5] ); |
2866 | }); | |
d8319b27 DM |
2867 | if ( best<st->u.trie.accepted ) { |
2868 | reg_trie_accepted tmp = st->u.trie.accept_buff[ best ]; | |
2869 | st->u.trie.accept_buff[ best ] = st->u.trie.accept_buff[ st->u.trie.accepted ]; | |
2870 | st->u.trie.accept_buff[ st->u.trie.accepted ] = tmp; | |
2871 | best = st->u.trie.accepted; | |
a3621e74 | 2872 | } |
d8319b27 | 2873 | PL_reginput = (char *)st->u.trie.accept_buff[ best ].endpos; |
a3621e74 YO |
2874 | |
2875 | /* | |
2876 | as far as I can tell we only need the SAVETMPS/FREETMPS | |
2877 | for re's with EVAL in them but I'm leaving them in for | |
2878 | all until I can be sure. | |
2879 | */ | |
2880 | SAVETMPS; | |
95b24440 DM |
2881 | REGMATCH(scan + NEXT_OFF(scan), TRIE2); |
2882 | /*** all unsaved local vars undefined at this point */ | |
a3621e74 YO |
2883 | FREETMPS; |
2884 | } | |
2885 | FREETMPS; | |
2886 | LEAVE; | |
2887 | } | |
2888 | ||
95b24440 | 2889 | if (result) { |
a3621e74 YO |
2890 | sayYES; |
2891 | } else { | |
2892 | sayNO; | |
2893 | } | |
2894 | } | |
2895 | /* unreached codepoint */ | |
95b24440 DM |
2896 | case EXACT: { |
2897 | char *s = STRING(scan); | |
5d9a96ca | 2898 | st->ln = STR_LEN(scan); |
eb160463 | 2899 | if (do_utf8 != UTF) { |
bc517b45 | 2900 | /* The target and the pattern have differing utf8ness. */ |
1aa99e6b | 2901 | char *l = locinput; |
5d9a96ca | 2902 | const char *e = s + st->ln; |
a72c7584 | 2903 | |
5ff6fc6d JH |
2904 | if (do_utf8) { |
2905 | /* The target is utf8, the pattern is not utf8. */ | |
1aa99e6b | 2906 | while (s < e) { |
a3b680e6 | 2907 | STRLEN ulen; |
1aa99e6b | 2908 | if (l >= PL_regeol) |
5ff6fc6d JH |
2909 | sayNO; |
2910 | if (NATIVE_TO_UNI(*(U8*)s) != | |
89ebb4a3 | 2911 | utf8n_to_uvuni((U8*)l, UTF8_MAXBYTES, &ulen, |
041457d9 | 2912 | uniflags)) |
5ff6fc6d | 2913 | sayNO; |
bc517b45 | 2914 | l += ulen; |
5ff6fc6d | 2915 | s ++; |
1aa99e6b | 2916 | } |
5ff6fc6d JH |
2917 | } |
2918 | else { | |
2919 | /* The target is not utf8, the pattern is utf8. */ | |
1aa99e6b | 2920 | while (s < e) { |
a3b680e6 | 2921 | STRLEN ulen; |
1aa99e6b IH |
2922 | if (l >= PL_regeol) |
2923 | sayNO; | |
5ff6fc6d | 2924 | if (NATIVE_TO_UNI(*((U8*)l)) != |
89ebb4a3 | 2925 | utf8n_to_uvuni((U8*)s, UTF8_MAXBYTES, &ulen, |
041457d9 | 2926 | uniflags)) |
1aa99e6b | 2927 | sayNO; |
bc517b45 | 2928 | s += ulen; |
a72c7584 | 2929 | l ++; |
1aa99e6b | 2930 | } |
5ff6fc6d | 2931 | } |
1aa99e6b IH |
2932 | locinput = l; |
2933 | nextchr = UCHARAT(locinput); | |
2934 | break; | |
2935 | } | |
bc517b45 | 2936 | /* The target and the pattern have the same utf8ness. */ |
d6a28714 JH |
2937 | /* Inline the first character, for speed. */ |
2938 | if (UCHARAT(s) != nextchr) | |
2939 | sayNO; | |
5d9a96ca | 2940 | if (PL_regeol - locinput < st->ln) |
d6a28714 | 2941 | sayNO; |
5d9a96ca | 2942 | if (st->ln > 1 && memNE(s, locinput, st->ln)) |
d6a28714 | 2943 | sayNO; |
5d9a96ca | 2944 | locinput += st->ln; |
d6a28714 JH |
2945 | nextchr = UCHARAT(locinput); |
2946 | break; | |
95b24440 | 2947 | } |
d6a28714 | 2948 | case EXACTFL: |
b8c5462f JH |
2949 | PL_reg_flags |= RF_tainted; |
2950 | /* FALL THROUGH */ | |
95b24440 DM |
2951 | case EXACTF: { |
2952 | char *s = STRING(scan); | |
5d9a96ca | 2953 | st->ln = STR_LEN(scan); |
d6a28714 | 2954 | |
d07ddd77 JH |
2955 | if (do_utf8 || UTF) { |
2956 | /* Either target or the pattern are utf8. */ | |
d6a28714 | 2957 | char *l = locinput; |
d07ddd77 | 2958 | char *e = PL_regeol; |
bc517b45 | 2959 | |
5d9a96ca | 2960 | if (ibcmp_utf8(s, 0, st->ln, (bool)UTF, |
1feea2c7 | 2961 | l, &e, 0, do_utf8)) { |
5486206c JH |
2962 | /* One more case for the sharp s: |
2963 | * pack("U0U*", 0xDF) =~ /ss/i, | |
2964 | * the 0xC3 0x9F are the UTF-8 | |
2965 | * byte sequence for the U+00DF. */ | |
2966 | if (!(do_utf8 && | |
2967 | toLOWER(s[0]) == 's' && | |
5d9a96ca | 2968 | st->ln >= 2 && |
5486206c JH |
2969 | toLOWER(s[1]) == 's' && |
2970 | (U8)l[0] == 0xC3 && | |
2971 | e - l >= 2 && | |
2972 | (U8)l[1] == 0x9F)) | |
2973 | sayNO; | |
2974 | } | |
d07ddd77 JH |
2975 | locinput = e; |
2976 | nextchr = UCHARAT(locinput); | |
2977 | break; | |
a0ed51b3 | 2978 | } |
d6a28714 | 2979 | |
bc517b45 JH |
2980 | /* Neither the target and the pattern are utf8. */ |
2981 | ||
d6a28714 JH |
2982 | /* Inline the first character, for speed. */ |
2983 | if (UCHARAT(s) != nextchr && | |
2984 | UCHARAT(s) != ((OP(scan) == EXACTF) | |
2985 | ? PL_fold : PL_fold_locale)[nextchr]) | |
a0ed51b3 | 2986 | sayNO; |
5d9a96ca | 2987 | if (PL_regeol - locinput < st->ln) |
b8c5462f | 2988 | sayNO; |
5d9a96ca DM |
2989 | if (st->ln > 1 && (OP(scan) == EXACTF |
2990 | ? ibcmp(s, locinput, st->ln) | |
2991 | : ibcmp_locale(s, locinput, st->ln))) | |
4633a7c4 | 2992 | sayNO; |
5d9a96ca | 2993 | locinput += st->ln; |
d6a28714 | 2994 | nextchr = UCHARAT(locinput); |
a0d0e21e | 2995 | break; |
95b24440 | 2996 | } |
d6a28714 | 2997 | case ANYOF: |
ffc61ed2 | 2998 | if (do_utf8) { |
9e55ce06 JH |
2999 | STRLEN inclasslen = PL_regeol - locinput; |
3000 | ||
32fc9b6a | 3001 | if (!reginclass(rex, scan, (U8*)locinput, &inclasslen, do_utf8)) |
e0f9d4a8 | 3002 | sayNO_ANYOF; |
ffc61ed2 JH |
3003 | if (locinput >= PL_regeol) |
3004 | sayNO; | |
0f0076b4 | 3005 | locinput += inclasslen ? inclasslen : UTF8SKIP(locinput); |
b8c5462f | 3006 | nextchr = UCHARAT(locinput); |
e0f9d4a8 | 3007 | break; |
ffc61ed2 JH |
3008 | } |
3009 | else { | |
3010 | if (nextchr < 0) | |
3011 | nextchr = UCHARAT(locinput); | |
32fc9b6a | 3012 | if (!REGINCLASS(rex, scan, (U8*)locinput)) |
e0f9d4a8 | 3013 | sayNO_ANYOF; |
ffc61ed2 JH |
3014 | if (!nextchr && locinput >= PL_regeol) |
3015 | sayNO; | |
3016 | nextchr = UCHARAT(++locinput); | |
e0f9d4a8 JH |
3017 | break; |
3018 | } | |
3019 | no_anyof: | |
3020 | /* If we might have the case of the German sharp s | |
3021 | * in a casefolding Unicode character class. */ | |
3022 | ||
ebc501f0 JH |
3023 | if (ANYOF_FOLD_SHARP_S(scan, locinput, PL_regeol)) { |
3024 | locinput += SHARP_S_SKIP; | |
e0f9d4a8 | 3025 | nextchr = UCHARAT(locinput); |
ffc61ed2 | 3026 | } |
e0f9d4a8 JH |
3027 | else |
3028 | sayNO; | |
b8c5462f | 3029 | break; |
d6a28714 | 3030 | case ALNUML: |
b8c5462f JH |
3031 | PL_reg_flags |= RF_tainted; |
3032 | /* FALL THROUGH */ | |
d6a28714 | 3033 | case ALNUM: |
b8c5462f | 3034 | if (!nextchr) |
4633a7c4 | 3035 | sayNO; |
ffc61ed2 | 3036 | if (do_utf8) { |
1a4fad37 | 3037 | LOAD_UTF8_CHARCLASS_ALNUM(); |
ffc61ed2 | 3038 | if (!(OP(scan) == ALNUM |
3568d838 | 3039 | ? swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8) |
d6a28714 | 3040 | : isALNUM_LC_utf8((U8*)locinput))) |
b8c5462f JH |
3041 | { |
3042 | sayNO; | |
a0ed51b3 | 3043 | } |
b8c5462f | 3044 | locinput += PL_utf8skip[nextchr]; |
a0ed51b3 LW |
3045 | nextchr = UCHARAT(locinput); |
3046 | break; | |
3047 | } | |
ffc61ed2 | 3048 | if (!(OP(scan) == ALNUM |
d6a28714 | 3049 | ? isALNUM(nextchr) : isALNUM_LC(nextchr))) |
bbce6d69 | 3050 | sayNO; |
b8c5462f | 3051 | nextchr = UCHARAT(++locinput); |
a0d0e21e | 3052 | break; |
d6a28714 | 3053 | case NALNUML: |
b8c5462f JH |
3054 | PL_reg_flags |= RF_tainted; |
3055 | /* FALL THROUGH */ | |
d6a28714 JH |
3056 | case NALNUM: |
3057 | if (!nextchr && locinput >= PL_regeol) | |
a0ed51b3 | 3058 | sayNO; |
ffc61ed2 | 3059 | if (do_utf8) { |
1a4fad37 | 3060 | LOAD_UTF8_CHARCLASS_ALNUM(); |
ffc61ed2 | 3061 | if (OP(scan) == NALNUM |
3568d838 | 3062 | ? swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8) |
d6a28714 JH |
3063 | : isALNUM_LC_utf8((U8*)locinput)) |
3064 | { | |
b8c5462f | 3065 | sayNO; |
d6a28714 | 3066 | } |
b8c5462f JH |
3067 | locinput += PL_utf8skip[nextchr]; |
3068 | nextchr = UCHARAT(locinput); | |
3069 | break; | |
3070 | } | |
ffc61ed2 | 3071 | if (OP(scan) == NALNUM |
d6a28714 | 3072 | ? isALNUM(nextchr) : isALNUM_LC(nextchr)) |
b8c5462f | 3073 | sayNO; |
76e3520e | 3074 | nextchr = UCHARAT(++locinput); |
a0d0e21e | 3075 | break; |
d6a28714 JH |
3076 | case BOUNDL: |
3077 | case NBOUNDL: | |
3280af22 | 3078 | PL_reg_flags |= RF_tainted; |
bbce6d69 | 3079 | /* FALL THROUGH */ |
d6a28714 JH |
3080 | case BOUND: |
3081 | case NBOUND: | |
3082 | /* was last char in word? */ | |
ffc61ed2 | 3083 | if (do_utf8) { |
12d33761 | 3084 | if (locinput == PL_bostr) |
5d9a96ca | 3085 | st->ln = '\n'; |
ffc61ed2 | 3086 | else { |
a3b680e6 | 3087 | const U8 * const r = reghop3((U8*)locinput, -1, (U8*)PL_bostr); |
9041c2e3 | 3088 | |
4ad0818d | 3089 | st->ln = utf8n_to_uvchr(r, UTF8SKIP(r), 0, uniflags); |
ffc61ed2 JH |
3090 | } |
3091 | if (OP(scan) == BOUND || OP(scan) == NBOUND) { | |
5d9a96ca | 3092 | st->ln = isALNUM_uni(st->ln); |
1a4fad37 | 3093 | LOAD_UTF8_CHARCLASS_ALNUM(); |
3568d838 | 3094 | n = swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8); |
ffc61ed2 JH |
3095 | } |
3096 | else { | |
5d9a96ca | 3097 | st->ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(st->ln)); |
ffc61ed2 JH |
3098 | n = isALNUM_LC_utf8((U8*)locinput); |
3099 | } | |
a0ed51b3 | 3100 | } |
d6a28714 | 3101 | else { |
5d9a96ca | 3102 | st->ln = (locinput != PL_bostr) ? |
12d33761 | 3103 | UCHARAT(locinput - 1) : '\n'; |
ffc61ed2 | 3104 | if (OP(scan) == BOUND || OP(scan) == NBOUND) { |
5d9a96ca | 3105 | st->ln = isALNUM(st->ln); |
ffc61ed2 JH |
3106 | n = isALNUM(nextchr); |
3107 | } | |
3108 | else { | |
5d9a96ca | 3109 | st->ln = isALNUM_LC(st->ln); |
ffc61ed2 JH |
3110 | n = isALNUM_LC(nextchr); |
3111 | } | |
d6a28714 | 3112 | } |
5d9a96ca | 3113 | if (((!st->ln) == (!n)) == (OP(scan) == BOUND || |
ffc61ed2 JH |
3114 | OP(scan) == BOUNDL)) |
3115 | sayNO; | |
a0ed51b3 | 3116 | break; |
d6a28714 | 3117 | case SPACEL: |
3280af22 | 3118 | PL_reg_flags |= RF_tainted; |
bbce6d69 | 3119 | /* FALL THROUGH */ |
d6a28714 | 3120 | case SPACE: |
9442cb0e | 3121 | if (!nextchr) |
4633a7c4 | 3122 | sayNO; |
1aa99e6b | 3123 | if (do_utf8) { |
fd400ab9 | 3124 | if (UTF8_IS_CONTINUED(nextchr)) { |
1a4fad37 | 3125 | LOAD_UTF8_CHARCLASS_SPACE(); |
ffc61ed2 | 3126 | if (!(OP(scan) == SPACE |
3568d838 | 3127 | ? swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8) |
ffc61ed2 JH |
3128 | : isSPACE_LC_utf8((U8*)locinput))) |
3129 | { | |
3130 | sayNO; | |
3131 | } | |
3132 | locinput += PL_utf8skip[nextchr]; | |
3133 | nextchr = UCHARAT(locinput); | |
3134 | break; | |
d6a28714 | 3135 | } |
ffc61ed2 JH |
3136 | if (!(OP(scan) == SPACE |
3137 | ? isSPACE(nextchr) : isSPACE_LC(nextchr))) | |
3138 | sayNO; | |
3139 | nextchr = UCHARAT(++locinput); | |
3140 | } | |
3141 | else { | |
3142 | if (!(OP(scan) == SPACE | |
3143 | ? isSPACE(nextchr) : isSPACE_LC(nextchr))) | |
3144 | sayNO; | |
3145 | nextchr = UCHARAT(++locinput); | |
a0ed51b3 | 3146 | } |
a0ed51b3 | 3147 | break; |
d6a28714 | 3148 | case NSPACEL: |
3280af22 | 3149 | PL_reg_flags |= RF_tainted; |
bbce6d69 | 3150 | /* FALL THROUGH */ |
d6a28714 | 3151 | case NSPACE: |
9442cb0e | 3152 | if (!nextchr && locinput >= PL_regeol) |
b8c5462f | 3153 | sayNO; |
1aa99e6b | 3154 | if (do_utf8) { |
1a4fad37 | 3155 | LOAD_UTF8_CHARCLASS_SPACE(); |
ffc61ed2 | 3156 | if (OP(scan) == NSPACE |
3568d838 | 3157 | ? swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8) |
d6a28714 | 3158 | : isSPACE_LC_utf8((U8*)locinput)) |
b8c5462f JH |
3159 | { |
3160 | sayNO; | |
3161 | } | |
3162 | locinput += PL_utf8skip[nextchr]; | |
3163 | nextchr = UCHARAT(locinput); | |
3164 | break; | |
a0ed51b3 | 3165 | } |
ffc61ed2 | 3166 | if (OP(scan) == NSPACE |
d6a28714 | 3167 | ? isSPACE(nextchr) : isSPACE_LC(nextchr)) |
4633a7c4 | 3168 | sayNO; |
76e3520e | 3169 | nextchr = UCHARAT(++locinput); |
a0d0e21e | 3170 | break; |
d6a28714 | 3171 | case DIGITL: |
a0ed51b3 LW |
3172 | PL_reg_flags |= RF_tainted; |
3173 | /* FALL THROUGH */ | |
d6a28714 | 3174 | case DIGIT: |
9442cb0e | 3175 | if (!nextchr) |
a0ed51b3 | 3176 | sayNO; |
1aa99e6b | 3177 | if (do_utf8) { |
1a4fad37 | 3178 | LOAD_UTF8_CHARCLASS_DIGIT(); |
ffc61ed2 | 3179 | if (!(OP(scan) == DIGIT |
3568d838 | 3180 | ? swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8) |
9442cb0e | 3181 | : isDIGIT_LC_utf8((U8*)locinput))) |
dfe13c55 | 3182 | { |
a0ed51b3 | 3183 | sayNO; |
dfe13c55 | 3184 | } |
6f06b55f | 3185 | locinput += PL_utf8skip[nextchr]; |
a0ed51b3 LW |
3186 | nextchr = UCHARAT(locinput); |
3187 | break; | |
3188 | } | |
ffc61ed2 | 3189 | if (!(OP(scan) == DIGIT |
9442cb0e | 3190 | ? isDIGIT(nextchr) : isDIGIT_LC(nextchr))) |
a0ed51b3 LW |
3191 | sayNO; |
3192 | nextchr = UCHARAT(++locinput); | |
3193 | break; | |
d6a28714 | 3194 | case NDIGITL: |
b8c5462f JH |
3195 | PL_reg_flags |= RF_tainted; |
3196 | /* FALL THROUGH */ | |
d6a28714 | 3197 | case NDIGIT: |
9442cb0e | 3198 | if (!nextchr && locinput >= PL_regeol) |
b8c5462f | 3199 | sayNO; |
1aa99e6b | 3200 | if (do_utf8) { |
1a4fad37 | 3201 | LOAD_UTF8_CHARCLASS_DIGIT(); |
ffc61ed2 | 3202 | if (OP(scan) == NDIGIT |
3568d838 | 3203 | ? swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8) |
9442cb0e GS |
3204 | : isDIGIT_LC_utf8((U8*)locinput)) |
3205 | { | |
a0ed51b3 | 3206 | sayNO; |
9442cb0e | 3207 | } |
6f06b55f | 3208 | locinput += PL_utf8skip[nextchr]; |
a0ed51b3 LW |
3209 | nextchr = UCHARAT(locinput); |
3210 | break; | |
3211 | } | |
ffc61ed2 | 3212 | if (OP(scan) == NDIGIT |
9442cb0e | 3213 | ? isDIGIT(nextchr) : isDIGIT_LC(nextchr)) |
a0ed51b3 LW |
3214 | sayNO; |
3215 | nextchr = UCHARAT(++locinput); | |
3216 | break; | |
3217 | case CLUMP: | |
b7c83a7e | 3218 | if (locinput >= PL_regeol) |
a0ed51b3 | 3219 | sayNO; |
b7c83a7e | 3220 | if (do_utf8) { |
1a4fad37 | 3221 | LOAD_UTF8_CHARCLASS_MARK(); |
b7c83a7e JH |
3222 | if (swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8)) |
3223 | sayNO; | |
3224 | locinput += PL_utf8skip[nextchr]; | |
3225 | while (locinput < PL_regeol && | |
3226 | swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8)) | |
3227 | locinput += UTF8SKIP(locinput); | |
3228 | if (locinput > PL_regeol) | |
3229 | sayNO; | |
eb08e2da JH |
3230 | } |
3231 | else | |
3232 | locinput++; | |
a0ed51b3 LW |
3233 | nextchr = UCHARAT(locinput); |
3234 | break; | |
c8756f30 | 3235 | case REFFL: |
3280af22 | 3236 | PL_reg_flags |= RF_tainted; |
c8756f30 | 3237 | /* FALL THROUGH */ |
c277df42 | 3238 | case REF: |
95b24440 DM |
3239 | case REFF: { |
3240 | char *s; | |
c277df42 | 3241 | n = ARG(scan); /* which paren pair */ |
5d9a96ca | 3242 | st->ln = PL_regstartp[n]; |
2c2d71f5 | 3243 | PL_reg_leftiter = PL_reg_maxiter; /* Void cache */ |
5d9a96ca | 3244 | if ((I32)*PL_reglastparen < n || st->ln == -1) |
af3f8c16 | 3245 | sayNO; /* Do not match unless seen CLOSEn. */ |
5d9a96ca | 3246 | if (st->ln == PL_regendp[n]) |
a0d0e21e | 3247 | break; |
a0ed51b3 | 3248 | |
5d9a96ca | 3249 | s = PL_bostr + st->ln; |
1aa99e6b | 3250 | if (do_utf8 && OP(scan) != REF) { /* REF can do byte comparison */ |
a0ed51b3 | 3251 | char *l = locinput; |
a3b680e6 | 3252 | const char *e = PL_bostr + PL_regendp[n]; |
a0ed51b3 LW |
3253 | /* |
3254 | * Note that we can't do the "other character" lookup trick as | |
3255 | * in the 8-bit case (no pun intended) because in Unicode we | |
3256 | * have to map both upper and title case to lower case. | |
3257 | */ | |
3258 | if (OP(scan) == REFF) { | |
3259 | while (s < e) { | |
a3b680e6 AL |
3260 | STRLEN ulen1, ulen2; |
3261 | U8 tmpbuf1[UTF8_MAXBYTES_CASE+1]; | |
3262 | U8 tmpbuf2[UTF8_MAXBYTES_CASE+1]; | |
3263 | ||
a0ed51b3 LW |
3264 | if (l >= PL_regeol) |
3265 | sayNO; | |
a2a2844f JH |
3266 | toLOWER_utf8((U8*)s, tmpbuf1, &ulen1); |
3267 | toLOWER_utf8((U8*)l, tmpbuf2, &ulen2); | |
7114a2d2 | 3268 | if (ulen1 != ulen2 || memNE((char *)tmpbuf1, (char *)tmpbuf2, ulen1)) |
a0ed51b3 | 3269 | sayNO; |
a2a2844f JH |
3270 | s += ulen1; |
3271 | l += ulen2; | |
a0ed51b3 LW |
3272 | } |
3273 | } | |
3274 | locinput = l; | |
3275 | nextchr = UCHARAT(locinput); | |
3276 | break; | |
3277 | } | |
3278 | ||
a0d0e21e | 3279 | /* Inline the first character, for speed. */ |
76e3520e | 3280 | if (UCHARAT(s) != nextchr && |
c8756f30 AK |
3281 | (OP(scan) == REF || |
3282 | (UCHARAT(s) != ((OP(scan) == REFF | |
22c35a8c | 3283 | ? PL_fold : PL_fold_locale)[nextchr])))) |
4633a7c4 | 3284 | sayNO; |
5d9a96ca DM |
3285 | st->ln = PL_regendp[n] - st->ln; |
3286 | if (locinput + st->ln > PL_regeol) | |
4633a7c4 | 3287 | sayNO; |
5d9a96ca DM |
3288 | if (st->ln > 1 && (OP(scan) == REF |
3289 | ? memNE(s, locinput, st->ln) | |
c8756f30 | 3290 | : (OP(scan) == REFF |
5d9a96ca DM |
3291 | ? ibcmp(s, locinput, st->ln) |
3292 | : ibcmp_locale(s, locinput, st->ln)))) | |
4633a7c4 | 3293 | sayNO; |
5d9a96ca | 3294 | locinput += st->ln; |
76e3520e | 3295 | nextchr = UCHARAT(locinput); |
a0d0e21e | 3296 | break; |
95b24440 | 3297 | } |
a0d0e21e LW |
3298 | |
3299 | case NOTHING: | |
c277df42 | 3300 | case TAIL: |
a0d0e21e LW |
3301 | break; |
3302 | case BACK: | |
3303 | break; | |
c277df42 IZ |
3304 | case EVAL: |
3305 | { | |
c277df42 | 3306 | SV *ret; |
8e5e9ebe | 3307 | { |
4aabdb9b DM |
3308 | /* execute the code in the {...} */ |
3309 | dSP; | |
6136c704 | 3310 | SV ** const before = SP; |
4aabdb9b DM |
3311 | OP_4tree * const oop = PL_op; |
3312 | COP * const ocurcop = PL_curcop; | |
3313 | PAD *old_comppad; | |
4aabdb9b DM |
3314 | |
3315 | n = ARG(scan); | |
32fc9b6a | 3316 | PL_op = (OP_4tree*)rex->data->data[n]; |
4aabdb9b | 3317 | DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log, " re_eval 0x%"UVxf"\n", PTR2UV(PL_op)) ); |
32fc9b6a | 3318 | PAD_SAVE_LOCAL(old_comppad, (PAD*)rex->data->data[n + 2]); |
4aabdb9b DM |
3319 | PL_regendp[0] = PL_reg_magic->mg_len = locinput - PL_bostr; |
3320 | ||
8e5e9ebe RGS |
3321 | CALLRUNOPS(aTHX); /* Scalar context. */ |
3322 | SPAGAIN; | |
3323 | if (SP == before) | |
075aa684 | 3324 | ret = &PL_sv_undef; /* protect against empty (?{}) blocks. */ |
8e5e9ebe RGS |
3325 | else { |
3326 | ret = POPs; | |
3327 | PUTBACK; | |
3328 | } | |
4aabdb9b DM |
3329 | |
3330 | PL_op = oop; | |
3331 | PAD_RESTORE_LOCAL(old_comppad); | |
3332 | PL_curcop = ocurcop; | |
3333 | if (!st->logical) { | |
3334 | /* /(?{...})/ */ | |
3335 | sv_setsv(save_scalar(PL_replgv), ret); | |
4aabdb9b DM |
3336 | break; |
3337 | } | |
8e5e9ebe | 3338 | } |
4aabdb9b DM |
3339 | if (st->logical == 2) { /* Postponed subexpression: /(??{...})/ */ |
3340 | regexp *re; | |
4aabdb9b | 3341 | { |
4f639d21 DM |
3342 | /* extract RE object from returned value; compiling if |
3343 | * necessary */ | |
3344 | ||
6136c704 | 3345 | MAGIC *mg = NULL; |
4aabdb9b | 3346 | SV *sv; |
faf82a0b AE |
3347 | if(SvROK(ret) && SvSMAGICAL(sv = SvRV(ret))) |
3348 | mg = mg_find(sv, PERL_MAGIC_qr); | |
3349 | else if (SvSMAGICAL(ret)) { | |
3350 | if (SvGMAGICAL(ret)) | |
3351 | sv_unmagic(ret, PERL_MAGIC_qr); | |
3352 | else | |
3353 | mg = mg_find(ret, PERL_MAGIC_qr); | |
0f5d15d6 | 3354 | } |
faf82a0b | 3355 | |
0f5d15d6 IZ |
3356 | if (mg) { |
3357 | re = (regexp *)mg->mg_obj; | |
df0003d4 | 3358 | (void)ReREFCNT_inc(re); |
0f5d15d6 IZ |
3359 | } |
3360 | else { | |
3361 | STRLEN len; | |
6136c704 | 3362 | const char * const t = SvPV_const(ret, len); |
0f5d15d6 | 3363 | PMOP pm; |
a3b680e6 | 3364 | const I32 osize = PL_regsize; |
0f5d15d6 | 3365 | |
5fcd1c1b | 3366 | Zero(&pm, 1, PMOP); |
4aabdb9b | 3367 | if (DO_UTF8(ret)) pm.op_pmdynflags |= PMdf_DYN_UTF8; |
83003860 | 3368 | re = CALLREGCOMP(aTHX_ (char*)t, (char*)t + len, &pm); |
9041c2e3 | 3369 | if (!(SvFLAGS(ret) |
faf82a0b AE |
3370 | & (SVs_TEMP | SVs_PADTMP | SVf_READONLY |
3371 | | SVs_GMG))) | |
14befaf4 DM |
3372 | sv_magic(ret,(SV*)ReREFCNT_inc(re), |
3373 | PERL_MAGIC_qr,0,0); | |
0f5d15d6 | 3374 | PL_regsize = osize; |
0f5d15d6 | 3375 | } |
4aabdb9b | 3376 | } |
aa283a38 DM |
3377 | |
3378 | /* run the pattern returned from (??{...}) */ | |
3379 | ||
4aabdb9b DM |
3380 | DEBUG_EXECUTE_r( |
3381 | PerlIO_printf(Perl_debug_log, | |
3382 | "Entering embedded \"%s%.60s%s%s\"\n", | |
3383 | PL_colors[0], | |
3384 | re->precomp, | |
3385 | PL_colors[1], | |
3386 | (strlen(re->precomp) > 60 ? "..." : "")) | |
3387 | ); | |
2c2d71f5 | 3388 | |
4aabdb9b DM |
3389 | st->u.eval.cp = regcppush(0); /* Save *all* the positions. */ |
3390 | REGCP_SET(st->u.eval.lastcp); | |
4aabdb9b DM |
3391 | *PL_reglastparen = 0; |
3392 | *PL_reglastcloseparen = 0; | |
4aabdb9b | 3393 | PL_reginput = locinput; |
4aabdb9b DM |
3394 | |
3395 | /* XXXX This is too dramatic a measure... */ | |
3396 | PL_reg_maxiter = 0; | |
3397 | ||
5d9a96ca | 3398 | st->logical = 0; |
aa283a38 DM |
3399 | st->u.eval.toggleutf = ((PL_reg_flags & RF_utf8) != 0) ^ |
3400 | ((re->reganch & ROPT_UTF8) != 0); | |
3401 | if (st->u.eval.toggleutf) PL_reg_flags ^= RF_utf8; | |
3402 | st->u.eval.prev_rex = rex; | |
aa283a38 | 3403 | rex = re; |
aa283a38 DM |
3404 | |
3405 | st->u.eval.prev_eval = cur_eval; | |
3406 | st->u.eval.prev_slab = PL_regmatch_slab; | |
3407 | st->u.eval.depth = depth; | |
3408 | cur_eval = st; | |
3409 | PUSH_STATE(newst, resume_EVAL); | |
3410 | st = newst; | |
3411 | ||
3412 | /* now continue from first node in postoned RE */ | |
3413 | next = re->program + 1; | |
3414 | break; | |
4aabdb9b | 3415 | /* NOTREACHED */ |
a0ed51b3 | 3416 | } |
4aabdb9b DM |
3417 | /* /(?(?{...})X|Y)/ */ |
3418 | st->sw = SvTRUE(ret); | |
3419 | st->logical = 0; | |
c277df42 IZ |
3420 | break; |
3421 | } | |
a0d0e21e | 3422 | case OPEN: |
c277df42 | 3423 | n = ARG(scan); /* which paren pair */ |
3280af22 NIS |
3424 | PL_reg_start_tmp[n] = locinput; |
3425 | if (n > PL_regsize) | |
3426 | PL_regsize = n; | |
a0d0e21e LW |
3427 | break; |
3428 | case CLOSE: | |
c277df42 | 3429 | n = ARG(scan); /* which paren pair */ |
cf93c79d IZ |
3430 | PL_regstartp[n] = PL_reg_start_tmp[n] - PL_bostr; |
3431 | PL_regendp[n] = locinput - PL_bostr; | |
eb160463 | 3432 | if (n > (I32)*PL_reglastparen) |
3280af22 | 3433 | *PL_reglastparen = n; |
a01268b5 | 3434 | *PL_reglastcloseparen = n; |
a0d0e21e | 3435 | break; |
c277df42 IZ |
3436 | case GROUPP: |
3437 | n = ARG(scan); /* which paren pair */ | |
5d9a96ca | 3438 | st->sw = ((I32)*PL_reglastparen >= n && PL_regendp[n] != -1); |
c277df42 IZ |
3439 | break; |
3440 | case IFTHEN: | |
2c2d71f5 | 3441 | PL_reg_leftiter = PL_reg_maxiter; /* Void cache */ |
5d9a96ca | 3442 | if (st->sw) |
c277df42 IZ |
3443 | next = NEXTOPER(NEXTOPER(scan)); |
3444 | else { | |
3445 | next = scan + ARG(scan); | |
3446 | if (OP(next) == IFTHEN) /* Fake one. */ | |
3447 | next = NEXTOPER(NEXTOPER(next)); | |
3448 | } | |
3449 | break; | |
3450 | case LOGICAL: | |
5d9a96ca | 3451 | st->logical = scan->flags; |
c277df42 | 3452 | break; |
2ab05381 | 3453 | /******************************************************************* |
a0374537 DM |
3454 | cc points to the regmatch_state associated with the most recent CURLYX. |
3455 | This struct contains info about the innermost (...)* loop (an | |
3456 | "infoblock"), and a pointer to the next outer cc. | |
2ab05381 IZ |
3457 | |
3458 | Here is how Y(A)*Z is processed (if it is compiled into CURLYX/WHILEM): | |
3459 | ||
95b24440 | 3460 | 1) After matching Y, regnode for CURLYX is processed; |
2ab05381 | 3461 | |
a0374537 | 3462 | 2) This regnode populates cc, and calls regmatch() recursively |
95b24440 | 3463 | with the starting point at WHILEM node; |
2ab05381 IZ |
3464 | |
3465 | 3) Each hit of WHILEM node tries to match A and Z (in the order | |
3466 | depending on the current iteration, min/max of {min,max} and | |
3467 | greediness). The information about where are nodes for "A" | |
a0374537 | 3468 | and "Z" is read from cc, as is info on how many times "A" |
2ab05381 IZ |
3469 | was already matched, and greediness. |
3470 | ||
3471 | 4) After A matches, the same WHILEM node is hit again. | |
3472 | ||
95b24440 | 3473 | 5) Each time WHILEM is hit, cc is the infoblock created by CURLYX |
2ab05381 | 3474 | of the same pair. Thus when WHILEM tries to match Z, it temporarily |
95b24440 | 3475 | resets cc, since this Y(A)*Z can be a part of some other loop: |
2ab05381 IZ |
3476 | as in (Y(A)*Z)*. If Z matches, the automaton will hit the WHILEM node |
3477 | of the external loop. | |
3478 | ||
a0374537 | 3479 | Currently present infoblocks form a tree with a stem formed by st->cc |
2ab05381 IZ |
3480 | and whatever it mentions via ->next, and additional attached trees |
3481 | corresponding to temporarily unset infoblocks as in "5" above. | |
3482 | ||
95b24440 | 3483 | In the following picture, infoblocks for outer loop of |
2ab05381 IZ |
3484 | (Y(A)*?Z)*?T are denoted O, for inner I. NULL starting block |
3485 | is denoted by x. The matched string is YAAZYAZT. Temporarily postponed | |
3486 | infoblocks are drawn below the "reset" infoblock. | |
3487 | ||
3488 | In fact in the picture below we do not show failed matches for Z and T | |
3489 | by WHILEM blocks. [We illustrate minimal matches, since for them it is | |
3490 | more obvious *why* one needs to *temporary* unset infoblocks.] | |
3491 | ||
3492 | Matched REx position InfoBlocks Comment | |
3493 | (Y(A)*?Z)*?T x | |
3494 | Y(A)*?Z)*?T x <- O | |
3495 | Y (A)*?Z)*?T x <- O | |
3496 | Y A)*?Z)*?T x <- O <- I | |
3497 | YA )*?Z)*?T x <- O <- I | |
3498 | YA A)*?Z)*?T x <- O <- I | |
3499 | YAA )*?Z)*?T x <- O <- I | |
3500 | YAA Z)*?T x <- O # Temporary unset I | |
3501 | I | |
3502 | ||
3503 | YAAZ Y(A)*?Z)*?T x <- O | |
3504 | I | |
3505 | ||
3506 | YAAZY (A)*?Z)*?T x <- O | |
3507 | I | |
3508 | ||
3509 | YAAZY A)*?Z)*?T x <- O <- I | |
3510 | I | |
3511 | ||
3512 | YAAZYA )*?Z)*?T x <- O <- I | |
3513 | I | |
3514 | ||
3515 | YAAZYA Z)*?T x <- O # Temporary unset I | |
3516 | I,I | |
3517 | ||
3518 | YAAZYAZ )*?T x <- O | |
3519 | I,I | |
3520 | ||
3521 | YAAZYAZ T x # Temporary unset O | |
3522 | O | |
3523 | I,I | |
3524 | ||
3525 | YAAZYAZT x | |
3526 | O | |
3527 | I,I | |
3528 | *******************************************************************/ | |
95b24440 | 3529 | |
a0d0e21e | 3530 | case CURLYX: { |
cb434fcc IZ |
3531 | /* No need to save/restore up to this paren */ |
3532 | I32 parenfloor = scan->flags; | |
c277df42 | 3533 | |
30b2893d | 3534 | if (OP(PREVOPER(next)) == NOTHING) /* LONGJMP */ |
c277df42 | 3535 | next += ARG(next); |
cb434fcc IZ |
3536 | /* XXXX Probably it is better to teach regpush to support |
3537 | parenfloor > PL_regsize... */ | |
eb160463 | 3538 | if (parenfloor > (I32)*PL_reglastparen) |
cb434fcc | 3539 | parenfloor = *PL_reglastparen; /* Pessimization... */ |
a0374537 | 3540 | |
d8319b27 DM |
3541 | st->u.curlyx.cp = PL_savestack_ix; |
3542 | st->u.curlyx.outercc = st->cc; | |
a0374537 DM |
3543 | st->cc = st; |
3544 | /* these fields contain the state of the current curly. | |
3545 | * they are accessed by subsequent WHILEMs; | |
3546 | * cur and lastloc are also updated by WHILEM */ | |
d8319b27 DM |
3547 | st->u.curlyx.parenfloor = parenfloor; |
3548 | st->u.curlyx.cur = -1; /* this will be updated by WHILEM */ | |
3549 | st->u.curlyx.min = ARG1(scan); | |
3550 | st->u.curlyx.max = ARG2(scan); | |
3551 | st->u.curlyx.scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS; | |
3552 | st->u.curlyx.lastloc = 0; | |
a0374537 DM |
3553 | /* st->next and st->minmod are also read by WHILEM */ |
3554 | ||
3280af22 | 3555 | PL_reginput = locinput; |
95b24440 DM |
3556 | REGMATCH(PREVOPER(next), CURLYX); /* start on the WHILEM */ |
3557 | /*** all unsaved local vars undefined at this point */ | |
d8319b27 DM |
3558 | regcpblow(st->u.curlyx.cp); |
3559 | st->cc = st->u.curlyx.outercc; | |
95b24440 | 3560 | saySAME(result); |
a0d0e21e | 3561 | } |
5f66b61c | 3562 | /* NOTREACHED */ |
a0d0e21e LW |
3563 | case WHILEM: { |
3564 | /* | |
3565 | * This is really hard to understand, because after we match | |
3566 | * what we're trying to match, we must make sure the rest of | |
2c2d71f5 | 3567 | * the REx is going to match for sure, and to do that we have |
a0d0e21e LW |
3568 | * to go back UP the parse tree by recursing ever deeper. And |
3569 | * if it fails, we have to reset our parent's current state | |
3570 | * that we can try again after backing off. | |
3571 | */ | |
3572 | ||
d8319b27 DM |
3573 | st->u.whilem.lastloc = st->cc->u.curlyx.lastloc; /* Detection of 0-len. */ |
3574 | st->u.whilem.cache_offset = 0; | |
3575 | st->u.whilem.cache_bit = 0; | |
c277df42 | 3576 | |
d8319b27 | 3577 | n = st->cc->u.curlyx.cur + 1; /* how many we know we matched */ |
3280af22 | 3578 | PL_reginput = locinput; |
a0d0e21e | 3579 | |
a3621e74 | 3580 | DEBUG_EXECUTE_r( |
9041c2e3 | 3581 | PerlIO_printf(Perl_debug_log, |
91f3b821 | 3582 | "%*s %ld out of %ld..%ld cc=%"UVxf"\n", |
3280af22 | 3583 | REPORT_CODE_OFF+PL_regindent*2, "", |
d8319b27 DM |
3584 | (long)n, (long)st->cc->u.curlyx.min, |
3585 | (long)st->cc->u.curlyx.max, PTR2UV(st->cc)) | |
c277df42 | 3586 | ); |
4633a7c4 | 3587 | |
a0d0e21e LW |
3588 | /* If degenerate scan matches "", assume scan done. */ |
3589 | ||
d8319b27 DM |
3590 | if (locinput == st->cc->u.curlyx.lastloc && n >= st->cc->u.curlyx.min) { |
3591 | st->u.whilem.savecc = st->cc; | |
3592 | st->cc = st->cc->u.curlyx.outercc; | |
5d9a96ca | 3593 | if (st->cc) |
d8319b27 | 3594 | st->ln = st->cc->u.curlyx.cur; |
a3621e74 | 3595 | DEBUG_EXECUTE_r( |
c3464db5 DD |
3596 | PerlIO_printf(Perl_debug_log, |
3597 | "%*s empty match detected, try continuation...\n", | |
3280af22 | 3598 | REPORT_CODE_OFF+PL_regindent*2, "") |
c277df42 | 3599 | ); |
d8319b27 | 3600 | REGMATCH(st->u.whilem.savecc->next, WHILEM1); |
95b24440 | 3601 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 3602 | st->cc = st->u.whilem.savecc; |
95b24440 | 3603 | if (result) |
4633a7c4 | 3604 | sayYES; |
d8319b27 DM |
3605 | if (st->cc->u.curlyx.outercc) |
3606 | st->cc->u.curlyx.outercc->u.curlyx.cur = st->ln; | |
4633a7c4 | 3607 | sayNO; |
a0d0e21e LW |
3608 | } |
3609 | ||
3610 | /* First just match a string of min scans. */ | |
3611 | ||
d8319b27 DM |
3612 | if (n < st->cc->u.curlyx.min) { |
3613 | st->cc->u.curlyx.cur = n; | |
3614 | st->cc->u.curlyx.lastloc = locinput; | |
3615 | REGMATCH(st->cc->u.curlyx.scan, WHILEM2); | |
95b24440 DM |
3616 | /*** all unsaved local vars undefined at this point */ |
3617 | if (result) | |
4633a7c4 | 3618 | sayYES; |
d8319b27 DM |
3619 | st->cc->u.curlyx.cur = n - 1; |
3620 | st->cc->u.curlyx.lastloc = st->u.whilem.lastloc; | |
4633a7c4 | 3621 | sayNO; |
a0d0e21e LW |
3622 | } |
3623 | ||
2c2d71f5 JH |
3624 | if (scan->flags) { |
3625 | /* Check whether we already were at this position. | |
3626 | Postpone detection until we know the match is not | |
3627 | *that* much linear. */ | |
3628 | if (!PL_reg_maxiter) { | |
3629 | PL_reg_maxiter = (PL_regeol - PL_bostr + 1) * (scan->flags>>4); | |
3630 | PL_reg_leftiter = PL_reg_maxiter; | |
3631 | } | |
3632 | if (PL_reg_leftiter-- == 0) { | |
a3b680e6 | 3633 | const I32 size = (PL_reg_maxiter + 7 + POSCACHE_START)/8; |
2c2d71f5 | 3634 | if (PL_reg_poscache) { |
eb160463 | 3635 | if ((I32)PL_reg_poscache_size < size) { |
2c2d71f5 JH |
3636 | Renew(PL_reg_poscache, size, char); |
3637 | PL_reg_poscache_size = size; | |
3638 | } | |
3639 | Zero(PL_reg_poscache, size, char); | |
3640 | } | |
3641 | else { | |
3642 | PL_reg_poscache_size = size; | |
a02a5408 | 3643 | Newxz(PL_reg_poscache, size, char); |
2c2d71f5 | 3644 | } |
a3621e74 | 3645 | DEBUG_EXECUTE_r( |
2c2d71f5 JH |
3646 | PerlIO_printf(Perl_debug_log, |
3647 | "%sDetected a super-linear match, switching on caching%s...\n", | |
3648 | PL_colors[4], PL_colors[5]) | |
3649 | ); | |
3650 | } | |
3651 | if (PL_reg_leftiter < 0) { | |
d8319b27 | 3652 | st->u.whilem.cache_offset = locinput - PL_bostr; |
2c2d71f5 | 3653 | |
d8319b27 DM |
3654 | st->u.whilem.cache_offset = (scan->flags & 0xf) - 1 + POSCACHE_START |
3655 | + st->u.whilem.cache_offset * (scan->flags>>4); | |
3656 | st->u.whilem.cache_bit = st->u.whilem.cache_offset % 8; | |
3657 | st->u.whilem.cache_offset /= 8; | |
3658 | if (PL_reg_poscache[st->u.whilem.cache_offset] & (1<<st->u.whilem.cache_bit)) { | |
a3621e74 | 3659 | DEBUG_EXECUTE_r( |
2c2d71f5 JH |
3660 | PerlIO_printf(Perl_debug_log, |
3661 | "%*s already tried at this position...\n", | |
3662 | REPORT_CODE_OFF+PL_regindent*2, "") | |
3663 | ); | |
3ab3c9b4 HS |
3664 | if (PL_reg_poscache[0] & (1<<POSCACHE_SUCCESS)) |
3665 | /* cache records success */ | |
c2b0868c HS |
3666 | sayYES; |
3667 | else | |
3ab3c9b4 | 3668 | /* cache records failure */ |
c2b0868c | 3669 | sayNO_SILENT; |
2c2d71f5 | 3670 | } |
d8319b27 | 3671 | PL_reg_poscache[st->u.whilem.cache_offset] |= (1<<st->u.whilem.cache_bit); |
2c2d71f5 JH |
3672 | } |
3673 | } | |
3674 | ||
a0d0e21e LW |
3675 | /* Prefer next over scan for minimal matching. */ |
3676 | ||
5d9a96ca | 3677 | if (st->cc->minmod) { |
d8319b27 DM |
3678 | st->u.whilem.savecc = st->cc; |
3679 | st->cc = st->cc->u.curlyx.outercc; | |
5d9a96ca | 3680 | if (st->cc) |
d8319b27 DM |
3681 | st->ln = st->cc->u.curlyx.cur; |
3682 | st->u.whilem.cp = regcppush(st->u.whilem.savecc->u.curlyx.parenfloor); | |
3683 | REGCP_SET(st->u.whilem.lastcp); | |
3684 | REGMATCH(st->u.whilem.savecc->next, WHILEM3); | |
95b24440 | 3685 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 3686 | st->cc = st->u.whilem.savecc; |
95b24440 | 3687 | if (result) { |
d8319b27 | 3688 | regcpblow(st->u.whilem.cp); |
3ab3c9b4 | 3689 | CACHEsayYES; /* All done. */ |
5f05dabc | 3690 | } |
d8319b27 | 3691 | REGCP_UNWIND(st->u.whilem.lastcp); |
4f639d21 | 3692 | regcppop(rex); |
d8319b27 DM |
3693 | if (st->cc->u.curlyx.outercc) |
3694 | st->cc->u.curlyx.outercc->u.curlyx.cur = st->ln; | |
a0d0e21e | 3695 | |
d8319b27 | 3696 | if (n >= st->cc->u.curlyx.max) { /* Maximum greed exceeded? */ |
9041c2e3 | 3697 | if (ckWARN(WARN_REGEXP) && n >= REG_INFTY |
3280af22 NIS |
3698 | && !(PL_reg_flags & RF_warned)) { |
3699 | PL_reg_flags |= RF_warned; | |
9014280d | 3700 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s limit (%d) exceeded", |
2f3ca594 GS |
3701 | "Complex regular subexpression recursion", |
3702 | REG_INFTY - 1); | |
c277df42 | 3703 | } |
3ab3c9b4 | 3704 | CACHEsayNO; |
c277df42 | 3705 | } |
a687059c | 3706 | |
a3621e74 | 3707 | DEBUG_EXECUTE_r( |
c3464db5 DD |
3708 | PerlIO_printf(Perl_debug_log, |
3709 | "%*s trying longer...\n", | |
3280af22 | 3710 | REPORT_CODE_OFF+PL_regindent*2, "") |
c277df42 | 3711 | ); |
a0d0e21e | 3712 | /* Try scanning more and see if it helps. */ |
3280af22 | 3713 | PL_reginput = locinput; |
d8319b27 DM |
3714 | st->cc->u.curlyx.cur = n; |
3715 | st->cc->u.curlyx.lastloc = locinput; | |
3716 | st->u.whilem.cp = regcppush(st->cc->u.curlyx.parenfloor); | |
3717 | REGCP_SET(st->u.whilem.lastcp); | |
3718 | REGMATCH(st->cc->u.curlyx.scan, WHILEM4); | |
95b24440 DM |
3719 | /*** all unsaved local vars undefined at this point */ |
3720 | if (result) { | |
d8319b27 | 3721 | regcpblow(st->u.whilem.cp); |
3ab3c9b4 | 3722 | CACHEsayYES; |
5f05dabc | 3723 | } |
d8319b27 | 3724 | REGCP_UNWIND(st->u.whilem.lastcp); |
4f639d21 | 3725 | regcppop(rex); |
d8319b27 DM |
3726 | st->cc->u.curlyx.cur = n - 1; |
3727 | st->cc->u.curlyx.lastloc = st->u.whilem.lastloc; | |
3ab3c9b4 | 3728 | CACHEsayNO; |
a0d0e21e LW |
3729 | } |
3730 | ||
3731 | /* Prefer scan over next for maximal matching. */ | |
3732 | ||
d8319b27 DM |
3733 | if (n < st->cc->u.curlyx.max) { /* More greed allowed? */ |
3734 | st->u.whilem.cp = regcppush(st->cc->u.curlyx.parenfloor); | |
3735 | st->cc->u.curlyx.cur = n; | |
3736 | st->cc->u.curlyx.lastloc = locinput; | |
3737 | REGCP_SET(st->u.whilem.lastcp); | |
3738 | REGMATCH(st->cc->u.curlyx.scan, WHILEM5); | |
95b24440 DM |
3739 | /*** all unsaved local vars undefined at this point */ |
3740 | if (result) { | |
d8319b27 | 3741 | regcpblow(st->u.whilem.cp); |
3ab3c9b4 | 3742 | CACHEsayYES; |
5f05dabc | 3743 | } |
d8319b27 | 3744 | REGCP_UNWIND(st->u.whilem.lastcp); |
4f639d21 | 3745 | regcppop(rex); /* Restore some previous $<digit>s? */ |
3280af22 | 3746 | PL_reginput = locinput; |
a3621e74 | 3747 | DEBUG_EXECUTE_r( |
c3464db5 DD |
3748 | PerlIO_printf(Perl_debug_log, |
3749 | "%*s failed, try continuation...\n", | |
3280af22 | 3750 | REPORT_CODE_OFF+PL_regindent*2, "") |
c277df42 IZ |
3751 | ); |
3752 | } | |
9041c2e3 | 3753 | if (ckWARN(WARN_REGEXP) && n >= REG_INFTY |
599cee73 | 3754 | && !(PL_reg_flags & RF_warned)) { |
3280af22 | 3755 | PL_reg_flags |= RF_warned; |
9014280d | 3756 | Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s limit (%d) exceeded", |
cb5d145d GS |
3757 | "Complex regular subexpression recursion", |
3758 | REG_INFTY - 1); | |
a0d0e21e LW |
3759 | } |
3760 | ||
3761 | /* Failed deeper matches of scan, so see if this one works. */ | |
d8319b27 DM |
3762 | st->u.whilem.savecc = st->cc; |
3763 | st->cc = st->cc->u.curlyx.outercc; | |
5d9a96ca | 3764 | if (st->cc) |
d8319b27 DM |
3765 | st->ln = st->cc->u.curlyx.cur; |
3766 | REGMATCH(st->u.whilem.savecc->next, WHILEM6); | |
95b24440 | 3767 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 3768 | st->cc = st->u.whilem.savecc; |
95b24440 | 3769 | if (result) |
3ab3c9b4 | 3770 | CACHEsayYES; |
d8319b27 DM |
3771 | if (st->cc->u.curlyx.outercc) |
3772 | st->cc->u.curlyx.outercc->u.curlyx.cur = st->ln; | |
3773 | st->cc->u.curlyx.cur = n - 1; | |
3774 | st->cc->u.curlyx.lastloc = st->u.whilem.lastloc; | |
3ab3c9b4 | 3775 | CACHEsayNO; |
a0d0e21e | 3776 | } |
5f66b61c | 3777 | /* NOTREACHED */ |
9041c2e3 | 3778 | case BRANCHJ: |
c277df42 IZ |
3779 | next = scan + ARG(scan); |
3780 | if (next == scan) | |
3781 | next = NULL; | |
3782 | inner = NEXTOPER(NEXTOPER(scan)); | |
3783 | goto do_branch; | |
9041c2e3 | 3784 | case BRANCH: |
c277df42 IZ |
3785 | inner = NEXTOPER(scan); |
3786 | do_branch: | |
3787 | { | |
e822a8b4 DM |
3788 | I32 type; |
3789 | type = OP(scan); | |
ae5031b3 | 3790 | if (!next || OP(next) != type) /* No choice. */ |
c277df42 | 3791 | next = inner; /* Avoid recursion. */ |
a0d0e21e | 3792 | else { |
a3b680e6 | 3793 | const I32 lastparen = *PL_reglastparen; |
02db2b7b | 3794 | /* Put unwinding data on stack */ |
6136c704 AL |
3795 | const I32 unwind1 = SSNEWt(1,re_unwind_branch_t); |
3796 | re_unwind_branch_t * const uw = SSPTRt(unwind1,re_unwind_branch_t); | |
3797 | ||
5d9a96ca DM |
3798 | uw->prev = st->unwind; |
3799 | st->unwind = unwind1; | |
e822a8b4 | 3800 | uw->type = ((type == BRANCH) |
02db2b7b IZ |
3801 | ? RE_UNWIND_BRANCH |
3802 | : RE_UNWIND_BRANCHJ); | |
3803 | uw->lastparen = lastparen; | |
3804 | uw->next = next; | |
3805 | uw->locinput = locinput; | |
3806 | uw->nextchr = nextchr; | |
3a2830be | 3807 | uw->minmod = st->minmod; |
02db2b7b IZ |
3808 | #ifdef DEBUGGING |
3809 | uw->regindent = ++PL_regindent; | |
3810 | #endif | |
c277df42 | 3811 | |
02db2b7b IZ |
3812 | REGCP_SET(uw->lastcp); |
3813 | ||
3814 | /* Now go into the first branch */ | |
3815 | next = inner; | |
a687059c | 3816 | } |
a0d0e21e LW |
3817 | } |
3818 | break; | |
3819 | case MINMOD: | |
5d9a96ca | 3820 | st->minmod = 1; |
a0d0e21e | 3821 | break; |
c277df42 IZ |
3822 | case CURLYM: |
3823 | { | |
d8319b27 | 3824 | st->u.curlym.l = st->u.curlym.matches = 0; |
9041c2e3 | 3825 | |
c277df42 | 3826 | /* We suppose that the next guy does not need |
0e788c72 | 3827 | backtracking: in particular, it is of constant non-zero length, |
c277df42 | 3828 | and has no parenths to influence future backrefs. */ |
5d9a96ca | 3829 | st->ln = ARG1(scan); /* min to match */ |
c277df42 | 3830 | n = ARG2(scan); /* max to match */ |
d8319b27 DM |
3831 | st->u.curlym.paren = scan->flags; |
3832 | if (st->u.curlym.paren) { | |
3833 | if (st->u.curlym.paren > PL_regsize) | |
3834 | PL_regsize = st->u.curlym.paren; | |
3835 | if (st->u.curlym.paren > (I32)*PL_reglastparen) | |
3836 | *PL_reglastparen = st->u.curlym.paren; | |
c277df42 | 3837 | } |
dc45a647 | 3838 | scan = NEXTOPER(scan) + NODE_STEP_REGNODE; |
d8319b27 | 3839 | if (st->u.curlym.paren) |
c277df42 | 3840 | scan += NEXT_OFF(scan); /* Skip former OPEN. */ |
3280af22 | 3841 | PL_reginput = locinput; |
d8319b27 DM |
3842 | st->u.curlym.maxwanted = st->minmod ? st->ln : n; |
3843 | if (st->u.curlym.maxwanted) { | |
3844 | while (PL_reginput < PL_regeol && st->u.curlym.matches < st->u.curlym.maxwanted) { | |
95b24440 DM |
3845 | REGMATCH(scan, CURLYM1); |
3846 | /*** all unsaved local vars undefined at this point */ | |
3847 | if (!result) | |
6407bf3b | 3848 | break; |
d8319b27 DM |
3849 | /* on first match, determine length, u.curlym.l */ |
3850 | if (!st->u.curlym.matches++) { | |
6407bf3b DM |
3851 | if (PL_reg_match_utf8) { |
3852 | char *s = locinput; | |
3853 | while (s < PL_reginput) { | |
d8319b27 | 3854 | st->u.curlym.l++; |
6407bf3b DM |
3855 | s += UTF8SKIP(s); |
3856 | } | |
3857 | } | |
3858 | else { | |
d8319b27 | 3859 | st->u.curlym.l = PL_reginput - locinput; |
6407bf3b | 3860 | } |
d8319b27 DM |
3861 | if (st->u.curlym.l == 0) { |
3862 | st->u.curlym.matches = st->u.curlym.maxwanted; | |
6407bf3b DM |
3863 | break; |
3864 | } | |
3865 | } | |
3866 | locinput = PL_reginput; | |
3867 | } | |
3868 | } | |
3869 | ||
3870 | PL_reginput = locinput; | |
3871 | ||
5d9a96ca DM |
3872 | if (st->minmod) { |
3873 | st->minmod = 0; | |
d8319b27 | 3874 | if (st->ln && st->u.curlym.matches < st->ln) |
c277df42 | 3875 | sayNO; |
cca55fe3 | 3876 | if (HAS_TEXT(next) || JUMPABLE(next)) { |
5f80c4cf JP |
3877 | regnode *text_node = next; |
3878 | ||
cca55fe3 | 3879 | if (! HAS_TEXT(text_node)) FIND_NEXT_IMPT(text_node); |
5f80c4cf | 3880 | |
d8319b27 | 3881 | if (! HAS_TEXT(text_node)) st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
5f80c4cf | 3882 | else { |
cca55fe3 | 3883 | if (PL_regkind[(U8)OP(text_node)] == REF) { |
d8319b27 | 3884 | st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
44a68960 | 3885 | goto assume_ok_MM; |
cca55fe3 | 3886 | } |
d8319b27 | 3887 | else { st->u.curlym.c1 = (U8)*STRING(text_node); } |
af5decee | 3888 | if (OP(text_node) == EXACTF || OP(text_node) == REFF) |
d8319b27 | 3889 | st->u.curlym.c2 = PL_fold[st->u.curlym.c1]; |
af5decee | 3890 | else if (OP(text_node) == EXACTFL || OP(text_node) == REFFL) |
d8319b27 | 3891 | st->u.curlym.c2 = PL_fold_locale[st->u.curlym.c1]; |
5f80c4cf | 3892 | else |
d8319b27 | 3893 | st->u.curlym.c2 = st->u.curlym.c1; |
5f80c4cf | 3894 | } |
a0ed51b3 LW |
3895 | } |
3896 | else | |
d8319b27 | 3897 | st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
cca55fe3 | 3898 | assume_ok_MM: |
d8319b27 | 3899 | REGCP_SET(st->u.curlym.lastcp); |
5d9a96ca | 3900 | while (n >= st->ln || (n == REG_INFTY && st->ln > 0)) { /* ln overflow ? */ |
c277df42 | 3901 | /* If it could work, try it. */ |
d8319b27 DM |
3902 | if (st->u.curlym.c1 == -1000 || |
3903 | UCHARAT(PL_reginput) == st->u.curlym.c1 || | |
3904 | UCHARAT(PL_reginput) == st->u.curlym.c2) | |
c277df42 | 3905 | { |
d8319b27 | 3906 | if (st->u.curlym.paren) { |
5d9a96ca | 3907 | if (st->ln) { |
d8319b27 DM |
3908 | PL_regstartp[st->u.curlym.paren] = |
3909 | HOPc(PL_reginput, -st->u.curlym.l) - PL_bostr; | |
3910 | PL_regendp[st->u.curlym.paren] = PL_reginput - PL_bostr; | |
a0ed51b3 LW |
3911 | } |
3912 | else | |
d8319b27 | 3913 | PL_regendp[st->u.curlym.paren] = -1; |
c277df42 | 3914 | } |
95b24440 DM |
3915 | REGMATCH(next, CURLYM2); |
3916 | /*** all unsaved local vars undefined at this point */ | |
3917 | if (result) | |
c277df42 | 3918 | sayYES; |
d8319b27 | 3919 | REGCP_UNWIND(st->u.curlym.lastcp); |
c277df42 IZ |
3920 | } |
3921 | /* Couldn't or didn't -- move forward. */ | |
3280af22 | 3922 | PL_reginput = locinput; |
95b24440 DM |
3923 | REGMATCH(scan, CURLYM3); |
3924 | /*** all unsaved local vars undefined at this point */ | |
3925 | if (result) { | |
5d9a96ca | 3926 | st->ln++; |
3280af22 | 3927 | locinput = PL_reginput; |
c277df42 IZ |
3928 | } |
3929 | else | |
3930 | sayNO; | |
3931 | } | |
a0ed51b3 LW |
3932 | } |
3933 | else { | |
a3621e74 | 3934 | DEBUG_EXECUTE_r( |
5c0ca799 | 3935 | PerlIO_printf(Perl_debug_log, |
95b24440 DM |
3936 | "%*s matched %"IVdf" times, len=%"IVdf"...\n", |
3937 | (int)(REPORT_CODE_OFF+PL_regindent*2), "", | |
d8319b27 | 3938 | (IV) st->u.curlym.matches, (IV)st->u.curlym.l) |
c277df42 | 3939 | ); |
d8319b27 | 3940 | if (st->u.curlym.matches >= st->ln) { |
cca55fe3 | 3941 | if (HAS_TEXT(next) || JUMPABLE(next)) { |
5f80c4cf JP |
3942 | regnode *text_node = next; |
3943 | ||
cca55fe3 | 3944 | if (! HAS_TEXT(text_node)) FIND_NEXT_IMPT(text_node); |
5f80c4cf | 3945 | |
d8319b27 | 3946 | if (! HAS_TEXT(text_node)) st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
5f80c4cf | 3947 | else { |
cca55fe3 | 3948 | if (PL_regkind[(U8)OP(text_node)] == REF) { |
d8319b27 | 3949 | st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
44a68960 | 3950 | goto assume_ok_REG; |
cca55fe3 | 3951 | } |
d8319b27 | 3952 | else { st->u.curlym.c1 = (U8)*STRING(text_node); } |
cca55fe3 | 3953 | |
af5decee | 3954 | if (OP(text_node) == EXACTF || OP(text_node) == REFF) |
d8319b27 | 3955 | st->u.curlym.c2 = PL_fold[st->u.curlym.c1]; |
af5decee | 3956 | else if (OP(text_node) == EXACTFL || OP(text_node) == REFFL) |
d8319b27 | 3957 | st->u.curlym.c2 = PL_fold_locale[st->u.curlym.c1]; |
5f80c4cf | 3958 | else |
d8319b27 | 3959 | st->u.curlym.c2 = st->u.curlym.c1; |
5f80c4cf | 3960 | } |
a0ed51b3 LW |
3961 | } |
3962 | else | |
d8319b27 | 3963 | st->u.curlym.c1 = st->u.curlym.c2 = -1000; |
c277df42 | 3964 | } |
cca55fe3 | 3965 | assume_ok_REG: |
d8319b27 DM |
3966 | REGCP_SET(st->u.curlym.lastcp); |
3967 | while (st->u.curlym.matches >= st->ln) { | |
c277df42 | 3968 | /* If it could work, try it. */ |
d8319b27 DM |
3969 | if (st->u.curlym.c1 == -1000 || |
3970 | UCHARAT(PL_reginput) == st->u.curlym.c1 || | |
3971 | UCHARAT(PL_reginput) == st->u.curlym.c2) | |
a0ed51b3 | 3972 | { |
a3621e74 | 3973 | DEBUG_EXECUTE_r( |
6407bf3b DM |
3974 | PerlIO_printf(Perl_debug_log, |
3975 | "%*s trying tail with matches=%"IVdf"...\n", | |
3976 | (int)(REPORT_CODE_OFF+PL_regindent*2), | |
d8319b27 | 3977 | "", (IV)st->u.curlym.matches) |
a0ed51b3 | 3978 | ); |
d8319b27 DM |
3979 | if (st->u.curlym.paren) { |
3980 | if (st->u.curlym.matches) { | |
3981 | PL_regstartp[st->u.curlym.paren] | |
3982 | = HOPc(PL_reginput, -st->u.curlym.l) - PL_bostr; | |
3983 | PL_regendp[st->u.curlym.paren] = PL_reginput - PL_bostr; | |
c277df42 | 3984 | } |
a0ed51b3 | 3985 | else |
d8319b27 | 3986 | PL_regendp[st->u.curlym.paren] = -1; |
c277df42 | 3987 | } |
95b24440 DM |
3988 | REGMATCH(next, CURLYM4); |
3989 | /*** all unsaved local vars undefined at this point */ | |
3990 | if (result) | |
a0ed51b3 | 3991 | sayYES; |
d8319b27 | 3992 | REGCP_UNWIND(st->u.curlym.lastcp); |
a0ed51b3 | 3993 | } |
c277df42 | 3994 | /* Couldn't or didn't -- back up. */ |
d8319b27 DM |
3995 | st->u.curlym.matches--; |
3996 | locinput = HOPc(locinput, -st->u.curlym.l); | |
3280af22 | 3997 | PL_reginput = locinput; |
c277df42 IZ |
3998 | } |
3999 | } | |
4000 | sayNO; | |
5f66b61c | 4001 | /* NOTREACHED */ |
c277df42 IZ |
4002 | break; |
4003 | } | |
4004 | case CURLYN: | |
d8319b27 DM |
4005 | st->u.plus.paren = scan->flags; /* Which paren to set */ |
4006 | if (st->u.plus.paren > PL_regsize) | |
4007 | PL_regsize = st->u.plus.paren; | |
4008 | if (st->u.plus.paren > (I32)*PL_reglastparen) | |
4009 | *PL_reglastparen = st->u.plus.paren; | |
5d9a96ca | 4010 | st->ln = ARG1(scan); /* min to match */ |
c277df42 | 4011 | n = ARG2(scan); /* max to match */ |
dc45a647 | 4012 | scan = regnext(NEXTOPER(scan) + NODE_STEP_REGNODE); |
c277df42 | 4013 | goto repeat; |
a0d0e21e | 4014 | case CURLY: |
d8319b27 | 4015 | st->u.plus.paren = 0; |
5d9a96ca | 4016 | st->ln = ARG1(scan); /* min to match */ |
a0d0e21e | 4017 | n = ARG2(scan); /* max to match */ |
dc45a647 | 4018 | scan = NEXTOPER(scan) + NODE_STEP_REGNODE; |
a0d0e21e LW |
4019 | goto repeat; |
4020 | case STAR: | |
5d9a96ca | 4021 | st->ln = 0; |
c277df42 | 4022 | n = REG_INFTY; |
a0d0e21e | 4023 | scan = NEXTOPER(scan); |
d8319b27 | 4024 | st->u.plus.paren = 0; |
a0d0e21e LW |
4025 | goto repeat; |
4026 | case PLUS: | |
5d9a96ca | 4027 | st->ln = 1; |
c277df42 IZ |
4028 | n = REG_INFTY; |
4029 | scan = NEXTOPER(scan); | |
d8319b27 | 4030 | st->u.plus.paren = 0; |
c277df42 | 4031 | repeat: |
a0d0e21e LW |
4032 | /* |
4033 | * Lookahead to avoid useless match attempts | |
4034 | * when we know what character comes next. | |
4035 | */ | |
5f80c4cf JP |
4036 | |
4037 | /* | |
4038 | * Used to only do .*x and .*?x, but now it allows | |
4039 | * for )'s, ('s and (?{ ... })'s to be in the way | |
4040 | * of the quantifier and the EXACT-like node. -- japhy | |
4041 | */ | |
4042 | ||
cca55fe3 | 4043 | if (HAS_TEXT(next) || JUMPABLE(next)) { |
5f80c4cf JP |
4044 | U8 *s; |
4045 | regnode *text_node = next; | |
4046 | ||
cca55fe3 | 4047 | if (! HAS_TEXT(text_node)) FIND_NEXT_IMPT(text_node); |
5f80c4cf | 4048 | |
d8319b27 | 4049 | if (! HAS_TEXT(text_node)) st->u.plus.c1 = st->u.plus.c2 = -1000; |
5f80c4cf | 4050 | else { |
cca55fe3 | 4051 | if (PL_regkind[(U8)OP(text_node)] == REF) { |
d8319b27 | 4052 | st->u.plus.c1 = st->u.plus.c2 = -1000; |
44a68960 | 4053 | goto assume_ok_easy; |
cca55fe3 JP |
4054 | } |
4055 | else { s = (U8*)STRING(text_node); } | |
5f80c4cf JP |
4056 | |
4057 | if (!UTF) { | |
d8319b27 | 4058 | st->u.plus.c2 = st->u.plus.c1 = *s; |
f65d3ee7 | 4059 | if (OP(text_node) == EXACTF || OP(text_node) == REFF) |
d8319b27 | 4060 | st->u.plus.c2 = PL_fold[st->u.plus.c1]; |
f65d3ee7 | 4061 | else if (OP(text_node) == EXACTFL || OP(text_node) == REFFL) |
d8319b27 | 4062 | st->u.plus.c2 = PL_fold_locale[st->u.plus.c1]; |
1aa99e6b | 4063 | } |
5f80c4cf | 4064 | else { /* UTF */ |
f65d3ee7 | 4065 | if (OP(text_node) == EXACTF || OP(text_node) == REFF) { |
a2a2844f | 4066 | STRLEN ulen1, ulen2; |
89ebb4a3 JH |
4067 | U8 tmpbuf1[UTF8_MAXBYTES_CASE+1]; |
4068 | U8 tmpbuf2[UTF8_MAXBYTES_CASE+1]; | |
a2a2844f JH |
4069 | |
4070 | to_utf8_lower((U8*)s, tmpbuf1, &ulen1); | |
4071 | to_utf8_upper((U8*)s, tmpbuf2, &ulen2); | |
4072 | ||
d8319b27 | 4073 | st->u.plus.c1 = utf8n_to_uvuni(tmpbuf1, UTF8_MAXBYTES, 0, |
041457d9 | 4074 | uniflags); |
d8319b27 | 4075 | st->u.plus.c2 = utf8n_to_uvuni(tmpbuf2, UTF8_MAXBYTES, 0, |
041457d9 | 4076 | uniflags); |
5f80c4cf JP |
4077 | } |
4078 | else { | |
d8319b27 | 4079 | st->u.plus.c2 = st->u.plus.c1 = utf8n_to_uvchr(s, UTF8_MAXBYTES, 0, |
041457d9 | 4080 | uniflags); |
5f80c4cf | 4081 | } |
1aa99e6b IH |
4082 | } |
4083 | } | |
bbce6d69 | 4084 | } |
a0d0e21e | 4085 | else |
d8319b27 | 4086 | st->u.plus.c1 = st->u.plus.c2 = -1000; |
cca55fe3 | 4087 | assume_ok_easy: |
3280af22 | 4088 | PL_reginput = locinput; |
5d9a96ca DM |
4089 | if (st->minmod) { |
4090 | st->minmod = 0; | |
32fc9b6a | 4091 | if (st->ln && regrepeat(rex, scan, st->ln) < st->ln) |
4633a7c4 | 4092 | sayNO; |
a0ed51b3 | 4093 | locinput = PL_reginput; |
d8319b27 DM |
4094 | REGCP_SET(st->u.plus.lastcp); |
4095 | if (st->u.plus.c1 != -1000) { | |
4096 | st->u.plus.old = locinput; | |
4097 | st->u.plus.count = 0; | |
0fe9bf95 | 4098 | |
1aa99e6b | 4099 | if (n == REG_INFTY) { |
d8319b27 | 4100 | st->u.plus.e = PL_regeol - 1; |
1aa99e6b | 4101 | if (do_utf8) |
d8319b27 DM |
4102 | while (UTF8_IS_CONTINUATION(*(U8*)st->u.plus.e)) |
4103 | st->u.plus.e--; | |
1aa99e6b IH |
4104 | } |
4105 | else if (do_utf8) { | |
5d9a96ca | 4106 | int m = n - st->ln; |
d8319b27 DM |
4107 | for (st->u.plus.e = locinput; |
4108 | m >0 && st->u.plus.e + UTF8SKIP(st->u.plus.e) <= PL_regeol; m--) | |
4109 | st->u.plus.e += UTF8SKIP(st->u.plus.e); | |
1aa99e6b IH |
4110 | } |
4111 | else { | |
d8319b27 DM |
4112 | st->u.plus.e = locinput + n - st->ln; |
4113 | if (st->u.plus.e >= PL_regeol) | |
4114 | st->u.plus.e = PL_regeol - 1; | |
1aa99e6b | 4115 | } |
0fe9bf95 IZ |
4116 | while (1) { |
4117 | /* Find place 'next' could work */ | |
1aa99e6b | 4118 | if (!do_utf8) { |
d8319b27 DM |
4119 | if (st->u.plus.c1 == st->u.plus.c2) { |
4120 | while (locinput <= st->u.plus.e && | |
4121 | UCHARAT(locinput) != st->u.plus.c1) | |
1aa99e6b IH |
4122 | locinput++; |
4123 | } else { | |
d8319b27 DM |
4124 | while (locinput <= st->u.plus.e |
4125 | && UCHARAT(locinput) != st->u.plus.c1 | |
4126 | && UCHARAT(locinput) != st->u.plus.c2) | |
1aa99e6b IH |
4127 | locinput++; |
4128 | } | |
d8319b27 | 4129 | st->u.plus.count = locinput - st->u.plus.old; |
1aa99e6b IH |
4130 | } |
4131 | else { | |
d8319b27 | 4132 | if (st->u.plus.c1 == st->u.plus.c2) { |
a3b680e6 | 4133 | STRLEN len; |
872c91ae JH |
4134 | /* count initialised to |
4135 | * utf8_distance(old, locinput) */ | |
d8319b27 | 4136 | while (locinput <= st->u.plus.e && |
872c91ae | 4137 | utf8n_to_uvchr((U8*)locinput, |
89ebb4a3 | 4138 | UTF8_MAXBYTES, &len, |
d8319b27 | 4139 | uniflags) != (UV)st->u.plus.c1) { |
1aa99e6b | 4140 | locinput += len; |
d8319b27 | 4141 | st->u.plus.count++; |
b2f2f093 | 4142 | } |
1aa99e6b | 4143 | } else { |
a3b680e6 | 4144 | STRLEN len; |
872c91ae JH |
4145 | /* count initialised to |
4146 | * utf8_distance(old, locinput) */ | |
d8319b27 | 4147 | while (locinput <= st->u.plus.e) { |
872c91ae | 4148 | UV c = utf8n_to_uvchr((U8*)locinput, |
89ebb4a3 | 4149 | UTF8_MAXBYTES, &len, |
041457d9 | 4150 | uniflags); |
d8319b27 | 4151 | if (c == (UV)st->u.plus.c1 || c == (UV)st->u.plus.c2) |
1aa99e6b | 4152 | break; |
b2f2f093 | 4153 | locinput += len; |
d8319b27 | 4154 | st->u.plus.count++; |
1aa99e6b IH |
4155 | } |
4156 | } | |
0fe9bf95 | 4157 | } |
d8319b27 | 4158 | if (locinput > st->u.plus.e) |
0fe9bf95 IZ |
4159 | sayNO; |
4160 | /* PL_reginput == old now */ | |
d8319b27 | 4161 | if (locinput != st->u.plus.old) { |
5d9a96ca | 4162 | st->ln = 1; /* Did some */ |
32fc9b6a | 4163 | if (regrepeat(rex, scan, st->u.plus.count) < st->u.plus.count) |
0fe9bf95 IZ |
4164 | sayNO; |
4165 | } | |
4166 | /* PL_reginput == locinput now */ | |
d8319b27 | 4167 | TRYPAREN(st->u.plus.paren, st->ln, locinput, PLUS1); |
95b24440 | 4168 | /*** all unsaved local vars undefined at this point */ |
0fe9bf95 | 4169 | PL_reginput = locinput; /* Could be reset... */ |
d8319b27 | 4170 | REGCP_UNWIND(st->u.plus.lastcp); |
0fe9bf95 | 4171 | /* Couldn't or didn't -- move forward. */ |
d8319b27 | 4172 | st->u.plus.old = locinput; |
1aa99e6b IH |
4173 | if (do_utf8) |
4174 | locinput += UTF8SKIP(locinput); | |
4175 | else | |
4176 | locinput++; | |
d8319b27 | 4177 | st->u.plus.count = 1; |
0fe9bf95 IZ |
4178 | } |
4179 | } | |
4180 | else | |
5d9a96ca | 4181 | while (n >= st->ln || (n == REG_INFTY && st->ln > 0)) { /* ln overflow ? */ |
1aa99e6b | 4182 | UV c; |
d8319b27 | 4183 | if (st->u.plus.c1 != -1000) { |
1aa99e6b | 4184 | if (do_utf8) |
872c91ae | 4185 | c = utf8n_to_uvchr((U8*)PL_reginput, |
89ebb4a3 | 4186 | UTF8_MAXBYTES, 0, |
041457d9 | 4187 | uniflags); |
1aa99e6b | 4188 | else |
9041c2e3 | 4189 | c = UCHARAT(PL_reginput); |
2390ecbc | 4190 | /* If it could work, try it. */ |
d8319b27 | 4191 | if (c == (UV)st->u.plus.c1 || c == (UV)st->u.plus.c2) |
2390ecbc | 4192 | { |
d8319b27 | 4193 | TRYPAREN(st->u.plus.paren, st->ln, PL_reginput, PLUS2); |
95b24440 | 4194 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 4195 | REGCP_UNWIND(st->u.plus.lastcp); |
2390ecbc | 4196 | } |
1aa99e6b | 4197 | } |
a0d0e21e | 4198 | /* If it could work, try it. */ |
d8319b27 | 4199 | else if (st->u.plus.c1 == -1000) |
bbce6d69 | 4200 | { |
d8319b27 | 4201 | TRYPAREN(st->u.plus.paren, st->ln, PL_reginput, PLUS3); |
95b24440 | 4202 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 4203 | REGCP_UNWIND(st->u.plus.lastcp); |
bbce6d69 | 4204 | } |
c277df42 | 4205 | /* Couldn't or didn't -- move forward. */ |
a0ed51b3 | 4206 | PL_reginput = locinput; |
32fc9b6a | 4207 | if (regrepeat(rex, scan, 1)) { |
5d9a96ca | 4208 | st->ln++; |
a0ed51b3 LW |
4209 | locinput = PL_reginput; |
4210 | } | |
4211 | else | |
4633a7c4 | 4212 | sayNO; |
a0d0e21e LW |
4213 | } |
4214 | } | |
4215 | else { | |
32fc9b6a | 4216 | n = regrepeat(rex, scan, n); |
a0ed51b3 | 4217 | locinput = PL_reginput; |
5d9a96ca | 4218 | if (st->ln < n && PL_regkind[(U8)OP(next)] == EOL && |
7fba1cd6 | 4219 | (OP(next) != MEOL || |
15272685 HS |
4220 | OP(next) == SEOL || OP(next) == EOS)) |
4221 | { | |
5d9a96ca | 4222 | st->ln = n; /* why back off? */ |
1aeab75a GS |
4223 | /* ...because $ and \Z can match before *and* after |
4224 | newline at the end. Consider "\n\n" =~ /\n+\Z\n/. | |
4225 | We should back off by one in this case. */ | |
4226 | if (UCHARAT(PL_reginput - 1) == '\n' && OP(next) != EOS) | |
5d9a96ca | 4227 | st->ln--; |
1aeab75a | 4228 | } |
d8319b27 | 4229 | REGCP_SET(st->u.plus.lastcp); |
1d5c262f | 4230 | { |
8fa7f367 | 4231 | UV c = 0; |
5d9a96ca | 4232 | while (n >= st->ln) { |
d8319b27 | 4233 | if (st->u.plus.c1 != -1000) { |
1aa99e6b | 4234 | if (do_utf8) |
872c91ae | 4235 | c = utf8n_to_uvchr((U8*)PL_reginput, |
89ebb4a3 | 4236 | UTF8_MAXBYTES, 0, |
041457d9 | 4237 | uniflags); |
1aa99e6b | 4238 | else |
9041c2e3 | 4239 | c = UCHARAT(PL_reginput); |
1aa99e6b | 4240 | } |
c277df42 | 4241 | /* If it could work, try it. */ |
d8319b27 | 4242 | if (st->u.plus.c1 == -1000 || c == (UV)st->u.plus.c1 || c == (UV)st->u.plus.c2) |
c277df42 | 4243 | { |
d8319b27 | 4244 | TRYPAREN(st->u.plus.paren, n, PL_reginput, PLUS4); |
95b24440 | 4245 | /*** all unsaved local vars undefined at this point */ |
d8319b27 | 4246 | REGCP_UNWIND(st->u.plus.lastcp); |
c277df42 IZ |
4247 | } |
4248 | /* Couldn't or didn't -- back up. */ | |
4249 | n--; | |
dfe13c55 | 4250 | PL_reginput = locinput = HOPc(locinput, -1); |
bbce6d69 | 4251 | } |
a0d0e21e LW |
4252 | } |
4253 | } | |
4633a7c4 | 4254 | sayNO; |
c277df42 | 4255 | break; |
a0d0e21e | 4256 | case END: |
aa283a38 DM |
4257 | if (cur_eval) { |
4258 | /* we have successfully completed the execution of a | |
4259 | * postponed re. Pop all states back to the last EVAL | |
4260 | * then continue with the node following the (??{...}) | |
4261 | */ | |
4262 | ||
4263 | /* this simulates a POP_STATE, except that it pops several | |
4264 | * levels, and doesn't restore locinput */ | |
6136c704 | 4265 | |
aa283a38 DM |
4266 | st = cur_eval; |
4267 | PL_regmatch_slab = st->u.eval.prev_slab; | |
4268 | cur_eval = st->u.eval.prev_eval; | |
4269 | depth = st->u.eval.depth; | |
6136c704 | 4270 | |
aa283a38 DM |
4271 | PL_regmatch_state = st; |
4272 | scan = st->scan; | |
4273 | next = st->next; | |
4274 | n = st->n; | |
4275 | ||
4276 | if (st->u.eval.toggleutf) | |
4277 | PL_reg_flags ^= RF_utf8; | |
4278 | ReREFCNT_dec(rex); | |
4279 | rex = st->u.eval.prev_rex; | |
aa283a38 DM |
4280 | /* XXXX This is too dramatic a measure... */ |
4281 | PL_reg_maxiter = 0; | |
4282 | ||
4283 | /* Restore parens of the caller without popping the | |
4284 | * savestack */ | |
95b24440 DM |
4285 | { |
4286 | I32 tmp = PL_savestack_ix; | |
aa283a38 | 4287 | PL_savestack_ix = st->u.eval.lastcp; |
4f639d21 | 4288 | regcppop(rex); |
95b24440 DM |
4289 | PL_savestack_ix = tmp; |
4290 | } | |
6136c704 | 4291 | |
6136c704 | 4292 | |
aa283a38 DM |
4293 | PL_reginput = locinput; |
4294 | /* resume at node following the (??{...}) */ | |
4295 | break; | |
0f5d15d6 | 4296 | |
0f5d15d6 | 4297 | } |
aa283a38 | 4298 | |
3b0527fe | 4299 | if (locinput < reginfo->till) { |
a3621e74 | 4300 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, |
7821416a IZ |
4301 | "%sMatch possible, but length=%ld is smaller than requested=%ld, failing!%s\n", |
4302 | PL_colors[4], | |
4303 | (long)(locinput - PL_reg_starttry), | |
3b0527fe | 4304 | (long)(reginfo->till - PL_reg_starttry), |
7821416a IZ |
4305 | PL_colors[5])); |
4306 | sayNO_FINAL; /* Cannot match: too short. */ | |
4307 | } | |
4308 | PL_reginput = locinput; /* put where regtry can find it */ | |
4309 | sayYES_FINAL; /* Success! */ | |
7e5428c5 | 4310 | case SUCCEED: |
3280af22 | 4311 | PL_reginput = locinput; /* put where regtry can find it */ |
7821416a | 4312 | sayYES_LOUD; /* Success! */ |
c277df42 IZ |
4313 | case SUSPEND: |
4314 | n = 1; | |
9fe1d20c | 4315 | PL_reginput = locinput; |
9041c2e3 | 4316 | goto do_ifmatch; |
a0d0e21e | 4317 | case UNLESSM: |
c277df42 | 4318 | n = 0; |
a0ed51b3 | 4319 | if (scan->flags) { |
52657f30 | 4320 | char * const s = HOPBACKc(locinput, scan->flags); |
efb30f32 HS |
4321 | if (!s) |
4322 | goto say_yes; | |
4323 | PL_reginput = s; | |
a0ed51b3 LW |
4324 | } |
4325 | else | |
4326 | PL_reginput = locinput; | |
c277df42 IZ |
4327 | goto do_ifmatch; |
4328 | case IFMATCH: | |
4329 | n = 1; | |
a0ed51b3 | 4330 | if (scan->flags) { |
52657f30 | 4331 | char * const s = HOPBACKc(locinput, scan->flags); |
efb30f32 HS |
4332 | if (!s) |
4333 | goto say_no; | |
4334 | PL_reginput = s; | |
a0ed51b3 LW |
4335 | } |
4336 | else | |
4337 | PL_reginput = locinput; | |
4338 | ||
c277df42 | 4339 | do_ifmatch: |
95b24440 DM |
4340 | REGMATCH(NEXTOPER(NEXTOPER(scan)), IFMATCH); |
4341 | /*** all unsaved local vars undefined at this point */ | |
4342 | if (result != n) { | |
c277df42 | 4343 | say_no: |
5d9a96ca DM |
4344 | if (st->logical) { |
4345 | st->logical = 0; | |
4346 | st->sw = 0; | |
c277df42 | 4347 | goto do_longjump; |
a0ed51b3 LW |
4348 | } |
4349 | else | |
c277df42 IZ |
4350 | sayNO; |
4351 | } | |
4352 | say_yes: | |
5d9a96ca DM |
4353 | if (st->logical) { |
4354 | st->logical = 0; | |
4355 | st->sw = 1; | |
c277df42 | 4356 | } |
fe44a5e8 | 4357 | if (OP(scan) == SUSPEND) { |
3280af22 | 4358 | locinput = PL_reginput; |
565764a8 | 4359 | nextchr = UCHARAT(locinput); |
fe44a5e8 | 4360 | } |
c277df42 IZ |
4361 | /* FALL THROUGH. */ |
4362 | case LONGJMP: | |
4363 | do_longjump: | |
4364 | next = scan + ARG(scan); | |
4365 | if (next == scan) | |
4366 | next = NULL; | |
a0d0e21e LW |
4367 | break; |
4368 | default: | |
b900a521 | 4369 | PerlIO_printf(Perl_error_log, "%"UVxf" %d\n", |
d7d93a81 | 4370 | PTR2UV(scan), OP(scan)); |
cea2e8a9 | 4371 | Perl_croak(aTHX_ "regexp memory corruption"); |
a687059c | 4372 | } |
95b24440 | 4373 | |
02db2b7b | 4374 | reenter: |
a0d0e21e | 4375 | scan = next; |
95b24440 DM |
4376 | continue; |
4377 | /* NOTREACHED */ | |
4378 | ||
4379 | /* simulate recursively calling regmatch(), but without actually | |
4380 | * recursing - ie save the current state on the heap rather than on | |
4381 | * the stack, then re-enter the loop. This avoids complex regexes | |
4382 | * blowing the processor stack */ | |
4383 | ||
4384 | start_recurse: | |
4385 | { | |
5d9a96ca DM |
4386 | /* push new state */ |
4387 | regmatch_state *oldst = st; | |
4388 | ||
4389 | depth++; | |
4390 | ||
4391 | /* grab the next free state slot */ | |
4392 | st++; | |
86545054 | 4393 | if (st > SLAB_LAST(PL_regmatch_slab)) |
5d9a96ca DM |
4394 | st = S_push_slab(aTHX); |
4395 | PL_regmatch_state = st; | |
4396 | ||
4397 | oldst->next = next; | |
4398 | oldst->n = n; | |
4399 | oldst->locinput = locinput; | |
5d9a96ca DM |
4400 | |
4401 | st->cc = oldst->cc; | |
95b24440 DM |
4402 | locinput = PL_reginput; |
4403 | nextchr = UCHARAT(locinput); | |
5d9a96ca DM |
4404 | st->minmod = 0; |
4405 | st->sw = 0; | |
4406 | st->logical = 0; | |
4407 | st->unwind = 0; | |
95b24440 DM |
4408 | #ifdef DEBUGGING |
4409 | PL_regindent++; | |
4410 | #endif | |
4411 | } | |
a0d0e21e | 4412 | } |
a687059c | 4413 | |
aa283a38 DM |
4414 | |
4415 | ||
a0d0e21e LW |
4416 | /* |
4417 | * We get here only if there's trouble -- normally "case END" is | |
4418 | * the terminating point. | |
4419 | */ | |
cea2e8a9 | 4420 | Perl_croak(aTHX_ "corrupted regexp pointers"); |
a0d0e21e | 4421 | /*NOTREACHED*/ |
4633a7c4 LW |
4422 | sayNO; |
4423 | ||
7821416a | 4424 | yes_loud: |
a3621e74 | 4425 | DEBUG_EXECUTE_r( |
7821416a IZ |
4426 | PerlIO_printf(Perl_debug_log, |
4427 | "%*s %scould match...%s\n", | |
e4584336 | 4428 | REPORT_CODE_OFF+PL_regindent*2, "", PL_colors[4], PL_colors[5]) |
7821416a IZ |
4429 | ); |
4430 | goto yes; | |
4431 | yes_final: | |
a3621e74 | 4432 | DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch successful!%s\n", |
e4584336 | 4433 | PL_colors[4], PL_colors[5])); |
4633a7c4 LW |
4434 | yes: |
4435 | #ifdef DEBUGGING | |
3280af22 | 4436 | PL_regindent--; |
4633a7c4 | 4437 | #endif |
02db2b7b | 4438 | |
95b24440 | 4439 | result = 1; |
aa283a38 DM |
4440 | /* XXX this is duplicate(ish) code to that in the do_no section. |
4441 | * eventually a yes should just pop the whole stack */ | |
4442 | if (depth) { | |
4443 | /* restore previous state and re-enter */ | |
4444 | POP_STATE; | |
4445 | ||
4446 | switch (st->resume_state) { | |
4447 | case resume_TRIE1: | |
4448 | goto resume_point_TRIE1; | |
4449 | case resume_TRIE2: | |
4450 | goto resume_point_TRIE2; | |
4451 | case resume_EVAL: | |
4452 | break; | |
4453 | case resume_CURLYX: | |
4454 | goto resume_point_CURLYX; | |
4455 | case resume_WHILEM1: | |
4456 | goto resume_point_WHILEM1; | |
4457 | case resume_WHILEM2: | |
4458 | goto resume_point_WHILEM2; | |
4459 | case resume_WHILEM3: | |
4460 | goto resume_point_WHILEM3; | |
4461 | case resume_WHILEM4: | |
4462 | goto resume_point_WHILEM4; | |
4463 | case resume_WHILEM5: | |
4464 | goto resume_point_WHILEM5; | |
4465 | case resume_WHILEM6: | |
4466 | goto resume_point_WHILEM6; | |
4467 | case resume_CURLYM1: | |
4468 | goto resume_point_CURLYM1; | |
4469 | case resume_CURLYM2: | |
4470 | goto resume_point_CURLYM2; | |
4471 | case resume_CURLYM3: | |
4472 | goto resume_point_CURLYM3; | |
4473 | case resume_CURLYM4: | |
4474 | goto resume_point_CURLYM4; | |
4475 | case resume_IFMATCH: | |
4476 | goto resume_point_IFMATCH; | |
4477 | case resume_PLUS1: | |
4478 | goto resume_point_PLUS1; | |
4479 | case resume_PLUS2: | |
4480 | goto resume_point_PLUS2; | |
4481 | case resume_PLUS3: | |
4482 | goto resume_point_PLUS3; | |
4483 | case resume_PLUS4: | |
4484 | goto resume_point_PLUS4; | |
4485 | default: | |
4486 | Perl_croak(aTHX_ "regexp resume memory corruption"); | |
4487 | } | |
4488 | } | |
4489 | goto final_exit; | |
4633a7c4 LW |
4490 | |
4491 | no: | |
a3621e74 | 4492 | DEBUG_EXECUTE_r( |
7821416a IZ |
4493 | PerlIO_printf(Perl_debug_log, |
4494 | "%*s %sfailed...%s\n", | |
e4584336 | 4495 | REPORT_CODE_OFF+PL_regindent*2, "", PL_colors[4], PL_colors[5]) |
7821416a IZ |
4496 | ); |
4497 | goto do_no; | |
4498 | no_final: | |
4499 | do_no: | |
5d9a96ca DM |
4500 | if (st->unwind) { |
4501 | re_unwind_t * const uw = SSPTRt(st->unwind,re_unwind_t); | |
02db2b7b IZ |
4502 | |
4503 | switch (uw->type) { | |
4504 | case RE_UNWIND_BRANCH: | |
4505 | case RE_UNWIND_BRANCHJ: | |
4506 | { | |
6136c704 | 4507 | re_unwind_branch_t * const uwb = &(uw->branch); |
a3b680e6 | 4508 | const I32 lastparen = uwb->lastparen; |
9041c2e3 | 4509 | |
02db2b7b IZ |
4510 | REGCP_UNWIND(uwb->lastcp); |
4511 | for (n = *PL_reglastparen; n > lastparen; n--) | |
4512 | PL_regendp[n] = -1; | |
4513 | *PL_reglastparen = n; | |
4514 | scan = next = uwb->next; | |
3a2830be | 4515 | st->minmod = uwb->minmod; |
9041c2e3 NIS |
4516 | if ( !scan || |
4517 | OP(scan) != (uwb->type == RE_UNWIND_BRANCH | |
02db2b7b | 4518 | ? BRANCH : BRANCHJ) ) { /* Failure */ |
5d9a96ca | 4519 | st->unwind = uwb->prev; |
02db2b7b IZ |
4520 | #ifdef DEBUGGING |
4521 | PL_regindent--; | |
4522 | #endif | |
4523 | goto do_no; | |
4524 | } | |
4525 | /* Have more choice yet. Reuse the same uwb. */ | |
02db2b7b IZ |
4526 | if ((n = (uwb->type == RE_UNWIND_BRANCH |
4527 | ? NEXT_OFF(next) : ARG(next)))) | |
4528 | next += n; | |
4529 | else | |
4530 | next = NULL; /* XXXX Needn't unwinding in this case... */ | |
4531 | uwb->next = next; | |
4532 | next = NEXTOPER(scan); | |
4533 | if (uwb->type == RE_UNWIND_BRANCHJ) | |
4534 | next = NEXTOPER(next); | |
4535 | locinput = uwb->locinput; | |
4536 | nextchr = uwb->nextchr; | |
4537 | #ifdef DEBUGGING | |
4538 | PL_regindent = uwb->regindent; | |
4539 | #endif | |
4540 | ||
4541 | goto reenter; | |
4542 | } | |
5f66b61c | 4543 | /* NOTREACHED */ |
02db2b7b IZ |
4544 | default: |
4545 | Perl_croak(aTHX_ "regexp unwind memory corruption"); | |
4546 | } | |
5f66b61c | 4547 | /* NOTREACHED */ |
02db2b7b | 4548 | } |
aa283a38 | 4549 | |
4633a7c4 | 4550 | #ifdef DEBUGGING |
3280af22 | 4551 | PL_regindent--; |
4633a7c4 | 4552 | #endif |
95b24440 | 4553 | result = 0; |
5d9a96ca | 4554 | |
aa283a38 DM |
4555 | if (depth) { |
4556 | /* there's a previous state to backtrack to */ | |
4557 | POP_STATE; | |
5d9a96ca | 4558 | switch (st->resume_state) { |
95b24440 DM |
4559 | case resume_TRIE1: |
4560 | goto resume_point_TRIE1; | |
4561 | case resume_TRIE2: | |
4562 | goto resume_point_TRIE2; | |
aa283a38 DM |
4563 | case resume_EVAL: |
4564 | /* we have failed an (??{...}). Restore state to the outer re | |
4565 | * then re-throw the failure */ | |
4566 | if (st->u.eval.toggleutf) | |
4567 | PL_reg_flags ^= RF_utf8; | |
4568 | ReREFCNT_dec(rex); | |
4569 | rex = st->u.eval.prev_rex; | |
aa283a38 DM |
4570 | cur_eval = st->u.eval.prev_eval; |
4571 | ||
4572 | /* XXXX This is too dramatic a measure... */ | |
4573 | PL_reg_maxiter = 0; | |
4574 | ||
4575 | PL_reginput = locinput; | |
4576 | REGCP_UNWIND(st->u.eval.lastcp); | |
4577 | regcppop(rex); | |
4578 | goto do_no; | |
4579 | ||
95b24440 DM |
4580 | case resume_CURLYX: |
4581 | goto resume_point_CURLYX; | |
4582 | case resume_WHILEM1: | |
4583 | goto resume_point_WHILEM1; | |
4584 | case resume_WHILEM2: | |
4585 | goto resume_point_WHILEM2; | |
4586 | case resume_WHILEM3: | |
4587 | goto resume_point_WHILEM3; | |
4588 | case resume_WHILEM4: | |
4589 | goto resume_point_WHILEM4; | |
4590 | case resume_WHILEM5: | |
4591 | goto resume_point_WHILEM5; | |
4592 | case resume_WHILEM6: | |
4593 | goto resume_point_WHILEM6; | |
4594 | case resume_CURLYM1: | |
4595 | goto resume_point_CURLYM1; | |
4596 | case resume_CURLYM2: | |
4597 | goto resume_point_CURLYM2; | |
4598 | case resume_CURLYM3: | |
4599 | goto resume_point_CURLYM3; | |
4600 | case resume_CURLYM4: | |
4601 | goto resume_point_CURLYM4; | |
4602 | case resume_IFMATCH: | |
4603 | goto resume_point_IFMATCH; | |
4604 | case resume_PLUS1: | |
4605 | goto resume_point_PLUS1; | |
4606 | case resume_PLUS2: | |
4607 | goto resume_point_PLUS2; | |
4608 | case resume_PLUS3: | |
4609 | goto resume_point_PLUS3; | |
4610 | case resume_PLUS4: | |
4611 | goto resume_point_PLUS4; | |
95b24440 DM |
4612 | default: |
4613 | Perl_croak(aTHX_ "regexp resume memory corruption"); | |
4614 | } | |
95b24440 | 4615 | } |
aa283a38 DM |
4616 | |
4617 | final_exit: | |
4618 | ||
5d9a96ca DM |
4619 | /* restore original high-water mark */ |
4620 | PL_regmatch_slab = orig_slab; | |
4621 | PL_regmatch_state = orig_state; | |
4622 | ||
4623 | /* free all slabs above current one */ | |
4624 | if (orig_slab->next) { | |
ad65c075 | 4625 | regmatch_slab *osl, *sl = orig_slab->next; |
5d9a96ca DM |
4626 | orig_slab->next = NULL; |
4627 | while (sl) { | |
ad65c075 | 4628 | osl = sl; |
5d9a96ca | 4629 | sl = sl->next; |
ad65c075 | 4630 | Safefree(osl); |
5d9a96ca DM |
4631 | } |
4632 | } | |
4633 | ||
95b24440 DM |
4634 | return result; |
4635 | ||
a687059c LW |
4636 | } |
4637 | ||
4638 | /* | |
4639 | - regrepeat - repeatedly match something simple, report how many | |
4640 | */ | |
4641 | /* | |
4642 | * [This routine now assumes that it will only match on things of length 1. | |
4643 | * That was true before, but now we assume scan - reginput is the count, | |
a0ed51b3 | 4644 | * rather than incrementing count on every character. [Er, except utf8.]] |
a687059c | 4645 | */ |
76e3520e | 4646 | STATIC I32 |
32fc9b6a | 4647 | S_regrepeat(pTHX_ const regexp *prog, const regnode *p, I32 max) |
a687059c | 4648 | { |
27da23d5 | 4649 | dVAR; |
a0d0e21e | 4650 | register char *scan; |
a0d0e21e | 4651 | register I32 c; |
3280af22 | 4652 | register char *loceol = PL_regeol; |
a0ed51b3 | 4653 | register I32 hardcount = 0; |
53c4c00c | 4654 | register bool do_utf8 = PL_reg_match_utf8; |
a0d0e21e | 4655 | |
3280af22 | 4656 | scan = PL_reginput; |
faf11cac HS |
4657 | if (max == REG_INFTY) |
4658 | max = I32_MAX; | |
4659 | else if (max < loceol - scan) | |
7f596f4c | 4660 | loceol = scan + max; |
a0d0e21e | 4661 | switch (OP(p)) { |
22c35a8c | 4662 | case REG_ANY: |
1aa99e6b | 4663 | if (do_utf8) { |
ffc61ed2 | 4664 | loceol = PL_regeol; |
1aa99e6b | 4665 | while (scan < loceol && hardcount < max && *scan != '\n') { |
ffc61ed2 JH |
4666 | scan += UTF8SKIP(scan); |
4667 | hardcount++; | |
4668 | } | |
4669 | } else { | |
4670 | while (scan < loceol && *scan != '\n') | |
4671 | scan++; | |
a0ed51b3 LW |
4672 | } |
4673 | break; | |
ffc61ed2 | 4674 | case SANY: |
def8e4ea JH |
4675 | if (do_utf8) { |
4676 | loceol = PL_regeol; | |
a0804c9e | 4677 | while (scan < loceol && hardcount < max) { |
def8e4ea JH |
4678 | scan += UTF8SKIP(scan); |
4679 | hardcount++; | |
4680 | } | |
4681 | } | |
4682 | else | |
4683 | scan = loceol; | |
a0ed51b3 | 4684 | break; |
f33976b4 DB |
4685 | case CANY: |
4686 | scan = loceol; | |
4687 | break; | |
090f7165 JH |
4688 | case EXACT: /* length of string is 1 */ |
4689 | c = (U8)*STRING(p); | |
4690 | while (scan < loceol && UCHARAT(scan) == c) | |
4691 | scan++; | |
bbce6d69 | 4692 | break; |
4693 | case EXACTF: /* length of string is 1 */ | |
cd439c50 | 4694 | c = (U8)*STRING(p); |
bbce6d69 | 4695 | while (scan < loceol && |
22c35a8c | 4696 | (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold[c])) |
bbce6d69 | 4697 | scan++; |
4698 | break; | |
4699 | case EXACTFL: /* length of string is 1 */ | |
3280af22 | 4700 | PL_reg_flags |= RF_tainted; |
cd439c50 | 4701 | c = (U8)*STRING(p); |
bbce6d69 | 4702 | while (scan < loceol && |
22c35a8c | 4703 | (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold_locale[c])) |
a0d0e21e LW |
4704 | scan++; |
4705 | break; | |
4706 | case ANYOF: | |
ffc61ed2 JH |
4707 | if (do_utf8) { |
4708 | loceol = PL_regeol; | |
cfc92286 | 4709 | while (hardcount < max && scan < loceol && |
32fc9b6a | 4710 | reginclass(prog, p, (U8*)scan, 0, do_utf8)) { |
ffc61ed2 JH |
4711 | scan += UTF8SKIP(scan); |
4712 | hardcount++; | |
4713 | } | |
4714 | } else { | |
32fc9b6a | 4715 | while (scan < loceol && REGINCLASS(prog, p, (U8*)scan)) |
ffc61ed2 JH |
4716 | scan++; |
4717 | } | |
a0d0e21e LW |
4718 | break; |
4719 | case ALNUM: | |
1aa99e6b | 4720 | if (do_utf8) { |
ffc61ed2 | 4721 | loceol = PL_regeol; |
1a4fad37 | 4722 | LOAD_UTF8_CHARCLASS_ALNUM(); |
1aa99e6b | 4723 | while (hardcount < max && scan < loceol && |
3568d838 | 4724 | swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) { |
ffc61ed2 JH |
4725 | scan += UTF8SKIP(scan); |
4726 | hardcount++; | |
4727 | } | |
4728 | } else { | |
4729 | while (scan < loceol && isALNUM(*scan)) | |
4730 | scan++; | |
a0ed51b3 LW |
4731 | } |
4732 | break; | |
bbce6d69 | 4733 | case ALNUML: |
3280af22 | 4734 | PL_reg_flags |= RF_tainted; |
1aa99e6b | 4735 | if (do_utf8) { |
ffc61ed2 | 4736 | loceol = PL_regeol; |
1aa99e6b IH |
4737 | while (hardcount < max && scan < loceol && |
4738 | isALNUM_LC_utf8((U8*)scan)) { | |
ffc61ed2 JH |
4739 | scan += UTF8SKIP(scan); |
4740 | hardcount++; | |
4741 | } | |
4742 | } else { | |
4743 | while (scan < loceol && isALNUM_LC(*scan)) | |
4744 | scan++; | |
a0ed51b3 LW |
4745 | } |
4746 | break; | |
a0d0e21e | 4747 | case NALNUM: |
1aa99e6b | 4748 | if (do_utf8) { |
ffc61ed2 | 4749 | loceol = PL_regeol; |
1a4fad37 | 4750 | LOAD_UTF8_CHARCLASS_ALNUM(); |
1aa99e6b | 4751 | while (hardcount < max && scan < loceol && |
3568d838 | 4752 | !swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) { |
ffc61ed2 JH |
4753 | scan += UTF8SKIP(scan); |
4754 | hardcount++; | |
4755 | } | |
4756 | } else { | |
4757 | while (scan < loceol && !isALNUM(*scan)) | |
4758 | scan++; | |
a0ed51b3 LW |
4759 | } |
4760 | break; | |
bbce6d69 | 4761 | case NALNUML: |
3280af22 | 4762 | PL_reg_flags |= RF_tainted; |
1aa99e6b | 4763 | if (do_utf8) { |
ffc61ed2 | 4764 | loceol = PL_regeol; |
1aa99e6b IH |
4765 | while (hardcount < max && scan < loceol && |
4766 | !isALNUM_LC_utf8((U8*)scan)) { | |
ffc61ed2 JH |
4767 | scan += UTF8SKIP(scan); |
4768 | hardcount++; | |
4769 | } | |
4770 | } else { | |
4771 | while (scan < loceol && !isALNUM_LC(*scan)) | |
4772 | scan++; | |
a0ed51b3 LW |
4773 | } |
4774 | break; | |
a0d0e21e | 4775 | case SPACE: |
1aa99e6b | 4776 | if (do_utf8) { |
ffc61ed2 | 4777 | loceol = PL_regeol; |
1a4fad37 | 4778 | LOAD_UTF8_CHARCLASS_SPACE(); |
1aa99e6b | 4779 | while (hardcount < max && scan < loceol && |
3568d838 JH |
4780 | (*scan == ' ' || |
4781 | swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) { | |
ffc61ed2 JH |
4782 | scan += UTF8SKIP(scan); |
4783 | hardcount++; | |
4784 | } | |
4785 | } else { | |
4786 | while (scan < loceol && isSPACE(*scan)) | |
4787 | scan++; | |
a0ed51b3 LW |
4788 | } |
4789 | break; | |
bbce6d69 | 4790 | case SPACEL: |
3280af22 | 4791 | PL_reg_flags |= RF_tainted; |
1aa99e6b | 4792 | if (do_utf8) { |
ffc61ed2 | 4793 | loceol = PL_regeol; |
1aa99e6b | 4794 | while (hardcount < max && scan < loceol && |
ffc61ed2 JH |
4795 | (*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) { |
4796 | scan += UTF8SKIP(scan); | |
4797 | hardcount++; | |
4798 | } | |
4799 | } else { | |
4800 | while (scan < loceol && isSPACE_LC(*scan)) | |
4801 | scan++; | |
a0ed51b3 LW |
4802 | } |
4803 | break; | |
a0d0e21e | 4804 | case NSPACE: |
1aa99e6b | 4805 | if (do_utf8) { |
ffc61ed2 | 4806 | loceol = PL_regeol; |
1a4fad37 | 4807 | LOAD_UTF8_CHARCLASS_SPACE(); |
1aa99e6b | 4808 | while (hardcount < max && scan < loceol && |
3568d838 JH |
4809 | !(*scan == ' ' || |
4810 | swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) { | |
ffc61ed2 JH |
4811 | scan += UTF8SKIP(scan); |
4812 | hardcount++; | |
4813 | } | |
4814 | } else { | |
4815 | while (scan < loceol && !isSPACE(*scan)) | |
4816 | scan++; | |
4817 | break; | |
a0ed51b3 | 4818 | } |
bbce6d69 | 4819 | case NSPACEL: |
3280af22 | 4820 | PL_reg_flags |= RF_tainted; |
1aa99e6b | 4821 | if (do_utf8) { |
ffc61ed2 | 4822 | loceol = PL_regeol; |
1aa99e6b | 4823 | while (hardcount < max && scan < loceol && |
ffc61ed2 JH |
4824 | !(*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) { |
4825 | scan += UTF8SKIP(scan); | |
4826 | hardcount++; | |
4827 | } | |
4828 | } else { | |
4829 | while (scan < loceol && !isSPACE_LC(*scan)) | |
4830 | scan++; | |
a0ed51b3 LW |
4831 | } |
4832 | break; | |
a0d0e21e | 4833 | case DIGIT: |
1aa99e6b | 4834 | if (do_utf8) { |
ffc61ed2 | 4835 | loceol = PL_regeol; |
1a4fad37 | 4836 | LOAD_UTF8_CHARCLASS_DIGIT(); |
1aa99e6b | 4837 | while (hardcount < max && scan < loceol && |
3568d838 | 4838 | swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) { |
ffc61ed2 JH |
4839 | scan += UTF8SKIP(scan); |
4840 | hardcount++; | |
4841 | } | |
4842 | } else { | |
4843 | while (scan < loceol && isDIGIT(*scan)) | |
4844 | scan++; | |
a0ed51b3 LW |
4845 | } |
4846 | break; | |
a0d0e21e | 4847 | case NDIGIT: |
1aa99e6b | 4848 | if (do_utf8) { |
ffc61ed2 | 4849 | loceol = PL_regeol; |
1a4fad37 | 4850 | LOAD_UTF8_CHARCLASS_DIGIT(); |
1aa99e6b | 4851 | while (hardcount < max && scan < loceol && |
3568d838 | 4852 | !swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) { |
ffc61ed2 JH |
4853 | scan += UTF8SKIP(scan); |
4854 | hardcount++; | |
4855 | } | |
4856 | } else { | |
4857 | while (scan < loceol && !isDIGIT(*scan)) | |
4858 | scan++; | |
a0ed51b3 LW |
4859 | } |
4860 | break; | |
a0d0e21e LW |
4861 | default: /* Called on something of 0 width. */ |
4862 | break; /* So match right here or not at all. */ | |
4863 | } | |
a687059c | 4864 | |
a0ed51b3 LW |
4865 | if (hardcount) |
4866 | c = hardcount; | |
4867 | else | |
4868 | c = scan - PL_reginput; | |
3280af22 | 4869 | PL_reginput = scan; |
a687059c | 4870 | |
a3621e74 | 4871 | DEBUG_r({ |
ab74612d | 4872 | SV *re_debug_flags = NULL; |
6136c704 | 4873 | SV * const prop = sv_newmortal(); |
a3621e74 YO |
4874 | GET_RE_DEBUG_FLAGS; |
4875 | DEBUG_EXECUTE_r({ | |
32fc9b6a | 4876 | regprop(prog, prop, p); |
9041c2e3 NIS |
4877 | PerlIO_printf(Perl_debug_log, |
4878 | "%*s %s can match %"IVdf" times out of %"IVdf"...\n", | |
3f7c398e | 4879 | REPORT_CODE_OFF+1, "", SvPVX_const(prop),(IV)c,(IV)max); |
c277df42 | 4880 | }); |
a3621e74 | 4881 | }); |
9041c2e3 | 4882 | |
a0d0e21e | 4883 | return(c); |
a687059c LW |
4884 | } |
4885 | ||
c277df42 IZ |
4886 | |
4887 | /* | |
ffc61ed2 JH |
4888 | - regclass_swash - prepare the utf8 swash |
4889 | */ | |
4890 | ||
4891 | SV * | |
32fc9b6a | 4892 | Perl_regclass_swash(pTHX_ const regexp *prog, register const regnode* node, bool doinit, SV** listsvp, SV **altsvp) |
ffc61ed2 | 4893 | { |
97aff369 | 4894 | dVAR; |
9e55ce06 JH |
4895 | SV *sw = NULL; |
4896 | SV *si = NULL; | |
4897 | SV *alt = NULL; | |
32fc9b6a | 4898 | const struct reg_data *data = prog ? prog->data : NULL; |
ffc61ed2 | 4899 | |
4f639d21 | 4900 | if (data && data->count) { |
a3b680e6 | 4901 | const U32 n = ARG(node); |
ffc61ed2 | 4902 | |
4f639d21 DM |
4903 | if (data->what[n] == 's') { |
4904 | SV * const rv = (SV*)data->data[n]; | |
890ce7af | 4905 | AV * const av = (AV*)SvRV((SV*)rv); |
2d03de9c | 4906 | SV **const ary = AvARRAY(av); |
9e55ce06 | 4907 | SV **a, **b; |
9041c2e3 | 4908 | |
711a919c | 4909 | /* See the end of regcomp.c:S_regclass() for |
9e55ce06 JH |
4910 | * documentation of these array elements. */ |
4911 | ||
b11f357e | 4912 | si = *ary; |
8f7f7219 | 4913 | a = SvROK(ary[1]) ? &ary[1] : 0; |
b11f357e JH |
4914 | b = SvTYPE(ary[2]) == SVt_PVAV ? &ary[2] : 0; |
4915 | ||
ffc61ed2 JH |
4916 | if (a) |
4917 | sw = *a; | |
4918 | else if (si && doinit) { | |
4919 | sw = swash_init("utf8", "", si, 1, 0); | |
4920 | (void)av_store(av, 1, sw); | |
4921 | } | |
9e55ce06 JH |
4922 | if (b) |
4923 | alt = *b; | |
ffc61ed2 JH |
4924 | } |
4925 | } | |
4926 | ||
9e55ce06 JH |
4927 | if (listsvp) |
4928 | *listsvp = si; | |
4929 | if (altsvp) | |
4930 | *altsvp = alt; | |
ffc61ed2 JH |
4931 | |
4932 | return sw; | |
4933 | } | |
4934 | ||
4935 | /* | |
ba7b4546 | 4936 | - reginclass - determine if a character falls into a character class |
832705d4 JH |
4937 | |
4938 | The n is the ANYOF regnode, the p is the target string, lenp | |
4939 | is pointer to the maximum length of how far to go in the p | |
4940 | (if the lenp is zero, UTF8SKIP(p) is used), | |
4941 | do_utf8 tells whether the target string is in UTF-8. | |
4942 | ||
bbce6d69 | 4943 | */ |
4944 | ||
76e3520e | 4945 | STATIC bool |
32fc9b6a | 4946 | S_reginclass(pTHX_ const regexp *prog, register const regnode *n, register const U8* p, STRLEN* lenp, register bool do_utf8) |
bbce6d69 | 4947 | { |
27da23d5 | 4948 | dVAR; |
a3b680e6 | 4949 | const char flags = ANYOF_FLAGS(n); |
bbce6d69 | 4950 | bool match = FALSE; |
cc07378b | 4951 | UV c = *p; |
ae9ddab8 | 4952 | STRLEN len = 0; |
9e55ce06 | 4953 | STRLEN plen; |
1aa99e6b | 4954 | |
19f67299 TS |
4955 | if (do_utf8 && !UTF8_IS_INVARIANT(c)) { |
4956 | c = utf8n_to_uvchr(p, UTF8_MAXBYTES, &len, | |
4ad0818d DM |
4957 | (UTF8_ALLOW_DEFAULT & UTF8_ALLOW_ANYUV) | UTF8_CHECK_ONLY); |
4958 | /* see [perl #37836] for UTF8_ALLOW_ANYUV */ | |
19f67299 TS |
4959 | if (len == (STRLEN)-1) |
4960 | Perl_croak(aTHX_ "Malformed UTF-8 character (fatal)"); | |
4961 | } | |
bbce6d69 | 4962 | |
0f0076b4 | 4963 | plen = lenp ? *lenp : UNISKIP(NATIVE_TO_UNI(c)); |
ffc61ed2 | 4964 | if (do_utf8 || (flags & ANYOF_UNICODE)) { |
9e55ce06 JH |
4965 | if (lenp) |
4966 | *lenp = 0; | |
ffc61ed2 | 4967 | if (do_utf8 && !ANYOF_RUNTIME(n)) { |
ffc61ed2 JH |
4968 | if (len != (STRLEN)-1 && c < 256 && ANYOF_BITMAP_TEST(n, c)) |
4969 | match = TRUE; | |
bbce6d69 | 4970 | } |
3568d838 | 4971 | if (!match && do_utf8 && (flags & ANYOF_UNICODE_ALL) && c >= 256) |
1aa99e6b | 4972 | match = TRUE; |
ffc61ed2 | 4973 | if (!match) { |
9e55ce06 | 4974 | AV *av; |
32fc9b6a | 4975 | SV * const sw = regclass_swash(prog, n, TRUE, 0, (SV**)&av); |
ffc61ed2 JH |
4976 | |
4977 | if (sw) { | |
3568d838 | 4978 | if (swash_fetch(sw, p, do_utf8)) |
ffc61ed2 JH |
4979 | match = TRUE; |
4980 | else if (flags & ANYOF_FOLD) { | |
9e55ce06 JH |
4981 | if (!match && lenp && av) { |
4982 | I32 i; | |
9e55ce06 | 4983 | for (i = 0; i <= av_len(av); i++) { |
890ce7af | 4984 | SV* const sv = *av_fetch(av, i, FALSE); |
9e55ce06 | 4985 | STRLEN len; |
890ce7af | 4986 | const char * const s = SvPV_const(sv, len); |
9e55ce06 | 4987 | |
061b10df | 4988 | if (len <= plen && memEQ(s, (char*)p, len)) { |
9e55ce06 JH |
4989 | *lenp = len; |
4990 | match = TRUE; | |
4991 | break; | |
4992 | } | |
4993 | } | |
4994 | } | |
4995 | if (!match) { | |
89ebb4a3 | 4996 | U8 tmpbuf[UTF8_MAXBYTES_CASE+1]; |
4a623e43 JH |
4997 | STRLEN tmplen; |
4998 | ||
9e55ce06 JH |
4999 | to_utf8_fold(p, tmpbuf, &tmplen); |
5000 | if (swash_fetch(sw, tmpbuf, do_utf8)) | |
5001 | match = TRUE; | |
5002 | } | |
ffc61ed2 JH |
5003 | } |
5004 | } | |
bbce6d69 | 5005 | } |
9e55ce06 | 5006 | if (match && lenp && *lenp == 0) |
0f0076b4 | 5007 | *lenp = UNISKIP(NATIVE_TO_UNI(c)); |
bbce6d69 | 5008 | } |
1aa99e6b | 5009 | if (!match && c < 256) { |
ffc61ed2 JH |
5010 | if (ANYOF_BITMAP_TEST(n, c)) |
5011 | match = TRUE; | |
5012 | else if (flags & ANYOF_FOLD) { | |
eb160463 | 5013 | U8 f; |
a0ed51b3 | 5014 | |
ffc61ed2 JH |
5015 | if (flags & ANYOF_LOCALE) { |
5016 | PL_reg_flags |= RF_tainted; | |
5017 | f = PL_fold_locale[c]; | |
5018 | } | |
5019 | else | |
5020 | f = PL_fold[c]; | |
5021 | if (f != c && ANYOF_BITMAP_TEST(n, f)) | |
5022 | match = TRUE; | |
5023 | } | |
5024 | ||
5025 | if (!match && (flags & ANYOF_CLASS)) { | |
a0ed51b3 | 5026 | PL_reg_flags |= RF_tainted; |
ffc61ed2 JH |
5027 | if ( |
5028 | (ANYOF_CLASS_TEST(n, ANYOF_ALNUM) && isALNUM_LC(c)) || | |
5029 | (ANYOF_CLASS_TEST(n, ANYOF_NALNUM) && !isALNUM_LC(c)) || | |
5030 | (ANYOF_CLASS_TEST(n, ANYOF_SPACE) && isSPACE_LC(c)) || | |
5031 | (ANYOF_CLASS_TEST(n, ANYOF_NSPACE) && !isSPACE_LC(c)) || | |
5032 | (ANYOF_CLASS_TEST(n, ANYOF_DIGIT) && isDIGIT_LC(c)) || | |
5033 | (ANYOF_CLASS_TEST(n, ANYOF_NDIGIT) && !isDIGIT_LC(c)) || | |
5034 | (ANYOF_CLASS_TEST(n, ANYOF_ALNUMC) && isALNUMC_LC(c)) || | |
5035 | (ANYOF_CLASS_TEST(n, ANYOF_NALNUMC) && !isALNUMC_LC(c)) || | |
5036 | (ANYOF_CLASS_TEST(n, ANYOF_ALPHA) && isALPHA_LC(c)) || | |
5037 | (ANYOF_CLASS_TEST(n, ANYOF_NALPHA) && !isALPHA_LC(c)) || | |
5038 | (ANYOF_CLASS_TEST(n, ANYOF_ASCII) && isASCII(c)) || | |
5039 | (ANYOF_CLASS_TEST(n, ANYOF_NASCII) && !isASCII(c)) || | |
5040 | (ANYOF_CLASS_TEST(n, ANYOF_CNTRL) && isCNTRL_LC(c)) || | |
5041 | (ANYOF_CLASS_TEST(n, ANYOF_NCNTRL) && !isCNTRL_LC(c)) || | |
5042 | (ANYOF_CLASS_TEST(n, ANYOF_GRAPH) && isGRAPH_LC(c)) || | |
5043 | (ANYOF_CLASS_TEST(n, ANYOF_NGRAPH) && !isGRAPH_LC(c)) || | |
5044 | (ANYOF_CLASS_TEST(n, ANYOF_LOWER) && isLOWER_LC(c)) || | |
5045 | (ANYOF_CLASS_TEST(n, ANYOF_NLOWER) && !isLOWER_LC(c)) || | |
5046 | (ANYOF_CLASS_TEST(n, ANYOF_PRINT) && isPRINT_LC(c)) || | |
5047 | (ANYOF_CLASS_TEST(n, ANYOF_NPRINT) && !isPRINT_LC(c)) || | |
5048 | (ANYOF_CLASS_TEST(n, ANYOF_PUNCT) && isPUNCT_LC(c)) || | |
5049 | (ANYOF_CLASS_TEST(n, ANYOF_NPUNCT) && !isPUNCT_LC(c)) || | |
5050 | (ANYOF_CLASS_TEST(n, ANYOF_UPPER) && isUPPER_LC(c)) || | |
5051 | (ANYOF_CLASS_TEST(n, ANYOF_NUPPER) && !isUPPER_LC(c)) || | |
5052 | (ANYOF_CLASS_TEST(n, ANYOF_XDIGIT) && isXDIGIT(c)) || | |
5053 | (ANYOF_CLASS_TEST(n, ANYOF_NXDIGIT) && !isXDIGIT(c)) || | |
5054 | (ANYOF_CLASS_TEST(n, ANYOF_PSXSPC) && isPSXSPC(c)) || | |
5055 | (ANYOF_CLASS_TEST(n, ANYOF_NPSXSPC) && !isPSXSPC(c)) || | |
5056 | (ANYOF_CLASS_TEST(n, ANYOF_BLANK) && isBLANK(c)) || | |
5057 | (ANYOF_CLASS_TEST(n, ANYOF_NBLANK) && !isBLANK(c)) | |
5058 | ) /* How's that for a conditional? */ | |
5059 | { | |
5060 | match = TRUE; | |
5061 | } | |
a0ed51b3 | 5062 | } |
a0ed51b3 LW |
5063 | } |
5064 | ||
a0ed51b3 LW |
5065 | return (flags & ANYOF_INVERT) ? !match : match; |
5066 | } | |
161b471a | 5067 | |
dfe13c55 | 5068 | STATIC U8 * |
5f66b61c | 5069 | S_reghop3(U8 *s, I32 off, U8* lim) |
9041c2e3 | 5070 | { |
97aff369 | 5071 | dVAR; |
a0ed51b3 | 5072 | if (off >= 0) { |
1aa99e6b | 5073 | while (off-- && s < lim) { |
ffc61ed2 | 5074 | /* XXX could check well-formedness here */ |
a0ed51b3 | 5075 | s += UTF8SKIP(s); |
ffc61ed2 | 5076 | } |
a0ed51b3 LW |
5077 | } |
5078 | else { | |
5079 | while (off++) { | |
1aa99e6b | 5080 | if (s > lim) { |
a0ed51b3 | 5081 | s--; |
ffc61ed2 | 5082 | if (UTF8_IS_CONTINUED(*s)) { |
1aa99e6b | 5083 | while (s > (U8*)lim && UTF8_IS_CONTINUATION(*s)) |
a0ed51b3 | 5084 | s--; |
ffc61ed2 JH |
5085 | } |
5086 | /* XXX could check well-formedness here */ | |
a0ed51b3 LW |
5087 | } |
5088 | } | |
5089 | } | |
5090 | return s; | |
5091 | } | |
161b471a | 5092 | |
dfe13c55 | 5093 | STATIC U8 * |
5f66b61c | 5094 | S_reghopmaybe3(U8* s, I32 off, U8* lim) |
a0ed51b3 | 5095 | { |
97aff369 | 5096 | dVAR; |
a0ed51b3 | 5097 | if (off >= 0) { |
1aa99e6b | 5098 | while (off-- && s < lim) { |
ffc61ed2 | 5099 | /* XXX could check well-formedness here */ |
a0ed51b3 | 5100 | s += UTF8SKIP(s); |
ffc61ed2 | 5101 | } |
a0ed51b3 LW |
5102 | if (off >= 0) |
5103 | return 0; | |
5104 | } | |
5105 | else { | |
5106 | while (off++) { | |
1aa99e6b | 5107 | if (s > lim) { |
a0ed51b3 | 5108 | s--; |
ffc61ed2 | 5109 | if (UTF8_IS_CONTINUED(*s)) { |
1aa99e6b | 5110 | while (s > (U8*)lim && UTF8_IS_CONTINUATION(*s)) |
a0ed51b3 | 5111 | s--; |
ffc61ed2 JH |
5112 | } |
5113 | /* XXX could check well-formedness here */ | |
a0ed51b3 LW |
5114 | } |
5115 | else | |
5116 | break; | |
5117 | } | |
5118 | if (off <= 0) | |
5119 | return 0; | |
5120 | } | |
5121 | return s; | |
5122 | } | |
51371543 | 5123 | |
51371543 | 5124 | static void |
acfe0abc | 5125 | restore_pos(pTHX_ void *arg) |
51371543 | 5126 | { |
97aff369 | 5127 | dVAR; |
097eb12c | 5128 | regexp * const rex = (regexp *)arg; |
51371543 GS |
5129 | if (PL_reg_eval_set) { |
5130 | if (PL_reg_oldsaved) { | |
4f639d21 DM |
5131 | rex->subbeg = PL_reg_oldsaved; |
5132 | rex->sublen = PL_reg_oldsavedlen; | |
f8c7b90f | 5133 | #ifdef PERL_OLD_COPY_ON_WRITE |
4f639d21 | 5134 | rex->saved_copy = PL_nrs; |
ed252734 | 5135 | #endif |
4f639d21 | 5136 | RX_MATCH_COPIED_on(rex); |
51371543 GS |
5137 | } |
5138 | PL_reg_magic->mg_len = PL_reg_oldpos; | |
5139 | PL_reg_eval_set = 0; | |
5140 | PL_curpm = PL_reg_oldcurpm; | |
5141 | } | |
5142 | } | |
33b8afdf JH |
5143 | |
5144 | STATIC void | |
5145 | S_to_utf8_substr(pTHX_ register regexp *prog) | |
5146 | { | |
33b8afdf | 5147 | if (prog->float_substr && !prog->float_utf8) { |
097eb12c AL |
5148 | SV* const sv = newSVsv(prog->float_substr); |
5149 | prog->float_utf8 = sv; | |
33b8afdf JH |
5150 | sv_utf8_upgrade(sv); |
5151 | if (SvTAIL(prog->float_substr)) | |
5152 | SvTAIL_on(sv); | |
5153 | if (prog->float_substr == prog->check_substr) | |
5154 | prog->check_utf8 = sv; | |
5155 | } | |
5156 | if (prog->anchored_substr && !prog->anchored_utf8) { | |
097eb12c AL |
5157 | SV* const sv = newSVsv(prog->anchored_substr); |
5158 | prog->anchored_utf8 = sv; | |
33b8afdf JH |
5159 | sv_utf8_upgrade(sv); |
5160 | if (SvTAIL(prog->anchored_substr)) | |
5161 | SvTAIL_on(sv); | |
5162 | if (prog->anchored_substr == prog->check_substr) | |
5163 | prog->check_utf8 = sv; | |
5164 | } | |
5165 | } | |
5166 | ||
5167 | STATIC void | |
5168 | S_to_byte_substr(pTHX_ register regexp *prog) | |
5169 | { | |
97aff369 | 5170 | dVAR; |
33b8afdf | 5171 | if (prog->float_utf8 && !prog->float_substr) { |
097eb12c AL |
5172 | SV* sv = newSVsv(prog->float_utf8); |
5173 | prog->float_substr = sv; | |
33b8afdf JH |
5174 | if (sv_utf8_downgrade(sv, TRUE)) { |
5175 | if (SvTAIL(prog->float_utf8)) | |
5176 | SvTAIL_on(sv); | |
5177 | } else { | |
5178 | SvREFCNT_dec(sv); | |
5179 | prog->float_substr = sv = &PL_sv_undef; | |
5180 | } | |
5181 | if (prog->float_utf8 == prog->check_utf8) | |
5182 | prog->check_substr = sv; | |
5183 | } | |
5184 | if (prog->anchored_utf8 && !prog->anchored_substr) { | |
097eb12c AL |
5185 | SV* sv = newSVsv(prog->anchored_utf8); |
5186 | prog->anchored_substr = sv; | |
33b8afdf JH |
5187 | if (sv_utf8_downgrade(sv, TRUE)) { |
5188 | if (SvTAIL(prog->anchored_utf8)) | |
5189 | SvTAIL_on(sv); | |
5190 | } else { | |
5191 | SvREFCNT_dec(sv); | |
5192 | prog->anchored_substr = sv = &PL_sv_undef; | |
5193 | } | |
5194 | if (prog->anchored_utf8 == prog->check_utf8) | |
5195 | prog->check_substr = sv; | |
5196 | } | |
5197 | } | |
66610fdd RGS |
5198 | |
5199 | /* | |
5200 | * Local variables: | |
5201 | * c-indentation-style: bsd | |
5202 | * c-basic-offset: 4 | |
5203 | * indent-tabs-mode: t | |
5204 | * End: | |
5205 | * | |
37442d52 RGS |
5206 | * ex: set ts=8 sts=4 sw=4 noet: |
5207 | */ |