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 ((PL_reg_flags & RF_utf8) != 0)
90 #define RS_init 1 /* eval environment created */
91 #define RS_set 2 /* replsv value is set */
97 #define REGINCLASS(prog,p,c) (ANYOF_FLAGS(p) ? reginclass(prog,p,c,0,0) : ANYOF_BITMAP_TEST(p,*(c)))
103 #define CHR_SVLEN(sv) (do_utf8 ? sv_len_utf8(sv) : SvCUR(sv))
104 #define CHR_DIST(a,b) (PL_reg_match_utf8 ? utf8_distance(a,b) : a - b)
106 #define HOPc(pos,off) \
107 (char *)(PL_reg_match_utf8 \
108 ? reghop3((U8*)pos, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr)) \
110 #define HOPBACKc(pos, off) \
111 (char*)(PL_reg_match_utf8\
112 ? reghopmaybe3((U8*)pos, -off, (U8*)PL_bostr) \
113 : (pos - off >= PL_bostr) \
117 #define HOP3(pos,off,lim) (PL_reg_match_utf8 ? reghop3((U8*)(pos), off, (U8*)(lim)) : (U8*)(pos + off))
118 #define HOP3c(pos,off,lim) ((char*)HOP3(pos,off,lim))
120 #define LOAD_UTF8_CHARCLASS(class,str) STMT_START { \
121 if (!CAT2(PL_utf8_,class)) { bool ok; ENTER; save_re_context(); ok=CAT2(is_utf8_,class)((const U8*)str); assert(ok); LEAVE; } } STMT_END
122 #define LOAD_UTF8_CHARCLASS_ALNUM() LOAD_UTF8_CHARCLASS(alnum,"a")
123 #define LOAD_UTF8_CHARCLASS_DIGIT() LOAD_UTF8_CHARCLASS(digit,"0")
124 #define LOAD_UTF8_CHARCLASS_SPACE() LOAD_UTF8_CHARCLASS(space," ")
125 #define LOAD_UTF8_CHARCLASS_MARK() LOAD_UTF8_CHARCLASS(mark, "\xcd\x86")
127 /* TODO: Combine JUMPABLE and HAS_TEXT to cache OP(rn) */
129 /* for use after a quantifier and before an EXACT-like node -- japhy */
130 /* it would be nice to rework regcomp.sym to generate this stuff. sigh */
131 #define JUMPABLE(rn) ( \
133 (OP(rn) == CLOSE && (!cur_eval || cur_eval->u.eval.close_paren != ARG(rn))) || \
135 OP(rn) == SUSPEND || OP(rn) == IFMATCH || \
136 OP(rn) == PLUS || OP(rn) == MINMOD || \
137 OP(rn) == KEEPS || (PL_regkind[OP(rn)] == VERB) || \
138 (PL_regkind[OP(rn)] == CURLY && ARG1(rn) > 0) \
140 #define IS_EXACT(rn) (PL_regkind[OP(rn)] == EXACT)
142 #define HAS_TEXT(rn) ( IS_EXACT(rn) || PL_regkind[OP(rn)] == REF )
145 /* Currently these are only used when PL_regkind[OP(rn)] == EXACT so
146 we don't need this definition. */
147 #define IS_TEXT(rn) ( OP(rn)==EXACT || OP(rn)==REF || OP(rn)==NREF )
148 #define IS_TEXTF(rn) ( OP(rn)==EXACTF || OP(rn)==REFF || OP(rn)==NREFF )
149 #define IS_TEXTFL(rn) ( OP(rn)==EXACTFL || OP(rn)==REFFL || OP(rn)==NREFFL )
152 /* ... so we use this as its faster. */
153 #define IS_TEXT(rn) ( OP(rn)==EXACT )
154 #define IS_TEXTF(rn) ( OP(rn)==EXACTF )
155 #define IS_TEXTFL(rn) ( OP(rn)==EXACTFL )
160 Search for mandatory following text node; for lookahead, the text must
161 follow but for lookbehind (rn->flags != 0) we skip to the next step.
163 #define FIND_NEXT_IMPT(rn) STMT_START { \
164 while (JUMPABLE(rn)) { \
165 const OPCODE type = OP(rn); \
166 if (type == SUSPEND || PL_regkind[type] == CURLY) \
167 rn = NEXTOPER(NEXTOPER(rn)); \
168 else if (type == PLUS) \
170 else if (type == IFMATCH) \
171 rn = (rn->flags == 0) ? NEXTOPER(NEXTOPER(rn)) : rn + ARG(rn); \
172 else rn += NEXT_OFF(rn); \
177 static void restore_pos(pTHX_ void *arg);
180 S_regcppush(pTHX_ I32 parenfloor)
183 const int retval = PL_savestack_ix;
184 #define REGCP_PAREN_ELEMS 4
185 const int paren_elems_to_push = (PL_regsize - parenfloor) * REGCP_PAREN_ELEMS;
187 GET_RE_DEBUG_FLAGS_DECL;
189 if (paren_elems_to_push < 0)
190 Perl_croak(aTHX_ "panic: paren_elems_to_push < 0");
192 #define REGCP_OTHER_ELEMS 7
193 SSGROW(paren_elems_to_push + REGCP_OTHER_ELEMS);
195 for (p = PL_regsize; p > parenfloor; p--) {
196 /* REGCP_PARENS_ELEMS are pushed per pairs of parentheses. */
197 SSPUSHINT(PL_regoffs[p].end);
198 SSPUSHINT(PL_regoffs[p].start);
199 SSPUSHPTR(PL_reg_start_tmp[p]);
201 DEBUG_BUFFERS_r(PerlIO_printf(Perl_debug_log,
202 " saving \\%"UVuf" %"IVdf"(%"IVdf")..%"IVdf"\n",
203 (UV)p, (IV)PL_regoffs[p].start,
204 (IV)(PL_reg_start_tmp[p] - PL_bostr),
205 (IV)PL_regoffs[p].end
208 /* REGCP_OTHER_ELEMS are pushed in any case, parentheses or no. */
209 SSPUSHPTR(PL_regoffs);
210 SSPUSHINT(PL_regsize);
211 SSPUSHINT(*PL_reglastparen);
212 SSPUSHINT(*PL_reglastcloseparen);
213 SSPUSHPTR(PL_reginput);
214 #define REGCP_FRAME_ELEMS 2
215 /* REGCP_FRAME_ELEMS are part of the REGCP_OTHER_ELEMS and
216 * are needed for the regexp context stack bookkeeping. */
217 SSPUSHINT(paren_elems_to_push + REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS);
218 SSPUSHINT(SAVEt_REGCONTEXT); /* Magic cookie. */
223 /* These are needed since we do not localize EVAL nodes: */
224 #define REGCP_SET(cp) \
226 PerlIO_printf(Perl_debug_log, \
227 " Setting an EVAL scope, savestack=%"IVdf"\n", \
228 (IV)PL_savestack_ix)); \
231 #define REGCP_UNWIND(cp) \
233 if (cp != PL_savestack_ix) \
234 PerlIO_printf(Perl_debug_log, \
235 " Clearing an EVAL scope, savestack=%"IVdf"..%"IVdf"\n", \
236 (IV)(cp), (IV)PL_savestack_ix)); \
240 S_regcppop(pTHX_ const regexp *rex)
245 GET_RE_DEBUG_FLAGS_DECL;
247 PERL_ARGS_ASSERT_REGCPPOP;
249 /* Pop REGCP_OTHER_ELEMS before the parentheses loop starts. */
251 assert(i == SAVEt_REGCONTEXT); /* Check that the magic cookie is there. */
252 i = SSPOPINT; /* Parentheses elements to pop. */
253 input = (char *) SSPOPPTR;
254 *PL_reglastcloseparen = SSPOPINT;
255 *PL_reglastparen = SSPOPINT;
256 PL_regsize = SSPOPINT;
257 PL_regoffs=(regexp_paren_pair *) SSPOPPTR;
260 /* Now restore the parentheses context. */
261 for (i -= (REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS);
262 i > 0; i -= REGCP_PAREN_ELEMS) {
264 U32 paren = (U32)SSPOPINT;
265 PL_reg_start_tmp[paren] = (char *) SSPOPPTR;
266 PL_regoffs[paren].start = SSPOPINT;
268 if (paren <= *PL_reglastparen)
269 PL_regoffs[paren].end = tmps;
271 PerlIO_printf(Perl_debug_log,
272 " restoring \\%"UVuf" to %"IVdf"(%"IVdf")..%"IVdf"%s\n",
273 (UV)paren, (IV)PL_regoffs[paren].start,
274 (IV)(PL_reg_start_tmp[paren] - PL_bostr),
275 (IV)PL_regoffs[paren].end,
276 (paren > *PL_reglastparen ? "(no)" : ""));
280 if (*PL_reglastparen + 1 <= rex->nparens) {
281 PerlIO_printf(Perl_debug_log,
282 " restoring \\%"IVdf"..\\%"IVdf" to undef\n",
283 (IV)(*PL_reglastparen + 1), (IV)rex->nparens);
287 /* It would seem that the similar code in regtry()
288 * already takes care of this, and in fact it is in
289 * a better location to since this code can #if 0-ed out
290 * but the code in regtry() is needed or otherwise tests
291 * requiring null fields (pat.t#187 and split.t#{13,14}
292 * (as of patchlevel 7877) will fail. Then again,
293 * this code seems to be necessary or otherwise
294 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
295 * --jhi updated by dapm */
296 for (i = *PL_reglastparen + 1; i <= rex->nparens; i++) {
298 PL_regoffs[i].start = -1;
299 PL_regoffs[i].end = -1;
305 #define regcpblow(cp) LEAVE_SCOPE(cp) /* Ignores regcppush()ed data. */
308 * pregexec and friends
311 #ifndef PERL_IN_XSUB_RE
313 - pregexec - match a regexp against a string
316 Perl_pregexec(pTHX_ REGEXP * const prog, char* stringarg, register char *strend,
317 char *strbeg, I32 minend, SV *screamer, U32 nosave)
318 /* strend: pointer to null at end of string */
319 /* strbeg: real beginning of string */
320 /* minend: end of match must be >=minend after stringarg. */
321 /* nosave: For optimizations. */
323 PERL_ARGS_ASSERT_PREGEXEC;
326 regexec_flags(prog, stringarg, strend, strbeg, minend, screamer, NULL,
327 nosave ? 0 : REXEC_COPY_STR);
332 * Need to implement the following flags for reg_anch:
334 * USE_INTUIT_NOML - Useful to call re_intuit_start() first
336 * INTUIT_AUTORITATIVE_NOML - Can trust a positive answer
337 * INTUIT_AUTORITATIVE_ML
338 * INTUIT_ONCE_NOML - Intuit can match in one location only.
341 * Another flag for this function: SECOND_TIME (so that float substrs
342 * with giant delta may be not rechecked).
345 /* Assumptions: if ANCH_GPOS, then strpos is anchored. XXXX Check GPOS logic */
347 /* If SCREAM, then SvPVX_const(sv) should be compatible with strpos and strend.
348 Otherwise, only SvCUR(sv) is used to get strbeg. */
350 /* XXXX We assume that strpos is strbeg unless sv. */
352 /* XXXX Some places assume that there is a fixed substring.
353 An update may be needed if optimizer marks as "INTUITable"
354 RExen without fixed substrings. Similarly, it is assumed that
355 lengths of all the strings are no more than minlen, thus they
356 cannot come from lookahead.
357 (Or minlen should take into account lookahead.)
358 NOTE: Some of this comment is not correct. minlen does now take account
359 of lookahead/behind. Further research is required. -- demerphq
363 /* A failure to find a constant substring means that there is no need to make
364 an expensive call to REx engine, thus we celebrate a failure. Similarly,
365 finding a substring too deep into the string means that less calls to
366 regtry() should be needed.
368 REx compiler's optimizer found 4 possible hints:
369 a) Anchored substring;
371 c) Whether we are anchored (beginning-of-line or \G);
372 d) First node (of those at offset 0) which may distingush positions;
373 We use a)b)d) and multiline-part of c), and try to find a position in the
374 string which does not contradict any of them.
377 /* Most of decisions we do here should have been done at compile time.
378 The nodes of the REx which we used for the search should have been
379 deleted from the finite automaton. */
382 Perl_re_intuit_start(pTHX_ REGEXP * const rx, SV *sv, char *strpos,
383 char *strend, const U32 flags, re_scream_pos_data *data)
386 struct regexp *const prog = (struct regexp *)SvANY(rx);
387 register I32 start_shift = 0;
388 /* Should be nonnegative! */
389 register I32 end_shift = 0;
394 const bool do_utf8 = (sv && SvUTF8(sv)) ? 1 : 0; /* if no sv we have to assume bytes */
396 register char *other_last = NULL; /* other substr checked before this */
397 char *check_at = NULL; /* check substr found at this pos */
398 const I32 multiline = prog->extflags & RXf_PMf_MULTILINE;
399 RXi_GET_DECL(prog,progi);
401 const char * const i_strpos = strpos;
403 GET_RE_DEBUG_FLAGS_DECL;
405 PERL_ARGS_ASSERT_RE_INTUIT_START;
407 RX_MATCH_UTF8_set(rx,do_utf8);
410 PL_reg_flags |= RF_utf8;
413 debug_start_match(rx, do_utf8, strpos, strend,
414 sv ? "Guessing start of match in sv for"
415 : "Guessing start of match in string for");
418 /* CHR_DIST() would be more correct here but it makes things slow. */
419 if (prog->minlen > strend - strpos) {
420 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
421 "String too short... [re_intuit_start]\n"));
425 strbeg = (sv && SvPOK(sv)) ? strend - SvCUR(sv) : strpos;
428 if (!prog->check_utf8 && prog->check_substr)
429 to_utf8_substr(prog);
430 check = prog->check_utf8;
432 if (!prog->check_substr && prog->check_utf8)
433 to_byte_substr(prog);
434 check = prog->check_substr;
436 if (check == &PL_sv_undef) {
437 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
438 "Non-utf8 string cannot match utf8 check string\n"));
441 if (prog->extflags & RXf_ANCH) { /* Match at beg-of-str or after \n */
442 ml_anch = !( (prog->extflags & RXf_ANCH_SINGLE)
443 || ( (prog->extflags & RXf_ANCH_BOL)
444 && !multiline ) ); /* Check after \n? */
447 if ( !(prog->extflags & RXf_ANCH_GPOS) /* Checked by the caller */
448 && !(prog->intflags & PREGf_IMPLICIT) /* not a real BOL */
449 /* SvCUR is not set on references: SvRV and SvPVX_const overlap */
451 && (strpos != strbeg)) {
452 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not at start...\n"));
455 if (prog->check_offset_min == prog->check_offset_max &&
456 !(prog->extflags & RXf_CANY_SEEN)) {
457 /* Substring at constant offset from beg-of-str... */
460 s = HOP3c(strpos, prog->check_offset_min, strend);
463 slen = SvCUR(check); /* >= 1 */
465 if ( strend - s > slen || strend - s < slen - 1
466 || (strend - s == slen && strend[-1] != '\n')) {
467 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String too long...\n"));
470 /* Now should match s[0..slen-2] */
472 if (slen && (*SvPVX_const(check) != *s
474 && memNE(SvPVX_const(check), s, slen)))) {
476 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "String not equal...\n"));
480 else if (*SvPVX_const(check) != *s
481 || ((slen = SvCUR(check)) > 1
482 && memNE(SvPVX_const(check), s, slen)))
485 goto success_at_start;
488 /* Match is anchored, but substr is not anchored wrt beg-of-str. */
490 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
491 end_shift = prog->check_end_shift;
494 const I32 end = prog->check_offset_max + CHR_SVLEN(check)
495 - (SvTAIL(check) != 0);
496 const I32 eshift = CHR_DIST((U8*)strend, (U8*)s) - end;
498 if (end_shift < eshift)
502 else { /* Can match at random position */
505 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
506 end_shift = prog->check_end_shift;
508 /* end shift should be non negative here */
511 #ifdef QDEBUGGING /* 7/99: reports of failure (with the older version) */
513 Perl_croak(aTHX_ "panic: end_shift: %"IVdf" pattern:\n%s\n ",
514 (IV)end_shift, RX_PRECOMP(prog));
518 /* Find a possible match in the region s..strend by looking for
519 the "check" substring in the region corrected by start/end_shift. */
522 I32 srch_start_shift = start_shift;
523 I32 srch_end_shift = end_shift;
524 if (srch_start_shift < 0 && strbeg - s > srch_start_shift) {
525 srch_end_shift -= ((strbeg - s) - srch_start_shift);
526 srch_start_shift = strbeg - s;
528 DEBUG_OPTIMISE_MORE_r({
529 PerlIO_printf(Perl_debug_log, "Check offset min: %"IVdf" Start shift: %"IVdf" End shift %"IVdf" Real End Shift: %"IVdf"\n",
530 (IV)prog->check_offset_min,
531 (IV)srch_start_shift,
533 (IV)prog->check_end_shift);
536 if (flags & REXEC_SCREAM) {
537 I32 p = -1; /* Internal iterator of scream. */
538 I32 * const pp = data ? data->scream_pos : &p;
540 if (PL_screamfirst[BmRARE(check)] >= 0
541 || ( BmRARE(check) == '\n'
542 && (BmPREVIOUS(check) == SvCUR(check) - 1)
544 s = screaminstr(sv, check,
545 srch_start_shift + (s - strbeg), srch_end_shift, pp, 0);
548 /* we may be pointing at the wrong string */
549 if (s && RXp_MATCH_COPIED(prog))
550 s = strbeg + (s - SvPVX_const(sv));
552 *data->scream_olds = s;
557 if (prog->extflags & RXf_CANY_SEEN) {
558 start_point= (U8*)(s + srch_start_shift);
559 end_point= (U8*)(strend - srch_end_shift);
561 start_point= HOP3(s, srch_start_shift, srch_start_shift < 0 ? strbeg : strend);
562 end_point= HOP3(strend, -srch_end_shift, strbeg);
564 DEBUG_OPTIMISE_MORE_r({
565 PerlIO_printf(Perl_debug_log, "fbm_instr len=%d str=<%.*s>\n",
566 (int)(end_point - start_point),
567 (int)(end_point - start_point) > 20 ? 20 : (int)(end_point - start_point),
571 s = fbm_instr( start_point, end_point,
572 check, multiline ? FBMrf_MULTILINE : 0);
575 /* Update the count-of-usability, remove useless subpatterns,
579 RE_PV_QUOTED_DECL(quoted, do_utf8, PERL_DEBUG_PAD_ZERO(0),
580 SvPVX_const(check), RE_SV_DUMPLEN(check), 30);
581 PerlIO_printf(Perl_debug_log, "%s %s substr %s%s%s",
582 (s ? "Found" : "Did not find"),
583 (check == (do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)
584 ? "anchored" : "floating"),
587 (s ? " at offset " : "...\n") );
592 /* Finish the diagnostic message */
593 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%ld...\n", (long)(s - i_strpos)) );
595 /* XXX dmq: first branch is for positive lookbehind...
596 Our check string is offset from the beginning of the pattern.
597 So we need to do any stclass tests offset forward from that
606 /* Got a candidate. Check MBOL anchoring, and the *other* substr.
607 Start with the other substr.
608 XXXX no SCREAM optimization yet - and a very coarse implementation
609 XXXX /ttx+/ results in anchored="ttx", floating="x". floating will
610 *always* match. Probably should be marked during compile...
611 Probably it is right to do no SCREAM here...
614 if (do_utf8 ? (prog->float_utf8 && prog->anchored_utf8)
615 : (prog->float_substr && prog->anchored_substr))
617 /* Take into account the "other" substring. */
618 /* XXXX May be hopelessly wrong for UTF... */
621 if (check == (do_utf8 ? prog->float_utf8 : prog->float_substr)) {
624 char * const last = HOP3c(s, -start_shift, strbeg);
626 char * const saved_s = s;
629 t = s - prog->check_offset_max;
630 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
632 || ((t = (char*)reghopmaybe3((U8*)s, -(prog->check_offset_max), (U8*)strpos))
637 t = HOP3c(t, prog->anchored_offset, strend);
638 if (t < other_last) /* These positions already checked */
640 last2 = last1 = HOP3c(strend, -prog->minlen, strbeg);
643 /* XXXX It is not documented what units *_offsets are in.
644 We assume bytes, but this is clearly wrong.
645 Meaning this code needs to be carefully reviewed for errors.
649 /* On end-of-str: see comment below. */
650 must = do_utf8 ? prog->anchored_utf8 : prog->anchored_substr;
651 if (must == &PL_sv_undef) {
653 DEBUG_r(must = prog->anchored_utf8); /* for debug */
658 HOP3(HOP3(last1, prog->anchored_offset, strend)
659 + SvCUR(must), -(SvTAIL(must)!=0), strbeg),
661 multiline ? FBMrf_MULTILINE : 0
664 RE_PV_QUOTED_DECL(quoted, do_utf8, PERL_DEBUG_PAD_ZERO(0),
665 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
666 PerlIO_printf(Perl_debug_log, "%s anchored substr %s%s",
667 (s ? "Found" : "Contradicts"),
668 quoted, RE_SV_TAIL(must));
673 if (last1 >= last2) {
674 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
675 ", giving up...\n"));
678 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
679 ", trying floating at offset %ld...\n",
680 (long)(HOP3c(saved_s, 1, strend) - i_strpos)));
681 other_last = HOP3c(last1, prog->anchored_offset+1, strend);
682 s = HOP3c(last, 1, strend);
686 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
687 (long)(s - i_strpos)));
688 t = HOP3c(s, -prog->anchored_offset, strbeg);
689 other_last = HOP3c(s, 1, strend);
697 else { /* Take into account the floating substring. */
699 char * const saved_s = s;
702 t = HOP3c(s, -start_shift, strbeg);
704 HOP3c(strend, -prog->minlen + prog->float_min_offset, strbeg);
705 if (CHR_DIST((U8*)last, (U8*)t) > prog->float_max_offset)
706 last = HOP3c(t, prog->float_max_offset, strend);
707 s = HOP3c(t, prog->float_min_offset, strend);
710 /* XXXX It is not documented what units *_offsets are in. Assume bytes. */
711 must = do_utf8 ? prog->float_utf8 : prog->float_substr;
712 /* fbm_instr() takes into account exact value of end-of-str
713 if the check is SvTAIL(ed). Since false positives are OK,
714 and end-of-str is not later than strend we are OK. */
715 if (must == &PL_sv_undef) {
717 DEBUG_r(must = prog->float_utf8); /* for debug message */
720 s = fbm_instr((unsigned char*)s,
721 (unsigned char*)last + SvCUR(must)
723 must, multiline ? FBMrf_MULTILINE : 0);
725 RE_PV_QUOTED_DECL(quoted, do_utf8, PERL_DEBUG_PAD_ZERO(0),
726 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
727 PerlIO_printf(Perl_debug_log, "%s floating substr %s%s",
728 (s ? "Found" : "Contradicts"),
729 quoted, RE_SV_TAIL(must));
733 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
734 ", giving up...\n"));
737 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
738 ", trying anchored starting at offset %ld...\n",
739 (long)(saved_s + 1 - i_strpos)));
741 s = HOP3c(t, 1, strend);
745 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
746 (long)(s - i_strpos)));
747 other_last = s; /* Fix this later. --Hugo */
757 t= (char*)HOP3( s, -prog->check_offset_max, (prog->check_offset_max<0) ? strend : strpos);
759 DEBUG_OPTIMISE_MORE_r(
760 PerlIO_printf(Perl_debug_log,
761 "Check offset min:%"IVdf" max:%"IVdf" S:%"IVdf" t:%"IVdf" D:%"IVdf" end:%"IVdf"\n",
762 (IV)prog->check_offset_min,
763 (IV)prog->check_offset_max,
771 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
773 || ((t = (char*)reghopmaybe3((U8*)s, -prog->check_offset_max, (U8*) ((prog->check_offset_max<0) ? strend : strpos)))
776 /* Fixed substring is found far enough so that the match
777 cannot start at strpos. */
779 if (ml_anch && t[-1] != '\n') {
780 /* Eventually fbm_*() should handle this, but often
781 anchored_offset is not 0, so this check will not be wasted. */
782 /* XXXX In the code below we prefer to look for "^" even in
783 presence of anchored substrings. And we search even
784 beyond the found float position. These pessimizations
785 are historical artefacts only. */
787 while (t < strend - prog->minlen) {
789 if (t < check_at - prog->check_offset_min) {
790 if (do_utf8 ? prog->anchored_utf8 : prog->anchored_substr) {
791 /* Since we moved from the found position,
792 we definitely contradict the found anchored
793 substr. Due to the above check we do not
794 contradict "check" substr.
795 Thus we can arrive here only if check substr
796 is float. Redo checking for "other"=="fixed".
799 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld, rescanning for anchored from offset %ld...\n",
800 PL_colors[0], PL_colors[1], (long)(strpos - i_strpos), (long)(strpos - i_strpos + prog->anchored_offset)));
801 goto do_other_anchored;
803 /* We don't contradict the found floating substring. */
804 /* XXXX Why not check for STCLASS? */
806 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld...\n",
807 PL_colors[0], PL_colors[1], (long)(s - i_strpos)));
810 /* Position contradicts check-string */
811 /* XXXX probably better to look for check-string
812 than for "\n", so one should lower the limit for t? */
813 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m, restarting lookup for check-string at offset %ld...\n",
814 PL_colors[0], PL_colors[1], (long)(t + 1 - i_strpos)));
815 other_last = strpos = s = t + 1;
820 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Did not find /%s^%s/m...\n",
821 PL_colors[0], PL_colors[1]));
825 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Starting position does not contradict /%s^%s/m...\n",
826 PL_colors[0], PL_colors[1]));
830 ++BmUSEFUL(do_utf8 ? prog->check_utf8 : prog->check_substr); /* hooray/5 */
833 /* The found string does not prohibit matching at strpos,
834 - no optimization of calling REx engine can be performed,
835 unless it was an MBOL and we are not after MBOL,
836 or a future STCLASS check will fail this. */
838 /* Even in this situation we may use MBOL flag if strpos is offset
839 wrt the start of the string. */
840 if (ml_anch && sv && !SvROK(sv) /* See prev comment on SvROK */
841 && (strpos != strbeg) && strpos[-1] != '\n'
842 /* May be due to an implicit anchor of m{.*foo} */
843 && !(prog->intflags & PREGf_IMPLICIT))
848 DEBUG_EXECUTE_r( if (ml_anch)
849 PerlIO_printf(Perl_debug_log, "Position at offset %ld does not contradict /%s^%s/m...\n",
850 (long)(strpos - i_strpos), PL_colors[0], PL_colors[1]);
853 if (!(prog->intflags & PREGf_NAUGHTY) /* XXXX If strpos moved? */
855 prog->check_utf8 /* Could be deleted already */
856 && --BmUSEFUL(prog->check_utf8) < 0
857 && (prog->check_utf8 == prog->float_utf8)
859 prog->check_substr /* Could be deleted already */
860 && --BmUSEFUL(prog->check_substr) < 0
861 && (prog->check_substr == prog->float_substr)
864 /* If flags & SOMETHING - do not do it many times on the same match */
865 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "... Disabling check substring...\n"));
866 SvREFCNT_dec(do_utf8 ? prog->check_utf8 : prog->check_substr);
867 if (do_utf8 ? prog->check_substr : prog->check_utf8)
868 SvREFCNT_dec(do_utf8 ? prog->check_substr : prog->check_utf8);
869 prog->check_substr = prog->check_utf8 = NULL; /* disable */
870 prog->float_substr = prog->float_utf8 = NULL; /* clear */
871 check = NULL; /* abort */
873 /* XXXX This is a remnant of the old implementation. It
874 looks wasteful, since now INTUIT can use many
876 prog->extflags &= ~RXf_USE_INTUIT;
883 /* XXXX BmUSEFUL already changed, maybe multiple change is meaningful... */
884 /* trie stclasses are too expensive to use here, we are better off to
885 leave it to regmatch itself */
886 if (progi->regstclass && PL_regkind[OP(progi->regstclass)]!=TRIE) {
887 /* minlen == 0 is possible if regstclass is \b or \B,
888 and the fixed substr is ''$.
889 Since minlen is already taken into account, s+1 is before strend;
890 accidentally, minlen >= 1 guaranties no false positives at s + 1
891 even for \b or \B. But (minlen? 1 : 0) below assumes that
892 regstclass does not come from lookahead... */
893 /* If regstclass takes bytelength more than 1: If charlength==1, OK.
894 This leaves EXACTF only, which is dealt with in find_byclass(). */
895 const U8* const str = (U8*)STRING(progi->regstclass);
896 const int cl_l = (PL_regkind[OP(progi->regstclass)] == EXACT
897 ? CHR_DIST(str+STR_LEN(progi->regstclass), str)
900 if (prog->anchored_substr || prog->anchored_utf8 || ml_anch)
901 endpos= HOP3c(s, (prog->minlen ? cl_l : 0), strend);
902 else if (prog->float_substr || prog->float_utf8)
903 endpos= HOP3c(HOP3c(check_at, -start_shift, strbeg), cl_l, strend);
907 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "start_shift: %"IVdf" check_at: %"IVdf" s: %"IVdf" endpos: %"IVdf"\n",
908 (IV)start_shift, (IV)(check_at - strbeg), (IV)(s - strbeg), (IV)(endpos - strbeg)));
911 s = find_byclass(prog, progi->regstclass, s, endpos, NULL);
914 const char *what = NULL;
916 if (endpos == strend) {
917 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
918 "Could not match STCLASS...\n") );
921 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
922 "This position contradicts STCLASS...\n") );
923 if ((prog->extflags & RXf_ANCH) && !ml_anch)
925 /* Contradict one of substrings */
926 if (prog->anchored_substr || prog->anchored_utf8) {
927 if ((do_utf8 ? prog->anchored_utf8 : prog->anchored_substr) == check) {
928 DEBUG_EXECUTE_r( what = "anchored" );
930 s = HOP3c(t, 1, strend);
931 if (s + start_shift + end_shift > strend) {
932 /* XXXX Should be taken into account earlier? */
933 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
934 "Could not match STCLASS...\n") );
939 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
940 "Looking for %s substr starting at offset %ld...\n",
941 what, (long)(s + start_shift - i_strpos)) );
944 /* Have both, check_string is floating */
945 if (t + start_shift >= check_at) /* Contradicts floating=check */
946 goto retry_floating_check;
947 /* Recheck anchored substring, but not floating... */
951 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
952 "Looking for anchored substr starting at offset %ld...\n",
953 (long)(other_last - i_strpos)) );
954 goto do_other_anchored;
956 /* Another way we could have checked stclass at the
957 current position only: */
962 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
963 "Looking for /%s^%s/m starting at offset %ld...\n",
964 PL_colors[0], PL_colors[1], (long)(t - i_strpos)) );
967 if (!(do_utf8 ? prog->float_utf8 : prog->float_substr)) /* Could have been deleted */
969 /* Check is floating subtring. */
970 retry_floating_check:
971 t = check_at - start_shift;
972 DEBUG_EXECUTE_r( what = "floating" );
973 goto hop_and_restart;
976 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
977 "By STCLASS: moving %ld --> %ld\n",
978 (long)(t - i_strpos), (long)(s - i_strpos))
982 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
983 "Does not contradict STCLASS...\n");
988 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%s%s:%s match at offset %ld\n",
989 PL_colors[4], (check ? "Guessed" : "Giving up"),
990 PL_colors[5], (long)(s - i_strpos)) );
993 fail_finish: /* Substring not found */
994 if (prog->check_substr || prog->check_utf8) /* could be removed already */
995 BmUSEFUL(do_utf8 ? prog->check_utf8 : prog->check_substr) += 5; /* hooray */
997 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch rejected by optimizer%s\n",
998 PL_colors[4], PL_colors[5]));
1002 #define DECL_TRIE_TYPE(scan) \
1003 const enum { trie_plain, trie_utf8, trie_utf8_fold, trie_latin_utf8_fold } \
1004 trie_type = (scan->flags != EXACT) \
1005 ? (do_utf8 ? trie_utf8_fold : (UTF ? trie_latin_utf8_fold : trie_plain)) \
1006 : (do_utf8 ? trie_utf8 : trie_plain)
1008 #define REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc, uscan, len, \
1009 uvc, charid, foldlen, foldbuf, uniflags) STMT_START { \
1010 UV uvc_unfolded = 0; \
1011 switch (trie_type) { \
1012 case trie_utf8_fold: \
1013 if ( foldlen>0 ) { \
1014 uvc_unfolded = uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
1019 uvc_unfolded = uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
1020 uvc = to_uni_fold( uvc, foldbuf, &foldlen ); \
1021 foldlen -= UNISKIP( uvc ); \
1022 uscan = foldbuf + UNISKIP( uvc ); \
1025 case trie_latin_utf8_fold: \
1026 if ( foldlen>0 ) { \
1027 uvc = utf8n_to_uvuni( uscan, UTF8_MAXLEN, &len, uniflags ); \
1033 uvc = to_uni_fold( *(U8*)uc, foldbuf, &foldlen ); \
1034 foldlen -= UNISKIP( uvc ); \
1035 uscan = foldbuf + UNISKIP( uvc ); \
1039 uvc = utf8n_to_uvuni( (U8*)uc, UTF8_MAXLEN, &len, uniflags ); \
1047 charid = trie->charmap[ uvc ]; \
1051 if (widecharmap) { \
1052 SV** const svpp = hv_fetch(widecharmap, \
1053 (char*)&uvc, sizeof(UV), 0); \
1055 charid = (U16)SvIV(*svpp); \
1058 if (!charid && trie_type == trie_utf8_fold && !UTF) { \
1059 charid = trie->charmap[uvc_unfolded]; \
1063 #define REXEC_FBC_EXACTISH_CHECK(CoNd) \
1065 char *my_strend= (char *)strend; \
1068 !ibcmp_utf8(s, &my_strend, 0, do_utf8, \
1069 m, NULL, ln, (bool)UTF)) \
1070 && (!reginfo || regtry(reginfo, &s)) ) \
1073 U8 foldbuf[UTF8_MAXBYTES_CASE+1]; \
1074 uvchr_to_utf8(tmpbuf, c); \
1075 f = to_utf8_fold(tmpbuf, foldbuf, &foldlen); \
1077 && (f == c1 || f == c2) \
1079 !ibcmp_utf8(s, &my_strend, 0, do_utf8,\
1080 m, NULL, ln, (bool)UTF)) \
1081 && (!reginfo || regtry(reginfo, &s)) ) \
1087 #define REXEC_FBC_EXACTISH_SCAN(CoNd) \
1091 && (ln == 1 || !(OP(c) == EXACTF \
1093 : ibcmp_locale(s, m, ln))) \
1094 && (!reginfo || regtry(reginfo, &s)) ) \
1100 #define REXEC_FBC_UTF8_SCAN(CoDe) \
1102 while (s + (uskip = UTF8SKIP(s)) <= strend) { \
1108 #define REXEC_FBC_SCAN(CoDe) \
1110 while (s < strend) { \
1116 #define REXEC_FBC_UTF8_CLASS_SCAN(CoNd) \
1117 REXEC_FBC_UTF8_SCAN( \
1119 if (tmp && (!reginfo || regtry(reginfo, &s))) \
1128 #define REXEC_FBC_CLASS_SCAN(CoNd) \
1131 if (tmp && (!reginfo || regtry(reginfo, &s))) \
1140 #define REXEC_FBC_TRYIT \
1141 if ((!reginfo || regtry(reginfo, &s))) \
1144 #define REXEC_FBC_CSCAN(CoNdUtF8,CoNd) \
1146 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1149 REXEC_FBC_CLASS_SCAN(CoNd); \
1153 #define REXEC_FBC_CSCAN_PRELOAD(UtFpReLoAd,CoNdUtF8,CoNd) \
1156 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1159 REXEC_FBC_CLASS_SCAN(CoNd); \
1163 #define REXEC_FBC_CSCAN_TAINT(CoNdUtF8,CoNd) \
1164 PL_reg_flags |= RF_tainted; \
1166 REXEC_FBC_UTF8_CLASS_SCAN(CoNdUtF8); \
1169 REXEC_FBC_CLASS_SCAN(CoNd); \
1173 #define DUMP_EXEC_POS(li,s,doutf8) \
1174 dump_exec_pos(li,s,(PL_regeol),(PL_bostr),(PL_reg_starttry),doutf8)
1176 /* We know what class REx starts with. Try to find this position... */
1177 /* if reginfo is NULL, its a dryrun */
1178 /* annoyingly all the vars in this routine have different names from their counterparts
1179 in regmatch. /grrr */
1182 S_find_byclass(pTHX_ regexp * prog, const regnode *c, char *s,
1183 const char *strend, regmatch_info *reginfo)
1186 const I32 doevery = (prog->intflags & PREGf_SKIP) == 0;
1190 register STRLEN uskip;
1194 register I32 tmp = 1; /* Scratch variable? */
1195 register const bool do_utf8 = PL_reg_match_utf8;
1196 RXi_GET_DECL(prog,progi);
1198 PERL_ARGS_ASSERT_FIND_BYCLASS;
1200 /* We know what class it must start with. */
1204 REXEC_FBC_UTF8_CLASS_SCAN((ANYOF_FLAGS(c) & ANYOF_UNICODE) ||
1205 !UTF8_IS_INVARIANT((U8)s[0]) ?
1206 reginclass(prog, c, (U8*)s, 0, do_utf8) :
1207 REGINCLASS(prog, c, (U8*)s));
1210 while (s < strend) {
1213 if (REGINCLASS(prog, c, (U8*)s) ||
1214 (ANYOF_FOLD_SHARP_S(c, s, strend) &&
1215 /* The assignment of 2 is intentional:
1216 * for the folded sharp s, the skip is 2. */
1217 (skip = SHARP_S_SKIP))) {
1218 if (tmp && (!reginfo || regtry(reginfo, &s)))
1231 if (tmp && (!reginfo || regtry(reginfo, &s)))
1239 ln = STR_LEN(c); /* length to match in octets/bytes */
1240 lnc = (I32) ln; /* length to match in characters */
1242 STRLEN ulen1, ulen2;
1244 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
1245 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
1246 /* used by commented-out code below */
1247 /*const U32 uniflags = UTF8_ALLOW_DEFAULT;*/
1249 /* XXX: Since the node will be case folded at compile
1250 time this logic is a little odd, although im not
1251 sure that its actually wrong. --dmq */
1253 c1 = to_utf8_lower((U8*)m, tmpbuf1, &ulen1);
1254 c2 = to_utf8_upper((U8*)m, tmpbuf2, &ulen2);
1256 /* XXX: This is kinda strange. to_utf8_XYZ returns the
1257 codepoint of the first character in the converted
1258 form, yet originally we did the extra step.
1259 No tests fail by commenting this code out however
1260 so Ive left it out. -- dmq.
1262 c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXBYTES_CASE,
1264 c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXBYTES_CASE,
1269 while (sm < ((U8 *) m + ln)) {
1284 c2 = PL_fold_locale[c1];
1286 e = HOP3c(strend, -((I32)lnc), s);
1288 if (!reginfo && e < s)
1289 e = s; /* Due to minlen logic of intuit() */
1291 /* The idea in the EXACTF* cases is to first find the
1292 * first character of the EXACTF* node and then, if
1293 * necessary, case-insensitively compare the full
1294 * text of the node. The c1 and c2 are the first
1295 * characters (though in Unicode it gets a bit
1296 * more complicated because there are more cases
1297 * than just upper and lower: one needs to use
1298 * the so-called folding case for case-insensitive
1299 * matching (called "loose matching" in Unicode).
1300 * ibcmp_utf8() will do just that. */
1302 if (do_utf8 || UTF) {
1304 U8 tmpbuf [UTF8_MAXBYTES+1];
1307 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1309 /* Upper and lower of 1st char are equal -
1310 * probably not a "letter". */
1313 c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len,
1318 REXEC_FBC_EXACTISH_CHECK(c == c1);
1324 c = utf8n_to_uvchr((U8*)s, UTF8_MAXBYTES, &len,
1330 /* Handle some of the three Greek sigmas cases.
1331 * Note that not all the possible combinations
1332 * are handled here: some of them are handled
1333 * by the standard folding rules, and some of
1334 * them (the character class or ANYOF cases)
1335 * are handled during compiletime in
1336 * regexec.c:S_regclass(). */
1337 if (c == (UV)UNICODE_GREEK_CAPITAL_LETTER_SIGMA ||
1338 c == (UV)UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA)
1339 c = (UV)UNICODE_GREEK_SMALL_LETTER_SIGMA;
1341 REXEC_FBC_EXACTISH_CHECK(c == c1 || c == c2);
1346 /* Neither pattern nor string are UTF8 */
1348 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1);
1350 REXEC_FBC_EXACTISH_SCAN(*(U8*)s == c1 || *(U8*)s == c2);
1354 PL_reg_flags |= RF_tainted;
1361 U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr);
1362 tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT);
1364 tmp = ((OP(c) == BOUND ?
1365 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
1366 LOAD_UTF8_CHARCLASS_ALNUM();
1367 REXEC_FBC_UTF8_SCAN(
1368 if (tmp == !(OP(c) == BOUND ?
1369 (bool)swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) :
1370 isALNUM_LC_utf8((U8*)s)))
1378 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1379 tmp = ((OP(c) == BOUND ? isALNUM(tmp) : isALNUM_LC(tmp)) != 0);
1382 !(OP(c) == BOUND ? isALNUM(*s) : isALNUM_LC(*s))) {
1388 if ((!prog->minlen && tmp) && (!reginfo || regtry(reginfo, &s)))
1392 PL_reg_flags |= RF_tainted;
1399 U8 * const r = reghop3((U8*)s, -1, (U8*)PL_bostr);
1400 tmp = utf8n_to_uvchr(r, UTF8SKIP(r), 0, UTF8_ALLOW_DEFAULT);
1402 tmp = ((OP(c) == NBOUND ?
1403 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
1404 LOAD_UTF8_CHARCLASS_ALNUM();
1405 REXEC_FBC_UTF8_SCAN(
1406 if (tmp == !(OP(c) == NBOUND ?
1407 (bool)swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) :
1408 isALNUM_LC_utf8((U8*)s)))
1410 else REXEC_FBC_TRYIT;
1414 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1415 tmp = ((OP(c) == NBOUND ?
1416 isALNUM(tmp) : isALNUM_LC(tmp)) != 0);
1419 !(OP(c) == NBOUND ? isALNUM(*s) : isALNUM_LC(*s)))
1421 else REXEC_FBC_TRYIT;
1424 if ((!prog->minlen && !tmp) && (!reginfo || regtry(reginfo, &s)))
1428 REXEC_FBC_CSCAN_PRELOAD(
1429 LOAD_UTF8_CHARCLASS_ALNUM(),
1430 swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8),
1434 REXEC_FBC_CSCAN_TAINT(
1435 isALNUM_LC_utf8((U8*)s),
1439 REXEC_FBC_CSCAN_PRELOAD(
1440 LOAD_UTF8_CHARCLASS_ALNUM(),
1441 !swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8),
1445 REXEC_FBC_CSCAN_TAINT(
1446 !isALNUM_LC_utf8((U8*)s),
1450 REXEC_FBC_CSCAN_PRELOAD(
1451 LOAD_UTF8_CHARCLASS_SPACE(),
1452 *s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8),
1456 REXEC_FBC_CSCAN_TAINT(
1457 *s == ' ' || isSPACE_LC_utf8((U8*)s),
1461 REXEC_FBC_CSCAN_PRELOAD(
1462 LOAD_UTF8_CHARCLASS_SPACE(),
1463 !(*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8)),
1467 REXEC_FBC_CSCAN_TAINT(
1468 !(*s == ' ' || isSPACE_LC_utf8((U8*)s)),
1472 REXEC_FBC_CSCAN_PRELOAD(
1473 LOAD_UTF8_CHARCLASS_DIGIT(),
1474 swash_fetch(PL_utf8_digit,(U8*)s, do_utf8),
1478 REXEC_FBC_CSCAN_TAINT(
1479 isDIGIT_LC_utf8((U8*)s),
1483 REXEC_FBC_CSCAN_PRELOAD(
1484 LOAD_UTF8_CHARCLASS_DIGIT(),
1485 !swash_fetch(PL_utf8_digit,(U8*)s, do_utf8),
1489 REXEC_FBC_CSCAN_TAINT(
1490 !isDIGIT_LC_utf8((U8*)s),
1496 is_LNBREAK_latin1(s)
1506 !is_VERTWS_latin1(s)
1511 is_HORIZWS_latin1(s)
1515 !is_HORIZWS_utf8(s),
1516 !is_HORIZWS_latin1(s)
1522 /* what trie are we using right now */
1524 = (reg_ac_data*)progi->data->data[ ARG( c ) ];
1526 = (reg_trie_data*)progi->data->data[ aho->trie ];
1527 HV *widecharmap = MUTABLE_HV(progi->data->data[ aho->trie + 1 ]);
1529 const char *last_start = strend - trie->minlen;
1531 const char *real_start = s;
1533 STRLEN maxlen = trie->maxlen;
1535 U8 **points; /* map of where we were in the input string
1536 when reading a given char. For ASCII this
1537 is unnecessary overhead as the relationship
1538 is always 1:1, but for Unicode, especially
1539 case folded Unicode this is not true. */
1540 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
1544 GET_RE_DEBUG_FLAGS_DECL;
1546 /* We can't just allocate points here. We need to wrap it in
1547 * an SV so it gets freed properly if there is a croak while
1548 * running the match */
1551 sv_points=newSV(maxlen * sizeof(U8 *));
1552 SvCUR_set(sv_points,
1553 maxlen * sizeof(U8 *));
1554 SvPOK_on(sv_points);
1555 sv_2mortal(sv_points);
1556 points=(U8**)SvPV_nolen(sv_points );
1557 if ( trie_type != trie_utf8_fold
1558 && (trie->bitmap || OP(c)==AHOCORASICKC) )
1561 bitmap=(U8*)trie->bitmap;
1563 bitmap=(U8*)ANYOF_BITMAP(c);
1565 /* this is the Aho-Corasick algorithm modified a touch
1566 to include special handling for long "unknown char"
1567 sequences. The basic idea being that we use AC as long
1568 as we are dealing with a possible matching char, when
1569 we encounter an unknown char (and we have not encountered
1570 an accepting state) we scan forward until we find a legal
1572 AC matching is basically that of trie matching, except
1573 that when we encounter a failing transition, we fall back
1574 to the current states "fail state", and try the current char
1575 again, a process we repeat until we reach the root state,
1576 state 1, or a legal transition. If we fail on the root state
1577 then we can either terminate if we have reached an accepting
1578 state previously, or restart the entire process from the beginning
1582 while (s <= last_start) {
1583 const U32 uniflags = UTF8_ALLOW_DEFAULT;
1591 U8 *uscan = (U8*)NULL;
1592 U8 *leftmost = NULL;
1594 U32 accepted_word= 0;
1598 while ( state && uc <= (U8*)strend ) {
1600 U32 word = aho->states[ state ].wordnum;
1604 DEBUG_TRIE_EXECUTE_r(
1605 if ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1606 dump_exec_pos( (char *)uc, c, strend, real_start,
1607 (char *)uc, do_utf8 );
1608 PerlIO_printf( Perl_debug_log,
1609 " Scanning for legal start char...\n");
1612 while ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
1617 if (uc >(U8*)last_start) break;
1621 U8 *lpos= points[ (pointpos - trie->wordlen[word-1] ) % maxlen ];
1622 if (!leftmost || lpos < leftmost) {
1623 DEBUG_r(accepted_word=word);
1629 points[pointpos++ % maxlen]= uc;
1630 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
1631 uscan, len, uvc, charid, foldlen,
1633 DEBUG_TRIE_EXECUTE_r({
1634 dump_exec_pos( (char *)uc, c, strend, real_start,
1636 PerlIO_printf(Perl_debug_log,
1637 " Charid:%3u CP:%4"UVxf" ",
1643 word = aho->states[ state ].wordnum;
1645 base = aho->states[ state ].trans.base;
1647 DEBUG_TRIE_EXECUTE_r({
1649 dump_exec_pos( (char *)uc, c, strend, real_start,
1651 PerlIO_printf( Perl_debug_log,
1652 "%sState: %4"UVxf", word=%"UVxf,
1653 failed ? " Fail transition to " : "",
1654 (UV)state, (UV)word);
1659 (base + charid > trie->uniquecharcount )
1660 && (base + charid - 1 - trie->uniquecharcount
1662 && trie->trans[base + charid - 1 -
1663 trie->uniquecharcount].check == state
1664 && (tmp=trie->trans[base + charid - 1 -
1665 trie->uniquecharcount ].next))
1667 DEBUG_TRIE_EXECUTE_r(
1668 PerlIO_printf( Perl_debug_log," - legal\n"));
1673 DEBUG_TRIE_EXECUTE_r(
1674 PerlIO_printf( Perl_debug_log," - fail\n"));
1676 state = aho->fail[state];
1680 /* we must be accepting here */
1681 DEBUG_TRIE_EXECUTE_r(
1682 PerlIO_printf( Perl_debug_log," - accepting\n"));
1691 if (!state) state = 1;
1694 if ( aho->states[ state ].wordnum ) {
1695 U8 *lpos = points[ (pointpos - trie->wordlen[aho->states[ state ].wordnum-1]) % maxlen ];
1696 if (!leftmost || lpos < leftmost) {
1697 DEBUG_r(accepted_word=aho->states[ state ].wordnum);
1702 s = (char*)leftmost;
1703 DEBUG_TRIE_EXECUTE_r({
1705 Perl_debug_log,"Matches word #%"UVxf" at position %"IVdf". Trying full pattern...\n",
1706 (UV)accepted_word, (IV)(s - real_start)
1709 if (!reginfo || regtry(reginfo, &s)) {
1715 DEBUG_TRIE_EXECUTE_r({
1716 PerlIO_printf( Perl_debug_log,"Pattern failed. Looking for new start point...\n");
1719 DEBUG_TRIE_EXECUTE_r(
1720 PerlIO_printf( Perl_debug_log,"No match.\n"));
1729 Perl_croak(aTHX_ "panic: unknown regstclass %d", (int)OP(c));
1739 - regexec_flags - match a regexp against a string
1742 Perl_regexec_flags(pTHX_ REGEXP * const rx, char *stringarg, register char *strend,
1743 char *strbeg, I32 minend, SV *sv, void *data, U32 flags)
1744 /* strend: pointer to null at end of string */
1745 /* strbeg: real beginning of string */
1746 /* minend: end of match must be >=minend after stringarg. */
1747 /* data: May be used for some additional optimizations.
1748 Currently its only used, with a U32 cast, for transmitting
1749 the ganch offset when doing a /g match. This will change */
1750 /* nosave: For optimizations. */
1753 struct regexp *const prog = (struct regexp *)SvANY(rx);
1754 /*register*/ char *s;
1755 register regnode *c;
1756 /*register*/ char *startpos = stringarg;
1757 I32 minlen; /* must match at least this many chars */
1758 I32 dontbother = 0; /* how many characters not to try at end */
1759 I32 end_shift = 0; /* Same for the end. */ /* CC */
1760 I32 scream_pos = -1; /* Internal iterator of scream. */
1761 char *scream_olds = NULL;
1762 const bool do_utf8 = (bool)DO_UTF8(sv);
1764 RXi_GET_DECL(prog,progi);
1765 regmatch_info reginfo; /* create some info to pass to regtry etc */
1766 regexp_paren_pair *swap = NULL;
1767 GET_RE_DEBUG_FLAGS_DECL;
1769 PERL_ARGS_ASSERT_REGEXEC_FLAGS;
1770 PERL_UNUSED_ARG(data);
1772 /* Be paranoid... */
1773 if (prog == NULL || startpos == NULL) {
1774 Perl_croak(aTHX_ "NULL regexp parameter");
1778 multiline = prog->extflags & RXf_PMf_MULTILINE;
1779 reginfo.prog = rx; /* Yes, sorry that this is confusing. */
1781 RX_MATCH_UTF8_set(rx, do_utf8);
1783 debug_start_match(rx, do_utf8, startpos, strend,
1787 minlen = prog->minlen;
1789 if (strend - startpos < (minlen+(prog->check_offset_min<0?prog->check_offset_min:0))) {
1790 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
1791 "String too short [regexec_flags]...\n"));
1796 /* Check validity of program. */
1797 if (UCHARAT(progi->program) != REG_MAGIC) {
1798 Perl_croak(aTHX_ "corrupted regexp program");
1802 PL_reg_eval_set = 0;
1806 PL_reg_flags |= RF_utf8;
1808 /* Mark beginning of line for ^ and lookbehind. */
1809 reginfo.bol = startpos; /* XXX not used ??? */
1813 /* Mark end of line for $ (and such) */
1816 /* see how far we have to get to not match where we matched before */
1817 reginfo.till = startpos+minend;
1819 /* If there is a "must appear" string, look for it. */
1822 if (prog->extflags & RXf_GPOS_SEEN) { /* Need to set reginfo->ganch */
1824 if (flags & REXEC_IGNOREPOS){ /* Means: check only at start */
1825 reginfo.ganch = startpos + prog->gofs;
1826 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
1827 "GPOS IGNOREPOS: reginfo.ganch = startpos + %"UVxf"\n",(UV)prog->gofs));
1828 } else if (sv && SvTYPE(sv) >= SVt_PVMG
1830 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
1831 && mg->mg_len >= 0) {
1832 reginfo.ganch = strbeg + mg->mg_len; /* Defined pos() */
1833 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
1834 "GPOS MAGIC: reginfo.ganch = strbeg + %"IVdf"\n",(IV)mg->mg_len));
1836 if (prog->extflags & RXf_ANCH_GPOS) {
1837 if (s > reginfo.ganch)
1839 s = reginfo.ganch - prog->gofs;
1840 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
1841 "GPOS ANCH_GPOS: s = ganch - %"UVxf"\n",(UV)prog->gofs));
1847 reginfo.ganch = strbeg + PTR2UV(data);
1848 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
1849 "GPOS DATA: reginfo.ganch= strbeg + %"UVxf"\n",PTR2UV(data)));
1851 } else { /* pos() not defined */
1852 reginfo.ganch = strbeg;
1853 DEBUG_GPOS_r(PerlIO_printf(Perl_debug_log,
1854 "GPOS: reginfo.ganch = strbeg\n"));
1857 if (PL_curpm && (PM_GETRE(PL_curpm) == rx)) {
1858 /* We have to be careful. If the previous successful match
1859 was from this regex we don't want a subsequent partially
1860 successful match to clobber the old results.
1861 So when we detect this possibility we add a swap buffer
1862 to the re, and switch the buffer each match. If we fail
1863 we switch it back, otherwise we leave it swapped.
1866 /* do we need a save destructor here for eval dies? */
1867 Newxz(prog->offs, (prog->nparens + 1), regexp_paren_pair);
1869 if (!(flags & REXEC_CHECKED) && (prog->check_substr != NULL || prog->check_utf8 != NULL)) {
1870 re_scream_pos_data d;
1872 d.scream_olds = &scream_olds;
1873 d.scream_pos = &scream_pos;
1874 s = re_intuit_start(rx, sv, s, strend, flags, &d);
1876 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not present...\n"));
1877 goto phooey; /* not present */
1883 /* Simplest case: anchored match need be tried only once. */
1884 /* [unless only anchor is BOL and multiline is set] */
1885 if (prog->extflags & (RXf_ANCH & ~RXf_ANCH_GPOS)) {
1886 if (s == startpos && regtry(®info, &startpos))
1888 else if (multiline || (prog->intflags & PREGf_IMPLICIT)
1889 || (prog->extflags & RXf_ANCH_MBOL)) /* XXXX SBOL? */
1894 dontbother = minlen - 1;
1895 end = HOP3c(strend, -dontbother, strbeg) - 1;
1896 /* for multiline we only have to try after newlines */
1897 if (prog->check_substr || prog->check_utf8) {
1901 if (regtry(®info, &s))
1906 if (prog->extflags & RXf_USE_INTUIT) {
1907 s = re_intuit_start(rx, sv, s + 1, strend, flags, NULL);
1918 if (*s++ == '\n') { /* don't need PL_utf8skip here */
1919 if (regtry(®info, &s))
1926 } else if (RXf_GPOS_CHECK == (prog->extflags & RXf_GPOS_CHECK))
1928 /* the warning about reginfo.ganch being used without intialization
1929 is bogus -- we set it above, when prog->extflags & RXf_GPOS_SEEN
1930 and we only enter this block when the same bit is set. */
1931 char *tmp_s = reginfo.ganch - prog->gofs;
1933 if (tmp_s >= strbeg && regtry(®info, &tmp_s))
1938 /* Messy cases: unanchored match. */
1939 if ((prog->anchored_substr || prog->anchored_utf8) && prog->intflags & PREGf_SKIP) {
1940 /* we have /x+whatever/ */
1941 /* it must be a one character string (XXXX Except UTF?) */
1946 if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr))
1947 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1948 ch = SvPVX_const(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)[0];
1953 DEBUG_EXECUTE_r( did_match = 1 );
1954 if (regtry(®info, &s)) goto got_it;
1956 while (s < strend && *s == ch)
1964 DEBUG_EXECUTE_r( did_match = 1 );
1965 if (regtry(®info, &s)) goto got_it;
1967 while (s < strend && *s == ch)
1972 DEBUG_EXECUTE_r(if (!did_match)
1973 PerlIO_printf(Perl_debug_log,
1974 "Did not find anchored character...\n")
1977 else if (prog->anchored_substr != NULL
1978 || prog->anchored_utf8 != NULL
1979 || ((prog->float_substr != NULL || prog->float_utf8 != NULL)
1980 && prog->float_max_offset < strend - s)) {
1985 char *last1; /* Last position checked before */
1989 if (prog->anchored_substr || prog->anchored_utf8) {
1990 if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr))
1991 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1992 must = do_utf8 ? prog->anchored_utf8 : prog->anchored_substr;
1993 back_max = back_min = prog->anchored_offset;
1995 if (!(do_utf8 ? prog->float_utf8 : prog->float_substr))
1996 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1997 must = do_utf8 ? prog->float_utf8 : prog->float_substr;
1998 back_max = prog->float_max_offset;
1999 back_min = prog->float_min_offset;
2003 if (must == &PL_sv_undef)
2004 /* could not downgrade utf8 check substring, so must fail */
2010 last = HOP3c(strend, /* Cannot start after this */
2011 -(I32)(CHR_SVLEN(must)
2012 - (SvTAIL(must) != 0) + back_min), strbeg);
2015 last1 = HOPc(s, -1);
2017 last1 = s - 1; /* bogus */
2019 /* XXXX check_substr already used to find "s", can optimize if
2020 check_substr==must. */
2022 dontbother = end_shift;
2023 strend = HOPc(strend, -dontbother);
2024 while ( (s <= last) &&
2025 ((flags & REXEC_SCREAM)
2026 ? (s = screaminstr(sv, must, HOP3c(s, back_min, (back_min<0 ? strbeg : strend)) - strbeg,
2027 end_shift, &scream_pos, 0))
2028 : (s = fbm_instr((unsigned char*)HOP3(s, back_min, (back_min<0 ? strbeg : strend)),
2029 (unsigned char*)strend, must,
2030 multiline ? FBMrf_MULTILINE : 0))) ) {
2031 /* we may be pointing at the wrong string */
2032 if ((flags & REXEC_SCREAM) && RXp_MATCH_COPIED(prog))
2033 s = strbeg + (s - SvPVX_const(sv));
2034 DEBUG_EXECUTE_r( did_match = 1 );
2035 if (HOPc(s, -back_max) > last1) {
2036 last1 = HOPc(s, -back_min);
2037 s = HOPc(s, -back_max);
2040 char * const t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1;
2042 last1 = HOPc(s, -back_min);
2046 while (s <= last1) {
2047 if (regtry(®info, &s))
2053 while (s <= last1) {
2054 if (regtry(®info, &s))
2060 DEBUG_EXECUTE_r(if (!did_match) {
2061 RE_PV_QUOTED_DECL(quoted, do_utf8, PERL_DEBUG_PAD_ZERO(0),
2062 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
2063 PerlIO_printf(Perl_debug_log, "Did not find %s substr %s%s...\n",
2064 ((must == prog->anchored_substr || must == prog->anchored_utf8)
2065 ? "anchored" : "floating"),
2066 quoted, RE_SV_TAIL(must));
2070 else if ( (c = progi->regstclass) ) {
2072 const OPCODE op = OP(progi->regstclass);
2073 /* don't bother with what can't match */
2074 if (PL_regkind[op] != EXACT && op != CANY && PL_regkind[op] != TRIE)
2075 strend = HOPc(strend, -(minlen - 1));
2078 SV * const prop = sv_newmortal();
2079 regprop(prog, prop, c);
2081 RE_PV_QUOTED_DECL(quoted,do_utf8,PERL_DEBUG_PAD_ZERO(1),
2083 PerlIO_printf(Perl_debug_log,
2084 "Matching stclass %.*s against %s (%d chars)\n",
2085 (int)SvCUR(prop), SvPVX_const(prop),
2086 quoted, (int)(strend - s));
2089 if (find_byclass(prog, c, s, strend, ®info))
2091 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass... [regexec_flags]\n"));
2095 if (prog->float_substr != NULL || prog->float_utf8 != NULL) {
2100 if (!(do_utf8 ? prog->float_utf8 : prog->float_substr))
2101 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
2102 float_real = do_utf8 ? prog->float_utf8 : prog->float_substr;
2104 if (flags & REXEC_SCREAM) {
2105 last = screaminstr(sv, float_real, s - strbeg,
2106 end_shift, &scream_pos, 1); /* last one */
2108 last = scream_olds; /* Only one occurrence. */
2109 /* we may be pointing at the wrong string */
2110 else if (RXp_MATCH_COPIED(prog))
2111 s = strbeg + (s - SvPVX_const(sv));
2115 const char * const little = SvPV_const(float_real, len);
2117 if (SvTAIL(float_real)) {
2118 if (memEQ(strend - len + 1, little, len - 1))
2119 last = strend - len + 1;
2120 else if (!multiline)
2121 last = memEQ(strend - len, little, len)
2122 ? strend - len : NULL;
2128 last = rninstr(s, strend, little, little + len);
2130 last = strend; /* matching "$" */
2135 PerlIO_printf(Perl_debug_log,
2136 "%sCan't trim the tail, match fails (should not happen)%s\n",
2137 PL_colors[4], PL_colors[5]));
2138 goto phooey; /* Should not happen! */
2140 dontbother = strend - last + prog->float_min_offset;
2142 if (minlen && (dontbother < minlen))
2143 dontbother = minlen - 1;
2144 strend -= dontbother; /* this one's always in bytes! */
2145 /* We don't know much -- general case. */
2148 if (regtry(®info, &s))
2157 if (regtry(®info, &s))
2159 } while (s++ < strend);
2168 RX_MATCH_TAINTED_set(rx, PL_reg_flags & RF_tainted);
2170 if (PL_reg_eval_set)
2171 restore_pos(aTHX_ prog);
2172 if (RXp_PAREN_NAMES(prog))
2173 (void)hv_iterinit(RXp_PAREN_NAMES(prog));
2175 /* make sure $`, $&, $', and $digit will work later */
2176 if ( !(flags & REXEC_NOT_FIRST) ) {
2177 RX_MATCH_COPY_FREE(rx);
2178 if (flags & REXEC_COPY_STR) {
2179 const I32 i = PL_regeol - startpos + (stringarg - strbeg);
2180 #ifdef PERL_OLD_COPY_ON_WRITE
2182 || (SvFLAGS(sv) & CAN_COW_MASK) == CAN_COW_FLAGS)) {
2184 PerlIO_printf(Perl_debug_log,
2185 "Copy on write: regexp capture, type %d\n",
2188 prog->saved_copy = sv_setsv_cow(prog->saved_copy, sv);
2189 prog->subbeg = (char *)SvPVX_const(prog->saved_copy);
2190 assert (SvPOKp(prog->saved_copy));
2194 RX_MATCH_COPIED_on(rx);
2195 s = savepvn(strbeg, i);
2201 prog->subbeg = strbeg;
2202 prog->sublen = PL_regeol - strbeg; /* strend may have been modified */
2209 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n",
2210 PL_colors[4], PL_colors[5]));
2211 if (PL_reg_eval_set)
2212 restore_pos(aTHX_ prog);
2214 /* we failed :-( roll it back */
2215 Safefree(prog->offs);
2224 - regtry - try match at specific point
2226 STATIC I32 /* 0 failure, 1 success */
2227 S_regtry(pTHX_ regmatch_info *reginfo, char **startpos)
2231 REGEXP *const rx = reginfo->prog;
2232 regexp *const prog = (struct regexp *)SvANY(rx);
2233 RXi_GET_DECL(prog,progi);
2234 GET_RE_DEBUG_FLAGS_DECL;
2236 PERL_ARGS_ASSERT_REGTRY;
2238 reginfo->cutpoint=NULL;
2240 if ((prog->extflags & RXf_EVAL_SEEN) && !PL_reg_eval_set) {
2243 PL_reg_eval_set = RS_init;
2244 DEBUG_EXECUTE_r(DEBUG_s(
2245 PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n",
2246 (IV)(PL_stack_sp - PL_stack_base));
2249 cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base;
2250 /* Otherwise OP_NEXTSTATE will free whatever on stack now. */
2252 /* Apparently this is not needed, judging by wantarray. */
2253 /* SAVEI8(cxstack[cxstack_ix].blk_gimme);
2254 cxstack[cxstack_ix].blk_gimme = G_SCALAR; */
2257 /* Make $_ available to executed code. */
2258 if (reginfo->sv != DEFSV) {
2260 DEFSV_set(reginfo->sv);
2263 if (!(SvTYPE(reginfo->sv) >= SVt_PVMG && SvMAGIC(reginfo->sv)
2264 && (mg = mg_find(reginfo->sv, PERL_MAGIC_regex_global)))) {
2265 /* prepare for quick setting of pos */
2266 #ifdef PERL_OLD_COPY_ON_WRITE
2267 if (SvIsCOW(reginfo->sv))
2268 sv_force_normal_flags(reginfo->sv, 0);
2270 mg = sv_magicext(reginfo->sv, NULL, PERL_MAGIC_regex_global,
2271 &PL_vtbl_mglob, NULL, 0);
2275 PL_reg_oldpos = mg->mg_len;
2276 SAVEDESTRUCTOR_X(restore_pos, prog);
2278 if (!PL_reg_curpm) {
2279 Newxz(PL_reg_curpm, 1, PMOP);
2282 SV* const repointer = &PL_sv_undef;
2283 /* this regexp is also owned by the new PL_reg_curpm, which
2284 will try to free it. */
2285 av_push(PL_regex_padav, repointer);
2286 PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav);
2287 PL_regex_pad = AvARRAY(PL_regex_padav);
2292 /* It seems that non-ithreads works both with and without this code.
2293 So for efficiency reasons it seems best not to have the code
2294 compiled when it is not needed. */
2295 /* This is safe against NULLs: */
2296 ReREFCNT_dec(PM_GETRE(PL_reg_curpm));
2297 /* PM_reg_curpm owns a reference to this regexp. */
2300 PM_SETRE(PL_reg_curpm, rx);
2301 PL_reg_oldcurpm = PL_curpm;
2302 PL_curpm = PL_reg_curpm;
2303 if (RXp_MATCH_COPIED(prog)) {
2304 /* Here is a serious problem: we cannot rewrite subbeg,
2305 since it may be needed if this match fails. Thus
2306 $` inside (?{}) could fail... */
2307 PL_reg_oldsaved = prog->subbeg;
2308 PL_reg_oldsavedlen = prog->sublen;
2309 #ifdef PERL_OLD_COPY_ON_WRITE
2310 PL_nrs = prog->saved_copy;
2312 RXp_MATCH_COPIED_off(prog);
2315 PL_reg_oldsaved = NULL;
2316 prog->subbeg = PL_bostr;
2317 prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */
2319 DEBUG_EXECUTE_r(PL_reg_starttry = *startpos);
2320 prog->offs[0].start = *startpos - PL_bostr;
2321 PL_reginput = *startpos;
2322 PL_reglastparen = &prog->lastparen;
2323 PL_reglastcloseparen = &prog->lastcloseparen;
2324 prog->lastparen = 0;
2325 prog->lastcloseparen = 0;
2327 PL_regoffs = prog->offs;
2328 if (PL_reg_start_tmpl <= prog->nparens) {
2329 PL_reg_start_tmpl = prog->nparens*3/2 + 3;
2330 if(PL_reg_start_tmp)
2331 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2333 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2336 /* XXXX What this code is doing here?!!! There should be no need
2337 to do this again and again, PL_reglastparen should take care of
2340 /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code.
2341 * Actually, the code in regcppop() (which Ilya may be meaning by
2342 * PL_reglastparen), is not needed at all by the test suite
2343 * (op/regexp, op/pat, op/split), but that code is needed otherwise
2344 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
2345 * Meanwhile, this code *is* needed for the
2346 * above-mentioned test suite tests to succeed. The common theme
2347 * on those tests seems to be returning null fields from matches.
2348 * --jhi updated by dapm */
2350 if (prog->nparens) {
2351 regexp_paren_pair *pp = PL_regoffs;
2353 for (i = prog->nparens; i > (I32)*PL_reglastparen; i--) {
2361 if (regmatch(reginfo, progi->program + 1)) {
2362 PL_regoffs[0].end = PL_reginput - PL_bostr;
2365 if (reginfo->cutpoint)
2366 *startpos= reginfo->cutpoint;
2367 REGCP_UNWIND(lastcp);
2372 #define sayYES goto yes
2373 #define sayNO goto no
2374 #define sayNO_SILENT goto no_silent
2376 /* we dont use STMT_START/END here because it leads to
2377 "unreachable code" warnings, which are bogus, but distracting. */
2378 #define CACHEsayNO \
2379 if (ST.cache_mask) \
2380 PL_reg_poscache[ST.cache_offset] |= ST.cache_mask; \
2383 /* this is used to determine how far from the left messages like
2384 'failed...' are printed. It should be set such that messages
2385 are inline with the regop output that created them.
2387 #define REPORT_CODE_OFF 32
2390 /* Make sure there is a test for this +1 options in re_tests */
2391 #define TRIE_INITAL_ACCEPT_BUFFLEN 4;
2393 #define CHRTEST_UNINIT -1001 /* c1/c2 haven't been calculated yet */
2394 #define CHRTEST_VOID -1000 /* the c1/c2 "next char" test should be skipped */
2396 #define SLAB_FIRST(s) (&(s)->states[0])
2397 #define SLAB_LAST(s) (&(s)->states[PERL_REGMATCH_SLAB_SLOTS-1])
2399 /* grab a new slab and return the first slot in it */
2401 STATIC regmatch_state *
2404 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2407 regmatch_slab *s = PL_regmatch_slab->next;
2409 Newx(s, 1, regmatch_slab);
2410 s->prev = PL_regmatch_slab;
2412 PL_regmatch_slab->next = s;
2414 PL_regmatch_slab = s;
2415 return SLAB_FIRST(s);
2419 /* push a new state then goto it */
2421 #define PUSH_STATE_GOTO(state, node) \
2423 st->resume_state = state; \
2426 /* push a new state with success backtracking, then goto it */
2428 #define PUSH_YES_STATE_GOTO(state, node) \
2430 st->resume_state = state; \
2431 goto push_yes_state;
2437 regmatch() - main matching routine
2439 This is basically one big switch statement in a loop. We execute an op,
2440 set 'next' to point the next op, and continue. If we come to a point which
2441 we may need to backtrack to on failure such as (A|B|C), we push a
2442 backtrack state onto the backtrack stack. On failure, we pop the top
2443 state, and re-enter the loop at the state indicated. If there are no more
2444 states to pop, we return failure.
2446 Sometimes we also need to backtrack on success; for example /A+/, where
2447 after successfully matching one A, we need to go back and try to
2448 match another one; similarly for lookahead assertions: if the assertion
2449 completes successfully, we backtrack to the state just before the assertion
2450 and then carry on. In these cases, the pushed state is marked as
2451 'backtrack on success too'. This marking is in fact done by a chain of
2452 pointers, each pointing to the previous 'yes' state. On success, we pop to
2453 the nearest yes state, discarding any intermediate failure-only states.
2454 Sometimes a yes state is pushed just to force some cleanup code to be
2455 called at the end of a successful match or submatch; e.g. (??{$re}) uses
2456 it to free the inner regex.
2458 Note that failure backtracking rewinds the cursor position, while
2459 success backtracking leaves it alone.
2461 A pattern is complete when the END op is executed, while a subpattern
2462 such as (?=foo) is complete when the SUCCESS op is executed. Both of these
2463 ops trigger the "pop to last yes state if any, otherwise return true"
2466 A common convention in this function is to use A and B to refer to the two
2467 subpatterns (or to the first nodes thereof) in patterns like /A*B/: so A is
2468 the subpattern to be matched possibly multiple times, while B is the entire
2469 rest of the pattern. Variable and state names reflect this convention.
2471 The states in the main switch are the union of ops and failure/success of
2472 substates associated with with that op. For example, IFMATCH is the op
2473 that does lookahead assertions /(?=A)B/ and so the IFMATCH state means
2474 'execute IFMATCH'; while IFMATCH_A is a state saying that we have just
2475 successfully matched A and IFMATCH_A_fail is a state saying that we have
2476 just failed to match A. Resume states always come in pairs. The backtrack
2477 state we push is marked as 'IFMATCH_A', but when that is popped, we resume
2478 at IFMATCH_A or IFMATCH_A_fail, depending on whether we are backtracking
2479 on success or failure.
2481 The struct that holds a backtracking state is actually a big union, with
2482 one variant for each major type of op. The variable st points to the
2483 top-most backtrack struct. To make the code clearer, within each
2484 block of code we #define ST to alias the relevant union.
2486 Here's a concrete example of a (vastly oversimplified) IFMATCH
2492 #define ST st->u.ifmatch
2494 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2495 ST.foo = ...; // some state we wish to save
2497 // push a yes backtrack state with a resume value of
2498 // IFMATCH_A/IFMATCH_A_fail, then continue execution at the
2500 PUSH_YES_STATE_GOTO(IFMATCH_A, A);
2503 case IFMATCH_A: // we have successfully executed A; now continue with B
2505 bar = ST.foo; // do something with the preserved value
2508 case IFMATCH_A_fail: // A failed, so the assertion failed
2509 ...; // do some housekeeping, then ...
2510 sayNO; // propagate the failure
2517 For any old-timers reading this who are familiar with the old recursive
2518 approach, the code above is equivalent to:
2520 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2529 ...; // do some housekeeping, then ...
2530 sayNO; // propagate the failure
2533 The topmost backtrack state, pointed to by st, is usually free. If you
2534 want to claim it, populate any ST.foo fields in it with values you wish to
2535 save, then do one of
2537 PUSH_STATE_GOTO(resume_state, node);
2538 PUSH_YES_STATE_GOTO(resume_state, node);
2540 which sets that backtrack state's resume value to 'resume_state', pushes a
2541 new free entry to the top of the backtrack stack, then goes to 'node'.
2542 On backtracking, the free slot is popped, and the saved state becomes the
2543 new free state. An ST.foo field in this new top state can be temporarily
2544 accessed to retrieve values, but once the main loop is re-entered, it
2545 becomes available for reuse.
2547 Note that the depth of the backtrack stack constantly increases during the
2548 left-to-right execution of the pattern, rather than going up and down with
2549 the pattern nesting. For example the stack is at its maximum at Z at the
2550 end of the pattern, rather than at X in the following:
2552 /(((X)+)+)+....(Y)+....Z/
2554 The only exceptions to this are lookahead/behind assertions and the cut,
2555 (?>A), which pop all the backtrack states associated with A before
2558 Bascktrack state structs are allocated in slabs of about 4K in size.
2559 PL_regmatch_state and st always point to the currently active state,
2560 and PL_regmatch_slab points to the slab currently containing
2561 PL_regmatch_state. The first time regmatch() is called, the first slab is
2562 allocated, and is never freed until interpreter destruction. When the slab
2563 is full, a new one is allocated and chained to the end. At exit from
2564 regmatch(), slabs allocated since entry are freed.
2569 #define DEBUG_STATE_pp(pp) \
2571 DUMP_EXEC_POS(locinput, scan, do_utf8); \
2572 PerlIO_printf(Perl_debug_log, \
2573 " %*s"pp" %s%s%s%s%s\n", \
2575 PL_reg_name[st->resume_state], \
2576 ((st==yes_state||st==mark_state) ? "[" : ""), \
2577 ((st==yes_state) ? "Y" : ""), \
2578 ((st==mark_state) ? "M" : ""), \
2579 ((st==yes_state||st==mark_state) ? "]" : "") \
2584 #define REG_NODE_NUM(x) ((x) ? (int)((x)-prog) : -1)
2589 S_debug_start_match(pTHX_ const REGEXP *prog, const bool do_utf8,
2590 const char *start, const char *end, const char *blurb)
2592 const bool utf8_pat = RX_UTF8(prog) ? 1 : 0;
2594 PERL_ARGS_ASSERT_DEBUG_START_MATCH;
2599 RE_PV_QUOTED_DECL(s0, utf8_pat, PERL_DEBUG_PAD_ZERO(0),
2600 RX_PRECOMP_const(prog), RX_PRELEN(prog), 60);
2602 RE_PV_QUOTED_DECL(s1, do_utf8, PERL_DEBUG_PAD_ZERO(1),
2603 start, end - start, 60);
2605 PerlIO_printf(Perl_debug_log,
2606 "%s%s REx%s %s against %s\n",
2607 PL_colors[4], blurb, PL_colors[5], s0, s1);
2609 if (do_utf8||utf8_pat)
2610 PerlIO_printf(Perl_debug_log, "UTF-8 %s%s%s...\n",
2611 utf8_pat ? "pattern" : "",
2612 utf8_pat && do_utf8 ? " and " : "",
2613 do_utf8 ? "string" : ""
2619 S_dump_exec_pos(pTHX_ const char *locinput,
2620 const regnode *scan,
2621 const char *loc_regeol,
2622 const char *loc_bostr,
2623 const char *loc_reg_starttry,
2626 const int docolor = *PL_colors[0] || *PL_colors[2] || *PL_colors[4];
2627 const int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */
2628 int l = (loc_regeol - locinput) > taill ? taill : (loc_regeol - locinput);
2629 /* The part of the string before starttry has one color
2630 (pref0_len chars), between starttry and current
2631 position another one (pref_len - pref0_len chars),
2632 after the current position the third one.
2633 We assume that pref0_len <= pref_len, otherwise we
2634 decrease pref0_len. */
2635 int pref_len = (locinput - loc_bostr) > (5 + taill) - l
2636 ? (5 + taill) - l : locinput - loc_bostr;
2639 PERL_ARGS_ASSERT_DUMP_EXEC_POS;
2641 while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len)))
2643 pref0_len = pref_len - (locinput - loc_reg_starttry);
2644 if (l + pref_len < (5 + taill) && l < loc_regeol - locinput)
2645 l = ( loc_regeol - locinput > (5 + taill) - pref_len
2646 ? (5 + taill) - pref_len : loc_regeol - locinput);
2647 while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput + l)))
2651 if (pref0_len > pref_len)
2652 pref0_len = pref_len;
2654 const int is_uni = (do_utf8 && OP(scan) != CANY) ? 1 : 0;
2656 RE_PV_COLOR_DECL(s0,len0,is_uni,PERL_DEBUG_PAD(0),
2657 (locinput - pref_len),pref0_len, 60, 4, 5);
2659 RE_PV_COLOR_DECL(s1,len1,is_uni,PERL_DEBUG_PAD(1),
2660 (locinput - pref_len + pref0_len),
2661 pref_len - pref0_len, 60, 2, 3);
2663 RE_PV_COLOR_DECL(s2,len2,is_uni,PERL_DEBUG_PAD(2),
2664 locinput, loc_regeol - locinput, 10, 0, 1);
2666 const STRLEN tlen=len0+len1+len2;
2667 PerlIO_printf(Perl_debug_log,
2668 "%4"IVdf" <%.*s%.*s%s%.*s>%*s|",
2669 (IV)(locinput - loc_bostr),
2672 (docolor ? "" : "> <"),
2674 (int)(tlen > 19 ? 0 : 19 - tlen),
2681 /* reg_check_named_buff_matched()
2682 * Checks to see if a named buffer has matched. The data array of
2683 * buffer numbers corresponding to the buffer is expected to reside
2684 * in the regexp->data->data array in the slot stored in the ARG() of
2685 * node involved. Note that this routine doesn't actually care about the
2686 * name, that information is not preserved from compilation to execution.
2687 * Returns the index of the leftmost defined buffer with the given name
2688 * or 0 if non of the buffers matched.
2691 S_reg_check_named_buff_matched(pTHX_ const regexp *rex, const regnode *scan)
2694 RXi_GET_DECL(rex,rexi);
2695 SV *sv_dat= MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
2696 I32 *nums=(I32*)SvPVX(sv_dat);
2698 PERL_ARGS_ASSERT_REG_CHECK_NAMED_BUFF_MATCHED;
2700 for ( n=0; n<SvIVX(sv_dat); n++ ) {
2701 if ((I32)*PL_reglastparen >= nums[n] &&
2702 PL_regoffs[nums[n]].end != -1)
2711 /* free all slabs above current one - called during LEAVE_SCOPE */
2714 S_clear_backtrack_stack(pTHX_ void *p)
2716 regmatch_slab *s = PL_regmatch_slab->next;
2721 PL_regmatch_slab->next = NULL;
2723 regmatch_slab * const osl = s;
2730 #define SETREX(Re1,Re2) \
2731 if (PL_reg_eval_set) PM_SETRE((PL_reg_curpm), (Re2)); \
2734 STATIC I32 /* 0 failure, 1 success */
2735 S_regmatch(pTHX_ regmatch_info *reginfo, regnode *prog)
2737 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2741 register const bool do_utf8 = PL_reg_match_utf8;
2742 const U32 uniflags = UTF8_ALLOW_DEFAULT;
2743 REGEXP *rex_sv = reginfo->prog;
2744 regexp *rex = (struct regexp *)SvANY(rex_sv);
2745 RXi_GET_DECL(rex,rexi);
2747 /* the current state. This is a cached copy of PL_regmatch_state */
2748 register regmatch_state *st;
2749 /* cache heavy used fields of st in registers */
2750 register regnode *scan;
2751 register regnode *next;
2752 register U32 n = 0; /* general value; init to avoid compiler warning */
2753 register I32 ln = 0; /* len or last; init to avoid compiler warning */
2754 register char *locinput = PL_reginput;
2755 register I32 nextchr; /* is always set to UCHARAT(locinput) */
2757 bool result = 0; /* return value of S_regmatch */
2758 int depth = 0; /* depth of backtrack stack */
2759 U32 nochange_depth = 0; /* depth of GOSUB recursion with nochange */
2760 const U32 max_nochange_depth =
2761 (3 * rex->nparens > MAX_RECURSE_EVAL_NOCHANGE_DEPTH) ?
2762 3 * rex->nparens : MAX_RECURSE_EVAL_NOCHANGE_DEPTH;
2763 regmatch_state *yes_state = NULL; /* state to pop to on success of
2765 /* mark_state piggy backs on the yes_state logic so that when we unwind
2766 the stack on success we can update the mark_state as we go */
2767 regmatch_state *mark_state = NULL; /* last mark state we have seen */
2768 regmatch_state *cur_eval = NULL; /* most recent EVAL_AB state */
2769 struct regmatch_state *cur_curlyx = NULL; /* most recent curlyx */
2771 bool no_final = 0; /* prevent failure from backtracking? */
2772 bool do_cutgroup = 0; /* no_final only until next branch/trie entry */
2773 char *startpoint = PL_reginput;
2774 SV *popmark = NULL; /* are we looking for a mark? */
2775 SV *sv_commit = NULL; /* last mark name seen in failure */
2776 SV *sv_yes_mark = NULL; /* last mark name we have seen
2777 during a successfull match */
2778 U32 lastopen = 0; /* last open we saw */
2779 bool has_cutgroup = RX_HAS_CUTGROUP(rex) ? 1 : 0;
2780 SV* const oreplsv = GvSV(PL_replgv);
2781 /* these three flags are set by various ops to signal information to
2782 * the very next op. They have a useful lifetime of exactly one loop
2783 * iteration, and are not preserved or restored by state pushes/pops
2785 bool sw = 0; /* the condition value in (?(cond)a|b) */
2786 bool minmod = 0; /* the next "{n,m}" is a "{n,m}?" */
2787 int logical = 0; /* the following EVAL is:
2791 or the following IFMATCH/UNLESSM is:
2792 false: plain (?=foo)
2793 true: used as a condition: (?(?=foo))
2796 GET_RE_DEBUG_FLAGS_DECL;
2799 PERL_ARGS_ASSERT_REGMATCH;
2801 DEBUG_OPTIMISE_r( DEBUG_EXECUTE_r({
2802 PerlIO_printf(Perl_debug_log,"regmatch start\n");
2804 /* on first ever call to regmatch, allocate first slab */
2805 if (!PL_regmatch_slab) {
2806 Newx(PL_regmatch_slab, 1, regmatch_slab);
2807 PL_regmatch_slab->prev = NULL;
2808 PL_regmatch_slab->next = NULL;
2809 PL_regmatch_state = SLAB_FIRST(PL_regmatch_slab);
2812 oldsave = PL_savestack_ix;
2813 SAVEDESTRUCTOR_X(S_clear_backtrack_stack, NULL);
2814 SAVEVPTR(PL_regmatch_slab);
2815 SAVEVPTR(PL_regmatch_state);
2817 /* grab next free state slot */
2818 st = ++PL_regmatch_state;
2819 if (st > SLAB_LAST(PL_regmatch_slab))
2820 st = PL_regmatch_state = S_push_slab(aTHX);
2822 /* Note that nextchr is a byte even in UTF */
2823 nextchr = UCHARAT(locinput);
2825 while (scan != NULL) {
2828 SV * const prop = sv_newmortal();
2829 regnode *rnext=regnext(scan);
2830 DUMP_EXEC_POS( locinput, scan, do_utf8 );
2831 regprop(rex, prop, scan);
2833 PerlIO_printf(Perl_debug_log,
2834 "%3"IVdf":%*s%s(%"IVdf")\n",
2835 (IV)(scan - rexi->program), depth*2, "",
2837 (PL_regkind[OP(scan)] == END || !rnext) ?
2838 0 : (IV)(rnext - rexi->program));
2841 next = scan + NEXT_OFF(scan);
2844 state_num = OP(scan);
2848 assert(PL_reglastparen == &rex->lastparen);
2849 assert(PL_reglastcloseparen == &rex->lastcloseparen);
2850 assert(PL_regoffs == rex->offs);
2852 switch (state_num) {
2854 if (locinput == PL_bostr)
2856 /* reginfo->till = reginfo->bol; */
2861 if (locinput == PL_bostr ||
2862 ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n'))
2868 if (locinput == PL_bostr)
2872 if (locinput == reginfo->ganch)
2877 /* update the startpoint */
2878 st->u.keeper.val = PL_regoffs[0].start;
2879 PL_reginput = locinput;
2880 PL_regoffs[0].start = locinput - PL_bostr;
2881 PUSH_STATE_GOTO(KEEPS_next, next);
2883 case KEEPS_next_fail:
2884 /* rollback the start point change */
2885 PL_regoffs[0].start = st->u.keeper.val;
2891 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2896 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2898 if (PL_regeol - locinput > 1)
2902 if (PL_regeol != locinput)
2906 if (!nextchr && locinput >= PL_regeol)
2909 locinput += PL_utf8skip[nextchr];
2910 if (locinput > PL_regeol)
2912 nextchr = UCHARAT(locinput);
2915 nextchr = UCHARAT(++locinput);
2918 if (!nextchr && locinput >= PL_regeol)
2920 nextchr = UCHARAT(++locinput);
2923 if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n')
2926 locinput += PL_utf8skip[nextchr];
2927 if (locinput > PL_regeol)
2929 nextchr = UCHARAT(locinput);
2932 nextchr = UCHARAT(++locinput);
2936 #define ST st->u.trie
2938 /* In this case the charclass data is available inline so
2939 we can fail fast without a lot of extra overhead.
2941 if (scan->flags == EXACT || !do_utf8) {
2942 if(!ANYOF_BITMAP_TEST(scan, *locinput)) {
2944 PerlIO_printf(Perl_debug_log,
2945 "%*s %sfailed to match trie start class...%s\n",
2946 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2955 /* what type of TRIE am I? (utf8 makes this contextual) */
2956 DECL_TRIE_TYPE(scan);
2958 /* what trie are we using right now */
2959 reg_trie_data * const trie
2960 = (reg_trie_data*)rexi->data->data[ ARG( scan ) ];
2961 HV * widecharmap = MUTABLE_HV(rexi->data->data[ ARG( scan ) + 1 ]);
2962 U32 state = trie->startstate;
2964 if (trie->bitmap && trie_type != trie_utf8_fold &&
2965 !TRIE_BITMAP_TEST(trie,*locinput)
2967 if (trie->states[ state ].wordnum) {
2969 PerlIO_printf(Perl_debug_log,
2970 "%*s %smatched empty string...%s\n",
2971 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2976 PerlIO_printf(Perl_debug_log,
2977 "%*s %sfailed to match trie start class...%s\n",
2978 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2985 U8 *uc = ( U8* )locinput;
2989 U8 *uscan = (U8*)NULL;
2991 SV *sv_accept_buff = NULL;
2992 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
2994 ST.accepted = 0; /* how many accepting states we have seen */
2996 ST.jump = trie->jump;
2999 traverse the TRIE keeping track of all accepting states
3000 we transition through until we get to a failing node.
3003 while ( state && uc <= (U8*)PL_regeol ) {
3004 U32 base = trie->states[ state ].trans.base;
3007 /* We use charid to hold the wordnum as we don't use it
3008 for charid until after we have done the wordnum logic.
3009 We define an alias just so that the wordnum logic reads
3012 #define got_wordnum charid
3013 got_wordnum = trie->states[ state ].wordnum;
3015 if ( got_wordnum ) {
3016 if ( ! ST.accepted ) {
3018 SAVETMPS; /* XXX is this necessary? dmq */
3019 bufflen = TRIE_INITAL_ACCEPT_BUFFLEN;
3020 sv_accept_buff=newSV(bufflen *
3021 sizeof(reg_trie_accepted) - 1);
3022 SvCUR_set(sv_accept_buff, 0);
3023 SvPOK_on(sv_accept_buff);
3024 sv_2mortal(sv_accept_buff);
3027 (reg_trie_accepted*)SvPV_nolen(sv_accept_buff );
3030 if (ST.accepted >= bufflen) {
3032 ST.accept_buff =(reg_trie_accepted*)
3033 SvGROW(sv_accept_buff,
3034 bufflen * sizeof(reg_trie_accepted));
3036 SvCUR_set(sv_accept_buff,SvCUR(sv_accept_buff)
3037 + sizeof(reg_trie_accepted));
3040 ST.accept_buff[ST.accepted].wordnum = got_wordnum;
3041 ST.accept_buff[ST.accepted].endpos = uc;
3043 } while (trie->nextword && (got_wordnum= trie->nextword[got_wordnum]));
3047 DEBUG_TRIE_EXECUTE_r({
3048 DUMP_EXEC_POS( (char *)uc, scan, do_utf8 );
3049 PerlIO_printf( Perl_debug_log,
3050 "%*s %sState: %4"UVxf" Accepted: %4"UVxf" ",
3051 2+depth * 2, "", PL_colors[4],
3052 (UV)state, (UV)ST.accepted );
3056 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
3057 uscan, len, uvc, charid, foldlen,
3061 (base + charid > trie->uniquecharcount )
3062 && (base + charid - 1 - trie->uniquecharcount
3064 && trie->trans[base + charid - 1 -
3065 trie->uniquecharcount].check == state)
3067 state = trie->trans[base + charid - 1 -
3068 trie->uniquecharcount ].next;
3079 DEBUG_TRIE_EXECUTE_r(
3080 PerlIO_printf( Perl_debug_log,
3081 "Charid:%3x CP:%4"UVxf" After State: %4"UVxf"%s\n",
3082 charid, uvc, (UV)state, PL_colors[5] );
3089 PerlIO_printf( Perl_debug_log,
3090 "%*s %sgot %"IVdf" possible matches%s\n",
3091 REPORT_CODE_OFF + depth * 2, "",
3092 PL_colors[4], (IV)ST.accepted, PL_colors[5] );
3095 goto trie_first_try; /* jump into the fail handler */
3097 case TRIE_next_fail: /* we failed - try next alterative */
3099 REGCP_UNWIND(ST.cp);
3100 for (n = *PL_reglastparen; n > ST.lastparen; n--)
3101 PL_regoffs[n].end = -1;
3102 *PL_reglastparen = n;
3111 ST.lastparen = *PL_reglastparen;
3114 if ( ST.accepted == 1 ) {
3115 /* only one choice left - just continue */
3117 AV *const trie_words
3118 = MUTABLE_AV(rexi->data->data[ARG(ST.me)+TRIE_WORDS_OFFSET]);
3119 SV ** const tmp = av_fetch( trie_words,
3120 ST.accept_buff[ 0 ].wordnum-1, 0 );
3121 SV *sv= tmp ? sv_newmortal() : NULL;
3123 PerlIO_printf( Perl_debug_log,
3124 "%*s %sonly one match left: #%d <%s>%s\n",
3125 REPORT_CODE_OFF+depth*2, "", PL_colors[4],
3126 ST.accept_buff[ 0 ].wordnum,
3127 tmp ? pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 0,
3128 PL_colors[0], PL_colors[1],
3129 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)
3131 : "not compiled under -Dr",
3134 PL_reginput = (char *)ST.accept_buff[ 0 ].endpos;
3135 /* in this case we free tmps/leave before we call regmatch
3136 as we wont be using accept_buff again. */
3138 locinput = PL_reginput;
3139 nextchr = UCHARAT(locinput);
3140 if ( !ST.jump || !ST.jump[ST.accept_buff[0].wordnum])
3143 scan = ST.me + ST.jump[ST.accept_buff[0].wordnum];
3144 if (!has_cutgroup) {
3149 PUSH_YES_STATE_GOTO(TRIE_next, scan);
3152 continue; /* execute rest of RE */
3155 if ( !ST.accepted-- ) {
3157 PerlIO_printf( Perl_debug_log,
3158 "%*s %sTRIE failed...%s\n",
3159 REPORT_CODE_OFF+depth*2, "",
3170 There are at least two accepting states left. Presumably
3171 the number of accepting states is going to be low,
3172 typically two. So we simply scan through to find the one
3173 with lowest wordnum. Once we find it, we swap the last
3174 state into its place and decrement the size. We then try to
3175 match the rest of the pattern at the point where the word
3176 ends. If we succeed, control just continues along the
3177 regex; if we fail we return here to try the next accepting
3184 for( cur = 1 ; cur <= ST.accepted ; cur++ ) {
3185 DEBUG_TRIE_EXECUTE_r(
3186 PerlIO_printf( Perl_debug_log,
3187 "%*s %sgot %"IVdf" (%d) as best, looking at %"IVdf" (%d)%s\n",
3188 REPORT_CODE_OFF + depth * 2, "", PL_colors[4],
3189 (IV)best, ST.accept_buff[ best ].wordnum, (IV)cur,
3190 ST.accept_buff[ cur ].wordnum, PL_colors[5] );
3193 if (ST.accept_buff[cur].wordnum <
3194 ST.accept_buff[best].wordnum)
3199 AV *const trie_words
3200 = MUTABLE_AV(rexi->data->data[ARG(ST.me)+TRIE_WORDS_OFFSET]);
3201 SV ** const tmp = av_fetch( trie_words,
3202 ST.accept_buff[ best ].wordnum - 1, 0 );
3203 regnode *nextop=(!ST.jump || !ST.jump[ST.accept_buff[best].wordnum]) ?
3205 ST.me + ST.jump[ST.accept_buff[best].wordnum];
3206 SV *sv= tmp ? sv_newmortal() : NULL;
3208 PerlIO_printf( Perl_debug_log,
3209 "%*s %strying alternation #%d <%s> at node #%d %s\n",
3210 REPORT_CODE_OFF+depth*2, "", PL_colors[4],
3211 ST.accept_buff[best].wordnum,
3212 tmp ? pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 0,
3213 PL_colors[0], PL_colors[1],
3214 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)
3215 ) : "not compiled under -Dr",
3216 REG_NODE_NUM(nextop),
3220 if ( best<ST.accepted ) {
3221 reg_trie_accepted tmp = ST.accept_buff[ best ];
3222 ST.accept_buff[ best ] = ST.accept_buff[ ST.accepted ];
3223 ST.accept_buff[ ST.accepted ] = tmp;
3226 PL_reginput = (char *)ST.accept_buff[ best ].endpos;
3227 if ( !ST.jump || !ST.jump[ST.accept_buff[best].wordnum]) {
3230 scan = ST.me + ST.jump[ST.accept_buff[best].wordnum];
3232 PUSH_YES_STATE_GOTO(TRIE_next, scan);
3237 /* we dont want to throw this away, see bug 57042*/
3238 if (oreplsv != GvSV(PL_replgv))
3239 sv_setsv(oreplsv, GvSV(PL_replgv));
3246 char *s = STRING(scan);
3248 if (do_utf8 != UTF) {
3249 /* The target and the pattern have differing utf8ness. */
3251 const char * const e = s + ln;
3254 /* The target is utf8, the pattern is not utf8. */
3259 if (NATIVE_TO_UNI(*(U8*)s) !=
3260 utf8n_to_uvuni((U8*)l, UTF8_MAXBYTES, &ulen,
3268 /* The target is not utf8, the pattern is utf8. */
3273 if (NATIVE_TO_UNI(*((U8*)l)) !=
3274 utf8n_to_uvuni((U8*)s, UTF8_MAXBYTES, &ulen,
3282 nextchr = UCHARAT(locinput);
3285 /* The target and the pattern have the same utf8ness. */
3286 /* Inline the first character, for speed. */
3287 if (UCHARAT(s) != nextchr)
3289 if (PL_regeol - locinput < ln)
3291 if (ln > 1 && memNE(s, locinput, ln))
3294 nextchr = UCHARAT(locinput);
3298 PL_reg_flags |= RF_tainted;
3301 char * const s = STRING(scan);
3304 if (do_utf8 || UTF) {
3305 /* Either target or the pattern are utf8. */
3306 const char * const l = locinput;
3307 char *e = PL_regeol;
3309 if (ibcmp_utf8(s, 0, ln, (bool)UTF,
3310 l, &e, 0, do_utf8)) {
3311 /* One more case for the sharp s:
3312 * pack("U0U*", 0xDF) =~ /ss/i,
3313 * the 0xC3 0x9F are the UTF-8
3314 * byte sequence for the U+00DF. */
3317 toLOWER(s[0]) == 's' &&
3319 toLOWER(s[1]) == 's' &&
3326 nextchr = UCHARAT(locinput);
3330 /* Neither the target and the pattern are utf8. */
3332 /* Inline the first character, for speed. */
3333 if (UCHARAT(s) != nextchr &&
3334 UCHARAT(s) != ((OP(scan) == EXACTF)
3335 ? PL_fold : PL_fold_locale)[nextchr])
3337 if (PL_regeol - locinput < ln)
3339 if (ln > 1 && (OP(scan) == EXACTF
3340 ? ibcmp(s, locinput, ln)
3341 : ibcmp_locale(s, locinput, ln)))
3344 nextchr = UCHARAT(locinput);
3349 PL_reg_flags |= RF_tainted;
3353 /* was last char in word? */
3355 if (locinput == PL_bostr)
3358 const U8 * const r = reghop3((U8*)locinput, -1, (U8*)PL_bostr);
3360 ln = utf8n_to_uvchr(r, UTF8SKIP(r), 0, uniflags);
3362 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3363 ln = isALNUM_uni(ln);
3364 LOAD_UTF8_CHARCLASS_ALNUM();
3365 n = swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8);
3368 ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(ln));
3369 n = isALNUM_LC_utf8((U8*)locinput);
3373 ln = (locinput != PL_bostr) ?
3374 UCHARAT(locinput - 1) : '\n';
3375 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3377 n = isALNUM(nextchr);
3380 ln = isALNUM_LC(ln);
3381 n = isALNUM_LC(nextchr);
3384 if (((!ln) == (!n)) == (OP(scan) == BOUND ||
3385 OP(scan) == BOUNDL))
3390 STRLEN inclasslen = PL_regeol - locinput;
3392 if (!reginclass(rex, scan, (U8*)locinput, &inclasslen, do_utf8))
3394 if (locinput >= PL_regeol)
3396 locinput += inclasslen ? inclasslen : UTF8SKIP(locinput);
3397 nextchr = UCHARAT(locinput);
3402 nextchr = UCHARAT(locinput);
3403 if (!REGINCLASS(rex, scan, (U8*)locinput))
3405 if (!nextchr && locinput >= PL_regeol)
3407 nextchr = UCHARAT(++locinput);
3411 /* If we might have the case of the German sharp s
3412 * in a casefolding Unicode character class. */
3414 if (ANYOF_FOLD_SHARP_S(scan, locinput, PL_regeol)) {
3415 locinput += SHARP_S_SKIP;
3416 nextchr = UCHARAT(locinput);
3422 PL_reg_flags |= RF_tainted;
3428 LOAD_UTF8_CHARCLASS_ALNUM();
3429 if (!(OP(scan) == ALNUM
3430 ? (bool)swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
3431 : isALNUM_LC_utf8((U8*)locinput)))
3435 locinput += PL_utf8skip[nextchr];
3436 nextchr = UCHARAT(locinput);
3439 if (!(OP(scan) == ALNUM
3440 ? isALNUM(nextchr) : isALNUM_LC(nextchr)))
3442 nextchr = UCHARAT(++locinput);
3445 PL_reg_flags |= RF_tainted;
3448 if (!nextchr && locinput >= PL_regeol)
3451 LOAD_UTF8_CHARCLASS_ALNUM();
3452 if (OP(scan) == NALNUM
3453 ? (bool)swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
3454 : isALNUM_LC_utf8((U8*)locinput))
3458 locinput += PL_utf8skip[nextchr];
3459 nextchr = UCHARAT(locinput);
3462 if (OP(scan) == NALNUM
3463 ? isALNUM(nextchr) : isALNUM_LC(nextchr))
3465 nextchr = UCHARAT(++locinput);
3468 PL_reg_flags |= RF_tainted;
3474 if (UTF8_IS_CONTINUED(nextchr)) {
3475 LOAD_UTF8_CHARCLASS_SPACE();
3476 if (!(OP(scan) == SPACE
3477 ? (bool)swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
3478 : isSPACE_LC_utf8((U8*)locinput)))
3482 locinput += PL_utf8skip[nextchr];
3483 nextchr = UCHARAT(locinput);
3487 if (!(OP(scan) == SPACE
3488 ? isSPACE(nextchr) : isSPACE_LC(nextchr)))
3490 nextchr = UCHARAT(++locinput);
3493 PL_reg_flags |= RF_tainted;
3496 if (!nextchr && locinput >= PL_regeol)
3499 LOAD_UTF8_CHARCLASS_SPACE();
3500 if (OP(scan) == NSPACE
3501 ? (bool)swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
3502 : isSPACE_LC_utf8((U8*)locinput))
3506 locinput += PL_utf8skip[nextchr];
3507 nextchr = UCHARAT(locinput);
3510 if (OP(scan) == NSPACE
3511 ? isSPACE(nextchr) : isSPACE_LC(nextchr))
3513 nextchr = UCHARAT(++locinput);
3516 PL_reg_flags |= RF_tainted;
3522 LOAD_UTF8_CHARCLASS_DIGIT();
3523 if (!(OP(scan) == DIGIT
3524 ? (bool)swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
3525 : isDIGIT_LC_utf8((U8*)locinput)))
3529 locinput += PL_utf8skip[nextchr];
3530 nextchr = UCHARAT(locinput);
3533 if (!(OP(scan) == DIGIT
3534 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr)))
3536 nextchr = UCHARAT(++locinput);
3539 PL_reg_flags |= RF_tainted;
3542 if (!nextchr && locinput >= PL_regeol)
3545 LOAD_UTF8_CHARCLASS_DIGIT();
3546 if (OP(scan) == NDIGIT
3547 ? (bool)swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
3548 : isDIGIT_LC_utf8((U8*)locinput))
3552 locinput += PL_utf8skip[nextchr];
3553 nextchr = UCHARAT(locinput);
3556 if (OP(scan) == NDIGIT
3557 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr))
3559 nextchr = UCHARAT(++locinput);
3562 if (locinput >= PL_regeol)
3565 LOAD_UTF8_CHARCLASS_MARK();
3566 if (swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
3568 locinput += PL_utf8skip[nextchr];
3569 while (locinput < PL_regeol &&
3570 swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
3571 locinput += UTF8SKIP(locinput);
3572 if (locinput > PL_regeol)
3577 nextchr = UCHARAT(locinput);
3584 PL_reg_flags |= RF_tainted;
3589 n = reg_check_named_buff_matched(rex,scan);
3592 type = REF + ( type - NREF );
3599 PL_reg_flags |= RF_tainted;
3603 n = ARG(scan); /* which paren pair */
3606 ln = PL_regoffs[n].start;
3607 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
3608 if (*PL_reglastparen < n || ln == -1)
3609 sayNO; /* Do not match unless seen CLOSEn. */
3610 if (ln == PL_regoffs[n].end)
3614 if (do_utf8 && type != REF) { /* REF can do byte comparison */
3616 const char *e = PL_bostr + PL_regoffs[n].end;
3618 * Note that we can't do the "other character" lookup trick as
3619 * in the 8-bit case (no pun intended) because in Unicode we
3620 * have to map both upper and title case to lower case.
3624 STRLEN ulen1, ulen2;
3625 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
3626 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
3630 toLOWER_utf8((U8*)s, tmpbuf1, &ulen1);
3631 toLOWER_utf8((U8*)l, tmpbuf2, &ulen2);
3632 if (ulen1 != ulen2 || memNE((char *)tmpbuf1, (char *)tmpbuf2, ulen1))
3639 nextchr = UCHARAT(locinput);
3643 /* Inline the first character, for speed. */
3644 if (UCHARAT(s) != nextchr &&
3646 (UCHARAT(s) != (type == REFF
3647 ? PL_fold : PL_fold_locale)[nextchr])))
3649 ln = PL_regoffs[n].end - ln;
3650 if (locinput + ln > PL_regeol)
3652 if (ln > 1 && (type == REF
3653 ? memNE(s, locinput, ln)
3655 ? ibcmp(s, locinput, ln)
3656 : ibcmp_locale(s, locinput, ln))))
3659 nextchr = UCHARAT(locinput);
3669 #define ST st->u.eval
3674 regexp_internal *rei;
3675 regnode *startpoint;
3678 case GOSUB: /* /(...(?1))/ /(...(?&foo))/ */
3679 if (cur_eval && cur_eval->locinput==locinput) {
3680 if (cur_eval->u.eval.close_paren == (U32)ARG(scan))
3681 Perl_croak(aTHX_ "Infinite recursion in regex");
3682 if ( ++nochange_depth > max_nochange_depth )
3684 "Pattern subroutine nesting without pos change"
3685 " exceeded limit in regex");
3692 (void)ReREFCNT_inc(rex_sv);
3693 if (OP(scan)==GOSUB) {
3694 startpoint = scan + ARG2L(scan);
3695 ST.close_paren = ARG(scan);
3697 startpoint = rei->program+1;
3700 goto eval_recurse_doit;
3702 case EVAL: /* /(?{A})B/ /(??{A})B/ and /(?(?{A})X|Y)B/ */
3703 if (cur_eval && cur_eval->locinput==locinput) {
3704 if ( ++nochange_depth > max_nochange_depth )
3705 Perl_croak(aTHX_ "EVAL without pos change exceeded limit in regex");
3710 /* execute the code in the {...} */
3712 SV ** const before = SP;
3713 OP_4tree * const oop = PL_op;
3714 COP * const ocurcop = PL_curcop;
3716 char *saved_regeol = PL_regeol;
3719 PL_op = (OP_4tree*)rexi->data->data[n];
3720 DEBUG_STATE_r( PerlIO_printf(Perl_debug_log,
3721 " re_eval 0x%"UVxf"\n", PTR2UV(PL_op)) );
3722 PAD_SAVE_LOCAL(old_comppad, (PAD*)rexi->data->data[n + 2]);
3723 PL_regoffs[0].end = PL_reg_magic->mg_len = locinput - PL_bostr;
3726 SV *sv_mrk = get_sv("REGMARK", 1);
3727 sv_setsv(sv_mrk, sv_yes_mark);
3730 CALLRUNOPS(aTHX); /* Scalar context. */
3733 ret = &PL_sv_undef; /* protect against empty (?{}) blocks. */
3740 PAD_RESTORE_LOCAL(old_comppad);
3741 PL_curcop = ocurcop;
3742 PL_regeol = saved_regeol;
3745 sv_setsv(save_scalar(PL_replgv), ret);
3749 if (logical == 2) { /* Postponed subexpression: /(??{...})/ */
3752 /* extract RE object from returned value; compiling if
3758 SV *const sv = SvRV(ret);
3760 if (SvTYPE(sv) == SVt_REGEXP) {
3762 } else if (SvSMAGICAL(sv)) {
3763 mg = mg_find(sv, PERL_MAGIC_qr);
3766 } else if (SvTYPE(ret) == SVt_REGEXP) {
3768 } else if (SvSMAGICAL(ret)) {
3769 if (SvGMAGICAL(ret)) {
3770 /* I don't believe that there is ever qr magic
3772 assert(!mg_find(ret, PERL_MAGIC_qr));
3773 sv_unmagic(ret, PERL_MAGIC_qr);
3776 mg = mg_find(ret, PERL_MAGIC_qr);
3777 /* testing suggests mg only ends up non-NULL for
3778 scalars who were upgraded and compiled in the
3779 else block below. In turn, this is only
3780 triggered in the "postponed utf8 string" tests
3786 rx = (REGEXP *) mg->mg_obj; /*XXX:dmq*/
3790 rx = reg_temp_copy(rx);
3794 const I32 osize = PL_regsize;
3797 assert (SvUTF8(ret));
3798 } else if (SvUTF8(ret)) {
3799 /* Not doing UTF-8, despite what the SV says. Is
3800 this only if we're trapped in use 'bytes'? */
3801 /* Make a copy of the octet sequence, but without
3802 the flag on, as the compiler now honours the
3803 SvUTF8 flag on ret. */
3805 const char *const p = SvPV(ret, len);
3806 ret = newSVpvn_flags(p, len, SVs_TEMP);
3808 rx = CALLREGCOMP(ret, pm_flags);
3810 & (SVs_TEMP | SVs_PADTMP | SVf_READONLY
3812 /* This isn't a first class regexp. Instead, it's
3813 caching a regexp onto an existing, Perl visible
3815 sv_magic(ret, MUTABLE_SV(rx), PERL_MAGIC_qr, 0, 0);
3820 re = (struct regexp *)SvANY(rx);
3822 RXp_MATCH_COPIED_off(re);
3823 re->subbeg = rex->subbeg;
3824 re->sublen = rex->sublen;
3827 debug_start_match(re_sv, do_utf8, locinput, PL_regeol,
3828 "Matching embedded");
3830 startpoint = rei->program + 1;
3831 ST.close_paren = 0; /* only used for GOSUB */
3832 /* borrowed from regtry */
3833 if (PL_reg_start_tmpl <= re->nparens) {
3834 PL_reg_start_tmpl = re->nparens*3/2 + 3;
3835 if(PL_reg_start_tmp)
3836 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
3838 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
3841 eval_recurse_doit: /* Share code with GOSUB below this line */
3842 /* run the pattern returned from (??{...}) */
3843 ST.cp = regcppush(0); /* Save *all* the positions. */
3844 REGCP_SET(ST.lastcp);
3846 PL_regoffs = re->offs; /* essentially NOOP on GOSUB */
3848 /* see regtry, specifically PL_reglast(?:close)?paren is a pointer! (i dont know why) :dmq */
3849 PL_reglastparen = &re->lastparen;
3850 PL_reglastcloseparen = &re->lastcloseparen;
3852 re->lastcloseparen = 0;
3854 PL_reginput = locinput;
3857 /* XXXX This is too dramatic a measure... */
3860 ST.toggle_reg_flags = PL_reg_flags;
3862 PL_reg_flags |= RF_utf8;
3864 PL_reg_flags &= ~RF_utf8;
3865 ST.toggle_reg_flags ^= PL_reg_flags; /* diff of old and new */
3867 ST.prev_rex = rex_sv;
3868 ST.prev_curlyx = cur_curlyx;
3869 SETREX(rex_sv,re_sv);
3874 ST.prev_eval = cur_eval;
3876 /* now continue from first node in postoned RE */
3877 PUSH_YES_STATE_GOTO(EVAL_AB, startpoint);
3880 /* logical is 1, /(?(?{...})X|Y)/ */
3881 sw = (bool)SvTRUE(ret);
3886 case EVAL_AB: /* cleanup after a successful (??{A})B */
3887 /* note: this is called twice; first after popping B, then A */
3888 PL_reg_flags ^= ST.toggle_reg_flags;
3889 ReREFCNT_dec(rex_sv);
3890 SETREX(rex_sv,ST.prev_rex);
3891 rex = (struct regexp *)SvANY(rex_sv);
3892 rexi = RXi_GET(rex);
3894 cur_eval = ST.prev_eval;
3895 cur_curlyx = ST.prev_curlyx;
3897 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
3898 PL_reglastparen = &rex->lastparen;
3899 PL_reglastcloseparen = &rex->lastcloseparen;
3900 /* also update PL_regoffs */
3901 PL_regoffs = rex->offs;
3903 /* XXXX This is too dramatic a measure... */
3905 if ( nochange_depth )
3910 case EVAL_AB_fail: /* unsuccessfully ran A or B in (??{A})B */
3911 /* note: this is called twice; first after popping B, then A */
3912 PL_reg_flags ^= ST.toggle_reg_flags;
3913 ReREFCNT_dec(rex_sv);
3914 SETREX(rex_sv,ST.prev_rex);
3915 rex = (struct regexp *)SvANY(rex_sv);
3916 rexi = RXi_GET(rex);
3917 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
3918 PL_reglastparen = &rex->lastparen;
3919 PL_reglastcloseparen = &rex->lastcloseparen;
3921 PL_reginput = locinput;
3922 REGCP_UNWIND(ST.lastcp);
3924 cur_eval = ST.prev_eval;
3925 cur_curlyx = ST.prev_curlyx;
3926 /* XXXX This is too dramatic a measure... */
3928 if ( nochange_depth )
3934 n = ARG(scan); /* which paren pair */
3935 PL_reg_start_tmp[n] = locinput;
3941 n = ARG(scan); /* which paren pair */
3942 PL_regoffs[n].start = PL_reg_start_tmp[n] - PL_bostr;
3943 PL_regoffs[n].end = locinput - PL_bostr;
3944 /*if (n > PL_regsize)
3946 if (n > *PL_reglastparen)
3947 *PL_reglastparen = n;
3948 *PL_reglastcloseparen = n;
3949 if (cur_eval && cur_eval->u.eval.close_paren == n) {
3957 cursor && OP(cursor)!=END;
3958 cursor=regnext(cursor))
3960 if ( OP(cursor)==CLOSE ){
3962 if ( n <= lastopen ) {
3964 = PL_reg_start_tmp[n] - PL_bostr;
3965 PL_regoffs[n].end = locinput - PL_bostr;
3966 /*if (n > PL_regsize)
3968 if (n > *PL_reglastparen)
3969 *PL_reglastparen = n;
3970 *PL_reglastcloseparen = n;
3971 if ( n == ARG(scan) || (cur_eval &&
3972 cur_eval->u.eval.close_paren == n))
3981 n = ARG(scan); /* which paren pair */
3982 sw = (bool)(*PL_reglastparen >= n && PL_regoffs[n].end != -1);
3985 /* reg_check_named_buff_matched returns 0 for no match */
3986 sw = (bool)(0 < reg_check_named_buff_matched(rex,scan));
3990 sw = (cur_eval && (!n || cur_eval->u.eval.close_paren == n));
3996 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
3998 next = NEXTOPER(NEXTOPER(scan));
4000 next = scan + ARG(scan);
4001 if (OP(next) == IFTHEN) /* Fake one. */
4002 next = NEXTOPER(NEXTOPER(next));
4006 logical = scan->flags;
4009 /*******************************************************************
4011 The CURLYX/WHILEM pair of ops handle the most generic case of the /A*B/
4012 pattern, where A and B are subpatterns. (For simple A, CURLYM or
4013 STAR/PLUS/CURLY/CURLYN are used instead.)
4015 A*B is compiled as <CURLYX><A><WHILEM><B>
4017 On entry to the subpattern, CURLYX is called. This pushes a CURLYX
4018 state, which contains the current count, initialised to -1. It also sets
4019 cur_curlyx to point to this state, with any previous value saved in the
4022 CURLYX then jumps straight to the WHILEM op, rather than executing A,
4023 since the pattern may possibly match zero times (i.e. it's a while {} loop
4024 rather than a do {} while loop).
4026 Each entry to WHILEM represents a successful match of A. The count in the
4027 CURLYX block is incremented, another WHILEM state is pushed, and execution
4028 passes to A or B depending on greediness and the current count.
4030 For example, if matching against the string a1a2a3b (where the aN are
4031 substrings that match /A/), then the match progresses as follows: (the
4032 pushed states are interspersed with the bits of strings matched so far):
4035 <CURLYX cnt=0><WHILEM>
4036 <CURLYX cnt=1><WHILEM> a1 <WHILEM>
4037 <CURLYX cnt=2><WHILEM> a1 <WHILEM> a2 <WHILEM>
4038 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM>
4039 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM> b
4041 (Contrast this with something like CURLYM, which maintains only a single
4045 a1 <CURLYM cnt=1> a2
4046 a1 a2 <CURLYM cnt=2> a3
4047 a1 a2 a3 <CURLYM cnt=3> b
4050 Each WHILEM state block marks a point to backtrack to upon partial failure
4051 of A or B, and also contains some minor state data related to that
4052 iteration. The CURLYX block, pointed to by cur_curlyx, contains the
4053 overall state, such as the count, and pointers to the A and B ops.
4055 This is complicated slightly by nested CURLYX/WHILEM's. Since cur_curlyx
4056 must always point to the *current* CURLYX block, the rules are:
4058 When executing CURLYX, save the old cur_curlyx in the CURLYX state block,
4059 and set cur_curlyx to point the new block.
4061 When popping the CURLYX block after a successful or unsuccessful match,
4062 restore the previous cur_curlyx.
4064 When WHILEM is about to execute B, save the current cur_curlyx, and set it
4065 to the outer one saved in the CURLYX block.
4067 When popping the WHILEM block after a successful or unsuccessful B match,
4068 restore the previous cur_curlyx.
4070 Here's an example for the pattern (AI* BI)*BO
4071 I and O refer to inner and outer, C and W refer to CURLYX and WHILEM:
4074 curlyx backtrack stack
4075 ------ ---------------
4077 CO <CO prev=NULL> <WO>
4078 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4079 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4080 NULL <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi <WO prev=CO> bo
4082 At this point the pattern succeeds, and we work back down the stack to
4083 clean up, restoring as we go:
4085 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4086 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4087 CO <CO prev=NULL> <WO>
4090 *******************************************************************/
4092 #define ST st->u.curlyx
4094 case CURLYX: /* start of /A*B/ (for complex A) */
4096 /* No need to save/restore up to this paren */
4097 I32 parenfloor = scan->flags;
4099 assert(next); /* keep Coverity happy */
4100 if (OP(PREVOPER(next)) == NOTHING) /* LONGJMP */
4103 /* XXXX Probably it is better to teach regpush to support
4104 parenfloor > PL_regsize... */
4105 if (parenfloor > (I32)*PL_reglastparen)
4106 parenfloor = *PL_reglastparen; /* Pessimization... */
4108 ST.prev_curlyx= cur_curlyx;
4110 ST.cp = PL_savestack_ix;
4112 /* these fields contain the state of the current curly.
4113 * they are accessed by subsequent WHILEMs */
4114 ST.parenfloor = parenfloor;
4115 ST.min = ARG1(scan);
4116 ST.max = ARG2(scan);
4117 ST.A = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
4121 ST.count = -1; /* this will be updated by WHILEM */
4122 ST.lastloc = NULL; /* this will be updated by WHILEM */
4124 PL_reginput = locinput;
4125 PUSH_YES_STATE_GOTO(CURLYX_end, PREVOPER(next));
4129 case CURLYX_end: /* just finished matching all of A*B */
4130 cur_curlyx = ST.prev_curlyx;
4134 case CURLYX_end_fail: /* just failed to match all of A*B */
4136 cur_curlyx = ST.prev_curlyx;
4142 #define ST st->u.whilem
4144 case WHILEM: /* just matched an A in /A*B/ (for complex A) */
4146 /* see the discussion above about CURLYX/WHILEM */
4148 assert(cur_curlyx); /* keep Coverity happy */
4149 n = ++cur_curlyx->u.curlyx.count; /* how many A's matched */
4150 ST.save_lastloc = cur_curlyx->u.curlyx.lastloc;
4151 ST.cache_offset = 0;
4154 PL_reginput = locinput;
4156 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4157 "%*s whilem: matched %ld out of %ld..%ld\n",
4158 REPORT_CODE_OFF+depth*2, "", (long)n,
4159 (long)cur_curlyx->u.curlyx.min,
4160 (long)cur_curlyx->u.curlyx.max)
4163 /* First just match a string of min A's. */
4165 if (n < cur_curlyx->u.curlyx.min) {
4166 cur_curlyx->u.curlyx.lastloc = locinput;
4167 PUSH_STATE_GOTO(WHILEM_A_pre, cur_curlyx->u.curlyx.A);
4171 /* If degenerate A matches "", assume A done. */
4173 if (locinput == cur_curlyx->u.curlyx.lastloc) {
4174 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4175 "%*s whilem: empty match detected, trying continuation...\n",
4176 REPORT_CODE_OFF+depth*2, "")
4178 goto do_whilem_B_max;
4181 /* super-linear cache processing */
4185 if (!PL_reg_maxiter) {
4186 /* start the countdown: Postpone detection until we
4187 * know the match is not *that* much linear. */
4188 PL_reg_maxiter = (PL_regeol - PL_bostr + 1) * (scan->flags>>4);
4189 /* possible overflow for long strings and many CURLYX's */
4190 if (PL_reg_maxiter < 0)
4191 PL_reg_maxiter = I32_MAX;
4192 PL_reg_leftiter = PL_reg_maxiter;
4195 if (PL_reg_leftiter-- == 0) {
4196 /* initialise cache */
4197 const I32 size = (PL_reg_maxiter + 7)/8;
4198 if (PL_reg_poscache) {
4199 if ((I32)PL_reg_poscache_size < size) {
4200 Renew(PL_reg_poscache, size, char);
4201 PL_reg_poscache_size = size;
4203 Zero(PL_reg_poscache, size, char);
4206 PL_reg_poscache_size = size;
4207 Newxz(PL_reg_poscache, size, char);
4209 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4210 "%swhilem: Detected a super-linear match, switching on caching%s...\n",
4211 PL_colors[4], PL_colors[5])
4215 if (PL_reg_leftiter < 0) {
4216 /* have we already failed at this position? */
4218 offset = (scan->flags & 0xf) - 1
4219 + (locinput - PL_bostr) * (scan->flags>>4);
4220 mask = 1 << (offset % 8);
4222 if (PL_reg_poscache[offset] & mask) {
4223 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4224 "%*s whilem: (cache) already tried at this position...\n",
4225 REPORT_CODE_OFF+depth*2, "")
4227 sayNO; /* cache records failure */
4229 ST.cache_offset = offset;
4230 ST.cache_mask = mask;
4234 /* Prefer B over A for minimal matching. */
4236 if (cur_curlyx->u.curlyx.minmod) {
4237 ST.save_curlyx = cur_curlyx;
4238 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4239 ST.cp = regcppush(ST.save_curlyx->u.curlyx.parenfloor);
4240 REGCP_SET(ST.lastcp);
4241 PUSH_YES_STATE_GOTO(WHILEM_B_min, ST.save_curlyx->u.curlyx.B);
4245 /* Prefer A over B for maximal matching. */
4247 if (n < cur_curlyx->u.curlyx.max) { /* More greed allowed? */
4248 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4249 cur_curlyx->u.curlyx.lastloc = locinput;
4250 REGCP_SET(ST.lastcp);
4251 PUSH_STATE_GOTO(WHILEM_A_max, cur_curlyx->u.curlyx.A);
4254 goto do_whilem_B_max;
4258 case WHILEM_B_min: /* just matched B in a minimal match */
4259 case WHILEM_B_max: /* just matched B in a maximal match */
4260 cur_curlyx = ST.save_curlyx;
4264 case WHILEM_B_max_fail: /* just failed to match B in a maximal match */
4265 cur_curlyx = ST.save_curlyx;
4266 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4267 cur_curlyx->u.curlyx.count--;
4271 case WHILEM_A_min_fail: /* just failed to match A in a minimal match */
4272 REGCP_UNWIND(ST.lastcp);
4275 case WHILEM_A_pre_fail: /* just failed to match even minimal A */
4276 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4277 cur_curlyx->u.curlyx.count--;
4281 case WHILEM_A_max_fail: /* just failed to match A in a maximal match */
4282 REGCP_UNWIND(ST.lastcp);
4283 regcppop(rex); /* Restore some previous $<digit>s? */
4284 PL_reginput = locinput;
4285 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4286 "%*s whilem: failed, trying continuation...\n",
4287 REPORT_CODE_OFF+depth*2, "")
4290 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4291 && ckWARN(WARN_REGEXP)
4292 && !(PL_reg_flags & RF_warned))
4294 PL_reg_flags |= RF_warned;
4295 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s limit (%d) exceeded",
4296 "Complex regular subexpression recursion",
4301 ST.save_curlyx = cur_curlyx;
4302 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4303 PUSH_YES_STATE_GOTO(WHILEM_B_max, ST.save_curlyx->u.curlyx.B);
4306 case WHILEM_B_min_fail: /* just failed to match B in a minimal match */
4307 cur_curlyx = ST.save_curlyx;
4308 REGCP_UNWIND(ST.lastcp);
4311 if (cur_curlyx->u.curlyx.count >= cur_curlyx->u.curlyx.max) {
4312 /* Maximum greed exceeded */
4313 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4314 && ckWARN(WARN_REGEXP)
4315 && !(PL_reg_flags & RF_warned))
4317 PL_reg_flags |= RF_warned;
4318 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
4319 "%s limit (%d) exceeded",
4320 "Complex regular subexpression recursion",
4323 cur_curlyx->u.curlyx.count--;
4327 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4328 "%*s trying longer...\n", REPORT_CODE_OFF+depth*2, "")
4330 /* Try grabbing another A and see if it helps. */
4331 PL_reginput = locinput;
4332 cur_curlyx->u.curlyx.lastloc = locinput;
4333 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4334 REGCP_SET(ST.lastcp);
4335 PUSH_STATE_GOTO(WHILEM_A_min, ST.save_curlyx->u.curlyx.A);
4339 #define ST st->u.branch
4341 case BRANCHJ: /* /(...|A|...)/ with long next pointer */
4342 next = scan + ARG(scan);
4345 scan = NEXTOPER(scan);
4348 case BRANCH: /* /(...|A|...)/ */
4349 scan = NEXTOPER(scan); /* scan now points to inner node */
4350 ST.lastparen = *PL_reglastparen;
4351 ST.next_branch = next;
4353 PL_reginput = locinput;
4355 /* Now go into the branch */
4357 PUSH_YES_STATE_GOTO(BRANCH_next, scan);
4359 PUSH_STATE_GOTO(BRANCH_next, scan);
4363 PL_reginput = locinput;
4364 sv_yes_mark = st->u.mark.mark_name = scan->flags ? NULL :
4365 MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
4366 PUSH_STATE_GOTO(CUTGROUP_next,next);
4368 case CUTGROUP_next_fail:
4371 if (st->u.mark.mark_name)
4372 sv_commit = st->u.mark.mark_name;
4378 case BRANCH_next_fail: /* that branch failed; try the next, if any */
4383 REGCP_UNWIND(ST.cp);
4384 for (n = *PL_reglastparen; n > ST.lastparen; n--)
4385 PL_regoffs[n].end = -1;
4386 *PL_reglastparen = n;
4387 /*dmq: *PL_reglastcloseparen = n; */
4388 scan = ST.next_branch;
4389 /* no more branches? */
4390 if (!scan || (OP(scan) != BRANCH && OP(scan) != BRANCHJ)) {
4392 PerlIO_printf( Perl_debug_log,
4393 "%*s %sBRANCH failed...%s\n",
4394 REPORT_CODE_OFF+depth*2, "",
4400 continue; /* execute next BRANCH[J] op */
4408 #define ST st->u.curlym
4410 case CURLYM: /* /A{m,n}B/ where A is fixed-length */
4412 /* This is an optimisation of CURLYX that enables us to push
4413 * only a single backtracking state, no matter how many matches
4414 * there are in {m,n}. It relies on the pattern being constant
4415 * length, with no parens to influence future backrefs
4419 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
4421 /* if paren positive, emulate an OPEN/CLOSE around A */
4423 U32 paren = ST.me->flags;
4424 if (paren > PL_regsize)
4426 if (paren > *PL_reglastparen)
4427 *PL_reglastparen = paren;
4428 scan += NEXT_OFF(scan); /* Skip former OPEN. */
4436 ST.c1 = CHRTEST_UNINIT;
4439 if (!(ST.minmod ? ARG1(ST.me) : ARG2(ST.me))) /* min/max */
4442 curlym_do_A: /* execute the A in /A{m,n}B/ */
4443 PL_reginput = locinput;
4444 PUSH_YES_STATE_GOTO(CURLYM_A, ST.A); /* match A */
4447 case CURLYM_A: /* we've just matched an A */
4448 locinput = st->locinput;
4449 nextchr = UCHARAT(locinput);
4452 /* after first match, determine A's length: u.curlym.alen */
4453 if (ST.count == 1) {
4454 if (PL_reg_match_utf8) {
4456 while (s < PL_reginput) {
4462 ST.alen = PL_reginput - locinput;
4465 ST.count = ST.minmod ? ARG1(ST.me) : ARG2(ST.me);
4468 PerlIO_printf(Perl_debug_log,
4469 "%*s CURLYM now matched %"IVdf" times, len=%"IVdf"...\n",
4470 (int)(REPORT_CODE_OFF+(depth*2)), "",
4471 (IV) ST.count, (IV)ST.alen)
4474 locinput = PL_reginput;
4476 if (cur_eval && cur_eval->u.eval.close_paren &&
4477 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4481 I32 max = (ST.minmod ? ARG1(ST.me) : ARG2(ST.me));
4482 if ( max == REG_INFTY || ST.count < max )
4483 goto curlym_do_A; /* try to match another A */
4485 goto curlym_do_B; /* try to match B */
4487 case CURLYM_A_fail: /* just failed to match an A */
4488 REGCP_UNWIND(ST.cp);
4490 if (ST.minmod || ST.count < ARG1(ST.me) /* min*/
4491 || (cur_eval && cur_eval->u.eval.close_paren &&
4492 cur_eval->u.eval.close_paren == (U32)ST.me->flags))
4495 curlym_do_B: /* execute the B in /A{m,n}B/ */
4496 PL_reginput = locinput;
4497 if (ST.c1 == CHRTEST_UNINIT) {
4498 /* calculate c1 and c2 for possible match of 1st char
4499 * following curly */
4500 ST.c1 = ST.c2 = CHRTEST_VOID;
4501 if (HAS_TEXT(ST.B) || JUMPABLE(ST.B)) {
4502 regnode *text_node = ST.B;
4503 if (! HAS_TEXT(text_node))
4504 FIND_NEXT_IMPT(text_node);
4507 (HAS_TEXT(text_node) && PL_regkind[OP(text_node)] == EXACT)
4509 But the former is redundant in light of the latter.
4511 if this changes back then the macro for
4512 IS_TEXT and friends need to change.
4514 if (PL_regkind[OP(text_node)] == EXACT)
4517 ST.c1 = (U8)*STRING(text_node);
4519 (IS_TEXTF(text_node))
4521 : (IS_TEXTFL(text_node))
4522 ? PL_fold_locale[ST.c1]
4529 PerlIO_printf(Perl_debug_log,
4530 "%*s CURLYM trying tail with matches=%"IVdf"...\n",
4531 (int)(REPORT_CODE_OFF+(depth*2)),
4534 if (ST.c1 != CHRTEST_VOID
4535 && UCHARAT(PL_reginput) != ST.c1
4536 && UCHARAT(PL_reginput) != ST.c2)
4538 /* simulate B failing */
4540 PerlIO_printf(Perl_debug_log,
4541 "%*s CURLYM Fast bail c1=%"IVdf" c2=%"IVdf"\n",
4542 (int)(REPORT_CODE_OFF+(depth*2)),"",
4545 state_num = CURLYM_B_fail;
4546 goto reenter_switch;
4550 /* mark current A as captured */
4551 I32 paren = ST.me->flags;
4553 PL_regoffs[paren].start
4554 = HOPc(PL_reginput, -ST.alen) - PL_bostr;
4555 PL_regoffs[paren].end = PL_reginput - PL_bostr;
4556 /*dmq: *PL_reglastcloseparen = paren; */
4559 PL_regoffs[paren].end = -1;
4560 if (cur_eval && cur_eval->u.eval.close_paren &&
4561 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4570 PUSH_STATE_GOTO(CURLYM_B, ST.B); /* match B */
4573 case CURLYM_B_fail: /* just failed to match a B */
4574 REGCP_UNWIND(ST.cp);
4576 I32 max = ARG2(ST.me);
4577 if (max != REG_INFTY && ST.count == max)
4579 goto curlym_do_A; /* try to match a further A */
4581 /* backtrack one A */
4582 if (ST.count == ARG1(ST.me) /* min */)
4585 locinput = HOPc(locinput, -ST.alen);
4586 goto curlym_do_B; /* try to match B */
4589 #define ST st->u.curly
4591 #define CURLY_SETPAREN(paren, success) \
4594 PL_regoffs[paren].start = HOPc(locinput, -1) - PL_bostr; \
4595 PL_regoffs[paren].end = locinput - PL_bostr; \
4596 *PL_reglastcloseparen = paren; \
4599 PL_regoffs[paren].end = -1; \
4602 case STAR: /* /A*B/ where A is width 1 */
4606 scan = NEXTOPER(scan);
4608 case PLUS: /* /A+B/ where A is width 1 */
4612 scan = NEXTOPER(scan);
4614 case CURLYN: /* /(A){m,n}B/ where A is width 1 */
4615 ST.paren = scan->flags; /* Which paren to set */
4616 if (ST.paren > PL_regsize)
4617 PL_regsize = ST.paren;
4618 if (ST.paren > *PL_reglastparen)
4619 *PL_reglastparen = ST.paren;
4620 ST.min = ARG1(scan); /* min to match */
4621 ST.max = ARG2(scan); /* max to match */
4622 if (cur_eval && cur_eval->u.eval.close_paren &&
4623 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4627 scan = regnext(NEXTOPER(scan) + NODE_STEP_REGNODE);
4629 case CURLY: /* /A{m,n}B/ where A is width 1 */
4631 ST.min = ARG1(scan); /* min to match */
4632 ST.max = ARG2(scan); /* max to match */
4633 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
4636 * Lookahead to avoid useless match attempts
4637 * when we know what character comes next.
4639 * Used to only do .*x and .*?x, but now it allows
4640 * for )'s, ('s and (?{ ... })'s to be in the way
4641 * of the quantifier and the EXACT-like node. -- japhy
4644 if (ST.min > ST.max) /* XXX make this a compile-time check? */
4646 if (HAS_TEXT(next) || JUMPABLE(next)) {
4648 regnode *text_node = next;
4650 if (! HAS_TEXT(text_node))
4651 FIND_NEXT_IMPT(text_node);
4653 if (! HAS_TEXT(text_node))
4654 ST.c1 = ST.c2 = CHRTEST_VOID;
4656 if ( PL_regkind[OP(text_node)] != EXACT ) {
4657 ST.c1 = ST.c2 = CHRTEST_VOID;
4658 goto assume_ok_easy;
4661 s = (U8*)STRING(text_node);
4663 /* Currently we only get here when
4665 PL_rekind[OP(text_node)] == EXACT
4667 if this changes back then the macro for IS_TEXT and
4668 friends need to change. */
4671 if (IS_TEXTF(text_node))
4672 ST.c2 = PL_fold[ST.c1];
4673 else if (IS_TEXTFL(text_node))
4674 ST.c2 = PL_fold_locale[ST.c1];
4677 if (IS_TEXTF(text_node)) {
4678 STRLEN ulen1, ulen2;
4679 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
4680 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
4682 to_utf8_lower((U8*)s, tmpbuf1, &ulen1);
4683 to_utf8_upper((U8*)s, tmpbuf2, &ulen2);
4685 ST.c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXLEN, 0,
4687 0 : UTF8_ALLOW_ANY);
4688 ST.c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXLEN, 0,
4690 0 : UTF8_ALLOW_ANY);
4692 ST.c1 = utf8n_to_uvuni(tmpbuf1, UTF8_MAXBYTES, 0,
4694 ST.c2 = utf8n_to_uvuni(tmpbuf2, UTF8_MAXBYTES, 0,
4699 ST.c2 = ST.c1 = utf8n_to_uvchr(s, UTF8_MAXBYTES, 0,
4706 ST.c1 = ST.c2 = CHRTEST_VOID;
4711 PL_reginput = locinput;
4714 if (ST.min && regrepeat(rex, ST.A, ST.min, depth) < ST.min)
4717 locinput = PL_reginput;
4719 if (ST.c1 == CHRTEST_VOID)
4720 goto curly_try_B_min;
4722 ST.oldloc = locinput;
4724 /* set ST.maxpos to the furthest point along the
4725 * string that could possibly match */
4726 if (ST.max == REG_INFTY) {
4727 ST.maxpos = PL_regeol - 1;
4729 while (UTF8_IS_CONTINUATION(*(U8*)ST.maxpos))
4733 int m = ST.max - ST.min;
4734 for (ST.maxpos = locinput;
4735 m >0 && ST.maxpos + UTF8SKIP(ST.maxpos) <= PL_regeol; m--)
4736 ST.maxpos += UTF8SKIP(ST.maxpos);
4739 ST.maxpos = locinput + ST.max - ST.min;
4740 if (ST.maxpos >= PL_regeol)
4741 ST.maxpos = PL_regeol - 1;
4743 goto curly_try_B_min_known;
4747 ST.count = regrepeat(rex, ST.A, ST.max, depth);
4748 locinput = PL_reginput;
4749 if (ST.count < ST.min)
4751 if ((ST.count > ST.min)
4752 && (PL_regkind[OP(ST.B)] == EOL) && (OP(ST.B) != MEOL))
4754 /* A{m,n} must come at the end of the string, there's
4755 * no point in backing off ... */
4757 /* ...except that $ and \Z can match before *and* after
4758 newline at the end. Consider "\n\n" =~ /\n+\Z\n/.
4759 We may back off by one in this case. */
4760 if (UCHARAT(PL_reginput - 1) == '\n' && OP(ST.B) != EOS)
4764 goto curly_try_B_max;
4769 case CURLY_B_min_known_fail:
4770 /* failed to find B in a non-greedy match where c1,c2 valid */
4771 if (ST.paren && ST.count)
4772 PL_regoffs[ST.paren].end = -1;
4774 PL_reginput = locinput; /* Could be reset... */
4775 REGCP_UNWIND(ST.cp);
4776 /* Couldn't or didn't -- move forward. */
4777 ST.oldloc = locinput;
4779 locinput += UTF8SKIP(locinput);
4783 curly_try_B_min_known:
4784 /* find the next place where 'B' could work, then call B */
4788 n = (ST.oldloc == locinput) ? 0 : 1;
4789 if (ST.c1 == ST.c2) {
4791 /* set n to utf8_distance(oldloc, locinput) */
4792 while (locinput <= ST.maxpos &&
4793 utf8n_to_uvchr((U8*)locinput,
4794 UTF8_MAXBYTES, &len,
4795 uniflags) != (UV)ST.c1) {
4801 /* set n to utf8_distance(oldloc, locinput) */
4802 while (locinput <= ST.maxpos) {
4804 const UV c = utf8n_to_uvchr((U8*)locinput,
4805 UTF8_MAXBYTES, &len,
4807 if (c == (UV)ST.c1 || c == (UV)ST.c2)
4815 if (ST.c1 == ST.c2) {
4816 while (locinput <= ST.maxpos &&
4817 UCHARAT(locinput) != ST.c1)
4821 while (locinput <= ST.maxpos
4822 && UCHARAT(locinput) != ST.c1
4823 && UCHARAT(locinput) != ST.c2)
4826 n = locinput - ST.oldloc;
4828 if (locinput > ST.maxpos)
4830 /* PL_reginput == oldloc now */
4833 if (regrepeat(rex, ST.A, n, depth) < n)
4836 PL_reginput = locinput;
4837 CURLY_SETPAREN(ST.paren, ST.count);
4838 if (cur_eval && cur_eval->u.eval.close_paren &&
4839 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4842 PUSH_STATE_GOTO(CURLY_B_min_known, ST.B);
4847 case CURLY_B_min_fail:
4848 /* failed to find B in a non-greedy match where c1,c2 invalid */
4849 if (ST.paren && ST.count)
4850 PL_regoffs[ST.paren].end = -1;
4852 REGCP_UNWIND(ST.cp);
4853 /* failed -- move forward one */
4854 PL_reginput = locinput;
4855 if (regrepeat(rex, ST.A, 1, depth)) {
4857 locinput = PL_reginput;
4858 if (ST.count <= ST.max || (ST.max == REG_INFTY &&
4859 ST.count > 0)) /* count overflow ? */
4862 CURLY_SETPAREN(ST.paren, ST.count);
4863 if (cur_eval && cur_eval->u.eval.close_paren &&
4864 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4867 PUSH_STATE_GOTO(CURLY_B_min, ST.B);
4875 /* a successful greedy match: now try to match B */
4876 if (cur_eval && cur_eval->u.eval.close_paren &&
4877 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4882 if (ST.c1 != CHRTEST_VOID)
4883 c = do_utf8 ? utf8n_to_uvchr((U8*)PL_reginput,
4884 UTF8_MAXBYTES, 0, uniflags)
4885 : (UV) UCHARAT(PL_reginput);
4886 /* If it could work, try it. */
4887 if (ST.c1 == CHRTEST_VOID || c == (UV)ST.c1 || c == (UV)ST.c2) {
4888 CURLY_SETPAREN(ST.paren, ST.count);
4889 PUSH_STATE_GOTO(CURLY_B_max, ST.B);
4894 case CURLY_B_max_fail:
4895 /* failed to find B in a greedy match */
4896 if (ST.paren && ST.count)
4897 PL_regoffs[ST.paren].end = -1;
4899 REGCP_UNWIND(ST.cp);
4901 if (--ST.count < ST.min)
4903 PL_reginput = locinput = HOPc(locinput, -1);
4904 goto curly_try_B_max;
4911 /* we've just finished A in /(??{A})B/; now continue with B */
4913 st->u.eval.toggle_reg_flags
4914 = cur_eval->u.eval.toggle_reg_flags;
4915 PL_reg_flags ^= st->u.eval.toggle_reg_flags;
4917 st->u.eval.prev_rex = rex_sv; /* inner */
4918 SETREX(rex_sv,cur_eval->u.eval.prev_rex);
4919 rex = (struct regexp *)SvANY(rex_sv);
4920 rexi = RXi_GET(rex);
4921 cur_curlyx = cur_eval->u.eval.prev_curlyx;
4922 ReREFCNT_inc(rex_sv);
4923 st->u.eval.cp = regcppush(0); /* Save *all* the positions. */
4925 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
4926 PL_reglastparen = &rex->lastparen;
4927 PL_reglastcloseparen = &rex->lastcloseparen;
4929 REGCP_SET(st->u.eval.lastcp);
4930 PL_reginput = locinput;
4932 /* Restore parens of the outer rex without popping the
4934 tmpix = PL_savestack_ix;
4935 PL_savestack_ix = cur_eval->u.eval.lastcp;
4937 PL_savestack_ix = tmpix;
4939 st->u.eval.prev_eval = cur_eval;
4940 cur_eval = cur_eval->u.eval.prev_eval;
4942 PerlIO_printf(Perl_debug_log, "%*s EVAL trying tail ... %"UVxf"\n",
4943 REPORT_CODE_OFF+depth*2, "",PTR2UV(cur_eval)););
4944 if ( nochange_depth )
4947 PUSH_YES_STATE_GOTO(EVAL_AB,
4948 st->u.eval.prev_eval->u.eval.B); /* match B */
4951 if (locinput < reginfo->till) {
4952 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4953 "%sMatch possible, but length=%ld is smaller than requested=%ld, failing!%s\n",
4955 (long)(locinput - PL_reg_starttry),
4956 (long)(reginfo->till - PL_reg_starttry),
4959 sayNO_SILENT; /* Cannot match: too short. */
4961 PL_reginput = locinput; /* put where regtry can find it */
4962 sayYES; /* Success! */
4964 case SUCCEED: /* successful SUSPEND/UNLESSM/IFMATCH/CURLYM */
4966 PerlIO_printf(Perl_debug_log,
4967 "%*s %ssubpattern success...%s\n",
4968 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5]));
4969 PL_reginput = locinput; /* put where regtry can find it */
4970 sayYES; /* Success! */
4973 #define ST st->u.ifmatch
4975 case SUSPEND: /* (?>A) */
4977 PL_reginput = locinput;
4980 case UNLESSM: /* -ve lookaround: (?!A), or with flags, (?<!A) */
4982 goto ifmatch_trivial_fail_test;
4984 case IFMATCH: /* +ve lookaround: (?=A), or with flags, (?<=A) */
4986 ifmatch_trivial_fail_test:
4988 char * const s = HOPBACKc(locinput, scan->flags);
4993 sw = 1 - (bool)ST.wanted;
4997 next = scan + ARG(scan);
5005 PL_reginput = locinput;
5009 ST.logical = logical;
5010 logical = 0; /* XXX: reset state of logical once it has been saved into ST */
5012 /* execute body of (?...A) */
5013 PUSH_YES_STATE_GOTO(IFMATCH_A, NEXTOPER(NEXTOPER(scan)));
5016 case IFMATCH_A_fail: /* body of (?...A) failed */
5017 ST.wanted = !ST.wanted;
5020 case IFMATCH_A: /* body of (?...A) succeeded */
5022 sw = (bool)ST.wanted;
5024 else if (!ST.wanted)
5027 if (OP(ST.me) == SUSPEND)
5028 locinput = PL_reginput;
5030 locinput = PL_reginput = st->locinput;
5031 nextchr = UCHARAT(locinput);
5033 scan = ST.me + ARG(ST.me);
5036 continue; /* execute B */
5041 next = scan + ARG(scan);
5046 reginfo->cutpoint = PL_regeol;
5049 PL_reginput = locinput;
5051 sv_yes_mark = sv_commit = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5052 PUSH_STATE_GOTO(COMMIT_next,next);
5054 case COMMIT_next_fail:
5061 #define ST st->u.mark
5063 ST.prev_mark = mark_state;
5064 ST.mark_name = sv_commit = sv_yes_mark
5065 = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5067 ST.mark_loc = PL_reginput = locinput;
5068 PUSH_YES_STATE_GOTO(MARKPOINT_next,next);
5070 case MARKPOINT_next:
5071 mark_state = ST.prev_mark;
5074 case MARKPOINT_next_fail:
5075 if (popmark && sv_eq(ST.mark_name,popmark))
5077 if (ST.mark_loc > startpoint)
5078 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5079 popmark = NULL; /* we found our mark */
5080 sv_commit = ST.mark_name;
5083 PerlIO_printf(Perl_debug_log,
5084 "%*s %ssetting cutpoint to mark:%"SVf"...%s\n",
5085 REPORT_CODE_OFF+depth*2, "",
5086 PL_colors[4], SVfARG(sv_commit), PL_colors[5]);
5089 mark_state = ST.prev_mark;
5090 sv_yes_mark = mark_state ?
5091 mark_state->u.mark.mark_name : NULL;
5095 PL_reginput = locinput;
5097 /* (*SKIP) : if we fail we cut here*/
5098 ST.mark_name = NULL;
5099 ST.mark_loc = locinput;
5100 PUSH_STATE_GOTO(SKIP_next,next);
5102 /* (*SKIP:NAME) : if there is a (*MARK:NAME) fail where it was,
5103 otherwise do nothing. Meaning we need to scan
5105 regmatch_state *cur = mark_state;
5106 SV *find = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5109 if ( sv_eq( cur->u.mark.mark_name,
5112 ST.mark_name = find;
5113 PUSH_STATE_GOTO( SKIP_next, next );
5115 cur = cur->u.mark.prev_mark;
5118 /* Didn't find our (*MARK:NAME) so ignore this (*SKIP:NAME) */
5120 case SKIP_next_fail:
5122 /* (*CUT:NAME) - Set up to search for the name as we
5123 collapse the stack*/
5124 popmark = ST.mark_name;
5126 /* (*CUT) - No name, we cut here.*/
5127 if (ST.mark_loc > startpoint)
5128 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5129 /* but we set sv_commit to latest mark_name if there
5130 is one so they can test to see how things lead to this
5133 sv_commit=mark_state->u.mark.mark_name;
5141 if ( n == (U32)what_len_TRICKYFOLD(locinput,do_utf8,ln) ) {
5143 } else if ( 0xDF == n && !do_utf8 && !UTF ) {
5146 U8 folded[UTF8_MAXBYTES_CASE+1];
5148 const char * const l = locinput;
5149 char *e = PL_regeol;
5150 to_uni_fold(n, folded, &foldlen);
5152 if (ibcmp_utf8((const char*) folded, 0, foldlen, 1,
5153 l, &e, 0, do_utf8)) {
5158 nextchr = UCHARAT(locinput);
5161 if ((n=is_LNBREAK(locinput,do_utf8))) {
5163 nextchr = UCHARAT(locinput);
5168 #define CASE_CLASS(nAmE) \
5170 if ((n=is_##nAmE(locinput,do_utf8))) { \
5172 nextchr = UCHARAT(locinput); \
5177 if ((n=is_##nAmE(locinput,do_utf8))) { \
5180 locinput += UTF8SKIP(locinput); \
5181 nextchr = UCHARAT(locinput); \
5186 CASE_CLASS(HORIZWS);
5190 PerlIO_printf(Perl_error_log, "%"UVxf" %d\n",
5191 PTR2UV(scan), OP(scan));
5192 Perl_croak(aTHX_ "regexp memory corruption");
5196 /* switch break jumps here */
5197 scan = next; /* prepare to execute the next op and ... */
5198 continue; /* ... jump back to the top, reusing st */
5202 /* push a state that backtracks on success */
5203 st->u.yes.prev_yes_state = yes_state;
5207 /* push a new regex state, then continue at scan */
5209 regmatch_state *newst;
5212 regmatch_state *cur = st;
5213 regmatch_state *curyes = yes_state;
5215 regmatch_slab *slab = PL_regmatch_slab;
5216 for (;curd > -1;cur--,curd--) {
5217 if (cur < SLAB_FIRST(slab)) {
5219 cur = SLAB_LAST(slab);
5221 PerlIO_printf(Perl_error_log, "%*s#%-3d %-10s %s\n",
5222 REPORT_CODE_OFF + 2 + depth * 2,"",
5223 curd, PL_reg_name[cur->resume_state],
5224 (curyes == cur) ? "yes" : ""
5227 curyes = cur->u.yes.prev_yes_state;
5230 DEBUG_STATE_pp("push")
5233 st->locinput = locinput;
5235 if (newst > SLAB_LAST(PL_regmatch_slab))
5236 newst = S_push_slab(aTHX);
5237 PL_regmatch_state = newst;
5239 locinput = PL_reginput;
5240 nextchr = UCHARAT(locinput);
5248 * We get here only if there's trouble -- normally "case END" is
5249 * the terminating point.
5251 Perl_croak(aTHX_ "corrupted regexp pointers");
5257 /* we have successfully completed a subexpression, but we must now
5258 * pop to the state marked by yes_state and continue from there */
5259 assert(st != yes_state);
5261 while (st != yes_state) {
5263 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5264 PL_regmatch_slab = PL_regmatch_slab->prev;
5265 st = SLAB_LAST(PL_regmatch_slab);
5269 DEBUG_STATE_pp("pop (no final)");
5271 DEBUG_STATE_pp("pop (yes)");
5277 while (yes_state < SLAB_FIRST(PL_regmatch_slab)
5278 || yes_state > SLAB_LAST(PL_regmatch_slab))
5280 /* not in this slab, pop slab */
5281 depth -= (st - SLAB_FIRST(PL_regmatch_slab) + 1);
5282 PL_regmatch_slab = PL_regmatch_slab->prev;
5283 st = SLAB_LAST(PL_regmatch_slab);
5285 depth -= (st - yes_state);
5288 yes_state = st->u.yes.prev_yes_state;
5289 PL_regmatch_state = st;
5292 locinput= st->locinput;
5293 nextchr = UCHARAT(locinput);
5295 state_num = st->resume_state + no_final;
5296 goto reenter_switch;
5299 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch successful!%s\n",
5300 PL_colors[4], PL_colors[5]));
5302 if (PL_reg_eval_set) {
5303 /* each successfully executed (?{...}) block does the equivalent of
5304 * local $^R = do {...}
5305 * When popping the save stack, all these locals would be undone;
5306 * bypass this by setting the outermost saved $^R to the latest
5308 if (oreplsv != GvSV(PL_replgv))
5309 sv_setsv(oreplsv, GvSV(PL_replgv));
5316 PerlIO_printf(Perl_debug_log,
5317 "%*s %sfailed...%s\n",
5318 REPORT_CODE_OFF+depth*2, "",
5319 PL_colors[4], PL_colors[5])
5331 /* there's a previous state to backtrack to */
5333 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5334 PL_regmatch_slab = PL_regmatch_slab->prev;
5335 st = SLAB_LAST(PL_regmatch_slab);
5337 PL_regmatch_state = st;
5338 locinput= st->locinput;
5339 nextchr = UCHARAT(locinput);
5341 DEBUG_STATE_pp("pop");
5343 if (yes_state == st)
5344 yes_state = st->u.yes.prev_yes_state;
5346 state_num = st->resume_state + 1; /* failure = success + 1 */
5347 goto reenter_switch;
5352 if (rex->intflags & PREGf_VERBARG_SEEN) {
5353 SV *sv_err = get_sv("REGERROR", 1);
5354 SV *sv_mrk = get_sv("REGMARK", 1);
5356 sv_commit = &PL_sv_no;
5358 sv_yes_mark = &PL_sv_yes;
5361 sv_commit = &PL_sv_yes;
5362 sv_yes_mark = &PL_sv_no;
5364 sv_setsv(sv_err, sv_commit);
5365 sv_setsv(sv_mrk, sv_yes_mark);
5368 /* clean up; in particular, free all slabs above current one */
5369 LEAVE_SCOPE(oldsave);
5375 - regrepeat - repeatedly match something simple, report how many
5378 * [This routine now assumes that it will only match on things of length 1.
5379 * That was true before, but now we assume scan - reginput is the count,
5380 * rather than incrementing count on every character. [Er, except utf8.]]
5383 S_regrepeat(pTHX_ const regexp *prog, const regnode *p, I32 max, int depth)
5386 register char *scan;
5388 register char *loceol = PL_regeol;
5389 register I32 hardcount = 0;
5390 register bool do_utf8 = PL_reg_match_utf8;
5392 PERL_UNUSED_ARG(depth);
5395 PERL_ARGS_ASSERT_REGREPEAT;
5398 if (max == REG_INFTY)
5400 else if (max < loceol - scan)
5401 loceol = scan + max;
5406 while (scan < loceol && hardcount < max && *scan != '\n') {
5407 scan += UTF8SKIP(scan);
5411 while (scan < loceol && *scan != '\n')
5418 while (scan < loceol && hardcount < max) {
5419 scan += UTF8SKIP(scan);
5429 case EXACT: /* length of string is 1 */
5431 while (scan < loceol && UCHARAT(scan) == c)
5434 case EXACTF: /* length of string is 1 */
5436 while (scan < loceol &&
5437 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold[c]))
5440 case EXACTFL: /* length of string is 1 */
5441 PL_reg_flags |= RF_tainted;
5443 while (scan < loceol &&
5444 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold_locale[c]))
5450 while (hardcount < max && scan < loceol &&
5451 reginclass(prog, p, (U8*)scan, 0, do_utf8)) {
5452 scan += UTF8SKIP(scan);
5456 while (scan < loceol && REGINCLASS(prog, p, (U8*)scan))
5463 LOAD_UTF8_CHARCLASS_ALNUM();
5464 while (hardcount < max && scan < loceol &&
5465 swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
5466 scan += UTF8SKIP(scan);
5470 while (scan < loceol && isALNUM(*scan))
5475 PL_reg_flags |= RF_tainted;
5478 while (hardcount < max && scan < loceol &&
5479 isALNUM_LC_utf8((U8*)scan)) {
5480 scan += UTF8SKIP(scan);
5484 while (scan < loceol && isALNUM_LC(*scan))
5491 LOAD_UTF8_CHARCLASS_ALNUM();
5492 while (hardcount < max && scan < loceol &&
5493 !swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
5494 scan += UTF8SKIP(scan);
5498 while (scan < loceol && !isALNUM(*scan))
5503 PL_reg_flags |= RF_tainted;
5506 while (hardcount < max && scan < loceol &&
5507 !isALNUM_LC_utf8((U8*)scan)) {
5508 scan += UTF8SKIP(scan);
5512 while (scan < loceol && !isALNUM_LC(*scan))
5519 LOAD_UTF8_CHARCLASS_SPACE();
5520 while (hardcount < max && scan < loceol &&
5522 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
5523 scan += UTF8SKIP(scan);
5527 while (scan < loceol && isSPACE(*scan))
5532 PL_reg_flags |= RF_tainted;
5535 while (hardcount < max && scan < loceol &&
5536 (*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
5537 scan += UTF8SKIP(scan);
5541 while (scan < loceol && isSPACE_LC(*scan))
5548 LOAD_UTF8_CHARCLASS_SPACE();
5549 while (hardcount < max && scan < loceol &&
5551 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
5552 scan += UTF8SKIP(scan);
5556 while (scan < loceol && !isSPACE(*scan))
5561 PL_reg_flags |= RF_tainted;
5564 while (hardcount < max && scan < loceol &&
5565 !(*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
5566 scan += UTF8SKIP(scan);
5570 while (scan < loceol && !isSPACE_LC(*scan))
5577 LOAD_UTF8_CHARCLASS_DIGIT();
5578 while (hardcount < max && scan < loceol &&
5579 swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
5580 scan += UTF8SKIP(scan);
5584 while (scan < loceol && isDIGIT(*scan))
5591 LOAD_UTF8_CHARCLASS_DIGIT();
5592 while (hardcount < max && scan < loceol &&
5593 !swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
5594 scan += UTF8SKIP(scan);
5598 while (scan < loceol && !isDIGIT(*scan))
5604 while (hardcount < max && scan < loceol && (c=is_LNBREAK_utf8(scan))) {
5610 LNBREAK can match two latin chars, which is ok,
5611 because we have a null terminated string, but we
5612 have to use hardcount in this situation
5614 while (scan < loceol && (c=is_LNBREAK_latin1(scan))) {
5623 while (hardcount < max && scan < loceol && (c=is_HORIZWS_utf8(scan))) {
5628 while (scan < loceol && is_HORIZWS_latin1(scan))
5635 while (hardcount < max && scan < loceol && !is_HORIZWS_utf8(scan)) {
5636 scan += UTF8SKIP(scan);
5640 while (scan < loceol && !is_HORIZWS_latin1(scan))
5648 while (hardcount < max && scan < loceol && (c=is_VERTWS_utf8(scan))) {
5653 while (scan < loceol && is_VERTWS_latin1(scan))
5661 while (hardcount < max && scan < loceol && !is_VERTWS_utf8(scan)) {
5662 scan += UTF8SKIP(scan);
5666 while (scan < loceol && !is_VERTWS_latin1(scan))
5672 default: /* Called on something of 0 width. */
5673 break; /* So match right here or not at all. */
5679 c = scan - PL_reginput;
5683 GET_RE_DEBUG_FLAGS_DECL;
5685 SV * const prop = sv_newmortal();
5686 regprop(prog, prop, p);
5687 PerlIO_printf(Perl_debug_log,
5688 "%*s %s can match %"IVdf" times out of %"IVdf"...\n",
5689 REPORT_CODE_OFF + depth*2, "", SvPVX_const(prop),(IV)c,(IV)max);
5697 #if !defined(PERL_IN_XSUB_RE) || defined(PLUGGABLE_RE_EXTENSION)
5699 - regclass_swash - prepare the utf8 swash
5703 Perl_regclass_swash(pTHX_ const regexp *prog, register const regnode* node, bool doinit, SV** listsvp, SV **altsvp)
5709 RXi_GET_DECL(prog,progi);
5710 const struct reg_data * const data = prog ? progi->data : NULL;
5712 PERL_ARGS_ASSERT_REGCLASS_SWASH;
5714 if (data && data->count) {
5715 const U32 n = ARG(node);
5717 if (data->what[n] == 's') {
5718 SV * const rv = MUTABLE_SV(data->data[n]);
5719 AV * const av = MUTABLE_AV(SvRV(rv));
5720 SV **const ary = AvARRAY(av);
5723 /* See the end of regcomp.c:S_regclass() for
5724 * documentation of these array elements. */
5727 a = SvROK(ary[1]) ? &ary[1] : NULL;
5728 b = SvTYPE(ary[2]) == SVt_PVAV ? &ary[2] : NULL;
5732 else if (si && doinit) {
5733 sw = swash_init("utf8", "", si, 1, 0);
5734 (void)av_store(av, 1, sw);
5751 - reginclass - determine if a character falls into a character class
5753 The n is the ANYOF regnode, the p is the target string, lenp
5754 is pointer to the maximum length of how far to go in the p
5755 (if the lenp is zero, UTF8SKIP(p) is used),
5756 do_utf8 tells whether the target string is in UTF-8.
5761 S_reginclass(pTHX_ const regexp *prog, register const regnode *n, register const U8* p, STRLEN* lenp, register bool do_utf8)
5764 const char flags = ANYOF_FLAGS(n);
5770 PERL_ARGS_ASSERT_REGINCLASS;
5772 if (do_utf8 && !UTF8_IS_INVARIANT(c)) {
5773 c = utf8n_to_uvchr(p, UTF8_MAXBYTES, &len,
5774 (UTF8_ALLOW_DEFAULT & UTF8_ALLOW_ANYUV) | UTF8_CHECK_ONLY);
5775 /* see [perl #37836] for UTF8_ALLOW_ANYUV */
5776 if (len == (STRLEN)-1)
5777 Perl_croak(aTHX_ "Malformed UTF-8 character (fatal)");
5780 plen = lenp ? *lenp : UNISKIP(NATIVE_TO_UNI(c));
5781 if (do_utf8 || (flags & ANYOF_UNICODE)) {
5784 if (do_utf8 && !ANYOF_RUNTIME(n)) {
5785 if (len != (STRLEN)-1 && c < 256 && ANYOF_BITMAP_TEST(n, c))
5788 if (!match && do_utf8 && (flags & ANYOF_UNICODE_ALL) && c >= 256)
5792 SV * const sw = regclass_swash(prog, n, TRUE, 0, (SV**)&av);
5800 utf8_p = bytes_to_utf8(p, &len);
5802 if (swash_fetch(sw, utf8_p, 1))
5804 else if (flags & ANYOF_FOLD) {
5805 if (!match && lenp && av) {
5807 for (i = 0; i <= av_len(av); i++) {
5808 SV* const sv = *av_fetch(av, i, FALSE);
5810 const char * const s = SvPV_const(sv, len);
5811 if (len <= plen && memEQ(s, (char*)utf8_p, len)) {
5819 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
5822 to_utf8_fold(utf8_p, tmpbuf, &tmplen);
5823 if (swash_fetch(sw, tmpbuf, 1))
5828 /* If we allocated a string above, free it */
5829 if (! do_utf8) Safefree(utf8_p);
5832 if (match && lenp && *lenp == 0)
5833 *lenp = UNISKIP(NATIVE_TO_UNI(c));
5835 if (!match && c < 256) {
5836 if (ANYOF_BITMAP_TEST(n, c))
5838 else if (flags & ANYOF_FOLD) {
5841 if (flags & ANYOF_LOCALE) {
5842 PL_reg_flags |= RF_tainted;
5843 f = PL_fold_locale[c];
5847 if (f != c && ANYOF_BITMAP_TEST(n, f))
5851 if (!match && (flags & ANYOF_CLASS)) {
5852 PL_reg_flags |= RF_tainted;
5854 (ANYOF_CLASS_TEST(n, ANYOF_ALNUM) && isALNUM_LC(c)) ||
5855 (ANYOF_CLASS_TEST(n, ANYOF_NALNUM) && !isALNUM_LC(c)) ||
5856 (ANYOF_CLASS_TEST(n, ANYOF_SPACE) && isSPACE_LC(c)) ||
5857 (ANYOF_CLASS_TEST(n, ANYOF_NSPACE) && !isSPACE_LC(c)) ||
5858 (ANYOF_CLASS_TEST(n, ANYOF_DIGIT) && isDIGIT_LC(c)) ||
5859 (ANYOF_CLASS_TEST(n, ANYOF_NDIGIT) && !isDIGIT_LC(c)) ||
5860 (ANYOF_CLASS_TEST(n, ANYOF_ALNUMC) && isALNUMC_LC(c)) ||
5861 (ANYOF_CLASS_TEST(n, ANYOF_NALNUMC) && !isALNUMC_LC(c)) ||
5862 (ANYOF_CLASS_TEST(n, ANYOF_ALPHA) && isALPHA_LC(c)) ||
5863 (ANYOF_CLASS_TEST(n, ANYOF_NALPHA) && !isALPHA_LC(c)) ||
5864 (ANYOF_CLASS_TEST(n, ANYOF_ASCII) && isASCII(c)) ||
5865 (ANYOF_CLASS_TEST(n, ANYOF_NASCII) && !isASCII(c)) ||
5866 (ANYOF_CLASS_TEST(n, ANYOF_CNTRL) && isCNTRL_LC(c)) ||
5867 (ANYOF_CLASS_TEST(n, ANYOF_NCNTRL) && !isCNTRL_LC(c)) ||
5868 (ANYOF_CLASS_TEST(n, ANYOF_GRAPH) && isGRAPH_LC(c)) ||
5869 (ANYOF_CLASS_TEST(n, ANYOF_NGRAPH) && !isGRAPH_LC(c)) ||
5870 (ANYOF_CLASS_TEST(n, ANYOF_LOWER) && isLOWER_LC(c)) ||
5871 (ANYOF_CLASS_TEST(n, ANYOF_NLOWER) && !isLOWER_LC(c)) ||
5872 (ANYOF_CLASS_TEST(n, ANYOF_PRINT) && isPRINT_LC(c)) ||
5873 (ANYOF_CLASS_TEST(n, ANYOF_NPRINT) && !isPRINT_LC(c)) ||
5874 (ANYOF_CLASS_TEST(n, ANYOF_PUNCT) && isPUNCT_LC(c)) ||
5875 (ANYOF_CLASS_TEST(n, ANYOF_NPUNCT) && !isPUNCT_LC(c)) ||
5876 (ANYOF_CLASS_TEST(n, ANYOF_UPPER) && isUPPER_LC(c)) ||
5877 (ANYOF_CLASS_TEST(n, ANYOF_NUPPER) && !isUPPER_LC(c)) ||
5878 (ANYOF_CLASS_TEST(n, ANYOF_XDIGIT) && isXDIGIT(c)) ||
5879 (ANYOF_CLASS_TEST(n, ANYOF_NXDIGIT) && !isXDIGIT(c)) ||
5880 (ANYOF_CLASS_TEST(n, ANYOF_PSXSPC) && isPSXSPC(c)) ||
5881 (ANYOF_CLASS_TEST(n, ANYOF_NPSXSPC) && !isPSXSPC(c)) ||
5882 (ANYOF_CLASS_TEST(n, ANYOF_BLANK) && isBLANK(c)) ||
5883 (ANYOF_CLASS_TEST(n, ANYOF_NBLANK) && !isBLANK(c))
5884 ) /* How's that for a conditional? */
5891 return (flags & ANYOF_INVERT) ? !match : match;
5895 S_reghop3(U8 *s, I32 off, const U8* lim)
5899 PERL_ARGS_ASSERT_REGHOP3;
5902 while (off-- && s < lim) {
5903 /* XXX could check well-formedness here */
5908 while (off++ && s > lim) {
5910 if (UTF8_IS_CONTINUED(*s)) {
5911 while (s > lim && UTF8_IS_CONTINUATION(*s))
5914 /* XXX could check well-formedness here */
5921 /* there are a bunch of places where we use two reghop3's that should
5922 be replaced with this routine. but since thats not done yet
5923 we ifdef it out - dmq
5926 S_reghop4(U8 *s, I32 off, const U8* llim, const U8* rlim)
5930 PERL_ARGS_ASSERT_REGHOP4;
5933 while (off-- && s < rlim) {
5934 /* XXX could check well-formedness here */
5939 while (off++ && s > llim) {
5941 if (UTF8_IS_CONTINUED(*s)) {
5942 while (s > llim && UTF8_IS_CONTINUATION(*s))
5945 /* XXX could check well-formedness here */
5953 S_reghopmaybe3(U8* s, I32 off, const U8* lim)
5957 PERL_ARGS_ASSERT_REGHOPMAYBE3;
5960 while (off-- && s < lim) {
5961 /* XXX could check well-formedness here */
5968 while (off++ && s > lim) {
5970 if (UTF8_IS_CONTINUED(*s)) {
5971 while (s > lim && UTF8_IS_CONTINUATION(*s))
5974 /* XXX could check well-formedness here */
5983 restore_pos(pTHX_ void *arg)
5986 regexp * const rex = (regexp *)arg;
5987 if (PL_reg_eval_set) {
5988 if (PL_reg_oldsaved) {
5989 rex->subbeg = PL_reg_oldsaved;
5990 rex->sublen = PL_reg_oldsavedlen;
5991 #ifdef PERL_OLD_COPY_ON_WRITE
5992 rex->saved_copy = PL_nrs;
5994 RXp_MATCH_COPIED_on(rex);
5996 PL_reg_magic->mg_len = PL_reg_oldpos;
5997 PL_reg_eval_set = 0;
5998 PL_curpm = PL_reg_oldcurpm;
6003 S_to_utf8_substr(pTHX_ register regexp *prog)
6007 PERL_ARGS_ASSERT_TO_UTF8_SUBSTR;
6010 if (prog->substrs->data[i].substr
6011 && !prog->substrs->data[i].utf8_substr) {
6012 SV* const sv = newSVsv(prog->substrs->data[i].substr);
6013 prog->substrs->data[i].utf8_substr = sv;
6014 sv_utf8_upgrade(sv);
6015 if (SvVALID(prog->substrs->data[i].substr)) {
6016 const U8 flags = BmFLAGS(prog->substrs->data[i].substr);
6017 if (flags & FBMcf_TAIL) {
6018 /* Trim the trailing \n that fbm_compile added last
6020 SvCUR_set(sv, SvCUR(sv) - 1);
6021 /* Whilst this makes the SV technically "invalid" (as its
6022 buffer is no longer followed by "\0") when fbm_compile()
6023 adds the "\n" back, a "\0" is restored. */
6025 fbm_compile(sv, flags);
6027 if (prog->substrs->data[i].substr == prog->check_substr)
6028 prog->check_utf8 = sv;
6034 S_to_byte_substr(pTHX_ register regexp *prog)
6039 PERL_ARGS_ASSERT_TO_BYTE_SUBSTR;
6042 if (prog->substrs->data[i].utf8_substr
6043 && !prog->substrs->data[i].substr) {
6044 SV* sv = newSVsv(prog->substrs->data[i].utf8_substr);
6045 if (sv_utf8_downgrade(sv, TRUE)) {
6046 if (SvVALID(prog->substrs->data[i].utf8_substr)) {
6048 = BmFLAGS(prog->substrs->data[i].utf8_substr);
6049 if (flags & FBMcf_TAIL) {
6050 /* Trim the trailing \n that fbm_compile added last
6052 SvCUR_set(sv, SvCUR(sv) - 1);
6054 fbm_compile(sv, flags);
6060 prog->substrs->data[i].substr = sv;
6061 if (prog->substrs->data[i].utf8_substr == prog->check_utf8)
6062 prog->check_substr = sv;
6069 * c-indentation-style: bsd
6071 * indent-tabs-mode: t
6074 * ex: set ts=8 sts=4 sw=4 noet: