5 * One Ring to rule them all, One Ring to find them
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"]
12 /* This file contains functions for executing a regular expression. See
13 * also regcomp.c which funnily enough, contains functions for compiling
14 * a regular expression.
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.
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!
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.
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.
36 #ifdef PERL_EXT_RE_BUILD
41 * pregcomp and pregexec -- regsub and regerror are not used in perl
43 * Copyright (c) 1986 by University of Toronto.
44 * Written by Henry Spencer. Not derived from licensed software.
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:
50 * 1. The author is not responsible for the consequences of use of
51 * this software, no matter how awful, even if they arise
54 * 2. The origin of this software must not be misrepresented, either
55 * by explicit claim or by omission.
57 * 3. Altered versions must be plainly marked as such, and must not
58 * be misrepresented as being the original software.
60 **** Alterations to Henry's code are...
62 **** Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
63 **** 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
64 **** by Larry Wall and others
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.
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.
74 #define PERL_IN_REGEXEC_C
77 #ifdef PERL_IN_XSUB_RE
83 #define RF_tainted 1 /* tainted information used? */
84 #define RF_warned 2 /* warned about big count? */
86 #define RF_utf8 8 /* Pattern contains multibyte chars? */
88 #define UTF_PATTERN ((PL_reg_flags & RF_utf8) != 0)
90 #define RS_init 1 /* eval environment created */
91 #define RS_set 2 /* replsv value is set */
97 /* Valid for non-utf8 strings only: avoids the reginclass call if there are no
98 * complications: i.e., if everything matchable is straight forward in the
100 #define REGINCLASS(prog,p,c) (ANYOF_FLAGS(p) ? reginclass(prog,p,c,0,0) \
101 : ANYOF_BITMAP_TEST(p,*(c)))
107 #define CHR_SVLEN(sv) (utf8_target ? sv_len_utf8(sv) : SvCUR(sv))
108 #define CHR_DIST(a,b) (PL_reg_match_utf8 ? utf8_distance(a,b) : a - b)
110 #define HOPc(pos,off) \
111 (char *)(PL_reg_match_utf8 \
112 ? reghop3((U8*)pos, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr)) \
114 #define HOPBACKc(pos, off) \
115 (char*)(PL_reg_match_utf8\
116 ? reghopmaybe3((U8*)pos, -off, (U8*)PL_bostr) \
117 : (pos - off >= PL_bostr) \
121 #define HOP3(pos,off,lim) (PL_reg_match_utf8 ? reghop3((U8*)(pos), off, (U8*)(lim)) : (U8*)(pos + off))
122 #define HOP3c(pos,off,lim) ((char*)HOP3(pos,off,lim))
124 /* these are unrolled below in the CCC_TRY_XXX defined */
125 #define LOAD_UTF8_CHARCLASS(class,str) STMT_START { \
126 if (!CAT2(PL_utf8_,class)) { bool ok; ENTER; save_re_context(); ok=CAT2(is_utf8_,class)((const U8*)str); assert(ok); LEAVE; } } STMT_END
128 /* Doesn't do an assert to verify that is correct */
129 #define LOAD_UTF8_CHARCLASS_NO_CHECK(class) STMT_START { \
130 if (!CAT2(PL_utf8_,class)) { bool ok; ENTER; save_re_context(); ok=CAT2(is_utf8_,class)((const U8*)" "); LEAVE; } } STMT_END
132 #define LOAD_UTF8_CHARCLASS_ALNUM() LOAD_UTF8_CHARCLASS(alnum,"a")
133 #define LOAD_UTF8_CHARCLASS_DIGIT() LOAD_UTF8_CHARCLASS(digit,"0")
134 #define LOAD_UTF8_CHARCLASS_SPACE() LOAD_UTF8_CHARCLASS(space," ")
136 #define LOAD_UTF8_CHARCLASS_GCB() /* Grapheme cluster boundaries */ \
137 LOAD_UTF8_CHARCLASS(X_begin, " "); \
138 LOAD_UTF8_CHARCLASS(X_non_hangul, "A"); \
139 /* These are utf8 constants, and not utf-ebcdic constants, so the \
140 * assert should likely and hopefully fail on an EBCDIC machine */ \
141 LOAD_UTF8_CHARCLASS(X_extend, "\xcc\x80"); /* U+0300 */ \
143 /* No asserts are done for these, in case called on an early \
144 * Unicode version in which they map to nothing */ \
145 LOAD_UTF8_CHARCLASS_NO_CHECK(X_prepend);/* U+0E40 "\xe0\xb9\x80" */ \
146 LOAD_UTF8_CHARCLASS_NO_CHECK(X_L); /* U+1100 "\xe1\x84\x80" */ \
147 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LV); /* U+AC00 "\xea\xb0\x80" */ \
148 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LVT); /* U+AC01 "\xea\xb0\x81" */ \
149 LOAD_UTF8_CHARCLASS_NO_CHECK(X_LV_LVT_V);/* U+AC01 "\xea\xb0\x81" */\
150 LOAD_UTF8_CHARCLASS_NO_CHECK(X_T); /* U+11A8 "\xe1\x86\xa8" */ \
151 LOAD_UTF8_CHARCLASS_NO_CHECK(X_V) /* U+1160 "\xe1\x85\xa0" */
154 We dont use PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS as the direct test
155 so that it is possible to override the option here without having to
156 rebuild the entire core. as we are required to do if we change regcomp.h
157 which is where PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS is defined.
159 #if PERL_LEGACY_UNICODE_CHARCLASS_MAPPINGS
160 #define BROKEN_UNICODE_CHARCLASS_MAPPINGS
163 #ifdef BROKEN_UNICODE_CHARCLASS_MAPPINGS
164 #define LOAD_UTF8_CHARCLASS_PERL_WORD() LOAD_UTF8_CHARCLASS_ALNUM()
165 #define LOAD_UTF8_CHARCLASS_PERL_SPACE() LOAD_UTF8_CHARCLASS_SPACE()
166 #define LOAD_UTF8_CHARCLASS_POSIX_DIGIT() LOAD_UTF8_CHARCLASS_DIGIT()
167 #define RE_utf8_perl_word PL_utf8_alnum
168 #define RE_utf8_perl_space PL_utf8_space
169 #define RE_utf8_posix_digit PL_utf8_digit
170 #define perl_word alnum
171 #define perl_space space
172 #define posix_digit digit
174 #define LOAD_UTF8_CHARCLASS_PERL_WORD() LOAD_UTF8_CHARCLASS(perl_word,"a")
175 #define LOAD_UTF8_CHARCLASS_PERL_SPACE() LOAD_UTF8_CHARCLASS(perl_space," ")
176 #define LOAD_UTF8_CHARCLASS_POSIX_DIGIT() LOAD_UTF8_CHARCLASS(posix_digit,"0")
177 #define RE_utf8_perl_word PL_utf8_perl_word
178 #define RE_utf8_perl_space PL_utf8_perl_space
179 #define RE_utf8_posix_digit PL_utf8_posix_digit
183 #define _CCC_TRY_AFF_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC) \
185 PL_reg_flags |= RF_tainted; \
190 if (utf8_target && UTF8_IS_CONTINUED(nextchr)) { \
191 if (!CAT2(PL_utf8_,CLASS)) { \
195 ok=CAT2(is_utf8_,CLASS)((const U8*)STR); \
199 if (!(OP(scan) == NAME \
200 ? cBOOL(swash_fetch(CAT2(PL_utf8_,CLASS), (U8*)locinput, utf8_target)) \
201 : LCFUNC_utf8((U8*)locinput))) \
205 locinput += PL_utf8skip[nextchr]; \
206 nextchr = UCHARAT(locinput); \
209 /* Drops through to the macro that calls this one */
211 #define CCC_TRY_AFF(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC,LCFUNC) \
212 _CCC_TRY_AFF_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC) \
213 if (!(OP(scan) == NAME ? FUNC(nextchr) : LCFUNC(nextchr))) \
215 nextchr = UCHARAT(++locinput); \
218 /* Almost identical to the above, but has a case for a node that matches chars
219 * between 128 and 255 using Unicode (latin1) semantics. */
220 #define CCC_TRY_AFF_U(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNCU,LCFUNC) \
221 _CCC_TRY_AFF_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC) \
222 if (!(OP(scan) == NAMEL ? LCFUNC(nextchr) : (FUNCU(nextchr) && (isASCII(nextchr) || (FLAGS(scan) & USE_UNI))))) \
224 nextchr = UCHARAT(++locinput); \
227 #define _CCC_TRY_NEG_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC) \
229 PL_reg_flags |= RF_tainted; \
232 if (!nextchr && locinput >= PL_regeol) \
234 if (utf8_target && UTF8_IS_CONTINUED(nextchr)) { \
235 if (!CAT2(PL_utf8_,CLASS)) { \
239 ok=CAT2(is_utf8_,CLASS)((const U8*)STR); \
243 if ((OP(scan) == NAME \
244 ? cBOOL(swash_fetch(CAT2(PL_utf8_,CLASS), (U8*)locinput, utf8_target)) \
245 : LCFUNC_utf8((U8*)locinput))) \
249 locinput += PL_utf8skip[nextchr]; \
250 nextchr = UCHARAT(locinput); \
254 #define CCC_TRY_NEG(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC,LCFUNC) \
255 _CCC_TRY_NEG_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNC) \
256 if ((OP(scan) == NAME ? FUNC(nextchr) : LCFUNC(nextchr))) \
258 nextchr = UCHARAT(++locinput); \
262 #define CCC_TRY_NEG_U(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNCU,LCFUNC) \
263 _CCC_TRY_NEG_COMMON(NAME,NAMEL,CLASS,STR,LCFUNC_utf8,FUNCU) \
264 if ((OP(scan) == NAMEL ? LCFUNC(nextchr) : (FUNCU(nextchr) && (isASCII(nextchr) || (FLAGS(scan) & USE_UNI))))) \
266 nextchr = UCHARAT(++locinput); \
271 /* TODO: Combine JUMPABLE and HAS_TEXT to cache OP(rn) */
273 /* for use after a quantifier and before an EXACT-like node -- japhy */
274 /* it would be nice to rework regcomp.sym to generate this stuff. sigh
276 * NOTE that *nothing* that affects backtracking should be in here, specifically
277 * VERBS must NOT be included. JUMPABLE is used to determine if we can ignore a
278 * node that is in between two EXACT like nodes when ascertaining what the required
279 * "follow" character is. This should probably be moved to regex compile time
280 * although it may be done at run time beause of the REF possibility - more
281 * investigation required. -- demerphq
283 #define JUMPABLE(rn) ( \
285 (OP(rn) == CLOSE && (!cur_eval || cur_eval->u.eval.close_paren != ARG(rn))) || \
287 OP(rn) == SUSPEND || OP(rn) == IFMATCH || \
288 OP(rn) == PLUS || OP(rn) == MINMOD || \
290 (PL_regkind[OP(rn)] == CURLY && ARG1(rn) > 0) \
292 #define IS_EXACT(rn) (PL_regkind[OP(rn)] == EXACT)
294 #define HAS_TEXT(rn) ( IS_EXACT(rn) || PL_regkind[OP(rn)] == REF )
297 /* Currently these are only used when PL_regkind[OP(rn)] == EXACT so
298 we don't need this definition. */
299 #define IS_TEXT(rn) ( OP(rn)==EXACT || OP(rn)==REF || OP(rn)==NREF )
300 #define IS_TEXTF(rn) ( (OP(rn)==EXACTFU || OP(rn)==EXACTF) || OP(rn)==REFF || OP(rn)==NREFF )
301 #define IS_TEXTFL(rn) ( OP(rn)==EXACTFL || OP(rn)==REFFL || OP(rn)==NREFFL )
304 /* ... so we use this as its faster. */
305 #define IS_TEXT(rn) ( OP(rn)==EXACT )
306 #define IS_TEXTFU(rn) ( OP(rn)==EXACTFU )
307 #define IS_TEXTF(rn) ( OP(rn)==EXACTF )
308 #define IS_TEXTFL(rn) ( OP(rn)==EXACTFL )
313 Search for mandatory following text node; for lookahead, the text must
314 follow but for lookbehind (rn->flags != 0) we skip to the next step.
316 #define FIND_NEXT_IMPT(rn) STMT_START { \
317 while (JUMPABLE(rn)) { \
318 const OPCODE type = OP(rn); \
319 if (type == SUSPEND || PL_regkind[type] == CURLY) \
320 rn = NEXTOPER(NEXTOPER(rn)); \
321 else if (type == PLUS) \
323 else if (type == IFMATCH) \
324 rn = (rn->flags == 0) ? NEXTOPER(NEXTOPER(rn)) : rn + ARG(rn); \
325 else rn += NEXT_OFF(rn); \
330 static void restore_pos(pTHX_ void *arg);
332 #define REGCP_PAREN_ELEMS 4
333 #define REGCP_OTHER_ELEMS 5
334 #define REGCP_FRAME_ELEMS 1
335 /* REGCP_FRAME_ELEMS are not part of the REGCP_OTHER_ELEMS and
336 * are needed for the regexp context stack bookkeeping. */
339 S_regcppush(pTHX_ I32 parenfloor)
342 const int retval = PL_savestack_ix;
343 const int paren_elems_to_push = (PL_regsize - parenfloor) * REGCP_PAREN_ELEMS;
344 const UV total_elems = paren_elems_to_push + REGCP_OTHER_ELEMS;
345 const UV elems_shifted = total_elems << SAVE_TIGHT_SHIFT;
347 GET_RE_DEBUG_FLAGS_DECL;
349 if (paren_elems_to_push < 0)
350 Perl_croak(aTHX_ "panic: paren_elems_to_push < 0");
352 if ((elems_shifted >> SAVE_TIGHT_SHIFT) != total_elems)
353 Perl_croak(aTHX_ "panic: paren_elems_to_push offset %"UVuf
354 " out of range (%lu-%ld)",
355 total_elems, (unsigned long)PL_regsize, (long)parenfloor);
357 SSGROW(total_elems + REGCP_FRAME_ELEMS);
359 for (p = PL_regsize; p > parenfloor; p--) {
360 /* REGCP_PARENS_ELEMS are pushed per pairs of parentheses. */
361 SSPUSHINT(PL_regoffs[p].end);
362 SSPUSHINT(PL_regoffs[p].start);
363 SSPUSHPTR(PL_reg_start_tmp[p]);
365 DEBUG_BUFFERS_r(PerlIO_printf(Perl_debug_log,
366 " saving \\%"UVuf" %"IVdf"(%"IVdf")..%"IVdf"\n",
367 (UV)p, (IV)PL_regoffs[p].start,
368 (IV)(PL_reg_start_tmp[p] - PL_bostr),
369 (IV)PL_regoffs[p].end
372 /* REGCP_OTHER_ELEMS are pushed in any case, parentheses or no. */
373 SSPUSHPTR(PL_regoffs);
374 SSPUSHINT(PL_regsize);
375 SSPUSHINT(*PL_reglastparen);
376 SSPUSHINT(*PL_reglastcloseparen);
377 SSPUSHPTR(PL_reginput);
378 SSPUSHUV(SAVEt_REGCONTEXT | elems_shifted); /* Magic cookie. */
383 /* These are needed since we do not localize EVAL nodes: */
384 #define REGCP_SET(cp) \
386 PerlIO_printf(Perl_debug_log, \
387 " Setting an EVAL scope, savestack=%"IVdf"\n", \
388 (IV)PL_savestack_ix)); \
391 #define REGCP_UNWIND(cp) \
393 if (cp != PL_savestack_ix) \
394 PerlIO_printf(Perl_debug_log, \
395 " Clearing an EVAL scope, savestack=%"IVdf"..%"IVdf"\n", \
396 (IV)(cp), (IV)PL_savestack_ix)); \
400 S_regcppop(pTHX_ const regexp *rex)
405 GET_RE_DEBUG_FLAGS_DECL;
407 PERL_ARGS_ASSERT_REGCPPOP;
409 /* Pop REGCP_OTHER_ELEMS before the parentheses loop starts. */
411 assert((i & SAVE_MASK) == SAVEt_REGCONTEXT); /* Check that the magic cookie is there. */
412 i >>= SAVE_TIGHT_SHIFT; /* Parentheses elements to pop. */
413 input = (char *) SSPOPPTR;
414 *PL_reglastcloseparen = SSPOPINT;
415 *PL_reglastparen = SSPOPINT;
416 PL_regsize = SSPOPINT;
417 PL_regoffs=(regexp_paren_pair *) SSPOPPTR;
419 i -= REGCP_OTHER_ELEMS;
420 /* Now restore the parentheses context. */
421 for ( ; i > 0; i -= REGCP_PAREN_ELEMS) {
423 U32 paren = (U32)SSPOPINT;
424 PL_reg_start_tmp[paren] = (char *) SSPOPPTR;
425 PL_regoffs[paren].start = SSPOPINT;
427 if (paren <= *PL_reglastparen)
428 PL_regoffs[paren].end = tmps;
430 PerlIO_printf(Perl_debug_log,
431 " restoring \\%"UVuf" to %"IVdf"(%"IVdf")..%"IVdf"%s\n",
432 (UV)paren, (IV)PL_regoffs[paren].start,
433 (IV)(PL_reg_start_tmp[paren] - PL_bostr),
434 (IV)PL_regoffs[paren].end,
435 (paren > *PL_reglastparen ? "(no)" : ""));
439 if (*PL_reglastparen + 1 <= rex->nparens) {
440 PerlIO_printf(Perl_debug_log,
441 " restoring \\%"IVdf"..\\%"IVdf" to undef\n",
442 (IV)(*PL_reglastparen + 1), (IV)rex->nparens);
446 /* It would seem that the similar code in regtry()
447 * already takes care of this, and in fact it is in
448 * a better location to since this code can #if 0-ed out
449 * but the code in regtry() is needed or otherwise tests
450 * requiring null fields (pat.t#187 and split.t#{13,14}
451 * (as of patchlevel 7877) will fail. Then again,
452 * this code seems to be necessary or otherwise
453 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
454 * --jhi updated by dapm */
455 for (i = *PL_reglastparen + 1; i <= rex->nparens; i++) {
457 PL_regoffs[i].start = -1;
458 PL_regoffs[i].end = -1;
464 #define regcpblow(cp) LEAVE_SCOPE(cp) /* Ignores regcppush()ed data. */
467 * pregexec and friends
470 #ifndef PERL_IN_XSUB_RE
472 - pregexec - match a regexp against a string
475 Perl_pregexec(pTHX_ REGEXP * const prog, char* stringarg, register char *strend,
476 char *strbeg, I32 minend, SV *screamer, U32 nosave)
477 /* strend: pointer to null at end of string */
478 /* strbeg: real beginning of string */
479 /* minend: end of match must be >=minend after stringarg. */
480 /* nosave: For optimizations. */
482 PERL_ARGS_ASSERT_PREGEXEC;
485 regexec_flags(prog, stringarg, strend, strbeg, minend, screamer, NULL,
486 nosave ? 0 : REXEC_COPY_STR);
491 * Need to implement the following flags for reg_anch:
493 * USE_INTUIT_NOML - Useful to call re_intuit_start() first
495 * INTUIT_AUTORITATIVE_NOML - Can trust a positive answer
496 * INTUIT_AUTORITATIVE_ML
497 * INTUIT_ONCE_NOML - Intuit can match in one location only.
500 * Another flag for this function: SECOND_TIME (so that float substrs
501 * with giant delta may be not rechecked).
504 /* Assumptions: if ANCH_GPOS, then strpos is anchored. XXXX Check GPOS logic */
506 /* If SCREAM, then SvPVX_const(sv) should be compatible with strpos and strend.
507 Otherwise, only SvCUR(sv) is used to get strbeg. */
509 /* XXXX We assume that strpos is strbeg unless sv. */
511 /* XXXX Some places assume that there is a fixed substring.
512 An update may be needed if optimizer marks as "INTUITable"
513 RExen without fixed substrings. Similarly, it is assumed that
514 lengths of all the strings are no more than minlen, thus they
515 cannot come from lookahead.
516 (Or minlen should take into account lookahead.)
517 NOTE: Some of this comment is not correct. minlen does now take account
518 of lookahead/behind. Further research is required. -- demerphq
522 /* A failure to find a constant substring means that there is no need to make
523 an expensive call to REx engine, thus we celebrate a failure. Similarly,
524 finding a substring too deep into the string means that less calls to
525 regtry() should be needed.
527 REx compiler's optimizer found 4 possible hints:
528 a) Anchored substring;
530 c) Whether we are anchored (beginning-of-line or \G);
531 d) First node (of those at offset 0) which may distinguish positions;
532 We use a)b)d) and multiline-part of c), and try to find a position in the
533 string which does not contradict any of them.
536 /* Most of decisions we do here should have been done at compile time.
537 The nodes of the REx which we used for the search should have been
538 deleted from the finite automaton. */
541 Perl_re_intuit_start(pTHX_ REGEXP * const rx, SV *sv, char *strpos,
542 char *strend, const U32 flags, re_scream_pos_data *data)
545 struct regexp *const prog = (struct regexp *)SvANY(rx);
546 register I32 start_shift = 0;
547 /* Should be nonnegative! */
548 register I32 end_shift = 0;
553 const bool utf8_target = (sv && SvUTF8(sv)) ? 1 : 0; /* if no sv we have to assume bytes */
555 register char *other_last = NULL; /* other substr checked before this */
556 char *check_at = NULL; /* check substr found at this pos */
557 const I32 multiline = prog->extflags & RXf_PMf_MULTILINE;
558 RXi_GET_DECL(prog,progi);
560 const char * const i_strpos = strpos;
562 GET_RE_DEBUG_FLAGS_DECL;
564 PERL_ARGS_ASSERT_RE_INTUIT_START;
566 RX_MATCH_UTF8_set(rx,utf8_target);
569 PL_reg_flags |= RF_utf8;
572 debug_start_match(rx, utf8_target, strpos, strend,
573 sv ? "Guessing start of match in sv for"
574 : "Guessing start of match in string for");
577 /* CHR_DIST() would be more correct here but it makes things slow. */
578 if (prog->minlen > strend - strpos) {
579 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
580 "String too short... [re_intuit_start]\n"));
584 strbeg = (sv && SvPOK(sv)) ? strend - SvCUR(sv) : strpos;
587 if (!prog->check_utf8 && prog->check_substr)
588 to_utf8_substr(prog);
589 check = prog->check_utf8;
591 if (!prog->check_substr && prog->check_utf8)
592 to_byte_substr(prog);
593 check = prog->check_substr;
595 if (check == &PL_sv_undef) {
596 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
597 "Non-utf8 string cannot match utf8 check string\n"));
600 if (prog->extflags & RXf_ANCH) { /* Match at beg-of-str or after \n */
601 ml_anch = !( (prog->extflags & RXf_ANCH_SINGLE)
602 || ( (prog->extflags & RXf_ANCH_BOL)
603 && !multiline ) ); /* Check after \n? */
606 if ( !(prog->extflags & RXf_ANCH_GPOS) /* Checked by the caller */
607 && !(prog->intflags & PREGf_IMPLICIT) /* not a real BOL */
608 /* SvCUR is not set on references: SvRV and SvPVX_const overlap */
610 && (strpos != strbeg)) {
611 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not at start...\n"));
614 if (prog->check_offset_min == prog->check_offset_max &&
615 !(prog->extflags & RXf_CANY_SEEN)) {
616 /* Substring at constant offset from beg-of-str... */
619 s = HOP3c(strpos, prog->check_offset_min, strend);
622 slen = SvCUR(check); /* >= 1 */
624 if ( strend - s > slen || strend - s < slen - 1
625 || (strend - s == slen && strend[-1] != '\n')) {
626 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String too long...\n"));
629 /* Now should match s[0..slen-2] */
631 if (slen && (*SvPVX_const(check) != *s
633 && memNE(SvPVX_const(check), s, slen)))) {
635 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String not equal...\n"));
639 else if (*SvPVX_const(check) != *s
640 || ((slen = SvCUR(check)) > 1
641 && memNE(SvPVX_const(check), s, slen)))
644 goto success_at_start;
647 /* Match is anchored, but substr is not anchored wrt beg-of-str. */
649 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
650 end_shift = prog->check_end_shift;
653 const I32 end = prog->check_offset_max + CHR_SVLEN(check)
654 - (SvTAIL(check) != 0);
655 const I32 eshift = CHR_DIST((U8*)strend, (U8*)s) - end;
657 if (end_shift < eshift)
661 else { /* Can match at random position */
664 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
665 end_shift = prog->check_end_shift;
667 /* end shift should be non negative here */
670 #ifdef QDEBUGGING /* 7/99: reports of failure (with the older version) */
672 Perl_croak(aTHX_ "panic: end_shift: %"IVdf" pattern:\n%s\n ",
673 (IV)end_shift, RX_PRECOMP(prog));
677 /* Find a possible match in the region s..strend by looking for
678 the "check" substring in the region corrected by start/end_shift. */
681 I32 srch_start_shift = start_shift;
682 I32 srch_end_shift = end_shift;
683 if (srch_start_shift < 0 && strbeg - s > srch_start_shift) {
684 srch_end_shift -= ((strbeg - s) - srch_start_shift);
685 srch_start_shift = strbeg - s;
687 DEBUG_OPTIMISE_MORE_r({
688 PerlIO_printf(Perl_debug_log, "Check offset min: %"IVdf" Start shift: %"IVdf" End shift %"IVdf" Real End Shift: %"IVdf"\n",
689 (IV)prog->check_offset_min,
690 (IV)srch_start_shift,
692 (IV)prog->check_end_shift);
695 if (flags & REXEC_SCREAM) {
696 I32 p = -1; /* Internal iterator of scream. */
697 I32 * const pp = data ? data->scream_pos : &p;
699 if (PL_screamfirst[BmRARE(check)] >= 0
700 || ( BmRARE(check) == '\n'
701 && (BmPREVIOUS(check) == SvCUR(check) - 1)
703 s = screaminstr(sv, check,
704 srch_start_shift + (s - strbeg), srch_end_shift, pp, 0);
707 /* we may be pointing at the wrong string */
708 if (s && RXp_MATCH_COPIED(prog))
709 s = strbeg + (s - SvPVX_const(sv));
711 *data->scream_olds = s;
716 if (prog->extflags & RXf_CANY_SEEN) {
717 start_point= (U8*)(s + srch_start_shift);
718 end_point= (U8*)(strend - srch_end_shift);
720 start_point= HOP3(s, srch_start_shift, srch_start_shift < 0 ? strbeg : strend);
721 end_point= HOP3(strend, -srch_end_shift, strbeg);
723 DEBUG_OPTIMISE_MORE_r({
724 PerlIO_printf(Perl_debug_log, "fbm_instr len=%d str=<%.*s>\n",
725 (int)(end_point - start_point),
726 (int)(end_point - start_point) > 20 ? 20 : (int)(end_point - start_point),
730 s = fbm_instr( start_point, end_point,
731 check, multiline ? FBMrf_MULTILINE : 0);
734 /* Update the count-of-usability, remove useless subpatterns,
738 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
739 SvPVX_const(check), RE_SV_DUMPLEN(check), 30);
740 PerlIO_printf(Perl_debug_log, "%s %s substr %s%s%s",
741 (s ? "Found" : "Did not find"),
742 (check == (utf8_target ? prog->anchored_utf8 : prog->anchored_substr)
743 ? "anchored" : "floating"),
746 (s ? " at offset " : "...\n") );
751 /* Finish the diagnostic message */
752 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%ld...\n", (long)(s - i_strpos)) );
754 /* XXX dmq: first branch is for positive lookbehind...
755 Our check string is offset from the beginning of the pattern.
756 So we need to do any stclass tests offset forward from that
765 /* Got a candidate. Check MBOL anchoring, and the *other* substr.
766 Start with the other substr.
767 XXXX no SCREAM optimization yet - and a very coarse implementation
768 XXXX /ttx+/ results in anchored="ttx", floating="x". floating will
769 *always* match. Probably should be marked during compile...
770 Probably it is right to do no SCREAM here...
773 if (utf8_target ? (prog->float_utf8 && prog->anchored_utf8)
774 : (prog->float_substr && prog->anchored_substr))
776 /* Take into account the "other" substring. */
777 /* XXXX May be hopelessly wrong for UTF... */
780 if (check == (utf8_target ? prog->float_utf8 : prog->float_substr)) {
783 char * const last = HOP3c(s, -start_shift, strbeg);
785 char * const saved_s = s;
788 t = s - prog->check_offset_max;
789 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
791 || ((t = (char*)reghopmaybe3((U8*)s, -(prog->check_offset_max), (U8*)strpos))
796 t = HOP3c(t, prog->anchored_offset, strend);
797 if (t < other_last) /* These positions already checked */
799 last2 = last1 = HOP3c(strend, -prog->minlen, strbeg);
802 /* XXXX It is not documented what units *_offsets are in.
803 We assume bytes, but this is clearly wrong.
804 Meaning this code needs to be carefully reviewed for errors.
808 /* On end-of-str: see comment below. */
809 must = utf8_target ? prog->anchored_utf8 : prog->anchored_substr;
810 if (must == &PL_sv_undef) {
812 DEBUG_r(must = prog->anchored_utf8); /* for debug */
817 HOP3(HOP3(last1, prog->anchored_offset, strend)
818 + SvCUR(must), -(SvTAIL(must)!=0), strbeg),
820 multiline ? FBMrf_MULTILINE : 0
823 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
824 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
825 PerlIO_printf(Perl_debug_log, "%s anchored substr %s%s",
826 (s ? "Found" : "Contradicts"),
827 quoted, RE_SV_TAIL(must));
832 if (last1 >= last2) {
833 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
834 ", giving up...\n"));
837 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
838 ", trying floating at offset %ld...\n",
839 (long)(HOP3c(saved_s, 1, strend) - i_strpos)));
840 other_last = HOP3c(last1, prog->anchored_offset+1, strend);
841 s = HOP3c(last, 1, strend);
845 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
846 (long)(s - i_strpos)));
847 t = HOP3c(s, -prog->anchored_offset, strbeg);
848 other_last = HOP3c(s, 1, strend);
856 else { /* Take into account the floating substring. */
858 char * const saved_s = s;
861 t = HOP3c(s, -start_shift, strbeg);
863 HOP3c(strend, -prog->minlen + prog->float_min_offset, strbeg);
864 if (CHR_DIST((U8*)last, (U8*)t) > prog->float_max_offset)
865 last = HOP3c(t, prog->float_max_offset, strend);
866 s = HOP3c(t, prog->float_min_offset, strend);
869 /* XXXX It is not documented what units *_offsets are in. Assume bytes. */
870 must = utf8_target ? prog->float_utf8 : prog->float_substr;
871 /* fbm_instr() takes into account exact value of end-of-str
872 if the check is SvTAIL(ed). Since false positives are OK,
873 and end-of-str is not later than strend we are OK. */
874 if (must == &PL_sv_undef) {
876 DEBUG_r(must = prog->float_utf8); /* for debug message */
879 s = fbm_instr((unsigned char*)s,
880 (unsigned char*)last + SvCUR(must)
882 must, multiline ? FBMrf_MULTILINE : 0);
884 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
885 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
886 PerlIO_printf(Perl_debug_log, "%s floating substr %s%s",
887 (s ? "Found" : "Contradicts"),
888 quoted, RE_SV_TAIL(must));
892 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
893 ", giving up...\n"));
896 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
897 ", trying anchored starting at offset %ld...\n",
898 (long)(saved_s + 1 - i_strpos)));
900 s = HOP3c(t, 1, strend);
904 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
905 (long)(s - i_strpos)));
906 other_last = s; /* Fix this later. --Hugo */
916 t= (char*)HOP3( s, -prog->check_offset_max, (prog->check_offset_max<0) ? strend : strpos);
918 DEBUG_OPTIMISE_MORE_r(
919 PerlIO_printf(Perl_debug_log,
920 "Check offset min:%"IVdf" max:%"IVdf" S:%"IVdf" t:%"IVdf" D:%"IVdf" end:%"IVdf"\n",
921 (IV)prog->check_offset_min,
922 (IV)prog->check_offset_max,
930 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
932 || ((t = (char*)reghopmaybe3((U8*)s, -prog->check_offset_max, (U8*) ((prog->check_offset_max<0) ? strend : strpos)))
935 /* Fixed substring is found far enough so that the match
936 cannot start at strpos. */
938 if (ml_anch && t[-1] != '\n') {
939 /* Eventually fbm_*() should handle this, but often
940 anchored_offset is not 0, so this check will not be wasted. */
941 /* XXXX In the code below we prefer to look for "^" even in
942 presence of anchored substrings. And we search even
943 beyond the found float position. These pessimizations
944 are historical artefacts only. */
946 while (t < strend - prog->minlen) {
948 if (t < check_at - prog->check_offset_min) {
949 if (utf8_target ? prog->anchored_utf8 : prog->anchored_substr) {
950 /* Since we moved from the found position,
951 we definitely contradict the found anchored
952 substr. Due to the above check we do not
953 contradict "check" substr.
954 Thus we can arrive here only if check substr
955 is float. Redo checking for "other"=="fixed".
958 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld, rescanning for anchored from offset %ld...\n",
959 PL_colors[0], PL_colors[1], (long)(strpos - i_strpos), (long)(strpos - i_strpos + prog->anchored_offset)));
960 goto do_other_anchored;
962 /* We don't contradict the found floating substring. */
963 /* XXXX Why not check for STCLASS? */
965 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld...\n",
966 PL_colors[0], PL_colors[1], (long)(s - i_strpos)));
969 /* Position contradicts check-string */
970 /* XXXX probably better to look for check-string
971 than for "\n", so one should lower the limit for t? */
972 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m, restarting lookup for check-string at offset %ld...\n",
973 PL_colors[0], PL_colors[1], (long)(t + 1 - i_strpos)));
974 other_last = strpos = s = t + 1;
979 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Did not find /%s^%s/m...\n",
980 PL_colors[0], PL_colors[1]));
984 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Starting position does not contradict /%s^%s/m...\n",
985 PL_colors[0], PL_colors[1]));
989 ++BmUSEFUL(utf8_target ? prog->check_utf8 : prog->check_substr); /* hooray/5 */
992 /* The found string does not prohibit matching at strpos,
993 - no optimization of calling REx engine can be performed,
994 unless it was an MBOL and we are not after MBOL,
995 or a future STCLASS check will fail this. */
997 /* Even in this situation we may use MBOL flag if strpos is offset
998 wrt the start of the string. */
999 if (ml_anch && sv && !SvROK(sv) /* See prev comment on SvROK */
1000 && (strpos != strbeg) && strpos[-1] != '\n'
1001 /* May be due to an implicit anchor of m{.*foo} */
1002 && !(prog->intflags & PREGf_IMPLICIT))
1007 DEBUG_EXECUTE_r( if (ml_anch)
1008 PerlIO_printf(Perl_debug_log, "Position at offset %ld does not contradict /%s^%s/m...\n",
1009 (long)(strpos - i_strpos), PL_colors[0], PL_colors[1]);
1012 if (!(prog->intflags & PREGf_NAUGHTY) /* XXXX If strpos moved? */
1014 prog->check_utf8 /* Could be deleted already */
1015 && --BmUSEFUL(prog->check_utf8) < 0
1016 && (prog->check_utf8 == prog->float_utf8)
1018 prog->check_substr /* Could be deleted already */
1019 && --BmUSEFUL(prog->check_substr) < 0
1020 && (prog->check_substr == prog->float_substr)
1023 /* If flags & SOMETHING - do not do it many times on the same match */
1024 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "... Disabling check substring...\n"));
1025 /* XXX Does the destruction order has to change with utf8_target? */
1026 SvREFCNT_dec(utf8_target ? prog->check_utf8 : prog->check_substr);
1027 SvREFCNT_dec(utf8_target ? prog->check_substr : prog->check_utf8);
1028 prog->check_substr = prog->check_utf8 = NULL; /* disable */
1029 prog->float_substr = prog->float_utf8 = NULL; /* clear */
1030 check = NULL; /* abort */
1032 /* XXXX If the check string was an implicit check MBOL, then we need to unset the relevant flag
1033 see http://bugs.activestate.com/show_bug.cgi?id=87173 */
1034 if (prog->intflags & PREGf_IMPLICIT)
1035 prog->extflags &= ~RXf_ANCH_MBOL;
1036 /* XXXX This is a remnant of the old implementation. It
1037 looks wasteful, since now INTUIT can use many
1038 other heuristics. */
1039 prog->extflags &= ~RXf_USE_INTUIT;
1040 /* XXXX What other flags might need to be cleared in this branch? */
1046 /* Last resort... */
1047 /* XXXX BmUSEFUL already changed, maybe multiple change is meaningful... */
1048 /* trie stclasses are too expensive to use here, we are better off to
1049 leave it to regmatch itself */
1050 if (progi->regstclass && PL_regkind[OP(progi->regstclass)]!=TRIE) {
1051 /* minlen == 0 is possible if regstclass is \b or \B,
1052 and the fixed substr is ''$.
1053 Since minlen is already taken into account, s+1 is before strend;
1054 accidentally, minlen >= 1 guaranties no false positives at s + 1
1055 even for \b or \B. But (minlen? 1 : 0) below assumes that
1056 regstclass does not come from lookahead... */
1057 /* If regstclass takes bytelength more than 1: If charlength==1, OK.
1058 This leaves EXACTF, EXACTFU only, which are dealt with in find_byclass(). */
1059 const U8* const str = (U8*)STRING(progi->regstclass);
1060 const int cl_l = (PL_regkind[OP(progi->regstclass)] == EXACT
1061 ? CHR_DIST(str+STR_LEN(progi->regstclass), str)
1064 if (prog->anchored_substr || prog->anchored_utf8 || ml_anch)
1065 endpos= HOP3c(s, (prog->minlen ? cl_l : 0), strend);
1066 else if (prog->float_substr || prog->float_utf8)
1067 endpos= HOP3c(HOP3c(check_at, -start_shift, strbeg), cl_l, strend);
1071 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "start_shift: %"IVdf" check_at: %"IVdf" s: %"IVdf" endpos: %"IVdf"\n",
1072 (IV)start_shift, (IV)(check_at - strbeg), (IV)(s - strbeg), (IV)(endpos - strbeg)));
1075 s = find_byclass(prog, progi->regstclass, s, endpos, NULL);
1078 const char *what = NULL;
1080 if (endpos == strend) {
1081 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1082 "Could not match STCLASS...\n") );
1085 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1086 "This position contradicts STCLASS...\n") );
1087 if ((prog->extflags & RXf_ANCH) && !ml_anch)
1089 /* Contradict one of substrings */
1090 if (prog->anchored_substr || prog->anchored_utf8) {
1091 if ((utf8_target ? prog->anchored_utf8 : prog->anchored_substr) == check) {
1092 DEBUG_EXECUTE_r( what = "anchored" );
1094 s = HOP3c(t, 1, strend);
1095 if (s + start_shift + end_shift > strend) {
1096 /* XXXX Should be taken into account earlier? */
1097 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1098 "Could not match STCLASS...\n") );
1103 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1104 "Looking for %s substr starting at offset %ld...\n",
1105 what, (long)(s + start_shift - i_strpos)) );
1108 /* Have both, check_string is floating */
1109 if (t + start_shift >= check_at) /* Contradicts floating=check */
1110 goto retry_floating_check;
1111 /* Recheck anchored substring, but not floating... */
1115 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1116 "Looking for anchored substr starting at offset %ld...\n",
1117 (long)(other_last - i_strpos)) );
1118 goto do_other_anchored;
1120 /* Another way we could have checked stclass at the
1121 current position only: */
1126 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
1127 "Looking for /%s^%s/m starting at offset %ld...\n",
1128 PL_colors[0], PL_colors[1], (long)(t - i_strpos)) );
1131 if (!(utf8_target ? prog->float_utf8 : prog->float_substr)) /* Could have been deleted */
1133 /* Check is floating substring. */
1134 retry_floating_check:
1135 t = check_at - start_shift;
1136 DEBUG_EXECUTE_r( what = "floating" );
1137 goto hop_and_restart;
1140 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
1141 "By STCLASS: moving %ld --> %ld\n",
1142 (long)(t - i_strpos), (long)(s - i_strpos))
1146 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
1147 "Does not contradict STCLASS...\n");
1152 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s%s:%s match at offset %ld\n",
1153 PL_colors[4], (check ? "Guessed" : "Giving up"),
1154 PL_colors[5], (long)(s - i_strpos)) );
1157 fail_finish: /* Substring not found */
1158 if (prog->check_substr || prog->check_utf8) /* could be removed already */
1159 BmUSEFUL(utf8_target ? prog->check_utf8 : prog->check_substr) += 5; /* hooray */
1161 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch rejected by optimizer%s\n",
1162 PL_colors[4], PL_colors[5]));
1166 #define DECL_TRIE_TYPE(scan) \
1167 const enum { trie_plain, trie_utf8, trie_utf8_fold, trie_latin_utf8_fold } \
1168 trie_type = (scan->flags != EXACT) \
1169 ? (utf8_target ? trie_utf8_fold : (UTF_PATTERN ? trie_latin_utf8_fold : trie_plain)) \
1170 : (utf8_target ? trie_utf8 : trie_plain)
1172 #define REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc, uscan, len, \
1173 uvc, charid, foldlen, foldbuf, uniflags) STMT_START { \
1174 switch (trie_type) { \
1175 case trie_utf8_fold: \
1176 if ( foldlen>0 ) { \
1177 uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
1182 uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
1183 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1184 foldlen -= UNISKIP( uvc ); \
1185 uscan = foldbuf + UNISKIP( uvc ); \
1188 case trie_latin_utf8_fold: \
1189 if ( foldlen>0 ) { \
1190 uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
1196 uvc = to_uni_fold( *(U8*)uc, foldbuf, &foldlen ); \
1197 foldlen -= UNISKIP( uvc ); \
1198 uscan = foldbuf + UNISKIP( uvc ); \
1202 uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
1209 charid = trie->charmap[ uvc ]; \
1213 if (widecharmap) { \
1214 SV** const svpp = hv_fetch(widecharmap, \
1215 (char*)&uvc, sizeof(UV), 0); \
1217 charid = (U16)SvIV(*svpp); \
1222 #define REXEC_FBC_EXACTISH_CHECK(CoNd) \
1224 char *my_strend= (char *)strend; \
1227 foldEQ_utf8(s, &my_strend, 0, utf8_target, \
1228 m, NULL, ln, cBOOL(UTF_PATTERN))) \
1229 && (!reginfo || regtry(reginfo, &s)) ) \
1232 U8 foldbuf[UTF8_MAXBYTES_CASE+1]; \
1233 uvchr_to_utf8(tmpbuf, c); \
1234 f = to_utf8_fold(tmpbuf, foldbuf, &foldlen); \
1236 && (f == c1 || f == c2) \
1238 foldEQ_utf8(s, &my_strend, 0, utf8_target,\
1239 m, NULL, ln, cBOOL(UTF_PATTERN)))\
1240 && (!reginfo || regtry(reginfo, &s)) ) \
1246 #define REXEC_FBC_EXACTISH_SCAN(CoNd) \
1250 case EXACTFU: folder = foldEQ_latin1; break; \
1251 case EXACTFL: folder = foldEQ_locale; break; \
1252 case EXACTF: folder = foldEQ; break; \
1254 Perl_croak(aTHX_ "panic: Unexpected op %u", OP(c)); \
1258 && (ln == 1 || folder(s, m, ln)) \
1259 && (!reginfo || regtry(reginfo, &s)) ) \
1265 #define REXEC_FBC_UTF8_SCAN(CoDe) \
1267 while (s + (uskip = UTF8SKIP(s)) <= strend) { \
1273 #define REXEC_FBC_SCAN(CoDe) \
1275 while (s < strend) { \
1281 #define REXEC_FBC_UTF8_CLASS_SCAN(CoNd) \
1282 REXEC_FBC_UTF8_SCAN( \
1284 if (tmp && (!reginfo || regtry(reginfo, &s))) \
1293 #define REXEC_FBC_CLASS_SCAN(CoNd) \
1296 if (tmp && (!reginfo || regtry(reginfo, &s))) \
1305 #define REXEC_FBC_TRYIT \
1306 if ((!reginfo || regtry(reginfo, &s))) \
1309 #define REXEC_FBC_CSCAN(CoNdUtF8,CoNd) \
1310 if (utf8_target) { \
1311 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1314 REXEC_FBC_CLASS_SCAN(CoNd); \
1318 #define REXEC_FBC_CSCAN_PRELOAD(UtFpReLoAd,CoNdUtF8,CoNd) \
1319 if (utf8_target) { \
1321 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1324 REXEC_FBC_CLASS_SCAN(CoNd); \
1328 #define REXEC_FBC_CSCAN_TAINT(CoNdUtF8,CoNd) \
1329 PL_reg_flags |= RF_tainted; \
1330 if (utf8_target) { \
1331 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1334 REXEC_FBC_CLASS_SCAN(CoNd); \
1338 #define DUMP_EXEC_POS(li,s,doutf8) \
1339 dump_exec_pos(li,s,(PL_regeol),(PL_bostr),(PL_reg_starttry),doutf8)
1341 /* We know what class REx starts with. Try to find this position... */
1342 /* if reginfo is NULL, its a dryrun */
1343 /* annoyingly all the vars in this routine have different names from their counterparts
1344 in regmatch. /grrr */
1347 S_find_byclass(pTHX_ regexp * prog, const regnode *c, char *s,
1348 const char *strend, regmatch_info *reginfo)
1351 const I32 doevery = (prog->intflags & PREGf_SKIP) == 0;
1355 register STRLEN uskip;
1359 register I32 tmp = 1; /* Scratch variable? */
1360 register const bool utf8_target = PL_reg_match_utf8;
1361 RXi_GET_DECL(prog,progi);
1363 PERL_ARGS_ASSERT_FIND_BYCLASS;
1365 /* We know what class it must start with. */
1369 REXEC_FBC_UTF8_CLASS_SCAN((ANYOF_FLAGS(c) & ANYOF_NONBITMAP) ||
1370 !UTF8_IS_INVARIANT((U8)s[0]) ?
1371 reginclass(prog, c, (U8*)s, 0, utf8_target) :
1372 REGINCLASS(prog, c, (U8*)s));
1375 while (s < strend) {
1378 if (REGINCLASS(prog, c, (U8*)s) ||
1379 (ANYOF_FOLD_SHARP_S(c, s, strend) &&
1380 /* The assignment of 2 is intentional:
1381 * for the folded sharp s, the skip is 2. */
1382 (skip = SHARP_S_SKIP))) {
1383 if (tmp && (!reginfo || regtry(reginfo, &s)))
1396 if (tmp && (!reginfo || regtry(reginfo, &s)))
1405 ln = STR_LEN(c); /* length to match in octets/bytes */
1406 lnc = (I32) ln; /* length to match in characters */
1408 STRLEN ulen1, ulen2;
1410 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
1411 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
1412 /* used by commented-out code below */
1413 /*const U32 uniflags = UTF8_ALLOW_DEFAULT;*/
1415 /* XXX: Since the node will be case folded at compile
1416 time this logic is a little odd, although im not
1417 sure that its actually wrong. --dmq */
1419 c1 = to_utf8_lower((U8*)m, tmpbuf1, &ulen1);
1420 c2 = to_utf8_upper((U8*)m, tmpbuf2, &ulen2);
1422 /* XXX: This is kinda strange. to_utf8_XYZ returns the
1423 codepoint of the first character in the converted
1424 form, yet originally we did the extra step.
1425 No tests fail by commenting this code out however
1426 so Ive left it out. -- dmq.
1428 c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXBYTES_CASE,
1430 c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXBYTES_CASE,
1435 while (sm < ((U8 *) m + ln)) {
1442 if (utf8_target || OP(c) == EXACTFU) {
1444 /* Micro sign folds to GREEK SMALL LETTER MU;
1445 LATIN_SMALL_LETTER_SHARP_S folds to 'ss', and this sets
1446 c2 to the first 's' of the pair, and the code below will
1448 c2 = (c1 == MICRO_SIGN)
1449 ? GREEK_SMALL_LETTER_MU
1450 : (c1 == LATIN_SMALL_LETTER_SHARP_S)
1452 : PL_fold_latin1[c1];
1453 } else c2 = PL_fold[c1];
1461 c2 = PL_fold_locale[c1];
1463 e = HOP3c(strend, -((I32)lnc), s);
1465 if (!reginfo && e < s)
1466 e = s; /* Due to minlen logic of intuit() */
1468 /* The idea in the EXACTF* cases is to first find the
1469 * first character of the EXACTF* node and then, if
1470 * necessary, case-insensitively compare the full
1471 * text of the node. The c1 and c2 are the first
1472 * characters (though in Unicode it gets a bit
1473 * more complicated because there are more cases
1474 * than just upper and lower: one needs to use
1475 * the so-called folding case for case-insensitive
1476 * matching (called "loose matching" in Unicode).
1477 * foldEQ_utf8() will do just that. */
1479 if (utf8_target || UTF_PATTERN) {
1481 U8 tmpbuf [UTF8_MAXBYTES+1];
1484 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1486 /* Upper and lower of 1st char are equal -
1487 * probably not a "letter". */
1490 c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len,
1495 REXEC_FBC_EXACTISH_CHECK(c == c1);
1501 c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len,
1507 /* Handle some of the three Greek sigmas cases.
1508 * Note that not all the possible combinations
1509 * are handled here: some of them are handled
1510 * by the standard folding rules, and some of
1511 * them (the character class or ANYOF cases)
1512 * are handled during compiletime in
1513 * regexec.c:S_regclass(). */
1514 if (c == (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA ||
1515 c == (UV)UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA)
1516 c = (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA;
1518 REXEC_FBC_EXACTISH_CHECK(c == c1 || c == c2);
1523 /* Neither pattern nor string are UTF8 */
1525 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1);
1527 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1 || *(U8*)s == c2);
1531 PL_reg_flags |= RF_tainted;
1538 U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr);
1539 tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT);
1541 tmp = ((OP(c) == BOUND ?
1542 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
1543 LOAD_UTF8_CHARCLASS_ALNUM();
1544 REXEC_FBC_UTF8_SCAN(
1545 if (tmp == !(OP(c) == BOUND ?
1546 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)) :
1547 isALNUM_LC_utf8((U8*)s)))
1554 else { /* Not utf8 */
1555 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1556 tmp = cBOOL((OP(c) == BOUNDL)
1558 : (isWORDCHAR_L1(tmp)
1559 && (isASCII(tmp) || (FLAGS(c) & USE_UNI))));
1564 : (isWORDCHAR_L1((U8) *s)
1565 && (isASCII((U8) *s) || (FLAGS(c) & USE_UNI)))))
1572 if ((!prog->minlen && tmp) && (!reginfo || regtry(reginfo, &s)))
1576 PL_reg_flags |= RF_tainted;
1583 U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr);
1584 tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT);
1586 tmp = ((OP(c) == NBOUND ?
1587 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
1588 LOAD_UTF8_CHARCLASS_ALNUM();
1589 REXEC_FBC_UTF8_SCAN(
1590 if (tmp == !(OP(c) == NBOUND ?
1591 cBOOL(swash_fetch(PL_utf8_alnum, (U8*)s, utf8_target)) :
1592 isALNUM_LC_utf8((U8*)s)))
1594 else REXEC_FBC_TRYIT;
1598 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1599 tmp = cBOOL((OP(c) == NBOUNDL)
1601 : (isWORDCHAR_L1(tmp)
1602 && (isASCII(tmp) || (FLAGS(c) & USE_UNI))));
1607 : (isWORDCHAR_L1((U8) *s)
1608 && (isASCII((U8) *s) || (FLAGS(c) & USE_UNI)))))
1612 else REXEC_FBC_TRYIT;
1615 if ((!prog->minlen && !tmp) && (!reginfo || regtry(reginfo, &s)))
1619 REXEC_FBC_CSCAN_PRELOAD(
1620 LOAD_UTF8_CHARCLASS_PERL_WORD(),
1621 swash_fetch(RE_utf8_perl_word, (U8*)s, utf8_target),
1622 (FLAGS(c) & USE_UNI) ? isWORDCHAR_L1((U8) *s) : isALNUM(*s)
1625 REXEC_FBC_CSCAN_TAINT(
1626 isALNUM_LC_utf8((U8*)s),
1630 REXEC_FBC_CSCAN_PRELOAD(
1631 LOAD_UTF8_CHARCLASS_PERL_WORD(),
1632 !swash_fetch(RE_utf8_perl_word, (U8*)s, utf8_target),
1633 ! ((FLAGS(c) & USE_UNI) ? isWORDCHAR_L1((U8) *s) : isALNUM(*s))
1636 REXEC_FBC_CSCAN_TAINT(
1637 !isALNUM_LC_utf8((U8*)s),
1641 REXEC_FBC_CSCAN_PRELOAD(
1642 LOAD_UTF8_CHARCLASS_PERL_SPACE(),
1643 *s == ' ' || swash_fetch(RE_utf8_perl_space,(U8*)s, utf8_target),
1644 isSPACE_L1((U8) *s) && (isASCII((U8) *s) || (FLAGS(c) & USE_UNI))
1647 REXEC_FBC_CSCAN_TAINT(
1648 isSPACE_LC_utf8((U8*)s),
1652 REXEC_FBC_CSCAN_PRELOAD(
1653 LOAD_UTF8_CHARCLASS_PERL_SPACE(),
1654 !(*s == ' ' || swash_fetch(RE_utf8_perl_space,(U8*)s, utf8_target)),
1655 !(isSPACE_L1((U8) *s) && (isASCII((U8) *s) || (FLAGS(c) & USE_UNI)))
1658 REXEC_FBC_CSCAN_TAINT(
1659 !isSPACE_LC_utf8((U8*)s),
1663 REXEC_FBC_CSCAN_PRELOAD(
1664 LOAD_UTF8_CHARCLASS_POSIX_DIGIT(),
1665 swash_fetch(RE_utf8_posix_digit,(U8*)s, utf8_target),
1669 REXEC_FBC_CSCAN_TAINT(
1670 isDIGIT_LC_utf8((U8*)s),
1674 REXEC_FBC_CSCAN_PRELOAD(
1675 LOAD_UTF8_CHARCLASS_POSIX_DIGIT(),
1676 !swash_fetch(RE_utf8_posix_digit,(U8*)s, utf8_target),
1680 REXEC_FBC_CSCAN_TAINT(
1681 !isDIGIT_LC_utf8((U8*)s),
1687 is_LNBREAK_latin1(s)
1697 !is_VERTWS_latin1(s)
1702 is_HORIZWS_latin1(s)
1706 !is_HORIZWS_utf8(s),
1707 !is_HORIZWS_latin1(s)
1713 /* what trie are we using right now */
1715 = (reg_ac_data*)progi->data->data[ ARG( c ) ];
1717 = (reg_trie_data*)progi->data->data[ aho->trie ];
1718 HV *widecharmap = MUTABLE_HV(progi->data->data[ aho->trie + 1 ]);
1720 const char *last_start = strend - trie->minlen;
1722 const char *real_start = s;
1724 STRLEN maxlen = trie->maxlen;
1726 U8 **points; /* map of where we were in the input string
1727 when reading a given char. For ASCII this
1728 is unnecessary overhead as the relationship
1729 is always 1:1, but for Unicode, especially
1730 case folded Unicode this is not true. */
1731 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1735 GET_RE_DEBUG_FLAGS_DECL;
1737 /* We can't just allocate points here. We need to wrap it in
1738 * an SV so it gets freed properly if there is a croak while
1739 * running the match */
1742 sv_points=newSV(maxlen * sizeof(U8 *));
1743 SvCUR_set(sv_points,
1744 maxlen * sizeof(U8 *));
1745 SvPOK_on(sv_points);
1746 sv_2mortal(sv_points);
1747 points=(U8**)SvPV_nolen(sv_points );
1748 if ( trie_type != trie_utf8_fold
1749 && (trie->bitmap || OP(c)==AHOCORASICKC) )
1752 bitmap=(U8*)trie->bitmap;
1754 bitmap=(U8*)ANYOF_BITMAP(c);
1756 /* this is the Aho-Corasick algorithm modified a touch
1757 to include special handling for long "unknown char"
1758 sequences. The basic idea being that we use AC as long
1759 as we are dealing with a possible matching char, when
1760 we encounter an unknown char (and we have not encountered
1761 an accepting state) we scan forward until we find a legal
1763 AC matching is basically that of trie matching, except
1764 that when we encounter a failing transition, we fall back
1765 to the current states "fail state", and try the current char
1766 again, a process we repeat until we reach the root state,
1767 state 1, or a legal transition. If we fail on the root state
1768 then we can either terminate if we have reached an accepting
1769 state previously, or restart the entire process from the beginning
1773 while (s <= last_start) {
1774 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1782 U8 *uscan = (U8*)NULL;
1783 U8 *leftmost = NULL;
1785 U32 accepted_word= 0;
1789 while ( state && uc <= (U8*)strend ) {
1791 U32 word = aho->states[ state ].wordnum;
1795 DEBUG_TRIE_EXECUTE_r(
1796 if ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1797 dump_exec_pos( (char *)uc, c, strend, real_start,
1798 (char *)uc, utf8_target );
1799 PerlIO_printf( Perl_debug_log,
1800 " Scanning for legal start char...\n");
1804 while ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1808 while ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1814 if (uc >(U8*)last_start) break;
1818 U8 *lpos= points[ (pointpos - trie->wordinfo[word].len) % maxlen ];
1819 if (!leftmost || lpos < leftmost) {
1820 DEBUG_r(accepted_word=word);
1826 points[pointpos++ % maxlen]= uc;
1827 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
1828 uscan, len, uvc, charid, foldlen,
1830 DEBUG_TRIE_EXECUTE_r({
1831 dump_exec_pos( (char *)uc, c, strend, real_start,
1833 PerlIO_printf(Perl_debug_log,
1834 " Charid:%3u CP:%4"UVxf" ",
1840 word = aho->states[ state ].wordnum;
1842 base = aho->states[ state ].trans.base;
1844 DEBUG_TRIE_EXECUTE_r({
1846 dump_exec_pos( (char *)uc, c, strend, real_start,
1848 PerlIO_printf( Perl_debug_log,
1849 "%sState: %4"UVxf", word=%"UVxf,
1850 failed ? " Fail transition to " : "",
1851 (UV)state, (UV)word);
1857 ( ((offset = base + charid
1858 - 1 - trie->uniquecharcount)) >= 0)
1859 && ((U32)offset < trie->lasttrans)
1860 && trie->trans[offset].check == state
1861 && (tmp=trie->trans[offset].next))
1863 DEBUG_TRIE_EXECUTE_r(
1864 PerlIO_printf( Perl_debug_log," - legal\n"));
1869 DEBUG_TRIE_EXECUTE_r(
1870 PerlIO_printf( Perl_debug_log," - fail\n"));
1872 state = aho->fail[state];
1876 /* we must be accepting here */
1877 DEBUG_TRIE_EXECUTE_r(
1878 PerlIO_printf( Perl_debug_log," - accepting\n"));
1887 if (!state) state = 1;
1890 if ( aho->states[ state ].wordnum ) {
1891 U8 *lpos = points[ (pointpos - trie->wordinfo[aho->states[ state ].wordnum].len) % maxlen ];
1892 if (!leftmost || lpos < leftmost) {
1893 DEBUG_r(accepted_word=aho->states[ state ].wordnum);
1898 s = (char*)leftmost;
1899 DEBUG_TRIE_EXECUTE_r({
1901 Perl_debug_log,"Matches word #%"UVxf" at position %"IVdf". Trying full pattern...\n",
1902 (UV)accepted_word, (IV)(s - real_start)
1905 if (!reginfo || regtry(reginfo, &s)) {
1911 DEBUG_TRIE_EXECUTE_r({
1912 PerlIO_printf( Perl_debug_log,"Pattern failed. Looking for new start point...\n");
1915 DEBUG_TRIE_EXECUTE_r(
1916 PerlIO_printf( Perl_debug_log,"No match.\n"));
1925 Perl_croak(aTHX_ "panic: unknown regstclass %d", (int)OP(c));
1935 - regexec_flags - match a regexp against a string
1938 Perl_regexec_flags(pTHX_ REGEXP * const rx, char *stringarg, register char *strend,
1939 char *strbeg, I32 minend, SV *sv, void *data, U32 flags)
1940 /* strend: pointer to null at end of string */
1941 /* strbeg: real beginning of string */
1942 /* minend: end of match must be >=minend after stringarg. */
1943 /* data: May be used for some additional optimizations.
1944 Currently its only used, with a U32 cast, for transmitting
1945 the ganch offset when doing a /g match. This will change */
1946 /* nosave: For optimizations. */
1949 struct regexp *const prog = (struct regexp *)SvANY(rx);
1950 /*register*/ char *s;
1951 register regnode *c;
1952 /*register*/ char *startpos = stringarg;
1953 I32 minlen; /* must match at least this many chars */
1954 I32 dontbother = 0; /* how many characters not to try at end */
1955 I32 end_shift = 0; /* Same for the end. */ /* CC */
1956 I32 scream_pos = -1; /* Internal iterator of scream. */
1957 char *scream_olds = NULL;
1958 const bool utf8_target = cBOOL(DO_UTF8(sv));
1960 RXi_GET_DECL(prog,progi);
1961 regmatch_info reginfo; /* create some info to pass to regtry etc */
1962 regexp_paren_pair *swap = NULL;
1963 GET_RE_DEBUG_FLAGS_DECL;
1965 PERL_ARGS_ASSERT_REGEXEC_FLAGS;
1966 PERL_UNUSED_ARG(data);
1968 /* Be paranoid... */
1969 if (prog == NULL || startpos == NULL) {
1970 Perl_croak(aTHX_ "NULL regexp parameter");
1974 multiline = prog->extflags & RXf_PMf_MULTILINE;
1975 reginfo.prog = rx; /* Yes, sorry that this is confusing. */
1977 RX_MATCH_UTF8_set(rx, utf8_target);
1979 debug_start_match(rx, utf8_target, startpos, strend,
1983 minlen = prog->minlen;
1985 if (strend - startpos < (minlen+(prog->check_offset_min<0?prog->check_offset_min:0))) {
1986 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
1987 "String too short [regexec_flags]...\n"));
1992 /* Check validity of program. */
1993 if (UCHARAT(progi->program) != REG_MAGIC) {
1994 Perl_croak(aTHX_ "corrupted regexp program");
1998 PL_reg_eval_set = 0;
2002 PL_reg_flags |= RF_utf8;
2004 /* Mark beginning of line for ^ and lookbehind. */
2005 reginfo.bol = startpos; /* XXX not used ??? */
2009 /* Mark end of line for $ (and such) */
2012 /* see how far we have to get to not match where we matched before */
2013 reginfo.till = startpos+minend;
2015 /* If there is a "must appear" string, look for it. */
2018 if (prog->extflags & RXf_GPOS_SEEN) { /* Need to set reginfo->ganch */
2020 if (flags & REXEC_IGNOREPOS){ /* Means: check only at start */
2021 reginfo.ganch = startpos + prog->gofs;
2022 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2023 "GPOS IGNOREPOS: reginfo.ganch = startpos + %"UVxf"\n",(UV)prog->gofs));
2024 } else if (sv && SvTYPE(sv) >= SVt_PVMG
2026 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
2027 && mg->mg_len >= 0) {
2028 reginfo.ganch = strbeg + mg->mg_len; /* Defined pos() */
2029 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2030 "GPOS MAGIC: reginfo.ganch = strbeg + %"IVdf"\n",(IV)mg->mg_len));
2032 if (prog->extflags & RXf_ANCH_GPOS) {
2033 if (s > reginfo.ganch)
2035 s = reginfo.ganch - prog->gofs;
2036 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2037 "GPOS ANCH_GPOS: s = ganch - %"UVxf"\n",(UV)prog->gofs));
2043 reginfo.ganch = strbeg + PTR2UV(data);
2044 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2045 "GPOS DATA: reginfo.ganch= strbeg + %"UVxf"\n",PTR2UV(data)));
2047 } else { /* pos() not defined */
2048 reginfo.ganch = strbeg;
2049 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
2050 "GPOS: reginfo.ganch = strbeg\n"));
2053 if (PL_curpm && (PM_GETRE(PL_curpm) == rx)) {
2054 /* We have to be careful. If the previous successful match
2055 was from this regex we don't want a subsequent partially
2056 successful match to clobber the old results.
2057 So when we detect this possibility we add a swap buffer
2058 to the re, and switch the buffer each match. If we fail
2059 we switch it back, otherwise we leave it swapped.
2062 /* do we need a save destructor here for eval dies? */
2063 Newxz(prog->offs, (prog->nparens + 1), regexp_paren_pair);
2065 if (!(flags & REXEC_CHECKED) && (prog->check_substr != NULL || prog->check_utf8 != NULL)) {
2066 re_scream_pos_data d;
2068 d.scream_olds = &scream_olds;
2069 d.scream_pos = &scream_pos;
2070 s = re_intuit_start(rx, sv, s, strend, flags, &d);
2072 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not present...\n"));
2073 goto phooey; /* not present */
2079 /* Simplest case: anchored match need be tried only once. */
2080 /* [unless only anchor is BOL and multiline is set] */
2081 if (prog->extflags & (RXf_ANCH & ~RXf_ANCH_GPOS)) {
2082 if (s == startpos && regtry(®info, &startpos))
2084 else if (multiline || (prog->intflags & PREGf_IMPLICIT)
2085 || (prog->extflags & RXf_ANCH_MBOL)) /* XXXX SBOL? */
2090 dontbother = minlen - 1;
2091 end = HOP3c(strend, -dontbother, strbeg) - 1;
2092 /* for multiline we only have to try after newlines */
2093 if (prog->check_substr || prog->check_utf8) {
2094 /* because of the goto we can not easily reuse the macros for bifurcating the
2095 unicode/non-unicode match modes here like we do elsewhere - demerphq */
2098 goto after_try_utf8;
2100 if (regtry(®info, &s)) {
2107 if (prog->extflags & RXf_USE_INTUIT) {
2108 s = re_intuit_start(rx, sv, s + UTF8SKIP(s), strend, flags, NULL);
2117 } /* end search for check string in unicode */
2119 if (s == startpos) {
2120 goto after_try_latin;
2123 if (regtry(®info, &s)) {
2130 if (prog->extflags & RXf_USE_INTUIT) {
2131 s = re_intuit_start(rx, sv, s + 1, strend, flags, NULL);
2140 } /* end search for check string in latin*/
2141 } /* end search for check string */
2142 else { /* search for newline */
2144 /*XXX: The s-- is almost definitely wrong here under unicode - demeprhq*/
2147 /* We can use a more efficient search as newlines are the same in unicode as they are in latin */
2149 if (*s++ == '\n') { /* don't need PL_utf8skip here */
2150 if (regtry(®info, &s))
2154 } /* end search for newline */
2155 } /* end anchored/multiline check string search */
2157 } else if (RXf_GPOS_CHECK == (prog->extflags & RXf_GPOS_CHECK))
2159 /* the warning about reginfo.ganch being used without initialization
2160 is bogus -- we set it above, when prog->extflags & RXf_GPOS_SEEN
2161 and we only enter this block when the same bit is set. */
2162 char *tmp_s = reginfo.ganch - prog->gofs;
2164 if (tmp_s >= strbeg && regtry(®info, &tmp_s))
2169 /* Messy cases: unanchored match. */
2170 if ((prog->anchored_substr || prog->anchored_utf8) && prog->intflags & PREGf_SKIP) {
2171 /* we have /x+whatever/ */
2172 /* it must be a one character string (XXXX Except UTF_PATTERN?) */
2177 if (!(utf8_target ? prog->anchored_utf8 : prog->anchored_substr))
2178 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2179 ch = SvPVX_const(utf8_target ? prog->anchored_utf8 : prog->anchored_substr)[0];
2184 DEBUG_EXECUTE_r( did_match = 1 );
2185 if (regtry(®info, &s)) goto got_it;
2187 while (s < strend && *s == ch)
2195 DEBUG_EXECUTE_r( did_match = 1 );
2196 if (regtry(®info, &s)) goto got_it;
2198 while (s < strend && *s == ch)
2203 DEBUG_EXECUTE_r(if (!did_match)
2204 PerlIO_printf(Perl_debug_log,
2205 "Did not find anchored character...\n")
2208 else if (prog->anchored_substr != NULL
2209 || prog->anchored_utf8 != NULL
2210 || ((prog->float_substr != NULL || prog->float_utf8 != NULL)
2211 && prog->float_max_offset < strend - s)) {
2216 char *last1; /* Last position checked before */
2220 if (prog->anchored_substr || prog->anchored_utf8) {
2221 if (!(utf8_target ? prog->anchored_utf8 : prog->anchored_substr))
2222 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2223 must = utf8_target ? prog->anchored_utf8 : prog->anchored_substr;
2224 back_max = back_min = prog->anchored_offset;
2226 if (!(utf8_target ? prog->float_utf8 : prog->float_substr))
2227 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2228 must = utf8_target ? prog->float_utf8 : prog->float_substr;
2229 back_max = prog->float_max_offset;
2230 back_min = prog->float_min_offset;
2234 if (must == &PL_sv_undef)
2235 /* could not downgrade utf8 check substring, so must fail */
2241 last = HOP3c(strend, /* Cannot start after this */
2242 -(I32)(CHR_SVLEN(must)
2243 - (SvTAIL(must) != 0) + back_min), strbeg);
2246 last1 = HOPc(s, -1);
2248 last1 = s - 1; /* bogus */
2250 /* XXXX check_substr already used to find "s", can optimize if
2251 check_substr==must. */
2253 dontbother = end_shift;
2254 strend = HOPc(strend, -dontbother);
2255 while ( (s <= last) &&
2256 ((flags & REXEC_SCREAM)
2257 ? (s = screaminstr(sv, must, HOP3c(s, back_min, (back_min<0 ? strbeg : strend)) - strbeg,
2258 end_shift, &scream_pos, 0))
2259 : (s = fbm_instr((unsigned char*)HOP3(s, back_min, (back_min<0 ? strbeg : strend)),
2260 (unsigned char*)strend, must,
2261 multiline ? FBMrf_MULTILINE : 0))) ) {
2262 /* we may be pointing at the wrong string */
2263 if ((flags & REXEC_SCREAM) && RXp_MATCH_COPIED(prog))
2264 s = strbeg + (s - SvPVX_const(sv));
2265 DEBUG_EXECUTE_r( did_match = 1 );
2266 if (HOPc(s, -back_max) > last1) {
2267 last1 = HOPc(s, -back_min);
2268 s = HOPc(s, -back_max);
2271 char * const t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1;
2273 last1 = HOPc(s, -back_min);
2277 while (s <= last1) {
2278 if (regtry(®info, &s))
2284 while (s <= last1) {
2285 if (regtry(®info, &s))
2291 DEBUG_EXECUTE_r(if (!did_match) {
2292 RE_PV_QUOTED_DECL(quoted, utf8_target, PERL_DEBUG_PAD_ZERO(0),
2293 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
2294 PerlIO_printf(Perl_debug_log, "Did not find %s substr %s%s...\n",
2295 ((must == prog->anchored_substr || must == prog->anchored_utf8)
2296 ? "anchored" : "floating"),
2297 quoted, RE_SV_TAIL(must));
2301 else if ( (c = progi->regstclass) ) {
2303 const OPCODE op = OP(progi->regstclass);
2304 /* don't bother with what can't match */
2305 if (PL_regkind[op] != EXACT && op != CANY && PL_regkind[op] != TRIE)
2306 strend = HOPc(strend, -(minlen - 1));
2309 SV * const prop = sv_newmortal();
2310 regprop(prog, prop, c);
2312 RE_PV_QUOTED_DECL(quoted,utf8_target,PERL_DEBUG_PAD_ZERO(1),
2314 PerlIO_printf(Perl_debug_log,
2315 "Matching stclass %.*s against %s (%d bytes)\n",
2316 (int)SvCUR(prop), SvPVX_const(prop),
2317 quoted, (int)(strend - s));
2320 if (find_byclass(prog, c, s, strend, ®info))
2322 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass... [regexec_flags]\n"));
2326 if (prog->float_substr != NULL || prog->float_utf8 != NULL) {
2331 if (!(utf8_target ? prog->float_utf8 : prog->float_substr))
2332 utf8_target ? to_utf8_substr(prog) : to_byte_substr(prog);
2333 float_real = utf8_target ? prog->float_utf8 : prog->float_substr;
2335 if (flags & REXEC_SCREAM) {
2336 last = screaminstr(sv, float_real, s - strbeg,
2337 end_shift, &scream_pos, 1); /* last one */
2339 last = scream_olds; /* Only one occurrence. */
2340 /* we may be pointing at the wrong string */
2341 else if (RXp_MATCH_COPIED(prog))
2342 s = strbeg + (s - SvPVX_const(sv));
2346 const char * const little = SvPV_const(float_real, len);
2348 if (SvTAIL(float_real)) {
2349 if (memEQ(strend - len + 1, little, len - 1))
2350 last = strend - len + 1;
2351 else if (!multiline)
2352 last = memEQ(strend - len, little, len)
2353 ? strend - len : NULL;
2359 last = rninstr(s, strend, little, little + len);
2361 last = strend; /* matching "$" */
2366 PerlIO_printf(Perl_debug_log,
2367 "%sCan't trim the tail, match fails (should not happen)%s\n",
2368 PL_colors[4], PL_colors[5]));
2369 goto phooey; /* Should not happen! */
2371 dontbother = strend - last + prog->float_min_offset;
2373 if (minlen && (dontbother < minlen))
2374 dontbother = minlen - 1;
2375 strend -= dontbother; /* this one's always in bytes! */
2376 /* We don't know much -- general case. */
2379 if (regtry(®info, &s))
2388 if (regtry(®info, &s))
2390 } while (s++ < strend);
2399 RX_MATCH_TAINTED_set(rx, PL_reg_flags & RF_tainted);
2401 if (PL_reg_eval_set)
2402 restore_pos(aTHX_ prog);
2403 if (RXp_PAREN_NAMES(prog))
2404 (void)hv_iterinit(RXp_PAREN_NAMES(prog));
2406 /* make sure $`, $&, $', and $digit will work later */
2407 if ( !(flags & REXEC_NOT_FIRST) ) {
2408 RX_MATCH_COPY_FREE(rx);
2409 if (flags & REXEC_COPY_STR) {
2410 const I32 i = PL_regeol - startpos + (stringarg - strbeg);
2411 #ifdef PERL_OLD_COPY_ON_WRITE
2413 || (SvFLAGS(sv) & CAN_COW_MASK) == CAN_COW_FLAGS)) {
2415 PerlIO_printf(Perl_debug_log,
2416 "Copy on write: regexp capture, type %d\n",
2419 prog->saved_copy = sv_setsv_cow(prog->saved_copy, sv);
2420 prog->subbeg = (char *)SvPVX_const(prog->saved_copy);
2421 assert (SvPOKp(prog->saved_copy));
2425 RX_MATCH_COPIED_on(rx);
2426 s = savepvn(strbeg, i);
2432 prog->subbeg = strbeg;
2433 prog->sublen = PL_regeol - strbeg; /* strend may have been modified */
2440 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n",
2441 PL_colors[4], PL_colors[5]));
2442 if (PL_reg_eval_set)
2443 restore_pos(aTHX_ prog);
2445 /* we failed :-( roll it back */
2446 Safefree(prog->offs);
2455 - regtry - try match at specific point
2457 STATIC I32 /* 0 failure, 1 success */
2458 S_regtry(pTHX_ regmatch_info *reginfo, char **startpos)
2462 REGEXP *const rx = reginfo->prog;
2463 regexp *const prog = (struct regexp *)SvANY(rx);
2464 RXi_GET_DECL(prog,progi);
2465 GET_RE_DEBUG_FLAGS_DECL;
2467 PERL_ARGS_ASSERT_REGTRY;
2469 reginfo->cutpoint=NULL;
2471 if ((prog->extflags & RXf_EVAL_SEEN) && !PL_reg_eval_set) {
2474 PL_reg_eval_set = RS_init;
2475 DEBUG_EXECUTE_r(DEBUG_s(
2476 PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n",
2477 (IV)(PL_stack_sp - PL_stack_base));
2480 cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base;
2481 /* Otherwise OP_NEXTSTATE will free whatever on stack now. */
2483 /* Apparently this is not needed, judging by wantarray. */
2484 /* SAVEI8(cxstack[cxstack_ix].blk_gimme);
2485 cxstack[cxstack_ix].blk_gimme = G_SCALAR; */
2488 /* Make $_ available to executed code. */
2489 if (reginfo->sv != DEFSV) {
2491 DEFSV_set(reginfo->sv);
2494 if (!(SvTYPE(reginfo->sv) >= SVt_PVMG && SvMAGIC(reginfo->sv)
2495 && (mg = mg_find(reginfo->sv, PERL_MAGIC_regex_global)))) {
2496 /* prepare for quick setting of pos */
2497 #ifdef PERL_OLD_COPY_ON_WRITE
2498 if (SvIsCOW(reginfo->sv))
2499 sv_force_normal_flags(reginfo->sv, 0);
2501 mg = sv_magicext(reginfo->sv, NULL, PERL_MAGIC_regex_global,
2502 &PL_vtbl_mglob, NULL, 0);
2506 PL_reg_oldpos = mg->mg_len;
2507 SAVEDESTRUCTOR_X(restore_pos, prog);
2509 if (!PL_reg_curpm) {
2510 Newxz(PL_reg_curpm, 1, PMOP);
2513 SV* const repointer = &PL_sv_undef;
2514 /* this regexp is also owned by the new PL_reg_curpm, which
2515 will try to free it. */
2516 av_push(PL_regex_padav, repointer);
2517 PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav);
2518 PL_regex_pad = AvARRAY(PL_regex_padav);
2523 /* It seems that non-ithreads works both with and without this code.
2524 So for efficiency reasons it seems best not to have the code
2525 compiled when it is not needed. */
2526 /* This is safe against NULLs: */
2527 ReREFCNT_dec(PM_GETRE(PL_reg_curpm));
2528 /* PM_reg_curpm owns a reference to this regexp. */
2531 PM_SETRE(PL_reg_curpm, rx);
2532 PL_reg_oldcurpm = PL_curpm;
2533 PL_curpm = PL_reg_curpm;
2534 if (RXp_MATCH_COPIED(prog)) {
2535 /* Here is a serious problem: we cannot rewrite subbeg,
2536 since it may be needed if this match fails. Thus
2537 $` inside (?{}) could fail... */
2538 PL_reg_oldsaved = prog->subbeg;
2539 PL_reg_oldsavedlen = prog->sublen;
2540 #ifdef PERL_OLD_COPY_ON_WRITE
2541 PL_nrs = prog->saved_copy;
2543 RXp_MATCH_COPIED_off(prog);
2546 PL_reg_oldsaved = NULL;
2547 prog->subbeg = PL_bostr;
2548 prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */
2550 DEBUG_EXECUTE_r(PL_reg_starttry = *startpos);
2551 prog->offs[0].start = *startpos - PL_bostr;
2552 PL_reginput = *startpos;
2553 PL_reglastparen = &prog->lastparen;
2554 PL_reglastcloseparen = &prog->lastcloseparen;
2555 prog->lastparen = 0;
2556 prog->lastcloseparen = 0;
2558 PL_regoffs = prog->offs;
2559 if (PL_reg_start_tmpl <= prog->nparens) {
2560 PL_reg_start_tmpl = prog->nparens*3/2 + 3;
2561 if(PL_reg_start_tmp)
2562 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2564 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2567 /* XXXX What this code is doing here?!!! There should be no need
2568 to do this again and again, PL_reglastparen should take care of
2571 /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code.
2572 * Actually, the code in regcppop() (which Ilya may be meaning by
2573 * PL_reglastparen), is not needed at all by the test suite
2574 * (op/regexp, op/pat, op/split), but that code is needed otherwise
2575 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
2576 * Meanwhile, this code *is* needed for the
2577 * above-mentioned test suite tests to succeed. The common theme
2578 * on those tests seems to be returning null fields from matches.
2579 * --jhi updated by dapm */
2581 if (prog->nparens) {
2582 regexp_paren_pair *pp = PL_regoffs;
2584 for (i = prog->nparens; i > (I32)*PL_reglastparen; i--) {
2592 if (regmatch(reginfo, progi->program + 1)) {
2593 PL_regoffs[0].end = PL_reginput - PL_bostr;
2596 if (reginfo->cutpoint)
2597 *startpos= reginfo->cutpoint;
2598 REGCP_UNWIND(lastcp);
2603 #define sayYES goto yes
2604 #define sayNO goto no
2605 #define sayNO_SILENT goto no_silent
2607 /* we dont use STMT_START/END here because it leads to
2608 "unreachable code" warnings, which are bogus, but distracting. */
2609 #define CACHEsayNO \
2610 if (ST.cache_mask) \
2611 PL_reg_poscache[ST.cache_offset] |= ST.cache_mask; \
2614 /* this is used to determine how far from the left messages like
2615 'failed...' are printed. It should be set such that messages
2616 are inline with the regop output that created them.
2618 #define REPORT_CODE_OFF 32
2621 #define CHRTEST_UNINIT -1001 /* c1/c2 haven't been calculated yet */
2622 #define CHRTEST_VOID -1000 /* the c1/c2 "next char" test should be skipped */
2624 #define SLAB_FIRST(s) (&(s)->states[0])
2625 #define SLAB_LAST(s) (&(s)->states[PERL_REGMATCH_SLAB_SLOTS-1])
2627 /* grab a new slab and return the first slot in it */
2629 STATIC regmatch_state *
2632 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2635 regmatch_slab *s = PL_regmatch_slab->next;
2637 Newx(s, 1, regmatch_slab);
2638 s->prev = PL_regmatch_slab;
2640 PL_regmatch_slab->next = s;
2642 PL_regmatch_slab = s;
2643 return SLAB_FIRST(s);
2647 /* push a new state then goto it */
2649 #define PUSH_STATE_GOTO(state, node) \
2651 st->resume_state = state; \
2654 /* push a new state with success backtracking, then goto it */
2656 #define PUSH_YES_STATE_GOTO(state, node) \
2658 st->resume_state = state; \
2659 goto push_yes_state;
2665 regmatch() - main matching routine
2667 This is basically one big switch statement in a loop. We execute an op,
2668 set 'next' to point the next op, and continue. If we come to a point which
2669 we may need to backtrack to on failure such as (A|B|C), we push a
2670 backtrack state onto the backtrack stack. On failure, we pop the top
2671 state, and re-enter the loop at the state indicated. If there are no more
2672 states to pop, we return failure.
2674 Sometimes we also need to backtrack on success; for example /A+/, where
2675 after successfully matching one A, we need to go back and try to
2676 match another one; similarly for lookahead assertions: if the assertion
2677 completes successfully, we backtrack to the state just before the assertion
2678 and then carry on. In these cases, the pushed state is marked as
2679 'backtrack on success too'. This marking is in fact done by a chain of
2680 pointers, each pointing to the previous 'yes' state. On success, we pop to
2681 the nearest yes state, discarding any intermediate failure-only states.
2682 Sometimes a yes state is pushed just to force some cleanup code to be
2683 called at the end of a successful match or submatch; e.g. (??{$re}) uses
2684 it to free the inner regex.
2686 Note that failure backtracking rewinds the cursor position, while
2687 success backtracking leaves it alone.
2689 A pattern is complete when the END op is executed, while a subpattern
2690 such as (?=foo) is complete when the SUCCESS op is executed. Both of these
2691 ops trigger the "pop to last yes state if any, otherwise return true"
2694 A common convention in this function is to use A and B to refer to the two
2695 subpatterns (or to the first nodes thereof) in patterns like /A*B/: so A is
2696 the subpattern to be matched possibly multiple times, while B is the entire
2697 rest of the pattern. Variable and state names reflect this convention.
2699 The states in the main switch are the union of ops and failure/success of
2700 substates associated with with that op. For example, IFMATCH is the op
2701 that does lookahead assertions /(?=A)B/ and so the IFMATCH state means
2702 'execute IFMATCH'; while IFMATCH_A is a state saying that we have just
2703 successfully matched A and IFMATCH_A_fail is a state saying that we have
2704 just failed to match A. Resume states always come in pairs. The backtrack
2705 state we push is marked as 'IFMATCH_A', but when that is popped, we resume
2706 at IFMATCH_A or IFMATCH_A_fail, depending on whether we are backtracking
2707 on success or failure.
2709 The struct that holds a backtracking state is actually a big union, with
2710 one variant for each major type of op. The variable st points to the
2711 top-most backtrack struct. To make the code clearer, within each
2712 block of code we #define ST to alias the relevant union.
2714 Here's a concrete example of a (vastly oversimplified) IFMATCH
2720 #define ST st->u.ifmatch
2722 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2723 ST.foo = ...; // some state we wish to save
2725 // push a yes backtrack state with a resume value of
2726 // IFMATCH_A/IFMATCH_A_fail, then continue execution at the
2728 PUSH_YES_STATE_GOTO(IFMATCH_A, A);
2731 case IFMATCH_A: // we have successfully executed A; now continue with B
2733 bar = ST.foo; // do something with the preserved value
2736 case IFMATCH_A_fail: // A failed, so the assertion failed
2737 ...; // do some housekeeping, then ...
2738 sayNO; // propagate the failure
2745 For any old-timers reading this who are familiar with the old recursive
2746 approach, the code above is equivalent to:
2748 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2757 ...; // do some housekeeping, then ...
2758 sayNO; // propagate the failure
2761 The topmost backtrack state, pointed to by st, is usually free. If you
2762 want to claim it, populate any ST.foo fields in it with values you wish to
2763 save, then do one of
2765 PUSH_STATE_GOTO(resume_state, node);
2766 PUSH_YES_STATE_GOTO(resume_state, node);
2768 which sets that backtrack state's resume value to 'resume_state', pushes a
2769 new free entry to the top of the backtrack stack, then goes to 'node'.
2770 On backtracking, the free slot is popped, and the saved state becomes the
2771 new free state. An ST.foo field in this new top state can be temporarily
2772 accessed to retrieve values, but once the main loop is re-entered, it
2773 becomes available for reuse.
2775 Note that the depth of the backtrack stack constantly increases during the
2776 left-to-right execution of the pattern, rather than going up and down with
2777 the pattern nesting. For example the stack is at its maximum at Z at the
2778 end of the pattern, rather than at X in the following:
2780 /(((X)+)+)+....(Y)+....Z/
2782 The only exceptions to this are lookahead/behind assertions and the cut,
2783 (?>A), which pop all the backtrack states associated with A before
2786 Backtrack state structs are allocated in slabs of about 4K in size.
2787 PL_regmatch_state and st always point to the currently active state,
2788 and PL_regmatch_slab points to the slab currently containing
2789 PL_regmatch_state. The first time regmatch() is called, the first slab is
2790 allocated, and is never freed until interpreter destruction. When the slab
2791 is full, a new one is allocated and chained to the end. At exit from
2792 regmatch(), slabs allocated since entry are freed.
2797 #define DEBUG_STATE_pp(pp) \
2799 DUMP_EXEC_POS(locinput, scan, utf8_target); \
2800 PerlIO_printf(Perl_debug_log, \
2801 " %*s"pp" %s%s%s%s%s\n", \
2803 PL_reg_name[st->resume_state], \
2804 ((st==yes_state||st==mark_state) ? "[" : ""), \
2805 ((st==yes_state) ? "Y" : ""), \
2806 ((st==mark_state) ? "M" : ""), \
2807 ((st==yes_state||st==mark_state) ? "]" : "") \
2812 #define REG_NODE_NUM(x) ((x) ? (int)((x)-prog) : -1)
2817 S_debug_start_match(pTHX_ const REGEXP *prog, const bool utf8_target,
2818 const char *start, const char *end, const char *blurb)
2820 const bool utf8_pat = RX_UTF8(prog) ? 1 : 0;
2822 PERL_ARGS_ASSERT_DEBUG_START_MATCH;
2827 RE_PV_QUOTED_DECL(s0, utf8_pat, PERL_DEBUG_PAD_ZERO(0),
2828 RX_PRECOMP_const(prog), RX_PRELEN(prog), 60);
2830 RE_PV_QUOTED_DECL(s1, utf8_target, PERL_DEBUG_PAD_ZERO(1),
2831 start, end - start, 60);
2833 PerlIO_printf(Perl_debug_log,
2834 "%s%s REx%s %s against %s\n",
2835 PL_colors[4], blurb, PL_colors[5], s0, s1);
2837 if (utf8_target||utf8_pat)
2838 PerlIO_printf(Perl_debug_log, "UTF-8 %s%s%s...\n",
2839 utf8_pat ? "pattern" : "",
2840 utf8_pat && utf8_target ? " and " : "",
2841 utf8_target ? "string" : ""
2847 S_dump_exec_pos(pTHX_ const char *locinput,
2848 const regnode *scan,
2849 const char *loc_regeol,
2850 const char *loc_bostr,
2851 const char *loc_reg_starttry,
2852 const bool utf8_target)
2854 const int docolor = *PL_colors[0] || *PL_colors[2] || *PL_colors[4];
2855 const int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */
2856 int l = (loc_regeol - locinput) > taill ? taill : (loc_regeol - locinput);
2857 /* The part of the string before starttry has one color
2858 (pref0_len chars), between starttry and current
2859 position another one (pref_len - pref0_len chars),
2860 after the current position the third one.
2861 We assume that pref0_len <= pref_len, otherwise we
2862 decrease pref0_len. */
2863 int pref_len = (locinput - loc_bostr) > (5 + taill) - l
2864 ? (5 + taill) - l : locinput - loc_bostr;
2867 PERL_ARGS_ASSERT_DUMP_EXEC_POS;
2869 while (utf8_target && UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len)))
2871 pref0_len = pref_len - (locinput - loc_reg_starttry);
2872 if (l + pref_len < (5 + taill) && l < loc_regeol - locinput)
2873 l = ( loc_regeol - locinput > (5 + taill) - pref_len
2874 ? (5 + taill) - pref_len : loc_regeol - locinput);
2875 while (utf8_target && UTF8_IS_CONTINUATION(*(U8*)(locinput + l)))
2879 if (pref0_len > pref_len)
2880 pref0_len = pref_len;
2882 const int is_uni = (utf8_target && OP(scan) != CANY) ? 1 : 0;
2884 RE_PV_COLOR_DECL(s0,len0,is_uni,PERL_DEBUG_PAD(0),
2885 (locinput - pref_len),pref0_len, 60, 4, 5);
2887 RE_PV_COLOR_DECL(s1,len1,is_uni,PERL_DEBUG_PAD(1),
2888 (locinput - pref_len + pref0_len),
2889 pref_len - pref0_len, 60, 2, 3);
2891 RE_PV_COLOR_DECL(s2,len2,is_uni,PERL_DEBUG_PAD(2),
2892 locinput, loc_regeol - locinput, 10, 0, 1);
2894 const STRLEN tlen=len0+len1+len2;
2895 PerlIO_printf(Perl_debug_log,
2896 "%4"IVdf" <%.*s%.*s%s%.*s>%*s|",
2897 (IV)(locinput - loc_bostr),
2900 (docolor ? "" : "> <"),
2902 (int)(tlen > 19 ? 0 : 19 - tlen),
2909 /* reg_check_named_buff_matched()
2910 * Checks to see if a named buffer has matched. The data array of
2911 * buffer numbers corresponding to the buffer is expected to reside
2912 * in the regexp->data->data array in the slot stored in the ARG() of
2913 * node involved. Note that this routine doesn't actually care about the
2914 * name, that information is not preserved from compilation to execution.
2915 * Returns the index of the leftmost defined buffer with the given name
2916 * or 0 if non of the buffers matched.
2919 S_reg_check_named_buff_matched(pTHX_ const regexp *rex, const regnode *scan)
2922 RXi_GET_DECL(rex,rexi);
2923 SV *sv_dat= MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
2924 I32 *nums=(I32*)SvPVX(sv_dat);
2926 PERL_ARGS_ASSERT_REG_CHECK_NAMED_BUFF_MATCHED;
2928 for ( n=0; n<SvIVX(sv_dat); n++ ) {
2929 if ((I32)*PL_reglastparen >= nums[n] &&
2930 PL_regoffs[nums[n]].end != -1)
2939 /* free all slabs above current one - called during LEAVE_SCOPE */
2942 S_clear_backtrack_stack(pTHX_ void *p)
2944 regmatch_slab *s = PL_regmatch_slab->next;
2949 PL_regmatch_slab->next = NULL;
2951 regmatch_slab * const osl = s;
2958 #define SETREX(Re1,Re2) \
2959 if (PL_reg_eval_set) PM_SETRE((PL_reg_curpm), (Re2)); \
2962 STATIC I32 /* 0 failure, 1 success */
2963 S_regmatch(pTHX_ regmatch_info *reginfo, regnode *prog)
2965 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2969 register const bool utf8_target = PL_reg_match_utf8;
2970 const U32 uniflags = UTF8_ALLOW_DEFAULT;
2971 REGEXP *rex_sv = reginfo->prog;
2972 regexp *rex = (struct regexp *)SvANY(rex_sv);
2973 RXi_GET_DECL(rex,rexi);
2975 /* the current state. This is a cached copy of PL_regmatch_state */
2976 register regmatch_state *st;
2977 /* cache heavy used fields of st in registers */
2978 register regnode *scan;
2979 register regnode *next;
2980 register U32 n = 0; /* general value; init to avoid compiler warning */
2981 register I32 ln = 0; /* len or last; init to avoid compiler warning */
2982 register char *locinput = PL_reginput;
2983 register I32 nextchr; /* is always set to UCHARAT(locinput) */
2985 bool result = 0; /* return value of S_regmatch */
2986 int depth = 0; /* depth of backtrack stack */
2987 U32 nochange_depth = 0; /* depth of GOSUB recursion with nochange */
2988 const U32 max_nochange_depth =
2989 (3 * rex->nparens > MAX_RECURSE_EVAL_NOCHANGE_DEPTH) ?
2990 3 * rex->nparens : MAX_RECURSE_EVAL_NOCHANGE_DEPTH;
2991 regmatch_state *yes_state = NULL; /* state to pop to on success of
2993 /* mark_state piggy backs on the yes_state logic so that when we unwind
2994 the stack on success we can update the mark_state as we go */
2995 regmatch_state *mark_state = NULL; /* last mark state we have seen */
2996 regmatch_state *cur_eval = NULL; /* most recent EVAL_AB state */
2997 struct regmatch_state *cur_curlyx = NULL; /* most recent curlyx */
2999 bool no_final = 0; /* prevent failure from backtracking? */
3000 bool do_cutgroup = 0; /* no_final only until next branch/trie entry */
3001 char *startpoint = PL_reginput;
3002 SV *popmark = NULL; /* are we looking for a mark? */
3003 SV *sv_commit = NULL; /* last mark name seen in failure */
3004 SV *sv_yes_mark = NULL; /* last mark name we have seen
3005 during a successful match */
3006 U32 lastopen = 0; /* last open we saw */
3007 bool has_cutgroup = RX_HAS_CUTGROUP(rex) ? 1 : 0;
3008 SV* const oreplsv = GvSV(PL_replgv);
3009 /* these three flags are set by various ops to signal information to
3010 * the very next op. They have a useful lifetime of exactly one loop
3011 * iteration, and are not preserved or restored by state pushes/pops
3013 bool sw = 0; /* the condition value in (?(cond)a|b) */
3014 bool minmod = 0; /* the next "{n,m}" is a "{n,m}?" */
3015 int logical = 0; /* the following EVAL is:
3019 or the following IFMATCH/UNLESSM is:
3020 false: plain (?=foo)
3021 true: used as a condition: (?(?=foo))
3024 GET_RE_DEBUG_FLAGS_DECL;
3027 PERL_ARGS_ASSERT_REGMATCH;
3029 DEBUG_OPTIMISE_r( DEBUG_EXECUTE_r({
3030 PerlIO_printf(Perl_debug_log,"regmatch start\n");
3032 /* on first ever call to regmatch, allocate first slab */
3033 if (!PL_regmatch_slab) {
3034 Newx(PL_regmatch_slab, 1, regmatch_slab);
3035 PL_regmatch_slab->prev = NULL;
3036 PL_regmatch_slab->next = NULL;
3037 PL_regmatch_state = SLAB_FIRST(PL_regmatch_slab);
3040 oldsave = PL_savestack_ix;
3041 SAVEDESTRUCTOR_X(S_clear_backtrack_stack, NULL);
3042 SAVEVPTR(PL_regmatch_slab);
3043 SAVEVPTR(PL_regmatch_state);
3045 /* grab next free state slot */
3046 st = ++PL_regmatch_state;
3047 if (st > SLAB_LAST(PL_regmatch_slab))
3048 st = PL_regmatch_state = S_push_slab(aTHX);
3050 /* Note that nextchr is a byte even in UTF */
3051 nextchr = UCHARAT(locinput);
3053 while (scan != NULL) {
3056 SV * const prop = sv_newmortal();
3057 regnode *rnext=regnext(scan);
3058 DUMP_EXEC_POS( locinput, scan, utf8_target );
3059 regprop(rex, prop, scan);
3061 PerlIO_printf(Perl_debug_log,
3062 "%3"IVdf":%*s%s(%"IVdf")\n",
3063 (IV)(scan - rexi->program), depth*2, "",
3065 (PL_regkind[OP(scan)] == END || !rnext) ?
3066 0 : (IV)(rnext - rexi->program));
3069 next = scan + NEXT_OFF(scan);
3072 state_num = OP(scan);
3076 assert(PL_reglastparen == &rex->lastparen);
3077 assert(PL_reglastcloseparen == &rex->lastcloseparen);
3078 assert(PL_regoffs == rex->offs);
3080 switch (state_num) {
3082 if (locinput == PL_bostr)
3084 /* reginfo->till = reginfo->bol; */
3089 if (locinput == PL_bostr ||
3090 ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n'))
3096 if (locinput == PL_bostr)
3100 if (locinput == reginfo->ganch)
3105 /* update the startpoint */
3106 st->u.keeper.val = PL_regoffs[0].start;
3107 PL_reginput = locinput;
3108 PL_regoffs[0].start = locinput - PL_bostr;
3109 PUSH_STATE_GOTO(KEEPS_next, next);
3111 case KEEPS_next_fail:
3112 /* rollback the start point change */
3113 PL_regoffs[0].start = st->u.keeper.val;
3119 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
3124 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
3126 if (PL_regeol - locinput > 1)
3130 if (PL_regeol != locinput)
3134 if (!nextchr && locinput >= PL_regeol)
3137 locinput += PL_utf8skip[nextchr];
3138 if (locinput > PL_regeol)
3140 nextchr = UCHARAT(locinput);
3143 nextchr = UCHARAT(++locinput);
3146 if (!nextchr && locinput >= PL_regeol)
3148 nextchr = UCHARAT(++locinput);
3151 if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n')
3154 locinput += PL_utf8skip[nextchr];
3155 if (locinput > PL_regeol)
3157 nextchr = UCHARAT(locinput);
3160 nextchr = UCHARAT(++locinput);
3164 #define ST st->u.trie
3166 /* In this case the charclass data is available inline so
3167 we can fail fast without a lot of extra overhead.
3169 if (scan->flags == EXACT || !utf8_target) {
3170 if(!ANYOF_BITMAP_TEST(scan, *locinput)) {
3172 PerlIO_printf(Perl_debug_log,
3173 "%*s %sfailed to match trie start class...%s\n",
3174 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
3182 /* the basic plan of execution of the trie is:
3183 * At the beginning, run though all the states, and
3184 * find the longest-matching word. Also remember the position
3185 * of the shortest matching word. For example, this pattern:
3188 * when matched against the string "abcde", will generate
3189 * accept states for all words except 3, with the longest
3190 * matching word being 4, and the shortest being 1 (with
3191 * the position being after char 1 of the string).
3193 * Then for each matching word, in word order (i.e. 1,2,4,5),
3194 * we run the remainder of the pattern; on each try setting
3195 * the current position to the character following the word,
3196 * returning to try the next word on failure.
3198 * We avoid having to build a list of words at runtime by
3199 * using a compile-time structure, wordinfo[].prev, which
3200 * gives, for each word, the previous accepting word (if any).
3201 * In the case above it would contain the mappings 1->2, 2->0,
3202 * 3->0, 4->5, 5->1. We can use this table to generate, from
3203 * the longest word (4 above), a list of all words, by
3204 * following the list of prev pointers; this gives us the
3205 * unordered list 4,5,1,2. Then given the current word we have
3206 * just tried, we can go through the list and find the
3207 * next-biggest word to try (so if we just failed on word 2,
3208 * the next in the list is 4).
3210 * Since at runtime we don't record the matching position in
3211 * the string for each word, we have to work that out for
3212 * each word we're about to process. The wordinfo table holds
3213 * the character length of each word; given that we recorded
3214 * at the start: the position of the shortest word and its
3215 * length in chars, we just need to move the pointer the
3216 * difference between the two char lengths. Depending on
3217 * Unicode status and folding, that's cheap or expensive.
3219 * This algorithm is optimised for the case where are only a
3220 * small number of accept states, i.e. 0,1, or maybe 2.
3221 * With lots of accepts states, and having to try all of them,
3222 * it becomes quadratic on number of accept states to find all
3227 /* what type of TRIE am I? (utf8 makes this contextual) */
3228 DECL_TRIE_TYPE(scan);
3230 /* what trie are we using right now */
3231 reg_trie_data * const trie
3232 = (reg_trie_data*)rexi->data->data[ ARG( scan ) ];
3233 HV * widecharmap = MUTABLE_HV(rexi->data->data[ ARG( scan ) + 1 ]);
3234 U32 state = trie->startstate;
3236 if (trie->bitmap && trie_type != trie_utf8_fold &&
3237 !TRIE_BITMAP_TEST(trie,*locinput)
3239 if (trie->states[ state ].wordnum) {
3241 PerlIO_printf(Perl_debug_log,
3242 "%*s %smatched empty string...%s\n",
3243 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
3249 PerlIO_printf(Perl_debug_log,
3250 "%*s %sfailed to match trie start class...%s\n",
3251 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
3258 U8 *uc = ( U8* )locinput;
3262 U8 *uscan = (U8*)NULL;
3263 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
3264 U32 charcount = 0; /* how many input chars we have matched */
3265 U32 accepted = 0; /* have we seen any accepting states? */
3268 ST.jump = trie->jump;
3271 ST.longfold = FALSE; /* char longer if folded => it's harder */
3274 /* fully traverse the TRIE; note the position of the
3275 shortest accept state and the wordnum of the longest
3278 while ( state && uc <= (U8*)PL_regeol ) {
3279 U32 base = trie->states[ state ].trans.base;
3283 wordnum = trie->states[ state ].wordnum;
3285 if (wordnum) { /* it's an accept state */
3288 /* record first match position */
3290 ST.firstpos = (U8*)locinput;
3295 ST.firstchars = charcount;
3298 if (!ST.nextword || wordnum < ST.nextword)
3299 ST.nextword = wordnum;
3300 ST.topword = wordnum;
3303 DEBUG_TRIE_EXECUTE_r({
3304 DUMP_EXEC_POS( (char *)uc, scan, utf8_target );
3305 PerlIO_printf( Perl_debug_log,
3306 "%*s %sState: %4"UVxf" Accepted: %c ",
3307 2+depth * 2, "", PL_colors[4],
3308 (UV)state, (accepted ? 'Y' : 'N'));
3311 /* read a char and goto next state */
3314 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
3315 uscan, len, uvc, charid, foldlen,
3322 base + charid - 1 - trie->uniquecharcount)) >= 0)
3324 && ((U32)offset < trie->lasttrans)
3325 && trie->trans[offset].check == state)
3327 state = trie->trans[offset].next;
3338 DEBUG_TRIE_EXECUTE_r(
3339 PerlIO_printf( Perl_debug_log,
3340 "Charid:%3x CP:%4"UVxf" After State: %4"UVxf"%s\n",
3341 charid, uvc, (UV)state, PL_colors[5] );
3347 /* calculate total number of accept states */
3352 w = trie->wordinfo[w].prev;
3355 ST.accepted = accepted;
3359 PerlIO_printf( Perl_debug_log,
3360 "%*s %sgot %"IVdf" possible matches%s\n",
3361 REPORT_CODE_OFF + depth * 2, "",
3362 PL_colors[4], (IV)ST.accepted, PL_colors[5] );
3364 goto trie_first_try; /* jump into the fail handler */
3368 case TRIE_next_fail: /* we failed - try next alternative */
3370 REGCP_UNWIND(ST.cp);
3371 for (n = *PL_reglastparen; n > ST.lastparen; n--)
3372 PL_regoffs[n].end = -1;
3373 *PL_reglastparen = n;
3375 if (!--ST.accepted) {
3377 PerlIO_printf( Perl_debug_log,
3378 "%*s %sTRIE failed...%s\n",
3379 REPORT_CODE_OFF+depth*2, "",
3386 /* Find next-highest word to process. Note that this code
3387 * is O(N^2) per trie run (O(N) per branch), so keep tight */
3388 register U16 min = 0;
3390 register U16 const nextword = ST.nextword;
3391 register reg_trie_wordinfo * const wordinfo
3392 = ((reg_trie_data*)rexi->data->data[ARG(ST.me)])->wordinfo;
3393 for (word=ST.topword; word; word=wordinfo[word].prev) {
3394 if (word > nextword && (!min || word < min))
3407 ST.lastparen = *PL_reglastparen;
3411 /* find start char of end of current word */
3413 U32 chars; /* how many chars to skip */
3414 U8 *uc = ST.firstpos;
3415 reg_trie_data * const trie
3416 = (reg_trie_data*)rexi->data->data[ARG(ST.me)];
3418 assert((trie->wordinfo[ST.nextword].len - trie->prefixlen)
3420 chars = (trie->wordinfo[ST.nextword].len - trie->prefixlen)
3424 /* the hard option - fold each char in turn and find
3425 * its folded length (which may be different */
3426 U8 foldbuf[UTF8_MAXBYTES_CASE + 1];
3434 uvc = utf8n_to_uvuni((U8*)uc, UTF8_MAXLEN, &len,
3442 uvc = to_uni_fold(uvc, foldbuf, &foldlen);
3447 uvc = utf8n_to_uvuni(uscan, UTF8_MAXLEN, &len,
3461 PL_reginput = (char *)uc;
3464 scan = (ST.jump && ST.jump[ST.nextword])
3465 ? ST.me + ST.jump[ST.nextword]
3469 PerlIO_printf( Perl_debug_log,
3470 "%*s %sTRIE matched word #%d, continuing%s\n",
3471 REPORT_CODE_OFF+depth*2, "",
3478 if (ST.accepted > 1 || has_cutgroup) {
3479 PUSH_STATE_GOTO(TRIE_next, scan);
3482 /* only one choice left - just continue */
3484 AV *const trie_words
3485 = MUTABLE_AV(rexi->data->data[ARG(ST.me)+TRIE_WORDS_OFFSET]);
3486 SV ** const tmp = av_fetch( trie_words,
3488 SV *sv= tmp ? sv_newmortal() : NULL;
3490 PerlIO_printf( Perl_debug_log,
3491 "%*s %sonly one match left, short-circuiting: #%d <%s>%s\n",
3492 REPORT_CODE_OFF+depth*2, "", PL_colors[4],
3494 tmp ? pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 0,
3495 PL_colors[0], PL_colors[1],
3496 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)|PERL_PV_ESCAPE_NONASCII
3498 : "not compiled under -Dr",
3502 locinput = PL_reginput;
3503 nextchr = UCHARAT(locinput);
3504 continue; /* execute rest of RE */
3509 char *s = STRING(scan);
3511 if (utf8_target != UTF_PATTERN) {
3512 /* The target and the pattern have differing utf8ness. */
3514 const char * const e = s + ln;
3517 /* The target is utf8, the pattern is not utf8. */
3522 if (NATIVE_TO_UNI(*(U8*)s) !=
3523 utf8n_to_uvuni((U8*)l, UTF8_MAXBYTES, &ulen,
3531 /* The target is not utf8, the pattern is utf8. */
3536 if (NATIVE_TO_UNI(*((U8*)l)) !=
3537 utf8n_to_uvuni((U8*)s, UTF8_MAXBYTES, &ulen,
3545 nextchr = UCHARAT(locinput);
3548 /* The target and the pattern have the same utf8ness. */
3549 /* Inline the first character, for speed. */
3550 if (UCHARAT(s) != nextchr)
3552 if (PL_regeol - locinput < ln)
3554 if (ln > 1 && memNE(s, locinput, ln))
3557 nextchr = UCHARAT(locinput);
3562 const U8 * fold_array;
3565 PL_reg_flags |= RF_tainted;
3566 folder = foldEQ_locale;
3567 fold_array = PL_fold_locale;
3571 folder = foldEQ_latin1;
3572 fold_array = PL_fold_latin1;
3577 fold_array = PL_fold;
3583 if (utf8_target || UTF_PATTERN) {
3584 /* Either target or the pattern are utf8. */
3585 const char * const l = locinput;
3586 char *e = PL_regeol;
3588 if (! foldEQ_utf8(s, 0, ln, cBOOL(UTF_PATTERN),
3589 l, &e, 0, utf8_target)) {
3590 /* One more case for the sharp s:
3591 * pack("U0U*", 0xDF) =~ /ss/i,
3592 * the 0xC3 0x9F are the UTF-8
3593 * byte sequence for the U+00DF. */
3595 if (!(utf8_target &&
3596 toLOWER(s[0]) == 's' &&
3598 toLOWER(s[1]) == 's' &&
3605 nextchr = UCHARAT(locinput);
3609 /* Neither the target and the pattern are utf8. */
3611 /* Inline the first character, for speed. */
3612 if (UCHARAT(s) != nextchr &&
3613 UCHARAT(s) != fold_array[nextchr])
3617 if (PL_regeol - locinput < ln)
3619 if (ln > 1 && ! folder(s, locinput, ln))
3622 nextchr = UCHARAT(locinput);
3627 PL_reg_flags |= RF_tainted;
3631 /* was last char in word? */
3633 if (locinput == PL_bostr)
3636 const U8 * const r = reghop3((U8*)locinput, -1, (U8*)PL_bostr);
3638 ln = utf8n_to_uvchr(r, UTF8SKIP(r), 0, uniflags);
3640 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3641 ln = isALNUM_uni(ln);
3642 LOAD_UTF8_CHARCLASS_ALNUM();
3643 n = swash_fetch(PL_utf8_alnum, (U8*)locinput, utf8_target);
3646 ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(ln));
3647 n = isALNUM_LC_utf8((U8*)locinput);
3651 ln = (locinput != PL_bostr) ?
3652 UCHARAT(locinput - 1) : '\n';
3653 if (FLAGS(scan) & USE_UNI) {
3655 /* Here, can't be BOUNDL or NBOUNDL because they never set
3656 * the flags to USE_UNI */
3657 ln = isWORDCHAR_L1(ln);
3658 n = isWORDCHAR_L1(nextchr);
3660 else if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3662 n = isALNUM(nextchr);
3665 ln = isALNUM_LC(ln);
3666 n = isALNUM_LC(nextchr);
3669 if (((!ln) == (!n)) == (OP(scan) == BOUND ||
3670 OP(scan) == BOUNDL))
3675 STRLEN inclasslen = PL_regeol - locinput;
3676 if (locinput >= PL_regeol)
3679 if (!reginclass(rex, scan, (U8*)locinput, &inclasslen, utf8_target))
3681 locinput += inclasslen;
3682 nextchr = UCHARAT(locinput);
3687 nextchr = UCHARAT(locinput);
3688 if (!nextchr && locinput >= PL_regeol)
3690 if (!REGINCLASS(rex, scan, (U8*)locinput))
3692 nextchr = UCHARAT(++locinput);
3696 /* If we might have the case of the German sharp s
3697 * in a casefolding Unicode character class. */
3699 if (ANYOF_FOLD_SHARP_S(scan, locinput, PL_regeol)) {
3700 locinput += SHARP_S_SKIP;
3701 nextchr = UCHARAT(locinput);
3706 /* Special char classes - The defines start on line 129 or so */
3707 CCC_TRY_AFF_U( ALNUM, ALNUML, perl_word, "a", isALNUM_LC_utf8, isWORDCHAR_L1, isALNUM_LC);
3708 CCC_TRY_NEG_U(NALNUM, NALNUML, perl_word, "a", isALNUM_LC_utf8, isWORDCHAR_L1, isALNUM_LC);
3710 CCC_TRY_AFF_U( SPACE, SPACEL, perl_space, " ", isSPACE_LC_utf8, isSPACE_L1, isSPACE_LC);
3711 CCC_TRY_NEG_U(NSPACE, NSPACEL, perl_space, " ", isSPACE_LC_utf8, isSPACE_L1, isSPACE_LC);
3713 CCC_TRY_AFF( DIGIT, DIGITL, posix_digit, "0", isDIGIT_LC_utf8, isDIGIT, isDIGIT_LC);
3714 CCC_TRY_NEG(NDIGIT, NDIGITL, posix_digit, "0", isDIGIT_LC_utf8, isDIGIT, isDIGIT_LC);
3716 case CLUMP: /* Match \X: logical Unicode character. This is defined as
3717 a Unicode extended Grapheme Cluster */
3718 /* From http://www.unicode.org/reports/tr29 (5.2 version). An
3719 extended Grapheme Cluster is:
3722 | Prepend* Begin Extend*
3725 Begin is (Hangul-syllable | ! Control)
3726 Extend is (Grapheme_Extend | Spacing_Mark)
3727 Control is [ GCB_Control CR LF ]
3729 The discussion below shows how the code for CLUMP is derived
3730 from this regex. Note that most of these concepts are from
3731 property values of the Grapheme Cluster Boundary (GCB) property.
3732 No code point can have multiple property values for a given
3733 property. Thus a code point in Prepend can't be in Control, but
3734 it must be in !Control. This is why Control above includes
3735 GCB_Control plus CR plus LF. The latter two are used in the GCB
3736 property separately, and so can't be in GCB_Control, even though
3737 they logically are controls. Control is not the same as gc=cc,
3738 but includes format and other characters as well.
3740 The Unicode definition of Hangul-syllable is:
3742 | (L* ( ( V | LV ) V* | LVT ) T*)
3745 Each of these is a value for the GCB property, and hence must be
3746 disjoint, so the order they are tested is immaterial, so the
3747 above can safely be changed to
3750 | (L* ( LVT | ( V | LV ) V*) T*)
3752 The last two terms can be combined like this:
3754 | (( LVT | ( V | LV ) V*) T*))
3756 And refactored into this:
3757 L* (L | LVT T* | V V* T* | LV V* T*)
3759 That means that if we have seen any L's at all we can quit
3760 there, but if the next character is a LVT, a V or and LV we
3763 There is a subtlety with Prepend* which showed up in testing.
3764 Note that the Begin, and only the Begin is required in:
3765 | Prepend* Begin Extend*
3766 Also, Begin contains '! Control'. A Prepend must be a '!
3767 Control', which means it must be a Begin. What it comes down to
3768 is that if we match Prepend* and then find no suitable Begin
3769 afterwards, that if we backtrack the last Prepend, that one will
3770 be a suitable Begin.
3773 if (locinput >= PL_regeol)
3775 if (! utf8_target) {
3777 /* Match either CR LF or '.', as all the other possibilities
3779 locinput++; /* Match the . or CR */
3781 && locinput < PL_regeol
3782 && UCHARAT(locinput) == '\n') locinput++;
3786 /* Utf8: See if is ( CR LF ); already know that locinput <
3787 * PL_regeol, so locinput+1 is in bounds */
3788 if (nextchr == '\r' && UCHARAT(locinput + 1) == '\n') {
3792 /* In case have to backtrack to beginning, then match '.' */
3793 char *starting = locinput;
3795 /* In case have to backtrack the last prepend */
3796 char *previous_prepend = 0;
3798 LOAD_UTF8_CHARCLASS_GCB();
3800 /* Match (prepend)* */
3801 while (locinput < PL_regeol
3802 && swash_fetch(PL_utf8_X_prepend,
3803 (U8*)locinput, utf8_target))
3805 previous_prepend = locinput;
3806 locinput += UTF8SKIP(locinput);
3809 /* As noted above, if we matched a prepend character, but
3810 * the next thing won't match, back off the last prepend we
3811 * matched, as it is guaranteed to match the begin */
3812 if (previous_prepend
3813 && (locinput >= PL_regeol
3814 || ! swash_fetch(PL_utf8_X_begin,
3815 (U8*)locinput, utf8_target)))
3817 locinput = previous_prepend;
3820 /* Note that here we know PL_regeol > locinput, as we
3821 * tested that upon input to this switch case, and if we
3822 * moved locinput forward, we tested the result just above
3823 * and it either passed, or we backed off so that it will
3825 if (! swash_fetch(PL_utf8_X_begin, (U8*)locinput, utf8_target)) {
3827 /* Here did not match the required 'Begin' in the
3828 * second term. So just match the very first
3829 * character, the '.' of the final term of the regex */
3830 locinput = starting + UTF8SKIP(starting);
3833 /* Here is the beginning of a character that can have
3834 * an extender. It is either a hangul syllable, or a
3836 if (swash_fetch(PL_utf8_X_non_hangul,
3837 (U8*)locinput, utf8_target))
3840 /* Here not a Hangul syllable, must be a
3841 * ('! * Control') */
3842 locinput += UTF8SKIP(locinput);
3845 /* Here is a Hangul syllable. It can be composed
3846 * of several individual characters. One
3847 * possibility is T+ */
3848 if (swash_fetch(PL_utf8_X_T,
3849 (U8*)locinput, utf8_target))
3851 while (locinput < PL_regeol
3852 && swash_fetch(PL_utf8_X_T,
3853 (U8*)locinput, utf8_target))
3855 locinput += UTF8SKIP(locinput);
3859 /* Here, not T+, but is a Hangul. That means
3860 * it is one of the others: L, LV, LVT or V,
3862 * L* (L | LVT T* | V V* T* | LV V* T*) */
3865 while (locinput < PL_regeol
3866 && swash_fetch(PL_utf8_X_L,
3867 (U8*)locinput, utf8_target))
3869 locinput += UTF8SKIP(locinput);
3872 /* Here, have exhausted L*. If the next
3873 * character is not an LV, LVT nor V, it means
3874 * we had to have at least one L, so matches L+
3875 * in the original equation, we have a complete
3876 * hangul syllable. Are done. */
3878 if (locinput < PL_regeol
3879 && swash_fetch(PL_utf8_X_LV_LVT_V,
3880 (U8*)locinput, utf8_target))
3883 /* Otherwise keep going. Must be LV, LVT
3884 * or V. See if LVT */
3885 if (swash_fetch(PL_utf8_X_LVT,
3886 (U8*)locinput, utf8_target))
3888 locinput += UTF8SKIP(locinput);
3891 /* Must be V or LV. Take it, then
3893 locinput += UTF8SKIP(locinput);
3894 while (locinput < PL_regeol
3895 && swash_fetch(PL_utf8_X_V,
3896 (U8*)locinput, utf8_target))
3898 locinput += UTF8SKIP(locinput);
3902 /* And any of LV, LVT, or V can be followed
3904 while (locinput < PL_regeol
3905 && swash_fetch(PL_utf8_X_T,
3909 locinput += UTF8SKIP(locinput);
3915 /* Match any extender */
3916 while (locinput < PL_regeol
3917 && swash_fetch(PL_utf8_X_extend,
3918 (U8*)locinput, utf8_target))
3920 locinput += UTF8SKIP(locinput);
3924 if (locinput > PL_regeol) sayNO;
3926 nextchr = UCHARAT(locinput);
3930 { /* The capture buffer cases. The ones beginning with N for the
3931 named buffers just convert to the equivalent numbered and
3932 pretend they were called as the corresponding numbered buffer
3934 /* don't initialize these, it makes C++ unhappy */
3938 const U8 *fold_array;
3940 PL_reg_flags |= RF_tainted;
3941 folder = foldEQ_locale;
3942 fold_array = PL_fold_locale;
3947 folder = foldEQ_latin1;
3948 fold_array = PL_fold_latin1;
3954 fold_array = PL_fold;
3964 /* For the named back references, find the corresponding buffer
3966 n = reg_check_named_buff_matched(rex,scan);
3971 goto do_nref_ref_common;
3974 PL_reg_flags |= RF_tainted;
3975 folder = foldEQ_locale;
3976 fold_array = PL_fold_locale;
3980 folder = foldEQ_latin1;
3981 fold_array = PL_fold_latin1;
3986 fold_array = PL_fold;
3995 n = ARG(scan); /* which paren pair */
3998 ln = PL_regoffs[n].start;
3999 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
4000 if (*PL_reglastparen < n || ln == -1)
4001 sayNO; /* Do not match unless seen CLOSEn. */
4002 if (ln == PL_regoffs[n].end)
4006 if (type != REF /* REF can do byte comparison */
4009 && (*s == (char) LATIN_SMALL_LETTER_SHARP_S
4010 || *locinput == (char) LATIN_SMALL_LETTER_SHARP_S))))
4011 { /* XXX handle REFFL better */
4012 char * limit = PL_regeol;
4014 /* This call case insensitively compares the entire buffer
4015 * at s, with the current input starting at locinput, but
4016 * not going off the end given by PL_regeol, and returns in
4017 * limit upon success, how much of the current input was
4019 if (! foldEQ_utf8(s, NULL, PL_regoffs[n].end - ln, utf8_target,
4020 locinput, &limit, 0, utf8_target))
4025 nextchr = UCHARAT(locinput);
4029 /* Not utf8: Inline the first character, for speed. */
4030 if (UCHARAT(s) != nextchr &&
4032 UCHARAT(s) != fold_array[nextchr]))
4034 ln = PL_regoffs[n].end - ln;
4035 if (locinput + ln > PL_regeol)
4037 if (ln > 1 && (type == REF
4038 ? memNE(s, locinput, ln)
4039 : ! folder(s, locinput, ln)))
4042 nextchr = UCHARAT(locinput);
4052 #define ST st->u.eval
4057 regexp_internal *rei;
4058 regnode *startpoint;
4061 case GOSUB: /* /(...(?1))/ /(...(?&foo))/ */
4062 if (cur_eval && cur_eval->locinput==locinput) {
4063 if (cur_eval->u.eval.close_paren == (U32)ARG(scan))
4064 Perl_croak(aTHX_ "Infinite recursion in regex");
4065 if ( ++nochange_depth > max_nochange_depth )
4067 "Pattern subroutine nesting without pos change"
4068 " exceeded limit in regex");
4075 (void)ReREFCNT_inc(rex_sv);
4076 if (OP(scan)==GOSUB) {
4077 startpoint = scan + ARG2L(scan);
4078 ST.close_paren = ARG(scan);
4080 startpoint = rei->program+1;
4083 goto eval_recurse_doit;
4085 case EVAL: /* /(?{A})B/ /(??{A})B/ and /(?(?{A})X|Y)B/ */
4086 if (cur_eval && cur_eval->locinput==locinput) {
4087 if ( ++nochange_depth > max_nochange_depth )
4088 Perl_croak(aTHX_ "EVAL without pos change exceeded limit in regex");
4093 /* execute the code in the {...} */
4095 SV ** const before = SP;
4096 OP_4tree * const oop = PL_op;
4097 COP * const ocurcop = PL_curcop;
4099 char *saved_regeol = PL_regeol;
4100 struct re_save_state saved_state;
4102 /* To not corrupt the existing regex state while executing the
4103 * eval we would normally put it on the save stack, like with
4104 * save_re_context. However, re-evals have a weird scoping so we
4105 * can't just add ENTER/LEAVE here. With that, things like
4107 * (?{$a=2})(a(?{local$a=$a+1}))*aak*c(?{$b=$a})
4109 * would break, as they expect the localisation to be unwound
4110 * only when the re-engine backtracks through the bit that
4113 * What we do instead is just saving the state in a local c
4116 Copy(&PL_reg_state, &saved_state, 1, struct re_save_state);
4119 PL_op = (OP_4tree*)rexi->data->data[n];
4120 DEBUG_STATE_r( PerlIO_printf(Perl_debug_log,
4121 " re_eval 0x%"UVxf"\n", PTR2UV(PL_op)) );
4122 PAD_SAVE_LOCAL(old_comppad, (PAD*)rexi->data->data[n + 2]);
4123 PL_regoffs[0].end = PL_reg_magic->mg_len = locinput - PL_bostr;
4126 SV *sv_mrk = get_sv("REGMARK", 1);
4127 sv_setsv(sv_mrk, sv_yes_mark);
4130 CALLRUNOPS(aTHX); /* Scalar context. */
4133 ret = &PL_sv_undef; /* protect against empty (?{}) blocks. */
4139 Copy(&saved_state, &PL_reg_state, 1, struct re_save_state);
4142 PAD_RESTORE_LOCAL(old_comppad);
4143 PL_curcop = ocurcop;
4144 PL_regeol = saved_regeol;
4147 sv_setsv(save_scalar(PL_replgv), ret);
4151 if (logical == 2) { /* Postponed subexpression: /(??{...})/ */
4154 /* extract RE object from returned value; compiling if
4160 SV *const sv = SvRV(ret);
4162 if (SvTYPE(sv) == SVt_REGEXP) {
4164 } else if (SvSMAGICAL(sv)) {
4165 mg = mg_find(sv, PERL_MAGIC_qr);
4168 } else if (SvTYPE(ret) == SVt_REGEXP) {
4170 } else if (SvSMAGICAL(ret)) {
4171 if (SvGMAGICAL(ret)) {
4172 /* I don't believe that there is ever qr magic
4174 assert(!mg_find(ret, PERL_MAGIC_qr));
4175 sv_unmagic(ret, PERL_MAGIC_qr);
4178 mg = mg_find(ret, PERL_MAGIC_qr);
4179 /* testing suggests mg only ends up non-NULL for
4180 scalars who were upgraded and compiled in the
4181 else block below. In turn, this is only
4182 triggered in the "postponed utf8 string" tests
4188 rx = (REGEXP *) mg->mg_obj; /*XXX:dmq*/
4192 rx = reg_temp_copy(NULL, rx);
4196 const I32 osize = PL_regsize;
4199 assert (SvUTF8(ret));
4200 } else if (SvUTF8(ret)) {
4201 /* Not doing UTF-8, despite what the SV says. Is
4202 this only if we're trapped in use 'bytes'? */
4203 /* Make a copy of the octet sequence, but without
4204 the flag on, as the compiler now honours the
4205 SvUTF8 flag on ret. */
4207 const char *const p = SvPV(ret, len);
4208 ret = newSVpvn_flags(p, len, SVs_TEMP);
4210 rx = CALLREGCOMP(ret, pm_flags);
4212 & (SVs_TEMP | SVs_PADTMP | SVf_READONLY
4214 /* This isn't a first class regexp. Instead, it's
4215 caching a regexp onto an existing, Perl visible
4217 sv_magic(ret, MUTABLE_SV(rx), PERL_MAGIC_qr, 0, 0);
4222 re = (struct regexp *)SvANY(rx);
4224 RXp_MATCH_COPIED_off(re);
4225 re->subbeg = rex->subbeg;
4226 re->sublen = rex->sublen;
4229 debug_start_match(re_sv, utf8_target, locinput, PL_regeol,
4230 "Matching embedded");
4232 startpoint = rei->program + 1;
4233 ST.close_paren = 0; /* only used for GOSUB */
4234 /* borrowed from regtry */
4235 if (PL_reg_start_tmpl <= re->nparens) {
4236 PL_reg_start_tmpl = re->nparens*3/2 + 3;
4237 if(PL_reg_start_tmp)
4238 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
4240 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
4243 eval_recurse_doit: /* Share code with GOSUB below this line */
4244 /* run the pattern returned from (??{...}) */
4245 ST.cp = regcppush(0); /* Save *all* the positions. */
4246 REGCP_SET(ST.lastcp);
4248 PL_regoffs = re->offs; /* essentially NOOP on GOSUB */
4250 /* see regtry, specifically PL_reglast(?:close)?paren is a pointer! (i dont know why) :dmq */
4251 PL_reglastparen = &re->lastparen;
4252 PL_reglastcloseparen = &re->lastcloseparen;
4254 re->lastcloseparen = 0;
4256 PL_reginput = locinput;
4259 /* XXXX This is too dramatic a measure... */
4262 ST.toggle_reg_flags = PL_reg_flags;
4264 PL_reg_flags |= RF_utf8;
4266 PL_reg_flags &= ~RF_utf8;
4267 ST.toggle_reg_flags ^= PL_reg_flags; /* diff of old and new */
4269 ST.prev_rex = rex_sv;
4270 ST.prev_curlyx = cur_curlyx;
4271 SETREX(rex_sv,re_sv);
4276 ST.prev_eval = cur_eval;
4278 /* now continue from first node in postoned RE */
4279 PUSH_YES_STATE_GOTO(EVAL_AB, startpoint);
4282 /* logical is 1, /(?(?{...})X|Y)/ */
4283 sw = cBOOL(SvTRUE(ret));
4288 case EVAL_AB: /* cleanup after a successful (??{A})B */
4289 /* note: this is called twice; first after popping B, then A */
4290 PL_reg_flags ^= ST.toggle_reg_flags;
4291 ReREFCNT_dec(rex_sv);
4292 SETREX(rex_sv,ST.prev_rex);
4293 rex = (struct regexp *)SvANY(rex_sv);
4294 rexi = RXi_GET(rex);
4296 cur_eval = ST.prev_eval;
4297 cur_curlyx = ST.prev_curlyx;
4299 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
4300 PL_reglastparen = &rex->lastparen;
4301 PL_reglastcloseparen = &rex->lastcloseparen;
4302 /* also update PL_regoffs */
4303 PL_regoffs = rex->offs;
4305 /* XXXX This is too dramatic a measure... */
4307 if ( nochange_depth )
4312 case EVAL_AB_fail: /* unsuccessfully ran A or B in (??{A})B */
4313 /* note: this is called twice; first after popping B, then A */
4314 PL_reg_flags ^= ST.toggle_reg_flags;
4315 ReREFCNT_dec(rex_sv);
4316 SETREX(rex_sv,ST.prev_rex);
4317 rex = (struct regexp *)SvANY(rex_sv);
4318 rexi = RXi_GET(rex);
4319 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
4320 PL_reglastparen = &rex->lastparen;
4321 PL_reglastcloseparen = &rex->lastcloseparen;
4323 PL_reginput = locinput;
4324 REGCP_UNWIND(ST.lastcp);
4326 cur_eval = ST.prev_eval;
4327 cur_curlyx = ST.prev_curlyx;
4328 /* XXXX This is too dramatic a measure... */
4330 if ( nochange_depth )
4336 n = ARG(scan); /* which paren pair */
4337 PL_reg_start_tmp[n] = locinput;
4343 n = ARG(scan); /* which paren pair */
4344 PL_regoffs[n].start = PL_reg_start_tmp[n] - PL_bostr;
4345 PL_regoffs[n].end = locinput - PL_bostr;
4346 /*if (n > PL_regsize)
4348 if (n > *PL_reglastparen)
4349 *PL_reglastparen = n;
4350 *PL_reglastcloseparen = n;
4351 if (cur_eval && cur_eval->u.eval.close_paren == n) {
4359 cursor && OP(cursor)!=END;
4360 cursor=regnext(cursor))
4362 if ( OP(cursor)==CLOSE ){
4364 if ( n <= lastopen ) {
4366 = PL_reg_start_tmp[n] - PL_bostr;
4367 PL_regoffs[n].end = locinput - PL_bostr;
4368 /*if (n > PL_regsize)
4370 if (n > *PL_reglastparen)
4371 *PL_reglastparen = n;
4372 *PL_reglastcloseparen = n;
4373 if ( n == ARG(scan) || (cur_eval &&
4374 cur_eval->u.eval.close_paren == n))
4383 n = ARG(scan); /* which paren pair */
4384 sw = cBOOL(*PL_reglastparen >= n && PL_regoffs[n].end != -1);
4387 /* reg_check_named_buff_matched returns 0 for no match */
4388 sw = cBOOL(0 < reg_check_named_buff_matched(rex,scan));
4392 sw = (cur_eval && (!n || cur_eval->u.eval.close_paren == n));
4398 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
4400 next = NEXTOPER(NEXTOPER(scan));
4402 next = scan + ARG(scan);
4403 if (OP(next) == IFTHEN) /* Fake one. */
4404 next = NEXTOPER(NEXTOPER(next));
4408 logical = scan->flags;
4411 /*******************************************************************
4413 The CURLYX/WHILEM pair of ops handle the most generic case of the /A*B/
4414 pattern, where A and B are subpatterns. (For simple A, CURLYM or
4415 STAR/PLUS/CURLY/CURLYN are used instead.)
4417 A*B is compiled as <CURLYX><A><WHILEM><B>
4419 On entry to the subpattern, CURLYX is called. This pushes a CURLYX
4420 state, which contains the current count, initialised to -1. It also sets
4421 cur_curlyx to point to this state, with any previous value saved in the
4424 CURLYX then jumps straight to the WHILEM op, rather than executing A,
4425 since the pattern may possibly match zero times (i.e. it's a while {} loop
4426 rather than a do {} while loop).
4428 Each entry to WHILEM represents a successful match of A. The count in the
4429 CURLYX block is incremented, another WHILEM state is pushed, and execution
4430 passes to A or B depending on greediness and the current count.
4432 For example, if matching against the string a1a2a3b (where the aN are
4433 substrings that match /A/), then the match progresses as follows: (the
4434 pushed states are interspersed with the bits of strings matched so far):
4437 <CURLYX cnt=0><WHILEM>
4438 <CURLYX cnt=1><WHILEM> a1 <WHILEM>
4439 <CURLYX cnt=2><WHILEM> a1 <WHILEM> a2 <WHILEM>
4440 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM>
4441 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM> b
4443 (Contrast this with something like CURLYM, which maintains only a single
4447 a1 <CURLYM cnt=1> a2
4448 a1 a2 <CURLYM cnt=2> a3
4449 a1 a2 a3 <CURLYM cnt=3> b
4452 Each WHILEM state block marks a point to backtrack to upon partial failure
4453 of A or B, and also contains some minor state data related to that
4454 iteration. The CURLYX block, pointed to by cur_curlyx, contains the
4455 overall state, such as the count, and pointers to the A and B ops.
4457 This is complicated slightly by nested CURLYX/WHILEM's. Since cur_curlyx
4458 must always point to the *current* CURLYX block, the rules are:
4460 When executing CURLYX, save the old cur_curlyx in the CURLYX state block,
4461 and set cur_curlyx to point the new block.
4463 When popping the CURLYX block after a successful or unsuccessful match,
4464 restore the previous cur_curlyx.
4466 When WHILEM is about to execute B, save the current cur_curlyx, and set it
4467 to the outer one saved in the CURLYX block.
4469 When popping the WHILEM block after a successful or unsuccessful B match,
4470 restore the previous cur_curlyx.
4472 Here's an example for the pattern (AI* BI)*BO
4473 I and O refer to inner and outer, C and W refer to CURLYX and WHILEM:
4476 curlyx backtrack stack
4477 ------ ---------------
4479 CO <CO prev=NULL> <WO>
4480 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4481 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4482 NULL <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi <WO prev=CO> bo
4484 At this point the pattern succeeds, and we work back down the stack to
4485 clean up, restoring as we go:
4487 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4488 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4489 CO <CO prev=NULL> <WO>
4492 *******************************************************************/
4494 #define ST st->u.curlyx
4496 case CURLYX: /* start of /A*B/ (for complex A) */
4498 /* No need to save/restore up to this paren */
4499 I32 parenfloor = scan->flags;
4501 assert(next); /* keep Coverity happy */
4502 if (OP(PREVOPER(next)) == NOTHING) /* LONGJMP */
4505 /* XXXX Probably it is better to teach regpush to support
4506 parenfloor > PL_regsize... */
4507 if (parenfloor > (I32)*PL_reglastparen)
4508 parenfloor = *PL_reglastparen; /* Pessimization... */
4510 ST.prev_curlyx= cur_curlyx;
4512 ST.cp = PL_savestack_ix;
4514 /* these fields contain the state of the current curly.
4515 * they are accessed by subsequent WHILEMs */
4516 ST.parenfloor = parenfloor;
4521 ST.count = -1; /* this will be updated by WHILEM */
4522 ST.lastloc = NULL; /* this will be updated by WHILEM */
4524 PL_reginput = locinput;
4525 PUSH_YES_STATE_GOTO(CURLYX_end, PREVOPER(next));
4529 case CURLYX_end: /* just finished matching all of A*B */
4530 cur_curlyx = ST.prev_curlyx;
4534 case CURLYX_end_fail: /* just failed to match all of A*B */
4536 cur_curlyx = ST.prev_curlyx;
4542 #define ST st->u.whilem
4544 case WHILEM: /* just matched an A in /A*B/ (for complex A) */
4546 /* see the discussion above about CURLYX/WHILEM */
4548 int min = ARG1(cur_curlyx->u.curlyx.me);
4549 int max = ARG2(cur_curlyx->u.curlyx.me);
4550 regnode *A = NEXTOPER(cur_curlyx->u.curlyx.me) + EXTRA_STEP_2ARGS;
4552 assert(cur_curlyx); /* keep Coverity happy */
4553 n = ++cur_curlyx->u.curlyx.count; /* how many A's matched */
4554 ST.save_lastloc = cur_curlyx->u.curlyx.lastloc;
4555 ST.cache_offset = 0;
4558 PL_reginput = locinput;
4560 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4561 "%*s whilem: matched %ld out of %d..%d\n",
4562 REPORT_CODE_OFF+depth*2, "", (long)n, min, max)
4565 /* First just match a string of min A's. */
4568 cur_curlyx->u.curlyx.lastloc = locinput;
4569 PUSH_STATE_GOTO(WHILEM_A_pre, A);
4573 /* If degenerate A matches "", assume A done. */
4575 if (locinput == cur_curlyx->u.curlyx.lastloc) {
4576 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4577 "%*s whilem: empty match detected, trying continuation...\n",
4578 REPORT_CODE_OFF+depth*2, "")
4580 goto do_whilem_B_max;
4583 /* super-linear cache processing */
4587 if (!PL_reg_maxiter) {
4588 /* start the countdown: Postpone detection until we
4589 * know the match is not *that* much linear. */
4590 PL_reg_maxiter = (PL_regeol - PL_bostr + 1) * (scan->flags>>4);
4591 /* possible overflow for long strings and many CURLYX's */
4592 if (PL_reg_maxiter < 0)
4593 PL_reg_maxiter = I32_MAX;
4594 PL_reg_leftiter = PL_reg_maxiter;
4597 if (PL_reg_leftiter-- == 0) {
4598 /* initialise cache */
4599 const I32 size = (PL_reg_maxiter + 7)/8;
4600 if (PL_reg_poscache) {
4601 if ((I32)PL_reg_poscache_size < size) {
4602 Renew(PL_reg_poscache, size, char);
4603 PL_reg_poscache_size = size;
4605 Zero(PL_reg_poscache, size, char);
4608 PL_reg_poscache_size = size;
4609 Newxz(PL_reg_poscache, size, char);
4611 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4612 "%swhilem: Detected a super-linear match, switching on caching%s...\n",
4613 PL_colors[4], PL_colors[5])
4617 if (PL_reg_leftiter < 0) {
4618 /* have we already failed at this position? */
4620 offset = (scan->flags & 0xf) - 1
4621 + (locinput - PL_bostr) * (scan->flags>>4);
4622 mask = 1 << (offset % 8);
4624 if (PL_reg_poscache[offset] & mask) {
4625 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4626 "%*s whilem: (cache) already tried at this position...\n",
4627 REPORT_CODE_OFF+depth*2, "")
4629 sayNO; /* cache records failure */
4631 ST.cache_offset = offset;
4632 ST.cache_mask = mask;
4636 /* Prefer B over A for minimal matching. */
4638 if (cur_curlyx->u.curlyx.minmod) {
4639 ST.save_curlyx = cur_curlyx;
4640 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4641 ST.cp = regcppush(ST.save_curlyx->u.curlyx.parenfloor);
4642 REGCP_SET(ST.lastcp);
4643 PUSH_YES_STATE_GOTO(WHILEM_B_min, ST.save_curlyx->u.curlyx.B);
4647 /* Prefer A over B for maximal matching. */
4649 if (n < max) { /* More greed allowed? */
4650 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4651 cur_curlyx->u.curlyx.lastloc = locinput;
4652 REGCP_SET(ST.lastcp);
4653 PUSH_STATE_GOTO(WHILEM_A_max, A);
4656 goto do_whilem_B_max;
4660 case WHILEM_B_min: /* just matched B in a minimal match */
4661 case WHILEM_B_max: /* just matched B in a maximal match */
4662 cur_curlyx = ST.save_curlyx;
4666 case WHILEM_B_max_fail: /* just failed to match B in a maximal match */
4667 cur_curlyx = ST.save_curlyx;
4668 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4669 cur_curlyx->u.curlyx.count--;
4673 case WHILEM_A_min_fail: /* just failed to match A in a minimal match */
4674 REGCP_UNWIND(ST.lastcp);
4677 case WHILEM_A_pre_fail: /* just failed to match even minimal A */
4678 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4679 cur_curlyx->u.curlyx.count--;
4683 case WHILEM_A_max_fail: /* just failed to match A in a maximal match */
4684 REGCP_UNWIND(ST.lastcp);
4685 regcppop(rex); /* Restore some previous $<digit>s? */
4686 PL_reginput = locinput;
4687 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4688 "%*s whilem: failed, trying continuation...\n",
4689 REPORT_CODE_OFF+depth*2, "")
4692 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4693 && ckWARN(WARN_REGEXP)
4694 && !(PL_reg_flags & RF_warned))
4696 PL_reg_flags |= RF_warned;
4697 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s limit (%d) exceeded",
4698 "Complex regular subexpression recursion",
4703 ST.save_curlyx = cur_curlyx;
4704 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4705 PUSH_YES_STATE_GOTO(WHILEM_B_max, ST.save_curlyx->u.curlyx.B);
4708 case WHILEM_B_min_fail: /* just failed to match B in a minimal match */
4709 cur_curlyx = ST.save_curlyx;
4710 REGCP_UNWIND(ST.lastcp);
4713 if (cur_curlyx->u.curlyx.count >= /*max*/ARG2(cur_curlyx->u.curlyx.me)) {
4714 /* Maximum greed exceeded */
4715 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4716 && ckWARN(WARN_REGEXP)
4717 && !(PL_reg_flags & RF_warned))
4719 PL_reg_flags |= RF_warned;
4720 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
4721 "%s limit (%d) exceeded",
4722 "Complex regular subexpression recursion",
4725 cur_curlyx->u.curlyx.count--;
4729 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4730 "%*s trying longer...\n", REPORT_CODE_OFF+depth*2, "")
4732 /* Try grabbing another A and see if it helps. */
4733 PL_reginput = locinput;
4734 cur_curlyx->u.curlyx.lastloc = locinput;
4735 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4736 REGCP_SET(ST.lastcp);
4737 PUSH_STATE_GOTO(WHILEM_A_min,
4738 /*A*/ NEXTOPER(ST.save_curlyx->u.curlyx.me) + EXTRA_STEP_2ARGS);
4742 #define ST st->u.branch
4744 case BRANCHJ: /* /(...|A|...)/ with long next pointer */
4745 next = scan + ARG(scan);
4748 scan = NEXTOPER(scan);
4751 case BRANCH: /* /(...|A|...)/ */
4752 scan = NEXTOPER(scan); /* scan now points to inner node */
4753 ST.lastparen = *PL_reglastparen;
4754 ST.next_branch = next;
4756 PL_reginput = locinput;
4758 /* Now go into the branch */
4760 PUSH_YES_STATE_GOTO(BRANCH_next, scan);
4762 PUSH_STATE_GOTO(BRANCH_next, scan);
4766 PL_reginput = locinput;
4767 sv_yes_mark = st->u.mark.mark_name = scan->flags ? NULL :
4768 MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
4769 PUSH_STATE_GOTO(CUTGROUP_next,next);
4771 case CUTGROUP_next_fail:
4774 if (st->u.mark.mark_name)
4775 sv_commit = st->u.mark.mark_name;
4781 case BRANCH_next_fail: /* that branch failed; try the next, if any */
4786 REGCP_UNWIND(ST.cp);
4787 for (n = *PL_reglastparen; n > ST.lastparen; n--)
4788 PL_regoffs[n].end = -1;
4789 *PL_reglastparen = n;
4790 /*dmq: *PL_reglastcloseparen = n; */
4791 scan = ST.next_branch;
4792 /* no more branches? */
4793 if (!scan || (OP(scan) != BRANCH && OP(scan) != BRANCHJ)) {
4795 PerlIO_printf( Perl_debug_log,
4796 "%*s %sBRANCH failed...%s\n",
4797 REPORT_CODE_OFF+depth*2, "",
4803 continue; /* execute next BRANCH[J] op */
4811 #define ST st->u.curlym
4813 case CURLYM: /* /A{m,n}B/ where A is fixed-length */
4815 /* This is an optimisation of CURLYX that enables us to push
4816 * only a single backtracking state, no matter how many matches
4817 * there are in {m,n}. It relies on the pattern being constant
4818 * length, with no parens to influence future backrefs
4822 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
4824 /* if paren positive, emulate an OPEN/CLOSE around A */
4826 U32 paren = ST.me->flags;
4827 if (paren > PL_regsize)
4829 if (paren > *PL_reglastparen)
4830 *PL_reglastparen = paren;
4831 scan += NEXT_OFF(scan); /* Skip former OPEN. */
4839 ST.c1 = CHRTEST_UNINIT;
4842 if (!(ST.minmod ? ARG1(ST.me) : ARG2(ST.me))) /* min/max */
4845 curlym_do_A: /* execute the A in /A{m,n}B/ */
4846 PL_reginput = locinput;
4847 PUSH_YES_STATE_GOTO(CURLYM_A, ST.A); /* match A */
4850 case CURLYM_A: /* we've just matched an A */
4851 locinput = st->locinput;
4852 nextchr = UCHARAT(locinput);
4855 /* after first match, determine A's length: u.curlym.alen */
4856 if (ST.count == 1) {
4857 if (PL_reg_match_utf8) {
4859 while (s < PL_reginput) {
4865 ST.alen = PL_reginput - locinput;
4868 ST.count = ST.minmod ? ARG1(ST.me) : ARG2(ST.me);
4871 PerlIO_printf(Perl_debug_log,
4872 "%*s CURLYM now matched %"IVdf" times, len=%"IVdf"...\n",
4873 (int)(REPORT_CODE_OFF+(depth*2)), "",
4874 (IV) ST.count, (IV)ST.alen)
4877 locinput = PL_reginput;
4879 if (cur_eval && cur_eval->u.eval.close_paren &&
4880 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4884 I32 max = (ST.minmod ? ARG1(ST.me) : ARG2(ST.me));
4885 if ( max == REG_INFTY || ST.count < max )
4886 goto curlym_do_A; /* try to match another A */
4888 goto curlym_do_B; /* try to match B */
4890 case CURLYM_A_fail: /* just failed to match an A */
4891 REGCP_UNWIND(ST.cp);
4893 if (ST.minmod || ST.count < ARG1(ST.me) /* min*/
4894 || (cur_eval && cur_eval->u.eval.close_paren &&
4895 cur_eval->u.eval.close_paren == (U32)ST.me->flags))
4898 curlym_do_B: /* execute the B in /A{m,n}B/ */
4899 PL_reginput = locinput;
4900 if (ST.c1 == CHRTEST_UNINIT) {
4901 /* calculate c1 and c2 for possible match of 1st char
4902 * following curly */
4903 ST.c1 = ST.c2 = CHRTEST_VOID;
4904 if (HAS_TEXT(ST.B) || JUMPABLE(ST.B)) {
4905 regnode *text_node = ST.B;
4906 if (! HAS_TEXT(text_node))
4907 FIND_NEXT_IMPT(text_node);
4910 (HAS_TEXT(text_node) && PL_regkind[OP(text_node)] == EXACT)
4912 But the former is redundant in light of the latter.
4914 if this changes back then the macro for
4915 IS_TEXT and friends need to change.
4917 if (PL_regkind[OP(text_node)] == EXACT)
4920 ST.c1 = (U8)*STRING(text_node);
4921 switch (OP(text_node)) {
4922 case EXACTF: ST.c2 = PL_fold[ST.c1]; break;
4923 case EXACTFU: ST.c2 = PL_fold_latin1[ST.c1]; break;
4924 case EXACTFL: ST.c2 = PL_fold_locale[ST.c1]; break;
4925 default: ST.c2 = ST.c1;
4932 PerlIO_printf(Perl_debug_log,
4933 "%*s CURLYM trying tail with matches=%"IVdf"...\n",
4934 (int)(REPORT_CODE_OFF+(depth*2)),
4937 if (ST.c1 != CHRTEST_VOID
4938 && UCHARAT(PL_reginput) != ST.c1
4939 && UCHARAT(PL_reginput) != ST.c2)
4941 /* simulate B failing */
4943 PerlIO_printf(Perl_debug_log,
4944 "%*s CURLYM Fast bail c1=%"IVdf" c2=%"IVdf"\n",
4945 (int)(REPORT_CODE_OFF+(depth*2)),"",
4948 state_num = CURLYM_B_fail;
4949 goto reenter_switch;
4953 /* mark current A as captured */
4954 I32 paren = ST.me->flags;
4956 PL_regoffs[paren].start
4957 = HOPc(PL_reginput, -ST.alen) - PL_bostr;
4958 PL_regoffs[paren].end = PL_reginput - PL_bostr;
4959 /*dmq: *PL_reglastcloseparen = paren; */
4962 PL_regoffs[paren].end = -1;
4963 if (cur_eval && cur_eval->u.eval.close_paren &&
4964 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4973 PUSH_STATE_GOTO(CURLYM_B, ST.B); /* match B */
4976 case CURLYM_B_fail: /* just failed to match a B */
4977 REGCP_UNWIND(ST.cp);
4979 I32 max = ARG2(ST.me);
4980 if (max != REG_INFTY && ST.count == max)
4982 goto curlym_do_A; /* try to match a further A */
4984 /* backtrack one A */
4985 if (ST.count == ARG1(ST.me) /* min */)
4988 locinput = HOPc(locinput, -ST.alen);
4989 goto curlym_do_B; /* try to match B */
4992 #define ST st->u.curly
4994 #define CURLY_SETPAREN(paren, success) \
4997 PL_regoffs[paren].start = HOPc(locinput, -1) - PL_bostr; \
4998 PL_regoffs[paren].end = locinput - PL_bostr; \
4999 *PL_reglastcloseparen = paren; \
5002 PL_regoffs[paren].end = -1; \
5005 case STAR: /* /A*B/ where A is width 1 */
5009 scan = NEXTOPER(scan);
5011 case PLUS: /* /A+B/ where A is width 1 */
5015 scan = NEXTOPER(scan);
5017 case CURLYN: /* /(A){m,n}B/ where A is width 1 */
5018 ST.paren = scan->flags; /* Which paren to set */
5019 if (ST.paren > PL_regsize)
5020 PL_regsize = ST.paren;
5021 if (ST.paren > *PL_reglastparen)
5022 *PL_reglastparen = ST.paren;
5023 ST.min = ARG1(scan); /* min to match */
5024 ST.max = ARG2(scan); /* max to match */
5025 if (cur_eval && cur_eval->u.eval.close_paren &&
5026 cur_eval->u.eval.close_paren == (U32)ST.paren) {
5030 scan = regnext(NEXTOPER(scan) + NODE_STEP_REGNODE);
5032 case CURLY: /* /A{m,n}B/ where A is width 1 */
5034 ST.min = ARG1(scan); /* min to match */
5035 ST.max = ARG2(scan); /* max to match */
5036 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
5039 * Lookahead to avoid useless match attempts
5040 * when we know what character comes next.
5042 * Used to only do .*x and .*?x, but now it allows
5043 * for )'s, ('s and (?{ ... })'s to be in the way
5044 * of the quantifier and the EXACT-like node. -- japhy
5047 if (ST.min > ST.max) /* XXX make this a compile-time check? */
5049 if (HAS_TEXT(next) || JUMPABLE(next)) {
5051 regnode *text_node = next;
5053 if (! HAS_TEXT(text_node))
5054 FIND_NEXT_IMPT(text_node);
5056 if (! HAS_TEXT(text_node))
5057 ST.c1 = ST.c2 = CHRTEST_VOID;
5059 if ( PL_regkind[OP(text_node)] != EXACT ) {
5060 ST.c1 = ST.c2 = CHRTEST_VOID;
5061 goto assume_ok_easy;
5064 s = (U8*)STRING(text_node);
5066 /* Currently we only get here when
5068 PL_rekind[OP(text_node)] == EXACT
5070 if this changes back then the macro for IS_TEXT and
5071 friends need to change. */
5074 switch (OP(text_node)) {
5075 case EXACTF: ST.c2 = PL_fold[ST.c1]; break;
5076 case EXACTFU: ST.c2 = PL_fold_latin1[ST.c1]; break;
5077 case EXACTFL: ST.c2 = PL_fold_locale[ST.c1]; break;
5078 default: ST.c2 = ST.c1; break;
5081 else { /* UTF_PATTERN */
5082 if (IS_TEXTFU(text_node) || IS_TEXTF(text_node)) {
5083 STRLEN ulen1, ulen2;
5084 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
5085 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
5087 to_utf8_lower((U8*)s, tmpbuf1, &ulen1);
5088 to_utf8_upper((U8*)s, tmpbuf2, &ulen2);
5090 ST.c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXLEN, 0,
5092 0 : UTF8_ALLOW_ANY);
5093 ST.c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXLEN, 0,
5095 0 : UTF8_ALLOW_ANY);
5097 ST.c1 = utf8n_to_uvuni(tmpbuf1, UTF8_MAXBYTES, 0,
5099 ST.c2 = utf8n_to_uvuni(tmpbuf2, UTF8_MAXBYTES, 0,
5104 ST.c2 = ST.c1 = utf8n_to_uvchr(s, UTF8_MAXBYTES, 0,
5111 ST.c1 = ST.c2 = CHRTEST_VOID;
5116 PL_reginput = locinput;
5119 if (ST.min && regrepeat(rex, ST.A, ST.min, depth) < ST.min)
5122 locinput = PL_reginput;
5124 if (ST.c1 == CHRTEST_VOID)
5125 goto curly_try_B_min;
5127 ST.oldloc = locinput;
5129 /* set ST.maxpos to the furthest point along the
5130 * string that could possibly match */
5131 if (ST.max == REG_INFTY) {
5132 ST.maxpos = PL_regeol - 1;
5134 while (UTF8_IS_CONTINUATION(*(U8*)ST.maxpos))
5137 else if (utf8_target) {
5138 int m = ST.max - ST.min;
5139 for (ST.maxpos = locinput;
5140 m >0 && ST.maxpos + UTF8SKIP(ST.maxpos) <= PL_regeol; m--)
5141 ST.maxpos += UTF8SKIP(ST.maxpos);
5144 ST.maxpos = locinput + ST.max - ST.min;
5145 if (ST.maxpos >= PL_regeol)
5146 ST.maxpos = PL_regeol - 1;
5148 goto curly_try_B_min_known;
5152 ST.count = regrepeat(rex, ST.A, ST.max, depth);
5153 locinput = PL_reginput;
5154 if (ST.count < ST.min)
5156 if ((ST.count > ST.min)
5157 && (PL_regkind[OP(ST.B)] == EOL) && (OP(ST.B) != MEOL))
5159 /* A{m,n} must come at the end of the string, there's
5160 * no point in backing off ... */
5162 /* ...except that $ and \Z can match before *and* after
5163 newline at the end. Consider "\n\n" =~ /\n+\Z\n/.
5164 We may back off by one in this case. */
5165 if (UCHARAT(PL_reginput - 1) == '\n' && OP(ST.B) != EOS)
5169 goto curly_try_B_max;
5174 case CURLY_B_min_known_fail:
5175 /* failed to find B in a non-greedy match where c1,c2 valid */
5176 if (ST.paren && ST.count)
5177 PL_regoffs[ST.paren].end = -1;
5179 PL_reginput = locinput; /* Could be reset... */
5180 REGCP_UNWIND(ST.cp);
5181 /* Couldn't or didn't -- move forward. */
5182 ST.oldloc = locinput;
5184 locinput += UTF8SKIP(locinput);
5188 curly_try_B_min_known:
5189 /* find the next place where 'B' could work, then call B */
5193 n = (ST.oldloc == locinput) ? 0 : 1;
5194 if (ST.c1 == ST.c2) {
5196 /* set n to utf8_distance(oldloc, locinput) */
5197 while (locinput <= ST.maxpos &&
5198 utf8n_to_uvchr((U8*)locinput,
5199 UTF8_MAXBYTES, &len,
5200 uniflags) != (UV)ST.c1) {
5206 /* set n to utf8_distance(oldloc, locinput) */
5207 while (locinput <= ST.maxpos) {
5209 const UV c = utf8n_to_uvchr((U8*)locinput,
5210 UTF8_MAXBYTES, &len,
5212 if (c == (UV)ST.c1 || c == (UV)ST.c2)
5220 if (ST.c1 == ST.c2) {
5221 while (locinput <= ST.maxpos &&
5222 UCHARAT(locinput) != ST.c1)
5226 while (locinput <= ST.maxpos
5227 && UCHARAT(locinput) != ST.c1
5228 && UCHARAT(locinput) != ST.c2)
5231 n = locinput - ST.oldloc;
5233 if (locinput > ST.maxpos)
5235 /* PL_reginput == oldloc now */
5238 if (regrepeat(rex, ST.A, n, depth) < n)
5241 PL_reginput = locinput;
5242 CURLY_SETPAREN(ST.paren, ST.count);
5243 if (cur_eval && cur_eval->u.eval.close_paren &&
5244 cur_eval->u.eval.close_paren == (U32)ST.paren) {
5247 PUSH_STATE_GOTO(CURLY_B_min_known, ST.B);
5252 case CURLY_B_min_fail:
5253 /* failed to find B in a non-greedy match where c1,c2 invalid */
5254 if (ST.paren && ST.count)
5255 PL_regoffs[ST.paren].end = -1;
5257 REGCP_UNWIND(ST.cp);
5258 /* failed -- move forward one */
5259 PL_reginput = locinput;
5260 if (regrepeat(rex, ST.A, 1, depth)) {
5262 locinput = PL_reginput;
5263 if (ST.count <= ST.max || (ST.max == REG_INFTY &&
5264 ST.count > 0)) /* count overflow ? */
5267 CURLY_SETPAREN(ST.paren, ST.count);
5268 if (cur_eval && cur_eval->u.eval.close_paren &&
5269 cur_eval->u.eval.close_paren == (U32)ST.paren) {
5272 PUSH_STATE_GOTO(CURLY_B_min, ST.B);
5280 /* a successful greedy match: now try to match B */
5281 if (cur_eval && cur_eval->u.eval.close_paren &&
5282 cur_eval->u.eval.close_paren == (U32)ST.paren) {
5287 if (ST.c1 != CHRTEST_VOID)
5288 c = utf8_target ? utf8n_to_uvchr((U8*)PL_reginput,
5289 UTF8_MAXBYTES, 0, uniflags)
5290 : (UV) UCHARAT(PL_reginput);
5291 /* If it could work, try it. */
5292 if (ST.c1 == CHRTEST_VOID || c == (UV)ST.c1 || c == (UV)ST.c2) {
5293 CURLY_SETPAREN(ST.paren, ST.count);
5294 PUSH_STATE_GOTO(CURLY_B_max, ST.B);
5299 case CURLY_B_max_fail:
5300 /* failed to find B in a greedy match */
5301 if (ST.paren && ST.count)
5302 PL_regoffs[ST.paren].end = -1;
5304 REGCP_UNWIND(ST.cp);
5306 if (--ST.count < ST.min)
5308 PL_reginput = locinput = HOPc(locinput, -1);
5309 goto curly_try_B_max;
5316 /* we've just finished A in /(??{A})B/; now continue with B */
5318 st->u.eval.toggle_reg_flags
5319 = cur_eval->u.eval.toggle_reg_flags;
5320 PL_reg_flags ^= st->u.eval.toggle_reg_flags;
5322 st->u.eval.prev_rex = rex_sv; /* inner */
5323 SETREX(rex_sv,cur_eval->u.eval.prev_rex);
5324 rex = (struct regexp *)SvANY(rex_sv);
5325 rexi = RXi_GET(rex);
5326 cur_curlyx = cur_eval->u.eval.prev_curlyx;
5327 ReREFCNT_inc(rex_sv);
5328 st->u.eval.cp = regcppush(0); /* Save *all* the positions. */
5330 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
5331 PL_reglastparen = &rex->lastparen;
5332 PL_reglastcloseparen = &rex->lastcloseparen;
5334 REGCP_SET(st->u.eval.lastcp);
5335 PL_reginput = locinput;
5337 /* Restore parens of the outer rex without popping the
5339 tmpix = PL_savestack_ix;
5340 PL_savestack_ix = cur_eval->u.eval.lastcp;
5342 PL_savestack_ix = tmpix;
5344 st->u.eval.prev_eval = cur_eval;
5345 cur_eval = cur_eval->u.eval.prev_eval;
5347 PerlIO_printf(Perl_debug_log, "%*s EVAL trying tail ... %"UVxf"\n",
5348 REPORT_CODE_OFF+depth*2, "",PTR2UV(cur_eval)););
5349 if ( nochange_depth )
5352 PUSH_YES_STATE_GOTO(EVAL_AB,
5353 st->u.eval.prev_eval->u.eval.B); /* match B */
5356 if (locinput < reginfo->till) {
5357 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
5358 "%sMatch possible, but length=%ld is smaller than requested=%ld, failing!%s\n",
5360 (long)(locinput - PL_reg_starttry),
5361 (long)(reginfo->till - PL_reg_starttry),
5364 sayNO_SILENT; /* Cannot match: too short. */
5366 PL_reginput = locinput; /* put where regtry can find it */
5367 sayYES; /* Success! */
5369 case SUCCEED: /* successful SUSPEND/UNLESSM/IFMATCH/CURLYM */
5371 PerlIO_printf(Perl_debug_log,
5372 "%*s %ssubpattern success...%s\n",
5373 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5]));
5374 PL_reginput = locinput; /* put where regtry can find it */
5375 sayYES; /* Success! */
5378 #define ST st->u.ifmatch
5380 case SUSPEND: /* (?>A) */
5382 PL_reginput = locinput;
5385 case UNLESSM: /* -ve lookaround: (?!A), or with flags, (?<!A) */
5387 goto ifmatch_trivial_fail_test;
5389 case IFMATCH: /* +ve lookaround: (?=A), or with flags, (?<=A) */
5391 ifmatch_trivial_fail_test:
5393 char * const s = HOPBACKc(locinput, scan->flags);
5398 sw = 1 - cBOOL(ST.wanted);
5402 next = scan + ARG(scan);
5410 PL_reginput = locinput;
5414 ST.logical = logical;
5415 logical = 0; /* XXX: reset state of logical once it has been saved into ST */
5417 /* execute body of (?...A) */
5418 PUSH_YES_STATE_GOTO(IFMATCH_A, NEXTOPER(NEXTOPER(scan)));
5421 case IFMATCH_A_fail: /* body of (?...A) failed */
5422 ST.wanted = !ST.wanted;
5425 case IFMATCH_A: /* body of (?...A) succeeded */
5427 sw = cBOOL(ST.wanted);
5429 else if (!ST.wanted)
5432 if (OP(ST.me) == SUSPEND)
5433 locinput = PL_reginput;
5435 locinput = PL_reginput = st->locinput;
5436 nextchr = UCHARAT(locinput);
5438 scan = ST.me + ARG(ST.me);
5441 continue; /* execute B */
5446 next = scan + ARG(scan);
5451 reginfo->cutpoint = PL_regeol;
5454 PL_reginput = locinput;
5456 sv_yes_mark = sv_commit = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5457 PUSH_STATE_GOTO(COMMIT_next,next);
5459 case COMMIT_next_fail:
5466 #define ST st->u.mark
5468 ST.prev_mark = mark_state;
5469 ST.mark_name = sv_commit = sv_yes_mark
5470 = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5472 ST.mark_loc = PL_reginput = locinput;
5473 PUSH_YES_STATE_GOTO(MARKPOINT_next,next);
5475 case MARKPOINT_next:
5476 mark_state = ST.prev_mark;
5479 case MARKPOINT_next_fail:
5480 if (popmark && sv_eq(ST.mark_name,popmark))
5482 if (ST.mark_loc > startpoint)
5483 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5484 popmark = NULL; /* we found our mark */
5485 sv_commit = ST.mark_name;
5488 PerlIO_printf(Perl_debug_log,
5489 "%*s %ssetting cutpoint to mark:%"SVf"...%s\n",
5490 REPORT_CODE_OFF+depth*2, "",
5491 PL_colors[4], SVfARG(sv_commit), PL_colors[5]);
5494 mark_state = ST.prev_mark;
5495 sv_yes_mark = mark_state ?
5496 mark_state->u.mark.mark_name : NULL;
5500 PL_reginput = locinput;
5502 /* (*SKIP) : if we fail we cut here*/
5503 ST.mark_name = NULL;
5504 ST.mark_loc = locinput;
5505 PUSH_STATE_GOTO(SKIP_next,next);
5507 /* (*SKIP:NAME) : if there is a (*MARK:NAME) fail where it was,
5508 otherwise do nothing. Meaning we need to scan
5510 regmatch_state *cur = mark_state;
5511 SV *find = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5514 if ( sv_eq( cur->u.mark.mark_name,
5517 ST.mark_name = find;
5518 PUSH_STATE_GOTO( SKIP_next, next );
5520 cur = cur->u.mark.prev_mark;
5523 /* Didn't find our (*MARK:NAME) so ignore this (*SKIP:NAME) */
5525 case SKIP_next_fail:
5527 /* (*CUT:NAME) - Set up to search for the name as we
5528 collapse the stack*/
5529 popmark = ST.mark_name;
5531 /* (*CUT) - No name, we cut here.*/
5532 if (ST.mark_loc > startpoint)
5533 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5534 /* but we set sv_commit to latest mark_name if there
5535 is one so they can test to see how things lead to this
5538 sv_commit=mark_state->u.mark.mark_name;
5546 if ( n == (U32)what_len_TRICKYFOLD(locinput,utf8_target,ln) ) {
5548 } else if ( LATIN_SMALL_LETTER_SHARP_S == n && !utf8_target && !UTF_PATTERN ) {
5551 U8 folded[UTF8_MAXBYTES_CASE+1];
5553 const char * const l = locinput;
5554 char *e = PL_regeol;
5555 to_uni_fold(n, folded, &foldlen);
5557 if (! foldEQ_utf8((const char*) folded, 0, foldlen, 1,
5558 l, &e, 0, utf8_target)) {
5563 nextchr = UCHARAT(locinput);
5566 if ((n=is_LNBREAK(locinput,utf8_target))) {
5568 nextchr = UCHARAT(locinput);
5573 #define CASE_CLASS(nAmE) \
5575 if ((n=is_##nAmE(locinput,utf8_target))) { \
5577 nextchr = UCHARAT(locinput); \
5582 if ((n=is_##nAmE(locinput,utf8_target))) { \
5585 locinput += UTF8SKIP(locinput); \
5586 nextchr = UCHARAT(locinput); \
5591 CASE_CLASS(HORIZWS);
5595 PerlIO_printf(Perl_error_log, "%"UVxf" %d\n",
5596 PTR2UV(scan), OP(scan));
5597 Perl_croak(aTHX_ "regexp memory corruption");
5601 /* switch break jumps here */
5602 scan = next; /* prepare to execute the next op and ... */
5603 continue; /* ... jump back to the top, reusing st */
5607 /* push a state that backtracks on success */
5608 st->u.yes.prev_yes_state = yes_state;
5612 /* push a new regex state, then continue at scan */
5614 regmatch_state *newst;
5617 regmatch_state *cur = st;
5618 regmatch_state *curyes = yes_state;
5620 regmatch_slab *slab = PL_regmatch_slab;
5621 for (;curd > -1;cur--,curd--) {
5622 if (cur < SLAB_FIRST(slab)) {
5624 cur = SLAB_LAST(slab);
5626 PerlIO_printf(Perl_error_log, "%*s#%-3d %-10s %s\n",
5627 REPORT_CODE_OFF + 2 + depth * 2,"",
5628 curd, PL_reg_name[cur->resume_state],
5629 (curyes == cur) ? "yes" : ""
5632 curyes = cur->u.yes.prev_yes_state;
5635 DEBUG_STATE_pp("push")
5638 st->locinput = locinput;
5640 if (newst > SLAB_LAST(PL_regmatch_slab))
5641 newst = S_push_slab(aTHX);
5642 PL_regmatch_state = newst;
5644 locinput = PL_reginput;
5645 nextchr = UCHARAT(locinput);
5653 * We get here only if there's trouble -- normally "case END" is
5654 * the terminating point.
5656 Perl_croak(aTHX_ "corrupted regexp pointers");
5662 /* we have successfully completed a subexpression, but we must now
5663 * pop to the state marked by yes_state and continue from there */
5664 assert(st != yes_state);
5666 while (st != yes_state) {
5668 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5669 PL_regmatch_slab = PL_regmatch_slab->prev;
5670 st = SLAB_LAST(PL_regmatch_slab);
5674 DEBUG_STATE_pp("pop (no final)");
5676 DEBUG_STATE_pp("pop (yes)");
5682 while (yes_state < SLAB_FIRST(PL_regmatch_slab)
5683 || yes_state > SLAB_LAST(PL_regmatch_slab))
5685 /* not in this slab, pop slab */
5686 depth -= (st - SLAB_FIRST(PL_regmatch_slab) + 1);
5687 PL_regmatch_slab = PL_regmatch_slab->prev;
5688 st = SLAB_LAST(PL_regmatch_slab);
5690 depth -= (st - yes_state);
5693 yes_state = st->u.yes.prev_yes_state;
5694 PL_regmatch_state = st;
5697 locinput= st->locinput;
5698 nextchr = UCHARAT(locinput);
5700 state_num = st->resume_state + no_final;
5701 goto reenter_switch;
5704 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch successful!%s\n",
5705 PL_colors[4], PL_colors[5]));
5707 if (PL_reg_eval_set) {
5708 /* each successfully executed (?{...}) block does the equivalent of
5709 * local $^R = do {...}
5710 * When popping the save stack, all these locals would be undone;
5711 * bypass this by setting the outermost saved $^R to the latest
5713 if (oreplsv != GvSV(PL_replgv))
5714 sv_setsv(oreplsv, GvSV(PL_replgv));
5721 PerlIO_printf(Perl_debug_log,
5722 "%*s %sfailed...%s\n",
5723 REPORT_CODE_OFF+depth*2, "",
5724 PL_colors[4], PL_colors[5])
5736 /* there's a previous state to backtrack to */
5738 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5739 PL_regmatch_slab = PL_regmatch_slab->prev;
5740 st = SLAB_LAST(PL_regmatch_slab);
5742 PL_regmatch_state = st;
5743 locinput= st->locinput;
5744 nextchr = UCHARAT(locinput);
5746 DEBUG_STATE_pp("pop");
5748 if (yes_state == st)
5749 yes_state = st->u.yes.prev_yes_state;
5751 state_num = st->resume_state + 1; /* failure = success + 1 */
5752 goto reenter_switch;
5757 if (rex->intflags & PREGf_VERBARG_SEEN) {
5758 SV *sv_err = get_sv("REGERROR", 1);
5759 SV *sv_mrk = get_sv("REGMARK", 1);
5761 sv_commit = &PL_sv_no;
5763 sv_yes_mark = &PL_sv_yes;
5766 sv_commit = &PL_sv_yes;
5767 sv_yes_mark = &PL_sv_no;
5769 sv_setsv(sv_err, sv_commit);
5770 sv_setsv(sv_mrk, sv_yes_mark);
5773 /* clean up; in particular, free all slabs above current one */
5774 LEAVE_SCOPE(oldsave);
5780 - regrepeat - repeatedly match something simple, report how many
5783 * [This routine now assumes that it will only match on things of length 1.
5784 * That was true before, but now we assume scan - reginput is the count,
5785 * rather than incrementing count on every character. [Er, except utf8.]]
5788 S_regrepeat(pTHX_ const regexp *prog, const regnode *p, I32 max, int depth)
5791 register char *scan;
5793 register char *loceol = PL_regeol;
5794 register I32 hardcount = 0;
5795 register bool utf8_target = PL_reg_match_utf8;
5797 PERL_UNUSED_ARG(depth);
5800 PERL_ARGS_ASSERT_REGREPEAT;
5803 if (max == REG_INFTY)
5805 else if (max < loceol - scan)
5806 loceol = scan + max;
5811 while (scan < loceol && hardcount < max && *scan != '\n') {
5812 scan += UTF8SKIP(scan);
5816 while (scan < loceol && *scan != '\n')
5823 while (scan < loceol && hardcount < max) {
5824 scan += UTF8SKIP(scan);
5835 /* To get here, EXACTish nodes must have *byte* length == 1. That
5836 * means they match only characters in the string that can be expressed
5837 * as a single byte. For non-utf8 strings, that means a simple match.
5838 * For utf8 strings, the character matched must be an invariant, or
5839 * downgradable to a single byte. The pattern's utf8ness is
5840 * irrelevant, as since it's a single byte, it either isn't utf8, or if
5841 * it is, it's an invariant */
5844 assert(! UTF_PATTERN || UNI_IS_INVARIANT(c));
5846 if (! utf8_target || UNI_IS_INVARIANT(c)) {
5847 while (scan < loceol && UCHARAT(scan) == c) {
5853 /* Here, the string is utf8, and the pattern char is different
5854 * in utf8 than not, so can't compare them directly. Outside the
5855 * loop, find find the two utf8 bytes that represent c, and then
5856 * look for those in sequence in the utf8 string */
5857 U8 high = UTF8_TWO_BYTE_HI(c);
5858 U8 low = UTF8_TWO_BYTE_LO(c);
5861 while (hardcount < max
5862 && scan + 1 < loceol
5863 && UCHARAT(scan) == high
5864 && UCHARAT(scan + 1) == low)
5872 PL_reg_flags |= RF_tainted;
5877 /* The comments for the EXACT case above apply as well to these fold
5881 assert(! UTF_PATTERN || UNI_IS_INVARIANT(c));
5883 if (utf8_target) { /* Use full Unicode fold matching */
5885 /* For the EXACTFL case, It doesn't really make sense to compare
5886 * locale and utf8, but it is best we can do. The documents warn
5887 * against mixing them */
5889 char *tmpeol = loceol;
5890 while (hardcount < max
5891 && foldEQ_utf8(scan, &tmpeol, 0, utf8_target,
5892 STRING(p), NULL, 1, cBOOL(UTF_PATTERN)))
5899 /* XXX Note that the above handles properly the German sharp s in
5900 * the pattern matching ss in the string. But it doesn't handle
5901 * properly cases where the string contains say 'LIGATURE ff' and
5902 * the pattern is 'f+'. This would require, say, a new function or
5903 * revised interface to foldEQ_utf8(), in which the maximum number
5904 * of characters to match could be passed and it would return how
5905 * many actually did. This is just one of many cases where
5906 * multi-char folds don't work properly, and so the fix is being
5912 /* Here, the string isn't utf8 and c is a single byte; and either
5913 * the pattern isn't utf8 or c is an invariant, so its utf8ness
5914 * doesn't affect c. Can just do simple comparisons for exact or
5917 case EXACTF: folded = PL_fold[c]; break;
5918 case EXACTFU: folded = PL_fold_latin1[c]; break;
5919 case EXACTFL: folded = PL_fold_locale[c]; break;
5920 default: Perl_croak(aTHX_ "panic: Unexpected op %u", OP(p));
5922 while (scan < loceol &&
5923 (UCHARAT(scan) == c || UCHARAT(scan) == folded))
5932 while (hardcount < max && scan < loceol &&
5933 reginclass(prog, p, (U8*)scan, 0, utf8_target)) {
5934 scan += UTF8SKIP(scan);
5938 while (scan < loceol && REGINCLASS(prog, p, (U8*)scan))
5945 LOAD_UTF8_CHARCLASS_ALNUM();
5946 while (hardcount < max && scan < loceol &&
5947 swash_fetch(PL_utf8_alnum, (U8*)scan, utf8_target))
5949 scan += UTF8SKIP(scan);
5952 } else if (FLAGS(p) & USE_UNI) {
5953 while (scan < loceol && isWORDCHAR_L1((U8) *scan)) {
5957 while (scan < loceol && isALNUM((U8) *scan)) {
5963 PL_reg_flags |= RF_tainted;
5966 while (hardcount < max && scan < loceol &&
5967 isALNUM_LC_utf8((U8*)scan)) {
5968 scan += UTF8SKIP(scan);
5972 while (scan < loceol && isALNUM_LC(*scan))
5979 LOAD_UTF8_CHARCLASS_ALNUM();
5980 while (hardcount < max && scan < loceol &&
5981 !swash_fetch(PL_utf8_alnum, (U8*)scan, utf8_target))
5983 scan += UTF8SKIP(scan);
5986 } else if (FLAGS(p) & USE_UNI) {
5987 while (scan < loceol && ! isWORDCHAR_L1((U8) *scan)) {
5991 while (scan < loceol && ! isALNUM((U8) *scan)) {
5997 PL_reg_flags |= RF_tainted;
6000 while (hardcount < max && scan < loceol &&
6001 !isALNUM_LC_utf8((U8*)scan)) {
6002 scan += UTF8SKIP(scan);
6006 while (scan < loceol && !isALNUM_LC(*scan))
6013 LOAD_UTF8_CHARCLASS_SPACE();
6014 while (hardcount < max && scan < loceol &&
6016 swash_fetch(PL_utf8_space,(U8*)scan, utf8_target)))
6018 scan += UTF8SKIP(scan);
6021 } else if (FLAGS(p) & USE_UNI) {
6022 while (scan < loceol && isSPACE_L1((U8) *scan)) {
6026 while (scan < loceol && isSPACE((U8) *scan))
6031 PL_reg_flags |= RF_tainted;
6034 while (hardcount < max && scan < loceol &&
6035 isSPACE_LC_utf8((U8*)scan)) {
6036 scan += UTF8SKIP(scan);
6040 while (scan < loceol && isSPACE_LC(*scan))
6047 LOAD_UTF8_CHARCLASS_SPACE();
6048 while (hardcount < max && scan < loceol &&
6050 swash_fetch(PL_utf8_space,(U8*)scan, utf8_target)))
6052 scan += UTF8SKIP(scan);
6055 } else if (FLAGS(p) & USE_UNI) {
6056 while (scan < loceol && ! isSPACE_L1((U8) *scan)) {
6060 while (scan < loceol && ! isSPACE((U8) *scan)) {
6066 PL_reg_flags |= RF_tainted;
6069 while (hardcount < max && scan < loceol &&
6070 !isSPACE_LC_utf8((U8*)scan)) {
6071 scan += UTF8SKIP(scan);
6075 while (scan < loceol && !isSPACE_LC(*scan))
6082 LOAD_UTF8_CHARCLASS_DIGIT();
6083 while (hardcount < max && scan < loceol &&
6084 swash_fetch(PL_utf8_digit, (U8*)scan, utf8_target)) {
6085 scan += UTF8SKIP(scan);
6089 while (scan < loceol && isDIGIT(*scan))
6094 PL_reg_flags |= RF_tainted;
6097 while (hardcount < max && scan < loceol &&
6098 isDIGIT_LC_utf8((U8*)scan)) {
6099 scan += UTF8SKIP(scan);
6103 while (scan < loceol && isDIGIT_LC(*scan))
6110 LOAD_UTF8_CHARCLASS_DIGIT();
6111 while (hardcount < max && scan < loceol &&
6112 !swash_fetch(PL_utf8_digit, (U8*)scan, utf8_target)) {
6113 scan += UTF8SKIP(scan);
6117 while (scan < loceol && !isDIGIT(*scan))
6121 PL_reg_flags |= RF_tainted;
6124 while (hardcount < max && scan < loceol &&
6125 !isDIGIT_LC_utf8((U8*)scan)) {
6126 scan += UTF8SKIP(scan);
6130 while (scan < loceol && !isDIGIT_LC(*scan))
6137 while (hardcount < max && scan < loceol && (c=is_LNBREAK_utf8(scan))) {
6143 LNBREAK can match two latin chars, which is ok,
6144 because we have a null terminated string, but we
6145 have to use hardcount in this situation
6147 while (scan < loceol && (c=is_LNBREAK_latin1(scan))) {
6156 while (hardcount < max && scan < loceol && (c=is_HORIZWS_utf8(scan))) {
6161 while (scan < loceol && is_HORIZWS_latin1(scan))
6168 while (hardcount < max && scan < loceol && !is_HORIZWS_utf8(scan)) {
6169 scan += UTF8SKIP(scan);
6173 while (scan < loceol && !is_HORIZWS_latin1(scan))
6181 while (hardcount < max && scan < loceol && (c=is_VERTWS_utf8(scan))) {
6186 while (scan < loceol && is_VERTWS_latin1(scan))
6194 while (hardcount < max && scan < loceol && !is_VERTWS_utf8(scan)) {
6195 scan += UTF8SKIP(scan);
6199 while (scan < loceol && !is_VERTWS_latin1(scan))
6205 default: /* Called on something of 0 width. */
6206 break; /* So match right here or not at all. */
6212 c = scan - PL_reginput;
6216 GET_RE_DEBUG_FLAGS_DECL;
6218 SV * const prop = sv_newmortal();
6219 regprop(prog, prop, p);
6220 PerlIO_printf(Perl_debug_log,
6221 "%*s %s can match %"IVdf" times out of %"IVdf"...\n",
6222 REPORT_CODE_OFF + depth*2, "", SvPVX_const(prop),(IV)c,(IV)max);
6230 #if !defined(PERL_IN_XSUB_RE) || defined(PLUGGABLE_RE_EXTENSION)
6232 - regclass_swash - prepare the utf8 swash
6236 Perl_regclass_swash(pTHX_ const regexp *prog, register const regnode* node, bool doinit, SV** listsvp, SV **altsvp)
6242 RXi_GET_DECL(prog,progi);
6243 const struct reg_data * const data = prog ? progi->data : NULL;
6245 PERL_ARGS_ASSERT_REGCLASS_SWASH;
6247 if (data && data->count) {
6248 const U32 n = ARG(node);
6250 if (data->what[n] == 's') {
6251 SV * const rv = MUTABLE_SV(data->data[n]);
6252 AV * const av = MUTABLE_AV(SvRV(rv));
6253 SV **const ary = AvARRAY(av);
6256 /* See the end of regcomp.c:S_regclass() for
6257 * documentation of these array elements. */
6260 a = SvROK(ary[1]) ? &ary[1] : NULL;
6261 b = SvTYPE(ary[2]) == SVt_PVAV ? &ary[2] : NULL;
6265 else if (si && doinit) {
6266 sw = swash_init("utf8", "", si, 1, 0);
6267 (void)av_store(av, 1, sw);
6284 - reginclass - determine if a character falls into a character class
6286 n is the ANYOF regnode
6287 p is the target string
6288 lenp is pointer to the maximum number of bytes of how far to go in p
6289 (This is assumed wthout checking to always be at least the current
6291 utf8_target tells whether p is in UTF-8.
6293 Returns true if matched; false otherwise. If lenp is not NULL, on return
6294 from a successful match, the value it points to will be updated to how many
6295 bytes in p were matched. If there was no match, the value is undefined,
6296 possibly changed from the input.
6301 S_reginclass(pTHX_ const regexp * const prog, register const regnode * const n, register const U8* const p, STRLEN* lenp, register const bool utf8_target)
6304 const char flags = ANYOF_FLAGS(n);
6310 PERL_ARGS_ASSERT_REGINCLASS;
6312 /* If c is not already the code point, get it */
6313 if (utf8_target && !UTF8_IS_INVARIANT(c)) {
6314 c = utf8n_to_uvchr(p, UTF8_MAXBYTES, &c_len,
6315 (UTF8_ALLOW_DEFAULT & UTF8_ALLOW_ANYUV)
6316 | UTF8_ALLOW_FFFF | UTF8_CHECK_ONLY);
6317 /* see [perl #37836] for UTF8_ALLOW_ANYUV; [perl #38293] for
6318 * UTF8_ALLOW_FFFF */
6319 if (c_len == (STRLEN)-1)
6320 Perl_croak(aTHX_ "Malformed UTF-8 character (fatal)");
6326 /* Use passed in max length, or one character if none passed in or less
6327 * than one character. And assume will match just one character. This is
6328 * overwritten later if matched more. */
6330 maxlen = (*lenp > c_len) ? *lenp : c_len;
6338 /* If this character is potentially in the bitmap, check it */
6340 if (ANYOF_BITMAP_TEST(n, c))
6343 else if (flags & ANYOF_LOCALE) {
6344 PL_reg_flags |= RF_tainted;
6346 if ((flags & ANYOF_LOC_NONBITMAP_FOLD)
6347 && ANYOF_BITMAP_TEST(n, PL_fold_locale[c]))
6351 else if (ANYOF_CLASS_TEST_ANY_SET(n) &&
6352 ((ANYOF_CLASS_TEST(n, ANYOF_ALNUM) && isALNUM_LC(c)) ||
6353 (ANYOF_CLASS_TEST(n, ANYOF_NALNUM) && !isALNUM_LC(c)) ||
6354 (ANYOF_CLASS_TEST(n, ANYOF_SPACE) && isSPACE_LC(c)) ||
6355 (ANYOF_CLASS_TEST(n, ANYOF_NSPACE) && !isSPACE_LC(c)) ||
6356 (ANYOF_CLASS_TEST(n, ANYOF_DIGIT) && isDIGIT_LC(c)) ||
6357 (ANYOF_CLASS_TEST(n, ANYOF_NDIGIT) && !isDIGIT_LC(c)) ||
6358 (ANYOF_CLASS_TEST(n, ANYOF_ALNUMC) && isALNUMC_LC(c)) ||
6359 (ANYOF_CLASS_TEST(n, ANYOF_NALNUMC) && !isALNUMC_LC(c)) ||
6360 (ANYOF_CLASS_TEST(n, ANYOF_ALPHA) && isALPHA_LC(c)) ||
6361 (ANYOF_CLASS_TEST(n, ANYOF_NALPHA) && !isALPHA_LC(c)) ||
6362 (ANYOF_CLASS_TEST(n, ANYOF_ASCII) && isASCII(c)) ||
6363 (ANYOF_CLASS_TEST(n, ANYOF_NASCII) && !isASCII(c)) ||
6364 (ANYOF_CLASS_TEST(n, ANYOF_CNTRL) && isCNTRL_LC(c)) ||
6365 (ANYOF_CLASS_TEST(n, ANYOF_NCNTRL) && !isCNTRL_LC(c)) ||
6366 (ANYOF_CLASS_TEST(n, ANYOF_GRAPH) && isGRAPH_LC(c)) ||
6367 (ANYOF_CLASS_TEST(n, ANYOF_NGRAPH) && !isGRAPH_LC(c)) ||
6368 (ANYOF_CLASS_TEST(n, ANYOF_LOWER) && isLOWER_LC(c)) ||
6369 (ANYOF_CLASS_TEST(n, ANYOF_NLOWER) && !isLOWER_LC(c)) ||
6370 (ANYOF_CLASS_TEST(n, ANYOF_PRINT) && isPRINT_LC(c)) ||
6371 (ANYOF_CLASS_TEST(n, ANYOF_NPRINT) && !isPRINT_LC(c)) ||
6372 (ANYOF_CLASS_TEST(n, ANYOF_PUNCT) && isPUNCT_LC(c)) ||
6373 (ANYOF_CLASS_TEST(n, ANYOF_NPUNCT) && !isPUNCT_LC(c)) ||
6374 (ANYOF_CLASS_TEST(n, ANYOF_UPPER) && isUPPER_LC(c)) ||
6375 (ANYOF_CLASS_TEST(n, ANYOF_NUPPER) && !isUPPER_LC(c)) ||
6376 (ANYOF_CLASS_TEST(n, ANYOF_XDIGIT) && isXDIGIT(c)) ||
6377 (ANYOF_CLASS_TEST(n, ANYOF_NXDIGIT) && !isXDIGIT(c)) ||
6378 (ANYOF_CLASS_TEST(n, ANYOF_PSXSPC) && isPSXSPC(c)) ||
6379 (ANYOF_CLASS_TEST(n, ANYOF_NPSXSPC) && !isPSXSPC(c)) ||
6380 (ANYOF_CLASS_TEST(n, ANYOF_BLANK) && isBLANK(c)) ||
6381 (ANYOF_CLASS_TEST(n, ANYOF_NBLANK) && !isBLANK(c))
6382 ) /* How's that for a conditional? */
6389 /* If the bitmap didn't (or couldn't) match, and something outside the
6390 * bitmap could match, try that */
6392 if (utf8_target && (flags & ANYOF_UNICODE_ALL)) {
6394 || ((flags & ANYOF_LOC_NONBITMAP_FOLD) /* Latin1 1 that has a
6397 && _HAS_NONLATIN1_FOLD_CLOSURE_ONLY_FOR_USE_BY_REGCOMP_DOT_C_AND_REGEXEC_DOT_C(c)))
6402 if (!match && ((flags & ANYOF_NONBITMAP_NON_UTF8)
6403 || (utf8_target && flags & ANYOF_UTF8)))
6406 SV * const sw = regclass_swash(prog, n, TRUE, 0, (SV**)&av);
6414 utf8_p = bytes_to_utf8(p, &len);
6416 if (swash_fetch(sw, utf8_p, 1))
6418 else if (flags & ANYOF_LOC_NONBITMAP_FOLD) {
6419 if (!match && lenp && av) {
6421 for (i = 0; i <= av_len(av); i++) {
6422 SV* const sv = *av_fetch(av, i, FALSE);
6424 const char * const s = SvPV_const(sv, len);
6425 if (len <= maxlen && memEQ(s, (char*)utf8_p, len)) {
6432 if (!match) { /* See if the folded version matches */
6433 U8 folded[UTF8_MAXBYTES_CASE+1];
6437 to_utf8_fold(utf8_p, folded, &foldlen);
6439 /* Consider "k" =~ /[K]/i. The line above would have
6440 * just folded the 'k' to itself, and that isn't going
6441 * to match 'K'. So we look through the closure of
6442 * everything that folds to 'k'. That will find the
6443 * 'K'. Initialize the list, if necessary */
6444 if (! PL_utf8_foldclosures) {
6446 /* If the folds haven't been read in, call a fold
6447 * function to force that */
6448 if (! PL_utf8_tofold) {
6449 U8 dummy[UTF8_MAXBYTES+1];
6451 to_utf8_fold((U8*) "A", dummy, &dummy_len);
6453 PL_utf8_foldclosures =
6454 _swash_inversion_hash(PL_utf8_tofold);
6457 /* The data structure is a hash with the keys every
6458 * character that is folded to, like 'k', and the
6459 * values each an array of everything that folds to its
6460 * key. e.g. [ 'k', 'K', KELVIN_SIGN ] */
6461 if ((listp = hv_fetch(PL_utf8_foldclosures,
6462 (char *) folded, foldlen, FALSE)))
6464 AV* list = (AV*) *listp;
6466 for (i = 0; i <= av_len(list); i++) {
6467 SV** try_p = av_fetch(list, i, FALSE);
6469 if (try_p == NULL) {
6470 Perl_croak(aTHX_ "panic: invalid PL_utf8_foldclosures structure");
6472 /* Don't have to worry about embedded nulls
6473 * since NULL isn't folded or foldable */
6474 try_c = SvPVX(*try_p);
6476 /* The fold in a few cases of an above Latin1
6477 * char is in the Latin1 range, and hence may
6478 * be in the bitmap */
6479 if (UTF8_IS_INVARIANT(*try_c)
6480 && ANYOF_BITMAP_TEST(n,
6481 UNI_TO_NATIVE(*try_c)))
6487 (UTF8_IS_DOWNGRADEABLE_START(*try_c)
6488 && ANYOF_BITMAP_TEST(n, UNI_TO_NATIVE(
6489 TWO_BYTE_UTF8_TO_UNI(try_c[0],
6492 /* Since the fold comes from internally
6493 * generated data, we can safely assume it
6494 * is valid utf8 in the test above */
6497 } else if (swash_fetch(sw, (U8*) try_c, 1)) {
6506 /* If we allocated a string above, free it */
6507 if (! utf8_target) Safefree(utf8_p);
6512 return (flags & ANYOF_INVERT) ? !match : match;
6516 S_reghop3(U8 *s, I32 off, const U8* lim)
6520 PERL_ARGS_ASSERT_REGHOP3;
6523 while (off-- && s < lim) {
6524 /* XXX could check well-formedness here */
6529 while (off++ && s > lim) {
6531 if (UTF8_IS_CONTINUED(*s)) {
6532 while (s > lim && UTF8_IS_CONTINUATION(*s))
6535 /* XXX could check well-formedness here */
6542 /* there are a bunch of places where we use two reghop3's that should
6543 be replaced with this routine. but since thats not done yet
6544 we ifdef it out - dmq
6547 S_reghop4(U8 *s, I32 off, const U8* llim, const U8* rlim)
6551 PERL_ARGS_ASSERT_REGHOP4;
6554 while (off-- && s < rlim) {
6555 /* XXX could check well-formedness here */
6560 while (off++ && s > llim) {
6562 if (UTF8_IS_CONTINUED(*s)) {
6563 while (s > llim && UTF8_IS_CONTINUATION(*s))
6566 /* XXX could check well-formedness here */
6574 S_reghopmaybe3(U8* s, I32 off, const U8* lim)
6578 PERL_ARGS_ASSERT_REGHOPMAYBE3;
6581 while (off-- && s < lim) {
6582 /* XXX could check well-formedness here */
6589 while (off++ && s > lim) {
6591 if (UTF8_IS_CONTINUED(*s)) {
6592 while (s > lim && UTF8_IS_CONTINUATION(*s))
6595 /* XXX could check well-formedness here */
6604 restore_pos(pTHX_ void *arg)
6607 regexp * const rex = (regexp *)arg;
6608 if (PL_reg_eval_set) {
6609 if (PL_reg_oldsaved) {
6610 rex->subbeg = PL_reg_oldsaved;
6611 rex->sublen = PL_reg_oldsavedlen;
6612 #ifdef PERL_OLD_COPY_ON_WRITE
6613 rex->saved_copy = PL_nrs;
6615 RXp_MATCH_COPIED_on(rex);
6617 PL_reg_magic->mg_len = PL_reg_oldpos;
6618 PL_reg_eval_set = 0;
6619 PL_curpm = PL_reg_oldcurpm;
6624 S_to_utf8_substr(pTHX_ register regexp *prog)
6628 PERL_ARGS_ASSERT_TO_UTF8_SUBSTR;
6631 if (prog->substrs->data[i].substr
6632 && !prog->substrs->data[i].utf8_substr) {
6633 SV* const sv = newSVsv(prog->substrs->data[i].substr);
6634 prog->substrs->data[i].utf8_substr = sv;
6635 sv_utf8_upgrade(sv);
6636 if (SvVALID(prog->substrs->data[i].substr)) {
6637 const U8 flags = BmFLAGS(prog->substrs->data[i].substr);
6638 if (flags & FBMcf_TAIL) {
6639 /* Trim the trailing \n that fbm_compile added last
6641 SvCUR_set(sv, SvCUR(sv) - 1);
6642 /* Whilst this makes the SV technically "invalid" (as its
6643 buffer is no longer followed by "\0") when fbm_compile()
6644 adds the "\n" back, a "\0" is restored. */
6646 fbm_compile(sv, flags);
6648 if (prog->substrs->data[i].substr == prog->check_substr)
6649 prog->check_utf8 = sv;
6655 S_to_byte_substr(pTHX_ register regexp *prog)
6660 PERL_ARGS_ASSERT_TO_BYTE_SUBSTR;
6663 if (prog->substrs->data[i].utf8_substr
6664 && !prog->substrs->data[i].substr) {
6665 SV* sv = newSVsv(prog->substrs->data[i].utf8_substr);
6666 if (sv_utf8_downgrade(sv, TRUE)) {
6667 if (SvVALID(prog->substrs->data[i].utf8_substr)) {
6669 = BmFLAGS(prog->substrs->data[i].utf8_substr);
6670 if (flags & FBMcf_TAIL) {
6671 /* Trim the trailing \n that fbm_compile added last
6673 SvCUR_set(sv, SvCUR(sv) - 1);
6675 fbm_compile(sv, flags);
6681 prog->substrs->data[i].substr = sv;
6682 if (prog->substrs->data[i].utf8_substr == prog->check_utf8)
6683 prog->check_substr = sv;
6690 * c-indentation-style: bsd
6692 * indent-tabs-mode: t
6695 * ex: set ts=8 sts=4 sw=4 noet: