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