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 */
1825 if (flags & REXEC_IGNOREPOS) /* Means: check only at start */
1826 reginfo.ganch = startpos + prog->gofs;
1827 else if (sv && SvTYPE(sv) >= SVt_PVMG
1829 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
1830 && mg->mg_len >= 0) {
1831 reginfo.ganch = strbeg + mg->mg_len; /* Defined pos() */
1832 if (prog->extflags & RXf_ANCH_GPOS) {
1833 if (s > reginfo.ganch)
1835 s = reginfo.ganch - prog->gofs;
1839 reginfo.ganch = strbeg + PTR2UV(data);
1840 } else /* pos() not defined */
1841 reginfo.ganch = strbeg;
1843 if (PL_curpm && (PM_GETRE(PL_curpm) == rx)) {
1844 /* We have to be careful. If the previous successful match
1845 was from this regex we don't want a subsequent partially
1846 successful match to clobber the old results.
1847 So when we detect this possibility we add a swap buffer
1848 to the re, and switch the buffer each match. If we fail
1849 we switch it back, otherwise we leave it swapped.
1852 /* do we need a save destructor here for eval dies? */
1853 Newxz(prog->offs, (prog->nparens + 1), regexp_paren_pair);
1855 if (!(flags & REXEC_CHECKED) && (prog->check_substr != NULL || prog->check_utf8 != NULL)) {
1856 re_scream_pos_data d;
1858 d.scream_olds = &scream_olds;
1859 d.scream_pos = &scream_pos;
1860 s = re_intuit_start(rx, sv, s, strend, flags, &d);
1862 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Not present...\n"));
1863 goto phooey; /* not present */
1869 /* Simplest case: anchored match need be tried only once. */
1870 /* [unless only anchor is BOL and multiline is set] */
1871 if (prog->extflags & (RXf_ANCH & ~RXf_ANCH_GPOS)) {
1872 if (s == startpos && regtry(®info, &startpos))
1874 else if (multiline || (prog->intflags & PREGf_IMPLICIT)
1875 || (prog->extflags & RXf_ANCH_MBOL)) /* XXXX SBOL? */
1880 dontbother = minlen - 1;
1881 end = HOP3c(strend, -dontbother, strbeg) - 1;
1882 /* for multiline we only have to try after newlines */
1883 if (prog->check_substr || prog->check_utf8) {
1887 if (regtry(®info, &s))
1892 if (prog->extflags & RXf_USE_INTUIT) {
1893 s = re_intuit_start(rx, sv, s + 1, strend, flags, NULL);
1904 if (*s++ == '\n') { /* don't need PL_utf8skip here */
1905 if (regtry(®info, &s))
1912 } else if (RXf_GPOS_CHECK == (prog->extflags & RXf_GPOS_CHECK))
1914 /* the warning about reginfo.ganch being used without intialization
1915 is bogus -- we set it above, when prog->extflags & RXf_GPOS_SEEN
1916 and we only enter this block when the same bit is set. */
1917 char *tmp_s = reginfo.ganch - prog->gofs;
1918 if (regtry(®info, &tmp_s))
1923 /* Messy cases: unanchored match. */
1924 if ((prog->anchored_substr || prog->anchored_utf8) && prog->intflags & PREGf_SKIP) {
1925 /* we have /x+whatever/ */
1926 /* it must be a one character string (XXXX Except UTF?) */
1931 if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr))
1932 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1933 ch = SvPVX_const(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr)[0];
1938 DEBUG_EXECUTE_r( did_match = 1 );
1939 if (regtry(®info, &s)) goto got_it;
1941 while (s < strend && *s == ch)
1949 DEBUG_EXECUTE_r( did_match = 1 );
1950 if (regtry(®info, &s)) goto got_it;
1952 while (s < strend && *s == ch)
1957 DEBUG_EXECUTE_r(if (!did_match)
1958 PerlIO_printf(Perl_debug_log,
1959 "Did not find anchored character...\n")
1962 else if (prog->anchored_substr != NULL
1963 || prog->anchored_utf8 != NULL
1964 || ((prog->float_substr != NULL || prog->float_utf8 != NULL)
1965 && prog->float_max_offset < strend - s)) {
1970 char *last1; /* Last position checked before */
1974 if (prog->anchored_substr || prog->anchored_utf8) {
1975 if (!(do_utf8 ? prog->anchored_utf8 : prog->anchored_substr))
1976 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1977 must = do_utf8 ? prog->anchored_utf8 : prog->anchored_substr;
1978 back_max = back_min = prog->anchored_offset;
1980 if (!(do_utf8 ? prog->float_utf8 : prog->float_substr))
1981 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
1982 must = do_utf8 ? prog->float_utf8 : prog->float_substr;
1983 back_max = prog->float_max_offset;
1984 back_min = prog->float_min_offset;
1988 if (must == &PL_sv_undef)
1989 /* could not downgrade utf8 check substring, so must fail */
1995 last = HOP3c(strend, /* Cannot start after this */
1996 -(I32)(CHR_SVLEN(must)
1997 - (SvTAIL(must) != 0) + back_min), strbeg);
2000 last1 = HOPc(s, -1);
2002 last1 = s - 1; /* bogus */
2004 /* XXXX check_substr already used to find "s", can optimize if
2005 check_substr==must. */
2007 dontbother = end_shift;
2008 strend = HOPc(strend, -dontbother);
2009 while ( (s <= last) &&
2010 ((flags & REXEC_SCREAM)
2011 ? (s = screaminstr(sv, must, HOP3c(s, back_min, (back_min<0 ? strbeg : strend)) - strbeg,
2012 end_shift, &scream_pos, 0))
2013 : (s = fbm_instr((unsigned char*)HOP3(s, back_min, (back_min<0 ? strbeg : strend)),
2014 (unsigned char*)strend, must,
2015 multiline ? FBMrf_MULTILINE : 0))) ) {
2016 /* we may be pointing at the wrong string */
2017 if ((flags & REXEC_SCREAM) && RXp_MATCH_COPIED(prog))
2018 s = strbeg + (s - SvPVX_const(sv));
2019 DEBUG_EXECUTE_r( did_match = 1 );
2020 if (HOPc(s, -back_max) > last1) {
2021 last1 = HOPc(s, -back_min);
2022 s = HOPc(s, -back_max);
2025 char * const t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1;
2027 last1 = HOPc(s, -back_min);
2031 while (s <= last1) {
2032 if (regtry(®info, &s))
2038 while (s <= last1) {
2039 if (regtry(®info, &s))
2045 DEBUG_EXECUTE_r(if (!did_match) {
2046 RE_PV_QUOTED_DECL(quoted, do_utf8, PERL_DEBUG_PAD_ZERO(0),
2047 SvPVX_const(must), RE_SV_DUMPLEN(must), 30);
2048 PerlIO_printf(Perl_debug_log, "Did not find %s substr %s%s...\n",
2049 ((must == prog->anchored_substr || must == prog->anchored_utf8)
2050 ? "anchored" : "floating"),
2051 quoted, RE_SV_TAIL(must));
2055 else if ( (c = progi->regstclass) ) {
2057 const OPCODE op = OP(progi->regstclass);
2058 /* don't bother with what can't match */
2059 if (PL_regkind[op] != EXACT && op != CANY && PL_regkind[op] != TRIE)
2060 strend = HOPc(strend, -(minlen - 1));
2063 SV * const prop = sv_newmortal();
2064 regprop(prog, prop, c);
2066 RE_PV_QUOTED_DECL(quoted,do_utf8,PERL_DEBUG_PAD_ZERO(1),
2068 PerlIO_printf(Perl_debug_log,
2069 "Matching stclass %.*s against %s (%d chars)\n",
2070 (int)SvCUR(prop), SvPVX_const(prop),
2071 quoted, (int)(strend - s));
2074 if (find_byclass(prog, c, s, strend, ®info))
2076 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass... [regexec_flags]\n"));
2080 if (prog->float_substr != NULL || prog->float_utf8 != NULL) {
2085 if (!(do_utf8 ? prog->float_utf8 : prog->float_substr))
2086 do_utf8 ? to_utf8_substr(prog) : to_byte_substr(prog);
2087 float_real = do_utf8 ? prog->float_utf8 : prog->float_substr;
2089 if (flags & REXEC_SCREAM) {
2090 last = screaminstr(sv, float_real, s - strbeg,
2091 end_shift, &scream_pos, 1); /* last one */
2093 last = scream_olds; /* Only one occurrence. */
2094 /* we may be pointing at the wrong string */
2095 else if (RXp_MATCH_COPIED(prog))
2096 s = strbeg + (s - SvPVX_const(sv));
2100 const char * const little = SvPV_const(float_real, len);
2102 if (SvTAIL(float_real)) {
2103 if (memEQ(strend - len + 1, little, len - 1))
2104 last = strend - len + 1;
2105 else if (!multiline)
2106 last = memEQ(strend - len, little, len)
2107 ? strend - len : NULL;
2113 last = rninstr(s, strend, little, little + len);
2115 last = strend; /* matching "$" */
2120 PerlIO_printf(Perl_debug_log,
2121 "%sCan't trim the tail, match fails (should not happen)%s\n",
2122 PL_colors[4], PL_colors[5]));
2123 goto phooey; /* Should not happen! */
2125 dontbother = strend - last + prog->float_min_offset;
2127 if (minlen && (dontbother < minlen))
2128 dontbother = minlen - 1;
2129 strend -= dontbother; /* this one's always in bytes! */
2130 /* We don't know much -- general case. */
2133 if (regtry(®info, &s))
2142 if (regtry(®info, &s))
2144 } while (s++ < strend);
2153 RX_MATCH_TAINTED_set(rx, PL_reg_flags & RF_tainted);
2155 if (PL_reg_eval_set)
2156 restore_pos(aTHX_ prog);
2157 if (RXp_PAREN_NAMES(prog))
2158 (void)hv_iterinit(RXp_PAREN_NAMES(prog));
2160 /* make sure $`, $&, $', and $digit will work later */
2161 if ( !(flags & REXEC_NOT_FIRST) ) {
2162 RX_MATCH_COPY_FREE(rx);
2163 if (flags & REXEC_COPY_STR) {
2164 const I32 i = PL_regeol - startpos + (stringarg - strbeg);
2165 #ifdef PERL_OLD_COPY_ON_WRITE
2167 || (SvFLAGS(sv) & CAN_COW_MASK) == CAN_COW_FLAGS)) {
2169 PerlIO_printf(Perl_debug_log,
2170 "Copy on write: regexp capture, type %d\n",
2173 prog->saved_copy = sv_setsv_cow(prog->saved_copy, sv);
2174 prog->subbeg = (char *)SvPVX_const(prog->saved_copy);
2175 assert (SvPOKp(prog->saved_copy));
2179 RX_MATCH_COPIED_on(rx);
2180 s = savepvn(strbeg, i);
2186 prog->subbeg = strbeg;
2187 prog->sublen = PL_regeol - strbeg; /* strend may have been modified */
2194 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n",
2195 PL_colors[4], PL_colors[5]));
2196 if (PL_reg_eval_set)
2197 restore_pos(aTHX_ prog);
2199 /* we failed :-( roll it back */
2200 Safefree(prog->offs);
2209 - regtry - try match at specific point
2211 STATIC I32 /* 0 failure, 1 success */
2212 S_regtry(pTHX_ regmatch_info *reginfo, char **startpos)
2216 REGEXP *const rx = reginfo->prog;
2217 regexp *const prog = (struct regexp *)SvANY(rx);
2218 RXi_GET_DECL(prog,progi);
2219 GET_RE_DEBUG_FLAGS_DECL;
2221 PERL_ARGS_ASSERT_REGTRY;
2223 reginfo->cutpoint=NULL;
2225 if ((prog->extflags & RXf_EVAL_SEEN) && !PL_reg_eval_set) {
2228 PL_reg_eval_set = RS_init;
2229 DEBUG_EXECUTE_r(DEBUG_s(
2230 PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n",
2231 (IV)(PL_stack_sp - PL_stack_base));
2234 cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base;
2235 /* Otherwise OP_NEXTSTATE will free whatever on stack now. */
2237 /* Apparently this is not needed, judging by wantarray. */
2238 /* SAVEI8(cxstack[cxstack_ix].blk_gimme);
2239 cxstack[cxstack_ix].blk_gimme = G_SCALAR; */
2242 /* Make $_ available to executed code. */
2243 if (reginfo->sv != DEFSV) {
2245 DEFSV_set(reginfo->sv);
2248 if (!(SvTYPE(reginfo->sv) >= SVt_PVMG && SvMAGIC(reginfo->sv)
2249 && (mg = mg_find(reginfo->sv, PERL_MAGIC_regex_global)))) {
2250 /* prepare for quick setting of pos */
2251 #ifdef PERL_OLD_COPY_ON_WRITE
2252 if (SvIsCOW(reginfo->sv))
2253 sv_force_normal_flags(reginfo->sv, 0);
2255 mg = sv_magicext(reginfo->sv, NULL, PERL_MAGIC_regex_global,
2256 &PL_vtbl_mglob, NULL, 0);
2260 PL_reg_oldpos = mg->mg_len;
2261 SAVEDESTRUCTOR_X(restore_pos, prog);
2263 if (!PL_reg_curpm) {
2264 Newxz(PL_reg_curpm, 1, PMOP);
2267 SV* const repointer = &PL_sv_undef;
2268 /* this regexp is also owned by the new PL_reg_curpm, which
2269 will try to free it. */
2270 av_push(PL_regex_padav, repointer);
2271 PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav);
2272 PL_regex_pad = AvARRAY(PL_regex_padav);
2277 /* It seems that non-ithreads works both with and without this code.
2278 So for efficiency reasons it seems best not to have the code
2279 compiled when it is not needed. */
2280 /* This is safe against NULLs: */
2281 ReREFCNT_dec(PM_GETRE(PL_reg_curpm));
2282 /* PM_reg_curpm owns a reference to this regexp. */
2285 PM_SETRE(PL_reg_curpm, rx);
2286 PL_reg_oldcurpm = PL_curpm;
2287 PL_curpm = PL_reg_curpm;
2288 if (RXp_MATCH_COPIED(prog)) {
2289 /* Here is a serious problem: we cannot rewrite subbeg,
2290 since it may be needed if this match fails. Thus
2291 $` inside (?{}) could fail... */
2292 PL_reg_oldsaved = prog->subbeg;
2293 PL_reg_oldsavedlen = prog->sublen;
2294 #ifdef PERL_OLD_COPY_ON_WRITE
2295 PL_nrs = prog->saved_copy;
2297 RXp_MATCH_COPIED_off(prog);
2300 PL_reg_oldsaved = NULL;
2301 prog->subbeg = PL_bostr;
2302 prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */
2304 DEBUG_EXECUTE_r(PL_reg_starttry = *startpos);
2305 prog->offs[0].start = *startpos - PL_bostr;
2306 PL_reginput = *startpos;
2307 PL_reglastparen = &prog->lastparen;
2308 PL_reglastcloseparen = &prog->lastcloseparen;
2309 prog->lastparen = 0;
2310 prog->lastcloseparen = 0;
2312 PL_regoffs = prog->offs;
2313 if (PL_reg_start_tmpl <= prog->nparens) {
2314 PL_reg_start_tmpl = prog->nparens*3/2 + 3;
2315 if(PL_reg_start_tmp)
2316 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2318 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
2321 /* XXXX What this code is doing here?!!! There should be no need
2322 to do this again and again, PL_reglastparen should take care of
2325 /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code.
2326 * Actually, the code in regcppop() (which Ilya may be meaning by
2327 * PL_reglastparen), is not needed at all by the test suite
2328 * (op/regexp, op/pat, op/split), but that code is needed otherwise
2329 * this erroneously leaves $1 defined: "1" =~ /^(?:(\d)x)?\d$/
2330 * Meanwhile, this code *is* needed for the
2331 * above-mentioned test suite tests to succeed. The common theme
2332 * on those tests seems to be returning null fields from matches.
2333 * --jhi updated by dapm */
2335 if (prog->nparens) {
2336 regexp_paren_pair *pp = PL_regoffs;
2338 for (i = prog->nparens; i > (I32)*PL_reglastparen; i--) {
2346 if (regmatch(reginfo, progi->program + 1)) {
2347 PL_regoffs[0].end = PL_reginput - PL_bostr;
2350 if (reginfo->cutpoint)
2351 *startpos= reginfo->cutpoint;
2352 REGCP_UNWIND(lastcp);
2357 #define sayYES goto yes
2358 #define sayNO goto no
2359 #define sayNO_SILENT goto no_silent
2361 /* we dont use STMT_START/END here because it leads to
2362 "unreachable code" warnings, which are bogus, but distracting. */
2363 #define CACHEsayNO \
2364 if (ST.cache_mask) \
2365 PL_reg_poscache[ST.cache_offset] |= ST.cache_mask; \
2368 /* this is used to determine how far from the left messages like
2369 'failed...' are printed. It should be set such that messages
2370 are inline with the regop output that created them.
2372 #define REPORT_CODE_OFF 32
2375 /* Make sure there is a test for this +1 options in re_tests */
2376 #define TRIE_INITAL_ACCEPT_BUFFLEN 4;
2378 #define CHRTEST_UNINIT -1001 /* c1/c2 haven't been calculated yet */
2379 #define CHRTEST_VOID -1000 /* the c1/c2 "next char" test should be skipped */
2381 #define SLAB_FIRST(s) (&(s)->states[0])
2382 #define SLAB_LAST(s) (&(s)->states[PERL_REGMATCH_SLAB_SLOTS-1])
2384 /* grab a new slab and return the first slot in it */
2386 STATIC regmatch_state *
2389 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2392 regmatch_slab *s = PL_regmatch_slab->next;
2394 Newx(s, 1, regmatch_slab);
2395 s->prev = PL_regmatch_slab;
2397 PL_regmatch_slab->next = s;
2399 PL_regmatch_slab = s;
2400 return SLAB_FIRST(s);
2404 /* push a new state then goto it */
2406 #define PUSH_STATE_GOTO(state, node) \
2408 st->resume_state = state; \
2411 /* push a new state with success backtracking, then goto it */
2413 #define PUSH_YES_STATE_GOTO(state, node) \
2415 st->resume_state = state; \
2416 goto push_yes_state;
2422 regmatch() - main matching routine
2424 This is basically one big switch statement in a loop. We execute an op,
2425 set 'next' to point the next op, and continue. If we come to a point which
2426 we may need to backtrack to on failure such as (A|B|C), we push a
2427 backtrack state onto the backtrack stack. On failure, we pop the top
2428 state, and re-enter the loop at the state indicated. If there are no more
2429 states to pop, we return failure.
2431 Sometimes we also need to backtrack on success; for example /A+/, where
2432 after successfully matching one A, we need to go back and try to
2433 match another one; similarly for lookahead assertions: if the assertion
2434 completes successfully, we backtrack to the state just before the assertion
2435 and then carry on. In these cases, the pushed state is marked as
2436 'backtrack on success too'. This marking is in fact done by a chain of
2437 pointers, each pointing to the previous 'yes' state. On success, we pop to
2438 the nearest yes state, discarding any intermediate failure-only states.
2439 Sometimes a yes state is pushed just to force some cleanup code to be
2440 called at the end of a successful match or submatch; e.g. (??{$re}) uses
2441 it to free the inner regex.
2443 Note that failure backtracking rewinds the cursor position, while
2444 success backtracking leaves it alone.
2446 A pattern is complete when the END op is executed, while a subpattern
2447 such as (?=foo) is complete when the SUCCESS op is executed. Both of these
2448 ops trigger the "pop to last yes state if any, otherwise return true"
2451 A common convention in this function is to use A and B to refer to the two
2452 subpatterns (or to the first nodes thereof) in patterns like /A*B/: so A is
2453 the subpattern to be matched possibly multiple times, while B is the entire
2454 rest of the pattern. Variable and state names reflect this convention.
2456 The states in the main switch are the union of ops and failure/success of
2457 substates associated with with that op. For example, IFMATCH is the op
2458 that does lookahead assertions /(?=A)B/ and so the IFMATCH state means
2459 'execute IFMATCH'; while IFMATCH_A is a state saying that we have just
2460 successfully matched A and IFMATCH_A_fail is a state saying that we have
2461 just failed to match A. Resume states always come in pairs. The backtrack
2462 state we push is marked as 'IFMATCH_A', but when that is popped, we resume
2463 at IFMATCH_A or IFMATCH_A_fail, depending on whether we are backtracking
2464 on success or failure.
2466 The struct that holds a backtracking state is actually a big union, with
2467 one variant for each major type of op. The variable st points to the
2468 top-most backtrack struct. To make the code clearer, within each
2469 block of code we #define ST to alias the relevant union.
2471 Here's a concrete example of a (vastly oversimplified) IFMATCH
2477 #define ST st->u.ifmatch
2479 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2480 ST.foo = ...; // some state we wish to save
2482 // push a yes backtrack state with a resume value of
2483 // IFMATCH_A/IFMATCH_A_fail, then continue execution at the
2485 PUSH_YES_STATE_GOTO(IFMATCH_A, A);
2488 case IFMATCH_A: // we have successfully executed A; now continue with B
2490 bar = ST.foo; // do something with the preserved value
2493 case IFMATCH_A_fail: // A failed, so the assertion failed
2494 ...; // do some housekeeping, then ...
2495 sayNO; // propagate the failure
2502 For any old-timers reading this who are familiar with the old recursive
2503 approach, the code above is equivalent to:
2505 case IFMATCH: // we are executing the IFMATCH op, (?=A)B
2514 ...; // do some housekeeping, then ...
2515 sayNO; // propagate the failure
2518 The topmost backtrack state, pointed to by st, is usually free. If you
2519 want to claim it, populate any ST.foo fields in it with values you wish to
2520 save, then do one of
2522 PUSH_STATE_GOTO(resume_state, node);
2523 PUSH_YES_STATE_GOTO(resume_state, node);
2525 which sets that backtrack state's resume value to 'resume_state', pushes a
2526 new free entry to the top of the backtrack stack, then goes to 'node'.
2527 On backtracking, the free slot is popped, and the saved state becomes the
2528 new free state. An ST.foo field in this new top state can be temporarily
2529 accessed to retrieve values, but once the main loop is re-entered, it
2530 becomes available for reuse.
2532 Note that the depth of the backtrack stack constantly increases during the
2533 left-to-right execution of the pattern, rather than going up and down with
2534 the pattern nesting. For example the stack is at its maximum at Z at the
2535 end of the pattern, rather than at X in the following:
2537 /(((X)+)+)+....(Y)+....Z/
2539 The only exceptions to this are lookahead/behind assertions and the cut,
2540 (?>A), which pop all the backtrack states associated with A before
2543 Bascktrack state structs are allocated in slabs of about 4K in size.
2544 PL_regmatch_state and st always point to the currently active state,
2545 and PL_regmatch_slab points to the slab currently containing
2546 PL_regmatch_state. The first time regmatch() is called, the first slab is
2547 allocated, and is never freed until interpreter destruction. When the slab
2548 is full, a new one is allocated and chained to the end. At exit from
2549 regmatch(), slabs allocated since entry are freed.
2554 #define DEBUG_STATE_pp(pp) \
2556 DUMP_EXEC_POS(locinput, scan, do_utf8); \
2557 PerlIO_printf(Perl_debug_log, \
2558 " %*s"pp" %s%s%s%s%s\n", \
2560 PL_reg_name[st->resume_state], \
2561 ((st==yes_state||st==mark_state) ? "[" : ""), \
2562 ((st==yes_state) ? "Y" : ""), \
2563 ((st==mark_state) ? "M" : ""), \
2564 ((st==yes_state||st==mark_state) ? "]" : "") \
2569 #define REG_NODE_NUM(x) ((x) ? (int)((x)-prog) : -1)
2574 S_debug_start_match(pTHX_ const REGEXP *prog, const bool do_utf8,
2575 const char *start, const char *end, const char *blurb)
2577 const bool utf8_pat = RX_UTF8(prog) ? 1 : 0;
2579 PERL_ARGS_ASSERT_DEBUG_START_MATCH;
2584 RE_PV_QUOTED_DECL(s0, utf8_pat, PERL_DEBUG_PAD_ZERO(0),
2585 RX_PRECOMP_const(prog), RX_PRELEN(prog), 60);
2587 RE_PV_QUOTED_DECL(s1, do_utf8, PERL_DEBUG_PAD_ZERO(1),
2588 start, end - start, 60);
2590 PerlIO_printf(Perl_debug_log,
2591 "%s%s REx%s %s against %s\n",
2592 PL_colors[4], blurb, PL_colors[5], s0, s1);
2594 if (do_utf8||utf8_pat)
2595 PerlIO_printf(Perl_debug_log, "UTF-8 %s%s%s...\n",
2596 utf8_pat ? "pattern" : "",
2597 utf8_pat && do_utf8 ? " and " : "",
2598 do_utf8 ? "string" : ""
2604 S_dump_exec_pos(pTHX_ const char *locinput,
2605 const regnode *scan,
2606 const char *loc_regeol,
2607 const char *loc_bostr,
2608 const char *loc_reg_starttry,
2611 const int docolor = *PL_colors[0] || *PL_colors[2] || *PL_colors[4];
2612 const int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */
2613 int l = (loc_regeol - locinput) > taill ? taill : (loc_regeol - locinput);
2614 /* The part of the string before starttry has one color
2615 (pref0_len chars), between starttry and current
2616 position another one (pref_len - pref0_len chars),
2617 after the current position the third one.
2618 We assume that pref0_len <= pref_len, otherwise we
2619 decrease pref0_len. */
2620 int pref_len = (locinput - loc_bostr) > (5 + taill) - l
2621 ? (5 + taill) - l : locinput - loc_bostr;
2624 PERL_ARGS_ASSERT_DUMP_EXEC_POS;
2626 while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len)))
2628 pref0_len = pref_len - (locinput - loc_reg_starttry);
2629 if (l + pref_len < (5 + taill) && l < loc_regeol - locinput)
2630 l = ( loc_regeol - locinput > (5 + taill) - pref_len
2631 ? (5 + taill) - pref_len : loc_regeol - locinput);
2632 while (do_utf8 && UTF8_IS_CONTINUATION(*(U8*)(locinput + l)))
2636 if (pref0_len > pref_len)
2637 pref0_len = pref_len;
2639 const int is_uni = (do_utf8 && OP(scan) != CANY) ? 1 : 0;
2641 RE_PV_COLOR_DECL(s0,len0,is_uni,PERL_DEBUG_PAD(0),
2642 (locinput - pref_len),pref0_len, 60, 4, 5);
2644 RE_PV_COLOR_DECL(s1,len1,is_uni,PERL_DEBUG_PAD(1),
2645 (locinput - pref_len + pref0_len),
2646 pref_len - pref0_len, 60, 2, 3);
2648 RE_PV_COLOR_DECL(s2,len2,is_uni,PERL_DEBUG_PAD(2),
2649 locinput, loc_regeol - locinput, 10, 0, 1);
2651 const STRLEN tlen=len0+len1+len2;
2652 PerlIO_printf(Perl_debug_log,
2653 "%4"IVdf" <%.*s%.*s%s%.*s>%*s|",
2654 (IV)(locinput - loc_bostr),
2657 (docolor ? "" : "> <"),
2659 (int)(tlen > 19 ? 0 : 19 - tlen),
2666 /* reg_check_named_buff_matched()
2667 * Checks to see if a named buffer has matched. The data array of
2668 * buffer numbers corresponding to the buffer is expected to reside
2669 * in the regexp->data->data array in the slot stored in the ARG() of
2670 * node involved. Note that this routine doesn't actually care about the
2671 * name, that information is not preserved from compilation to execution.
2672 * Returns the index of the leftmost defined buffer with the given name
2673 * or 0 if non of the buffers matched.
2676 S_reg_check_named_buff_matched(pTHX_ const regexp *rex, const regnode *scan)
2679 RXi_GET_DECL(rex,rexi);
2680 SV *sv_dat= MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
2681 I32 *nums=(I32*)SvPVX(sv_dat);
2683 PERL_ARGS_ASSERT_REG_CHECK_NAMED_BUFF_MATCHED;
2685 for ( n=0; n<SvIVX(sv_dat); n++ ) {
2686 if ((I32)*PL_reglastparen >= nums[n] &&
2687 PL_regoffs[nums[n]].end != -1)
2696 /* free all slabs above current one - called during LEAVE_SCOPE */
2699 S_clear_backtrack_stack(pTHX_ void *p)
2701 regmatch_slab *s = PL_regmatch_slab->next;
2706 PL_regmatch_slab->next = NULL;
2708 regmatch_slab * const osl = s;
2715 #define SETREX(Re1,Re2) \
2716 if (PL_reg_eval_set) PM_SETRE((PL_reg_curpm), (Re2)); \
2719 STATIC I32 /* 0 failure, 1 success */
2720 S_regmatch(pTHX_ regmatch_info *reginfo, regnode *prog)
2722 #if PERL_VERSION < 9 && !defined(PERL_CORE)
2726 register const bool do_utf8 = PL_reg_match_utf8;
2727 const U32 uniflags = UTF8_ALLOW_DEFAULT;
2728 REGEXP *rex_sv = reginfo->prog;
2729 regexp *rex = (struct regexp *)SvANY(rex_sv);
2730 RXi_GET_DECL(rex,rexi);
2732 /* the current state. This is a cached copy of PL_regmatch_state */
2733 register regmatch_state *st;
2734 /* cache heavy used fields of st in registers */
2735 register regnode *scan;
2736 register regnode *next;
2737 register U32 n = 0; /* general value; init to avoid compiler warning */
2738 register I32 ln = 0; /* len or last; init to avoid compiler warning */
2739 register char *locinput = PL_reginput;
2740 register I32 nextchr; /* is always set to UCHARAT(locinput) */
2742 bool result = 0; /* return value of S_regmatch */
2743 int depth = 0; /* depth of backtrack stack */
2744 U32 nochange_depth = 0; /* depth of GOSUB recursion with nochange */
2745 const U32 max_nochange_depth =
2746 (3 * rex->nparens > MAX_RECURSE_EVAL_NOCHANGE_DEPTH) ?
2747 3 * rex->nparens : MAX_RECURSE_EVAL_NOCHANGE_DEPTH;
2748 regmatch_state *yes_state = NULL; /* state to pop to on success of
2750 /* mark_state piggy backs on the yes_state logic so that when we unwind
2751 the stack on success we can update the mark_state as we go */
2752 regmatch_state *mark_state = NULL; /* last mark state we have seen */
2753 regmatch_state *cur_eval = NULL; /* most recent EVAL_AB state */
2754 struct regmatch_state *cur_curlyx = NULL; /* most recent curlyx */
2756 bool no_final = 0; /* prevent failure from backtracking? */
2757 bool do_cutgroup = 0; /* no_final only until next branch/trie entry */
2758 char *startpoint = PL_reginput;
2759 SV *popmark = NULL; /* are we looking for a mark? */
2760 SV *sv_commit = NULL; /* last mark name seen in failure */
2761 SV *sv_yes_mark = NULL; /* last mark name we have seen
2762 during a successfull match */
2763 U32 lastopen = 0; /* last open we saw */
2764 bool has_cutgroup = RX_HAS_CUTGROUP(rex) ? 1 : 0;
2765 SV* const oreplsv = GvSV(PL_replgv);
2766 /* these three flags are set by various ops to signal information to
2767 * the very next op. They have a useful lifetime of exactly one loop
2768 * iteration, and are not preserved or restored by state pushes/pops
2770 bool sw = 0; /* the condition value in (?(cond)a|b) */
2771 bool minmod = 0; /* the next "{n,m}" is a "{n,m}?" */
2772 int logical = 0; /* the following EVAL is:
2776 or the following IFMATCH/UNLESSM is:
2777 false: plain (?=foo)
2778 true: used as a condition: (?(?=foo))
2781 GET_RE_DEBUG_FLAGS_DECL;
2784 PERL_ARGS_ASSERT_REGMATCH;
2786 DEBUG_OPTIMISE_r( DEBUG_EXECUTE_r({
2787 PerlIO_printf(Perl_debug_log,"regmatch start\n");
2789 /* on first ever call to regmatch, allocate first slab */
2790 if (!PL_regmatch_slab) {
2791 Newx(PL_regmatch_slab, 1, regmatch_slab);
2792 PL_regmatch_slab->prev = NULL;
2793 PL_regmatch_slab->next = NULL;
2794 PL_regmatch_state = SLAB_FIRST(PL_regmatch_slab);
2797 oldsave = PL_savestack_ix;
2798 SAVEDESTRUCTOR_X(S_clear_backtrack_stack, NULL);
2799 SAVEVPTR(PL_regmatch_slab);
2800 SAVEVPTR(PL_regmatch_state);
2802 /* grab next free state slot */
2803 st = ++PL_regmatch_state;
2804 if (st > SLAB_LAST(PL_regmatch_slab))
2805 st = PL_regmatch_state = S_push_slab(aTHX);
2807 /* Note that nextchr is a byte even in UTF */
2808 nextchr = UCHARAT(locinput);
2810 while (scan != NULL) {
2813 SV * const prop = sv_newmortal();
2814 regnode *rnext=regnext(scan);
2815 DUMP_EXEC_POS( locinput, scan, do_utf8 );
2816 regprop(rex, prop, scan);
2818 PerlIO_printf(Perl_debug_log,
2819 "%3"IVdf":%*s%s(%"IVdf")\n",
2820 (IV)(scan - rexi->program), depth*2, "",
2822 (PL_regkind[OP(scan)] == END || !rnext) ?
2823 0 : (IV)(rnext - rexi->program));
2826 next = scan + NEXT_OFF(scan);
2829 state_num = OP(scan);
2833 assert(PL_reglastparen == &rex->lastparen);
2834 assert(PL_reglastcloseparen == &rex->lastcloseparen);
2835 assert(PL_regoffs == rex->offs);
2837 switch (state_num) {
2839 if (locinput == PL_bostr)
2841 /* reginfo->till = reginfo->bol; */
2846 if (locinput == PL_bostr ||
2847 ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n'))
2853 if (locinput == PL_bostr)
2857 if (locinput == reginfo->ganch)
2862 /* update the startpoint */
2863 st->u.keeper.val = PL_regoffs[0].start;
2864 PL_reginput = locinput;
2865 PL_regoffs[0].start = locinput - PL_bostr;
2866 PUSH_STATE_GOTO(KEEPS_next, next);
2868 case KEEPS_next_fail:
2869 /* rollback the start point change */
2870 PL_regoffs[0].start = st->u.keeper.val;
2876 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2881 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2883 if (PL_regeol - locinput > 1)
2887 if (PL_regeol != locinput)
2891 if (!nextchr && locinput >= PL_regeol)
2894 locinput += PL_utf8skip[nextchr];
2895 if (locinput > PL_regeol)
2897 nextchr = UCHARAT(locinput);
2900 nextchr = UCHARAT(++locinput);
2903 if (!nextchr && locinput >= PL_regeol)
2905 nextchr = UCHARAT(++locinput);
2908 if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n')
2911 locinput += PL_utf8skip[nextchr];
2912 if (locinput > PL_regeol)
2914 nextchr = UCHARAT(locinput);
2917 nextchr = UCHARAT(++locinput);
2921 #define ST st->u.trie
2923 /* In this case the charclass data is available inline so
2924 we can fail fast without a lot of extra overhead.
2926 if (scan->flags == EXACT || !do_utf8) {
2927 if(!ANYOF_BITMAP_TEST(scan, *locinput)) {
2929 PerlIO_printf(Perl_debug_log,
2930 "%*s %sfailed to match trie start class...%s\n",
2931 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2940 /* what type of TRIE am I? (utf8 makes this contextual) */
2941 DECL_TRIE_TYPE(scan);
2943 /* what trie are we using right now */
2944 reg_trie_data * const trie
2945 = (reg_trie_data*)rexi->data->data[ ARG( scan ) ];
2946 HV * widecharmap = MUTABLE_HV(rexi->data->data[ ARG( scan ) + 1 ]);
2947 U32 state = trie->startstate;
2949 if (trie->bitmap && trie_type != trie_utf8_fold &&
2950 !TRIE_BITMAP_TEST(trie,*locinput)
2952 if (trie->states[ state ].wordnum) {
2954 PerlIO_printf(Perl_debug_log,
2955 "%*s %smatched empty string...%s\n",
2956 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2961 PerlIO_printf(Perl_debug_log,
2962 "%*s %sfailed to match trie start class...%s\n",
2963 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5])
2970 U8 *uc = ( U8* )locinput;
2974 U8 *uscan = (U8*)NULL;
2976 SV *sv_accept_buff = NULL;
2977 U8 foldbuf[ UTF8_MAXBYTES_CASE + 1 ];
2979 ST.accepted = 0; /* how many accepting states we have seen */
2981 ST.jump = trie->jump;
2984 traverse the TRIE keeping track of all accepting states
2985 we transition through until we get to a failing node.
2988 while ( state && uc <= (U8*)PL_regeol ) {
2989 U32 base = trie->states[ state ].trans.base;
2992 /* We use charid to hold the wordnum as we don't use it
2993 for charid until after we have done the wordnum logic.
2994 We define an alias just so that the wordnum logic reads
2997 #define got_wordnum charid
2998 got_wordnum = trie->states[ state ].wordnum;
3000 if ( got_wordnum ) {
3001 if ( ! ST.accepted ) {
3003 SAVETMPS; /* XXX is this necessary? dmq */
3004 bufflen = TRIE_INITAL_ACCEPT_BUFFLEN;
3005 sv_accept_buff=newSV(bufflen *
3006 sizeof(reg_trie_accepted) - 1);
3007 SvCUR_set(sv_accept_buff, 0);
3008 SvPOK_on(sv_accept_buff);
3009 sv_2mortal(sv_accept_buff);
3012 (reg_trie_accepted*)SvPV_nolen(sv_accept_buff );
3015 if (ST.accepted >= bufflen) {
3017 ST.accept_buff =(reg_trie_accepted*)
3018 SvGROW(sv_accept_buff,
3019 bufflen * sizeof(reg_trie_accepted));
3021 SvCUR_set(sv_accept_buff,SvCUR(sv_accept_buff)
3022 + sizeof(reg_trie_accepted));
3025 ST.accept_buff[ST.accepted].wordnum = got_wordnum;
3026 ST.accept_buff[ST.accepted].endpos = uc;
3028 } while (trie->nextword && (got_wordnum= trie->nextword[got_wordnum]));
3032 DEBUG_TRIE_EXECUTE_r({
3033 DUMP_EXEC_POS( (char *)uc, scan, do_utf8 );
3034 PerlIO_printf( Perl_debug_log,
3035 "%*s %sState: %4"UVxf" Accepted: %4"UVxf" ",
3036 2+depth * 2, "", PL_colors[4],
3037 (UV)state, (UV)ST.accepted );
3041 REXEC_TRIE_READ_CHAR(trie_type, trie, widecharmap, uc,
3042 uscan, len, uvc, charid, foldlen,
3046 (base + charid > trie->uniquecharcount )
3047 && (base + charid - 1 - trie->uniquecharcount
3049 && trie->trans[base + charid - 1 -
3050 trie->uniquecharcount].check == state)
3052 state = trie->trans[base + charid - 1 -
3053 trie->uniquecharcount ].next;
3064 DEBUG_TRIE_EXECUTE_r(
3065 PerlIO_printf( Perl_debug_log,
3066 "Charid:%3x CP:%4"UVxf" After State: %4"UVxf"%s\n",
3067 charid, uvc, (UV)state, PL_colors[5] );
3074 PerlIO_printf( Perl_debug_log,
3075 "%*s %sgot %"IVdf" possible matches%s\n",
3076 REPORT_CODE_OFF + depth * 2, "",
3077 PL_colors[4], (IV)ST.accepted, PL_colors[5] );
3080 goto trie_first_try; /* jump into the fail handler */
3082 case TRIE_next_fail: /* we failed - try next alterative */
3084 REGCP_UNWIND(ST.cp);
3085 for (n = *PL_reglastparen; n > ST.lastparen; n--)
3086 PL_regoffs[n].end = -1;
3087 *PL_reglastparen = n;
3096 ST.lastparen = *PL_reglastparen;
3099 if ( ST.accepted == 1 ) {
3100 /* only one choice left - just continue */
3102 AV *const trie_words
3103 = MUTABLE_AV(rexi->data->data[ARG(ST.me)+TRIE_WORDS_OFFSET]);
3104 SV ** const tmp = av_fetch( trie_words,
3105 ST.accept_buff[ 0 ].wordnum-1, 0 );
3106 SV *sv= tmp ? sv_newmortal() : NULL;
3108 PerlIO_printf( Perl_debug_log,
3109 "%*s %sonly one match left: #%d <%s>%s\n",
3110 REPORT_CODE_OFF+depth*2, "", PL_colors[4],
3111 ST.accept_buff[ 0 ].wordnum,
3112 tmp ? pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 0,
3113 PL_colors[0], PL_colors[1],
3114 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)
3116 : "not compiled under -Dr",
3119 PL_reginput = (char *)ST.accept_buff[ 0 ].endpos;
3120 /* in this case we free tmps/leave before we call regmatch
3121 as we wont be using accept_buff again. */
3123 locinput = PL_reginput;
3124 nextchr = UCHARAT(locinput);
3125 if ( !ST.jump || !ST.jump[ST.accept_buff[0].wordnum])
3128 scan = ST.me + ST.jump[ST.accept_buff[0].wordnum];
3129 if (!has_cutgroup) {
3134 PUSH_YES_STATE_GOTO(TRIE_next, scan);
3137 continue; /* execute rest of RE */
3140 if ( !ST.accepted-- ) {
3142 PerlIO_printf( Perl_debug_log,
3143 "%*s %sTRIE failed...%s\n",
3144 REPORT_CODE_OFF+depth*2, "",
3155 There are at least two accepting states left. Presumably
3156 the number of accepting states is going to be low,
3157 typically two. So we simply scan through to find the one
3158 with lowest wordnum. Once we find it, we swap the last
3159 state into its place and decrement the size. We then try to
3160 match the rest of the pattern at the point where the word
3161 ends. If we succeed, control just continues along the
3162 regex; if we fail we return here to try the next accepting
3169 for( cur = 1 ; cur <= ST.accepted ; cur++ ) {
3170 DEBUG_TRIE_EXECUTE_r(
3171 PerlIO_printf( Perl_debug_log,
3172 "%*s %sgot %"IVdf" (%d) as best, looking at %"IVdf" (%d)%s\n",
3173 REPORT_CODE_OFF + depth * 2, "", PL_colors[4],
3174 (IV)best, ST.accept_buff[ best ].wordnum, (IV)cur,
3175 ST.accept_buff[ cur ].wordnum, PL_colors[5] );
3178 if (ST.accept_buff[cur].wordnum <
3179 ST.accept_buff[best].wordnum)
3184 AV *const trie_words
3185 = MUTABLE_AV(rexi->data->data[ARG(ST.me)+TRIE_WORDS_OFFSET]);
3186 SV ** const tmp = av_fetch( trie_words,
3187 ST.accept_buff[ best ].wordnum - 1, 0 );
3188 regnode *nextop=(!ST.jump || !ST.jump[ST.accept_buff[best].wordnum]) ?
3190 ST.me + ST.jump[ST.accept_buff[best].wordnum];
3191 SV *sv= tmp ? sv_newmortal() : NULL;
3193 PerlIO_printf( Perl_debug_log,
3194 "%*s %strying alternation #%d <%s> at node #%d %s\n",
3195 REPORT_CODE_OFF+depth*2, "", PL_colors[4],
3196 ST.accept_buff[best].wordnum,
3197 tmp ? pv_pretty(sv, SvPV_nolen_const(*tmp), SvCUR(*tmp), 0,
3198 PL_colors[0], PL_colors[1],
3199 (SvUTF8(*tmp) ? PERL_PV_ESCAPE_UNI : 0)
3200 ) : "not compiled under -Dr",
3201 REG_NODE_NUM(nextop),
3205 if ( best<ST.accepted ) {
3206 reg_trie_accepted tmp = ST.accept_buff[ best ];
3207 ST.accept_buff[ best ] = ST.accept_buff[ ST.accepted ];
3208 ST.accept_buff[ ST.accepted ] = tmp;
3211 PL_reginput = (char *)ST.accept_buff[ best ].endpos;
3212 if ( !ST.jump || !ST.jump[ST.accept_buff[best].wordnum]) {
3215 scan = ST.me + ST.jump[ST.accept_buff[best].wordnum];
3217 PUSH_YES_STATE_GOTO(TRIE_next, scan);
3222 /* we dont want to throw this away, see bug 57042*/
3223 if (oreplsv != GvSV(PL_replgv))
3224 sv_setsv(oreplsv, GvSV(PL_replgv));
3231 char *s = STRING(scan);
3233 if (do_utf8 != UTF) {
3234 /* The target and the pattern have differing utf8ness. */
3236 const char * const e = s + ln;
3239 /* The target is utf8, the pattern is not utf8. */
3244 if (NATIVE_TO_UNI(*(U8*)s) !=
3245 utf8n_to_uvuni((U8*)l, UTF8_MAXBYTES, &ulen,
3253 /* The target is not utf8, the pattern is utf8. */
3258 if (NATIVE_TO_UNI(*((U8*)l)) !=
3259 utf8n_to_uvuni((U8*)s, UTF8_MAXBYTES, &ulen,
3267 nextchr = UCHARAT(locinput);
3270 /* The target and the pattern have the same utf8ness. */
3271 /* Inline the first character, for speed. */
3272 if (UCHARAT(s) != nextchr)
3274 if (PL_regeol - locinput < ln)
3276 if (ln > 1 && memNE(s, locinput, ln))
3279 nextchr = UCHARAT(locinput);
3283 PL_reg_flags |= RF_tainted;
3286 char * const s = STRING(scan);
3289 if (do_utf8 || UTF) {
3290 /* Either target or the pattern are utf8. */
3291 const char * const l = locinput;
3292 char *e = PL_regeol;
3294 if (ibcmp_utf8(s, 0, ln, (bool)UTF,
3295 l, &e, 0, do_utf8)) {
3296 /* One more case for the sharp s:
3297 * pack("U0U*", 0xDF) =~ /ss/i,
3298 * the 0xC3 0x9F are the UTF-8
3299 * byte sequence for the U+00DF. */
3302 toLOWER(s[0]) == 's' &&
3304 toLOWER(s[1]) == 's' &&
3311 nextchr = UCHARAT(locinput);
3315 /* Neither the target and the pattern are utf8. */
3317 /* Inline the first character, for speed. */
3318 if (UCHARAT(s) != nextchr &&
3319 UCHARAT(s) != ((OP(scan) == EXACTF)
3320 ? PL_fold : PL_fold_locale)[nextchr])
3322 if (PL_regeol - locinput < ln)
3324 if (ln > 1 && (OP(scan) == EXACTF
3325 ? ibcmp(s, locinput, ln)
3326 : ibcmp_locale(s, locinput, ln)))
3329 nextchr = UCHARAT(locinput);
3334 STRLEN inclasslen = PL_regeol - locinput;
3336 if (!reginclass(rex, scan, (U8*)locinput, &inclasslen, do_utf8))
3338 if (locinput >= PL_regeol)
3340 locinput += inclasslen ? inclasslen : UTF8SKIP(locinput);
3341 nextchr = UCHARAT(locinput);
3346 nextchr = UCHARAT(locinput);
3347 if (!REGINCLASS(rex, scan, (U8*)locinput))
3349 if (!nextchr && locinput >= PL_regeol)
3351 nextchr = UCHARAT(++locinput);
3355 /* If we might have the case of the German sharp s
3356 * in a casefolding Unicode character class. */
3358 if (ANYOF_FOLD_SHARP_S(scan, locinput, PL_regeol)) {
3359 locinput += SHARP_S_SKIP;
3360 nextchr = UCHARAT(locinput);
3366 PL_reg_flags |= RF_tainted;
3372 LOAD_UTF8_CHARCLASS_ALNUM();
3373 if (!(OP(scan) == ALNUM
3374 ? (bool)swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
3375 : isALNUM_LC_utf8((U8*)locinput)))
3379 locinput += PL_utf8skip[nextchr];
3380 nextchr = UCHARAT(locinput);
3383 if (!(OP(scan) == ALNUM
3384 ? isALNUM(nextchr) : isALNUM_LC(nextchr)))
3386 nextchr = UCHARAT(++locinput);
3389 PL_reg_flags |= RF_tainted;
3392 if (!nextchr && locinput >= PL_regeol)
3395 LOAD_UTF8_CHARCLASS_ALNUM();
3396 if (OP(scan) == NALNUM
3397 ? (bool)swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
3398 : isALNUM_LC_utf8((U8*)locinput))
3402 locinput += PL_utf8skip[nextchr];
3403 nextchr = UCHARAT(locinput);
3406 if (OP(scan) == NALNUM
3407 ? isALNUM(nextchr) : isALNUM_LC(nextchr))
3409 nextchr = UCHARAT(++locinput);
3413 PL_reg_flags |= RF_tainted;
3417 /* was last char in word? */
3419 if (locinput == PL_bostr)
3422 const U8 * const r = reghop3((U8*)locinput, -1, (U8*)PL_bostr);
3424 ln = utf8n_to_uvchr(r, UTF8SKIP(r), 0, uniflags);
3426 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3427 ln = isALNUM_uni(ln);
3428 LOAD_UTF8_CHARCLASS_ALNUM();
3429 n = swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8);
3432 ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(ln));
3433 n = isALNUM_LC_utf8((U8*)locinput);
3437 ln = (locinput != PL_bostr) ?
3438 UCHARAT(locinput - 1) : '\n';
3439 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
3441 n = isALNUM(nextchr);
3444 ln = isALNUM_LC(ln);
3445 n = isALNUM_LC(nextchr);
3448 if (((!ln) == (!n)) == (OP(scan) == BOUND ||
3449 OP(scan) == BOUNDL))
3453 PL_reg_flags |= RF_tainted;
3459 if (UTF8_IS_CONTINUED(nextchr)) {
3460 LOAD_UTF8_CHARCLASS_SPACE();
3461 if (!(OP(scan) == SPACE
3462 ? (bool)swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
3463 : isSPACE_LC_utf8((U8*)locinput)))
3467 locinput += PL_utf8skip[nextchr];
3468 nextchr = UCHARAT(locinput);
3471 if (!(OP(scan) == SPACE
3472 ? isSPACE(nextchr) : isSPACE_LC(nextchr)))
3474 nextchr = UCHARAT(++locinput);
3477 if (!(OP(scan) == SPACE
3478 ? isSPACE(nextchr) : isSPACE_LC(nextchr)))
3480 nextchr = UCHARAT(++locinput);
3484 PL_reg_flags |= RF_tainted;
3487 if (!nextchr && locinput >= PL_regeol)
3490 LOAD_UTF8_CHARCLASS_SPACE();
3491 if (OP(scan) == NSPACE
3492 ? (bool)swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
3493 : isSPACE_LC_utf8((U8*)locinput))
3497 locinput += PL_utf8skip[nextchr];
3498 nextchr = UCHARAT(locinput);
3501 if (OP(scan) == NSPACE
3502 ? isSPACE(nextchr) : isSPACE_LC(nextchr))
3504 nextchr = UCHARAT(++locinput);
3507 PL_reg_flags |= RF_tainted;
3513 LOAD_UTF8_CHARCLASS_DIGIT();
3514 if (!(OP(scan) == DIGIT
3515 ? (bool)swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
3516 : isDIGIT_LC_utf8((U8*)locinput)))
3520 locinput += PL_utf8skip[nextchr];
3521 nextchr = UCHARAT(locinput);
3524 if (!(OP(scan) == DIGIT
3525 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr)))
3527 nextchr = UCHARAT(++locinput);
3530 PL_reg_flags |= RF_tainted;
3533 if (!nextchr && locinput >= PL_regeol)
3536 LOAD_UTF8_CHARCLASS_DIGIT();
3537 if (OP(scan) == NDIGIT
3538 ? (bool)swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
3539 : isDIGIT_LC_utf8((U8*)locinput))
3543 locinput += PL_utf8skip[nextchr];
3544 nextchr = UCHARAT(locinput);
3547 if (OP(scan) == NDIGIT
3548 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr))
3550 nextchr = UCHARAT(++locinput);
3553 if (locinput >= PL_regeol)
3556 LOAD_UTF8_CHARCLASS_MARK();
3557 if (swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
3559 locinput += PL_utf8skip[nextchr];
3560 while (locinput < PL_regeol &&
3561 swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
3562 locinput += UTF8SKIP(locinput);
3563 if (locinput > PL_regeol)
3568 nextchr = UCHARAT(locinput);
3575 PL_reg_flags |= RF_tainted;
3580 n = reg_check_named_buff_matched(rex,scan);
3583 type = REF + ( type - NREF );
3590 PL_reg_flags |= RF_tainted;
3594 n = ARG(scan); /* which paren pair */
3597 ln = PL_regoffs[n].start;
3598 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
3599 if (*PL_reglastparen < n || ln == -1)
3600 sayNO; /* Do not match unless seen CLOSEn. */
3601 if (ln == PL_regoffs[n].end)
3605 if (do_utf8 && type != REF) { /* REF can do byte comparison */
3607 const char *e = PL_bostr + PL_regoffs[n].end;
3609 * Note that we can't do the "other character" lookup trick as
3610 * in the 8-bit case (no pun intended) because in Unicode we
3611 * have to map both upper and title case to lower case.
3615 STRLEN ulen1, ulen2;
3616 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
3617 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
3621 toLOWER_utf8((U8*)s, tmpbuf1, &ulen1);
3622 toLOWER_utf8((U8*)l, tmpbuf2, &ulen2);
3623 if (ulen1 != ulen2 || memNE((char *)tmpbuf1, (char *)tmpbuf2, ulen1))
3630 nextchr = UCHARAT(locinput);
3634 /* Inline the first character, for speed. */
3635 if (UCHARAT(s) != nextchr &&
3637 (UCHARAT(s) != (type == REFF
3638 ? PL_fold : PL_fold_locale)[nextchr])))
3640 ln = PL_regoffs[n].end - ln;
3641 if (locinput + ln > PL_regeol)
3643 if (ln > 1 && (type == REF
3644 ? memNE(s, locinput, ln)
3646 ? ibcmp(s, locinput, ln)
3647 : ibcmp_locale(s, locinput, ln))))
3650 nextchr = UCHARAT(locinput);
3660 #define ST st->u.eval
3665 regexp_internal *rei;
3666 regnode *startpoint;
3669 case GOSUB: /* /(...(?1))/ /(...(?&foo))/ */
3670 if (cur_eval && cur_eval->locinput==locinput) {
3671 if (cur_eval->u.eval.close_paren == (U32)ARG(scan))
3672 Perl_croak(aTHX_ "Infinite recursion in regex");
3673 if ( ++nochange_depth > max_nochange_depth )
3675 "Pattern subroutine nesting without pos change"
3676 " exceeded limit in regex");
3683 (void)ReREFCNT_inc(rex_sv);
3684 if (OP(scan)==GOSUB) {
3685 startpoint = scan + ARG2L(scan);
3686 ST.close_paren = ARG(scan);
3688 startpoint = rei->program+1;
3691 goto eval_recurse_doit;
3693 case EVAL: /* /(?{A})B/ /(??{A})B/ and /(?(?{A})X|Y)B/ */
3694 if (cur_eval && cur_eval->locinput==locinput) {
3695 if ( ++nochange_depth > max_nochange_depth )
3696 Perl_croak(aTHX_ "EVAL without pos change exceeded limit in regex");
3701 /* execute the code in the {...} */
3703 SV ** const before = SP;
3704 OP_4tree * const oop = PL_op;
3705 COP * const ocurcop = PL_curcop;
3707 char *saved_regeol = PL_regeol;
3710 PL_op = (OP_4tree*)rexi->data->data[n];
3711 DEBUG_STATE_r( PerlIO_printf(Perl_debug_log,
3712 " re_eval 0x%"UVxf"\n", PTR2UV(PL_op)) );
3713 PAD_SAVE_LOCAL(old_comppad, (PAD*)rexi->data->data[n + 2]);
3714 PL_regoffs[0].end = PL_reg_magic->mg_len = locinput - PL_bostr;
3717 SV *sv_mrk = get_sv("REGMARK", 1);
3718 sv_setsv(sv_mrk, sv_yes_mark);
3721 CALLRUNOPS(aTHX); /* Scalar context. */
3724 ret = &PL_sv_undef; /* protect against empty (?{}) blocks. */
3731 PAD_RESTORE_LOCAL(old_comppad);
3732 PL_curcop = ocurcop;
3733 PL_regeol = saved_regeol;
3736 sv_setsv(save_scalar(PL_replgv), ret);
3740 if (logical == 2) { /* Postponed subexpression: /(??{...})/ */
3743 /* extract RE object from returned value; compiling if
3749 SV *const sv = SvRV(ret);
3751 if (SvTYPE(sv) == SVt_REGEXP) {
3753 } else if (SvSMAGICAL(sv)) {
3754 mg = mg_find(sv, PERL_MAGIC_qr);
3757 } else if (SvTYPE(ret) == SVt_REGEXP) {
3759 } else if (SvSMAGICAL(ret)) {
3760 if (SvGMAGICAL(ret)) {
3761 /* I don't believe that there is ever qr magic
3763 assert(!mg_find(ret, PERL_MAGIC_qr));
3764 sv_unmagic(ret, PERL_MAGIC_qr);
3767 mg = mg_find(ret, PERL_MAGIC_qr);
3768 /* testing suggests mg only ends up non-NULL for
3769 scalars who were upgraded and compiled in the
3770 else block below. In turn, this is only
3771 triggered in the "postponed utf8 string" tests
3777 rx = (REGEXP *) mg->mg_obj; /*XXX:dmq*/
3781 rx = reg_temp_copy(rx);
3785 const I32 osize = PL_regsize;
3788 assert (SvUTF8(ret));
3789 } else if (SvUTF8(ret)) {
3790 /* Not doing UTF-8, despite what the SV says. Is
3791 this only if we're trapped in use 'bytes'? */
3792 /* Make a copy of the octet sequence, but without
3793 the flag on, as the compiler now honours the
3794 SvUTF8 flag on ret. */
3796 const char *const p = SvPV(ret, len);
3797 ret = newSVpvn_flags(p, len, SVs_TEMP);
3799 rx = CALLREGCOMP(ret, pm_flags);
3801 & (SVs_TEMP | SVs_PADTMP | SVf_READONLY
3803 /* This isn't a first class regexp. Instead, it's
3804 caching a regexp onto an existing, Perl visible
3806 sv_magic(ret, MUTABLE_SV(rx), PERL_MAGIC_qr, 0, 0);
3811 re = (struct regexp *)SvANY(rx);
3813 RXp_MATCH_COPIED_off(re);
3814 re->subbeg = rex->subbeg;
3815 re->sublen = rex->sublen;
3818 debug_start_match(re_sv, do_utf8, locinput, PL_regeol,
3819 "Matching embedded");
3821 startpoint = rei->program + 1;
3822 ST.close_paren = 0; /* only used for GOSUB */
3823 /* borrowed from regtry */
3824 if (PL_reg_start_tmpl <= re->nparens) {
3825 PL_reg_start_tmpl = re->nparens*3/2 + 3;
3826 if(PL_reg_start_tmp)
3827 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
3829 Newx(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
3832 eval_recurse_doit: /* Share code with GOSUB below this line */
3833 /* run the pattern returned from (??{...}) */
3834 ST.cp = regcppush(0); /* Save *all* the positions. */
3835 REGCP_SET(ST.lastcp);
3837 PL_regoffs = re->offs; /* essentially NOOP on GOSUB */
3839 /* see regtry, specifically PL_reglast(?:close)?paren is a pointer! (i dont know why) :dmq */
3840 PL_reglastparen = &re->lastparen;
3841 PL_reglastcloseparen = &re->lastcloseparen;
3843 re->lastcloseparen = 0;
3845 PL_reginput = locinput;
3848 /* XXXX This is too dramatic a measure... */
3851 ST.toggle_reg_flags = PL_reg_flags;
3853 PL_reg_flags |= RF_utf8;
3855 PL_reg_flags &= ~RF_utf8;
3856 ST.toggle_reg_flags ^= PL_reg_flags; /* diff of old and new */
3858 ST.prev_rex = rex_sv;
3859 ST.prev_curlyx = cur_curlyx;
3860 SETREX(rex_sv,re_sv);
3865 ST.prev_eval = cur_eval;
3867 /* now continue from first node in postoned RE */
3868 PUSH_YES_STATE_GOTO(EVAL_AB, startpoint);
3871 /* logical is 1, /(?(?{...})X|Y)/ */
3872 sw = (bool)SvTRUE(ret);
3877 case EVAL_AB: /* cleanup after a successful (??{A})B */
3878 /* note: this is called twice; first after popping B, then A */
3879 PL_reg_flags ^= ST.toggle_reg_flags;
3880 ReREFCNT_dec(rex_sv);
3881 SETREX(rex_sv,ST.prev_rex);
3882 rex = (struct regexp *)SvANY(rex_sv);
3883 rexi = RXi_GET(rex);
3885 cur_eval = ST.prev_eval;
3886 cur_curlyx = ST.prev_curlyx;
3888 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
3889 PL_reglastparen = &rex->lastparen;
3890 PL_reglastcloseparen = &rex->lastcloseparen;
3891 /* also update PL_regoffs */
3892 PL_regoffs = rex->offs;
3894 /* XXXX This is too dramatic a measure... */
3896 if ( nochange_depth )
3901 case EVAL_AB_fail: /* unsuccessfully ran A or B in (??{A})B */
3902 /* note: this is called twice; first after popping B, then A */
3903 PL_reg_flags ^= ST.toggle_reg_flags;
3904 ReREFCNT_dec(rex_sv);
3905 SETREX(rex_sv,ST.prev_rex);
3906 rex = (struct regexp *)SvANY(rex_sv);
3907 rexi = RXi_GET(rex);
3908 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
3909 PL_reglastparen = &rex->lastparen;
3910 PL_reglastcloseparen = &rex->lastcloseparen;
3912 PL_reginput = locinput;
3913 REGCP_UNWIND(ST.lastcp);
3915 cur_eval = ST.prev_eval;
3916 cur_curlyx = ST.prev_curlyx;
3917 /* XXXX This is too dramatic a measure... */
3919 if ( nochange_depth )
3925 n = ARG(scan); /* which paren pair */
3926 PL_reg_start_tmp[n] = locinput;
3932 n = ARG(scan); /* which paren pair */
3933 PL_regoffs[n].start = PL_reg_start_tmp[n] - PL_bostr;
3934 PL_regoffs[n].end = locinput - PL_bostr;
3935 /*if (n > PL_regsize)
3937 if (n > *PL_reglastparen)
3938 *PL_reglastparen = n;
3939 *PL_reglastcloseparen = n;
3940 if (cur_eval && cur_eval->u.eval.close_paren == n) {
3948 cursor && OP(cursor)!=END;
3949 cursor=regnext(cursor))
3951 if ( OP(cursor)==CLOSE ){
3953 if ( n <= lastopen ) {
3955 = PL_reg_start_tmp[n] - PL_bostr;
3956 PL_regoffs[n].end = locinput - PL_bostr;
3957 /*if (n > PL_regsize)
3959 if (n > *PL_reglastparen)
3960 *PL_reglastparen = n;
3961 *PL_reglastcloseparen = n;
3962 if ( n == ARG(scan) || (cur_eval &&
3963 cur_eval->u.eval.close_paren == n))
3972 n = ARG(scan); /* which paren pair */
3973 sw = (bool)(*PL_reglastparen >= n && PL_regoffs[n].end != -1);
3976 /* reg_check_named_buff_matched returns 0 for no match */
3977 sw = (bool)(0 < reg_check_named_buff_matched(rex,scan));
3981 sw = (cur_eval && (!n || cur_eval->u.eval.close_paren == n));
3987 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
3989 next = NEXTOPER(NEXTOPER(scan));
3991 next = scan + ARG(scan);
3992 if (OP(next) == IFTHEN) /* Fake one. */
3993 next = NEXTOPER(NEXTOPER(next));
3997 logical = scan->flags;
4000 /*******************************************************************
4002 The CURLYX/WHILEM pair of ops handle the most generic case of the /A*B/
4003 pattern, where A and B are subpatterns. (For simple A, CURLYM or
4004 STAR/PLUS/CURLY/CURLYN are used instead.)
4006 A*B is compiled as <CURLYX><A><WHILEM><B>
4008 On entry to the subpattern, CURLYX is called. This pushes a CURLYX
4009 state, which contains the current count, initialised to -1. It also sets
4010 cur_curlyx to point to this state, with any previous value saved in the
4013 CURLYX then jumps straight to the WHILEM op, rather than executing A,
4014 since the pattern may possibly match zero times (i.e. it's a while {} loop
4015 rather than a do {} while loop).
4017 Each entry to WHILEM represents a successful match of A. The count in the
4018 CURLYX block is incremented, another WHILEM state is pushed, and execution
4019 passes to A or B depending on greediness and the current count.
4021 For example, if matching against the string a1a2a3b (where the aN are
4022 substrings that match /A/), then the match progresses as follows: (the
4023 pushed states are interspersed with the bits of strings matched so far):
4026 <CURLYX cnt=0><WHILEM>
4027 <CURLYX cnt=1><WHILEM> a1 <WHILEM>
4028 <CURLYX cnt=2><WHILEM> a1 <WHILEM> a2 <WHILEM>
4029 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM>
4030 <CURLYX cnt=3><WHILEM> a1 <WHILEM> a2 <WHILEM> a3 <WHILEM> b
4032 (Contrast this with something like CURLYM, which maintains only a single
4036 a1 <CURLYM cnt=1> a2
4037 a1 a2 <CURLYM cnt=2> a3
4038 a1 a2 a3 <CURLYM cnt=3> b
4041 Each WHILEM state block marks a point to backtrack to upon partial failure
4042 of A or B, and also contains some minor state data related to that
4043 iteration. The CURLYX block, pointed to by cur_curlyx, contains the
4044 overall state, such as the count, and pointers to the A and B ops.
4046 This is complicated slightly by nested CURLYX/WHILEM's. Since cur_curlyx
4047 must always point to the *current* CURLYX block, the rules are:
4049 When executing CURLYX, save the old cur_curlyx in the CURLYX state block,
4050 and set cur_curlyx to point the new block.
4052 When popping the CURLYX block after a successful or unsuccessful match,
4053 restore the previous cur_curlyx.
4055 When WHILEM is about to execute B, save the current cur_curlyx, and set it
4056 to the outer one saved in the CURLYX block.
4058 When popping the WHILEM block after a successful or unsuccessful B match,
4059 restore the previous cur_curlyx.
4061 Here's an example for the pattern (AI* BI)*BO
4062 I and O refer to inner and outer, C and W refer to CURLYX and WHILEM:
4065 curlyx backtrack stack
4066 ------ ---------------
4068 CO <CO prev=NULL> <WO>
4069 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4070 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4071 NULL <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi <WO prev=CO> bo
4073 At this point the pattern succeeds, and we work back down the stack to
4074 clean up, restoring as we go:
4076 CO <CO prev=NULL> <WO> <CI prev=CO> <WI> ai <WI prev=CI> bi
4077 CI <CO prev=NULL> <WO> <CI prev=CO> <WI> ai
4078 CO <CO prev=NULL> <WO>
4081 *******************************************************************/
4083 #define ST st->u.curlyx
4085 case CURLYX: /* start of /A*B/ (for complex A) */
4087 /* No need to save/restore up to this paren */
4088 I32 parenfloor = scan->flags;
4090 assert(next); /* keep Coverity happy */
4091 if (OP(PREVOPER(next)) == NOTHING) /* LONGJMP */
4094 /* XXXX Probably it is better to teach regpush to support
4095 parenfloor > PL_regsize... */
4096 if (parenfloor > (I32)*PL_reglastparen)
4097 parenfloor = *PL_reglastparen; /* Pessimization... */
4099 ST.prev_curlyx= cur_curlyx;
4101 ST.cp = PL_savestack_ix;
4103 /* these fields contain the state of the current curly.
4104 * they are accessed by subsequent WHILEMs */
4105 ST.parenfloor = parenfloor;
4106 ST.min = ARG1(scan);
4107 ST.max = ARG2(scan);
4108 ST.A = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
4112 ST.count = -1; /* this will be updated by WHILEM */
4113 ST.lastloc = NULL; /* this will be updated by WHILEM */
4115 PL_reginput = locinput;
4116 PUSH_YES_STATE_GOTO(CURLYX_end, PREVOPER(next));
4120 case CURLYX_end: /* just finished matching all of A*B */
4121 cur_curlyx = ST.prev_curlyx;
4125 case CURLYX_end_fail: /* just failed to match all of A*B */
4127 cur_curlyx = ST.prev_curlyx;
4133 #define ST st->u.whilem
4135 case WHILEM: /* just matched an A in /A*B/ (for complex A) */
4137 /* see the discussion above about CURLYX/WHILEM */
4139 assert(cur_curlyx); /* keep Coverity happy */
4140 n = ++cur_curlyx->u.curlyx.count; /* how many A's matched */
4141 ST.save_lastloc = cur_curlyx->u.curlyx.lastloc;
4142 ST.cache_offset = 0;
4145 PL_reginput = locinput;
4147 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4148 "%*s whilem: matched %ld out of %ld..%ld\n",
4149 REPORT_CODE_OFF+depth*2, "", (long)n,
4150 (long)cur_curlyx->u.curlyx.min,
4151 (long)cur_curlyx->u.curlyx.max)
4154 /* First just match a string of min A's. */
4156 if (n < cur_curlyx->u.curlyx.min) {
4157 cur_curlyx->u.curlyx.lastloc = locinput;
4158 PUSH_STATE_GOTO(WHILEM_A_pre, cur_curlyx->u.curlyx.A);
4162 /* If degenerate A matches "", assume A done. */
4164 if (locinput == cur_curlyx->u.curlyx.lastloc) {
4165 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4166 "%*s whilem: empty match detected, trying continuation...\n",
4167 REPORT_CODE_OFF+depth*2, "")
4169 goto do_whilem_B_max;
4172 /* super-linear cache processing */
4176 if (!PL_reg_maxiter) {
4177 /* start the countdown: Postpone detection until we
4178 * know the match is not *that* much linear. */
4179 PL_reg_maxiter = (PL_regeol - PL_bostr + 1) * (scan->flags>>4);
4180 /* possible overflow for long strings and many CURLYX's */
4181 if (PL_reg_maxiter < 0)
4182 PL_reg_maxiter = I32_MAX;
4183 PL_reg_leftiter = PL_reg_maxiter;
4186 if (PL_reg_leftiter-- == 0) {
4187 /* initialise cache */
4188 const I32 size = (PL_reg_maxiter + 7)/8;
4189 if (PL_reg_poscache) {
4190 if ((I32)PL_reg_poscache_size < size) {
4191 Renew(PL_reg_poscache, size, char);
4192 PL_reg_poscache_size = size;
4194 Zero(PL_reg_poscache, size, char);
4197 PL_reg_poscache_size = size;
4198 Newxz(PL_reg_poscache, size, char);
4200 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4201 "%swhilem: Detected a super-linear match, switching on caching%s...\n",
4202 PL_colors[4], PL_colors[5])
4206 if (PL_reg_leftiter < 0) {
4207 /* have we already failed at this position? */
4209 offset = (scan->flags & 0xf) - 1
4210 + (locinput - PL_bostr) * (scan->flags>>4);
4211 mask = 1 << (offset % 8);
4213 if (PL_reg_poscache[offset] & mask) {
4214 DEBUG_EXECUTE_r( PerlIO_printf(Perl_debug_log,
4215 "%*s whilem: (cache) already tried at this position...\n",
4216 REPORT_CODE_OFF+depth*2, "")
4218 sayNO; /* cache records failure */
4220 ST.cache_offset = offset;
4221 ST.cache_mask = mask;
4225 /* Prefer B over A for minimal matching. */
4227 if (cur_curlyx->u.curlyx.minmod) {
4228 ST.save_curlyx = cur_curlyx;
4229 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4230 ST.cp = regcppush(ST.save_curlyx->u.curlyx.parenfloor);
4231 REGCP_SET(ST.lastcp);
4232 PUSH_YES_STATE_GOTO(WHILEM_B_min, ST.save_curlyx->u.curlyx.B);
4236 /* Prefer A over B for maximal matching. */
4238 if (n < cur_curlyx->u.curlyx.max) { /* More greed allowed? */
4239 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4240 cur_curlyx->u.curlyx.lastloc = locinput;
4241 REGCP_SET(ST.lastcp);
4242 PUSH_STATE_GOTO(WHILEM_A_max, cur_curlyx->u.curlyx.A);
4245 goto do_whilem_B_max;
4249 case WHILEM_B_min: /* just matched B in a minimal match */
4250 case WHILEM_B_max: /* just matched B in a maximal match */
4251 cur_curlyx = ST.save_curlyx;
4255 case WHILEM_B_max_fail: /* just failed to match B in a maximal match */
4256 cur_curlyx = ST.save_curlyx;
4257 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4258 cur_curlyx->u.curlyx.count--;
4262 case WHILEM_A_min_fail: /* just failed to match A in a minimal match */
4263 REGCP_UNWIND(ST.lastcp);
4266 case WHILEM_A_pre_fail: /* just failed to match even minimal A */
4267 cur_curlyx->u.curlyx.lastloc = ST.save_lastloc;
4268 cur_curlyx->u.curlyx.count--;
4272 case WHILEM_A_max_fail: /* just failed to match A in a maximal match */
4273 REGCP_UNWIND(ST.lastcp);
4274 regcppop(rex); /* Restore some previous $<digit>s? */
4275 PL_reginput = locinput;
4276 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4277 "%*s whilem: failed, trying continuation...\n",
4278 REPORT_CODE_OFF+depth*2, "")
4281 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4282 && ckWARN(WARN_REGEXP)
4283 && !(PL_reg_flags & RF_warned))
4285 PL_reg_flags |= RF_warned;
4286 Perl_warner(aTHX_ packWARN(WARN_REGEXP), "%s limit (%d) exceeded",
4287 "Complex regular subexpression recursion",
4292 ST.save_curlyx = cur_curlyx;
4293 cur_curlyx = cur_curlyx->u.curlyx.prev_curlyx;
4294 PUSH_YES_STATE_GOTO(WHILEM_B_max, ST.save_curlyx->u.curlyx.B);
4297 case WHILEM_B_min_fail: /* just failed to match B in a minimal match */
4298 cur_curlyx = ST.save_curlyx;
4299 REGCP_UNWIND(ST.lastcp);
4302 if (cur_curlyx->u.curlyx.count >= cur_curlyx->u.curlyx.max) {
4303 /* Maximum greed exceeded */
4304 if (cur_curlyx->u.curlyx.count >= REG_INFTY
4305 && ckWARN(WARN_REGEXP)
4306 && !(PL_reg_flags & RF_warned))
4308 PL_reg_flags |= RF_warned;
4309 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
4310 "%s limit (%d) exceeded",
4311 "Complex regular subexpression recursion",
4314 cur_curlyx->u.curlyx.count--;
4318 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4319 "%*s trying longer...\n", REPORT_CODE_OFF+depth*2, "")
4321 /* Try grabbing another A and see if it helps. */
4322 PL_reginput = locinput;
4323 cur_curlyx->u.curlyx.lastloc = locinput;
4324 ST.cp = regcppush(cur_curlyx->u.curlyx.parenfloor);
4325 REGCP_SET(ST.lastcp);
4326 PUSH_STATE_GOTO(WHILEM_A_min, ST.save_curlyx->u.curlyx.A);
4330 #define ST st->u.branch
4332 case BRANCHJ: /* /(...|A|...)/ with long next pointer */
4333 next = scan + ARG(scan);
4336 scan = NEXTOPER(scan);
4339 case BRANCH: /* /(...|A|...)/ */
4340 scan = NEXTOPER(scan); /* scan now points to inner node */
4341 ST.lastparen = *PL_reglastparen;
4342 ST.next_branch = next;
4344 PL_reginput = locinput;
4346 /* Now go into the branch */
4348 PUSH_YES_STATE_GOTO(BRANCH_next, scan);
4350 PUSH_STATE_GOTO(BRANCH_next, scan);
4354 PL_reginput = locinput;
4355 sv_yes_mark = st->u.mark.mark_name = scan->flags ? NULL :
4356 MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
4357 PUSH_STATE_GOTO(CUTGROUP_next,next);
4359 case CUTGROUP_next_fail:
4362 if (st->u.mark.mark_name)
4363 sv_commit = st->u.mark.mark_name;
4369 case BRANCH_next_fail: /* that branch failed; try the next, if any */
4374 REGCP_UNWIND(ST.cp);
4375 for (n = *PL_reglastparen; n > ST.lastparen; n--)
4376 PL_regoffs[n].end = -1;
4377 *PL_reglastparen = n;
4378 /*dmq: *PL_reglastcloseparen = n; */
4379 scan = ST.next_branch;
4380 /* no more branches? */
4381 if (!scan || (OP(scan) != BRANCH && OP(scan) != BRANCHJ)) {
4383 PerlIO_printf( Perl_debug_log,
4384 "%*s %sBRANCH failed...%s\n",
4385 REPORT_CODE_OFF+depth*2, "",
4391 continue; /* execute next BRANCH[J] op */
4399 #define ST st->u.curlym
4401 case CURLYM: /* /A{m,n}B/ where A is fixed-length */
4403 /* This is an optimisation of CURLYX that enables us to push
4404 * only a single backtracking state, no matter how many matches
4405 * there are in {m,n}. It relies on the pattern being constant
4406 * length, with no parens to influence future backrefs
4410 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
4412 /* if paren positive, emulate an OPEN/CLOSE around A */
4414 U32 paren = ST.me->flags;
4415 if (paren > PL_regsize)
4417 if (paren > *PL_reglastparen)
4418 *PL_reglastparen = paren;
4419 scan += NEXT_OFF(scan); /* Skip former OPEN. */
4427 ST.c1 = CHRTEST_UNINIT;
4430 if (!(ST.minmod ? ARG1(ST.me) : ARG2(ST.me))) /* min/max */
4433 curlym_do_A: /* execute the A in /A{m,n}B/ */
4434 PL_reginput = locinput;
4435 PUSH_YES_STATE_GOTO(CURLYM_A, ST.A); /* match A */
4438 case CURLYM_A: /* we've just matched an A */
4439 locinput = st->locinput;
4440 nextchr = UCHARAT(locinput);
4443 /* after first match, determine A's length: u.curlym.alen */
4444 if (ST.count == 1) {
4445 if (PL_reg_match_utf8) {
4447 while (s < PL_reginput) {
4453 ST.alen = PL_reginput - locinput;
4456 ST.count = ST.minmod ? ARG1(ST.me) : ARG2(ST.me);
4459 PerlIO_printf(Perl_debug_log,
4460 "%*s CURLYM now matched %"IVdf" times, len=%"IVdf"...\n",
4461 (int)(REPORT_CODE_OFF+(depth*2)), "",
4462 (IV) ST.count, (IV)ST.alen)
4465 locinput = PL_reginput;
4467 if (cur_eval && cur_eval->u.eval.close_paren &&
4468 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4472 I32 max = (ST.minmod ? ARG1(ST.me) : ARG2(ST.me));
4473 if ( max == REG_INFTY || ST.count < max )
4474 goto curlym_do_A; /* try to match another A */
4476 goto curlym_do_B; /* try to match B */
4478 case CURLYM_A_fail: /* just failed to match an A */
4479 REGCP_UNWIND(ST.cp);
4481 if (ST.minmod || ST.count < ARG1(ST.me) /* min*/
4482 || (cur_eval && cur_eval->u.eval.close_paren &&
4483 cur_eval->u.eval.close_paren == (U32)ST.me->flags))
4486 curlym_do_B: /* execute the B in /A{m,n}B/ */
4487 PL_reginput = locinput;
4488 if (ST.c1 == CHRTEST_UNINIT) {
4489 /* calculate c1 and c2 for possible match of 1st char
4490 * following curly */
4491 ST.c1 = ST.c2 = CHRTEST_VOID;
4492 if (HAS_TEXT(ST.B) || JUMPABLE(ST.B)) {
4493 regnode *text_node = ST.B;
4494 if (! HAS_TEXT(text_node))
4495 FIND_NEXT_IMPT(text_node);
4498 (HAS_TEXT(text_node) && PL_regkind[OP(text_node)] == EXACT)
4500 But the former is redundant in light of the latter.
4502 if this changes back then the macro for
4503 IS_TEXT and friends need to change.
4505 if (PL_regkind[OP(text_node)] == EXACT)
4508 ST.c1 = (U8)*STRING(text_node);
4510 (IS_TEXTF(text_node))
4512 : (IS_TEXTFL(text_node))
4513 ? PL_fold_locale[ST.c1]
4520 PerlIO_printf(Perl_debug_log,
4521 "%*s CURLYM trying tail with matches=%"IVdf"...\n",
4522 (int)(REPORT_CODE_OFF+(depth*2)),
4525 if (ST.c1 != CHRTEST_VOID
4526 && UCHARAT(PL_reginput) != ST.c1
4527 && UCHARAT(PL_reginput) != ST.c2)
4529 /* simulate B failing */
4531 PerlIO_printf(Perl_debug_log,
4532 "%*s CURLYM Fast bail c1=%"IVdf" c2=%"IVdf"\n",
4533 (int)(REPORT_CODE_OFF+(depth*2)),"",
4536 state_num = CURLYM_B_fail;
4537 goto reenter_switch;
4541 /* mark current A as captured */
4542 I32 paren = ST.me->flags;
4544 PL_regoffs[paren].start
4545 = HOPc(PL_reginput, -ST.alen) - PL_bostr;
4546 PL_regoffs[paren].end = PL_reginput - PL_bostr;
4547 /*dmq: *PL_reglastcloseparen = paren; */
4550 PL_regoffs[paren].end = -1;
4551 if (cur_eval && cur_eval->u.eval.close_paren &&
4552 cur_eval->u.eval.close_paren == (U32)ST.me->flags)
4561 PUSH_STATE_GOTO(CURLYM_B, ST.B); /* match B */
4564 case CURLYM_B_fail: /* just failed to match a B */
4565 REGCP_UNWIND(ST.cp);
4567 I32 max = ARG2(ST.me);
4568 if (max != REG_INFTY && ST.count == max)
4570 goto curlym_do_A; /* try to match a further A */
4572 /* backtrack one A */
4573 if (ST.count == ARG1(ST.me) /* min */)
4576 locinput = HOPc(locinput, -ST.alen);
4577 goto curlym_do_B; /* try to match B */
4580 #define ST st->u.curly
4582 #define CURLY_SETPAREN(paren, success) \
4585 PL_regoffs[paren].start = HOPc(locinput, -1) - PL_bostr; \
4586 PL_regoffs[paren].end = locinput - PL_bostr; \
4587 *PL_reglastcloseparen = paren; \
4590 PL_regoffs[paren].end = -1; \
4593 case STAR: /* /A*B/ where A is width 1 */
4597 scan = NEXTOPER(scan);
4599 case PLUS: /* /A+B/ where A is width 1 */
4603 scan = NEXTOPER(scan);
4605 case CURLYN: /* /(A){m,n}B/ where A is width 1 */
4606 ST.paren = scan->flags; /* Which paren to set */
4607 if (ST.paren > PL_regsize)
4608 PL_regsize = ST.paren;
4609 if (ST.paren > *PL_reglastparen)
4610 *PL_reglastparen = ST.paren;
4611 ST.min = ARG1(scan); /* min to match */
4612 ST.max = ARG2(scan); /* max to match */
4613 if (cur_eval && cur_eval->u.eval.close_paren &&
4614 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4618 scan = regnext(NEXTOPER(scan) + NODE_STEP_REGNODE);
4620 case CURLY: /* /A{m,n}B/ where A is width 1 */
4622 ST.min = ARG1(scan); /* min to match */
4623 ST.max = ARG2(scan); /* max to match */
4624 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
4627 * Lookahead to avoid useless match attempts
4628 * when we know what character comes next.
4630 * Used to only do .*x and .*?x, but now it allows
4631 * for )'s, ('s and (?{ ... })'s to be in the way
4632 * of the quantifier and the EXACT-like node. -- japhy
4635 if (ST.min > ST.max) /* XXX make this a compile-time check? */
4637 if (HAS_TEXT(next) || JUMPABLE(next)) {
4639 regnode *text_node = next;
4641 if (! HAS_TEXT(text_node))
4642 FIND_NEXT_IMPT(text_node);
4644 if (! HAS_TEXT(text_node))
4645 ST.c1 = ST.c2 = CHRTEST_VOID;
4647 if ( PL_regkind[OP(text_node)] != EXACT ) {
4648 ST.c1 = ST.c2 = CHRTEST_VOID;
4649 goto assume_ok_easy;
4652 s = (U8*)STRING(text_node);
4654 /* Currently we only get here when
4656 PL_rekind[OP(text_node)] == EXACT
4658 if this changes back then the macro for IS_TEXT and
4659 friends need to change. */
4662 if (IS_TEXTF(text_node))
4663 ST.c2 = PL_fold[ST.c1];
4664 else if (IS_TEXTFL(text_node))
4665 ST.c2 = PL_fold_locale[ST.c1];
4668 if (IS_TEXTF(text_node)) {
4669 STRLEN ulen1, ulen2;
4670 U8 tmpbuf1[UTF8_MAXBYTES_CASE+1];
4671 U8 tmpbuf2[UTF8_MAXBYTES_CASE+1];
4673 to_utf8_lower((U8*)s, tmpbuf1, &ulen1);
4674 to_utf8_upper((U8*)s, tmpbuf2, &ulen2);
4676 ST.c1 = utf8n_to_uvchr(tmpbuf1, UTF8_MAXLEN, 0,
4678 0 : UTF8_ALLOW_ANY);
4679 ST.c2 = utf8n_to_uvchr(tmpbuf2, UTF8_MAXLEN, 0,
4681 0 : UTF8_ALLOW_ANY);
4683 ST.c1 = utf8n_to_uvuni(tmpbuf1, UTF8_MAXBYTES, 0,
4685 ST.c2 = utf8n_to_uvuni(tmpbuf2, UTF8_MAXBYTES, 0,
4690 ST.c2 = ST.c1 = utf8n_to_uvchr(s, UTF8_MAXBYTES, 0,
4697 ST.c1 = ST.c2 = CHRTEST_VOID;
4702 PL_reginput = locinput;
4705 if (ST.min && regrepeat(rex, ST.A, ST.min, depth) < ST.min)
4708 locinput = PL_reginput;
4710 if (ST.c1 == CHRTEST_VOID)
4711 goto curly_try_B_min;
4713 ST.oldloc = locinput;
4715 /* set ST.maxpos to the furthest point along the
4716 * string that could possibly match */
4717 if (ST.max == REG_INFTY) {
4718 ST.maxpos = PL_regeol - 1;
4720 while (UTF8_IS_CONTINUATION(*(U8*)ST.maxpos))
4724 int m = ST.max - ST.min;
4725 for (ST.maxpos = locinput;
4726 m >0 && ST.maxpos + UTF8SKIP(ST.maxpos) <= PL_regeol; m--)
4727 ST.maxpos += UTF8SKIP(ST.maxpos);
4730 ST.maxpos = locinput + ST.max - ST.min;
4731 if (ST.maxpos >= PL_regeol)
4732 ST.maxpos = PL_regeol - 1;
4734 goto curly_try_B_min_known;
4738 ST.count = regrepeat(rex, ST.A, ST.max, depth);
4739 locinput = PL_reginput;
4740 if (ST.count < ST.min)
4742 if ((ST.count > ST.min)
4743 && (PL_regkind[OP(ST.B)] == EOL) && (OP(ST.B) != MEOL))
4745 /* A{m,n} must come at the end of the string, there's
4746 * no point in backing off ... */
4748 /* ...except that $ and \Z can match before *and* after
4749 newline at the end. Consider "\n\n" =~ /\n+\Z\n/.
4750 We may back off by one in this case. */
4751 if (UCHARAT(PL_reginput - 1) == '\n' && OP(ST.B) != EOS)
4755 goto curly_try_B_max;
4760 case CURLY_B_min_known_fail:
4761 /* failed to find B in a non-greedy match where c1,c2 valid */
4762 if (ST.paren && ST.count)
4763 PL_regoffs[ST.paren].end = -1;
4765 PL_reginput = locinput; /* Could be reset... */
4766 REGCP_UNWIND(ST.cp);
4767 /* Couldn't or didn't -- move forward. */
4768 ST.oldloc = locinput;
4770 locinput += UTF8SKIP(locinput);
4774 curly_try_B_min_known:
4775 /* find the next place where 'B' could work, then call B */
4779 n = (ST.oldloc == locinput) ? 0 : 1;
4780 if (ST.c1 == ST.c2) {
4782 /* set n to utf8_distance(oldloc, locinput) */
4783 while (locinput <= ST.maxpos &&
4784 utf8n_to_uvchr((U8*)locinput,
4785 UTF8_MAXBYTES, &len,
4786 uniflags) != (UV)ST.c1) {
4792 /* set n to utf8_distance(oldloc, locinput) */
4793 while (locinput <= ST.maxpos) {
4795 const UV c = utf8n_to_uvchr((U8*)locinput,
4796 UTF8_MAXBYTES, &len,
4798 if (c == (UV)ST.c1 || c == (UV)ST.c2)
4806 if (ST.c1 == ST.c2) {
4807 while (locinput <= ST.maxpos &&
4808 UCHARAT(locinput) != ST.c1)
4812 while (locinput <= ST.maxpos
4813 && UCHARAT(locinput) != ST.c1
4814 && UCHARAT(locinput) != ST.c2)
4817 n = locinput - ST.oldloc;
4819 if (locinput > ST.maxpos)
4821 /* PL_reginput == oldloc now */
4824 if (regrepeat(rex, ST.A, n, depth) < n)
4827 PL_reginput = locinput;
4828 CURLY_SETPAREN(ST.paren, ST.count);
4829 if (cur_eval && cur_eval->u.eval.close_paren &&
4830 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4833 PUSH_STATE_GOTO(CURLY_B_min_known, ST.B);
4838 case CURLY_B_min_fail:
4839 /* failed to find B in a non-greedy match where c1,c2 invalid */
4840 if (ST.paren && ST.count)
4841 PL_regoffs[ST.paren].end = -1;
4843 REGCP_UNWIND(ST.cp);
4844 /* failed -- move forward one */
4845 PL_reginput = locinput;
4846 if (regrepeat(rex, ST.A, 1, depth)) {
4848 locinput = PL_reginput;
4849 if (ST.count <= ST.max || (ST.max == REG_INFTY &&
4850 ST.count > 0)) /* count overflow ? */
4853 CURLY_SETPAREN(ST.paren, ST.count);
4854 if (cur_eval && cur_eval->u.eval.close_paren &&
4855 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4858 PUSH_STATE_GOTO(CURLY_B_min, ST.B);
4866 /* a successful greedy match: now try to match B */
4867 if (cur_eval && cur_eval->u.eval.close_paren &&
4868 cur_eval->u.eval.close_paren == (U32)ST.paren) {
4873 if (ST.c1 != CHRTEST_VOID)
4874 c = do_utf8 ? utf8n_to_uvchr((U8*)PL_reginput,
4875 UTF8_MAXBYTES, 0, uniflags)
4876 : (UV) UCHARAT(PL_reginput);
4877 /* If it could work, try it. */
4878 if (ST.c1 == CHRTEST_VOID || c == (UV)ST.c1 || c == (UV)ST.c2) {
4879 CURLY_SETPAREN(ST.paren, ST.count);
4880 PUSH_STATE_GOTO(CURLY_B_max, ST.B);
4885 case CURLY_B_max_fail:
4886 /* failed to find B in a greedy match */
4887 if (ST.paren && ST.count)
4888 PL_regoffs[ST.paren].end = -1;
4890 REGCP_UNWIND(ST.cp);
4892 if (--ST.count < ST.min)
4894 PL_reginput = locinput = HOPc(locinput, -1);
4895 goto curly_try_B_max;
4902 /* we've just finished A in /(??{A})B/; now continue with B */
4904 st->u.eval.toggle_reg_flags
4905 = cur_eval->u.eval.toggle_reg_flags;
4906 PL_reg_flags ^= st->u.eval.toggle_reg_flags;
4908 st->u.eval.prev_rex = rex_sv; /* inner */
4909 SETREX(rex_sv,cur_eval->u.eval.prev_rex);
4910 rex = (struct regexp *)SvANY(rex_sv);
4911 rexi = RXi_GET(rex);
4912 cur_curlyx = cur_eval->u.eval.prev_curlyx;
4913 ReREFCNT_inc(rex_sv);
4914 st->u.eval.cp = regcppush(0); /* Save *all* the positions. */
4916 /* rex was changed so update the pointer in PL_reglastparen and PL_reglastcloseparen */
4917 PL_reglastparen = &rex->lastparen;
4918 PL_reglastcloseparen = &rex->lastcloseparen;
4920 REGCP_SET(st->u.eval.lastcp);
4921 PL_reginput = locinput;
4923 /* Restore parens of the outer rex without popping the
4925 tmpix = PL_savestack_ix;
4926 PL_savestack_ix = cur_eval->u.eval.lastcp;
4928 PL_savestack_ix = tmpix;
4930 st->u.eval.prev_eval = cur_eval;
4931 cur_eval = cur_eval->u.eval.prev_eval;
4933 PerlIO_printf(Perl_debug_log, "%*s EVAL trying tail ... %"UVxf"\n",
4934 REPORT_CODE_OFF+depth*2, "",PTR2UV(cur_eval)););
4935 if ( nochange_depth )
4938 PUSH_YES_STATE_GOTO(EVAL_AB,
4939 st->u.eval.prev_eval->u.eval.B); /* match B */
4942 if (locinput < reginfo->till) {
4943 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log,
4944 "%sMatch possible, but length=%ld is smaller than requested=%ld, failing!%s\n",
4946 (long)(locinput - PL_reg_starttry),
4947 (long)(reginfo->till - PL_reg_starttry),
4950 sayNO_SILENT; /* Cannot match: too short. */
4952 PL_reginput = locinput; /* put where regtry can find it */
4953 sayYES; /* Success! */
4955 case SUCCEED: /* successful SUSPEND/UNLESSM/IFMATCH/CURLYM */
4957 PerlIO_printf(Perl_debug_log,
4958 "%*s %ssubpattern success...%s\n",
4959 REPORT_CODE_OFF+depth*2, "", PL_colors[4], PL_colors[5]));
4960 PL_reginput = locinput; /* put where regtry can find it */
4961 sayYES; /* Success! */
4964 #define ST st->u.ifmatch
4966 case SUSPEND: /* (?>A) */
4968 PL_reginput = locinput;
4971 case UNLESSM: /* -ve lookaround: (?!A), or with flags, (?<!A) */
4973 goto ifmatch_trivial_fail_test;
4975 case IFMATCH: /* +ve lookaround: (?=A), or with flags, (?<=A) */
4977 ifmatch_trivial_fail_test:
4979 char * const s = HOPBACKc(locinput, scan->flags);
4984 sw = 1 - (bool)ST.wanted;
4988 next = scan + ARG(scan);
4996 PL_reginput = locinput;
5000 ST.logical = logical;
5001 logical = 0; /* XXX: reset state of logical once it has been saved into ST */
5003 /* execute body of (?...A) */
5004 PUSH_YES_STATE_GOTO(IFMATCH_A, NEXTOPER(NEXTOPER(scan)));
5007 case IFMATCH_A_fail: /* body of (?...A) failed */
5008 ST.wanted = !ST.wanted;
5011 case IFMATCH_A: /* body of (?...A) succeeded */
5013 sw = (bool)ST.wanted;
5015 else if (!ST.wanted)
5018 if (OP(ST.me) == SUSPEND)
5019 locinput = PL_reginput;
5021 locinput = PL_reginput = st->locinput;
5022 nextchr = UCHARAT(locinput);
5024 scan = ST.me + ARG(ST.me);
5027 continue; /* execute B */
5032 next = scan + ARG(scan);
5037 reginfo->cutpoint = PL_regeol;
5040 PL_reginput = locinput;
5042 sv_yes_mark = sv_commit = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5043 PUSH_STATE_GOTO(COMMIT_next,next);
5045 case COMMIT_next_fail:
5052 #define ST st->u.mark
5054 ST.prev_mark = mark_state;
5055 ST.mark_name = sv_commit = sv_yes_mark
5056 = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5058 ST.mark_loc = PL_reginput = locinput;
5059 PUSH_YES_STATE_GOTO(MARKPOINT_next,next);
5061 case MARKPOINT_next:
5062 mark_state = ST.prev_mark;
5065 case MARKPOINT_next_fail:
5066 if (popmark && sv_eq(ST.mark_name,popmark))
5068 if (ST.mark_loc > startpoint)
5069 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5070 popmark = NULL; /* we found our mark */
5071 sv_commit = ST.mark_name;
5074 PerlIO_printf(Perl_debug_log,
5075 "%*s %ssetting cutpoint to mark:%"SVf"...%s\n",
5076 REPORT_CODE_OFF+depth*2, "",
5077 PL_colors[4], SVfARG(sv_commit), PL_colors[5]);
5080 mark_state = ST.prev_mark;
5081 sv_yes_mark = mark_state ?
5082 mark_state->u.mark.mark_name : NULL;
5086 PL_reginput = locinput;
5088 /* (*SKIP) : if we fail we cut here*/
5089 ST.mark_name = NULL;
5090 ST.mark_loc = locinput;
5091 PUSH_STATE_GOTO(SKIP_next,next);
5093 /* (*SKIP:NAME) : if there is a (*MARK:NAME) fail where it was,
5094 otherwise do nothing. Meaning we need to scan
5096 regmatch_state *cur = mark_state;
5097 SV *find = MUTABLE_SV(rexi->data->data[ ARG( scan ) ]);
5100 if ( sv_eq( cur->u.mark.mark_name,
5103 ST.mark_name = find;
5104 PUSH_STATE_GOTO( SKIP_next, next );
5106 cur = cur->u.mark.prev_mark;
5109 /* Didn't find our (*MARK:NAME) so ignore this (*SKIP:NAME) */
5111 case SKIP_next_fail:
5113 /* (*CUT:NAME) - Set up to search for the name as we
5114 collapse the stack*/
5115 popmark = ST.mark_name;
5117 /* (*CUT) - No name, we cut here.*/
5118 if (ST.mark_loc > startpoint)
5119 reginfo->cutpoint = HOPBACKc(ST.mark_loc, 1);
5120 /* but we set sv_commit to latest mark_name if there
5121 is one so they can test to see how things lead to this
5124 sv_commit=mark_state->u.mark.mark_name;
5132 if ( n == (U32)what_len_TRICKYFOLD(locinput,do_utf8,ln) ) {
5134 } else if ( 0xDF == n && !do_utf8 && !UTF ) {
5137 U8 folded[UTF8_MAXBYTES_CASE+1];
5139 const char * const l = locinput;
5140 char *e = PL_regeol;
5141 to_uni_fold(n, folded, &foldlen);
5143 if (ibcmp_utf8((const char*) folded, 0, foldlen, 1,
5144 l, &e, 0, do_utf8)) {
5149 nextchr = UCHARAT(locinput);
5152 if ((n=is_LNBREAK(locinput,do_utf8))) {
5154 nextchr = UCHARAT(locinput);
5159 #define CASE_CLASS(nAmE) \
5161 if ((n=is_##nAmE(locinput,do_utf8))) { \
5163 nextchr = UCHARAT(locinput); \
5168 if ((n=is_##nAmE(locinput,do_utf8))) { \
5171 locinput += UTF8SKIP(locinput); \
5172 nextchr = UCHARAT(locinput); \
5177 CASE_CLASS(HORIZWS);
5181 PerlIO_printf(Perl_error_log, "%"UVxf" %d\n",
5182 PTR2UV(scan), OP(scan));
5183 Perl_croak(aTHX_ "regexp memory corruption");
5187 /* switch break jumps here */
5188 scan = next; /* prepare to execute the next op and ... */
5189 continue; /* ... jump back to the top, reusing st */
5193 /* push a state that backtracks on success */
5194 st->u.yes.prev_yes_state = yes_state;
5198 /* push a new regex state, then continue at scan */
5200 regmatch_state *newst;
5203 regmatch_state *cur = st;
5204 regmatch_state *curyes = yes_state;
5206 regmatch_slab *slab = PL_regmatch_slab;
5207 for (;curd > -1;cur--,curd--) {
5208 if (cur < SLAB_FIRST(slab)) {
5210 cur = SLAB_LAST(slab);
5212 PerlIO_printf(Perl_error_log, "%*s#%-3d %-10s %s\n",
5213 REPORT_CODE_OFF + 2 + depth * 2,"",
5214 curd, PL_reg_name[cur->resume_state],
5215 (curyes == cur) ? "yes" : ""
5218 curyes = cur->u.yes.prev_yes_state;
5221 DEBUG_STATE_pp("push")
5224 st->locinput = locinput;
5226 if (newst > SLAB_LAST(PL_regmatch_slab))
5227 newst = S_push_slab(aTHX);
5228 PL_regmatch_state = newst;
5230 locinput = PL_reginput;
5231 nextchr = UCHARAT(locinput);
5239 * We get here only if there's trouble -- normally "case END" is
5240 * the terminating point.
5242 Perl_croak(aTHX_ "corrupted regexp pointers");
5248 /* we have successfully completed a subexpression, but we must now
5249 * pop to the state marked by yes_state and continue from there */
5250 assert(st != yes_state);
5252 while (st != yes_state) {
5254 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5255 PL_regmatch_slab = PL_regmatch_slab->prev;
5256 st = SLAB_LAST(PL_regmatch_slab);
5260 DEBUG_STATE_pp("pop (no final)");
5262 DEBUG_STATE_pp("pop (yes)");
5268 while (yes_state < SLAB_FIRST(PL_regmatch_slab)
5269 || yes_state > SLAB_LAST(PL_regmatch_slab))
5271 /* not in this slab, pop slab */
5272 depth -= (st - SLAB_FIRST(PL_regmatch_slab) + 1);
5273 PL_regmatch_slab = PL_regmatch_slab->prev;
5274 st = SLAB_LAST(PL_regmatch_slab);
5276 depth -= (st - yes_state);
5279 yes_state = st->u.yes.prev_yes_state;
5280 PL_regmatch_state = st;
5283 locinput= st->locinput;
5284 nextchr = UCHARAT(locinput);
5286 state_num = st->resume_state + no_final;
5287 goto reenter_switch;
5290 DEBUG_EXECUTE_r(PerlIO_printf(Perl_debug_log, "%sMatch successful!%s\n",
5291 PL_colors[4], PL_colors[5]));
5293 if (PL_reg_eval_set) {
5294 /* each successfully executed (?{...}) block does the equivalent of
5295 * local $^R = do {...}
5296 * When popping the save stack, all these locals would be undone;
5297 * bypass this by setting the outermost saved $^R to the latest
5299 if (oreplsv != GvSV(PL_replgv))
5300 sv_setsv(oreplsv, GvSV(PL_replgv));
5307 PerlIO_printf(Perl_debug_log,
5308 "%*s %sfailed...%s\n",
5309 REPORT_CODE_OFF+depth*2, "",
5310 PL_colors[4], PL_colors[5])
5322 /* there's a previous state to backtrack to */
5324 if (st < SLAB_FIRST(PL_regmatch_slab)) {
5325 PL_regmatch_slab = PL_regmatch_slab->prev;
5326 st = SLAB_LAST(PL_regmatch_slab);
5328 PL_regmatch_state = st;
5329 locinput= st->locinput;
5330 nextchr = UCHARAT(locinput);
5332 DEBUG_STATE_pp("pop");
5334 if (yes_state == st)
5335 yes_state = st->u.yes.prev_yes_state;
5337 state_num = st->resume_state + 1; /* failure = success + 1 */
5338 goto reenter_switch;
5343 if (rex->intflags & PREGf_VERBARG_SEEN) {
5344 SV *sv_err = get_sv("REGERROR", 1);
5345 SV *sv_mrk = get_sv("REGMARK", 1);
5347 sv_commit = &PL_sv_no;
5349 sv_yes_mark = &PL_sv_yes;
5352 sv_commit = &PL_sv_yes;
5353 sv_yes_mark = &PL_sv_no;
5355 sv_setsv(sv_err, sv_commit);
5356 sv_setsv(sv_mrk, sv_yes_mark);
5359 /* clean up; in particular, free all slabs above current one */
5360 LEAVE_SCOPE(oldsave);
5366 - regrepeat - repeatedly match something simple, report how many
5369 * [This routine now assumes that it will only match on things of length 1.
5370 * That was true before, but now we assume scan - reginput is the count,
5371 * rather than incrementing count on every character. [Er, except utf8.]]
5374 S_regrepeat(pTHX_ const regexp *prog, const regnode *p, I32 max, int depth)
5377 register char *scan;
5379 register char *loceol = PL_regeol;
5380 register I32 hardcount = 0;
5381 register bool do_utf8 = PL_reg_match_utf8;
5383 PERL_UNUSED_ARG(depth);
5386 PERL_ARGS_ASSERT_REGREPEAT;
5389 if (max == REG_INFTY)
5391 else if (max < loceol - scan)
5392 loceol = scan + max;
5397 while (scan < loceol && hardcount < max && *scan != '\n') {
5398 scan += UTF8SKIP(scan);
5402 while (scan < loceol && *scan != '\n')
5409 while (scan < loceol && hardcount < max) {
5410 scan += UTF8SKIP(scan);
5420 case EXACT: /* length of string is 1 */
5422 while (scan < loceol && UCHARAT(scan) == c)
5425 case EXACTF: /* length of string is 1 */
5427 while (scan < loceol &&
5428 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold[c]))
5431 case EXACTFL: /* length of string is 1 */
5432 PL_reg_flags |= RF_tainted;
5434 while (scan < loceol &&
5435 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold_locale[c]))
5441 while (hardcount < max && scan < loceol &&
5442 reginclass(prog, p, (U8*)scan, 0, do_utf8)) {
5443 scan += UTF8SKIP(scan);
5447 while (scan < loceol && REGINCLASS(prog, p, (U8*)scan))
5454 LOAD_UTF8_CHARCLASS_ALNUM();
5455 while (hardcount < max && scan < loceol &&
5456 swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
5457 scan += UTF8SKIP(scan);
5461 while (scan < loceol && isALNUM(*scan))
5466 PL_reg_flags |= RF_tainted;
5469 while (hardcount < max && scan < loceol &&
5470 isALNUM_LC_utf8((U8*)scan)) {
5471 scan += UTF8SKIP(scan);
5475 while (scan < loceol && isALNUM_LC(*scan))
5482 LOAD_UTF8_CHARCLASS_ALNUM();
5483 while (hardcount < max && scan < loceol &&
5484 !swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
5485 scan += UTF8SKIP(scan);
5489 while (scan < loceol && !isALNUM(*scan))
5494 PL_reg_flags |= RF_tainted;
5497 while (hardcount < max && scan < loceol &&
5498 !isALNUM_LC_utf8((U8*)scan)) {
5499 scan += UTF8SKIP(scan);
5503 while (scan < loceol && !isALNUM_LC(*scan))
5510 LOAD_UTF8_CHARCLASS_SPACE();
5511 while (hardcount < max && scan < loceol &&
5513 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
5514 scan += UTF8SKIP(scan);
5518 while (scan < loceol && isSPACE(*scan))
5523 PL_reg_flags |= RF_tainted;
5526 while (hardcount < max && scan < loceol &&
5527 (*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
5528 scan += UTF8SKIP(scan);
5532 while (scan < loceol && isSPACE_LC(*scan))
5539 LOAD_UTF8_CHARCLASS_SPACE();
5540 while (hardcount < max && scan < loceol &&
5542 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
5543 scan += UTF8SKIP(scan);
5547 while (scan < loceol && !isSPACE(*scan))
5552 PL_reg_flags |= RF_tainted;
5555 while (hardcount < max && scan < loceol &&
5556 !(*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
5557 scan += UTF8SKIP(scan);
5561 while (scan < loceol && !isSPACE_LC(*scan))
5568 LOAD_UTF8_CHARCLASS_DIGIT();
5569 while (hardcount < max && scan < loceol &&
5570 swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
5571 scan += UTF8SKIP(scan);
5575 while (scan < loceol && isDIGIT(*scan))
5582 LOAD_UTF8_CHARCLASS_DIGIT();
5583 while (hardcount < max && scan < loceol &&
5584 !swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
5585 scan += UTF8SKIP(scan);
5589 while (scan < loceol && !isDIGIT(*scan))
5595 while (hardcount < max && scan < loceol && (c=is_LNBREAK_utf8(scan))) {
5601 LNBREAK can match two latin chars, which is ok,
5602 because we have a null terminated string, but we
5603 have to use hardcount in this situation
5605 while (scan < loceol && (c=is_LNBREAK_latin1(scan))) {
5614 while (hardcount < max && scan < loceol && (c=is_HORIZWS_utf8(scan))) {
5619 while (scan < loceol && is_HORIZWS_latin1(scan))
5626 while (hardcount < max && scan < loceol && !is_HORIZWS_utf8(scan)) {
5627 scan += UTF8SKIP(scan);
5631 while (scan < loceol && !is_HORIZWS_latin1(scan))
5639 while (hardcount < max && scan < loceol && (c=is_VERTWS_utf8(scan))) {
5644 while (scan < loceol && is_VERTWS_latin1(scan))
5652 while (hardcount < max && scan < loceol && !is_VERTWS_utf8(scan)) {
5653 scan += UTF8SKIP(scan);
5657 while (scan < loceol && !is_VERTWS_latin1(scan))
5663 default: /* Called on something of 0 width. */
5664 break; /* So match right here or not at all. */
5670 c = scan - PL_reginput;
5674 GET_RE_DEBUG_FLAGS_DECL;
5676 SV * const prop = sv_newmortal();
5677 regprop(prog, prop, p);
5678 PerlIO_printf(Perl_debug_log,
5679 "%*s %s can match %"IVdf" times out of %"IVdf"...\n",
5680 REPORT_CODE_OFF + depth*2, "", SvPVX_const(prop),(IV)c,(IV)max);
5688 #if !defined(PERL_IN_XSUB_RE) || defined(PLUGGABLE_RE_EXTENSION)
5690 - regclass_swash - prepare the utf8 swash
5694 Perl_regclass_swash(pTHX_ const regexp *prog, register const regnode* node, bool doinit, SV** listsvp, SV **altsvp)
5700 RXi_GET_DECL(prog,progi);
5701 const struct reg_data * const data = prog ? progi->data : NULL;
5703 PERL_ARGS_ASSERT_REGCLASS_SWASH;
5705 if (data && data->count) {
5706 const U32 n = ARG(node);
5708 if (data->what[n] == 's') {
5709 SV * const rv = MUTABLE_SV(data->data[n]);
5710 AV * const av = MUTABLE_AV(SvRV(rv));
5711 SV **const ary = AvARRAY(av);
5714 /* See the end of regcomp.c:S_regclass() for
5715 * documentation of these array elements. */
5718 a = SvROK(ary[1]) ? &ary[1] : NULL;
5719 b = SvTYPE(ary[2]) == SVt_PVAV ? &ary[2] : NULL;
5723 else if (si && doinit) {
5724 sw = swash_init("utf8", "", si, 1, 0);
5725 (void)av_store(av, 1, sw);
5742 - reginclass - determine if a character falls into a character class
5744 The n is the ANYOF regnode, the p is the target string, lenp
5745 is pointer to the maximum length of how far to go in the p
5746 (if the lenp is zero, UTF8SKIP(p) is used),
5747 do_utf8 tells whether the target string is in UTF-8.
5752 S_reginclass(pTHX_ const regexp *prog, register const regnode *n, register const U8* p, STRLEN* lenp, register bool do_utf8)
5755 const char flags = ANYOF_FLAGS(n);
5761 PERL_ARGS_ASSERT_REGINCLASS;
5763 if (do_utf8 && !UTF8_IS_INVARIANT(c)) {
5764 c = utf8n_to_uvchr(p, UTF8_MAXBYTES, &len,
5765 (UTF8_ALLOW_DEFAULT & UTF8_ALLOW_ANYUV) | UTF8_CHECK_ONLY);
5766 /* see [perl #37836] for UTF8_ALLOW_ANYUV */
5767 if (len == (STRLEN)-1)
5768 Perl_croak(aTHX_ "Malformed UTF-8 character (fatal)");
5771 plen = lenp ? *lenp : UNISKIP(NATIVE_TO_UNI(c));
5772 if (do_utf8 || (flags & ANYOF_UNICODE)) {
5775 if (do_utf8 && !ANYOF_RUNTIME(n)) {
5776 if (len != (STRLEN)-1 && c < 256 && ANYOF_BITMAP_TEST(n, c))
5779 if (!match && do_utf8 && (flags & ANYOF_UNICODE_ALL) && c >= 256)
5783 SV * const sw = regclass_swash(prog, n, TRUE, 0, (SV**)&av);
5791 utf8_p = bytes_to_utf8(p, &len);
5793 if (swash_fetch(sw, utf8_p, 1))
5795 else if (flags & ANYOF_FOLD) {
5796 if (!match && lenp && av) {
5798 for (i = 0; i <= av_len(av); i++) {
5799 SV* const sv = *av_fetch(av, i, FALSE);
5801 const char * const s = SvPV_const(sv, len);
5802 if (len <= plen && memEQ(s, (char*)utf8_p, len)) {
5810 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
5813 to_utf8_fold(utf8_p, tmpbuf, &tmplen);
5814 if (swash_fetch(sw, tmpbuf, 1))
5819 /* If we allocated a string above, free it */
5820 if (! do_utf8) Safefree(utf8_p);
5823 if (match && lenp && *lenp == 0)
5824 *lenp = UNISKIP(NATIVE_TO_UNI(c));
5826 if (!match && c < 256) {
5827 if (ANYOF_BITMAP_TEST(n, c))
5829 else if (flags & ANYOF_FOLD) {
5832 if (flags & ANYOF_LOCALE) {
5833 PL_reg_flags |= RF_tainted;
5834 f = PL_fold_locale[c];
5838 if (f != c && ANYOF_BITMAP_TEST(n, f))
5842 if (!match && (flags & ANYOF_CLASS)) {
5843 PL_reg_flags |= RF_tainted;
5845 (ANYOF_CLASS_TEST(n, ANYOF_ALNUM) && isALNUM_LC(c)) ||
5846 (ANYOF_CLASS_TEST(n, ANYOF_NALNUM) && !isALNUM_LC(c)) ||
5847 (ANYOF_CLASS_TEST(n, ANYOF_SPACE) && isSPACE_LC(c)) ||
5848 (ANYOF_CLASS_TEST(n, ANYOF_NSPACE) && !isSPACE_LC(c)) ||
5849 (ANYOF_CLASS_TEST(n, ANYOF_DIGIT) && isDIGIT_LC(c)) ||
5850 (ANYOF_CLASS_TEST(n, ANYOF_NDIGIT) && !isDIGIT_LC(c)) ||
5851 (ANYOF_CLASS_TEST(n, ANYOF_ALNUMC) && isALNUMC_LC(c)) ||
5852 (ANYOF_CLASS_TEST(n, ANYOF_NALNUMC) && !isALNUMC_LC(c)) ||
5853 (ANYOF_CLASS_TEST(n, ANYOF_ALPHA) && isALPHA_LC(c)) ||
5854 (ANYOF_CLASS_TEST(n, ANYOF_NALPHA) && !isALPHA_LC(c)) ||
5855 (ANYOF_CLASS_TEST(n, ANYOF_ASCII) && isASCII(c)) ||
5856 (ANYOF_CLASS_TEST(n, ANYOF_NASCII) && !isASCII(c)) ||
5857 (ANYOF_CLASS_TEST(n, ANYOF_CNTRL) && isCNTRL_LC(c)) ||
5858 (ANYOF_CLASS_TEST(n, ANYOF_NCNTRL) && !isCNTRL_LC(c)) ||
5859 (ANYOF_CLASS_TEST(n, ANYOF_GRAPH) && isGRAPH_LC(c)) ||
5860 (ANYOF_CLASS_TEST(n, ANYOF_NGRAPH) && !isGRAPH_LC(c)) ||
5861 (ANYOF_CLASS_TEST(n, ANYOF_LOWER) && isLOWER_LC(c)) ||
5862 (ANYOF_CLASS_TEST(n, ANYOF_NLOWER) && !isLOWER_LC(c)) ||
5863 (ANYOF_CLASS_TEST(n, ANYOF_PRINT) && isPRINT_LC(c)) ||
5864 (ANYOF_CLASS_TEST(n, ANYOF_NPRINT) && !isPRINT_LC(c)) ||
5865 (ANYOF_CLASS_TEST(n, ANYOF_PUNCT) && isPUNCT_LC(c)) ||
5866 (ANYOF_CLASS_TEST(n, ANYOF_NPUNCT) && !isPUNCT_LC(c)) ||
5867 (ANYOF_CLASS_TEST(n, ANYOF_UPPER) && isUPPER_LC(c)) ||
5868 (ANYOF_CLASS_TEST(n, ANYOF_NUPPER) && !isUPPER_LC(c)) ||
5869 (ANYOF_CLASS_TEST(n, ANYOF_XDIGIT) && isXDIGIT(c)) ||
5870 (ANYOF_CLASS_TEST(n, ANYOF_NXDIGIT) && !isXDIGIT(c)) ||
5871 (ANYOF_CLASS_TEST(n, ANYOF_PSXSPC) && isPSXSPC(c)) ||
5872 (ANYOF_CLASS_TEST(n, ANYOF_NPSXSPC) && !isPSXSPC(c)) ||
5873 (ANYOF_CLASS_TEST(n, ANYOF_BLANK) && isBLANK(c)) ||
5874 (ANYOF_CLASS_TEST(n, ANYOF_NBLANK) && !isBLANK(c))
5875 ) /* How's that for a conditional? */
5882 return (flags & ANYOF_INVERT) ? !match : match;
5886 S_reghop3(U8 *s, I32 off, const U8* lim)
5890 PERL_ARGS_ASSERT_REGHOP3;
5893 while (off-- && s < lim) {
5894 /* XXX could check well-formedness here */
5899 while (off++ && s > lim) {
5901 if (UTF8_IS_CONTINUED(*s)) {
5902 while (s > lim && UTF8_IS_CONTINUATION(*s))
5905 /* XXX could check well-formedness here */
5912 /* there are a bunch of places where we use two reghop3's that should
5913 be replaced with this routine. but since thats not done yet
5914 we ifdef it out - dmq
5917 S_reghop4(U8 *s, I32 off, const U8* llim, const U8* rlim)
5921 PERL_ARGS_ASSERT_REGHOP4;
5924 while (off-- && s < rlim) {
5925 /* XXX could check well-formedness here */
5930 while (off++ && s > llim) {
5932 if (UTF8_IS_CONTINUED(*s)) {
5933 while (s > llim && UTF8_IS_CONTINUATION(*s))
5936 /* XXX could check well-formedness here */
5944 S_reghopmaybe3(U8* s, I32 off, const U8* lim)
5948 PERL_ARGS_ASSERT_REGHOPMAYBE3;
5951 while (off-- && s < lim) {
5952 /* XXX could check well-formedness here */
5959 while (off++ && s > lim) {
5961 if (UTF8_IS_CONTINUED(*s)) {
5962 while (s > lim && UTF8_IS_CONTINUATION(*s))
5965 /* XXX could check well-formedness here */
5974 restore_pos(pTHX_ void *arg)
5977 regexp * const rex = (regexp *)arg;
5978 if (PL_reg_eval_set) {
5979 if (PL_reg_oldsaved) {
5980 rex->subbeg = PL_reg_oldsaved;
5981 rex->sublen = PL_reg_oldsavedlen;
5982 #ifdef PERL_OLD_COPY_ON_WRITE
5983 rex->saved_copy = PL_nrs;
5985 RXp_MATCH_COPIED_on(rex);
5987 PL_reg_magic->mg_len = PL_reg_oldpos;
5988 PL_reg_eval_set = 0;
5989 PL_curpm = PL_reg_oldcurpm;
5994 S_to_utf8_substr(pTHX_ register regexp *prog)
5998 PERL_ARGS_ASSERT_TO_UTF8_SUBSTR;
6001 if (prog->substrs->data[i].substr
6002 && !prog->substrs->data[i].utf8_substr) {
6003 SV* const sv = newSVsv(prog->substrs->data[i].substr);
6004 prog->substrs->data[i].utf8_substr = sv;
6005 sv_utf8_upgrade(sv);
6006 if (SvVALID(prog->substrs->data[i].substr)) {
6007 const U8 flags = BmFLAGS(prog->substrs->data[i].substr);
6008 if (flags & FBMcf_TAIL) {
6009 /* Trim the trailing \n that fbm_compile added last
6011 SvCUR_set(sv, SvCUR(sv) - 1);
6012 /* Whilst this makes the SV technically "invalid" (as its
6013 buffer is no longer followed by "\0") when fbm_compile()
6014 adds the "\n" back, a "\0" is restored. */
6016 fbm_compile(sv, flags);
6018 if (prog->substrs->data[i].substr == prog->check_substr)
6019 prog->check_utf8 = sv;
6025 S_to_byte_substr(pTHX_ register regexp *prog)
6030 PERL_ARGS_ASSERT_TO_BYTE_SUBSTR;
6033 if (prog->substrs->data[i].utf8_substr
6034 && !prog->substrs->data[i].substr) {
6035 SV* sv = newSVsv(prog->substrs->data[i].utf8_substr);
6036 if (sv_utf8_downgrade(sv, TRUE)) {
6037 if (SvVALID(prog->substrs->data[i].utf8_substr)) {
6039 = BmFLAGS(prog->substrs->data[i].utf8_substr);
6040 if (flags & FBMcf_TAIL) {
6041 /* Trim the trailing \n that fbm_compile added last
6043 SvCUR_set(sv, SvCUR(sv) - 1);
6045 fbm_compile(sv, flags);
6051 prog->substrs->data[i].substr = sv;
6052 if (prog->substrs->data[i].utf8_substr == prog->check_utf8)
6053 prog->check_substr = sv;
6060 * c-indentation-style: bsd
6062 * indent-tabs-mode: t
6065 * ex: set ts=8 sts=4 sw=4 noet: