This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
regexec.c: Fix "\x{FB01}\x{FB00}" =~ /ff/i
[perl5.git] / regexec.c
CommitLineData
a0d0e21e
LW
1/* regexec.c
2 */
3
4/*
4ac71550
TC
5 * One Ring to rule them all, One Ring to find them
6 &
7 * [p.v of _The Lord of the Rings_, opening poem]
8 * [p.50 of _The Lord of the Rings_, I/iii: "The Shadow of the Past"]
9 * [p.254 of _The Lord of the Rings_, II/ii: "The Council of Elrond"]
a0d0e21e
LW
10 */
11
61296642
DM
12/* This file contains functions for executing a regular expression. See
13 * also regcomp.c which funnily enough, contains functions for compiling
166f8a29 14 * a regular expression.
e4a054ea
DM
15 *
16 * This file is also copied at build time to ext/re/re_exec.c, where
17 * it's built with -DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT.
18 * This causes the main functions to be compiled under new names and with
19 * debugging support added, which makes "use re 'debug'" work.
166f8a29
DM
20 */
21
a687059c
LW
22/* NOTE: this is derived from Henry Spencer's regexp code, and should not
23 * confused with the original package (see point 3 below). Thanks, Henry!
24 */
25
26/* Additional note: this code is very heavily munged from Henry's version
27 * in places. In some spots I've traded clarity for efficiency, so don't
28 * blame Henry for some of the lack of readability.
29 */
30
e50aee73
AD
31/* The names of the functions have been changed from regcomp and
32 * regexec to pregcomp and pregexec in order to avoid conflicts
33 * with the POSIX routines of the same names.
34*/
35
b9d5759e 36#ifdef PERL_EXT_RE_BUILD
54df2634 37#include "re_top.h"
9041c2e3 38#endif
56953603 39
a687059c 40/*
e50aee73 41 * pregcomp and pregexec -- regsub and regerror are not used in perl
a687059c
LW
42 *
43 * Copyright (c) 1986 by University of Toronto.
44 * Written by Henry Spencer. Not derived from licensed software.
45 *
46 * Permission is granted to anyone to use this software for any
47 * purpose on any computer system, and to redistribute it freely,
48 * subject to the following restrictions:
49 *
50 * 1. The author is not responsible for the consequences of use of
51 * this software, no matter how awful, even if they arise
52 * from defects in it.
53 *
54 * 2. The origin of this software must not be misrepresented, either
55 * by explicit claim or by omission.
56 *
57 * 3. Altered versions must be plainly marked as such, and must not
58 * be misrepresented as being the original software.
59 *
60 **** Alterations to Henry's code are...
61 ****
4bb101f2 62 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
1129b882
NC
63 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
64 **** by Larry Wall and others
a687059c 65 ****
9ef589d8
LW
66 **** You may distribute under the terms of either the GNU General Public
67 **** License or the Artistic License, as specified in the README file.
a687059c
LW
68 *
69 * Beware that some of this code is subtly aware of the way operator
70 * precedence is structured in regular expressions. Serious changes in
71 * regular-expression syntax might require a total rethink.
72 */
73#include "EXTERN.h"
864dbfa3 74#define PERL_IN_REGEXEC_C
a687059c 75#include "perl.h"
0f5d15d6 76
54df2634
NC
77#ifdef PERL_IN_XSUB_RE
78# include "re_comp.h"
79#else
80# include "regcomp.h"
81#endif
a687059c 82
ef07e810 83#define RF_tainted 1 /* tainted information used? e.g. locale */
c277df42 84#define RF_warned 2 /* warned about big count? */
faec1544 85
ab3bbdeb 86#define RF_utf8 8 /* Pattern contains multibyte chars? */
a0ed51b3 87
f2ed9b32 88#define UTF_PATTERN ((PL_reg_flags & RF_utf8) != 0)
ce862d02
IZ
89
90#define RS_init 1 /* eval environment created */
91#define RS_set 2 /* replsv value is set */
c277df42 92
a687059c
LW
93#ifndef STATIC
94#define STATIC static
95#endif
96
7e2509c1
KW
97/* Valid for non-utf8 strings, non-ANYOFV nodes only: avoids the reginclass
98 * call if there are no complications: i.e., if everything matchable is
99 * straight forward in the bitmap */
af364d03
KW
100#define REGINCLASS(prog,p,c) (ANYOF_FLAGS(p) ? reginclass(prog,p,c,0,0) \
101 : ANYOF_BITMAP_TEST(p,*(c)))
7d3e948e 102
c277df42
IZ
103/*
104 * Forwards.
105 */
106
f2ed9b32 107#define CHR_SVLEN(sv) (utf8_target ? sv_len_utf8(sv) : SvCUR(sv))
53c4c00c 108#define CHR_DIST(a,b) (PL_reg_match_utf8 ? utf8_distance(a,b) : a - b)
a0ed51b3 109
3dab1dad
YO
110#define HOPc(pos,off) \
111 (char *)(PL_reg_match_utf8 \
52657f30 112 ? reghop3((U8*)pos, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr)) \
3dab1dad
YO
113 : (U8*)(pos + off))
114#define HOPBACKc(pos, off) \
07be1b83
YO
115 (char*)(PL_reg_match_utf8\
116 ? reghopmaybe3((U8*)pos, -off, (U8*)PL_bostr) \
117 : (pos - off >= PL_bostr) \
8e11feef 118 ? (U8*)pos - off \
3dab1dad 119 : NULL)
efb30f32 120
e7409c1b 121#define HOP3(pos,off,lim) (PL_reg_match_utf8 ? reghop3((U8*)(pos), off, (U8*)(lim)) : (U8*)(pos + off))
1aa99e6b 122#define HOP3c(pos,off,lim) ((char*)HOP3(pos,off,lim))
1aa99e6b 123
20d0b1e9 124/* these are unrolled below in the CCC_TRY_XXX defined */
a9a337f8
KW
125#ifdef EBCDIC
126 /* Often 'str' is a hard-coded utf8 string instead of utfebcdic. so just
127 * skip the check on EBCDIC platforms */
128# define LOAD_UTF8_CHARCLASS(class,str) LOAD_UTF8_CHARCLASS_NO_CHECK(class)
129#else
130# define LOAD_UTF8_CHARCLASS(class,str) STMT_START { \
9c4fdda1
RB
131 if (!CAT2(PL_utf8_,class)) { \
132 bool ok; \
133 ENTER; save_re_context(); \
134 ok=CAT2(is_utf8_,class)((const U8*)str); \
9ac792f4 135 assert(ok); assert(CAT2(PL_utf8_,class)); LEAVE; } } STMT_END
a9a337f8 136#endif
37e2e78e
KW
137
138/* Doesn't do an assert to verify that is correct */
139#define LOAD_UTF8_CHARCLASS_NO_CHECK(class) STMT_START { \
9c4fdda1
RB
140 if (!CAT2(PL_utf8_,class)) { \
141 bool throw_away __attribute__unused__; \
142 ENTER; save_re_context(); \
143 throw_away = CAT2(is_utf8_,class)((const U8*)" "); \
144 LEAVE; } } STMT_END
37e2e78e 145
1a4fad37
AL
146#define LOAD_UTF8_CHARCLASS_ALNUM() LOAD_UTF8_CHARCLASS(alnum,"a")
147#define LOAD_UTF8_CHARCLASS_DIGIT() LOAD_UTF8_CHARCLASS(digit,"0")
148#define LOAD_UTF8_CHARCLASS_SPACE() LOAD_UTF8_CHARCLASS(space," ")
51371543 149
37e2e78e 150#define LOAD_UTF8_CHARCLASS_GCB() /* Grapheme cluster boundaries */ \
d275fa5e
CB
151 LOAD_UTF8_CHARCLASS(X_begin, " "); \
152 LOAD_UTF8_CHARCLASS(X_non_hangul, "A"); \
37e2e78e
KW
153 /* These are utf8 constants, and not utf-ebcdic constants, so the \
154 * assert should likely and hopefully fail on an EBCDIC machine */ \
d275fa5e 155 LOAD_UTF8_CHARCLASS(X_extend, "\xcc\x80"); /* U+0300 */ \
37e2e78e
KW
156 \
157 /* No asserts are done for these, in case called on an early \
158 * Unicode version in which they map to nothing */ \
d275fa5e
CB
159 LOAD_UTF8_CHARCLASS_NO_CHECK(X_prepend);/* U+0E40 "\xe0\xb9\x80" */ \
160 LOAD_UTF8_CHARCLASS_NO_CHECK(X_L); /* U+1100 "\xe1\x84\x80" */ \
161 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LV); /* U+AC00 "\xea\xb0\x80" */ \
162 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LVT); /* U+AC01 "\xea\xb0\x81" */ \
163 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LV_LVT_V);/* U+AC01 "\xea\xb0\x81" */\
164 LOAD_UTF8_CHARCLASS_NO_CHECK(X_T); /* U+11A8 "\xe1\x86\xa8" */ \
37e2e78e 165 LOAD_UTF8_CHARCLASS_NO_CHECK(X_V) /* U+1160 "\xe1\x85\xa0" */
20d0b1e9 166
1dcf4a1b 167#define PLACEHOLDER /* Something for the preprocessor to grab onto */
d1eb3177 168
ee9a90b8
KW
169/* The actual code for CCC_TRY, which uses several variables from the routine
170 * it's callable from. It is designed to be the bulk of a case statement.
171 * FUNC is the macro or function to call on non-utf8 targets that indicate if
172 * nextchr matches the class.
173 * UTF8_TEST is the whole test string to use for utf8 targets
174 * LOAD is what to use to test, and if not present to load in the swash for the
175 * class
176 * POS_OR_NEG is either empty or ! to complement the results of FUNC or
177 * UTF8_TEST test.
178 * The logic is: Fail if we're at the end-of-string; otherwise if the target is
179 * utf8 and a variant, load the swash if necessary and test using the utf8
180 * test. Advance to the next character if test is ok, otherwise fail; If not
181 * utf8 or an invariant under utf8, use the non-utf8 test, and fail if it
182 * fails, or advance to the next character */
183
184#define _CCC_TRY_CODE(POS_OR_NEG, FUNC, UTF8_TEST, CLASS, STR) \
185 if (locinput >= PL_regeol) { \
186 sayNO; \
187 } \
188 if (utf8_target && UTF8_IS_CONTINUED(nextchr)) { \
189 LOAD_UTF8_CHARCLASS(CLASS, STR); \
190 if (POS_OR_NEG (UTF8_TEST)) { \
191 sayNO; \
192 } \
193 locinput += PL_utf8skip[nextchr]; \
194 nextchr = UCHARAT(locinput); \
195 break; \
196 } \
197 if (POS_OR_NEG (FUNC(nextchr))) { \
198 sayNO; \
199 } \
200 nextchr = UCHARAT(++locinput); \
980866de
KW
201 break;
202
ee9a90b8
KW
203/* Handle the non-locale cases for a character class and its complement. It
204 * calls _CCC_TRY_CODE with a ! to complement the test for the character class.
205 * This is because that code fails when the test succeeds, so we want to have
206 * the test fail so that the code succeeds. The swash is stored in a
207 * predictable PL_ place */
cfaf538b
KW
208#define _CCC_TRY_NONLOCALE(NAME, NNAME, FUNC, \
209 CLASS, STR) \
ee9a90b8
KW
210 case NAME: \
211 _CCC_TRY_CODE( !, FUNC, \
212 cBOOL(swash_fetch(CAT2(PL_utf8_,CLASS), \
213 (U8*)locinput, TRUE)), \
214 CLASS, STR) \
215 case NNAME: \
1dcf4a1b 216 _CCC_TRY_CODE( PLACEHOLDER , FUNC, \
ee9a90b8
KW
217 cBOOL(swash_fetch(CAT2(PL_utf8_,CLASS), \
218 (U8*)locinput, TRUE)), \
219 CLASS, STR) \
220
221/* Generate the case statements for both locale and non-locale character
222 * classes in regmatch for classes that don't have special unicode semantics.
223 * Locales don't use an immediate swash, but an intermediary special locale
224 * function that is called on the pointer to the current place in the input
225 * string. That function will resolve to needing the same swash. One might
226 * think that because we don't know what the locale will match, we shouldn't
227 * check with the swash loading function that it loaded properly; ie, that we
228 * should use LOAD_UTF8_CHARCLASS_NO_CHECK for those, but what is passed to the
229 * regular LOAD_UTF8_CHARCLASS is in non-locale terms, and so locale is
230 * irrelevant here */
231#define CCC_TRY(NAME, NNAME, FUNC, \
232 NAMEL, NNAMEL, LCFUNC, LCFUNC_utf8, \
cfaf538b 233 NAMEA, NNAMEA, FUNCA, \
ee9a90b8
KW
234 CLASS, STR) \
235 case NAMEL: \
236 PL_reg_flags |= RF_tainted; \
237 _CCC_TRY_CODE( !, LCFUNC, LCFUNC_utf8((U8*)locinput), CLASS, STR) \
238 case NNAMEL: \
239 PL_reg_flags |= RF_tainted; \
1dcf4a1b
KW
240 _CCC_TRY_CODE( PLACEHOLDER, LCFUNC, LCFUNC_utf8((U8*)locinput), \
241 CLASS, STR) \
cfaf538b
KW
242 case NAMEA: \
243 if (locinput >= PL_regeol || ! FUNCA(nextchr)) { \
244 sayNO; \
245 } \
246 /* Matched a utf8-invariant, so don't have to worry about utf8 */ \
247 nextchr = UCHARAT(++locinput); \
248 break; \
249 case NNAMEA: \
250 if (locinput >= PL_regeol || FUNCA(nextchr)) { \
251 sayNO; \
252 } \
253 if (utf8_target) { \
254 locinput += PL_utf8skip[nextchr]; \
255 nextchr = UCHARAT(locinput); \
256 } \
257 else { \
258 nextchr = UCHARAT(++locinput); \
259 } \
260 break; \
ee9a90b8
KW
261 /* Generate the non-locale cases */ \
262 _CCC_TRY_NONLOCALE(NAME, NNAME, FUNC, CLASS, STR)
263
264/* This is like CCC_TRY, but has an extra set of parameters for generating case
265 * statements to handle separate Unicode semantics nodes */
266#define CCC_TRY_U(NAME, NNAME, FUNC, \
267 NAMEL, NNAMEL, LCFUNC, LCFUNC_utf8, \
268 NAMEU, NNAMEU, FUNCU, \
cfaf538b 269 NAMEA, NNAMEA, FUNCA, \
ee9a90b8 270 CLASS, STR) \
cfaf538b
KW
271 CCC_TRY(NAME, NNAME, FUNC, \
272 NAMEL, NNAMEL, LCFUNC, LCFUNC_utf8, \
273 NAMEA, NNAMEA, FUNCA, \
274 CLASS, STR) \
ee9a90b8 275 _CCC_TRY_NONLOCALE(NAMEU, NNAMEU, FUNCU, CLASS, STR)
d1eb3177 276
3dab1dad
YO
277/* TODO: Combine JUMPABLE and HAS_TEXT to cache OP(rn) */
278
5f80c4cf 279/* for use after a quantifier and before an EXACT-like node -- japhy */
c35dcbe2
YO
280/* it would be nice to rework regcomp.sym to generate this stuff. sigh
281 *
282 * NOTE that *nothing* that affects backtracking should be in here, specifically
283 * VERBS must NOT be included. JUMPABLE is used to determine if we can ignore a
284 * node that is in between two EXACT like nodes when ascertaining what the required
285 * "follow" character is. This should probably be moved to regex compile time
286 * although it may be done at run time beause of the REF possibility - more
287 * investigation required. -- demerphq
288*/
3e901dc0
YO
289#define JUMPABLE(rn) ( \
290 OP(rn) == OPEN || \
291 (OP(rn) == CLOSE && (!cur_eval || cur_eval->u.eval.close_paren != ARG(rn))) || \
292 OP(rn) == EVAL || \
cca55fe3
JP
293 OP(rn) == SUSPEND || OP(rn) == IFMATCH || \
294 OP(rn) == PLUS || OP(rn) == MINMOD || \
d1c771f5 295 OP(rn) == KEEPS || \
3dab1dad 296 (PL_regkind[OP(rn)] == CURLY && ARG1(rn) > 0) \
e2d8ce26 297)
ee9b8eae 298#define IS_EXACT(rn) (PL_regkind[OP(rn)] == EXACT)
e2d8ce26 299
ee9b8eae
YO
300#define HAS_TEXT(rn) ( IS_EXACT(rn) || PL_regkind[OP(rn)] == REF )
301
302#if 0
303/* Currently these are only used when PL_regkind[OP(rn)] == EXACT so
304 we don't need this definition. */
305#define IS_TEXT(rn) ( OP(rn)==EXACT || OP(rn)==REF || OP(rn)==NREF )
2f7f8cb1 306#define IS_TEXTF(rn) ( (OP(rn)==EXACTFU || OP(rn)==EXACTFA || OP(rn)==EXACTF) || OP(rn)==REFF || OP(rn)==NREFF )
ee9b8eae
YO
307#define IS_TEXTFL(rn) ( OP(rn)==EXACTFL || OP(rn)==REFFL || OP(rn)==NREFFL )
308
309#else
310/* ... so we use this as its faster. */
311#define IS_TEXT(rn) ( OP(rn)==EXACT )
2f7f8cb1 312#define IS_TEXTFU(rn) ( OP(rn)==EXACTFU || OP(rn) == EXACTFA)
ee9b8eae
YO
313#define IS_TEXTF(rn) ( OP(rn)==EXACTF )
314#define IS_TEXTFL(rn) ( OP(rn)==EXACTFL )
315
316#endif
e2d8ce26 317
a84d97b6
HS
318/*
319 Search for mandatory following text node; for lookahead, the text must
320 follow but for lookbehind (rn->flags != 0) we skip to the next step.
321*/
cca55fe3 322#define FIND_NEXT_IMPT(rn) STMT_START { \
3dab1dad
YO
323 while (JUMPABLE(rn)) { \
324 const OPCODE type = OP(rn); \
325 if (type == SUSPEND || PL_regkind[type] == CURLY) \
e2d8ce26 326 rn = NEXTOPER(NEXTOPER(rn)); \
3dab1dad 327 else if (type == PLUS) \
cca55fe3 328 rn = NEXTOPER(rn); \
3dab1dad 329 else if (type == IFMATCH) \
a84d97b6 330 rn = (rn->flags == 0) ? NEXTOPER(NEXTOPER(rn)) : rn + ARG(rn); \
e2d8ce26 331 else rn += NEXT_OFF(rn); \
3dab1dad 332 } \
5f80c4cf 333} STMT_END
74750237 334
c476f425 335
acfe0abc 336static void restore_pos(pTHX_ void *arg);
51371543 337
620d5b66
NC
338#define REGCP_PAREN_ELEMS 4
339#define REGCP_OTHER_ELEMS 5
e0fa7e2b 340#define REGCP_FRAME_ELEMS 1
620d5b66
NC
341/* REGCP_FRAME_ELEMS are not part of the REGCP_OTHER_ELEMS and
342 * are needed for the regexp context stack bookkeeping. */
343
76e3520e 344STATIC CHECKPOINT
cea2e8a9 345S_regcppush(pTHX_ I32 parenfloor)
a0d0e21e 346{
97aff369 347 dVAR;
a3b680e6 348 const int retval = PL_savestack_ix;
a3b680e6 349 const int paren_elems_to_push = (PL_regsize - parenfloor) * REGCP_PAREN_ELEMS;
e0fa7e2b
NC
350 const UV total_elems = paren_elems_to_push + REGCP_OTHER_ELEMS;
351 const UV elems_shifted = total_elems << SAVE_TIGHT_SHIFT;
a0d0e21e 352 int p;
40a82448 353 GET_RE_DEBUG_FLAGS_DECL;
a0d0e21e 354
e49a9654
IH
355 if (paren_elems_to_push < 0)
356 Perl_croak(aTHX_ "panic: paren_elems_to_push < 0");
357
e0fa7e2b
NC
358 if ((elems_shifted >> SAVE_TIGHT_SHIFT) != total_elems)
359 Perl_croak(aTHX_ "panic: paren_elems_to_push offset %"UVuf
5df417d0
JH
360 " out of range (%lu-%ld)",
361 total_elems, (unsigned long)PL_regsize, (long)parenfloor);
e0fa7e2b 362
620d5b66 363 SSGROW(total_elems + REGCP_FRAME_ELEMS);
7f69552c 364
3280af22 365 for (p = PL_regsize; p > parenfloor; p--) {
b1ce53c5 366/* REGCP_PARENS_ELEMS are pushed per pairs of parentheses. */
f0ab9afb
NC
367 SSPUSHINT(PL_regoffs[p].end);
368 SSPUSHINT(PL_regoffs[p].start);
3280af22 369 SSPUSHPTR(PL_reg_start_tmp[p]);
a0d0e21e 370 SSPUSHINT(p);
e7707071 371 DEBUG_BUFFERS_r(PerlIO_printf(Perl_debug_log,
40a82448 372 " saving \\%"UVuf" %"IVdf"(%"IVdf")..%"IVdf"\n",
f0ab9afb 373 (UV)p, (IV)PL_regoffs[p].start,
40a82448 374 (IV)(PL_reg_start_tmp[p] - PL_bostr),
f0ab9afb 375 (IV)PL_regoffs[p].end
40a82448 376 ));
a0d0e21e 377 }
b1ce53c5 378/* REGCP_OTHER_ELEMS are pushed in any case, parentheses or no. */
f0ab9afb 379 SSPUSHPTR(PL_regoffs);
3280af22
NIS
380 SSPUSHINT(PL_regsize);
381 SSPUSHINT(*PL_reglastparen);
a01268b5 382 SSPUSHINT(*PL_reglastcloseparen);
3280af22 383 SSPUSHPTR(PL_reginput);
e0fa7e2b 384 SSPUSHUV(SAVEt_REGCONTEXT | elems_shifted); /* Magic cookie. */
41123dfd 385
a0d0e21e
LW
386 return retval;
387}
388
c277df42 389/* These are needed since we do not localize EVAL nodes: */
ab3bbdeb
YO
390#define REGCP_SET(cp) \
391 DEBUG_STATE_r( \
ab3bbdeb 392 PerlIO_printf(Perl_debug_log, \
e4f74956 393 " Setting an EVAL scope, savestack=%"IVdf"\n", \
ab3bbdeb
YO
394 (IV)PL_savestack_ix)); \
395 cp = PL_savestack_ix
c3464db5 396
ab3bbdeb 397#define REGCP_UNWIND(cp) \
e4f74956 398 DEBUG_STATE_r( \
ab3bbdeb 399 if (cp != PL_savestack_ix) \
e4f74956
YO
400 PerlIO_printf(Perl_debug_log, \
401 " Clearing an EVAL scope, savestack=%"IVdf"..%"IVdf"\n", \
ab3bbdeb
YO
402 (IV)(cp), (IV)PL_savestack_ix)); \
403 regcpblow(cp)
c277df42 404
76e3520e 405STATIC char *
097eb12c 406S_regcppop(pTHX_ const regexp *rex)
a0d0e21e 407{
97aff369 408 dVAR;
e0fa7e2b 409 UV i;
a0d0e21e 410 char *input;
a3621e74
YO
411 GET_RE_DEBUG_FLAGS_DECL;
412
7918f24d
NC
413 PERL_ARGS_ASSERT_REGCPPOP;
414
b1ce53c5 415 /* Pop REGCP_OTHER_ELEMS before the parentheses loop starts. */
c6bf6a65 416 i = SSPOPUV;
e0fa7e2b
NC
417 assert((i & SAVE_MASK) == SAVEt_REGCONTEXT); /* Check that the magic cookie is there. */
418 i >>= SAVE_TIGHT_SHIFT; /* Parentheses elements to pop. */
a0d0e21e 419 input = (char *) SSPOPPTR;
a01268b5 420 *PL_reglastcloseparen = SSPOPINT;
3280af22
NIS
421 *PL_reglastparen = SSPOPINT;
422 PL_regsize = SSPOPINT;
f0ab9afb 423 PL_regoffs=(regexp_paren_pair *) SSPOPPTR;
b1ce53c5 424
620d5b66 425 i -= REGCP_OTHER_ELEMS;
b1ce53c5 426 /* Now restore the parentheses context. */
620d5b66 427 for ( ; i > 0; i -= REGCP_PAREN_ELEMS) {
1df70142 428 I32 tmps;
097eb12c 429 U32 paren = (U32)SSPOPINT;
3280af22 430 PL_reg_start_tmp[paren] = (char *) SSPOPPTR;
f0ab9afb 431 PL_regoffs[paren].start = SSPOPINT;
cf93c79d 432 tmps = SSPOPINT;
3280af22 433 if (paren <= *PL_reglastparen)
f0ab9afb 434 PL_regoffs[paren].end = tmps;
e7707071 435 DEBUG_BUFFERS_r(
c3464db5 436 PerlIO_printf(Perl_debug_log,
b900a521 437 " restoring \\%"UVuf" to %"IVdf"(%"IVdf")..%"IVdf"%s\n",
f0ab9afb 438 (UV)paren, (IV)PL_regoffs[paren].start,
b900a521 439 (IV)(PL_reg_start_tmp[paren] - PL_bostr),
f0ab9afb 440 (IV)PL_regoffs[paren].end,
3280af22 441 (paren > *PL_reglastparen ? "(no)" : ""));
c277df42 442 );
a0d0e21e 443 }
e7707071 444 DEBUG_BUFFERS_r(
bb7a0f54 445 if (*PL_reglastparen + 1 <= rex->nparens) {
c3464db5 446 PerlIO_printf(Perl_debug_log,
faccc32b 447 " restoring \\%"IVdf"..\\%"IVdf" to undef\n",
4f639d21 448 (IV)(*PL_reglastparen + 1), (IV)rex->nparens);
c277df42
IZ
449 }
450 );
daf18116 451#if 1
dafc8851
JH
452 /* It would seem that the similar code in regtry()
453 * already takes care of this, and in fact it is in
454 * a better location to since this code can #if 0-ed out
455 * but the code in regtry() is needed or otherwise tests
456 * requiring null fields (pat.t#187 and split.t#{13,14}
daf18116
JH
457 * (as of patchlevel 7877) will fail. Then again,
458 * this code seems to be necessary or otherwise
225593e1
DM
459 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
460 * --jhi updated by dapm */
3b6647e0 461 for (i = *PL_reglastparen + 1; i <= rex->nparens; i++) {
097eb12c 462 if (i > PL_regsize)
f0ab9afb
NC
463 PL_regoffs[i].start = -1;
464 PL_regoffs[i].end = -1;
a0d0e21e 465 }
dafc8851 466#endif
a0d0e21e
LW
467 return input;
468}
469
02db2b7b 470#define regcpblow(cp) LEAVE_SCOPE(cp) /* Ignores regcppush()ed data. */
a0d0e21e 471
a687059c 472/*
e50aee73 473 * pregexec and friends
a687059c
LW
474 */
475
76234dfb 476#ifndef PERL_IN_XSUB_RE
a687059c 477/*
c277df42 478 - pregexec - match a regexp against a string
a687059c 479 */
c277df42 480I32
49d7dfbc 481Perl_pregexec(pTHX_ REGEXP * const prog, char* stringarg, register char *strend,
c3464db5 482 char *strbeg, I32 minend, SV *screamer, U32 nosave)
c277df42
IZ
483/* strend: pointer to null at end of string */
484/* strbeg: real beginning of string */
485/* minend: end of match must be >=minend after stringarg. */
486/* nosave: For optimizations. */
487{
7918f24d
NC
488 PERL_ARGS_ASSERT_PREGEXEC;
489
c277df42 490 return
9041c2e3 491 regexec_flags(prog, stringarg, strend, strbeg, minend, screamer, NULL,
c277df42
IZ
492 nosave ? 0 : REXEC_COPY_STR);
493}
76234dfb 494#endif
22e551b9 495
9041c2e3 496/*
cad2e5aa
JH
497 * Need to implement the following flags for reg_anch:
498 *
499 * USE_INTUIT_NOML - Useful to call re_intuit_start() first
500 * USE_INTUIT_ML
501 * INTUIT_AUTORITATIVE_NOML - Can trust a positive answer
502 * INTUIT_AUTORITATIVE_ML
503 * INTUIT_ONCE_NOML - Intuit can match in one location only.
504 * INTUIT_ONCE_ML
505 *
506 * Another flag for this function: SECOND_TIME (so that float substrs
507 * with giant delta may be not rechecked).
508 */
509
510/* Assumptions: if ANCH_GPOS, then strpos is anchored. XXXX Check GPOS logic */
511
3f7c398e 512/* If SCREAM, then SvPVX_const(sv) should be compatible with strpos and strend.
cad2e5aa
JH
513 Otherwise, only SvCUR(sv) is used to get strbeg. */
514
515/* XXXX We assume that strpos is strbeg unless sv. */
516
6eb5f6b9
JH
517/* XXXX Some places assume that there is a fixed substring.
518 An update may be needed if optimizer marks as "INTUITable"
519 RExen without fixed substrings. Similarly, it is assumed that
520 lengths of all the strings are no more than minlen, thus they
521 cannot come from lookahead.
40d049e4
YO
522 (Or minlen should take into account lookahead.)
523 NOTE: Some of this comment is not correct. minlen does now take account
524 of lookahead/behind. Further research is required. -- demerphq
525
526*/
6eb5f6b9 527
2c2d71f5
JH
528/* A failure to find a constant substring means that there is no need to make
529 an expensive call to REx engine, thus we celebrate a failure. Similarly,
530 finding a substring too deep into the string means that less calls to
30944b6d
IZ
531 regtry() should be needed.
532
533 REx compiler's optimizer found 4 possible hints:
534 a) Anchored substring;
535 b) Fixed substring;
536 c) Whether we are anchored (beginning-of-line or \G);
486ec47a 537 d) First node (of those at offset 0) which may distinguish positions;
6eb5f6b9 538 We use a)b)d) and multiline-part of c), and try to find a position in the
30944b6d
IZ
539 string which does not contradict any of them.
540 */
2c2d71f5 541
6eb5f6b9
JH
542/* Most of decisions we do here should have been done at compile time.
543 The nodes of the REx which we used for the search should have been
544 deleted from the finite automaton. */
545
cad2e5aa 546char *
288b8c02 547Perl_re_intuit_start(pTHX_ REGEXP * const rx, SV *sv, char *strpos,
9f61653a 548 char *strend, const U32 flags, re_scream_pos_data *data)
cad2e5aa 549{
97aff369 550 dVAR;
288b8c02 551 struct regexp *const prog = (struct regexp *)SvANY(rx);
b7953727 552 register I32 start_shift = 0;
cad2e5aa 553 /* Should be nonnegative! */
b7953727 554 register I32 end_shift = 0;
2c2d71f5
JH
555 register char *s;
556 register SV *check;
a1933d95 557 char *strbeg;
cad2e5aa 558 char *t;
f2ed9b32 559 const bool utf8_target = (sv && SvUTF8(sv)) ? 1 : 0; /* if no sv we have to assume bytes */
cad2e5aa 560 I32 ml_anch;
bd61b366
SS
561 register char *other_last = NULL; /* other substr checked before this */
562 char *check_at = NULL; /* check substr found at this pos */
bbe252da 563 const I32 multiline = prog->extflags & RXf_PMf_MULTILINE;
f8fc2ecf 564 RXi_GET_DECL(prog,progi);
30944b6d 565#ifdef DEBUGGING
890ce7af 566 const char * const i_strpos = strpos;
30944b6d 567#endif
a3621e74
YO
568 GET_RE_DEBUG_FLAGS_DECL;
569
7918f24d
NC
570 PERL_ARGS_ASSERT_RE_INTUIT_START;
571
f2ed9b32 572 RX_MATCH_UTF8_set(rx,utf8_target);
cad2e5aa 573
3c8556c3 574 if (RX_UTF8(rx)) {
b8d68ded
JH
575 PL_reg_flags |= RF_utf8;
576 }
ab3bbdeb 577 DEBUG_EXECUTE_r(
f2ed9b32 578 debug_start_match(rx, utf8_target, strpos, strend,
1de06328
YO
579 sv ? "Guessing start of match in sv for"
580 : "Guessing start of match in string for");
2a782b5b 581 );
cad2e5aa 582
c344f387
JH
583 /* CHR_DIST() would be more correct here but it makes things slow. */
584 if (prog->minlen > strend - strpos) {
a3621e74 585 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
a72c7584 586 "String too short... [re_intuit_start]\n"));
cad2e5aa 587 goto fail;
2c2d71f5 588 }
1de06328 589
a1933d95 590 strbeg = (sv && SvPOK(sv)) ? strend - SvCUR(sv) : strpos;
1aa99e6b 591 PL_regeol = strend;
f2ed9b32 592 if (utf8_target) {
33b8afdf
JH
593 if (!prog->check_utf8 && prog->check_substr)
594 to_utf8_substr(prog);
595 check = prog->check_utf8;
596 } else {
597 if (!prog->check_substr && prog->check_utf8)
598 to_byte_substr(prog);
599 check = prog->check_substr;
600 }
1de06328 601 if (check == &PL_sv_undef) {
a3621e74 602 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
1de06328 603 "Non-utf8 string cannot match utf8 check string\n"));
33b8afdf
JH
604 goto fail;
605 }
bbe252da
YO
606 if (prog->extflags & RXf_ANCH) { /* Match at beg-of-str or after \n */
607 ml_anch = !( (prog->extflags & RXf_ANCH_SINGLE)
608 || ( (prog->extflags & RXf_ANCH_BOL)
7fba1cd6 609 && !multiline ) ); /* Check after \n? */
cad2e5aa 610
7e25d62c 611 if (!ml_anch) {
bbe252da
YO
612 if ( !(prog->extflags & RXf_ANCH_GPOS) /* Checked by the caller */
613 && !(prog->intflags & PREGf_IMPLICIT) /* not a real BOL */
3f7c398e 614 /* SvCUR is not set on references: SvRV and SvPVX_const overlap */
7e25d62c
JH
615 && sv && !SvROK(sv)
616 && (strpos != strbeg)) {
a3621e74 617 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not at start...\n"));
7e25d62c
JH
618 goto fail;
619 }
620 if (prog->check_offset_min == prog->check_offset_max &&
bbe252da 621 !(prog->extflags & RXf_CANY_SEEN)) {
2c2d71f5 622 /* Substring at constant offset from beg-of-str... */
cad2e5aa
JH
623 I32 slen;
624
1aa99e6b 625 s = HOP3c(strpos, prog->check_offset_min, strend);
1de06328 626
653099ff
GS
627 if (SvTAIL(check)) {
628 slen = SvCUR(check); /* >= 1 */
cad2e5aa 629
9041c2e3 630 if ( strend - s > slen || strend - s < slen - 1
2c2d71f5 631 || (strend - s == slen && strend[-1] != '\n')) {
a3621e74 632 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String too long...\n"));
2c2d71f5 633 goto fail_finish;
cad2e5aa
JH
634 }
635 /* Now should match s[0..slen-2] */
636 slen--;
3f7c398e 637 if (slen && (*SvPVX_const(check) != *s
cad2e5aa 638 || (slen > 1
3f7c398e 639 && memNE(SvPVX_const(check), s, slen)))) {
2c2d71f5 640 report_neq:
a3621e74 641 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String not equal...\n"));
2c2d71f5
JH
642 goto fail_finish;
643 }
cad2e5aa 644 }
3f7c398e 645 else if (*SvPVX_const(check) != *s
653099ff 646 || ((slen = SvCUR(check)) > 1
3f7c398e 647 && memNE(SvPVX_const(check), s, slen)))
2c2d71f5 648 goto report_neq;
c315bfe8 649 check_at = s;
2c2d71f5 650 goto success_at_start;
7e25d62c 651 }
cad2e5aa 652 }
2c2d71f5 653 /* Match is anchored, but substr is not anchored wrt beg-of-str. */
cad2e5aa 654 s = strpos;
2c2d71f5 655 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
1de06328
YO
656 end_shift = prog->check_end_shift;
657
2c2d71f5 658 if (!ml_anch) {
a3b680e6 659 const I32 end = prog->check_offset_max + CHR_SVLEN(check)
653099ff 660 - (SvTAIL(check) != 0);
a3b680e6 661 const I32 eshift = CHR_DIST((U8*)strend, (U8*)s) - end;
2c2d71f5
JH
662
663 if (end_shift < eshift)
664 end_shift = eshift;
665 }
cad2e5aa 666 }
2c2d71f5 667 else { /* Can match at random position */
cad2e5aa
JH
668 ml_anch = 0;
669 s = strpos;
1de06328
YO
670 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
671 end_shift = prog->check_end_shift;
672
673 /* end shift should be non negative here */
cad2e5aa
JH
674 }
675
bcdf7404 676#ifdef QDEBUGGING /* 7/99: reports of failure (with the older version) */
0033605d 677 if (end_shift < 0)
1de06328 678 Perl_croak(aTHX_ "panic: end_shift: %"IVdf" pattern:\n%s\n ",
220fc49f 679 (IV)end_shift, RX_PRECOMP(prog));
2c2d71f5
JH
680#endif
681
2c2d71f5
JH
682 restart:
683 /* Find a possible match in the region s..strend by looking for
684 the "check" substring in the region corrected by start/end_shift. */
1de06328
YO
685
686 {
687 I32 srch_start_shift = start_shift;
688 I32 srch_end_shift = end_shift;
689 if (srch_start_shift < 0 && strbeg - s > srch_start_shift) {
690 srch_end_shift -= ((strbeg - s) - srch_start_shift);
691 srch_start_shift = strbeg - s;
692 }
6bda09f9 693 DEBUG_OPTIMISE_MORE_r({
1de06328
YO
694 PerlIO_printf(Perl_debug_log, "Check offset min: %"IVdf" Start shift: %"IVdf" End shift %"IVdf" Real End Shift: %"IVdf"\n",
695 (IV)prog->check_offset_min,
696 (IV)srch_start_shift,
697 (IV)srch_end_shift,
698 (IV)prog->check_end_shift);
699 });
700
f1905e1b 701 if ((flags & REXEC_SCREAM) && SvSCREAM(sv)) {
cad2e5aa 702 I32 p = -1; /* Internal iterator of scream. */
a3b680e6 703 I32 * const pp = data ? data->scream_pos : &p;
4185c919 704 const MAGIC *mg;
72de20cd 705 bool found = FALSE;
cad2e5aa 706
4185c919
NC
707 assert(SvMAGICAL(sv));
708 mg = mg_find(sv, PERL_MAGIC_study);
709 assert(mg);
710
72de20cd
NC
711 if (mg->mg_private == 1) {
712 found = ((U8 *)mg->mg_ptr)[BmRARE(check)] != (U8)~0;
713 } else if (mg->mg_private == 2) {
714 found = ((U16 *)mg->mg_ptr)[BmRARE(check)] != (U16)~0;
715 } else {
716 assert (mg->mg_private == 4);
717 found = ((U32 *)mg->mg_ptr)[BmRARE(check)] != (U32)~0;
718 }
719
720 if (found
2c2d71f5 721 || ( BmRARE(check) == '\n'
85c508c3 722 && (BmPREVIOUS(check) == SvCUR(check) - 1)
2c2d71f5 723 && SvTAIL(check) ))
9041c2e3 724 s = screaminstr(sv, check,
1de06328 725 srch_start_shift + (s - strbeg), srch_end_shift, pp, 0);
cad2e5aa 726 else
2c2d71f5 727 goto fail_finish;
4addbd3b 728 /* we may be pointing at the wrong string */
07bc277f 729 if (s && RXp_MATCH_COPIED(prog))
3f7c398e 730 s = strbeg + (s - SvPVX_const(sv));
cad2e5aa
JH
731 if (data)
732 *data->scream_olds = s;
733 }
1de06328
YO
734 else {
735 U8* start_point;
736 U8* end_point;
bbe252da 737 if (prog->extflags & RXf_CANY_SEEN) {
1de06328
YO
738 start_point= (U8*)(s + srch_start_shift);
739 end_point= (U8*)(strend - srch_end_shift);
740 } else {
741 start_point= HOP3(s, srch_start_shift, srch_start_shift < 0 ? strbeg : strend);
742 end_point= HOP3(strend, -srch_end_shift, strbeg);
743 }
6bda09f9 744 DEBUG_OPTIMISE_MORE_r({
56570a2c 745 PerlIO_printf(Perl_debug_log, "fbm_instr len=%d str=<%.*s>\n",
1de06328 746 (int)(end_point - start_point),
fc8cd66c 747 (int)(end_point - start_point) > 20 ? 20 : (int)(end_point - start_point),
1de06328
YO
748 start_point);
749 });
750
751 s = fbm_instr( start_point, end_point,
7fba1cd6 752 check, multiline ? FBMrf_MULTILINE : 0);
1de06328
YO
753 }
754 }
cad2e5aa
JH
755 /* Update the count-of-usability, remove useless subpatterns,
756 unshift s. */
2c2d71f5 757
ab3bbdeb 758 DEBUG_EXECUTE_r({
f2ed9b32 759 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
ab3bbdeb
YO
760 SvPVX_const(check), RE_SV_DUMPLEN(check), 30);
761 PerlIO_printf(Perl_debug_log, "%s %s substr %s%s%s",
2c2d71f5 762 (s ? "Found" : "Did not find"),
f2ed9b32 763 (check == (utf8_target ? prog->anchored_utf8 : prog->anchored_substr)
ab3bbdeb
YO
764 ? "anchored" : "floating"),
765 quoted,
766 RE_SV_TAIL(check),
767 (s ? " at offset " : "...\n") );
768 });
2c2d71f5
JH
769
770 if (!s)
771 goto fail_finish;
2c2d71f5 772 /* Finish the diagnostic message */
a3621e74 773 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%ld...\n", (long)(s - i_strpos)) );
2c2d71f5 774
1de06328
YO
775 /* XXX dmq: first branch is for positive lookbehind...
776 Our check string is offset from the beginning of the pattern.
777 So we need to do any stclass tests offset forward from that
778 point. I think. :-(
779 */
780
781
782
783 check_at=s;
784
785
2c2d71f5
JH
786 /* Got a candidate. Check MBOL anchoring, and the *other* substr.
787 Start with the other substr.
788 XXXX no SCREAM optimization yet - and a very coarse implementation
a0288114 789 XXXX /ttx+/ results in anchored="ttx", floating="x". floating will
2c2d71f5
JH
790 *always* match. Probably should be marked during compile...
791 Probably it is right to do no SCREAM here...
792 */
793
f2ed9b32 794 if (utf8_target ? (prog->float_utf8 && prog->anchored_utf8)
1de06328
YO
795 : (prog->float_substr && prog->anchored_substr))
796 {
30944b6d 797 /* Take into account the "other" substring. */
2c2d71f5
JH
798 /* XXXX May be hopelessly wrong for UTF... */
799 if (!other_last)
6eb5f6b9 800 other_last = strpos;
f2ed9b32 801 if (check == (utf8_target ? prog->float_utf8 : prog->float_substr)) {
30944b6d
IZ
802 do_other_anchored:
803 {
890ce7af
AL
804 char * const last = HOP3c(s, -start_shift, strbeg);
805 char *last1, *last2;
be8e71aa 806 char * const saved_s = s;
33b8afdf 807 SV* must;
2c2d71f5 808
2c2d71f5
JH
809 t = s - prog->check_offset_max;
810 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
f2ed9b32 811 && (!utf8_target
0ce71af7 812 || ((t = (char*)reghopmaybe3((U8*)s, -(prog->check_offset_max), (U8*)strpos))
2c2d71f5 813 && t > strpos)))
6f207bd3 814 NOOP;
2c2d71f5
JH
815 else
816 t = strpos;
1aa99e6b 817 t = HOP3c(t, prog->anchored_offset, strend);
6eb5f6b9
JH
818 if (t < other_last) /* These positions already checked */
819 t = other_last;
1aa99e6b 820 last2 = last1 = HOP3c(strend, -prog->minlen, strbeg);
2c2d71f5
JH
821 if (last < last1)
822 last1 = last;
1de06328
YO
823 /* XXXX It is not documented what units *_offsets are in.
824 We assume bytes, but this is clearly wrong.
825 Meaning this code needs to be carefully reviewed for errors.
826 dmq.
827 */
828
2c2d71f5 829 /* On end-of-str: see comment below. */
f2ed9b32 830 must = utf8_target ? prog->anchored_utf8 : prog->anchored_substr;
33b8afdf
JH
831 if (must == &PL_sv_undef) {
832 s = (char*)NULL;
1de06328 833 DEBUG_r(must = prog->anchored_utf8); /* for debug */
33b8afdf
JH
834 }
835 else
836 s = fbm_instr(
837 (unsigned char*)t,
838 HOP3(HOP3(last1, prog->anchored_offset, strend)
839 + SvCUR(must), -(SvTAIL(must)!=0), strbeg),
840 must,
7fba1cd6 841 multiline ? FBMrf_MULTILINE : 0
33b8afdf 842 );
ab3bbdeb 843 DEBUG_EXECUTE_r({
f2ed9b32 844 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
ab3bbdeb
YO
845 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
846 PerlIO_printf(Perl_debug_log, "%s anchored substr %s%s",
2c2d71f5 847 (s ? "Found" : "Contradicts"),
ab3bbdeb
YO
848 quoted, RE_SV_TAIL(must));
849 });
850
851
2c2d71f5
JH
852 if (!s) {
853 if (last1 >= last2) {
a3621e74 854 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
2c2d71f5
JH
855 ", giving up...\n"));
856 goto fail_finish;
857 }
a3621e74 858 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
2c2d71f5 859 ", trying floating at offset %ld...\n",
be8e71aa 860 (long)(HOP3c(saved_s, 1, strend) - i_strpos)));
1aa99e6b
IH
861 other_last = HOP3c(last1, prog->anchored_offset+1, strend);
862 s = HOP3c(last, 1, strend);
2c2d71f5
JH
863 goto restart;
864 }
865 else {
a3621e74 866 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
30944b6d 867 (long)(s - i_strpos)));
1aa99e6b
IH
868 t = HOP3c(s, -prog->anchored_offset, strbeg);
869 other_last = HOP3c(s, 1, strend);
be8e71aa 870 s = saved_s;
2c2d71f5
JH
871 if (t == strpos)
872 goto try_at_start;
2c2d71f5
JH
873 goto try_at_offset;
874 }
30944b6d 875 }
2c2d71f5
JH
876 }
877 else { /* Take into account the floating substring. */
33b8afdf 878 char *last, *last1;
be8e71aa 879 char * const saved_s = s;
33b8afdf
JH
880 SV* must;
881
882 t = HOP3c(s, -start_shift, strbeg);
883 last1 = last =
884 HOP3c(strend, -prog->minlen + prog->float_min_offset, strbeg);
885 if (CHR_DIST((U8*)last, (U8*)t) > prog->float_max_offset)
886 last = HOP3c(t, prog->float_max_offset, strend);
887 s = HOP3c(t, prog->float_min_offset, strend);
888 if (s < other_last)
889 s = other_last;
2c2d71f5 890 /* XXXX It is not documented what units *_offsets are in. Assume bytes. */
f2ed9b32 891 must = utf8_target ? prog->float_utf8 : prog->float_substr;
33b8afdf
JH
892 /* fbm_instr() takes into account exact value of end-of-str
893 if the check is SvTAIL(ed). Since false positives are OK,
894 and end-of-str is not later than strend we are OK. */
895 if (must == &PL_sv_undef) {
896 s = (char*)NULL;
1de06328 897 DEBUG_r(must = prog->float_utf8); /* for debug message */
33b8afdf
JH
898 }
899 else
2c2d71f5 900 s = fbm_instr((unsigned char*)s,
33b8afdf
JH
901 (unsigned char*)last + SvCUR(must)
902 - (SvTAIL(must)!=0),
7fba1cd6 903 must, multiline ? FBMrf_MULTILINE : 0);
ab3bbdeb 904 DEBUG_EXECUTE_r({
f2ed9b32 905 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
ab3bbdeb
YO
906 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
907 PerlIO_printf(Perl_debug_log, "%s floating substr %s%s",
33b8afdf 908 (s ? "Found" : "Contradicts"),
ab3bbdeb
YO
909 quoted, RE_SV_TAIL(must));
910 });
33b8afdf
JH
911 if (!s) {
912 if (last1 == last) {
a3621e74 913 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
33b8afdf
JH
914 ", giving up...\n"));
915 goto fail_finish;
2c2d71f5 916 }
a3621e74 917 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
33b8afdf 918 ", trying anchored starting at offset %ld...\n",
be8e71aa 919 (long)(saved_s + 1 - i_strpos)));
33b8afdf
JH
920 other_last = last;
921 s = HOP3c(t, 1, strend);
922 goto restart;
923 }
924 else {
a3621e74 925 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
33b8afdf
JH
926 (long)(s - i_strpos)));
927 other_last = s; /* Fix this later. --Hugo */
be8e71aa 928 s = saved_s;
33b8afdf
JH
929 if (t == strpos)
930 goto try_at_start;
931 goto try_at_offset;
932 }
2c2d71f5 933 }
cad2e5aa 934 }
2c2d71f5 935
1de06328 936
9ef43ace 937 t= (char*)HOP3( s, -prog->check_offset_max, (prog->check_offset_max<0) ? strend : strpos);
1de06328 938
6bda09f9 939 DEBUG_OPTIMISE_MORE_r(
1de06328
YO
940 PerlIO_printf(Perl_debug_log,
941 "Check offset min:%"IVdf" max:%"IVdf" S:%"IVdf" t:%"IVdf" D:%"IVdf" end:%"IVdf"\n",
942 (IV)prog->check_offset_min,
943 (IV)prog->check_offset_max,
944 (IV)(s-strpos),
945 (IV)(t-strpos),
946 (IV)(t-s),
947 (IV)(strend-strpos)
948 )
949 );
950
2c2d71f5 951 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
f2ed9b32 952 && (!utf8_target
9ef43ace 953 || ((t = (char*)reghopmaybe3((U8*)s, -prog->check_offset_max, (U8*) ((prog->check_offset_max<0) ? strend : strpos)))
1de06328
YO
954 && t > strpos)))
955 {
2c2d71f5
JH
956 /* Fixed substring is found far enough so that the match
957 cannot start at strpos. */
958 try_at_offset:
cad2e5aa 959 if (ml_anch && t[-1] != '\n') {
30944b6d
IZ
960 /* Eventually fbm_*() should handle this, but often
961 anchored_offset is not 0, so this check will not be wasted. */
962 /* XXXX In the code below we prefer to look for "^" even in
963 presence of anchored substrings. And we search even
964 beyond the found float position. These pessimizations
965 are historical artefacts only. */
966 find_anchor:
2c2d71f5 967 while (t < strend - prog->minlen) {
cad2e5aa 968 if (*t == '\n') {
4ee3650e 969 if (t < check_at - prog->check_offset_min) {
f2ed9b32 970 if (utf8_target ? prog->anchored_utf8 : prog->anchored_substr) {
4ee3650e
GS
971 /* Since we moved from the found position,
972 we definitely contradict the found anchored
30944b6d
IZ
973 substr. Due to the above check we do not
974 contradict "check" substr.
975 Thus we can arrive here only if check substr
976 is float. Redo checking for "other"=="fixed".
977 */
9041c2e3 978 strpos = t + 1;
a3621e74 979 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld, rescanning for anchored from offset %ld...\n",
e4584336 980 PL_colors[0], PL_colors[1], (long)(strpos - i_strpos), (long)(strpos - i_strpos + prog->anchored_offset)));
30944b6d
IZ
981 goto do_other_anchored;
982 }
4ee3650e
GS
983 /* We don't contradict the found floating substring. */
984 /* XXXX Why not check for STCLASS? */
cad2e5aa 985 s = t + 1;
a3621e74 986 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld...\n",
e4584336 987 PL_colors[0], PL_colors[1], (long)(s - i_strpos)));
cad2e5aa
JH
988 goto set_useful;
989 }
4ee3650e
GS
990 /* Position contradicts check-string */
991 /* XXXX probably better to look for check-string
992 than for "\n", so one should lower the limit for t? */
a3621e74 993 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m, restarting lookup for check-string at offset %ld...\n",
e4584336 994 PL_colors[0], PL_colors[1], (long)(t + 1 - i_strpos)));
0e41cd87 995 other_last = strpos = s = t + 1;
cad2e5aa
JH
996 goto restart;
997 }
998 t++;
999 }
a3621e74 1000 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Did not find /%s^%s/m...\n",
e4584336 1001 PL_colors[0], PL_colors[1]));
2c2d71f5 1002 goto fail_finish;
cad2e5aa 1003 }
f5952150 1004 else {
a3621e74 1005 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Starting position does not contradict /%s^%s/m...\n",
e4584336 1006 PL_colors[0], PL_colors[1]));
f5952150 1007 }
cad2e5aa
JH
1008 s = t;
1009 set_useful:
f2ed9b32 1010 ++BmUSEFUL(utf8_target ? prog->check_utf8 : prog->check_substr); /* hooray/5 */
cad2e5aa
JH
1011 }
1012 else {
f5952150 1013 /* The found string does not prohibit matching at strpos,
2c2d71f5 1014 - no optimization of calling REx engine can be performed,
f5952150
GS
1015 unless it was an MBOL and we are not after MBOL,
1016 or a future STCLASS check will fail this. */
2c2d71f5
JH
1017 try_at_start:
1018 /* Even in this situation we may use MBOL flag if strpos is offset
1019 wrt the start of the string. */
05b4157f 1020 if (ml_anch && sv && !SvROK(sv) /* See prev comment on SvROK */
a1933d95 1021 && (strpos != strbeg) && strpos[-1] != '\n'
d506a20d 1022 /* May be due to an implicit anchor of m{.*foo} */
bbe252da 1023 && !(prog->intflags & PREGf_IMPLICIT))
d506a20d 1024 {
cad2e5aa
JH
1025 t = strpos;
1026 goto find_anchor;
1027 }
a3621e74 1028 DEBUG_EXECUTE_r( if (ml_anch)
f5952150 1029 PerlIO_printf(Perl_debug_log, "Position at offset %ld does not contradict /%s^%s/m...\n",
70685ca0 1030 (long)(strpos - i_strpos), PL_colors[0], PL_colors[1]);
30944b6d 1031 );
2c2d71f5 1032 success_at_start:
bbe252da 1033 if (!(prog->intflags & PREGf_NAUGHTY) /* XXXX If strpos moved? */
f2ed9b32 1034 && (utf8_target ? (
33b8afdf
JH
1035 prog->check_utf8 /* Could be deleted already */
1036 && --BmUSEFUL(prog->check_utf8) < 0
1037 && (prog->check_utf8 == prog->float_utf8)
1038 ) : (
1039 prog->check_substr /* Could be deleted already */
1040 && --BmUSEFUL(prog->check_substr) < 0
1041 && (prog->check_substr == prog->float_substr)
1042 )))
66e933ab 1043 {
cad2e5aa 1044 /* If flags & SOMETHING - do not do it many times on the same match */
a3621e74 1045 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "... Disabling check substring...\n"));
f2ed9b32
KW
1046 /* XXX Does the destruction order has to change with utf8_target? */
1047 SvREFCNT_dec(utf8_target ? prog->check_utf8 : prog->check_substr);
1048 SvREFCNT_dec(utf8_target ? prog->check_substr : prog->check_utf8);
a0714e2c
SS
1049 prog->check_substr = prog->check_utf8 = NULL; /* disable */
1050 prog->float_substr = prog->float_utf8 = NULL; /* clear */
1051 check = NULL; /* abort */
cad2e5aa 1052 s = strpos;
486ec47a 1053 /* XXXX If the check string was an implicit check MBOL, then we need to unset the relevant flag
c9415951
YO
1054 see http://bugs.activestate.com/show_bug.cgi?id=87173 */
1055 if (prog->intflags & PREGf_IMPLICIT)
1056 prog->extflags &= ~RXf_ANCH_MBOL;
3cf5c195
IZ
1057 /* XXXX This is a remnant of the old implementation. It
1058 looks wasteful, since now INTUIT can use many
6eb5f6b9 1059 other heuristics. */
bbe252da 1060 prog->extflags &= ~RXf_USE_INTUIT;
c9415951 1061 /* XXXX What other flags might need to be cleared in this branch? */
cad2e5aa
JH
1062 }
1063 else
1064 s = strpos;
1065 }
1066
6eb5f6b9
JH
1067 /* Last resort... */
1068 /* XXXX BmUSEFUL already changed, maybe multiple change is meaningful... */
1de06328
YO
1069 /* trie stclasses are too expensive to use here, we are better off to
1070 leave it to regmatch itself */
f8fc2ecf 1071 if (progi->regstclass && PL_regkind[OP(progi->regstclass)]!=TRIE) {
6eb5f6b9
JH
1072 /* minlen == 0 is possible if regstclass is \b or \B,
1073 and the fixed substr is ''$.
1074 Since minlen is already taken into account, s+1 is before strend;
1075 accidentally, minlen >= 1 guaranties no false positives at s + 1
1076 even for \b or \B. But (minlen? 1 : 0) below assumes that
1077 regstclass does not come from lookahead... */
1078 /* If regstclass takes bytelength more than 1: If charlength==1, OK.
af944926 1079 This leaves EXACTF-ish only, which are dealt with in find_byclass(). */
f8fc2ecf
YO
1080 const U8* const str = (U8*)STRING(progi->regstclass);
1081 const int cl_l = (PL_regkind[OP(progi->regstclass)] == EXACT
1082 ? CHR_DIST(str+STR_LEN(progi->regstclass), str)
66e933ab 1083 : 1);
1de06328
YO
1084 char * endpos;
1085 if (prog->anchored_substr || prog->anchored_utf8 || ml_anch)
1086 endpos= HOP3c(s, (prog->minlen ? cl_l : 0), strend);
1087 else if (prog->float_substr || prog->float_utf8)
1088 endpos= HOP3c(HOP3c(check_at, -start_shift, strbeg), cl_l, strend);
1089 else
1090 endpos= strend;
1091
70685ca0
JH
1092 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "start_shift: %"IVdf" check_at: %"IVdf" s: %"IVdf" endpos: %"IVdf"\n",
1093 (IV)start_shift, (IV)(check_at - strbeg), (IV)(s - strbeg), (IV)(endpos - strbeg)));
1de06328 1094
6eb5f6b9 1095 t = s;
f8fc2ecf 1096 s = find_byclass(prog, progi->regstclass, s, endpos, NULL);
6eb5f6b9
JH
1097 if (!s) {
1098#ifdef DEBUGGING
cbbf8932 1099 const char *what = NULL;
6eb5f6b9
JH
1100#endif
1101 if (endpos == strend) {
a3621e74 1102 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
6eb5f6b9
JH
1103 "Could not match STCLASS...\n") );
1104 goto fail;
1105 }
a3621e74 1106 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
66e933ab 1107 "This position contradicts STCLASS...\n") );
bbe252da 1108 if ((prog->extflags & RXf_ANCH) && !ml_anch)
653099ff 1109 goto fail;
6eb5f6b9 1110 /* Contradict one of substrings */
33b8afdf 1111 if (prog->anchored_substr || prog->anchored_utf8) {
f2ed9b32 1112 if ((utf8_target ? prog->anchored_utf8 : prog->anchored_substr) == check) {
a3621e74 1113 DEBUG_EXECUTE_r( what = "anchored" );
6eb5f6b9 1114 hop_and_restart:
1aa99e6b 1115 s = HOP3c(t, 1, strend);
66e933ab
GS
1116 if (s + start_shift + end_shift > strend) {
1117 /* XXXX Should be taken into account earlier? */
a3621e74 1118 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
66e933ab
GS
1119 "Could not match STCLASS...\n") );
1120 goto fail;
1121 }
5e39e1e5
HS
1122 if (!check)
1123 goto giveup;
a3621e74 1124 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
f5952150 1125 "Looking for %s substr starting at offset %ld...\n",
6eb5f6b9
JH
1126 what, (long)(s + start_shift - i_strpos)) );
1127 goto restart;
1128 }
66e933ab 1129 /* Have both, check_string is floating */
6eb5f6b9
JH
1130 if (t + start_shift >= check_at) /* Contradicts floating=check */
1131 goto retry_floating_check;
1132 /* Recheck anchored substring, but not floating... */
9041c2e3 1133 s = check_at;
5e39e1e5
HS
1134 if (!check)
1135 goto giveup;
a3621e74 1136 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
f5952150 1137 "Looking for anchored substr starting at offset %ld...\n",
6eb5f6b9
JH
1138 (long)(other_last - i_strpos)) );
1139 goto do_other_anchored;
1140 }
60e71179
GS
1141 /* Another way we could have checked stclass at the
1142 current position only: */
1143 if (ml_anch) {
1144 s = t = t + 1;
5e39e1e5
HS
1145 if (!check)
1146 goto giveup;
a3621e74 1147 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
f5952150 1148 "Looking for /%s^%s/m starting at offset %ld...\n",
e4584336 1149 PL_colors[0], PL_colors[1], (long)(t - i_strpos)) );
60e71179 1150 goto try_at_offset;
66e933ab 1151 }
f2ed9b32 1152 if (!(utf8_target ? prog->float_utf8 : prog->float_substr)) /* Could have been deleted */
60e71179 1153 goto fail;
486ec47a 1154 /* Check is floating substring. */
6eb5f6b9
JH
1155 retry_floating_check:
1156 t = check_at - start_shift;
a3621e74 1157 DEBUG_EXECUTE_r( what = "floating" );
6eb5f6b9
JH
1158 goto hop_and_restart;
1159 }
b7953727 1160 if (t != s) {
a3621e74 1161 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
6eb5f6b9 1162 "By STCLASS: moving %ld --> %ld\n",
b7953727
JH
1163 (long)(t - i_strpos), (long)(s - i_strpos))
1164 );
1165 }
1166 else {
a3621e74 1167 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
b7953727
JH
1168 "Does not contradict STCLASS...\n");
1169 );
1170 }
6eb5f6b9 1171 }
5e39e1e5 1172 giveup:
a3621e74 1173 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s%s:%s match at offset %ld\n",
5e39e1e5
HS
1174 PL_colors[4], (check ? "Guessed" : "Giving up"),
1175 PL_colors[5], (long)(s - i_strpos)) );
cad2e5aa 1176 return s;
2c2d71f5
JH
1177
1178 fail_finish: /* Substring not found */
33b8afdf 1179 if (prog->check_substr || prog->check_utf8) /* could be removed already */
f2ed9b32 1180 BmUSEFUL(utf8_target ? prog->check_utf8 : prog->check_substr) += 5; /* hooray */
cad2e5aa 1181 fail:
a3621e74 1182 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch rejected by optimizer%s\n",
e4584336 1183 PL_colors[4], PL_colors[5]));
bd61b366 1184 return NULL;
cad2e5aa 1185}
9661b544 1186
a0a388a1
YO
1187#define DECL_TRIE_TYPE(scan) \
1188 const enum { trie_plain, trie_utf8, trie_utf8_fold, trie_latin_utf8_fold } \
1189 trie_type = (scan->flags != EXACT) \
f2ed9b32
KW
1190 ? (utf8_target ? trie_utf8_fold : (UTF_PATTERN ? trie_latin_utf8_fold : trie_plain)) \
1191 : (utf8_target ? trie_utf8 : trie_plain)
3b0527fe 1192
55eed653
NC
1193#define REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc, uscan, len, \
1194uvc, charid, foldlen, foldbuf, uniflags) STMT_START { \
4cadc6a9
YO
1195 switch (trie_type) { \
1196 case trie_utf8_fold: \
1197 if ( foldlen>0 ) { \
0abd0d78 1198 uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
4cadc6a9
YO
1199 foldlen -= len; \
1200 uscan += len; \
1201 len=0; \
1202 } else { \
0abd0d78 1203 uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
4cadc6a9
YO
1204 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1205 foldlen -= UNISKIP( uvc ); \
1206 uscan = foldbuf + UNISKIP( uvc ); \
1207 } \
1208 break; \
a0a388a1
YO
1209 case trie_latin_utf8_fold: \
1210 if ( foldlen>0 ) { \
1211 uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
1212 foldlen -= len; \
1213 uscan += len; \
1214 len=0; \
1215 } else { \
1216 len = 1; \
1217 uvc = to_uni_fold( *(U8*)uc, foldbuf, &foldlen ); \
1218 foldlen -= UNISKIP( uvc ); \
1219 uscan = foldbuf + UNISKIP( uvc ); \
1220 } \
1221 break; \
4cadc6a9
YO
1222 case trie_utf8: \
1223 uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
1224 break; \
1225 case trie_plain: \
1226 uvc = (UV)*uc; \
1227 len = 1; \
1228 } \
4cadc6a9
YO
1229 if (uvc < 256) { \
1230 charid = trie->charmap[ uvc ]; \
1231 } \
1232 else { \
1233 charid = 0; \
55eed653
NC
1234 if (widecharmap) { \
1235 SV** const svpp = hv_fetch(widecharmap, \
4cadc6a9
YO
1236 (char*)&uvc, sizeof(UV), 0); \
1237 if (svpp) \
1238 charid = (U16)SvIV(*svpp); \
1239 } \
1240 } \
1241} STMT_END
1242
4cadc6a9
YO
1243#define REXEC_FBC_EXACTISH_SCAN(CoNd) \
1244STMT_START { \
1245 while (s <= e) { \
1246 if ( (CoNd) \
fac1af77 1247 && (ln == 1 || folder(s, pat_string, ln)) \
9a5a5549 1248 && (!reginfo || regtry(reginfo, &s)) ) \
4cadc6a9
YO
1249 goto got_it; \
1250 s++; \
1251 } \
1252} STMT_END
1253
1254#define REXEC_FBC_UTF8_SCAN(CoDe) \
1255STMT_START { \
1256 while (s + (uskip = UTF8SKIP(s)) <= strend) { \
1257 CoDe \
1258 s += uskip; \
1259 } \
1260} STMT_END
1261
1262#define REXEC_FBC_SCAN(CoDe) \
1263STMT_START { \
1264 while (s < strend) { \
1265 CoDe \
1266 s++; \
1267 } \
1268} STMT_END
1269
1270#define REXEC_FBC_UTF8_CLASS_SCAN(CoNd) \
1271REXEC_FBC_UTF8_SCAN( \
1272 if (CoNd) { \
24b23f37 1273 if (tmp && (!reginfo || regtry(reginfo, &s))) \
4cadc6a9
YO
1274 goto got_it; \
1275 else \
1276 tmp = doevery; \
1277 } \
1278 else \
1279 tmp = 1; \
1280)
1281
1282#define REXEC_FBC_CLASS_SCAN(CoNd) \
1283REXEC_FBC_SCAN( \
1284 if (CoNd) { \
24b23f37 1285 if (tmp && (!reginfo || regtry(reginfo, &s))) \
4cadc6a9
YO
1286 goto got_it; \
1287 else \
1288 tmp = doevery; \
1289 } \
1290 else \
1291 tmp = 1; \
1292)
1293
1294#define REXEC_FBC_TRYIT \
24b23f37 1295if ((!reginfo || regtry(reginfo, &s))) \
4cadc6a9
YO
1296 goto got_it
1297
e1d1eefb 1298#define REXEC_FBC_CSCAN(CoNdUtF8,CoNd) \
f2ed9b32 1299 if (utf8_target) { \
e1d1eefb
YO
1300 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1301 } \
1302 else { \
1303 REXEC_FBC_CLASS_SCAN(CoNd); \
d981ef24 1304 }
e1d1eefb 1305
4cadc6a9 1306#define REXEC_FBC_CSCAN_PRELOAD(UtFpReLoAd,CoNdUtF8,CoNd) \
f2ed9b32 1307 if (utf8_target) { \
4cadc6a9
YO
1308 UtFpReLoAd; \
1309 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1310 } \
1311 else { \
1312 REXEC_FBC_CLASS_SCAN(CoNd); \
d981ef24 1313 }
4cadc6a9
YO
1314
1315#define REXEC_FBC_CSCAN_TAINT(CoNdUtF8,CoNd) \
1316 PL_reg_flags |= RF_tainted; \
f2ed9b32 1317 if (utf8_target) { \
4cadc6a9
YO
1318 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1319 } \
1320 else { \
1321 REXEC_FBC_CLASS_SCAN(CoNd); \
d981ef24 1322 }
4cadc6a9 1323
786e8c11
YO
1324#define DUMP_EXEC_POS(li,s,doutf8) \
1325 dump_exec_pos(li,s,(PL_regeol),(PL_bostr),(PL_reg_starttry),doutf8)
1326
cfaf538b
KW
1327
1328#define UTF8_NOLOAD(TEST_NON_UTF8, IF_SUCCESS, IF_FAIL) \
1329 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n'; \
1330 tmp = TEST_NON_UTF8(tmp); \
1331 REXEC_FBC_UTF8_SCAN( \
1332 if (tmp == ! TEST_NON_UTF8((U8) *s)) { \
1333 tmp = !tmp; \
1334 IF_SUCCESS; \
1335 } \
1336 else { \
1337 IF_FAIL; \
1338 } \
1339 ); \
1340
1341#define UTF8_LOAD(TeSt1_UtF8, TeSt2_UtF8, IF_SUCCESS, IF_FAIL) \
1342 if (s == PL_bostr) { \
1343 tmp = '\n'; \
1344 } \
1345 else { \
1346 U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr); \
1347 tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT); \
1348 } \
1349 tmp = TeSt1_UtF8; \
1350 LOAD_UTF8_CHARCLASS_ALNUM(); \
1351 REXEC_FBC_UTF8_SCAN( \
1352 if (tmp == ! (TeSt2_UtF8)) { \
1353 tmp = !tmp; \
1354 IF_SUCCESS; \
1355 } \
1356 else { \
1357 IF_FAIL; \
1358 } \
1359 ); \
1360
63ac0dad
KW
1361/* The only difference between the BOUND and NBOUND cases is that
1362 * REXEC_FBC_TRYIT is called when matched in BOUND, and when non-matched in
1363 * NBOUND. This is accomplished by passing it in either the if or else clause,
1364 * with the other one being empty */
1365#define FBC_BOUND(TEST_NON_UTF8, TEST1_UTF8, TEST2_UTF8) \
1dcf4a1b 1366 FBC_BOUND_COMMON(UTF8_LOAD(TEST1_UTF8, TEST2_UTF8, REXEC_FBC_TRYIT, PLACEHOLDER), TEST_NON_UTF8, REXEC_FBC_TRYIT, PLACEHOLDER)
cfaf538b
KW
1367
1368#define FBC_BOUND_NOLOAD(TEST_NON_UTF8, TEST1_UTF8, TEST2_UTF8) \
1dcf4a1b 1369 FBC_BOUND_COMMON(UTF8_NOLOAD(TEST_NON_UTF8, REXEC_FBC_TRYIT, PLACEHOLDER), TEST_NON_UTF8, REXEC_FBC_TRYIT, PLACEHOLDER)
63ac0dad
KW
1370
1371#define FBC_NBOUND(TEST_NON_UTF8, TEST1_UTF8, TEST2_UTF8) \
1dcf4a1b 1372 FBC_BOUND_COMMON(UTF8_LOAD(TEST1_UTF8, TEST2_UTF8, PLACEHOLDER, REXEC_FBC_TRYIT), TEST_NON_UTF8, PLACEHOLDER, REXEC_FBC_TRYIT)
cfaf538b
KW
1373
1374#define FBC_NBOUND_NOLOAD(TEST_NON_UTF8, TEST1_UTF8, TEST2_UTF8) \
1dcf4a1b 1375 FBC_BOUND_COMMON(UTF8_NOLOAD(TEST_NON_UTF8, PLACEHOLDER, REXEC_FBC_TRYIT), TEST_NON_UTF8, PLACEHOLDER, REXEC_FBC_TRYIT)
cfaf538b 1376
63ac0dad
KW
1377
1378/* Common to the BOUND and NBOUND cases. Unfortunately the UTF8 tests need to
1379 * be passed in completely with the variable name being tested, which isn't
1380 * such a clean interface, but this is easier to read than it was before. We
1381 * are looking for the boundary (or non-boundary between a word and non-word
1382 * character. The utf8 and non-utf8 cases have the same logic, but the details
1383 * must be different. Find the "wordness" of the character just prior to this
1384 * one, and compare it with the wordness of this one. If they differ, we have
1385 * a boundary. At the beginning of the string, pretend that the previous
1386 * character was a new-line */
cfaf538b 1387#define FBC_BOUND_COMMON(UTF8_CODE, TEST_NON_UTF8, IF_SUCCESS, IF_FAIL) \
63ac0dad 1388 if (utf8_target) { \
cfaf538b 1389 UTF8_CODE \
63ac0dad
KW
1390 } \
1391 else { /* Not utf8 */ \
1392 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n'; \
1393 tmp = TEST_NON_UTF8(tmp); \
1394 REXEC_FBC_SCAN( \
1395 if (tmp == ! TEST_NON_UTF8((U8) *s)) { \
1396 tmp = !tmp; \
1397 IF_SUCCESS; \
1398 } \
1399 else { \
1400 IF_FAIL; \
1401 } \
1402 ); \
1403 } \
1404 if ((!prog->minlen && tmp) && (!reginfo || regtry(reginfo, &s))) \
1405 goto got_it;
1406
786e8c11
YO
1407/* We know what class REx starts with. Try to find this position... */
1408/* if reginfo is NULL, its a dryrun */
1409/* annoyingly all the vars in this routine have different names from their counterparts
1410 in regmatch. /grrr */
1411
3c3eec57 1412STATIC char *
07be1b83 1413S_find_byclass(pTHX_ regexp * prog, const regnode *c, char *s,
24b23f37 1414 const char *strend, regmatch_info *reginfo)
a687059c 1415{
27da23d5 1416 dVAR;
bbe252da 1417 const I32 doevery = (prog->intflags & PREGf_SKIP) == 0;
fac1af77
KW
1418 char *pat_string; /* The pattern's exactish string */
1419 char *pat_end; /* ptr to end char of pat_string */
1420 re_fold_t folder; /* Function for computing non-utf8 folds */
1421 const U8 *fold_array; /* array for folding ords < 256 */
d8093b23 1422 STRLEN ln;
5dab1207 1423 STRLEN lnc;
078c425b 1424 register STRLEN uskip;
fac1af77
KW
1425 U8 c1;
1426 U8 c2;
6eb5f6b9
JH
1427 char *e;
1428 register I32 tmp = 1; /* Scratch variable? */
f2ed9b32 1429 register const bool utf8_target = PL_reg_match_utf8;
453bfd44 1430 UV utf8_fold_flags = 0;
f8fc2ecf 1431 RXi_GET_DECL(prog,progi);
7918f24d
NC
1432
1433 PERL_ARGS_ASSERT_FIND_BYCLASS;
f8fc2ecf 1434
6eb5f6b9
JH
1435 /* We know what class it must start with. */
1436 switch (OP(c)) {
f56b6394 1437 case ANYOFV:
6eb5f6b9 1438 case ANYOF:
f56b6394 1439 if (utf8_target || OP(c) == ANYOFV) {
b1e3e569
KW
1440 STRLEN inclasslen = strend - s;
1441 REXEC_FBC_UTF8_CLASS_SCAN(
1442 reginclass(prog, c, (U8*)s, &inclasslen, utf8_target));
388cc4de
HS
1443 }
1444 else {
6ef69d56 1445 REXEC_FBC_CLASS_SCAN(REGINCLASS(prog, c, (U8*)s));
a0d0e21e 1446 }
6eb5f6b9 1447 break;
f33976b4 1448 case CANY:
4cadc6a9 1449 REXEC_FBC_SCAN(
24b23f37 1450 if (tmp && (!reginfo || regtry(reginfo, &s)))
f33976b4
DB
1451 goto got_it;
1452 else
1453 tmp = doevery;
4cadc6a9 1454 );
f33976b4 1455 break;
2f7f8cb1
KW
1456
1457 case EXACTFA:
1458 if (UTF_PATTERN || utf8_target) {
1459 utf8_fold_flags = FOLDEQ_UTF8_NOMIX_ASCII;
1460 goto do_exactf_utf8;
1461 }
1462 fold_array = PL_fold_latin1; /* Latin1 folds are not affected by */
1463 folder = foldEQ_latin1; /* /a, except the sharp s one which */
1464 goto do_exactf_non_utf8; /* isn't dealt with by these */
1465
9a5a5549 1466 case EXACTFU:
fac1af77
KW
1467 if (UTF_PATTERN || utf8_target) {
1468 utf8_fold_flags = 0;
1469 goto do_exactf_utf8;
1470 }
0a185c45
KW
1471
1472 /* Any 'ss' in the pattern should have been replaced by regcomp,
1473 * so we don't have to worry here about this single special case
1474 * in the Latin1 range */
fac1af77
KW
1475 fold_array = PL_fold_latin1;
1476 folder = foldEQ_latin1;
0a185c45 1477 goto do_exactf_non_utf8;
fac1af77 1478
6eb5f6b9 1479 case EXACTF:
fac1af77
KW
1480 if (UTF_PATTERN || utf8_target) {
1481 utf8_fold_flags = 0;
1482 goto do_exactf_utf8;
1483 }
1484 fold_array = PL_fold;
1485 folder = foldEQ;
1486 goto do_exactf_non_utf8;
1487
1488 case EXACTFL:
1489 if (UTF_PATTERN || utf8_target) {
17580e7a 1490 utf8_fold_flags = FOLDEQ_UTF8_LOCALE;
fac1af77
KW
1491 goto do_exactf_utf8;
1492 }
1493 fold_array = PL_fold_locale;
1494 folder = foldEQ_locale;
1495
1496 /* FALL THROUGH */
1497
1498 do_exactf_non_utf8: /* Neither pattern nor string are UTF8 */
1499
1500 /* The idea in the non-utf8 EXACTF* cases is to first find the
1501 * first character of the EXACTF* node and then, if necessary,
1502 * case-insensitively compare the full text of the node. c1 is the
1503 * first character. c2 is its fold. This logic will not work for
1504 * Unicode semantics and the german sharp ss, which hence should
1505 * not be compiled into a node that gets here. */
1506 pat_string = STRING(c);
1507 ln = STR_LEN(c); /* length to match in octets/bytes */
1508
1509 e = HOP3c(strend, -((I32)ln), s);
1510
1511 if (!reginfo && e < s) {
1512 e = s; /* Due to minlen logic of intuit() */
1513 }
1514
1515 c1 = *pat_string;
1516 c2 = fold_array[c1];
1517 if (c1 == c2) { /* If char and fold are the same */
1518 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1);
1519 }
1520 else {
1521 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1 || *(U8*)s == c2);
1522 }
1523 break;
1524
1525 do_exactf_utf8:
1526
1527 /* If one of the operands is in utf8, we can't use the simpler
1528 * folding above, due to the fact that many different characters
1529 * can have the same fold, or portion of a fold, or different-
1530 * length fold */
1531 pat_string = STRING(c);
1532 ln = STR_LEN(c); /* length to match in octets/bytes */
1533 pat_end = pat_string + ln;
1534 lnc = (UTF_PATTERN) /* length to match in characters */
1535 ? utf8_length((U8 *) pat_string, (U8 *) pat_end)
1536 : ln;
1537
7c1b9f38
KW
1538 /* Set the end position to the final character available */
1539 e = HOP3c(strend, -1, s);
fac1af77
KW
1540
1541 if (!reginfo && e < s) {
1542 e = s; /* Due to minlen logic of intuit() */
1543 }
1544
1545 while (s <= e) {
1546 char *my_strend= (char *)strend;
1547 if (foldEQ_utf8_flags(s, &my_strend, 0, utf8_target,
1548 pat_string, NULL, ln, cBOOL(UTF_PATTERN), utf8_fold_flags)
1549 && (!reginfo || regtry(reginfo, &s)) )
1550 {
1551 goto got_it;
1552 }
1553 s += UTF8SKIP(s);
1554 }
1555 break;
bbce6d69 1556 case BOUNDL:
3280af22 1557 PL_reg_flags |= RF_tainted;
63ac0dad
KW
1558 FBC_BOUND(isALNUM_LC,
1559 isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp)),
1560 isALNUM_LC_utf8((U8*)s));
a0ed51b3 1561 break;
bbce6d69 1562 case NBOUNDL:
3280af22 1563 PL_reg_flags |= RF_tainted;
63ac0dad
KW
1564 FBC_NBOUND(isALNUM_LC,
1565 isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp)),
1566 isALNUM_LC_utf8((U8*)s));
1567 break;
1568 case BOUND:
1569 FBC_BOUND(isWORDCHAR,
1570 isALNUM_uni(tmp),
1571 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)));
1572 break;
cfaf538b
KW
1573 case BOUNDA:
1574 FBC_BOUND_NOLOAD(isWORDCHAR_A,
1575 isWORDCHAR_A(tmp),
1576 isWORDCHAR_A((U8*)s));
1577 break;
a0d0e21e 1578 case NBOUND:
63ac0dad
KW
1579 FBC_NBOUND(isWORDCHAR,
1580 isALNUM_uni(tmp),
1581 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)));
1582 break;
cfaf538b
KW
1583 case NBOUNDA:
1584 FBC_NBOUND_NOLOAD(isWORDCHAR_A,
1585 isWORDCHAR_A(tmp),
1586 isWORDCHAR_A((U8*)s));
1587 break;
63ac0dad
KW
1588 case BOUNDU:
1589 FBC_BOUND(isWORDCHAR_L1,
1590 isALNUM_uni(tmp),
1591 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)));
1592 break;
1593 case NBOUNDU:
1594 FBC_NBOUND(isWORDCHAR_L1,
1595 isALNUM_uni(tmp),
1596 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)));
a0ed51b3 1597 break;
bbce6d69 1598 case ALNUML:
4cadc6a9
YO
1599 REXEC_FBC_CSCAN_TAINT(
1600 isALNUM_LC_utf8((U8*)s),
1601 isALNUM_LC(*s)
1602 );
6895a8aa 1603 break;
980866de
KW
1604 case ALNUMU:
1605 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1606 LOAD_UTF8_CHARCLASS_ALNUM(),
1607 swash_fetch(PL_utf8_alnum,(U8*)s, utf8_target),
980866de
KW
1608 isWORDCHAR_L1((U8) *s)
1609 );
6895a8aa 1610 break;
980866de
KW
1611 case ALNUM:
1612 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1613 LOAD_UTF8_CHARCLASS_ALNUM(),
1614 swash_fetch(PL_utf8_alnum,(U8*)s, utf8_target),
980866de
KW
1615 isWORDCHAR((U8) *s)
1616 );
6895a8aa 1617 break;
cfaf538b 1618 case ALNUMA:
8e9da4d4
KW
1619 /* Don't need to worry about utf8, as it can match only a single
1620 * byte invariant character */
cfaf538b 1621 REXEC_FBC_CLASS_SCAN( isWORDCHAR_A(*s));
6895a8aa 1622 break;
980866de
KW
1623 case NALNUMU:
1624 REXEC_FBC_CSCAN_PRELOAD(
779d7b58 1625 LOAD_UTF8_CHARCLASS_ALNUM(),
359960d4 1626 !swash_fetch(PL_utf8_alnum,(U8*)s, utf8_target),
980866de
KW
1627 ! isWORDCHAR_L1((U8) *s)
1628 );
6895a8aa 1629 break;
a0d0e21e 1630 case NALNUM:
4cadc6a9 1631 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1632 LOAD_UTF8_CHARCLASS_ALNUM(),
1633 !swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target),
980866de 1634 ! isALNUM(*s)
4cadc6a9 1635 );
6895a8aa 1636 break;
cfaf538b 1637 case NALNUMA:
8e9da4d4
KW
1638 REXEC_FBC_CSCAN(
1639 !isWORDCHAR_A(*s),
1640 !isWORDCHAR_A(*s)
1641 );
1642 break;
bbce6d69 1643 case NALNUML:
4cadc6a9
YO
1644 REXEC_FBC_CSCAN_TAINT(
1645 !isALNUM_LC_utf8((U8*)s),
1646 !isALNUM_LC(*s)
1647 );
6895a8aa 1648 break;
980866de
KW
1649 case SPACEU:
1650 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1651 LOAD_UTF8_CHARCLASS_SPACE(),
1652 *s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, utf8_target),
980866de
KW
1653 isSPACE_L1((U8) *s)
1654 );
6895a8aa 1655 break;
a0d0e21e 1656 case SPACE:
4cadc6a9 1657 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1658 LOAD_UTF8_CHARCLASS_SPACE(),
1659 *s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, utf8_target),
980866de 1660 isSPACE((U8) *s)
4cadc6a9 1661 );
6895a8aa 1662 break;
cfaf538b 1663 case SPACEA:
8e9da4d4
KW
1664 /* Don't need to worry about utf8, as it can match only a single
1665 * byte invariant character */
cfaf538b 1666 REXEC_FBC_CLASS_SCAN( isSPACE_A(*s));
6895a8aa 1667 break;
bbce6d69 1668 case SPACEL:
4cadc6a9 1669 REXEC_FBC_CSCAN_TAINT(
6bbba904 1670 isSPACE_LC_utf8((U8*)s),
4cadc6a9
YO
1671 isSPACE_LC(*s)
1672 );
6895a8aa 1673 break;
980866de
KW
1674 case NSPACEU:
1675 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1676 LOAD_UTF8_CHARCLASS_SPACE(),
1677 !( *s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, utf8_target)),
980866de
KW
1678 ! isSPACE_L1((U8) *s)
1679 );
6895a8aa 1680 break;
a0d0e21e 1681 case NSPACE:
4cadc6a9 1682 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1683 LOAD_UTF8_CHARCLASS_SPACE(),
1684 !(*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, utf8_target)),
980866de 1685 ! isSPACE((U8) *s)
4cadc6a9 1686 );
6895a8aa 1687 break;
cfaf538b 1688 case NSPACEA:
8e9da4d4
KW
1689 REXEC_FBC_CSCAN(
1690 !isSPACE_A(*s),
1691 !isSPACE_A(*s)
1692 );
1693 break;
bbce6d69 1694 case NSPACEL:
4cadc6a9 1695 REXEC_FBC_CSCAN_TAINT(
6bbba904 1696 !isSPACE_LC_utf8((U8*)s),
4cadc6a9
YO
1697 !isSPACE_LC(*s)
1698 );
6895a8aa 1699 break;
a0d0e21e 1700 case DIGIT:
4cadc6a9 1701 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1702 LOAD_UTF8_CHARCLASS_DIGIT(),
1703 swash_fetch(PL_utf8_digit,(U8*)s, utf8_target),
4cadc6a9
YO
1704 isDIGIT(*s)
1705 );
6895a8aa 1706 break;
cfaf538b 1707 case DIGITA:
8e9da4d4
KW
1708 /* Don't need to worry about utf8, as it can match only a single
1709 * byte invariant character */
cfaf538b 1710 REXEC_FBC_CLASS_SCAN( isDIGIT_A(*s));
6895a8aa 1711 break;
b8c5462f 1712 case DIGITL:
4cadc6a9
YO
1713 REXEC_FBC_CSCAN_TAINT(
1714 isDIGIT_LC_utf8((U8*)s),
1715 isDIGIT_LC(*s)
1716 );
6895a8aa 1717 break;
a0d0e21e 1718 case NDIGIT:
4cadc6a9 1719 REXEC_FBC_CSCAN_PRELOAD(
779d7b58
KW
1720 LOAD_UTF8_CHARCLASS_DIGIT(),
1721 !swash_fetch(PL_utf8_digit,(U8*)s, utf8_target),
4cadc6a9
YO
1722 !isDIGIT(*s)
1723 );
6895a8aa 1724 break;
cfaf538b 1725 case NDIGITA:
8e9da4d4
KW
1726 REXEC_FBC_CSCAN(
1727 !isDIGIT_A(*s),
1728 !isDIGIT_A(*s)
1729 );
1730 break;
b8c5462f 1731 case NDIGITL:
4cadc6a9
YO
1732 REXEC_FBC_CSCAN_TAINT(
1733 !isDIGIT_LC_utf8((U8*)s),
1734 !isDIGIT_LC(*s)
1735 );
6895a8aa 1736 break;
e1d1eefb
YO
1737 case LNBREAK:
1738 REXEC_FBC_CSCAN(
1739 is_LNBREAK_utf8(s),
1740 is_LNBREAK_latin1(s)
1741 );
6895a8aa 1742 break;
e1d1eefb
YO
1743 case VERTWS:
1744 REXEC_FBC_CSCAN(
1745 is_VERTWS_utf8(s),
1746 is_VERTWS_latin1(s)
1747 );
6895a8aa 1748 break;
e1d1eefb
YO
1749 case NVERTWS:
1750 REXEC_FBC_CSCAN(
1751 !is_VERTWS_utf8(s),
1752 !is_VERTWS_latin1(s)
1753 );
6895a8aa 1754 break;
e1d1eefb
YO
1755 case HORIZWS:
1756 REXEC_FBC_CSCAN(
1757 is_HORIZWS_utf8(s),
1758 is_HORIZWS_latin1(s)
1759 );
6895a8aa 1760 break;
e1d1eefb
YO
1761 case NHORIZWS:
1762 REXEC_FBC_CSCAN(
1763 !is_HORIZWS_utf8(s),
1764 !is_HORIZWS_latin1(s)
1765 );
6895a8aa 1766 break;
1de06328
YO
1767 case AHOCORASICKC:
1768 case AHOCORASICK:
07be1b83 1769 {
a0a388a1 1770 DECL_TRIE_TYPE(c);
07be1b83
YO
1771 /* what trie are we using right now */
1772 reg_ac_data *aho
f8fc2ecf 1773 = (reg_ac_data*)progi->data->data[ ARG( c ) ];
3251b653
NC
1774 reg_trie_data *trie
1775 = (reg_trie_data*)progi->data->data[ aho->trie ];
85fbaab2 1776 HV *widecharmap = MUTABLE_HV(progi->data->data[ aho->trie + 1 ]);
07be1b83
YO
1777
1778 const char *last_start = strend - trie->minlen;
6148ee25 1779#ifdef DEBUGGING
07be1b83 1780 const char *real_start = s;
6148ee25 1781#endif
07be1b83 1782 STRLEN maxlen = trie->maxlen;
be8e71aa
YO
1783 SV *sv_points;
1784 U8 **points; /* map of where we were in the input string
786e8c11 1785 when reading a given char. For ASCII this
be8e71aa 1786 is unnecessary overhead as the relationship
38a44b82
NC
1787 is always 1:1, but for Unicode, especially
1788 case folded Unicode this is not true. */
f9e705e8 1789 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
786e8c11
YO
1790 U8 *bitmap=NULL;
1791
07be1b83
YO
1792
1793 GET_RE_DEBUG_FLAGS_DECL;
1794
be8e71aa
YO
1795 /* We can't just allocate points here. We need to wrap it in
1796 * an SV so it gets freed properly if there is a croak while
1797 * running the match */
1798 ENTER;
1799 SAVETMPS;
1800 sv_points=newSV(maxlen * sizeof(U8 *));
1801 SvCUR_set(sv_points,
1802 maxlen * sizeof(U8 *));
1803 SvPOK_on(sv_points);
1804 sv_2mortal(sv_points);
1805 points=(U8**)SvPV_nolen(sv_points );
1de06328
YO
1806 if ( trie_type != trie_utf8_fold
1807 && (trie->bitmap || OP(c)==AHOCORASICKC) )
1808 {
786e8c11
YO
1809 if (trie->bitmap)
1810 bitmap=(U8*)trie->bitmap;
1811 else
1812 bitmap=(U8*)ANYOF_BITMAP(c);
07be1b83 1813 }
786e8c11
YO
1814 /* this is the Aho-Corasick algorithm modified a touch
1815 to include special handling for long "unknown char"
1816 sequences. The basic idea being that we use AC as long
1817 as we are dealing with a possible matching char, when
1818 we encounter an unknown char (and we have not encountered
1819 an accepting state) we scan forward until we find a legal
1820 starting char.
1821 AC matching is basically that of trie matching, except
1822 that when we encounter a failing transition, we fall back
1823 to the current states "fail state", and try the current char
1824 again, a process we repeat until we reach the root state,
1825 state 1, or a legal transition. If we fail on the root state
1826 then we can either terminate if we have reached an accepting
1827 state previously, or restart the entire process from the beginning
1828 if we have not.
1829
1830 */
07be1b83
YO
1831 while (s <= last_start) {
1832 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1833 U8 *uc = (U8*)s;
1834 U16 charid = 0;
1835 U32 base = 1;
1836 U32 state = 1;
1837 UV uvc = 0;
1838 STRLEN len = 0;
1839 STRLEN foldlen = 0;
1840 U8 *uscan = (U8*)NULL;
1841 U8 *leftmost = NULL;
786e8c11
YO
1842#ifdef DEBUGGING
1843 U32 accepted_word= 0;
1844#endif
07be1b83
YO
1845 U32 pointpos = 0;
1846
1847 while ( state && uc <= (U8*)strend ) {
1848 int failed=0;
786e8c11
YO
1849 U32 word = aho->states[ state ].wordnum;
1850
1de06328
YO
1851 if( state==1 ) {
1852 if ( bitmap ) {
1853 DEBUG_TRIE_EXECUTE_r(
1854 if ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1855 dump_exec_pos( (char *)uc, c, strend, real_start,
f2ed9b32 1856 (char *)uc, utf8_target );
1de06328
YO
1857 PerlIO_printf( Perl_debug_log,
1858 " Scanning for legal start char...\n");
1859 }
d085b490
YO
1860 );
1861 if (utf8_target) {
1862 while ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1863 uc += UTF8SKIP(uc);
1864 }
1865 } else {
1866 while ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1867 uc++;
1868 }
1869 }
1de06328 1870 s= (char *)uc;
786e8c11 1871 }
786e8c11
YO
1872 if (uc >(U8*)last_start) break;
1873 }
1874
1875 if ( word ) {
2e64971a 1876 U8 *lpos= points[ (pointpos - trie->wordinfo[word].len) % maxlen ];
786e8c11
YO
1877 if (!leftmost || lpos < leftmost) {
1878 DEBUG_r(accepted_word=word);
07be1b83 1879 leftmost= lpos;
786e8c11 1880 }
07be1b83 1881 if (base==0) break;
786e8c11 1882
07be1b83
YO
1883 }
1884 points[pointpos++ % maxlen]= uc;
55eed653
NC
1885 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
1886 uscan, len, uvc, charid, foldlen,
1887 foldbuf, uniflags);
786e8c11
YO
1888 DEBUG_TRIE_EXECUTE_r({
1889 dump_exec_pos( (char *)uc, c, strend, real_start,
f2ed9b32 1890 s, utf8_target );
07be1b83 1891 PerlIO_printf(Perl_debug_log,
786e8c11
YO
1892 " Charid:%3u CP:%4"UVxf" ",
1893 charid, uvc);
1894 });
07be1b83
YO
1895
1896 do {
6148ee25 1897#ifdef DEBUGGING
786e8c11 1898 word = aho->states[ state ].wordnum;
6148ee25 1899#endif
07be1b83
YO
1900 base = aho->states[ state ].trans.base;
1901
786e8c11
YO
1902 DEBUG_TRIE_EXECUTE_r({
1903 if (failed)
1904 dump_exec_pos( (char *)uc, c, strend, real_start,
f2ed9b32 1905 s, utf8_target );
07be1b83 1906 PerlIO_printf( Perl_debug_log,
786e8c11
YO
1907 "%sState: %4"UVxf", word=%"UVxf,
1908 failed ? " Fail transition to " : "",
1909 (UV)state, (UV)word);
1910 });
07be1b83
YO
1911 if ( base ) {
1912 U32 tmp;
6dd2be57 1913 I32 offset;
07be1b83 1914 if (charid &&
6dd2be57
DM
1915 ( ((offset = base + charid
1916 - 1 - trie->uniquecharcount)) >= 0)
1917 && ((U32)offset < trie->lasttrans)
1918 && trie->trans[offset].check == state
1919 && (tmp=trie->trans[offset].next))
07be1b83 1920 {
786e8c11
YO
1921 DEBUG_TRIE_EXECUTE_r(
1922 PerlIO_printf( Perl_debug_log," - legal\n"));
07be1b83
YO
1923 state = tmp;
1924 break;
1925 }
1926 else {
786e8c11
YO
1927 DEBUG_TRIE_EXECUTE_r(
1928 PerlIO_printf( Perl_debug_log," - fail\n"));
1929 failed = 1;
1930 state = aho->fail[state];
07be1b83
YO
1931 }
1932 }
1933 else {
1934 /* we must be accepting here */
786e8c11
YO
1935 DEBUG_TRIE_EXECUTE_r(
1936 PerlIO_printf( Perl_debug_log," - accepting\n"));
1937 failed = 1;
07be1b83
YO
1938 break;
1939 }
1940 } while(state);
786e8c11 1941 uc += len;
07be1b83
YO
1942 if (failed) {
1943 if (leftmost)
1944 break;
786e8c11 1945 if (!state) state = 1;
07be1b83
YO
1946 }
1947 }
1948 if ( aho->states[ state ].wordnum ) {
2e64971a 1949 U8 *lpos = points[ (pointpos - trie->wordinfo[aho->states[ state ].wordnum].len) % maxlen ];
786e8c11
YO
1950 if (!leftmost || lpos < leftmost) {
1951 DEBUG_r(accepted_word=aho->states[ state ].wordnum);
07be1b83 1952 leftmost = lpos;
786e8c11 1953 }
07be1b83 1954 }
07be1b83
YO
1955 if (leftmost) {
1956 s = (char*)leftmost;
786e8c11
YO
1957 DEBUG_TRIE_EXECUTE_r({
1958 PerlIO_printf(
70685ca0
JH
1959 Perl_debug_log,"Matches word #%"UVxf" at position %"IVdf". Trying full pattern...\n",
1960 (UV)accepted_word, (IV)(s - real_start)
786e8c11
YO
1961 );
1962 });
24b23f37 1963 if (!reginfo || regtry(reginfo, &s)) {
be8e71aa
YO
1964 FREETMPS;
1965 LEAVE;
07be1b83 1966 goto got_it;
be8e71aa 1967 }
07be1b83 1968 s = HOPc(s,1);
786e8c11
YO
1969 DEBUG_TRIE_EXECUTE_r({
1970 PerlIO_printf( Perl_debug_log,"Pattern failed. Looking for new start point...\n");
1971 });
07be1b83 1972 } else {
786e8c11
YO
1973 DEBUG_TRIE_EXECUTE_r(
1974 PerlIO_printf( Perl_debug_log,"No match.\n"));
07be1b83
YO
1975 break;
1976 }
1977 }
be8e71aa
YO
1978 FREETMPS;
1979 LEAVE;
07be1b83
YO
1980 }
1981 break;
b3c9acc1 1982 default:
3c3eec57
GS
1983 Perl_croak(aTHX_ "panic: unknown regstclass %d", (int)OP(c));
1984 break;
d6a28714 1985 }
6eb5f6b9
JH
1986 return 0;
1987 got_it:
1988 return s;
1989}
1990
fae667d5 1991
6eb5f6b9
JH
1992/*
1993 - regexec_flags - match a regexp against a string
1994 */
1995I32
288b8c02 1996Perl_regexec_flags(pTHX_ REGEXP * const rx, char *stringarg, register char *strend,
6eb5f6b9
JH
1997 char *strbeg, I32 minend, SV *sv, void *data, U32 flags)
1998/* strend: pointer to null at end of string */
1999/* strbeg: real beginning of string */
2000/* minend: end of match must be >=minend after stringarg. */
58e23c8d
YO
2001/* data: May be used for some additional optimizations.
2002 Currently its only used, with a U32 cast, for transmitting
2003 the ganch offset when doing a /g match. This will change */
6eb5f6b9
JH
2004/* nosave: For optimizations. */
2005{
97aff369 2006 dVAR;
288b8c02 2007 struct regexp *const prog = (struct regexp *)SvANY(rx);
24b23f37 2008 /*register*/ char *s;
6eb5f6b9 2009 register regnode *c;
24b23f37 2010 /*register*/ char *startpos = stringarg;
6eb5f6b9
JH
2011 I32 minlen; /* must match at least this many chars */
2012 I32 dontbother = 0; /* how many characters not to try at end */
6eb5f6b9
JH
2013 I32 end_shift = 0; /* Same for the end. */ /* CC */
2014 I32 scream_pos = -1; /* Internal iterator of scream. */
ccac19ea 2015 char *scream_olds = NULL;
f2ed9b32 2016 const bool utf8_target = cBOOL(DO_UTF8(sv));
2757e526 2017 I32 multiline;
f8fc2ecf 2018 RXi_GET_DECL(prog,progi);
3b0527fe 2019 regmatch_info reginfo; /* create some info to pass to regtry etc */
e9105d30 2020 regexp_paren_pair *swap = NULL;
a3621e74
YO
2021 GET_RE_DEBUG_FLAGS_DECL;
2022
7918f24d 2023 PERL_ARGS_ASSERT_REGEXEC_FLAGS;
9d4ba2ae 2024 PERL_UNUSED_ARG(data);
6eb5f6b9
JH
2025
2026 /* Be paranoid... */
2027 if (prog == NULL || startpos == NULL) {
2028 Perl_croak(aTHX_ "NULL regexp parameter");
2029 return 0;
2030 }
2031
bbe252da 2032 multiline = prog->extflags & RXf_PMf_MULTILINE;
288b8c02 2033 reginfo.prog = rx; /* Yes, sorry that this is confusing. */
2757e526 2034
f2ed9b32 2035 RX_MATCH_UTF8_set(rx, utf8_target);
1de06328 2036 DEBUG_EXECUTE_r(
f2ed9b32 2037 debug_start_match(rx, utf8_target, startpos, strend,
1de06328
YO
2038 "Matching");
2039 );
bac06658 2040
6eb5f6b9 2041 minlen = prog->minlen;
1de06328
YO
2042
2043 if (strend - startpos < (minlen+(prog->check_offset_min<0?prog->check_offset_min:0))) {
a3621e74 2044 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
a72c7584
JH
2045 "String too short [regexec_flags]...\n"));
2046 goto phooey;
1aa99e6b 2047 }
6eb5f6b9 2048
1de06328 2049
6eb5f6b9 2050 /* Check validity of program. */
f8fc2ecf 2051 if (UCHARAT(progi->program) != REG_MAGIC) {
6eb5f6b9
JH
2052 Perl_croak(aTHX_ "corrupted regexp program");
2053 }
2054
2055 PL_reg_flags = 0;
2056 PL_reg_eval_set = 0;
2057 PL_reg_maxiter = 0;
2058
3c8556c3 2059 if (RX_UTF8(rx))
6eb5f6b9
JH
2060 PL_reg_flags |= RF_utf8;
2061
2062 /* Mark beginning of line for ^ and lookbehind. */
3b0527fe 2063 reginfo.bol = startpos; /* XXX not used ??? */
6eb5f6b9 2064 PL_bostr = strbeg;
3b0527fe 2065 reginfo.sv = sv;
6eb5f6b9
JH
2066
2067 /* Mark end of line for $ (and such) */
2068 PL_regeol = strend;
2069
2070 /* see how far we have to get to not match where we matched before */
3b0527fe 2071 reginfo.till = startpos+minend;
6eb5f6b9 2072
6eb5f6b9
JH
2073 /* If there is a "must appear" string, look for it. */
2074 s = startpos;
2075
bbe252da 2076 if (prog->extflags & RXf_GPOS_SEEN) { /* Need to set reginfo->ganch */
6eb5f6b9 2077 MAGIC *mg;
2c296965 2078 if (flags & REXEC_IGNOREPOS){ /* Means: check only at start */
58e23c8d 2079 reginfo.ganch = startpos + prog->gofs;
2c296965 2080 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
ed549f2e 2081 "GPOS IGNOREPOS: reginfo.ganch = startpos + %"UVxf"\n",(UV)prog->gofs));
2c296965 2082 } else if (sv && SvTYPE(sv) >= SVt_PVMG
6eb5f6b9 2083 && SvMAGIC(sv)
14befaf4
DM
2084 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
2085 && mg->mg_len >= 0) {
3b0527fe 2086 reginfo.ganch = strbeg + mg->mg_len; /* Defined pos() */
2c296965 2087 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
ed549f2e 2088 "GPOS MAGIC: reginfo.ganch = strbeg + %"IVdf"\n",(IV)mg->mg_len));
2c296965 2089
bbe252da 2090 if (prog->extflags & RXf_ANCH_GPOS) {
3b0527fe 2091 if (s > reginfo.ganch)
6eb5f6b9 2092 goto phooey;
58e23c8d 2093 s = reginfo.ganch - prog->gofs;
2c296965 2094 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
ed549f2e 2095 "GPOS ANCH_GPOS: s = ganch - %"UVxf"\n",(UV)prog->gofs));
c584a96e
YO
2096 if (s < strbeg)
2097 goto phooey;
6eb5f6b9
JH
2098 }
2099 }
58e23c8d 2100 else if (data) {
70685ca0 2101 reginfo.ganch = strbeg + PTR2UV(data);
2c296965
YO
2102 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2103 "GPOS DATA: reginfo.ganch= strbeg + %"UVxf"\n",PTR2UV(data)));
2104
2105 } else { /* pos() not defined */
3b0527fe 2106 reginfo.ganch = strbeg;
2c296965
YO
2107 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2108 "GPOS: reginfo.ganch = strbeg\n"));
2109 }
6eb5f6b9 2110 }
288b8c02 2111 if (PL_curpm && (PM_GETRE(PL_curpm) == rx)) {
e9105d30
GG
2112 /* We have to be careful. If the previous successful match
2113 was from this regex we don't want a subsequent partially
2114 successful match to clobber the old results.
2115 So when we detect this possibility we add a swap buffer
2116 to the re, and switch the buffer each match. If we fail
2117 we switch it back, otherwise we leave it swapped.
2118 */
2119 swap = prog->offs;
2120 /* do we need a save destructor here for eval dies? */
2121 Newxz(prog->offs, (prog->nparens + 1), regexp_paren_pair);
c74340f9 2122 }
a0714e2c 2123 if (!(flags & REXEC_CHECKED) && (prog->check_substr != NULL || prog->check_utf8 != NULL)) {
6eb5f6b9
JH
2124 re_scream_pos_data d;
2125
2126 d.scream_olds = &scream_olds;
2127 d.scream_pos = &scream_pos;
288b8c02 2128 s = re_intuit_start(rx, sv, s, strend, flags, &d);
3fa9c3d7 2129 if (!s) {
a3621e74 2130 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not present...\n"));
6eb5f6b9 2131 goto phooey; /* not present */
3fa9c3d7 2132 }
6eb5f6b9
JH
2133 }
2134
1de06328 2135
6eb5f6b9
JH
2136
2137 /* Simplest case: anchored match need be tried only once. */
2138 /* [unless only anchor is BOL and multiline is set] */
bbe252da 2139 if (prog->extflags & (RXf_ANCH & ~RXf_ANCH_GPOS)) {
24b23f37 2140 if (s == startpos && regtry(&reginfo, &startpos))
6eb5f6b9 2141 goto got_it;
bbe252da
YO
2142 else if (multiline || (prog->intflags & PREGf_IMPLICIT)
2143 || (prog->extflags & RXf_ANCH_MBOL)) /* XXXX SBOL? */
6eb5f6b9
JH
2144 {
2145 char *end;
2146
2147 if (minlen)
2148 dontbother = minlen - 1;
1aa99e6b 2149 end = HOP3c(strend, -dontbother, strbeg) - 1;
6eb5f6b9 2150 /* for multiline we only have to try after newlines */
33b8afdf 2151 if (prog->check_substr || prog->check_utf8) {
92f3d482
YO
2152 /* because of the goto we can not easily reuse the macros for bifurcating the
2153 unicode/non-unicode match modes here like we do elsewhere - demerphq */
2154 if (utf8_target) {
2155 if (s == startpos)
2156 goto after_try_utf8;
2157 while (1) {
2158 if (regtry(&reginfo, &s)) {
2159 goto got_it;
2160 }
2161 after_try_utf8:
2162 if (s > end) {
2163 goto phooey;
2164 }
2165 if (prog->extflags & RXf_USE_INTUIT) {
2166 s = re_intuit_start(rx, sv, s + UTF8SKIP(s), strend, flags, NULL);
2167 if (!s) {
2168 goto phooey;
2169 }
2170 }
2171 else {
2172 s += UTF8SKIP(s);
2173 }
2174 }
2175 } /* end search for check string in unicode */
2176 else {
2177 if (s == startpos) {
2178 goto after_try_latin;
2179 }
2180 while (1) {
2181 if (regtry(&reginfo, &s)) {
2182 goto got_it;
2183 }
2184 after_try_latin:
2185 if (s > end) {
2186 goto phooey;
2187 }
2188 if (prog->extflags & RXf_USE_INTUIT) {
2189 s = re_intuit_start(rx, sv, s + 1, strend, flags, NULL);
2190 if (!s) {
2191 goto phooey;
2192 }
2193 }
2194 else {
2195 s++;
2196 }
2197 }
2198 } /* end search for check string in latin*/
2199 } /* end search for check string */
2200 else { /* search for newline */
2201 if (s > startpos) {
2202 /*XXX: The s-- is almost definitely wrong here under unicode - demeprhq*/
6eb5f6b9 2203 s--;
92f3d482
YO
2204 }
2205 /* We can use a more efficient search as newlines are the same in unicode as they are in latin */
6eb5f6b9
JH
2206 while (s < end) {
2207 if (*s++ == '\n') { /* don't need PL_utf8skip here */
24b23f37 2208 if (regtry(&reginfo, &s))
6eb5f6b9
JH
2209 goto got_it;
2210 }
92f3d482
YO
2211 }
2212 } /* end search for newline */
2213 } /* end anchored/multiline check string search */
6eb5f6b9 2214 goto phooey;
bbe252da 2215 } else if (RXf_GPOS_CHECK == (prog->extflags & RXf_GPOS_CHECK))
f9f4320a 2216 {
486ec47a 2217 /* the warning about reginfo.ganch being used without initialization
bbe252da 2218 is bogus -- we set it above, when prog->extflags & RXf_GPOS_SEEN
f9f4320a 2219 and we only enter this block when the same bit is set. */
58e23c8d 2220 char *tmp_s = reginfo.ganch - prog->gofs;
c584a96e
YO
2221
2222 if (tmp_s >= strbeg && regtry(&reginfo, &tmp_s))
6eb5f6b9
JH
2223 goto got_it;
2224 goto phooey;
2225 }
2226
2227 /* Messy cases: unanchored match. */
bbe252da 2228 if ((prog->anchored_substr || prog->anchored_utf8) && prog->intflags & PREGf_SKIP) {
6eb5f6b9 2229 /* we have /x+whatever/ */
f2ed9b32 2230 /* it must be a one character string (XXXX Except UTF_PATTERN?) */
33b8afdf 2231 char ch;
bf93d4cc
GS
2232#ifdef DEBUGGING
2233 int did_match = 0;
2234#endif
f2ed9b32
KW
2235 if (!(utf8_target ? prog->anchored_utf8 : prog->anchored_substr))
2236 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2237 ch = SvPVX_const(utf8_target ? prog->anchored_utf8 : prog->anchored_substr)[0];
bf93d4cc 2238
f2ed9b32 2239 if (utf8_target) {
4cadc6a9 2240 REXEC_FBC_SCAN(
6eb5f6b9 2241 if (*s == ch) {
a3621e74 2242 DEBUG_EXECUTE_r( did_match = 1 );
24b23f37 2243 if (regtry(&reginfo, &s)) goto got_it;
6eb5f6b9
JH
2244 s += UTF8SKIP(s);
2245 while (s < strend && *s == ch)
2246 s += UTF8SKIP(s);
2247 }
4cadc6a9 2248 );
6eb5f6b9
JH
2249 }
2250 else {
4cadc6a9 2251 REXEC_FBC_SCAN(
6eb5f6b9 2252 if (*s == ch) {
a3621e74 2253 DEBUG_EXECUTE_r( did_match = 1 );
24b23f37 2254 if (regtry(&reginfo, &s)) goto got_it;
6eb5f6b9
JH
2255 s++;
2256 while (s < strend && *s == ch)
2257 s++;
2258 }
4cadc6a9 2259 );
6eb5f6b9 2260 }
a3621e74 2261 DEBUG_EXECUTE_r(if (!did_match)
bf93d4cc 2262 PerlIO_printf(Perl_debug_log,
b7953727
JH
2263 "Did not find anchored character...\n")
2264 );
6eb5f6b9 2265 }
a0714e2c
SS
2266 else if (prog->anchored_substr != NULL
2267 || prog->anchored_utf8 != NULL
2268 || ((prog->float_substr != NULL || prog->float_utf8 != NULL)
33b8afdf
JH
2269 && prog->float_max_offset < strend - s)) {
2270 SV *must;
2271 I32 back_max;
2272 I32 back_min;
2273 char *last;
6eb5f6b9 2274 char *last1; /* Last position checked before */
bf93d4cc
GS
2275#ifdef DEBUGGING
2276 int did_match = 0;
2277#endif
33b8afdf 2278 if (prog->anchored_substr || prog->anchored_utf8) {
f2ed9b32
KW
2279 if (!(utf8_target ? prog->anchored_utf8 : prog->anchored_substr))
2280 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2281 must = utf8_target ? prog->anchored_utf8 : prog->anchored_substr;
33b8afdf
JH
2282 back_max = back_min = prog->anchored_offset;
2283 } else {
f2ed9b32
KW
2284 if (!(utf8_target ? prog->float_utf8 : prog->float_substr))
2285 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2286 must = utf8_target ? prog->float_utf8 : prog->float_substr;
33b8afdf
JH
2287 back_max = prog->float_max_offset;
2288 back_min = prog->float_min_offset;
2289 }
1de06328
YO
2290
2291
33b8afdf
JH
2292 if (must == &PL_sv_undef)
2293 /* could not downgrade utf8 check substring, so must fail */
2294 goto phooey;
2295
1de06328
YO
2296 if (back_min<0) {
2297 last = strend;
2298 } else {
2299 last = HOP3c(strend, /* Cannot start after this */
2300 -(I32)(CHR_SVLEN(must)
2301 - (SvTAIL(must) != 0) + back_min), strbeg);
2302 }
6eb5f6b9
JH
2303 if (s > PL_bostr)
2304 last1 = HOPc(s, -1);
2305 else
2306 last1 = s - 1; /* bogus */
2307
a0288114 2308 /* XXXX check_substr already used to find "s", can optimize if
6eb5f6b9
JH
2309 check_substr==must. */
2310 scream_pos = -1;
2311 dontbother = end_shift;
2312 strend = HOPc(strend, -dontbother);
2313 while ( (s <= last) &&
f1905e1b 2314 ((flags & REXEC_SCREAM) && SvSCREAM(sv)
1de06328 2315 ? (s = screaminstr(sv, must, HOP3c(s, back_min, (back_min<0 ? strbeg : strend)) - strbeg,
6eb5f6b9 2316 end_shift, &scream_pos, 0))
1de06328 2317 : (s = fbm_instr((unsigned char*)HOP3(s, back_min, (back_min<0 ? strbeg : strend)),
9041c2e3 2318 (unsigned char*)strend, must,
7fba1cd6 2319 multiline ? FBMrf_MULTILINE : 0))) ) {
4addbd3b 2320 /* we may be pointing at the wrong string */
07bc277f 2321 if ((flags & REXEC_SCREAM) && RXp_MATCH_COPIED(prog))
3f7c398e 2322 s = strbeg + (s - SvPVX_const(sv));
a3621e74 2323 DEBUG_EXECUTE_r( did_match = 1 );
6eb5f6b9
JH
2324 if (HOPc(s, -back_max) > last1) {
2325 last1 = HOPc(s, -back_min);
2326 s = HOPc(s, -back_max);
2327 }
2328 else {
52657f30 2329 char * const t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1;
6eb5f6b9
JH
2330
2331 last1 = HOPc(s, -back_min);
52657f30 2332 s = t;
6eb5f6b9 2333 }
f2ed9b32 2334 if (utf8_target) {
6eb5f6b9 2335 while (s <= last1) {
24b23f37 2336 if (regtry(&reginfo, &s))
6eb5f6b9
JH
2337 goto got_it;
2338 s += UTF8SKIP(s);
2339 }
2340 }
2341 else {
2342 while (s <= last1) {
24b23f37 2343 if (regtry(&reginfo, &s))
6eb5f6b9
JH
2344 goto got_it;
2345 s++;
2346 }
2347 }
2348 }
ab3bbdeb 2349 DEBUG_EXECUTE_r(if (!did_match) {
f2ed9b32 2350 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
ab3bbdeb
YO
2351 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
2352 PerlIO_printf(Perl_debug_log, "Did not find %s substr %s%s...\n",
33b8afdf 2353 ((must == prog->anchored_substr || must == prog->anchored_utf8)
bf93d4cc 2354 ? "anchored" : "floating"),
ab3bbdeb
YO
2355 quoted, RE_SV_TAIL(must));
2356 });
6eb5f6b9
JH
2357 goto phooey;
2358 }
f8fc2ecf 2359 else if ( (c = progi->regstclass) ) {
f14c76ed 2360 if (minlen) {
f8fc2ecf 2361 const OPCODE op = OP(progi->regstclass);
66e933ab 2362 /* don't bother with what can't match */
786e8c11 2363 if (PL_regkind[op] != EXACT && op != CANY && PL_regkind[op] != TRIE)
f14c76ed
RGS
2364 strend = HOPc(strend, -(minlen - 1));
2365 }
a3621e74 2366 DEBUG_EXECUTE_r({
be8e71aa 2367 SV * const prop = sv_newmortal();
32fc9b6a 2368 regprop(prog, prop, c);
0df25f3d 2369 {
f2ed9b32 2370 RE_PV_QUOTED_DECL(quoted,utf8_target,PERL_DEBUG_PAD_ZERO(1),
ab3bbdeb 2371 s,strend-s,60);
0df25f3d 2372 PerlIO_printf(Perl_debug_log,
1c8f8eb1 2373 "Matching stclass %.*s against %s (%d bytes)\n",
e4f74956 2374 (int)SvCUR(prop), SvPVX_const(prop),
ab3bbdeb 2375 quoted, (int)(strend - s));
0df25f3d 2376 }
ffc61ed2 2377 });
3b0527fe 2378 if (find_byclass(prog, c, s, strend, &reginfo))
6eb5f6b9 2379 goto got_it;
07be1b83 2380 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass... [regexec_flags]\n"));
d6a28714
JH
2381 }
2382 else {
2383 dontbother = 0;
a0714e2c 2384 if (prog->float_substr != NULL || prog->float_utf8 != NULL) {
33b8afdf 2385 /* Trim the end. */
d6a28714 2386 char *last;
33b8afdf
JH
2387 SV* float_real;
2388
f2ed9b32
KW
2389 if (!(utf8_target ? prog->float_utf8 : prog->float_substr))
2390 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2391 float_real = utf8_target ? prog->float_utf8 : prog->float_substr;
d6a28714 2392
f1905e1b 2393 if ((flags & REXEC_SCREAM) && SvSCREAM(sv)) {
33b8afdf 2394 last = screaminstr(sv, float_real, s - strbeg,
d6a28714
JH
2395 end_shift, &scream_pos, 1); /* last one */
2396 if (!last)
ffc61ed2 2397 last = scream_olds; /* Only one occurrence. */
4addbd3b 2398 /* we may be pointing at the wrong string */
07bc277f 2399 else if (RXp_MATCH_COPIED(prog))
3f7c398e 2400 s = strbeg + (s - SvPVX_const(sv));
b8c5462f 2401 }
d6a28714
JH
2402 else {
2403 STRLEN len;
cfd0369c 2404 const char * const little = SvPV_const(float_real, len);
d6a28714 2405
33b8afdf 2406 if (SvTAIL(float_real)) {
d6a28714
JH
2407 if (memEQ(strend - len + 1, little, len - 1))
2408 last = strend - len + 1;
7fba1cd6 2409 else if (!multiline)
9041c2e3 2410 last = memEQ(strend - len, little, len)
bd61b366 2411 ? strend - len : NULL;
b8c5462f 2412 else
d6a28714
JH
2413 goto find_last;
2414 } else {
2415 find_last:
9041c2e3 2416 if (len)
d6a28714 2417 last = rninstr(s, strend, little, little + len);
b8c5462f 2418 else
a0288114 2419 last = strend; /* matching "$" */
b8c5462f 2420 }
b8c5462f 2421 }
bf93d4cc 2422 if (last == NULL) {
6bda09f9
YO
2423 DEBUG_EXECUTE_r(
2424 PerlIO_printf(Perl_debug_log,
2425 "%sCan't trim the tail, match fails (should not happen)%s\n",
2426 PL_colors[4], PL_colors[5]));
bf93d4cc
GS
2427 goto phooey; /* Should not happen! */
2428 }
d6a28714
JH
2429 dontbother = strend - last + prog->float_min_offset;
2430 }
2431 if (minlen && (dontbother < minlen))
2432 dontbother = minlen - 1;
2433 strend -= dontbother; /* this one's always in bytes! */
2434 /* We don't know much -- general case. */
f2ed9b32 2435 if (utf8_target) {
d6a28714 2436 for (;;) {
24b23f37 2437 if (regtry(&reginfo, &s))
d6a28714
JH
2438 goto got_it;
2439 if (s >= strend)
2440 break;
b8c5462f 2441 s += UTF8SKIP(s);
d6a28714
JH
2442 };
2443 }
2444 else {
2445 do {
24b23f37 2446 if (regtry(&reginfo, &s))
d6a28714
JH
2447 goto got_it;
2448 } while (s++ < strend);
2449 }
2450 }
2451
2452 /* Failure. */
2453 goto phooey;
2454
2455got_it:
e9105d30 2456 Safefree(swap);
288b8c02 2457 RX_MATCH_TAINTED_set(rx, PL_reg_flags & RF_tainted);
d6a28714 2458
19b95bf0 2459 if (PL_reg_eval_set)
4f639d21 2460 restore_pos(aTHX_ prog);
5daac39c
NC
2461 if (RXp_PAREN_NAMES(prog))
2462 (void)hv_iterinit(RXp_PAREN_NAMES(prog));
d6a28714
JH
2463
2464 /* make sure $`, $&, $', and $digit will work later */
2465 if ( !(flags & REXEC_NOT_FIRST) ) {
288b8c02 2466 RX_MATCH_COPY_FREE(rx);
d6a28714 2467 if (flags & REXEC_COPY_STR) {
be8e71aa 2468 const I32 i = PL_regeol - startpos + (stringarg - strbeg);
f8c7b90f 2469#ifdef PERL_OLD_COPY_ON_WRITE
ed252734
NC
2470 if ((SvIsCOW(sv)
2471 || (SvFLAGS(sv) & CAN_COW_MASK) == CAN_COW_FLAGS)) {
2472 if (DEBUG_C_TEST) {
2473 PerlIO_printf(Perl_debug_log,
2474 "Copy on write: regexp capture, type %d\n",
2475 (int) SvTYPE(sv));
2476 }
2477 prog->saved_copy = sv_setsv_cow(prog->saved_copy, sv);
d5263905 2478 prog->subbeg = (char *)SvPVX_const(prog->saved_copy);
ed252734
NC
2479 assert (SvPOKp(prog->saved_copy));
2480 } else
2481#endif
2482 {
288b8c02 2483 RX_MATCH_COPIED_on(rx);
ed252734
NC
2484 s = savepvn(strbeg, i);
2485 prog->subbeg = s;
2486 }
d6a28714 2487 prog->sublen = i;
d6a28714
JH
2488 }
2489 else {
2490 prog->subbeg = strbeg;
2491 prog->sublen = PL_regeol - strbeg; /* strend may have been modified */
2492 }
2493 }
9041c2e3 2494
d6a28714
JH
2495 return 1;
2496
2497phooey:
a3621e74 2498 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n",
e4584336 2499 PL_colors[4], PL_colors[5]));
d6a28714 2500 if (PL_reg_eval_set)
4f639d21 2501 restore_pos(aTHX_ prog);
e9105d30 2502 if (swap) {
c74340f9 2503 /* we failed :-( roll it back */
e9105d30
GG
2504 Safefree(prog->offs);
2505 prog->offs = swap;
2506 }
2507
d6a28714
JH
2508 return 0;
2509}
2510
6bda09f9 2511
d6a28714
JH
2512/*
2513 - regtry - try match at specific point
2514 */
2515STATIC I32 /* 0 failure, 1 success */
24b23f37 2516S_regtry(pTHX_ regmatch_info *reginfo, char **startpos)
d6a28714 2517{
97aff369 2518 dVAR;
d6a28714 2519 CHECKPOINT lastcp;
288b8c02
NC
2520 REGEXP *const rx = reginfo->prog;
2521 regexp *const prog = (struct regexp *)SvANY(rx);
f8fc2ecf 2522 RXi_GET_DECL(prog,progi);
a3621e74 2523 GET_RE_DEBUG_FLAGS_DECL;
7918f24d
NC
2524
2525 PERL_ARGS_ASSERT_REGTRY;
2526
24b23f37 2527 reginfo->cutpoint=NULL;
d6a28714 2528
bbe252da 2529 if ((prog->extflags & RXf_EVAL_SEEN) && !PL_reg_eval_set) {
d6a28714
JH
2530 MAGIC *mg;
2531
2532 PL_reg_eval_set = RS_init;
a3621e74 2533 DEBUG_EXECUTE_r(DEBUG_s(
b900a521
JH
2534 PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n",
2535 (IV)(PL_stack_sp - PL_stack_base));
d6a28714 2536 ));
ea8d6ae1 2537 SAVESTACK_CXPOS();
d6a28714
JH
2538 cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base;
2539 /* Otherwise OP_NEXTSTATE will free whatever on stack now. */
2540 SAVETMPS;
2541 /* Apparently this is not needed, judging by wantarray. */
e8347627 2542 /* SAVEI8(cxstack[cxstack_ix].blk_gimme);
d6a28714
JH
2543 cxstack[cxstack_ix].blk_gimme = G_SCALAR; */
2544
3b0527fe 2545 if (reginfo->sv) {
d6a28714 2546 /* Make $_ available to executed code. */
3b0527fe 2547 if (reginfo->sv != DEFSV) {
59f00321 2548 SAVE_DEFSV;
414bf5ae 2549 DEFSV_set(reginfo->sv);
b8c5462f 2550 }
d6a28714 2551
3b0527fe
DM
2552 if (!(SvTYPE(reginfo->sv) >= SVt_PVMG && SvMAGIC(reginfo->sv)
2553 && (mg = mg_find(reginfo->sv, PERL_MAGIC_regex_global)))) {
d6a28714 2554 /* prepare for quick setting of pos */
d300d9fa 2555#ifdef PERL_OLD_COPY_ON_WRITE
51a9ea20
NC
2556 if (SvIsCOW(reginfo->sv))
2557 sv_force_normal_flags(reginfo->sv, 0);
d300d9fa 2558#endif
3dab1dad 2559 mg = sv_magicext(reginfo->sv, NULL, PERL_MAGIC_regex_global,
d300d9fa 2560 &PL_vtbl_mglob, NULL, 0);
d6a28714 2561 mg->mg_len = -1;
b8c5462f 2562 }
d6a28714
JH
2563 PL_reg_magic = mg;
2564 PL_reg_oldpos = mg->mg_len;
4f639d21 2565 SAVEDESTRUCTOR_X(restore_pos, prog);
d6a28714 2566 }
09687e5a 2567 if (!PL_reg_curpm) {
a02a5408 2568 Newxz(PL_reg_curpm, 1, PMOP);
09687e5a
AB
2569#ifdef USE_ITHREADS
2570 {
14a49a24 2571 SV* const repointer = &PL_sv_undef;
92313705
NC
2572 /* this regexp is also owned by the new PL_reg_curpm, which
2573 will try to free it. */
d2ece331 2574 av_push(PL_regex_padav, repointer);
09687e5a
AB
2575 PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav);
2576 PL_regex_pad = AvARRAY(PL_regex_padav);
2577 }
2578#endif
2579 }
86c29d75
NC
2580#ifdef USE_ITHREADS
2581 /* It seems that non-ithreads works both with and without this code.
2582 So for efficiency reasons it seems best not to have the code
2583 compiled when it is not needed. */
92313705
NC
2584 /* This is safe against NULLs: */
2585 ReREFCNT_dec(PM_GETRE(PL_reg_curpm));
2586 /* PM_reg_curpm owns a reference to this regexp. */
cd733337 2587 (void)ReREFCNT_inc(rx);
86c29d75 2588#endif
288b8c02 2589 PM_SETRE(PL_reg_curpm, rx);
d6a28714
JH
2590 PL_reg_oldcurpm = PL_curpm;
2591 PL_curpm = PL_reg_curpm;
07bc277f 2592 if (RXp_MATCH_COPIED(prog)) {
d6a28714
JH
2593 /* Here is a serious problem: we cannot rewrite subbeg,
2594 since it may be needed if this match fails. Thus
2595 $` inside (?{}) could fail... */
2596 PL_reg_oldsaved = prog->subbeg;
2597 PL_reg_oldsavedlen = prog->sublen;
f8c7b90f 2598#ifdef PERL_OLD_COPY_ON_WRITE
ed252734
NC
2599 PL_nrs = prog->saved_copy;
2600#endif
07bc277f 2601 RXp_MATCH_COPIED_off(prog);
d6a28714
JH
2602 }
2603 else
bd61b366 2604 PL_reg_oldsaved = NULL;
d6a28714
JH
2605 prog->subbeg = PL_bostr;
2606 prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */
2607 }
24b23f37 2608 DEBUG_EXECUTE_r(PL_reg_starttry = *startpos);
f0ab9afb 2609 prog->offs[0].start = *startpos - PL_bostr;
24b23f37 2610 PL_reginput = *startpos;
d6a28714 2611 PL_reglastparen = &prog->lastparen;
a01268b5 2612 PL_reglastcloseparen = &prog->lastcloseparen;
d6a28714 2613 prog->lastparen = 0;
03994de8 2614 prog->lastcloseparen = 0;
d6a28714 2615 PL_regsize = 0;
f0ab9afb 2616 PL_regoffs = prog->offs;
d6a28714
JH
2617 if (PL_reg_start_tmpl <= prog->nparens) {
2618 PL_reg_start_tmpl = prog->nparens*3/2 + 3;
2619 if(PL_reg_start_tmp)
2620 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2621 else
a02a5408 2622 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
d6a28714
JH
2623 }
2624
2625 /* XXXX What this code is doing here?!!! There should be no need
2626 to do this again and again, PL_reglastparen should take care of
3dd2943c 2627 this! --ilya*/
dafc8851
JH
2628
2629 /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code.
2630 * Actually, the code in regcppop() (which Ilya may be meaning by
daf18116 2631 * PL_reglastparen), is not needed at all by the test suite
225593e1
DM
2632 * (op/regexp, op/pat, op/split), but that code is needed otherwise
2633 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
2634 * Meanwhile, this code *is* needed for the
daf18116
JH
2635 * above-mentioned test suite tests to succeed. The common theme
2636 * on those tests seems to be returning null fields from matches.
225593e1 2637 * --jhi updated by dapm */
dafc8851 2638#if 1
d6a28714 2639 if (prog->nparens) {
f0ab9afb 2640 regexp_paren_pair *pp = PL_regoffs;
097eb12c 2641 register I32 i;
eb160463 2642 for (i = prog->nparens; i > (I32)*PL_reglastparen; i--) {
f0ab9afb
NC
2643 ++pp;
2644 pp->start = -1;
2645 pp->end = -1;
d6a28714
JH
2646 }
2647 }
dafc8851 2648#endif
02db2b7b 2649 REGCP_SET(lastcp);
f8fc2ecf 2650 if (regmatch(reginfo, progi->program + 1)) {
f0ab9afb 2651 PL_regoffs[0].end = PL_reginput - PL_bostr;
d6a28714
JH
2652 return 1;
2653 }
24b23f37
YO
2654 if (reginfo->cutpoint)
2655 *startpos= reginfo->cutpoint;
02db2b7b 2656 REGCP_UNWIND(lastcp);
d6a28714
JH
2657 return 0;
2658}
2659
02db2b7b 2660
8ba1375e
MJD
2661#define sayYES goto yes
2662#define sayNO goto no
262b90c4 2663#define sayNO_SILENT goto no_silent
8ba1375e 2664
f9f4320a
YO
2665/* we dont use STMT_START/END here because it leads to
2666 "unreachable code" warnings, which are bogus, but distracting. */
2667#define CACHEsayNO \
c476f425
DM
2668 if (ST.cache_mask) \
2669 PL_reg_poscache[ST.cache_offset] |= ST.cache_mask; \
f9f4320a 2670 sayNO
3298f257 2671
a3621e74 2672/* this is used to determine how far from the left messages like
265c4333
YO
2673 'failed...' are printed. It should be set such that messages
2674 are inline with the regop output that created them.
a3621e74 2675*/
265c4333 2676#define REPORT_CODE_OFF 32
a3621e74
YO
2677
2678
40a82448
DM
2679#define CHRTEST_UNINIT -1001 /* c1/c2 haven't been calculated yet */
2680#define CHRTEST_VOID -1000 /* the c1/c2 "next char" test should be skipped */
9e137952 2681
86545054
DM
2682#define SLAB_FIRST(s) (&(s)->states[0])
2683#define SLAB_LAST(s) (&(s)->states[PERL_REGMATCH_SLAB_SLOTS-1])
2684
5d9a96ca
DM
2685/* grab a new slab and return the first slot in it */
2686
2687STATIC regmatch_state *
2688S_push_slab(pTHX)
2689{
a35a87e7 2690#if PERL_VERSION < 9 && !defined(PERL_CORE)
54df2634
NC
2691 dMY_CXT;
2692#endif
5d9a96ca
DM
2693 regmatch_slab *s = PL_regmatch_slab->next;
2694 if (!s) {
2695 Newx(s, 1, regmatch_slab);
2696 s->prev = PL_regmatch_slab;
2697 s->next = NULL;
2698 PL_regmatch_slab->next = s;
2699 }
2700 PL_regmatch_slab = s;
86545054 2701 return SLAB_FIRST(s);
5d9a96ca 2702}
5b47454d 2703
95b24440 2704
40a82448
DM
2705/* push a new state then goto it */
2706
2707#define PUSH_STATE_GOTO(state, node) \
2708 scan = node; \
2709 st->resume_state = state; \
2710 goto push_state;
2711
2712/* push a new state with success backtracking, then goto it */
2713
2714#define PUSH_YES_STATE_GOTO(state, node) \
2715 scan = node; \
2716 st->resume_state = state; \
2717 goto push_yes_state;
2718
aa283a38 2719
aa283a38 2720
d6a28714 2721/*
95b24440 2722
bf1f174e
DM
2723regmatch() - main matching routine
2724
2725This is basically one big switch statement in a loop. We execute an op,
2726set 'next' to point the next op, and continue. If we come to a point which
2727we may need to backtrack to on failure such as (A|B|C), we push a
2728backtrack state onto the backtrack stack. On failure, we pop the top
2729state, and re-enter the loop at the state indicated. If there are no more
2730states to pop, we return failure.
2731
2732Sometimes we also need to backtrack on success; for example /A+/, where
2733after successfully matching one A, we need to go back and try to
2734match another one; similarly for lookahead assertions: if the assertion
2735completes successfully, we backtrack to the state just before the assertion
2736and then carry on. In these cases, the pushed state is marked as
2737'backtrack on success too'. This marking is in fact done by a chain of
2738pointers, each pointing to the previous 'yes' state. On success, we pop to
2739the nearest yes state, discarding any intermediate failure-only states.
2740Sometimes a yes state is pushed just to force some cleanup code to be
2741called at the end of a successful match or submatch; e.g. (??{$re}) uses
2742it to free the inner regex.
2743
2744Note that failure backtracking rewinds the cursor position, while
2745success backtracking leaves it alone.
2746
2747A pattern is complete when the END op is executed, while a subpattern
2748such as (?=foo) is complete when the SUCCESS op is executed. Both of these
2749ops trigger the "pop to last yes state if any, otherwise return true"
2750behaviour.
2751
2752A common convention in this function is to use A and B to refer to the two
2753subpatterns (or to the first nodes thereof) in patterns like /A*B/: so A is
2754the subpattern to be matched possibly multiple times, while B is the entire
2755rest of the pattern. Variable and state names reflect this convention.
2756
2757The states in the main switch are the union of ops and failure/success of
2758substates associated with with that op. For example, IFMATCH is the op
2759that does lookahead assertions /(?=A)B/ and so the IFMATCH state means
2760'execute IFMATCH'; while IFMATCH_A is a state saying that we have just
2761successfully matched A and IFMATCH_A_fail is a state saying that we have
2762just failed to match A. Resume states always come in pairs. The backtrack
2763state we push is marked as 'IFMATCH_A', but when that is popped, we resume
2764at IFMATCH_A or IFMATCH_A_fail, depending on whether we are backtracking
2765on success or failure.
2766
2767The struct that holds a backtracking state is actually a big union, with
2768one variant for each major type of op. The variable st points to the
2769top-most backtrack struct. To make the code clearer, within each
2770block of code we #define ST to alias the relevant union.
2771
2772Here's a concrete example of a (vastly oversimplified) IFMATCH
2773implementation:
2774
2775 switch (state) {
2776 ....
2777
2778#define ST st->u.ifmatch
2779
2780 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2781 ST.foo = ...; // some state we wish to save
95b24440 2782 ...
bf1f174e
DM
2783 // push a yes backtrack state with a resume value of
2784 // IFMATCH_A/IFMATCH_A_fail, then continue execution at the
2785 // first node of A:
2786 PUSH_YES_STATE_GOTO(IFMATCH_A, A);
2787 // NOTREACHED
2788
2789 case IFMATCH_A: // we have successfully executed A; now continue with B
2790 next = B;
2791 bar = ST.foo; // do something with the preserved value
2792 break;
2793
2794 case IFMATCH_A_fail: // A failed, so the assertion failed
2795 ...; // do some housekeeping, then ...
2796 sayNO; // propagate the failure
2797
2798#undef ST
95b24440 2799
bf1f174e
DM
2800 ...
2801 }
95b24440 2802
bf1f174e
DM
2803For any old-timers reading this who are familiar with the old recursive
2804approach, the code above is equivalent to:
95b24440 2805
bf1f174e
DM
2806 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2807 {
2808 int foo = ...
95b24440 2809 ...
bf1f174e
DM
2810 if (regmatch(A)) {
2811 next = B;
2812 bar = foo;
2813 break;
95b24440 2814 }
bf1f174e
DM
2815 ...; // do some housekeeping, then ...
2816 sayNO; // propagate the failure
95b24440 2817 }
bf1f174e
DM
2818
2819The topmost backtrack state, pointed to by st, is usually free. If you
2820want to claim it, populate any ST.foo fields in it with values you wish to
2821save, then do one of
2822
2823 PUSH_STATE_GOTO(resume_state, node);
2824 PUSH_YES_STATE_GOTO(resume_state, node);
2825
2826which sets that backtrack state's resume value to 'resume_state', pushes a
2827new free entry to the top of the backtrack stack, then goes to 'node'.
2828On backtracking, the free slot is popped, and the saved state becomes the
2829new free state. An ST.foo field in this new top state can be temporarily
2830accessed to retrieve values, but once the main loop is re-entered, it
2831becomes available for reuse.
2832
2833Note that the depth of the backtrack stack constantly increases during the
2834left-to-right execution of the pattern, rather than going up and down with
2835the pattern nesting. For example the stack is at its maximum at Z at the
2836end of the pattern, rather than at X in the following:
2837
2838 /(((X)+)+)+....(Y)+....Z/
2839
2840The only exceptions to this are lookahead/behind assertions and the cut,
2841(?>A), which pop all the backtrack states associated with A before
2842continuing.
2843
486ec47a 2844Backtrack state structs are allocated in slabs of about 4K in size.
bf1f174e
DM
2845PL_regmatch_state and st always point to the currently active state,
2846and PL_regmatch_slab points to the slab currently containing
2847PL_regmatch_state. The first time regmatch() is called, the first slab is
2848allocated, and is never freed until interpreter destruction. When the slab
2849is full, a new one is allocated and chained to the end. At exit from
2850regmatch(), slabs allocated since entry are freed.
2851
2852*/
95b24440 2853
40a82448 2854
5bc10b2c 2855#define DEBUG_STATE_pp(pp) \
265c4333 2856 DEBUG_STATE_r({ \
f2ed9b32 2857 DUMP_EXEC_POS(locinput, scan, utf8_target); \
5bc10b2c 2858 PerlIO_printf(Perl_debug_log, \
5d458dd8 2859 " %*s"pp" %s%s%s%s%s\n", \
5bc10b2c 2860 depth*2, "", \
13d6edb4 2861 PL_reg_name[st->resume_state], \
5d458dd8
YO
2862 ((st==yes_state||st==mark_state) ? "[" : ""), \
2863 ((st==yes_state) ? "Y" : ""), \
2864 ((st==mark_state) ? "M" : ""), \
2865 ((st==yes_state||st==mark_state) ? "]" : "") \
2866 ); \
265c4333 2867 });
5bc10b2c 2868
40a82448 2869
3dab1dad 2870#define REG_NODE_NUM(x) ((x) ? (int)((x)-prog) : -1)
95b24440 2871
3df15adc 2872#ifdef DEBUGGING
5bc10b2c 2873
ab3bbdeb 2874STATIC void
f2ed9b32 2875S_debug_start_match(pTHX_ const REGEXP *prog, const bool utf8_target,
ab3bbdeb
YO
2876 const char *start, const char *end, const char *blurb)
2877{
efd26800 2878 const bool utf8_pat = RX_UTF8(prog) ? 1 : 0;
7918f24d
NC
2879
2880 PERL_ARGS_ASSERT_DEBUG_START_MATCH;
2881
ab3bbdeb
YO
2882 if (!PL_colorset)
2883 reginitcolors();
2884 {
2885 RE_PV_QUOTED_DECL(s0, utf8_pat, PERL_DEBUG_PAD_ZERO(0),
d2c6dc5e 2886 RX_PRECOMP_const(prog), RX_PRELEN(prog), 60);
ab3bbdeb 2887
f2ed9b32 2888 RE_PV_QUOTED_DECL(s1, utf8_target, PERL_DEBUG_PAD_ZERO(1),
ab3bbdeb
YO
2889 start, end - start, 60);
2890
2891 PerlIO_printf(Perl_debug_log,
2892 "%s%s REx%s %s against %s\n",
2893 PL_colors[4], blurb, PL_colors[5], s0, s1);
2894
f2ed9b32 2895 if (utf8_target||utf8_pat)
1de06328
YO
2896 PerlIO_printf(Perl_debug_log, "UTF-8 %s%s%s...\n",
2897 utf8_pat ? "pattern" : "",
f2ed9b32
KW
2898 utf8_pat && utf8_target ? " and " : "",
2899 utf8_target ? "string" : ""
ab3bbdeb
YO
2900 );
2901 }
2902}
3df15adc
YO
2903
2904STATIC void
786e8c11
YO
2905S_dump_exec_pos(pTHX_ const char *locinput,
2906 const regnode *scan,
2907 const char *loc_regeol,
2908 const char *loc_bostr,
2909 const char *loc_reg_starttry,
f2ed9b32 2910 const bool utf8_target)
07be1b83 2911{
786e8c11 2912 const int docolor = *PL_colors[0] || *PL_colors[2] || *PL_colors[4];
07be1b83 2913 const int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */
786e8c11 2914 int l = (loc_regeol - locinput) > taill ? taill : (loc_regeol - locinput);
07be1b83
YO
2915 /* The part of the string before starttry has one color
2916 (pref0_len chars), between starttry and current
2917 position another one (pref_len - pref0_len chars),
2918 after the current position the third one.
2919 We assume that pref0_len <= pref_len, otherwise we
2920 decrease pref0_len. */
786e8c11
YO
2921 int pref_len = (locinput - loc_bostr) > (5 + taill) - l
2922 ? (5 + taill) - l : locinput - loc_bostr;
07be1b83
YO
2923 int pref0_len;
2924
7918f24d
NC
2925 PERL_ARGS_ASSERT_DUMP_EXEC_POS;
2926
f2ed9b32 2927 while (utf8_target && UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len)))
07be1b83 2928 pref_len++;
786e8c11
YO
2929 pref0_len = pref_len - (locinput - loc_reg_starttry);
2930 if (l + pref_len < (5 + taill) && l < loc_regeol - locinput)
2931 l = ( loc_regeol - locinput > (5 + taill) - pref_len
2932 ? (5 + taill) - pref_len : loc_regeol - locinput);
f2ed9b32 2933 while (utf8_target && UTF8_IS_CONTINUATION(*(U8*)(locinput + l)))
07be1b83
YO
2934 l--;
2935 if (pref0_len < 0)
2936 pref0_len = 0;
2937 if (pref0_len > pref_len)
2938 pref0_len = pref_len;
2939 {
f2ed9b32 2940 const int is_uni = (utf8_target && OP(scan) != CANY) ? 1 : 0;
0df25f3d 2941
ab3bbdeb 2942 RE_PV_COLOR_DECL(s0,len0,is_uni,PERL_DEBUG_PAD(0),
1de06328 2943 (locinput - pref_len),pref0_len, 60, 4, 5);
0df25f3d 2944
ab3bbdeb 2945 RE_PV_COLOR_DECL(s1,len1,is_uni,PERL_DEBUG_PAD(1),
3df15adc 2946 (locinput - pref_len + pref0_len),
1de06328 2947 pref_len - pref0_len, 60, 2, 3);
0df25f3d 2948
ab3bbdeb 2949 RE_PV_COLOR_DECL(s2,len2,is_uni,PERL_DEBUG_PAD(2),
1de06328 2950 locinput, loc_regeol - locinput, 10, 0, 1);
0df25f3d 2951
1de06328 2952 const STRLEN tlen=len0+len1+len2;
3df15adc 2953 PerlIO_printf(Perl_debug_log,
ab3bbdeb 2954 "%4"IVdf" <%.*s%.*s%s%.*s>%*s|",
786e8c11 2955 (IV)(locinput - loc_bostr),
07be1b83 2956 len0, s0,
07be1b83 2957 len1, s1,
07be1b83 2958 (docolor ? "" : "> <"),
07be1b83 2959 len2, s2,
f9f4320a 2960 (int)(tlen > 19 ? 0 : 19 - tlen),
07be1b83
YO
2961 "");
2962 }
2963}
3df15adc 2964
07be1b83
YO
2965#endif
2966
0a4db386
YO
2967/* reg_check_named_buff_matched()
2968 * Checks to see if a named buffer has matched. The data array of
2969 * buffer numbers corresponding to the buffer is expected to reside
2970 * in the regexp->data->data array in the slot stored in the ARG() of
2971 * node involved. Note that this routine doesn't actually care about the
2972 * name, that information is not preserved from compilation to execution.
2973 * Returns the index of the leftmost defined buffer with the given name
2974 * or 0 if non of the buffers matched.
2975 */
2976STATIC I32
7918f24d
NC
2977S_reg_check_named_buff_matched(pTHX_ const regexp *rex, const regnode *scan)
2978{
0a4db386 2979 I32 n;
f8fc2ecf 2980 RXi_GET_DECL(rex,rexi);
ad64d0ec 2981 SV *sv_dat= MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
0a4db386 2982 I32 *nums=(I32*)SvPVX(sv_dat);
7918f24d
NC
2983
2984 PERL_ARGS_ASSERT_REG_CHECK_NAMED_BUFF_MATCHED;
2985
0a4db386
YO
2986 for ( n=0; n<SvIVX(sv_dat); n++ ) {
2987 if ((I32)*PL_reglastparen >= nums[n] &&
f0ab9afb 2988 PL_regoffs[nums[n]].end != -1)
0a4db386
YO
2989 {
2990 return nums[n];
2991 }
2992 }
2993 return 0;
2994}
2995
2f554ef7
DM
2996
2997/* free all slabs above current one - called during LEAVE_SCOPE */
2998
2999STATIC void
3000S_clear_backtrack_stack(pTHX_ void *p)
3001{
3002 regmatch_slab *s = PL_regmatch_slab->next;
3003 PERL_UNUSED_ARG(p);
3004
3005 if (!s)
3006 return;
3007 PL_regmatch_slab->next = NULL;
3008 while (s) {
3009 regmatch_slab * const osl = s;
3010 s = s->next;
3011 Safefree(osl);
3012 }
3013}
3014
3015
28d8d7f4
YO
3016#define SETREX(Re1,Re2) \
3017 if (PL_reg_eval_set) PM_SETRE((PL_reg_curpm), (Re2)); \
3018 Re1 = (Re2)
3019
d6a28714 3020STATIC I32 /* 0 failure, 1 success */
24b23f37 3021S_regmatch(pTHX_ regmatch_info *reginfo, regnode *prog)
d6a28714 3022{
a35a87e7 3023#if PERL_VERSION < 9 && !defined(PERL_CORE)
54df2634
NC
3024 dMY_CXT;
3025#endif
27da23d5 3026 dVAR;
f2ed9b32 3027 register const bool utf8_target = PL_reg_match_utf8;
4ad0818d 3028 const U32 uniflags = UTF8_ALLOW_DEFAULT;
288b8c02
NC
3029 REGEXP *rex_sv = reginfo->prog;
3030 regexp *rex = (struct regexp *)SvANY(rex_sv);
f8fc2ecf 3031 RXi_GET_DECL(rex,rexi);
2f554ef7 3032 I32 oldsave;
5d9a96ca
DM
3033 /* the current state. This is a cached copy of PL_regmatch_state */
3034 register regmatch_state *st;
5d9a96ca
DM
3035 /* cache heavy used fields of st in registers */
3036 register regnode *scan;
3037 register regnode *next;
438e9bae 3038 register U32 n = 0; /* general value; init to avoid compiler warning */
24d3c4a9 3039 register I32 ln = 0; /* len or last; init to avoid compiler warning */
5d9a96ca 3040 register char *locinput = PL_reginput;
5d9a96ca 3041 register I32 nextchr; /* is always set to UCHARAT(locinput) */
24d3c4a9 3042
b69b0499 3043 bool result = 0; /* return value of S_regmatch */
24d3c4a9 3044 int depth = 0; /* depth of backtrack stack */
4b196cd4
YO
3045 U32 nochange_depth = 0; /* depth of GOSUB recursion with nochange */
3046 const U32 max_nochange_depth =
3047 (3 * rex->nparens > MAX_RECURSE_EVAL_NOCHANGE_DEPTH) ?
3048 3 * rex->nparens : MAX_RECURSE_EVAL_NOCHANGE_DEPTH;
77cb431f
DM
3049 regmatch_state *yes_state = NULL; /* state to pop to on success of
3050 subpattern */
e2e6a0f1
YO
3051 /* mark_state piggy backs on the yes_state logic so that when we unwind
3052 the stack on success we can update the mark_state as we go */
3053 regmatch_state *mark_state = NULL; /* last mark state we have seen */
faec1544 3054 regmatch_state *cur_eval = NULL; /* most recent EVAL_AB state */
b8591aee 3055 struct regmatch_state *cur_curlyx = NULL; /* most recent curlyx */
40a82448 3056 U32 state_num;
5d458dd8
YO
3057 bool no_final = 0; /* prevent failure from backtracking? */
3058 bool do_cutgroup = 0; /* no_final only until next branch/trie entry */
e2e6a0f1 3059 char *startpoint = PL_reginput;
5d458dd8
YO
3060 SV *popmark = NULL; /* are we looking for a mark? */
3061 SV *sv_commit = NULL; /* last mark name seen in failure */
3062 SV *sv_yes_mark = NULL; /* last mark name we have seen
486ec47a 3063 during a successful match */
5d458dd8
YO
3064 U32 lastopen = 0; /* last open we saw */
3065 bool has_cutgroup = RX_HAS_CUTGROUP(rex) ? 1 : 0;
19b95bf0 3066 SV* const oreplsv = GvSV(PL_replgv);
24d3c4a9
DM
3067 /* these three flags are set by various ops to signal information to
3068 * the very next op. They have a useful lifetime of exactly one loop
3069 * iteration, and are not preserved or restored by state pushes/pops
3070 */
3071 bool sw = 0; /* the condition value in (?(cond)a|b) */
3072 bool minmod = 0; /* the next "{n,m}" is a "{n,m}?" */
3073 int logical = 0; /* the following EVAL is:
3074 0: (?{...})
3075 1: (?(?{...})X|Y)
3076 2: (??{...})
3077 or the following IFMATCH/UNLESSM is:
3078 false: plain (?=foo)
3079 true: used as a condition: (?(?=foo))
3080 */
95b24440 3081#ifdef DEBUGGING
e68ec53f 3082 GET_RE_DEBUG_FLAGS_DECL;
d6a28714
JH
3083#endif
3084
7918f24d
NC
3085 PERL_ARGS_ASSERT_REGMATCH;
3086
3b57cd43 3087 DEBUG_OPTIMISE_r( DEBUG_EXECUTE_r({
24b23f37 3088 PerlIO_printf(Perl_debug_log,"regmatch start\n");
3b57cd43 3089 }));
5d9a96ca
DM
3090 /* on first ever call to regmatch, allocate first slab */
3091 if (!PL_regmatch_slab) {
3092 Newx(PL_regmatch_slab, 1, regmatch_slab);
3093 PL_regmatch_slab->prev = NULL;
3094 PL_regmatch_slab->next = NULL;
86545054 3095 PL_regmatch_state = SLAB_FIRST(PL_regmatch_slab);
5d9a96ca
DM
3096 }
3097
2f554ef7
DM
3098 oldsave = PL_savestack_ix;
3099 SAVEDESTRUCTOR_X(S_clear_backtrack_stack, NULL);
3100 SAVEVPTR(PL_regmatch_slab);
3101 SAVEVPTR(PL_regmatch_state);
5d9a96ca
DM
3102
3103 /* grab next free state slot */
3104 st = ++PL_regmatch_state;
86545054 3105 if (st > SLAB_LAST(PL_regmatch_slab))
5d9a96ca
DM
3106 st = PL_regmatch_state = S_push_slab(aTHX);
3107
d6a28714
JH
3108 /* Note that nextchr is a byte even in UTF */
3109 nextchr = UCHARAT(locinput);
3110 scan = prog;
3111 while (scan != NULL) {
8ba1375e 3112
a3621e74 3113 DEBUG_EXECUTE_r( {
6136c704 3114 SV * const prop = sv_newmortal();
1de06328 3115 regnode *rnext=regnext(scan);
f2ed9b32 3116 DUMP_EXEC_POS( locinput, scan, utf8_target );
32fc9b6a 3117 regprop(rex, prop, scan);
07be1b83
YO
3118
3119 PerlIO_printf(Perl_debug_log,
3120 "%3"IVdf":%*s%s(%"IVdf")\n",
f8fc2ecf 3121 (IV)(scan - rexi->program), depth*2, "",
07be1b83 3122 SvPVX_const(prop),
1de06328 3123 (PL_regkind[OP(scan)] == END || !rnext) ?
f8fc2ecf 3124 0 : (IV)(rnext - rexi->program));
2a782b5b 3125 });
d6a28714
JH
3126
3127 next = scan + NEXT_OFF(scan);
3128 if (next == scan)
3129 next = NULL;
40a82448 3130 state_num = OP(scan);
d6a28714 3131
40a82448 3132 reenter_switch:
34a81e2b
B
3133
3134 assert(PL_reglastparen == &rex->lastparen);
3135 assert(PL_reglastcloseparen == &rex->lastcloseparen);
3136 assert(PL_regoffs == rex->offs);
3137
40a82448 3138 switch (state_num) {
d6a28714 3139 case BOL:
7fba1cd6 3140 if (locinput == PL_bostr)
d6a28714 3141 {
3b0527fe 3142 /* reginfo->till = reginfo->bol; */
b8c5462f
JH
3143 break;
3144 }
d6a28714
JH
3145 sayNO;
3146 case MBOL:
12d33761
HS
3147 if (locinput == PL_bostr ||
3148 ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n'))
d6a28714 3149 {
b8c5462f
JH
3150 break;
3151 }
d6a28714
JH
3152 sayNO;
3153 case SBOL:
c2a73568 3154 if (locinput == PL_bostr)
b8c5462f 3155 break;
d6a28714
JH
3156 sayNO;
3157 case GPOS:
3b0527fe 3158 if (locinput == reginfo->ganch)
d6a28714
JH
3159 break;
3160 sayNO;
ee9b8eae
YO
3161
3162 case KEEPS:
3163 /* update the startpoint */
f0ab9afb 3164 st->u.keeper.val = PL_regoffs[0].start;
ee9b8eae 3165 PL_reginput = locinput;
f0ab9afb 3166 PL_regoffs[0].start = locinput - PL_bostr;
ee9b8eae
YO
3167 PUSH_STATE_GOTO(KEEPS_next, next);
3168 /*NOT-REACHED*/
3169 case KEEPS_next_fail:
3170 /* rollback the start point change */
f0ab9afb 3171 PL_regoffs[0].start = st->u.keeper.val;
ee9b8eae
YO
3172 sayNO_SILENT;
3173 /*NOT-REACHED*/
d6a28714 3174 case EOL:
d6a28714
JH
3175 goto seol;
3176 case MEOL:
d6a28714 3177 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
b8c5462f 3178 sayNO;
b8c5462f 3179 break;
d6a28714
JH
3180 case SEOL:
3181 seol:
3182 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
b8c5462f 3183 sayNO;
d6a28714 3184 if (PL_regeol - locinput > 1)
b8c5462f 3185 sayNO;
b8c5462f 3186 break;
d6a28714
JH
3187 case EOS:
3188 if (PL_regeol != locinput)
b8c5462f 3189 sayNO;
d6a28714 3190 break;
ffc61ed2 3191 case SANY:
d6a28714 3192 if (!nextchr && locinput >= PL_regeol)
4633a7c4 3193 sayNO;
f2ed9b32 3194 if (utf8_target) {
f33976b4
DB
3195 locinput += PL_utf8skip[nextchr];
3196 if (locinput > PL_regeol)
3197 sayNO;
3198 nextchr = UCHARAT(locinput);
3199 }
3200 else
3201 nextchr = UCHARAT(++locinput);
3202 break;
3203 case CANY:
3204 if (!nextchr && locinput >= PL_regeol)
3205 sayNO;
b8c5462f 3206 nextchr = UCHARAT(++locinput);
a0d0e21e 3207 break;
ffc61ed2 3208 case REG_ANY:
1aa99e6b
IH
3209 if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n')
3210 sayNO;
f2ed9b32 3211 if (utf8_target) {
b8c5462f 3212 locinput += PL_utf8skip[nextchr];
d6a28714
JH
3213 if (locinput > PL_regeol)
3214 sayNO;
a0ed51b3 3215 nextchr = UCHARAT(locinput);
a0ed51b3 3216 }
1aa99e6b
IH
3217 else
3218 nextchr = UCHARAT(++locinput);
a0ed51b3 3219 break;
166ba7cd
DM
3220
3221#undef ST
3222#define ST st->u.trie
786e8c11
YO
3223 case TRIEC:
3224 /* In this case the charclass data is available inline so
3225 we can fail fast without a lot of extra overhead.
3226 */
f2ed9b32 3227 if (scan->flags == EXACT || !utf8_target) {
786e8c11
YO
3228 if(!ANYOF_BITMAP_TEST(scan, *locinput)) {
3229 DEBUG_EXECUTE_r(
3230 PerlIO_printf(Perl_debug_log,
3231 "%*s %sfailed to match trie start class...%s\n",
5bc10b2c 3232 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
786e8c11
YO
3233 );
3234 sayNO_SILENT;
3235 /* NOTREACHED */
3236 }
3237 }
3238 /* FALL THROUGH */
5b47454d 3239 case TRIE:
2e64971a
DM
3240 /* the basic plan of execution of the trie is:
3241 * At the beginning, run though all the states, and
3242 * find the longest-matching word. Also remember the position
3243 * of the shortest matching word. For example, this pattern:
3244 * 1 2 3 4 5
3245 * ab|a|x|abcd|abc
3246 * when matched against the string "abcde", will generate
3247 * accept states for all words except 3, with the longest
3248 * matching word being 4, and the shortest being 1 (with
3249 * the position being after char 1 of the string).
3250 *
3251 * Then for each matching word, in word order (i.e. 1,2,4,5),
3252 * we run the remainder of the pattern; on each try setting
3253 * the current position to the character following the word,
3254 * returning to try the next word on failure.
3255 *
3256 * We avoid having to build a list of words at runtime by
3257 * using a compile-time structure, wordinfo[].prev, which
3258 * gives, for each word, the previous accepting word (if any).
3259 * In the case above it would contain the mappings 1->2, 2->0,
3260 * 3->0, 4->5, 5->1. We can use this table to generate, from
3261 * the longest word (4 above), a list of all words, by
3262 * following the list of prev pointers; this gives us the
3263 * unordered list 4,5,1,2. Then given the current word we have
3264 * just tried, we can go through the list and find the
3265 * next-biggest word to try (so if we just failed on word 2,
3266 * the next in the list is 4).
3267 *
3268 * Since at runtime we don't record the matching position in
3269 * the string for each word, we have to work that out for
3270 * each word we're about to process. The wordinfo table holds
3271 * the character length of each word; given that we recorded
3272 * at the start: the position of the shortest word and its
3273 * length in chars, we just need to move the pointer the
3274 * difference between the two char lengths. Depending on
3275 * Unicode status and folding, that's cheap or expensive.
3276 *
3277 * This algorithm is optimised for the case where are only a
3278 * small number of accept states, i.e. 0,1, or maybe 2.
3279 * With lots of accepts states, and having to try all of them,
3280 * it becomes quadratic on number of accept states to find all
3281 * the next words.
3282 */
3283
3dab1dad 3284 {
07be1b83 3285 /* what type of TRIE am I? (utf8 makes this contextual) */
a0a388a1 3286 DECL_TRIE_TYPE(scan);
3dab1dad
YO
3287
3288 /* what trie are we using right now */
be8e71aa 3289 reg_trie_data * const trie
f8fc2ecf 3290 = (reg_trie_data*)rexi->data->data[ ARG( scan ) ];
85fbaab2 3291 HV * widecharmap = MUTABLE_HV(rexi->data->data[ ARG( scan ) + 1 ]);
3dab1dad 3292 U32 state = trie->startstate;
166ba7cd 3293
3dab1dad
YO
3294 if (trie->bitmap && trie_type != trie_utf8_fold &&
3295 !TRIE_BITMAP_TEST(trie,*locinput)
3296 ) {
3297 if (trie->states[ state ].wordnum) {
3298 DEBUG_EXECUTE_r(
3299 PerlIO_printf(Perl_debug_log,
3300 "%*s %smatched empty string...%s\n",
5bc10b2c 3301 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
3dab1dad 3302 );
20dbff7c
YO
3303 if (!trie->jump)
3304 break;
3dab1dad
YO
3305 } else {
3306 DEBUG_EXECUTE_r(
3307 PerlIO_printf(Perl_debug_log,
786e8c11 3308 "%*s %sfailed to match trie start class...%s\n",
5bc10b2c 3309 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
3dab1dad
YO
3310 );
3311 sayNO_SILENT;
3312 }
3313 }
166ba7cd 3314
786e8c11
YO
3315 {
3316 U8 *uc = ( U8* )locinput;
3317
3318 STRLEN len = 0;
3319 STRLEN foldlen = 0;
3320 U8 *uscan = (U8*)NULL;
786e8c11 3321 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
2e64971a
DM
3322 U32 charcount = 0; /* how many input chars we have matched */
3323 U32 accepted = 0; /* have we seen any accepting states? */
786e8c11 3324
786e8c11
YO
3325 ST.B = next;
3326 ST.jump = trie->jump;
786e8c11 3327 ST.me = scan;
2e64971a
DM
3328 ST.firstpos = NULL;
3329 ST.longfold = FALSE; /* char longer if folded => it's harder */
3330 ST.nextword = 0;
3331
3332 /* fully traverse the TRIE; note the position of the
3333 shortest accept state and the wordnum of the longest
3334 accept state */
07be1b83 3335
a3621e74 3336 while ( state && uc <= (U8*)PL_regeol ) {
786e8c11 3337 U32 base = trie->states[ state ].trans.base;
f9f4320a 3338 UV uvc = 0;
acb909b4 3339 U16 charid = 0;
2e64971a
DM
3340 U16 wordnum;
3341 wordnum = trie->states[ state ].wordnum;
3342
3343 if (wordnum) { /* it's an accept state */
3344 if (!accepted) {
3345 accepted = 1;
3346 /* record first match position */
3347 if (ST.longfold) {
3348 ST.firstpos = (U8*)locinput;
3349 ST.firstchars = 0;
5b47454d 3350 }
2e64971a
DM
3351 else {
3352 ST.firstpos = uc;
3353 ST.firstchars = charcount;
3354 }
3355 }
3356 if (!ST.nextword || wordnum < ST.nextword)
3357 ST.nextword = wordnum;
3358 ST.topword = wordnum;
786e8c11 3359 }
a3621e74 3360
07be1b83 3361 DEBUG_TRIE_EXECUTE_r({
f2ed9b32 3362 DUMP_EXEC_POS( (char *)uc, scan, utf8_target );
a3621e74 3363 PerlIO_printf( Perl_debug_log,
2e64971a 3364 "%*s %sState: %4"UVxf" Accepted: %c ",
5bc10b2c 3365 2+depth * 2, "", PL_colors[4],
2e64971a 3366 (UV)state, (accepted ? 'Y' : 'N'));
07be1b83 3367 });
a3621e74 3368
2e64971a 3369 /* read a char and goto next state */
a3621e74 3370 if ( base ) {
6dd2be57 3371 I32 offset;
55eed653
NC
3372 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
3373 uscan, len, uvc, charid, foldlen,
3374 foldbuf, uniflags);
2e64971a
DM
3375 charcount++;
3376 if (foldlen>0)
3377 ST.longfold = TRUE;
5b47454d 3378 if (charid &&
6dd2be57
DM
3379 ( ((offset =
3380 base + charid - 1 - trie->uniquecharcount)) >= 0)
3381
3382 && ((U32)offset < trie->lasttrans)
3383 && trie->trans[offset].check == state)
5b47454d 3384 {
6dd2be57 3385 state = trie->trans[offset].next;
5b47454d
DM
3386 }
3387 else {
3388 state = 0;
3389 }
3390 uc += len;
3391
3392 }
3393 else {