5 * "One Ring to rule them all, One Ring to find them..."
8 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
9 * confused with the original package (see point 3 below). Thanks, Henry!
12 /* Additional note: this code is very heavily munged from Henry's version
13 * in places. In some spots I've traded clarity for efficiency, so don't
14 * blame Henry for some of the lack of readability.
17 /* The names of the functions have been changed from regcomp and
18 * regexec to pregcomp and pregexec in order to avoid conflicts
19 * with the POSIX routines of the same names.
22 #ifdef PERL_EXT_RE_BUILD
23 /* need to replace pregcomp et al, so enable that */
24 # ifndef PERL_IN_XSUB_RE
25 # define PERL_IN_XSUB_RE
27 /* need access to debugger hooks */
28 # if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING)
33 #ifdef PERL_IN_XSUB_RE
34 /* We *really* need to overwrite these symbols: */
35 # define Perl_regexec_flags my_regexec
36 # define Perl_regdump my_regdump
37 # define Perl_regprop my_regprop
38 # define Perl_re_intuit_start my_re_intuit_start
39 /* *These* symbols are masked to allow static link. */
40 # define Perl_pregexec my_pregexec
41 # define Perl_reginitcolors my_reginitcolors
42 # define Perl_regclass_swash my_regclass_swash
44 # define PERL_NO_GET_CONTEXT
49 * pregcomp and pregexec -- regsub and regerror are not used in perl
51 * Copyright (c) 1986 by University of Toronto.
52 * Written by Henry Spencer. Not derived from licensed software.
54 * Permission is granted to anyone to use this software for any
55 * purpose on any computer system, and to redistribute it freely,
56 * subject to the following restrictions:
58 * 1. The author is not responsible for the consequences of use of
59 * this software, no matter how awful, even if they arise
62 * 2. The origin of this software must not be misrepresented, either
63 * by explicit claim or by omission.
65 * 3. Altered versions must be plainly marked as such, and must not
66 * be misrepresented as being the original software.
68 **** Alterations to Henry's code are...
70 **** Copyright (c) 1991-2001, Larry Wall
72 **** You may distribute under the terms of either the GNU General Public
73 **** License or the Artistic License, as specified in the README file.
75 * Beware that some of this code is subtly aware of the way operator
76 * precedence is structured in regular expressions. Serious changes in
77 * regular-expression syntax might require a total rethink.
80 #define PERL_IN_REGEXEC_C
83 #ifdef PERL_IN_XSUB_RE
84 # if defined(PERL_CAPI) || defined(PERL_OBJECT)
91 #define RF_tainted 1 /* tainted information used? */
92 #define RF_warned 2 /* warned about big count? */
93 #define RF_evaled 4 /* Did an EVAL with setting? */
94 #define RF_utf8 8 /* String contains multibyte chars? */
96 #define UTF (PL_reg_flags & RF_utf8)
98 #define RS_init 1 /* eval environment created */
99 #define RS_set 2 /* replsv value is set */
102 #define STATIC static
109 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
110 #define CHR_DIST(a,b) (DO_UTF8(PL_reg_sv) ? utf8_distance(a,b) : a - b)
112 #define reghop_c(pos,off) ((char*)reghop((U8*)pos, off))
113 #define reghopmaybe_c(pos,off) ((char*)reghopmaybe((U8*)pos, off))
114 #define HOP(pos,off) (DO_UTF8(PL_reg_sv) ? reghop((U8*)pos, off) : (U8*)(pos + off))
115 #define HOPMAYBE(pos,off) (DO_UTF8(PL_reg_sv) ? reghopmaybe((U8*)pos, off) : (U8*)(pos + off))
116 #define HOPc(pos,off) ((char*)HOP(pos,off))
117 #define HOPMAYBEc(pos,off) ((char*)HOPMAYBE(pos,off))
119 #define HOPBACK(pos, off) ( \
120 (UTF && DO_UTF8(PL_reg_sv)) \
121 ? reghopmaybe((U8*)pos, -off) \
122 : (pos - off >= PL_bostr) \
126 #define HOPBACKc(pos, off) (char*)HOPBACK(pos, off)
128 #define reghop3_c(pos,off,lim) ((char*)reghop3((U8*)pos, off, (U8*)lim))
129 #define reghopmaybe3_c(pos,off,lim) ((char*)reghopmaybe3((U8*)pos, off, (U8*)lim))
130 #define HOP3(pos,off,lim) (DO_UTF8(PL_reg_sv) ? reghop3((U8*)pos, off, (U8*)lim) : (U8*)(pos + off))
131 #define HOPMAYBE3(pos,off,lim) (DO_UTF8(PL_reg_sv) ? reghopmaybe3((U8*)pos, off, (U8*)lim) : (U8*)(pos + off))
132 #define HOP3c(pos,off,lim) ((char*)HOP3(pos,off,lim))
133 #define HOPMAYBE3c(pos,off,lim) ((char*)HOPMAYBE3(pos,off,lim))
135 #define LOAD_UTF8_CHARCLASS(a,b) STMT_START { if (!CAT2(PL_utf8_,a)) (void)CAT2(is_utf8_, a)((U8*)b); } STMT_END
137 static void restore_pos(pTHXo_ void *arg);
140 S_regcppush(pTHX_ I32 parenfloor)
142 int retval = PL_savestack_ix;
143 #define REGCP_PAREN_ELEMS 4
144 int paren_elems_to_push = (PL_regsize - parenfloor) * REGCP_PAREN_ELEMS;
147 if (paren_elems_to_push < 0)
148 Perl_croak(aTHX_ "panic: paren_elems_to_push < 0");
150 #define REGCP_OTHER_ELEMS 6
151 SSCHECK(paren_elems_to_push + REGCP_OTHER_ELEMS);
152 for (p = PL_regsize; p > parenfloor; p--) {
153 /* REGCP_PARENS_ELEMS are pushed per pairs of parentheses. */
154 SSPUSHINT(PL_regendp[p]);
155 SSPUSHINT(PL_regstartp[p]);
156 SSPUSHPTR(PL_reg_start_tmp[p]);
159 /* REGCP_OTHER_ELEMS are pushed in any case, parentheses or no. */
160 SSPUSHINT(PL_regsize);
161 SSPUSHINT(*PL_reglastparen);
162 SSPUSHINT(*PL_reglastcloseparen);
163 SSPUSHPTR(PL_reginput);
164 #define REGCP_FRAME_ELEMS 2
165 /* REGCP_FRAME_ELEMS are part of the REGCP_OTHER_ELEMS and
166 * are needed for the regexp context stack bookkeeping. */
167 SSPUSHINT(paren_elems_to_push + REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS);
168 SSPUSHINT(SAVEt_REGCONTEXT); /* Magic cookie. */
173 /* These are needed since we do not localize EVAL nodes: */
174 # define REGCP_SET(cp) DEBUG_r(PerlIO_printf(Perl_debug_log, \
175 " Setting an EVAL scope, savestack=%"IVdf"\n", \
176 (IV)PL_savestack_ix)); cp = PL_savestack_ix
178 # define REGCP_UNWIND(cp) DEBUG_r(cp != PL_savestack_ix ? \
179 PerlIO_printf(Perl_debug_log, \
180 " Clearing an EVAL scope, savestack=%"IVdf"..%"IVdf"\n", \
181 (IV)(cp), (IV)PL_savestack_ix) : 0); regcpblow(cp)
191 /* Pop REGCP_OTHER_ELEMS before the parentheses loop starts. */
193 assert(i == SAVEt_REGCONTEXT); /* Check that the magic cookie is there. */
194 i = SSPOPINT; /* Parentheses elements to pop. */
195 input = (char *) SSPOPPTR;
196 *PL_reglastcloseparen = SSPOPINT;
197 *PL_reglastparen = SSPOPINT;
198 PL_regsize = SSPOPINT;
200 /* Now restore the parentheses context. */
201 for (i -= (REGCP_OTHER_ELEMS - REGCP_FRAME_ELEMS);
202 i > 0; i -= REGCP_PAREN_ELEMS) {
203 paren = (U32)SSPOPINT;
204 PL_reg_start_tmp[paren] = (char *) SSPOPPTR;
205 PL_regstartp[paren] = SSPOPINT;
207 if (paren <= *PL_reglastparen)
208 PL_regendp[paren] = tmps;
210 PerlIO_printf(Perl_debug_log,
211 " restoring \\%"UVuf" to %"IVdf"(%"IVdf")..%"IVdf"%s\n",
212 (UV)paren, (IV)PL_regstartp[paren],
213 (IV)(PL_reg_start_tmp[paren] - PL_bostr),
214 (IV)PL_regendp[paren],
215 (paren > *PL_reglastparen ? "(no)" : ""));
219 if (*PL_reglastparen + 1 <= PL_regnpar) {
220 PerlIO_printf(Perl_debug_log,
221 " restoring \\%"IVdf"..\\%"IVdf" to undef\n",
222 (IV)(*PL_reglastparen + 1), (IV)PL_regnpar);
226 /* It would seem that the similar code in regtry()
227 * already takes care of this, and in fact it is in
228 * a better location to since this code can #if 0-ed out
229 * but the code in regtry() is needed or otherwise tests
230 * requiring null fields (pat.t#187 and split.t#{13,14}
231 * (as of patchlevel 7877) will fail. Then again,
232 * this code seems to be necessary or otherwise
233 * building DynaLoader will fail:
234 * "Error: '*' not in typemap in DynaLoader.xs, line 164"
236 for (paren = *PL_reglastparen + 1; paren <= PL_regnpar; paren++) {
237 if (paren > PL_regsize)
238 PL_regstartp[paren] = -1;
239 PL_regendp[paren] = -1;
246 S_regcp_set_to(pTHX_ I32 ss)
248 I32 tmp = PL_savestack_ix;
250 PL_savestack_ix = ss;
252 PL_savestack_ix = tmp;
256 typedef struct re_cc_state
260 struct re_cc_state *prev;
265 #define regcpblow(cp) LEAVE_SCOPE(cp) /* Ignores regcppush()ed data. */
267 #define TRYPAREN(paren, n, input) { \
270 PL_regstartp[paren] = HOPc(input, -1) - PL_bostr; \
271 PL_regendp[paren] = input - PL_bostr; \
274 PL_regendp[paren] = -1; \
276 if (regmatch(next)) \
279 PL_regendp[paren] = -1; \
284 * pregexec and friends
288 - pregexec - match a regexp against a string
291 Perl_pregexec(pTHX_ register regexp *prog, char *stringarg, register char *strend,
292 char *strbeg, I32 minend, SV *screamer, U32 nosave)
293 /* strend: pointer to null at end of string */
294 /* strbeg: real beginning of string */
295 /* minend: end of match must be >=minend after stringarg. */
296 /* nosave: For optimizations. */
299 regexec_flags(prog, stringarg, strend, strbeg, minend, screamer, NULL,
300 nosave ? 0 : REXEC_COPY_STR);
304 S_cache_re(pTHX_ regexp *prog)
306 PL_regprecomp = prog->precomp; /* Needed for FAIL. */
308 PL_regprogram = prog->program;
310 PL_regnpar = prog->nparens;
311 PL_regdata = prog->data;
316 * Need to implement the following flags for reg_anch:
318 * USE_INTUIT_NOML - Useful to call re_intuit_start() first
320 * INTUIT_AUTORITATIVE_NOML - Can trust a positive answer
321 * INTUIT_AUTORITATIVE_ML
322 * INTUIT_ONCE_NOML - Intuit can match in one location only.
325 * Another flag for this function: SECOND_TIME (so that float substrs
326 * with giant delta may be not rechecked).
329 /* Assumptions: if ANCH_GPOS, then strpos is anchored. XXXX Check GPOS logic */
331 /* If SCREAM, then SvPVX(sv) should be compatible with strpos and strend.
332 Otherwise, only SvCUR(sv) is used to get strbeg. */
334 /* XXXX We assume that strpos is strbeg unless sv. */
336 /* XXXX Some places assume that there is a fixed substring.
337 An update may be needed if optimizer marks as "INTUITable"
338 RExen without fixed substrings. Similarly, it is assumed that
339 lengths of all the strings are no more than minlen, thus they
340 cannot come from lookahead.
341 (Or minlen should take into account lookahead.) */
343 /* A failure to find a constant substring means that there is no need to make
344 an expensive call to REx engine, thus we celebrate a failure. Similarly,
345 finding a substring too deep into the string means that less calls to
346 regtry() should be needed.
348 REx compiler's optimizer found 4 possible hints:
349 a) Anchored substring;
351 c) Whether we are anchored (beginning-of-line or \G);
352 d) First node (of those at offset 0) which may distingush positions;
353 We use a)b)d) and multiline-part of c), and try to find a position in the
354 string which does not contradict any of them.
357 /* Most of decisions we do here should have been done at compile time.
358 The nodes of the REx which we used for the search should have been
359 deleted from the finite automaton. */
362 Perl_re_intuit_start(pTHX_ regexp *prog, SV *sv, char *strpos,
363 char *strend, U32 flags, re_scream_pos_data *data)
365 register I32 start_shift = 0;
366 /* Should be nonnegative! */
367 register I32 end_shift = 0;
373 register char *other_last = Nullch; /* other substr checked before this */
374 char *check_at = Nullch; /* check substr found at this pos */
376 char *i_strpos = strpos;
379 DEBUG_r( if (!PL_colorset) reginitcolors() );
380 DEBUG_r(PerlIO_printf(Perl_debug_log,
381 "%sGuessing start of match, REx%s `%s%.60s%s%s' against `%s%.*s%s%s'...\n",
382 PL_colors[4],PL_colors[5],PL_colors[0],
385 (strlen(prog->precomp) > 60 ? "..." : ""),
387 (int)(strend - strpos > 60 ? 60 : strend - strpos),
388 strpos, PL_colors[1],
389 (strend - strpos > 60 ? "..." : ""))
392 if (prog->reganch & ROPT_UTF8)
393 PL_reg_flags |= RF_utf8;
395 if (prog->minlen > CHR_DIST((U8*)strend, (U8*)strpos)) {
396 DEBUG_r(PerlIO_printf(Perl_debug_log, "String too short...\n"));
399 strbeg = (sv && SvPOK(sv)) ? strend - SvCUR(sv) : strpos;
401 check = prog->check_substr;
402 if (prog->reganch & ROPT_ANCH) { /* Match at beg-of-str or after \n */
403 ml_anch = !( (prog->reganch & ROPT_ANCH_SINGLE)
404 || ( (prog->reganch & ROPT_ANCH_BOL)
405 && !PL_multiline ) ); /* Check after \n? */
408 if ( !(prog->reganch & (ROPT_ANCH_GPOS /* Checked by the caller */
409 | ROPT_IMPLICIT)) /* not a real BOL */
410 /* SvCUR is not set on references: SvRV and SvPVX overlap */
412 && (strpos != strbeg)) {
413 DEBUG_r(PerlIO_printf(Perl_debug_log, "Not at start...\n"));
416 if (prog->check_offset_min == prog->check_offset_max &&
417 !(prog->reganch & ROPT_CANY_SEEN)) {
418 /* Substring at constant offset from beg-of-str... */
421 s = HOP3c(strpos, prog->check_offset_min, strend);
423 slen = SvCUR(check); /* >= 1 */
425 if ( strend - s > slen || strend - s < slen - 1
426 || (strend - s == slen && strend[-1] != '\n')) {
427 DEBUG_r(PerlIO_printf(Perl_debug_log, "String too long...\n"));
430 /* Now should match s[0..slen-2] */
432 if (slen && (*SvPVX(check) != *s
434 && memNE(SvPVX(check), s, slen)))) {
436 DEBUG_r(PerlIO_printf(Perl_debug_log, "String not equal...\n"));
440 else if (*SvPVX(check) != *s
441 || ((slen = SvCUR(check)) > 1
442 && memNE(SvPVX(check), s, slen)))
444 goto success_at_start;
447 /* Match is anchored, but substr is not anchored wrt beg-of-str. */
449 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
450 end_shift = prog->minlen - start_shift -
451 CHR_SVLEN(check) + (SvTAIL(check) != 0);
453 I32 end = prog->check_offset_max + CHR_SVLEN(check)
454 - (SvTAIL(check) != 0);
455 I32 eshift = CHR_DIST((U8*)strend, (U8*)s) - end;
457 if (end_shift < eshift)
461 else { /* Can match at random position */
464 start_shift = prog->check_offset_min; /* okay to underestimate on CC */
465 /* Should be nonnegative! */
466 end_shift = prog->minlen - start_shift -
467 CHR_SVLEN(check) + (SvTAIL(check) != 0);
470 #ifdef DEBUGGING /* 7/99: reports of failure (with the older version) */
472 Perl_croak(aTHX_ "panic: end_shift");
476 /* Find a possible match in the region s..strend by looking for
477 the "check" substring in the region corrected by start/end_shift. */
478 if (flags & REXEC_SCREAM) {
479 I32 p = -1; /* Internal iterator of scream. */
480 I32 *pp = data ? data->scream_pos : &p;
482 if (PL_screamfirst[BmRARE(check)] >= 0
483 || ( BmRARE(check) == '\n'
484 && (BmPREVIOUS(check) == SvCUR(check) - 1)
486 s = screaminstr(sv, check,
487 start_shift + (s - strbeg), end_shift, pp, 0);
491 *data->scream_olds = s;
493 else if (prog->reganch & ROPT_CANY_SEEN)
494 s = fbm_instr((U8*)(s + start_shift),
495 (U8*)(strend - end_shift),
496 check, PL_multiline ? FBMrf_MULTILINE : 0);
498 s = fbm_instr(HOP3(s, start_shift, strend),
499 HOP3(strend, -end_shift, strbeg),
500 check, PL_multiline ? FBMrf_MULTILINE : 0);
502 /* Update the count-of-usability, remove useless subpatterns,
505 DEBUG_r(PerlIO_printf(Perl_debug_log, "%s %s substr `%s%.*s%s'%s%s",
506 (s ? "Found" : "Did not find"),
507 ((check == prog->anchored_substr) ? "anchored" : "floating"),
509 (int)(SvCUR(check) - (SvTAIL(check)!=0)),
511 PL_colors[1], (SvTAIL(check) ? "$" : ""),
512 (s ? " at offset " : "...\n") ) );
519 /* Finish the diagnostic message */
520 DEBUG_r(PerlIO_printf(Perl_debug_log, "%ld...\n", (long)(s - i_strpos)) );
522 /* Got a candidate. Check MBOL anchoring, and the *other* substr.
523 Start with the other substr.
524 XXXX no SCREAM optimization yet - and a very coarse implementation
525 XXXX /ttx+/ results in anchored=`ttx', floating=`x'. floating will
526 *always* match. Probably should be marked during compile...
527 Probably it is right to do no SCREAM here...
530 if (prog->float_substr && prog->anchored_substr) {
531 /* Take into account the "other" substring. */
532 /* XXXX May be hopelessly wrong for UTF... */
535 if (check == prog->float_substr) {
538 char *last = HOP3c(s, -start_shift, strbeg), *last1, *last2;
541 t = s - prog->check_offset_max;
542 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
543 && (!(prog->reganch & ROPT_UTF8)
544 || ((t = reghopmaybe3_c(s, -(prog->check_offset_max), strpos))
549 t = HOP3c(t, prog->anchored_offset, strend);
550 if (t < other_last) /* These positions already checked */
552 last2 = last1 = HOP3c(strend, -prog->minlen, strbeg);
555 /* XXXX It is not documented what units *_offsets are in. Assume bytes. */
556 /* On end-of-str: see comment below. */
557 s = fbm_instr((unsigned char*)t,
558 HOP3(HOP3(last1, prog->anchored_offset, strend)
559 + SvCUR(prog->anchored_substr),
560 -(SvTAIL(prog->anchored_substr)!=0), strbeg),
561 prog->anchored_substr,
562 PL_multiline ? FBMrf_MULTILINE : 0);
563 DEBUG_r(PerlIO_printf(Perl_debug_log,
564 "%s anchored substr `%s%.*s%s'%s",
565 (s ? "Found" : "Contradicts"),
567 (int)(SvCUR(prog->anchored_substr)
568 - (SvTAIL(prog->anchored_substr)!=0)),
569 SvPVX(prog->anchored_substr),
570 PL_colors[1], (SvTAIL(prog->anchored_substr) ? "$" : "")));
572 if (last1 >= last2) {
573 DEBUG_r(PerlIO_printf(Perl_debug_log,
574 ", giving up...\n"));
577 DEBUG_r(PerlIO_printf(Perl_debug_log,
578 ", trying floating at offset %ld...\n",
579 (long)(HOP3c(s1, 1, strend) - i_strpos)));
580 other_last = HOP3c(last1, prog->anchored_offset+1, strend);
581 s = HOP3c(last, 1, strend);
585 DEBUG_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
586 (long)(s - i_strpos)));
587 t = HOP3c(s, -prog->anchored_offset, strbeg);
588 other_last = HOP3c(s, 1, strend);
596 else { /* Take into account the floating substring. */
600 t = HOP3c(s, -start_shift, strbeg);
602 HOP3c(strend, -prog->minlen + prog->float_min_offset, strbeg);
603 if (CHR_DIST((U8*)last, (U8*)t) > prog->float_max_offset)
604 last = HOP3c(t, prog->float_max_offset, strend);
605 s = HOP3c(t, prog->float_min_offset, strend);
608 /* XXXX It is not documented what units *_offsets are in. Assume bytes. */
609 /* fbm_instr() takes into account exact value of end-of-str
610 if the check is SvTAIL(ed). Since false positives are OK,
611 and end-of-str is not later than strend we are OK. */
612 s = fbm_instr((unsigned char*)s,
613 (unsigned char*)last + SvCUR(prog->float_substr)
614 - (SvTAIL(prog->float_substr)!=0),
615 prog->float_substr, PL_multiline ? FBMrf_MULTILINE : 0);
616 DEBUG_r(PerlIO_printf(Perl_debug_log, "%s floating substr `%s%.*s%s'%s",
617 (s ? "Found" : "Contradicts"),
619 (int)(SvCUR(prog->float_substr)
620 - (SvTAIL(prog->float_substr)!=0)),
621 SvPVX(prog->float_substr),
622 PL_colors[1], (SvTAIL(prog->float_substr) ? "$" : "")));
625 DEBUG_r(PerlIO_printf(Perl_debug_log,
626 ", giving up...\n"));
629 DEBUG_r(PerlIO_printf(Perl_debug_log,
630 ", trying anchored starting at offset %ld...\n",
631 (long)(s1 + 1 - i_strpos)));
633 s = HOP3c(t, 1, strend);
637 DEBUG_r(PerlIO_printf(Perl_debug_log, " at offset %ld...\n",
638 (long)(s - i_strpos)));
639 other_last = s; /* Fix this later. --Hugo */
648 t = s - prog->check_offset_max;
649 if (s - strpos > prog->check_offset_max /* signed-corrected t > strpos */
650 && (!(prog->reganch & ROPT_UTF8)
651 || ((t = reghopmaybe3_c(s, -prog->check_offset_max, strpos))
653 /* Fixed substring is found far enough so that the match
654 cannot start at strpos. */
656 if (ml_anch && t[-1] != '\n') {
657 /* Eventually fbm_*() should handle this, but often
658 anchored_offset is not 0, so this check will not be wasted. */
659 /* XXXX In the code below we prefer to look for "^" even in
660 presence of anchored substrings. And we search even
661 beyond the found float position. These pessimizations
662 are historical artefacts only. */
664 while (t < strend - prog->minlen) {
666 if (t < check_at - prog->check_offset_min) {
667 if (prog->anchored_substr) {
668 /* Since we moved from the found position,
669 we definitely contradict the found anchored
670 substr. Due to the above check we do not
671 contradict "check" substr.
672 Thus we can arrive here only if check substr
673 is float. Redo checking for "other"=="fixed".
676 DEBUG_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld, rescanning for anchored from offset %ld...\n",
677 PL_colors[0],PL_colors[1], (long)(strpos - i_strpos), (long)(strpos - i_strpos + prog->anchored_offset)));
678 goto do_other_anchored;
680 /* We don't contradict the found floating substring. */
681 /* XXXX Why not check for STCLASS? */
683 DEBUG_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m at offset %ld...\n",
684 PL_colors[0],PL_colors[1], (long)(s - i_strpos)));
687 /* Position contradicts check-string */
688 /* XXXX probably better to look for check-string
689 than for "\n", so one should lower the limit for t? */
690 DEBUG_r(PerlIO_printf(Perl_debug_log, "Found /%s^%s/m, restarting lookup for check-string at offset %ld...\n",
691 PL_colors[0],PL_colors[1], (long)(t + 1 - i_strpos)));
692 other_last = strpos = s = t + 1;
697 DEBUG_r(PerlIO_printf(Perl_debug_log, "Did not find /%s^%s/m...\n",
698 PL_colors[0],PL_colors[1]));
702 DEBUG_r(PerlIO_printf(Perl_debug_log, "Starting position does not contradict /%s^%s/m...\n",
703 PL_colors[0],PL_colors[1]));
707 ++BmUSEFUL(prog->check_substr); /* hooray/5 */
710 /* The found string does not prohibit matching at strpos,
711 - no optimization of calling REx engine can be performed,
712 unless it was an MBOL and we are not after MBOL,
713 or a future STCLASS check will fail this. */
715 /* Even in this situation we may use MBOL flag if strpos is offset
716 wrt the start of the string. */
717 if (ml_anch && sv && !SvROK(sv) /* See prev comment on SvROK */
718 && (strpos != strbeg) && strpos[-1] != '\n'
719 /* May be due to an implicit anchor of m{.*foo} */
720 && !(prog->reganch & ROPT_IMPLICIT))
725 DEBUG_r( if (ml_anch)
726 PerlIO_printf(Perl_debug_log, "Position at offset %ld does not contradict /%s^%s/m...\n",
727 (long)(strpos - i_strpos), PL_colors[0],PL_colors[1]);
730 if (!(prog->reganch & ROPT_NAUGHTY) /* XXXX If strpos moved? */
731 && prog->check_substr /* Could be deleted already */
732 && --BmUSEFUL(prog->check_substr) < 0
733 && prog->check_substr == prog->float_substr)
735 /* If flags & SOMETHING - do not do it many times on the same match */
736 DEBUG_r(PerlIO_printf(Perl_debug_log, "... Disabling check substring...\n"));
737 SvREFCNT_dec(prog->check_substr);
738 prog->check_substr = Nullsv; /* disable */
739 prog->float_substr = Nullsv; /* clear */
740 check = Nullsv; /* abort */
742 /* XXXX This is a remnant of the old implementation. It
743 looks wasteful, since now INTUIT can use many
745 prog->reganch &= ~RE_USE_INTUIT;
752 /* XXXX BmUSEFUL already changed, maybe multiple change is meaningful... */
753 if (prog->regstclass) {
754 /* minlen == 0 is possible if regstclass is \b or \B,
755 and the fixed substr is ''$.
756 Since minlen is already taken into account, s+1 is before strend;
757 accidentally, minlen >= 1 guaranties no false positives at s + 1
758 even for \b or \B. But (minlen? 1 : 0) below assumes that
759 regstclass does not come from lookahead... */
760 /* If regstclass takes bytelength more than 1: If charlength==1, OK.
761 This leaves EXACTF only, which is dealt with in find_byclass(). */
762 U8* str = (U8*)STRING(prog->regstclass);
763 int cl_l = (PL_regkind[(U8)OP(prog->regstclass)] == EXACT
764 ? CHR_DIST(str+STR_LEN(prog->regstclass), str)
766 char *endpos = (prog->anchored_substr || ml_anch)
767 ? HOP3c(s, (prog->minlen ? cl_l : 0), strend)
768 : (prog->float_substr
769 ? HOP3c(HOP3c(check_at, -start_shift, strbeg),
772 char *startpos = strbeg;
775 if (prog->reganch & ROPT_UTF8) {
776 PL_regdata = prog->data;
779 s = find_byclass(prog, prog->regstclass, s, endpos, startpos, 1);
784 if (endpos == strend) {
785 DEBUG_r( PerlIO_printf(Perl_debug_log,
786 "Could not match STCLASS...\n") );
789 DEBUG_r( PerlIO_printf(Perl_debug_log,
790 "This position contradicts STCLASS...\n") );
791 if ((prog->reganch & ROPT_ANCH) && !ml_anch)
793 /* Contradict one of substrings */
794 if (prog->anchored_substr) {
795 if (prog->anchored_substr == check) {
796 DEBUG_r( what = "anchored" );
798 s = HOP3c(t, 1, strend);
799 if (s + start_shift + end_shift > strend) {
800 /* XXXX Should be taken into account earlier? */
801 DEBUG_r( PerlIO_printf(Perl_debug_log,
802 "Could not match STCLASS...\n") );
807 DEBUG_r( PerlIO_printf(Perl_debug_log,
808 "Looking for %s substr starting at offset %ld...\n",
809 what, (long)(s + start_shift - i_strpos)) );
812 /* Have both, check_string is floating */
813 if (t + start_shift >= check_at) /* Contradicts floating=check */
814 goto retry_floating_check;
815 /* Recheck anchored substring, but not floating... */
819 DEBUG_r( PerlIO_printf(Perl_debug_log,
820 "Looking for anchored substr starting at offset %ld...\n",
821 (long)(other_last - i_strpos)) );
822 goto do_other_anchored;
824 /* Another way we could have checked stclass at the
825 current position only: */
830 DEBUG_r( PerlIO_printf(Perl_debug_log,
831 "Looking for /%s^%s/m starting at offset %ld...\n",
832 PL_colors[0],PL_colors[1], (long)(t - i_strpos)) );
835 if (!prog->float_substr) /* Could have been deleted */
837 /* Check is floating subtring. */
838 retry_floating_check:
839 t = check_at - start_shift;
840 DEBUG_r( what = "floating" );
841 goto hop_and_restart;
844 DEBUG_r(PerlIO_printf(Perl_debug_log,
845 "By STCLASS: moving %ld --> %ld\n",
846 (long)(t - i_strpos), (long)(s - i_strpos))
850 DEBUG_r(PerlIO_printf(Perl_debug_log,
851 "Does not contradict STCLASS...\n");
856 DEBUG_r(PerlIO_printf(Perl_debug_log, "%s%s:%s match at offset %ld\n",
857 PL_colors[4], (check ? "Guessed" : "Giving up"),
858 PL_colors[5], (long)(s - i_strpos)) );
861 fail_finish: /* Substring not found */
862 if (prog->check_substr) /* could be removed already */
863 BmUSEFUL(prog->check_substr) += 5; /* hooray */
865 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sMatch rejected by optimizer%s\n",
866 PL_colors[4],PL_colors[5]));
870 /* We know what class REx starts with. Try to find this position... */
872 S_find_byclass(pTHX_ regexp * prog, regnode *c, char *s, char *strend, char *startpos, I32 norun)
874 I32 doevery = (prog->reganch & ROPT_SKIP) == 0;
880 register I32 tmp = 1; /* Scratch variable? */
881 register bool do_utf8 = DO_UTF8(PL_reg_sv);
883 /* We know what class it must start with. */
887 if (reginclass(c, (U8*)s, do_utf8)) {
888 if (tmp && (norun || regtry(prog, s)))
895 s += do_utf8 ? UTF8SKIP(s) : 1;
900 if (tmp && (norun || regtry(prog, s)))
911 c1 = to_utf8_lower((U8*)m);
912 c2 = to_utf8_upper((U8*)m);
923 c2 = PL_fold_locale[c1];
928 e = s; /* Due to minlen logic of intuit() */
934 if ( utf8_to_uvchr((U8*)s, &len) == c1
941 UV c = utf8_to_uvchr((U8*)s, &len);
942 if ( (c == c1 || c == c2) && regtry(prog, s) )
951 && (ln == 1 || !(OP(c) == EXACTF
953 : ibcmp_locale(s, m, ln)))
954 && (norun || regtry(prog, s)) )
960 if ( (*(U8*)s == c1 || *(U8*)s == c2)
961 && (ln == 1 || !(OP(c) == EXACTF
963 : ibcmp_locale(s, m, ln)))
964 && (norun || regtry(prog, s)) )
971 PL_reg_flags |= RF_tainted;
978 U8 *r = reghop3((U8*)s, -1, (U8*)startpos);
981 tmp = (I32)utf8n_to_uvchr(r, s - (char*)r, 0, 0);
983 tmp = ((OP(c) == BOUND ?
984 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
985 LOAD_UTF8_CHARCLASS(alnum,"a");
987 if (tmp == !(OP(c) == BOUND ?
988 swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) :
989 isALNUM_LC_utf8((U8*)s)))
992 if ((norun || regtry(prog, s)))
999 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1000 tmp = ((OP(c) == BOUND ? isALNUM(tmp) : isALNUM_LC(tmp)) != 0);
1001 while (s < strend) {
1003 !(OP(c) == BOUND ? isALNUM(*s) : isALNUM_LC(*s))) {
1005 if ((norun || regtry(prog, s)))
1011 if ((!prog->minlen && tmp) && (norun || regtry(prog, s)))
1015 PL_reg_flags |= RF_tainted;
1022 U8 *r = reghop3((U8*)s, -1, (U8*)startpos);
1025 tmp = (I32)utf8n_to_uvchr(r, s - (char*)r, 0, 0);
1027 tmp = ((OP(c) == NBOUND ?
1028 isALNUM_uni(tmp) : isALNUM_LC_uvchr(UNI_TO_NATIVE(tmp))) != 0);
1029 LOAD_UTF8_CHARCLASS(alnum,"a");
1030 while (s < strend) {
1031 if (tmp == !(OP(c) == NBOUND ?
1032 swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8) :
1033 isALNUM_LC_utf8((U8*)s)))
1035 else if ((norun || regtry(prog, s)))
1041 tmp = (s != PL_bostr) ? UCHARAT(s - 1) : '\n';
1042 tmp = ((OP(c) == NBOUND ?
1043 isALNUM(tmp) : isALNUM_LC(tmp)) != 0);
1044 while (s < strend) {
1046 !(OP(c) == NBOUND ? isALNUM(*s) : isALNUM_LC(*s)))
1048 else if ((norun || regtry(prog, s)))
1053 if ((!prog->minlen && !tmp) && (norun || regtry(prog, s)))
1058 LOAD_UTF8_CHARCLASS(alnum,"a");
1059 while (s < strend) {
1060 if (swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8)) {
1061 if (tmp && (norun || regtry(prog, s)))
1072 while (s < strend) {
1074 if (tmp && (norun || regtry(prog, s)))
1086 PL_reg_flags |= RF_tainted;
1088 while (s < strend) {
1089 if (isALNUM_LC_utf8((U8*)s)) {
1090 if (tmp && (norun || regtry(prog, s)))
1101 while (s < strend) {
1102 if (isALNUM_LC(*s)) {
1103 if (tmp && (norun || regtry(prog, s)))
1116 LOAD_UTF8_CHARCLASS(alnum,"a");
1117 while (s < strend) {
1118 if (!swash_fetch(PL_utf8_alnum, (U8*)s, do_utf8)) {
1119 if (tmp && (norun || regtry(prog, s)))
1130 while (s < strend) {
1132 if (tmp && (norun || regtry(prog, s)))
1144 PL_reg_flags |= RF_tainted;
1146 while (s < strend) {
1147 if (!isALNUM_LC_utf8((U8*)s)) {
1148 if (tmp && (norun || regtry(prog, s)))
1159 while (s < strend) {
1160 if (!isALNUM_LC(*s)) {
1161 if (tmp && (norun || regtry(prog, s)))
1174 LOAD_UTF8_CHARCLASS(space," ");
1175 while (s < strend) {
1176 if (*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8)) {
1177 if (tmp && (norun || regtry(prog, s)))
1188 while (s < strend) {
1190 if (tmp && (norun || regtry(prog, s)))
1202 PL_reg_flags |= RF_tainted;
1204 while (s < strend) {
1205 if (*s == ' ' || isSPACE_LC_utf8((U8*)s)) {
1206 if (tmp && (norun || regtry(prog, s)))
1217 while (s < strend) {
1218 if (isSPACE_LC(*s)) {
1219 if (tmp && (norun || regtry(prog, s)))
1232 LOAD_UTF8_CHARCLASS(space," ");
1233 while (s < strend) {
1234 if (!(*s == ' ' || swash_fetch(PL_utf8_space,(U8*)s, do_utf8))) {
1235 if (tmp && (norun || regtry(prog, s)))
1246 while (s < strend) {
1248 if (tmp && (norun || regtry(prog, s)))
1260 PL_reg_flags |= RF_tainted;
1262 while (s < strend) {
1263 if (!(*s == ' ' || isSPACE_LC_utf8((U8*)s))) {
1264 if (tmp && (norun || regtry(prog, s)))
1275 while (s < strend) {
1276 if (!isSPACE_LC(*s)) {
1277 if (tmp && (norun || regtry(prog, s)))
1290 LOAD_UTF8_CHARCLASS(digit,"0");
1291 while (s < strend) {
1292 if (swash_fetch(PL_utf8_digit,(U8*)s, do_utf8)) {
1293 if (tmp && (norun || regtry(prog, s)))
1304 while (s < strend) {
1306 if (tmp && (norun || regtry(prog, s)))
1318 PL_reg_flags |= RF_tainted;
1320 while (s < strend) {
1321 if (isDIGIT_LC_utf8((U8*)s)) {
1322 if (tmp && (norun || regtry(prog, s)))
1333 while (s < strend) {
1334 if (isDIGIT_LC(*s)) {
1335 if (tmp && (norun || regtry(prog, s)))
1348 LOAD_UTF8_CHARCLASS(digit,"0");
1349 while (s < strend) {
1350 if (!swash_fetch(PL_utf8_digit,(U8*)s, do_utf8)) {
1351 if (tmp && (norun || regtry(prog, s)))
1362 while (s < strend) {
1364 if (tmp && (norun || regtry(prog, s)))
1376 PL_reg_flags |= RF_tainted;
1378 while (s < strend) {
1379 if (!isDIGIT_LC_utf8((U8*)s)) {
1380 if (tmp && (norun || regtry(prog, s)))
1391 while (s < strend) {
1392 if (!isDIGIT_LC(*s)) {
1393 if (tmp && (norun || regtry(prog, s)))
1405 Perl_croak(aTHX_ "panic: unknown regstclass %d", (int)OP(c));
1414 - regexec_flags - match a regexp against a string
1417 Perl_regexec_flags(pTHX_ register regexp *prog, char *stringarg, register char *strend,
1418 char *strbeg, I32 minend, SV *sv, void *data, U32 flags)
1419 /* strend: pointer to null at end of string */
1420 /* strbeg: real beginning of string */
1421 /* minend: end of match must be >=minend after stringarg. */
1422 /* data: May be used for some additional optimizations. */
1423 /* nosave: For optimizations. */
1426 register regnode *c;
1427 register char *startpos = stringarg;
1428 I32 minlen; /* must match at least this many chars */
1429 I32 dontbother = 0; /* how many characters not to try at end */
1430 /* I32 start_shift = 0; */ /* Offset of the start to find
1431 constant substr. */ /* CC */
1432 I32 end_shift = 0; /* Same for the end. */ /* CC */
1433 I32 scream_pos = -1; /* Internal iterator of scream. */
1435 SV* oreplsv = GvSV(PL_replgv);
1436 bool do_utf8 = DO_UTF8(sv);
1442 PL_regnarrate = DEBUG_r_TEST;
1445 /* Be paranoid... */
1446 if (prog == NULL || startpos == NULL) {
1447 Perl_croak(aTHX_ "NULL regexp parameter");
1451 minlen = prog->minlen;
1452 if (do_utf8 && !(prog->reganch & ROPT_CANY_SEEN)) {
1453 if (utf8_distance((U8*)strend, (U8*)startpos) < minlen) goto phooey;
1456 if (strend - startpos < minlen) goto phooey;
1459 /* Check validity of program. */
1460 if (UCHARAT(prog->program) != REG_MAGIC) {
1461 Perl_croak(aTHX_ "corrupted regexp program");
1465 PL_reg_eval_set = 0;
1468 if (prog->reganch & ROPT_UTF8)
1469 PL_reg_flags |= RF_utf8;
1471 /* Mark beginning of line for ^ and lookbehind. */
1472 PL_regbol = startpos;
1476 /* Mark end of line for $ (and such) */
1479 /* see how far we have to get to not match where we matched before */
1480 PL_regtill = startpos+minend;
1482 /* We start without call_cc context. */
1485 /* If there is a "must appear" string, look for it. */
1488 if (prog->reganch & ROPT_GPOS_SEEN) { /* Need to have PL_reg_ganch */
1491 if (flags & REXEC_IGNOREPOS) /* Means: check only at start */
1492 PL_reg_ganch = startpos;
1493 else if (sv && SvTYPE(sv) >= SVt_PVMG
1495 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
1496 && mg->mg_len >= 0) {
1497 PL_reg_ganch = strbeg + mg->mg_len; /* Defined pos() */
1498 if (prog->reganch & ROPT_ANCH_GPOS) {
1499 if (s > PL_reg_ganch)
1504 else /* pos() not defined */
1505 PL_reg_ganch = strbeg;
1508 if (do_utf8 == (UTF!=0) &&
1509 !(flags & REXEC_CHECKED) && prog->check_substr != Nullsv) {
1510 re_scream_pos_data d;
1512 d.scream_olds = &scream_olds;
1513 d.scream_pos = &scream_pos;
1514 s = re_intuit_start(prog, sv, s, strend, flags, &d);
1516 goto phooey; /* not present */
1519 DEBUG_r( if (!PL_colorset) reginitcolors() );
1520 DEBUG_r(PerlIO_printf(Perl_debug_log,
1521 "%sMatching REx%s `%s%.60s%s%s' against `%s%.*s%s%s'\n",
1522 PL_colors[4],PL_colors[5],PL_colors[0],
1525 (strlen(prog->precomp) > 60 ? "..." : ""),
1527 (int)(strend - startpos > 60 ? 60 : strend - startpos),
1528 startpos, PL_colors[1],
1529 (strend - startpos > 60 ? "..." : ""))
1532 /* Simplest case: anchored match need be tried only once. */
1533 /* [unless only anchor is BOL and multiline is set] */
1534 if (prog->reganch & (ROPT_ANCH & ~ROPT_ANCH_GPOS)) {
1535 if (s == startpos && regtry(prog, startpos))
1537 else if (PL_multiline || (prog->reganch & ROPT_IMPLICIT)
1538 || (prog->reganch & ROPT_ANCH_MBOL)) /* XXXX SBOL? */
1543 dontbother = minlen - 1;
1544 end = HOP3c(strend, -dontbother, strbeg) - 1;
1545 /* for multiline we only have to try after newlines */
1546 if (prog->check_substr) {
1550 if (regtry(prog, s))
1555 if (prog->reganch & RE_USE_INTUIT) {
1556 s = re_intuit_start(prog, sv, s + 1, strend, flags, NULL);
1567 if (*s++ == '\n') { /* don't need PL_utf8skip here */
1568 if (regtry(prog, s))
1575 } else if (prog->reganch & ROPT_ANCH_GPOS) {
1576 if (regtry(prog, PL_reg_ganch))
1581 /* Messy cases: unanchored match. */
1582 if (prog->anchored_substr && prog->reganch & ROPT_SKIP) {
1583 /* we have /x+whatever/ */
1584 /* it must be a one character string (XXXX Except UTF?) */
1585 char ch = SvPVX(prog->anchored_substr)[0];
1591 while (s < strend) {
1593 DEBUG_r( did_match = 1 );
1594 if (regtry(prog, s)) goto got_it;
1596 while (s < strend && *s == ch)
1603 while (s < strend) {
1605 DEBUG_r( did_match = 1 );
1606 if (regtry(prog, s)) goto got_it;
1608 while (s < strend && *s == ch)
1614 DEBUG_r(if (!did_match)
1615 PerlIO_printf(Perl_debug_log,
1616 "Did not find anchored character...\n")
1620 else if (do_utf8 == (UTF!=0) &&
1621 (prog->anchored_substr != Nullsv
1622 || (prog->float_substr != Nullsv
1623 && prog->float_max_offset < strend - s))) {
1624 SV *must = prog->anchored_substr
1625 ? prog->anchored_substr : prog->float_substr;
1627 prog->anchored_substr ? prog->anchored_offset : prog->float_max_offset;
1629 prog->anchored_substr ? prog->anchored_offset : prog->float_min_offset;
1630 char *last = HOP3c(strend, /* Cannot start after this */
1631 -(I32)(CHR_SVLEN(must)
1632 - (SvTAIL(must) != 0) + back_min), strbeg);
1633 char *last1; /* Last position checked before */
1639 last1 = HOPc(s, -1);
1641 last1 = s - 1; /* bogus */
1643 /* XXXX check_substr already used to find `s', can optimize if
1644 check_substr==must. */
1646 dontbother = end_shift;
1647 strend = HOPc(strend, -dontbother);
1648 while ( (s <= last) &&
1649 ((flags & REXEC_SCREAM)
1650 ? (s = screaminstr(sv, must, HOP3c(s, back_min, strend) - strbeg,
1651 end_shift, &scream_pos, 0))
1652 : (s = fbm_instr((unsigned char*)HOP3(s, back_min, strend),
1653 (unsigned char*)strend, must,
1654 PL_multiline ? FBMrf_MULTILINE : 0))) ) {
1655 DEBUG_r( did_match = 1 );
1656 if (HOPc(s, -back_max) > last1) {
1657 last1 = HOPc(s, -back_min);
1658 s = HOPc(s, -back_max);
1661 char *t = (last1 >= PL_bostr) ? HOPc(last1, 1) : last1 + 1;
1663 last1 = HOPc(s, -back_min);
1667 while (s <= last1) {
1668 if (regtry(prog, s))
1674 while (s <= last1) {
1675 if (regtry(prog, s))
1681 DEBUG_r(if (!did_match)
1682 PerlIO_printf(Perl_debug_log,
1683 "Did not find %s substr `%s%.*s%s'%s...\n",
1684 ((must == prog->anchored_substr)
1685 ? "anchored" : "floating"),
1687 (int)(SvCUR(must) - (SvTAIL(must)!=0)),
1689 PL_colors[1], (SvTAIL(must) ? "$" : ""))
1693 else if ((c = prog->regstclass)) {
1694 if (minlen && PL_regkind[(U8)OP(prog->regstclass)] != EXACT)
1695 /* don't bother with what can't match */
1696 strend = HOPc(strend, -(minlen - 1));
1698 SV *prop = sv_newmortal();
1700 PerlIO_printf(Perl_debug_log, "Matching stclass `%s' against `%s'\n", SvPVX(prop), s);
1702 if (find_byclass(prog, c, s, strend, startpos, 0))
1704 DEBUG_r(PerlIO_printf(Perl_debug_log, "Contradicts stclass...\n"));
1708 if (prog->float_substr != Nullsv) { /* Trim the end. */
1711 if (flags & REXEC_SCREAM) {
1712 last = screaminstr(sv, prog->float_substr, s - strbeg,
1713 end_shift, &scream_pos, 1); /* last one */
1715 last = scream_olds; /* Only one occurrence. */
1719 char *little = SvPV(prog->float_substr, len);
1721 if (SvTAIL(prog->float_substr)) {
1722 if (memEQ(strend - len + 1, little, len - 1))
1723 last = strend - len + 1;
1724 else if (!PL_multiline)
1725 last = memEQ(strend - len, little, len)
1726 ? strend - len : Nullch;
1732 last = rninstr(s, strend, little, little + len);
1734 last = strend; /* matching `$' */
1738 DEBUG_r(PerlIO_printf(Perl_debug_log,
1739 "%sCan't trim the tail, match fails (should not happen)%s\n",
1740 PL_colors[4],PL_colors[5]));
1741 goto phooey; /* Should not happen! */
1743 dontbother = strend - last + prog->float_min_offset;
1745 if (minlen && (dontbother < minlen))
1746 dontbother = minlen - 1;
1747 strend -= dontbother; /* this one's always in bytes! */
1748 /* We don't know much -- general case. */
1751 if (regtry(prog, s))
1760 if (regtry(prog, s))
1762 } while (s++ < strend);
1770 RX_MATCH_TAINTED_set(prog, PL_reg_flags & RF_tainted);
1772 if (PL_reg_eval_set) {
1773 /* Preserve the current value of $^R */
1774 if (oreplsv != GvSV(PL_replgv))
1775 sv_setsv(oreplsv, GvSV(PL_replgv));/* So that when GvSV(replgv) is
1776 restored, the value remains
1778 restore_pos(aTHXo_ 0);
1781 /* make sure $`, $&, $', and $digit will work later */
1782 if ( !(flags & REXEC_NOT_FIRST) ) {
1783 if (RX_MATCH_COPIED(prog)) {
1784 Safefree(prog->subbeg);
1785 RX_MATCH_COPIED_off(prog);
1787 if (flags & REXEC_COPY_STR) {
1788 I32 i = PL_regeol - startpos + (stringarg - strbeg);
1790 s = savepvn(strbeg, i);
1793 RX_MATCH_COPIED_on(prog);
1796 prog->subbeg = strbeg;
1797 prog->sublen = PL_regeol - strbeg; /* strend may have been modified */
1804 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sMatch failed%s\n",
1805 PL_colors[4],PL_colors[5]));
1806 if (PL_reg_eval_set)
1807 restore_pos(aTHXo_ 0);
1812 - regtry - try match at specific point
1814 STATIC I32 /* 0 failure, 1 success */
1815 S_regtry(pTHX_ regexp *prog, char *startpos)
1823 PL_regindent = 0; /* XXXX Not good when matches are reenterable... */
1825 if ((prog->reganch & ROPT_EVAL_SEEN) && !PL_reg_eval_set) {
1828 PL_reg_eval_set = RS_init;
1830 PerlIO_printf(Perl_debug_log, " setting stack tmpbase at %"IVdf"\n",
1831 (IV)(PL_stack_sp - PL_stack_base));
1833 SAVEI32(cxstack[cxstack_ix].blk_oldsp);
1834 cxstack[cxstack_ix].blk_oldsp = PL_stack_sp - PL_stack_base;
1835 /* Otherwise OP_NEXTSTATE will free whatever on stack now. */
1837 /* Apparently this is not needed, judging by wantarray. */
1838 /* SAVEI8(cxstack[cxstack_ix].blk_gimme);
1839 cxstack[cxstack_ix].blk_gimme = G_SCALAR; */
1842 /* Make $_ available to executed code. */
1843 if (PL_reg_sv != DEFSV) {
1844 /* SAVE_DEFSV does *not* suffice here for USE_THREADS */
1849 if (!(SvTYPE(PL_reg_sv) >= SVt_PVMG && SvMAGIC(PL_reg_sv)
1850 && (mg = mg_find(PL_reg_sv, PERL_MAGIC_regex_global)))) {
1851 /* prepare for quick setting of pos */
1852 sv_magic(PL_reg_sv, (SV*)0,
1853 PERL_MAGIC_regex_global, Nullch, 0);
1854 mg = mg_find(PL_reg_sv, PERL_MAGIC_regex_global);
1858 PL_reg_oldpos = mg->mg_len;
1859 SAVEDESTRUCTOR_X(restore_pos, 0);
1861 if (!PL_reg_curpm) {
1862 Newz(22,PL_reg_curpm, 1, PMOP);
1865 SV* repointer = newSViv(0);
1866 /* so we know which PL_regex_padav element is PL_reg_curpm */
1867 SvFLAGS(repointer) |= SVf_BREAK;
1868 av_push(PL_regex_padav,repointer);
1869 PL_reg_curpm->op_pmoffset = av_len(PL_regex_padav);
1870 PL_regex_pad = AvARRAY(PL_regex_padav);
1874 PM_SETRE(PL_reg_curpm, prog);
1875 PL_reg_oldcurpm = PL_curpm;
1876 PL_curpm = PL_reg_curpm;
1877 if (RX_MATCH_COPIED(prog)) {
1878 /* Here is a serious problem: we cannot rewrite subbeg,
1879 since it may be needed if this match fails. Thus
1880 $` inside (?{}) could fail... */
1881 PL_reg_oldsaved = prog->subbeg;
1882 PL_reg_oldsavedlen = prog->sublen;
1883 RX_MATCH_COPIED_off(prog);
1886 PL_reg_oldsaved = Nullch;
1887 prog->subbeg = PL_bostr;
1888 prog->sublen = PL_regeol - PL_bostr; /* strend may have been modified */
1890 prog->startp[0] = startpos - PL_bostr;
1891 PL_reginput = startpos;
1892 PL_regstartp = prog->startp;
1893 PL_regendp = prog->endp;
1894 PL_reglastparen = &prog->lastparen;
1895 PL_reglastcloseparen = &prog->lastcloseparen;
1896 prog->lastparen = 0;
1898 DEBUG_r(PL_reg_starttry = startpos);
1899 if (PL_reg_start_tmpl <= prog->nparens) {
1900 PL_reg_start_tmpl = prog->nparens*3/2 + 3;
1901 if(PL_reg_start_tmp)
1902 Renew(PL_reg_start_tmp, PL_reg_start_tmpl, char*);
1904 New(22,PL_reg_start_tmp, PL_reg_start_tmpl, char*);
1907 /* XXXX What this code is doing here?!!! There should be no need
1908 to do this again and again, PL_reglastparen should take care of
1911 /* Tests pat.t#187 and split.t#{13,14} seem to depend on this code.
1912 * Actually, the code in regcppop() (which Ilya may be meaning by
1913 * PL_reglastparen), is not needed at all by the test suite
1914 * (op/regexp, op/pat, op/split), but that code is needed, oddly
1915 * enough, for building DynaLoader, or otherwise this
1916 * "Error: '*' not in typemap in DynaLoader.xs, line 164"
1917 * will happen. Meanwhile, this code *is* needed for the
1918 * above-mentioned test suite tests to succeed. The common theme
1919 * on those tests seems to be returning null fields from matches.
1924 if (prog->nparens) {
1925 for (i = prog->nparens; i > *PL_reglastparen; i--) {
1932 if (regmatch(prog->program + 1)) {
1933 prog->endp[0] = PL_reginput - PL_bostr;
1936 REGCP_UNWIND(lastcp);
1940 #define RE_UNWIND_BRANCH 1
1941 #define RE_UNWIND_BRANCHJ 2
1945 typedef struct { /* XX: makes sense to enlarge it... */
1949 } re_unwind_generic_t;
1962 } re_unwind_branch_t;
1964 typedef union re_unwind_t {
1966 re_unwind_generic_t generic;
1967 re_unwind_branch_t branch;
1970 #define sayYES goto yes
1971 #define sayNO goto no
1972 #define sayYES_FINAL goto yes_final
1973 #define sayYES_LOUD goto yes_loud
1974 #define sayNO_FINAL goto no_final
1975 #define sayNO_SILENT goto do_no
1976 #define saySAME(x) if (x) goto yes; else goto no
1978 #define REPORT_CODE_OFF 24
1981 - regmatch - main matching routine
1983 * Conceptually the strategy is simple: check to see whether the current
1984 * node matches, call self recursively to see whether the rest matches,
1985 * and then act accordingly. In practice we make some effort to avoid
1986 * recursion, in particular by going through "ordinary" nodes (that don't
1987 * need to know whether the rest of the match failed) by a loop instead of
1990 /* [lwall] I've hoisted the register declarations to the outer block in order to
1991 * maybe save a little bit of pushing and popping on the stack. It also takes
1992 * advantage of machines that use a register save mask on subroutine entry.
1994 STATIC I32 /* 0 failure, 1 success */
1995 S_regmatch(pTHX_ regnode *prog)
1997 register regnode *scan; /* Current node. */
1998 regnode *next; /* Next node. */
1999 regnode *inner; /* Next node in internal branch. */
2000 register I32 nextchr; /* renamed nextchr - nextchar colides with
2001 function of same name */
2002 register I32 n; /* no or next */
2003 register I32 ln = 0; /* len or last */
2004 register char *s = Nullch; /* operand or save */
2005 register char *locinput = PL_reginput;
2006 register I32 c1 = 0, c2 = 0, paren; /* case fold search, parenth */
2007 int minmod = 0, sw = 0, logical = 0;
2010 I32 firstcp = PL_savestack_ix;
2012 register bool do_utf8 = DO_UTF8(PL_reg_sv);
2018 /* Note that nextchr is a byte even in UTF */
2019 nextchr = UCHARAT(locinput);
2021 while (scan != NULL) {
2024 SV *prop = sv_newmortal();
2025 int docolor = *PL_colors[0];
2026 int taill = (docolor ? 10 : 7); /* 3 chars for "> <" */
2027 int l = (PL_regeol - locinput) > taill ? taill : (PL_regeol - locinput);
2028 /* The part of the string before starttry has one color
2029 (pref0_len chars), between starttry and current
2030 position another one (pref_len - pref0_len chars),
2031 after the current position the third one.
2032 We assume that pref0_len <= pref_len, otherwise we
2033 decrease pref0_len. */
2034 int pref_len = (locinput - PL_bostr) > (5 + taill) - l
2035 ? (5 + taill) - l : locinput - PL_bostr;
2038 while (UTF8_IS_CONTINUATION(*(U8*)(locinput - pref_len)))
2040 pref0_len = pref_len - (locinput - PL_reg_starttry);
2041 if (l + pref_len < (5 + taill) && l < PL_regeol - locinput)
2042 l = ( PL_regeol - locinput > (5 + taill) - pref_len
2043 ? (5 + taill) - pref_len : PL_regeol - locinput);
2044 while (UTF8_IS_CONTINUATION(*(U8*)(locinput + l)))
2048 if (pref0_len > pref_len)
2049 pref0_len = pref_len;
2050 regprop(prop, scan);
2051 PerlIO_printf(Perl_debug_log,
2052 "%4"IVdf" <%s%.*s%s%s%.*s%s%s%s%.*s%s>%*s|%3"IVdf":%*s%s\n",
2053 (IV)(locinput - PL_bostr),
2054 PL_colors[4], pref0_len,
2055 locinput - pref_len, PL_colors[5],
2056 PL_colors[2], pref_len - pref0_len,
2057 locinput - pref_len + pref0_len, PL_colors[3],
2058 (docolor ? "" : "> <"),
2059 PL_colors[0], l, locinput, PL_colors[1],
2060 15 - l - pref_len + 1,
2062 (IV)(scan - PL_regprogram), PL_regindent*2, "",
2066 next = scan + NEXT_OFF(scan);
2072 if (locinput == PL_bostr || (PL_multiline &&
2073 (nextchr || locinput < PL_regeol) && locinput[-1] == '\n') )
2075 /* regtill = regbol; */
2080 if (locinput == PL_bostr ||
2081 ((nextchr || locinput < PL_regeol) && locinput[-1] == '\n'))
2087 if (locinput == PL_bostr)
2091 if (locinput == PL_reg_ganch)
2101 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2106 if ((nextchr || locinput < PL_regeol) && nextchr != '\n')
2108 if (PL_regeol - locinput > 1)
2112 if (PL_regeol != locinput)
2116 if (!nextchr && locinput >= PL_regeol)
2119 locinput += PL_utf8skip[nextchr];
2120 if (locinput > PL_regeol)
2122 nextchr = UCHARAT(locinput);
2125 nextchr = UCHARAT(++locinput);
2128 if (!nextchr && locinput >= PL_regeol)
2130 nextchr = UCHARAT(++locinput);
2133 if ((!nextchr && locinput >= PL_regeol) || nextchr == '\n')
2136 locinput += PL_utf8skip[nextchr];
2137 if (locinput > PL_regeol)
2139 nextchr = UCHARAT(locinput);
2142 nextchr = UCHARAT(++locinput);
2147 if (do_utf8 != (UTF!=0)) {
2155 if (*((U8*)s) != utf8_to_uvchr((U8*)l, &len))
2164 if (*((U8*)l) != utf8_to_uvchr((U8*)s, &len))
2170 nextchr = UCHARAT(locinput);
2173 /* Inline the first character, for speed. */
2174 if (UCHARAT(s) != nextchr)
2176 if (PL_regeol - locinput < ln)
2178 if (ln > 1 && memNE(s, locinput, ln))
2181 nextchr = UCHARAT(locinput);
2184 PL_reg_flags |= RF_tainted;
2194 c1 = OP(scan) == EXACTF;
2196 if (l >= PL_regeol) {
2199 if ((UTF ? utf8n_to_uvchr((U8*)s, e - s, 0, 0) : *((U8*)s)) !=
2200 (c1 ? toLOWER_utf8((U8*)l) : toLOWER_LC_utf8((U8*)l)))
2202 s += UTF ? UTF8SKIP(s) : 1;
2206 nextchr = UCHARAT(locinput);
2210 /* Inline the first character, for speed. */
2211 if (UCHARAT(s) != nextchr &&
2212 UCHARAT(s) != ((OP(scan) == EXACTF)
2213 ? PL_fold : PL_fold_locale)[nextchr])
2215 if (PL_regeol - locinput < ln)
2217 if (ln > 1 && (OP(scan) == EXACTF
2218 ? ibcmp(s, locinput, ln)
2219 : ibcmp_locale(s, locinput, ln)))
2222 nextchr = UCHARAT(locinput);
2226 if (!reginclass(scan, (U8*)locinput, do_utf8))
2228 if (locinput >= PL_regeol)
2230 locinput += PL_utf8skip[nextchr];
2231 nextchr = UCHARAT(locinput);
2235 nextchr = UCHARAT(locinput);
2236 if (!reginclass(scan, (U8*)locinput, do_utf8))
2238 if (!nextchr && locinput >= PL_regeol)
2240 nextchr = UCHARAT(++locinput);
2244 PL_reg_flags |= RF_tainted;
2250 LOAD_UTF8_CHARCLASS(alnum,"a");
2251 if (!(OP(scan) == ALNUM
2252 ? swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
2253 : isALNUM_LC_utf8((U8*)locinput)))
2257 locinput += PL_utf8skip[nextchr];
2258 nextchr = UCHARAT(locinput);
2261 if (!(OP(scan) == ALNUM
2262 ? isALNUM(nextchr) : isALNUM_LC(nextchr)))
2264 nextchr = UCHARAT(++locinput);
2267 PL_reg_flags |= RF_tainted;
2270 if (!nextchr && locinput >= PL_regeol)
2273 LOAD_UTF8_CHARCLASS(alnum,"a");
2274 if (OP(scan) == NALNUM
2275 ? swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8)
2276 : isALNUM_LC_utf8((U8*)locinput))
2280 locinput += PL_utf8skip[nextchr];
2281 nextchr = UCHARAT(locinput);
2284 if (OP(scan) == NALNUM
2285 ? isALNUM(nextchr) : isALNUM_LC(nextchr))
2287 nextchr = UCHARAT(++locinput);
2291 PL_reg_flags |= RF_tainted;
2295 /* was last char in word? */
2297 if (locinput == PL_bostr)
2300 U8 *r = reghop((U8*)locinput, -1);
2302 ln = utf8n_to_uvchr(r, s - (char*)r, 0, 0);
2304 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
2305 ln = isALNUM_uni(ln);
2306 LOAD_UTF8_CHARCLASS(alnum,"a");
2307 n = swash_fetch(PL_utf8_alnum, (U8*)locinput, do_utf8);
2310 ln = isALNUM_LC_uvchr(UNI_TO_NATIVE(ln));
2311 n = isALNUM_LC_utf8((U8*)locinput);
2315 ln = (locinput != PL_bostr) ?
2316 UCHARAT(locinput - 1) : '\n';
2317 if (OP(scan) == BOUND || OP(scan) == NBOUND) {
2319 n = isALNUM(nextchr);
2322 ln = isALNUM_LC(ln);
2323 n = isALNUM_LC(nextchr);
2326 if (((!ln) == (!n)) == (OP(scan) == BOUND ||
2327 OP(scan) == BOUNDL))
2331 PL_reg_flags |= RF_tainted;
2337 if (UTF8_IS_CONTINUED(nextchr)) {
2338 LOAD_UTF8_CHARCLASS(space," ");
2339 if (!(OP(scan) == SPACE
2340 ? swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
2341 : isSPACE_LC_utf8((U8*)locinput)))
2345 locinput += PL_utf8skip[nextchr];
2346 nextchr = UCHARAT(locinput);
2349 if (!(OP(scan) == SPACE
2350 ? isSPACE(nextchr) : isSPACE_LC(nextchr)))
2352 nextchr = UCHARAT(++locinput);
2355 if (!(OP(scan) == SPACE
2356 ? isSPACE(nextchr) : isSPACE_LC(nextchr)))
2358 nextchr = UCHARAT(++locinput);
2362 PL_reg_flags |= RF_tainted;
2365 if (!nextchr && locinput >= PL_regeol)
2368 LOAD_UTF8_CHARCLASS(space," ");
2369 if (OP(scan) == NSPACE
2370 ? swash_fetch(PL_utf8_space, (U8*)locinput, do_utf8)
2371 : isSPACE_LC_utf8((U8*)locinput))
2375 locinput += PL_utf8skip[nextchr];
2376 nextchr = UCHARAT(locinput);
2379 if (OP(scan) == NSPACE
2380 ? isSPACE(nextchr) : isSPACE_LC(nextchr))
2382 nextchr = UCHARAT(++locinput);
2385 PL_reg_flags |= RF_tainted;
2391 LOAD_UTF8_CHARCLASS(digit,"0");
2392 if (!(OP(scan) == DIGIT
2393 ? swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
2394 : isDIGIT_LC_utf8((U8*)locinput)))
2398 locinput += PL_utf8skip[nextchr];
2399 nextchr = UCHARAT(locinput);
2402 if (!(OP(scan) == DIGIT
2403 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr)))
2405 nextchr = UCHARAT(++locinput);
2408 PL_reg_flags |= RF_tainted;
2411 if (!nextchr && locinput >= PL_regeol)
2414 LOAD_UTF8_CHARCLASS(digit,"0");
2415 if (OP(scan) == NDIGIT
2416 ? swash_fetch(PL_utf8_digit, (U8*)locinput, do_utf8)
2417 : isDIGIT_LC_utf8((U8*)locinput))
2421 locinput += PL_utf8skip[nextchr];
2422 nextchr = UCHARAT(locinput);
2425 if (OP(scan) == NDIGIT
2426 ? isDIGIT(nextchr) : isDIGIT_LC(nextchr))
2428 nextchr = UCHARAT(++locinput);
2431 LOAD_UTF8_CHARCLASS(mark,"~");
2432 if (locinput >= PL_regeol ||
2433 swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
2435 locinput += PL_utf8skip[nextchr];
2436 while (locinput < PL_regeol &&
2437 swash_fetch(PL_utf8_mark,(U8*)locinput, do_utf8))
2438 locinput += UTF8SKIP(locinput);
2439 if (locinput > PL_regeol)
2441 nextchr = UCHARAT(locinput);
2444 PL_reg_flags |= RF_tainted;
2448 n = ARG(scan); /* which paren pair */
2449 ln = PL_regstartp[n];
2450 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
2451 if (*PL_reglastparen < n || ln == -1)
2452 sayNO; /* Do not match unless seen CLOSEn. */
2453 if (ln == PL_regendp[n])
2457 if (do_utf8 && OP(scan) != REF) { /* REF can do byte comparison */
2459 char *e = PL_bostr + PL_regendp[n];
2461 * Note that we can't do the "other character" lookup trick as
2462 * in the 8-bit case (no pun intended) because in Unicode we
2463 * have to map both upper and title case to lower case.
2465 if (OP(scan) == REFF) {
2469 if (toLOWER_utf8((U8*)s) != toLOWER_utf8((U8*)l))
2479 if (toLOWER_LC_utf8((U8*)s) != toLOWER_LC_utf8((U8*)l))
2486 nextchr = UCHARAT(locinput);
2490 /* Inline the first character, for speed. */
2491 if (UCHARAT(s) != nextchr &&
2493 (UCHARAT(s) != ((OP(scan) == REFF
2494 ? PL_fold : PL_fold_locale)[nextchr]))))
2496 ln = PL_regendp[n] - ln;
2497 if (locinput + ln > PL_regeol)
2499 if (ln > 1 && (OP(scan) == REF
2500 ? memNE(s, locinput, ln)
2502 ? ibcmp(s, locinput, ln)
2503 : ibcmp_locale(s, locinput, ln))))
2506 nextchr = UCHARAT(locinput);
2517 OP_4tree *oop = PL_op;
2518 COP *ocurcop = PL_curcop;
2519 SV **ocurpad = PL_curpad;
2523 PL_op = (OP_4tree*)PL_regdata->data[n];
2524 DEBUG_r( PerlIO_printf(Perl_debug_log, " re_eval 0x%"UVxf"\n", PTR2UV(PL_op)) );
2525 PL_curpad = AvARRAY((AV*)PL_regdata->data[n + 2]);
2526 PL_regendp[0] = PL_reg_magic->mg_len = locinput - PL_bostr;
2528 CALLRUNOPS(aTHX); /* Scalar context. */
2534 PL_curpad = ocurpad;
2535 PL_curcop = ocurcop;
2537 if (logical == 2) { /* Postponed subexpression. */
2539 MAGIC *mg = Null(MAGIC*);
2541 CHECKPOINT cp, lastcp;
2543 if(SvROK(ret) || SvRMAGICAL(ret)) {
2544 SV *sv = SvROK(ret) ? SvRV(ret) : ret;
2547 mg = mg_find(sv, PERL_MAGIC_qr);
2550 re = (regexp *)mg->mg_obj;
2551 (void)ReREFCNT_inc(re);
2555 char *t = SvPV(ret, len);
2557 char *oprecomp = PL_regprecomp;
2558 I32 osize = PL_regsize;
2559 I32 onpar = PL_regnpar;
2562 re = CALLREGCOMP(aTHX_ t, t + len, &pm);
2564 & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)))
2565 sv_magic(ret,(SV*)ReREFCNT_inc(re),
2567 PL_regprecomp = oprecomp;
2572 PerlIO_printf(Perl_debug_log,
2573 "Entering embedded `%s%.60s%s%s'\n",
2577 (strlen(re->precomp) > 60 ? "..." : ""))
2580 state.prev = PL_reg_call_cc;
2581 state.cc = PL_regcc;
2582 state.re = PL_reg_re;
2586 cp = regcppush(0); /* Save *all* the positions. */
2589 state.ss = PL_savestack_ix;
2590 *PL_reglastparen = 0;
2591 *PL_reglastcloseparen = 0;
2592 PL_reg_call_cc = &state;
2593 PL_reginput = locinput;
2595 /* XXXX This is too dramatic a measure... */
2598 if (regmatch(re->program + 1)) {
2599 /* Even though we succeeded, we need to restore
2600 global variables, since we may be wrapped inside
2601 SUSPEND, thus the match may be not finished yet. */
2603 /* XXXX Do this only if SUSPENDed? */
2604 PL_reg_call_cc = state.prev;
2605 PL_regcc = state.cc;
2606 PL_reg_re = state.re;
2607 cache_re(PL_reg_re);
2609 /* XXXX This is too dramatic a measure... */
2612 /* These are needed even if not SUSPEND. */
2618 REGCP_UNWIND(lastcp);
2620 PL_reg_call_cc = state.prev;
2621 PL_regcc = state.cc;
2622 PL_reg_re = state.re;
2623 cache_re(PL_reg_re);
2625 /* XXXX This is too dramatic a measure... */
2635 sv_setsv(save_scalar(PL_replgv), ret);
2639 n = ARG(scan); /* which paren pair */
2640 PL_reg_start_tmp[n] = locinput;
2645 n = ARG(scan); /* which paren pair */
2646 PL_regstartp[n] = PL_reg_start_tmp[n] - PL_bostr;
2647 PL_regendp[n] = locinput - PL_bostr;
2648 if (n > *PL_reglastparen)
2649 *PL_reglastparen = n;
2650 *PL_reglastcloseparen = n;
2653 n = ARG(scan); /* which paren pair */
2654 sw = (*PL_reglastparen >= n && PL_regendp[n] != -1);
2657 PL_reg_leftiter = PL_reg_maxiter; /* Void cache */
2659 next = NEXTOPER(NEXTOPER(scan));
2661 next = scan + ARG(scan);
2662 if (OP(next) == IFTHEN) /* Fake one. */
2663 next = NEXTOPER(NEXTOPER(next));
2667 logical = scan->flags;
2669 /*******************************************************************
2670 PL_regcc contains infoblock about the innermost (...)* loop, and
2671 a pointer to the next outer infoblock.
2673 Here is how Y(A)*Z is processed (if it is compiled into CURLYX/WHILEM):
2675 1) After matching X, regnode for CURLYX is processed;
2677 2) This regnode creates infoblock on the stack, and calls
2678 regmatch() recursively with the starting point at WHILEM node;
2680 3) Each hit of WHILEM node tries to match A and Z (in the order
2681 depending on the current iteration, min/max of {min,max} and
2682 greediness). The information about where are nodes for "A"
2683 and "Z" is read from the infoblock, as is info on how many times "A"
2684 was already matched, and greediness.
2686 4) After A matches, the same WHILEM node is hit again.
2688 5) Each time WHILEM is hit, PL_regcc is the infoblock created by CURLYX
2689 of the same pair. Thus when WHILEM tries to match Z, it temporarily
2690 resets PL_regcc, since this Y(A)*Z can be a part of some other loop:
2691 as in (Y(A)*Z)*. If Z matches, the automaton will hit the WHILEM node
2692 of the external loop.
2694 Currently present infoblocks form a tree with a stem formed by PL_curcc
2695 and whatever it mentions via ->next, and additional attached trees
2696 corresponding to temporarily unset infoblocks as in "5" above.
2698 In the following picture infoblocks for outer loop of
2699 (Y(A)*?Z)*?T are denoted O, for inner I. NULL starting block
2700 is denoted by x. The matched string is YAAZYAZT. Temporarily postponed
2701 infoblocks are drawn below the "reset" infoblock.
2703 In fact in the picture below we do not show failed matches for Z and T
2704 by WHILEM blocks. [We illustrate minimal matches, since for them it is
2705 more obvious *why* one needs to *temporary* unset infoblocks.]
2707 Matched REx position InfoBlocks Comment
2711 Y A)*?Z)*?T x <- O <- I
2712 YA )*?Z)*?T x <- O <- I
2713 YA A)*?Z)*?T x <- O <- I
2714 YAA )*?Z)*?T x <- O <- I
2715 YAA Z)*?T x <- O # Temporary unset I
2718 YAAZ Y(A)*?Z)*?T x <- O
2721 YAAZY (A)*?Z)*?T x <- O
2724 YAAZY A)*?Z)*?T x <- O <- I
2727 YAAZYA )*?Z)*?T x <- O <- I
2730 YAAZYA Z)*?T x <- O # Temporary unset I
2736 YAAZYAZ T x # Temporary unset O
2743 *******************************************************************/
2746 CHECKPOINT cp = PL_savestack_ix;
2747 /* No need to save/restore up to this paren */
2748 I32 parenfloor = scan->flags;
2750 if (OP(PREVOPER(next)) == NOTHING) /* LONGJMP */
2752 cc.oldcc = PL_regcc;
2754 /* XXXX Probably it is better to teach regpush to support
2755 parenfloor > PL_regsize... */
2756 if (parenfloor > *PL_reglastparen)
2757 parenfloor = *PL_reglastparen; /* Pessimization... */
2758 cc.parenfloor = parenfloor;
2760 cc.min = ARG1(scan);
2761 cc.max = ARG2(scan);
2762 cc.scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
2766 PL_reginput = locinput;
2767 n = regmatch(PREVOPER(next)); /* start on the WHILEM */
2769 PL_regcc = cc.oldcc;
2775 * This is really hard to understand, because after we match
2776 * what we're trying to match, we must make sure the rest of
2777 * the REx is going to match for sure, and to do that we have
2778 * to go back UP the parse tree by recursing ever deeper. And
2779 * if it fails, we have to reset our parent's current state
2780 * that we can try again after backing off.
2783 CHECKPOINT cp, lastcp;
2784 CURCUR* cc = PL_regcc;
2785 char *lastloc = cc->lastloc; /* Detection of 0-len. */
2787 n = cc->cur + 1; /* how many we know we matched */
2788 PL_reginput = locinput;
2791 PerlIO_printf(Perl_debug_log,
2792 "%*s %ld out of %ld..%ld cc=%lx\n",
2793 REPORT_CODE_OFF+PL_regindent*2, "",
2794 (long)n, (long)cc->min,
2795 (long)cc->max, (long)cc)
2798 /* If degenerate scan matches "", assume scan done. */
2800 if (locinput == cc->lastloc && n >= cc->min) {
2801 PL_regcc = cc->oldcc;
2805 PerlIO_printf(Perl_debug_log,
2806 "%*s empty match detected, try continuation...\n",
2807 REPORT_CODE_OFF+PL_regindent*2, "")
2809 if (regmatch(cc->next))
2817 /* First just match a string of min scans. */
2821 cc->lastloc = locinput;
2822 if (regmatch(cc->scan))
2825 cc->lastloc = lastloc;
2830 /* Check whether we already were at this position.
2831 Postpone detection until we know the match is not
2832 *that* much linear. */
2833 if (!PL_reg_maxiter) {
2834 PL_reg_maxiter = (PL_regeol - PL_bostr + 1) * (scan->flags>>4);
2835 PL_reg_leftiter = PL_reg_maxiter;
2837 if (PL_reg_leftiter-- == 0) {
2838 I32 size = (PL_reg_maxiter + 7)/8;
2839 if (PL_reg_poscache) {
2840 if (PL_reg_poscache_size < size) {
2841 Renew(PL_reg_poscache, size, char);
2842 PL_reg_poscache_size = size;
2844 Zero(PL_reg_poscache, size, char);
2847 PL_reg_poscache_size = size;
2848 Newz(29, PL_reg_poscache, size, char);
2851 PerlIO_printf(Perl_debug_log,
2852 "%sDetected a super-linear match, switching on caching%s...\n",
2853 PL_colors[4], PL_colors[5])
2856 if (PL_reg_leftiter < 0) {
2857 I32 o = locinput - PL_bostr, b;
2859 o = (scan->flags & 0xf) - 1 + o * (scan->flags>>4);
2862 if (PL_reg_poscache[o] & (1<<b)) {
2864 PerlIO_printf(Perl_debug_log,
2865 "%*s already tried at this position...\n",
2866 REPORT_CODE_OFF+PL_regindent*2, "")
2870 PL_reg_poscache[o] |= (1<<b);
2874 /* Prefer next over scan for minimal matching. */
2877 PL_regcc = cc->oldcc;
2880 cp = regcppush(cc->parenfloor);
2882 if (regmatch(cc->next)) {
2884 sayYES; /* All done. */
2886 REGCP_UNWIND(lastcp);
2892 if (n >= cc->max) { /* Maximum greed exceeded? */
2893 if (ckWARN(WARN_REGEXP) && n >= REG_INFTY
2894 && !(PL_reg_flags & RF_warned)) {
2895 PL_reg_flags |= RF_warned;
2896 Perl_warner(aTHX_ WARN_REGEXP, "%s limit (%d) exceeded",
2897 "Complex regular subexpression recursion",
2904 PerlIO_printf(Perl_debug_log,
2905 "%*s trying longer...\n",
2906 REPORT_CODE_OFF+PL_regindent*2, "")
2908 /* Try scanning more and see if it helps. */
2909 PL_reginput = locinput;
2911 cc->lastloc = locinput;
2912 cp = regcppush(cc->parenfloor);
2914 if (regmatch(cc->scan)) {
2918 REGCP_UNWIND(lastcp);
2921 cc->lastloc = lastloc;
2925 /* Prefer scan over next for maximal matching. */
2927 if (n < cc->max) { /* More greed allowed? */
2928 cp = regcppush(cc->parenfloor);
2930 cc->lastloc = locinput;
2932 if (regmatch(cc->scan)) {
2936 REGCP_UNWIND(lastcp);
2937 regcppop(); /* Restore some previous $<digit>s? */
2938 PL_reginput = locinput;
2940 PerlIO_printf(Perl_debug_log,
2941 "%*s failed, try continuation...\n",
2942 REPORT_CODE_OFF+PL_regindent*2, "")
2945 if (ckWARN(WARN_REGEXP) && n >= REG_INFTY
2946 && !(PL_reg_flags & RF_warned)) {
2947 PL_reg_flags |= RF_warned;
2948 Perl_warner(aTHX_ WARN_REGEXP, "%s limit (%d) exceeded",
2949 "Complex regular subexpression recursion",
2953 /* Failed deeper matches of scan, so see if this one works. */
2954 PL_regcc = cc->oldcc;
2957 if (regmatch(cc->next))
2963 cc->lastloc = lastloc;
2968 next = scan + ARG(scan);
2971 inner = NEXTOPER(NEXTOPER(scan));
2974 inner = NEXTOPER(scan);
2978 if (OP(next) != c1) /* No choice. */
2979 next = inner; /* Avoid recursion. */
2981 I32 lastparen = *PL_reglastparen;
2983 re_unwind_branch_t *uw;
2985 /* Put unwinding data on stack */
2986 unwind1 = SSNEWt(1,re_unwind_branch_t);
2987 uw = SSPTRt(unwind1,re_unwind_branch_t);
2990 uw->type = ((c1 == BRANCH)
2992 : RE_UNWIND_BRANCHJ);
2993 uw->lastparen = lastparen;
2995 uw->locinput = locinput;
2996 uw->nextchr = nextchr;
2998 uw->regindent = ++PL_regindent;
3001 REGCP_SET(uw->lastcp);
3003 /* Now go into the first branch */
3016 /* We suppose that the next guy does not need
3017 backtracking: in particular, it is of constant length,
3018 and has no parenths to influence future backrefs. */
3019 ln = ARG1(scan); /* min to match */
3020 n = ARG2(scan); /* max to match */
3021 paren = scan->flags;
3023 if (paren > PL_regsize)
3025 if (paren > *PL_reglastparen)
3026 *PL_reglastparen = paren;
3028 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
3030 scan += NEXT_OFF(scan); /* Skip former OPEN. */
3031 PL_reginput = locinput;
3034 if (ln && regrepeat_hard(scan, ln, &l) < ln)
3036 if (ln && l == 0 && n >= ln
3037 /* In fact, this is tricky. If paren, then the
3038 fact that we did/didnot match may influence
3039 future execution. */
3040 && !(paren && ln == 0))
3042 locinput = PL_reginput;
3043 if (PL_regkind[(U8)OP(next)] == EXACT) {
3044 c1 = (U8)*STRING(next);
3045 if (OP(next) == EXACTF)
3047 else if (OP(next) == EXACTFL)
3048 c2 = PL_fold_locale[c1];
3055 /* This may be improved if l == 0. */
3056 while (n >= ln || (n == REG_INFTY && ln > 0 && l)) { /* ln overflow ? */
3057 /* If it could work, try it. */
3059 UCHARAT(PL_reginput) == c1 ||
3060 UCHARAT(PL_reginput) == c2)
3064 PL_regstartp[paren] =
3065 HOPc(PL_reginput, -l) - PL_bostr;
3066 PL_regendp[paren] = PL_reginput - PL_bostr;
3069 PL_regendp[paren] = -1;
3073 REGCP_UNWIND(lastcp);
3075 /* Couldn't or didn't -- move forward. */
3076 PL_reginput = locinput;
3077 if (regrepeat_hard(scan, 1, &l)) {
3079 locinput = PL_reginput;
3086 n = regrepeat_hard(scan, n, &l);
3087 if (n != 0 && l == 0
3088 /* In fact, this is tricky. If paren, then the
3089 fact that we did/didnot match may influence
3090 future execution. */
3091 && !(paren && ln == 0))
3093 locinput = PL_reginput;
3095 PerlIO_printf(Perl_debug_log,
3096 "%*s matched %"IVdf" times, len=%"IVdf"...\n",
3097 (int)(REPORT_CODE_OFF+PL_regindent*2), "",
3101 if (PL_regkind[(U8)OP(next)] == EXACT) {
3102 c1 = (U8)*STRING(next);
3103 if (OP(next) == EXACTF)
3105 else if (OP(next) == EXACTFL)
3106 c2 = PL_fold_locale[c1];
3115 /* If it could work, try it. */
3117 UCHARAT(PL_reginput) == c1 ||
3118 UCHARAT(PL_reginput) == c2)
3121 PerlIO_printf(Perl_debug_log,
3122 "%*s trying tail with n=%"IVdf"...\n",
3123 (int)(REPORT_CODE_OFF+PL_regindent*2), "", (IV)n)
3127 PL_regstartp[paren] = HOPc(PL_reginput, -l) - PL_bostr;
3128 PL_regendp[paren] = PL_reginput - PL_bostr;
3131 PL_regendp[paren] = -1;
3135 REGCP_UNWIND(lastcp);
3137 /* Couldn't or didn't -- back up. */
3139 locinput = HOPc(locinput, -l);
3140 PL_reginput = locinput;
3147 paren = scan->flags; /* Which paren to set */
3148 if (paren > PL_regsize)
3150 if (paren > *PL_reglastparen)
3151 *PL_reglastparen = paren;
3152 ln = ARG1(scan); /* min to match */
3153 n = ARG2(scan); /* max to match */
3154 scan = regnext(NEXTOPER(scan) + NODE_STEP_REGNODE);
3158 ln = ARG1(scan); /* min to match */
3159 n = ARG2(scan); /* max to match */
3160 scan = NEXTOPER(scan) + NODE_STEP_REGNODE;
3165 scan = NEXTOPER(scan);
3171 scan = NEXTOPER(scan);
3175 * Lookahead to avoid useless match attempts
3176 * when we know what character comes next.
3178 if (PL_regkind[(U8)OP(next)] == EXACT) {
3179 U8 *s = (U8*)STRING(next);
3182 if (OP(next) == EXACTF)
3184 else if (OP(next) == EXACTFL)
3185 c2 = PL_fold_locale[c1];
3188 if (OP(next) == EXACTF) {
3189 c1 = to_utf8_lower(s);
3190 c2 = to_utf8_upper(s);
3193 c2 = c1 = utf8_to_uvchr(s, NULL);
3199 PL_reginput = locinput;
3203 if (ln && regrepeat(scan, ln) < ln)
3205 locinput = PL_reginput;
3208 char *e; /* Should not check after this */
3209 char *old = locinput;
3211 if (n == REG_INFTY) {
3214 while (UTF8_IS_CONTINUATION(*(U8*)e))
3220 m >0 && e + UTF8SKIP(e) <= PL_regeol; m--)
3224 e = locinput + n - ln;
3230 /* Find place 'next' could work */
3233 while (locinput <= e && *locinput != c1)
3236 while (locinput <= e
3241 count = locinput - old;
3248 utf8_to_uvchr((U8*)locinput, &len) != c1;
3253 for (count = 0; locinput <= e; count++) {
3254 UV c = utf8_to_uvchr((U8*)locinput, &len);
3255 if (c == c1 || c == c2)
3263 /* PL_reginput == old now */
3264 if (locinput != old) {
3265 ln = 1; /* Did some */
3266 if (regrepeat(scan, count) < count)
3269 /* PL_reginput == locinput now */
3270 TRYPAREN(paren, ln, locinput);
3271 PL_reginput = locinput; /* Could be reset... */
3272 REGCP_UNWIND(lastcp);
3273 /* Couldn't or didn't -- move forward. */
3276 locinput += UTF8SKIP(locinput);
3282 while (n >= ln || (n == REG_INFTY && ln > 0)) { /* ln overflow ? */
3286 c = utf8_to_uvchr((U8*)PL_reginput, NULL);
3288 c = UCHARAT(PL_reginput);
3289 /* If it could work, try it. */
3290 if (c == c1 || c == c2)
3292 TRYPAREN(paren, n, PL_reginput);
3293 REGCP_UNWIND(lastcp);
3296 /* If it could work, try it. */
3297 else if (c1 == -1000)
3299 TRYPAREN(paren, n, PL_reginput);
3300 REGCP_UNWIND(lastcp);
3302 /* Couldn't or didn't -- move forward. */
3303 PL_reginput = locinput;
3304 if (regrepeat(scan, 1)) {
3306 locinput = PL_reginput;
3314 n = regrepeat(scan, n);
3315 locinput = PL_reginput;
3316 if (ln < n && PL_regkind[(U8)OP(next)] == EOL &&
3317 (!PL_multiline || OP(next) == SEOL || OP(next) == EOS)) {
3318 ln = n; /* why back off? */
3319 /* ...because $ and \Z can match before *and* after
3320 newline at the end. Consider "\n\n" =~ /\n+\Z\n/.
3321 We should back off by one in this case. */
3322 if (UCHARAT(PL_reginput - 1) == '\n' && OP(next) != EOS)
3331 c = utf8_to_uvchr((U8*)PL_reginput, NULL);
3333 c = UCHARAT(PL_reginput);
3335 /* If it could work, try it. */
3336 if (c1 == -1000 || c == c1 || c == c2)
3338 TRYPAREN(paren, n, PL_reginput);
3339 REGCP_UNWIND(lastcp);
3341 /* Couldn't or didn't -- back up. */
3343 PL_reginput = locinput = HOPc(locinput, -1);
3351 c = utf8_to_uvchr((U8*)PL_reginput, NULL);
3353 c = UCHARAT(PL_reginput);
3355 /* If it could work, try it. */
3356 if (c1 == -1000 || c == c1 || c == c2)
3358 TRYPAREN(paren, n, PL_reginput);
3359 REGCP_UNWIND(lastcp);
3361 /* Couldn't or didn't -- back up. */
3363 PL_reginput = locinput = HOPc(locinput, -1);
3370 if (PL_reg_call_cc) {
3371 re_cc_state *cur_call_cc = PL_reg_call_cc;
3372 CURCUR *cctmp = PL_regcc;
3373 regexp *re = PL_reg_re;
3374 CHECKPOINT cp, lastcp;
3376 cp = regcppush(0); /* Save *all* the positions. */
3378 regcp_set_to(PL_reg_call_cc->ss); /* Restore parens of
3380 PL_reginput = locinput; /* Make position available to
3382 cache_re(PL_reg_call_cc->re);
3383 PL_regcc = PL_reg_call_cc->cc;
3384 PL_reg_call_cc = PL_reg_call_cc->prev;
3385 if (regmatch(cur_call_cc->node)) {
3386 PL_reg_call_cc = cur_call_cc;
3390 REGCP_UNWIND(lastcp);
3392 PL_reg_call_cc = cur_call_cc;
3398 PerlIO_printf(Perl_debug_log,
3399 "%*s continuation failed...\n",
3400 REPORT_CODE_OFF+PL_regindent*2, "")
3404 if (locinput < PL_regtill) {
3405 DEBUG_r(PerlIO_printf(Perl_debug_log,
3406 "%sMatch possible, but length=%ld is smaller than requested=%ld, failing!%s\n",
3408 (long)(locinput - PL_reg_starttry),
3409 (long)(PL_regtill - PL_reg_starttry),
3411 sayNO_FINAL; /* Cannot match: too short. */
3413 PL_reginput = locinput; /* put where regtry can find it */
3414 sayYES_FINAL; /* Success! */
3416 PL_reginput = locinput; /* put where regtry can find it */
3417 sayYES_LOUD; /* Success! */
3420 PL_reginput = locinput;
3425 s = HOPBACKc(locinput, scan->flags);
3431 PL_reginput = locinput;
3436 s = HOPBACKc(locinput, scan->flags);
3442 PL_reginput = locinput;
3445 inner = NEXTOPER(NEXTOPER(scan));
3446 if (regmatch(inner) != n) {
3461 if (OP(scan) == SUSPEND) {
3462 locinput = PL_reginput;
3463 nextchr = UCHARAT(locinput);
3468 next = scan + ARG(scan);
3473 PerlIO_printf(Perl_error_log, "%"UVxf" %d\n",
3474 PTR2UV(scan), OP(scan));
3475 Perl_croak(aTHX_ "regexp memory corruption");
3482 * We get here only if there's trouble -- normally "case END" is
3483 * the terminating point.
3485 Perl_croak(aTHX_ "corrupted regexp pointers");
3491 PerlIO_printf(Perl_debug_log,
3492 "%*s %scould match...%s\n",
3493 REPORT_CODE_OFF+PL_regindent*2, "", PL_colors[4],PL_colors[5])
3497 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sMatch successful!%s\n",
3498 PL_colors[4],PL_colors[5]));
3504 #if 0 /* Breaks $^R */
3512 PerlIO_printf(Perl_debug_log,
3513 "%*s %sfailed...%s\n",
3514 REPORT_CODE_OFF+PL_regindent*2, "",PL_colors[4],PL_colors[5])
3520 re_unwind_t *uw = SSPTRt(unwind,re_unwind_t);
3523 case RE_UNWIND_BRANCH:
3524 case RE_UNWIND_BRANCHJ:
3526 re_unwind_branch_t *uwb = &(uw->branch);
3527 I32 lastparen = uwb->lastparen;
3529 REGCP_UNWIND(uwb->lastcp);
3530 for (n = *PL_reglastparen; n > lastparen; n--)
3532 *PL_reglastparen = n;
3533 scan = next = uwb->next;
3535 OP(scan) != (uwb->type == RE_UNWIND_BRANCH
3536 ? BRANCH : BRANCHJ) ) { /* Failure */
3543 /* Have more choice yet. Reuse the same uwb. */
3545 if ((n = (uwb->type == RE_UNWIND_BRANCH
3546 ? NEXT_OFF(next) : ARG(next))))
3549 next = NULL; /* XXXX Needn't unwinding in this case... */
3551 next = NEXTOPER(scan);
3552 if (uwb->type == RE_UNWIND_BRANCHJ)
3553 next = NEXTOPER(next);
3554 locinput = uwb->locinput;
3555 nextchr = uwb->nextchr;
3557 PL_regindent = uwb->regindent;
3564 Perl_croak(aTHX_ "regexp unwind memory corruption");
3575 - regrepeat - repeatedly match something simple, report how many
3578 * [This routine now assumes that it will only match on things of length 1.
3579 * That was true before, but now we assume scan - reginput is the count,
3580 * rather than incrementing count on every character. [Er, except utf8.]]
3583 S_regrepeat(pTHX_ regnode *p, I32 max)
3585 register char *scan;
3587 register char *loceol = PL_regeol;
3588 register I32 hardcount = 0;
3589 register bool do_utf8 = DO_UTF8(PL_reg_sv);
3592 if (max != REG_INFTY && max < loceol - scan)
3593 loceol = scan + max;
3598 while (scan < loceol && hardcount < max && *scan != '\n') {
3599 scan += UTF8SKIP(scan);
3603 while (scan < loceol && *scan != '\n')
3613 case EXACT: /* length of string is 1 */
3615 while (scan < loceol && UCHARAT(scan) == c)
3618 case EXACTF: /* length of string is 1 */
3620 while (scan < loceol &&
3621 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold[c]))
3624 case EXACTFL: /* length of string is 1 */
3625 PL_reg_flags |= RF_tainted;
3627 while (scan < loceol &&
3628 (UCHARAT(scan) == c || UCHARAT(scan) == PL_fold_locale[c]))
3634 while (hardcount < max && scan < loceol &&
3635 reginclass(p, (U8*)scan, do_utf8)) {
3636 scan += UTF8SKIP(scan);
3640 while (scan < loceol && reginclass(p, (U8*)scan, do_utf8))
3647 LOAD_UTF8_CHARCLASS(alnum,"a");
3648 while (hardcount < max && scan < loceol &&
3649 swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
3650 scan += UTF8SKIP(scan);
3654 while (scan < loceol && isALNUM(*scan))
3659 PL_reg_flags |= RF_tainted;
3662 while (hardcount < max && scan < loceol &&
3663 isALNUM_LC_utf8((U8*)scan)) {
3664 scan += UTF8SKIP(scan);
3668 while (scan < loceol && isALNUM_LC(*scan))
3675 LOAD_UTF8_CHARCLASS(alnum,"a");
3676 while (hardcount < max && scan < loceol &&
3677 !swash_fetch(PL_utf8_alnum, (U8*)scan, do_utf8)) {
3678 scan += UTF8SKIP(scan);
3682 while (scan < loceol && !isALNUM(*scan))
3687 PL_reg_flags |= RF_tainted;
3690 while (hardcount < max && scan < loceol &&
3691 !isALNUM_LC_utf8((U8*)scan)) {
3692 scan += UTF8SKIP(scan);
3696 while (scan < loceol && !isALNUM_LC(*scan))
3703 LOAD_UTF8_CHARCLASS(space," ");
3704 while (hardcount < max && scan < loceol &&
3706 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
3707 scan += UTF8SKIP(scan);
3711 while (scan < loceol && isSPACE(*scan))
3716 PL_reg_flags |= RF_tainted;
3719 while (hardcount < max && scan < loceol &&
3720 (*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
3721 scan += UTF8SKIP(scan);
3725 while (scan < loceol && isSPACE_LC(*scan))
3732 LOAD_UTF8_CHARCLASS(space," ");
3733 while (hardcount < max && scan < loceol &&
3735 swash_fetch(PL_utf8_space,(U8*)scan, do_utf8))) {
3736 scan += UTF8SKIP(scan);
3740 while (scan < loceol && !isSPACE(*scan))
3745 PL_reg_flags |= RF_tainted;
3748 while (hardcount < max && scan < loceol &&
3749 !(*scan == ' ' || isSPACE_LC_utf8((U8*)scan))) {
3750 scan += UTF8SKIP(scan);
3754 while (scan < loceol && !isSPACE_LC(*scan))
3761 LOAD_UTF8_CHARCLASS(digit,"0");
3762 while (hardcount < max && scan < loceol &&
3763 swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
3764 scan += UTF8SKIP(scan);
3768 while (scan < loceol && isDIGIT(*scan))
3775 LOAD_UTF8_CHARCLASS(digit,"0");
3776 while (hardcount < max && scan < loceol &&
3777 !swash_fetch(PL_utf8_digit, (U8*)scan, do_utf8)) {
3778 scan += UTF8SKIP(scan);
3782 while (scan < loceol && !isDIGIT(*scan))
3786 default: /* Called on something of 0 width. */
3787 break; /* So match right here or not at all. */
3793 c = scan - PL_reginput;
3798 SV *prop = sv_newmortal();
3801 PerlIO_printf(Perl_debug_log,
3802 "%*s %s can match %"IVdf" times out of %"IVdf"...\n",
3803 REPORT_CODE_OFF+1, "", SvPVX(prop),(IV)c,(IV)max);
3810 - regrepeat_hard - repeatedly match something, report total lenth and length
3812 * The repeater is supposed to have constant length.
3816 S_regrepeat_hard(pTHX_ regnode *p, I32 max, I32 *lp)
3818 register char *scan = Nullch;
3819 register char *start;
3820 register char *loceol = PL_regeol;
3822 I32 count = 0, res = 1;
3827 start = PL_reginput;
3828 if (DO_UTF8(PL_reg_sv)) {
3829 while (PL_reginput < loceol && (scan = PL_reginput, res = regmatch(p))) {
3832 while (start < PL_reginput) {
3834 start += UTF8SKIP(start);
3845 while (PL_reginput < loceol && (scan = PL_reginput, res = regmatch(p))) {
3847 *lp = l = PL_reginput - start;
3848 if (max != REG_INFTY && l*max < loceol - scan)
3849 loceol = scan + l*max;
3862 - regclass_swash - prepare the utf8 swash
3866 Perl_regclass_swash(pTHX_ register regnode* node, bool doinit, SV** initsvp)
3871 if (PL_regdata && PL_regdata->count) {
3874 if (PL_regdata->what[n] == 's') {
3875 SV *rv = (SV*)PL_regdata->data[n];
3876 AV *av = (AV*)SvRV((SV*)rv);
3879 si = *av_fetch(av, 0, FALSE);
3880 a = av_fetch(av, 1, FALSE);
3884 else if (si && doinit) {
3885 sw = swash_init("utf8", "", si, 1, 0);
3886 (void)av_store(av, 1, sw);
3898 - reginclass - determine if a character falls into a character class
3902 S_reginclass(pTHX_ register regnode *n, register U8* p, register bool do_utf8)
3904 char flags = ANYOF_FLAGS(n);
3909 c = do_utf8 ? utf8_to_uvchr(p, &len) : *p;
3911 if (do_utf8 || (flags & ANYOF_UNICODE)) {
3912 if (do_utf8 && !ANYOF_RUNTIME(n)) {
3913 if (len != (STRLEN)-1 && c < 256 && ANYOF_BITMAP_TEST(n, c))
3916 if (!match && do_utf8 && (flags & ANYOF_UNICODE_ALL) && c >= 256)
3919 SV *sw = regclass_swash(n, TRUE, 0);
3922 if (swash_fetch(sw, p, do_utf8))
3924 else if (flags & ANYOF_FOLD) {
3925 U8 tmpbuf[UTF8_MAXLEN+1];
3927 if (flags & ANYOF_LOCALE) {
3928 PL_reg_flags |= RF_tainted;
3929 uvchr_to_utf8(tmpbuf, toLOWER_LC_utf8(p));
3932 uvchr_to_utf8(tmpbuf, toLOWER_utf8(p));
3933 if (swash_fetch(sw, tmpbuf, do_utf8))
3939 if (!match && c < 256) {
3940 if (ANYOF_BITMAP_TEST(n, c))
3942 else if (flags & ANYOF_FOLD) {
3945 if (flags & ANYOF_LOCALE) {
3946 PL_reg_flags |= RF_tainted;
3947 f = PL_fold_locale[c];
3951 if (f != c && ANYOF_BITMAP_TEST(n, f))
3955 if (!match && (flags & ANYOF_CLASS)) {
3956 PL_reg_flags |= RF_tainted;
3958 (ANYOF_CLASS_TEST(n, ANYOF_ALNUM) && isALNUM_LC(c)) ||
3959 (ANYOF_CLASS_TEST(n, ANYOF_NALNUM) && !isALNUM_LC(c)) ||
3960 (ANYOF_CLASS_TEST(n, ANYOF_SPACE) && isSPACE_LC(c)) ||
3961 (ANYOF_CLASS_TEST(n, ANYOF_NSPACE) && !isSPACE_LC(c)) ||
3962 (ANYOF_CLASS_TEST(n, ANYOF_DIGIT) && isDIGIT_LC(c)) ||
3963 (ANYOF_CLASS_TEST(n, ANYOF_NDIGIT) && !isDIGIT_LC(c)) ||
3964 (ANYOF_CLASS_TEST(n, ANYOF_ALNUMC) && isALNUMC_LC(c)) ||
3965 (ANYOF_CLASS_TEST(n, ANYOF_NALNUMC) && !isALNUMC_LC(c)) ||
3966 (ANYOF_CLASS_TEST(n, ANYOF_ALPHA) && isALPHA_LC(c)) ||
3967 (ANYOF_CLASS_TEST(n, ANYOF_NALPHA) && !isALPHA_LC(c)) ||
3968 (ANYOF_CLASS_TEST(n, ANYOF_ASCII) && isASCII(c)) ||
3969 (ANYOF_CLASS_TEST(n, ANYOF_NASCII) && !isASCII(c)) ||
3970 (ANYOF_CLASS_TEST(n, ANYOF_CNTRL) && isCNTRL_LC(c)) ||
3971 (ANYOF_CLASS_TEST(n, ANYOF_NCNTRL) && !isCNTRL_LC(c)) ||
3972 (ANYOF_CLASS_TEST(n, ANYOF_GRAPH) && isGRAPH_LC(c)) ||
3973 (ANYOF_CLASS_TEST(n, ANYOF_NGRAPH) && !isGRAPH_LC(c)) ||
3974 (ANYOF_CLASS_TEST(n, ANYOF_LOWER) && isLOWER_LC(c)) ||
3975 (ANYOF_CLASS_TEST(n, ANYOF_NLOWER) && !isLOWER_LC(c)) ||
3976 (ANYOF_CLASS_TEST(n, ANYOF_PRINT) && isPRINT_LC(c)) ||
3977 (ANYOF_CLASS_TEST(n, ANYOF_NPRINT) && !isPRINT_LC(c)) ||
3978 (ANYOF_CLASS_TEST(n, ANYOF_PUNCT) && isPUNCT_LC(c)) ||
3979 (ANYOF_CLASS_TEST(n, ANYOF_NPUNCT) && !isPUNCT_LC(c)) ||
3980 (ANYOF_CLASS_TEST(n, ANYOF_UPPER) && isUPPER_LC(c)) ||
3981 (ANYOF_CLASS_TEST(n, ANYOF_NUPPER) && !isUPPER_LC(c)) ||
3982 (ANYOF_CLASS_TEST(n, ANYOF_XDIGIT) && isXDIGIT(c)) ||
3983 (ANYOF_CLASS_TEST(n, ANYOF_NXDIGIT) && !isXDIGIT(c)) ||
3984 (ANYOF_CLASS_TEST(n, ANYOF_PSXSPC) && isPSXSPC(c)) ||
3985 (ANYOF_CLASS_TEST(n, ANYOF_NPSXSPC) && !isPSXSPC(c)) ||
3986 (ANYOF_CLASS_TEST(n, ANYOF_BLANK) && isBLANK(c)) ||
3987 (ANYOF_CLASS_TEST(n, ANYOF_NBLANK) && !isBLANK(c))
3988 ) /* How's that for a conditional? */
3995 return (flags & ANYOF_INVERT) ? !match : match;
3999 S_reghop(pTHX_ U8 *s, I32 off)
4001 return S_reghop3(aTHX_ s, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr));
4005 S_reghop3(pTHX_ U8 *s, I32 off, U8* lim)
4008 while (off-- && s < lim) {
4009 /* XXX could check well-formedness here */
4017 if (UTF8_IS_CONTINUED(*s)) {
4018 while (s > (U8*)lim && UTF8_IS_CONTINUATION(*s))
4021 /* XXX could check well-formedness here */
4029 S_reghopmaybe(pTHX_ U8 *s, I32 off)
4031 return S_reghopmaybe3(aTHX_ s, off, (U8*)(off >= 0 ? PL_regeol : PL_bostr));
4035 S_reghopmaybe3(pTHX_ U8* s, I32 off, U8* lim)
4038 while (off-- && s < lim) {
4039 /* XXX could check well-formedness here */
4049 if (UTF8_IS_CONTINUED(*s)) {
4050 while (s > (U8*)lim && UTF8_IS_CONTINUATION(*s))
4053 /* XXX could check well-formedness here */
4069 restore_pos(pTHXo_ void *arg)
4071 if (PL_reg_eval_set) {
4072 if (PL_reg_oldsaved) {
4073 PL_reg_re->subbeg = PL_reg_oldsaved;
4074 PL_reg_re->sublen = PL_reg_oldsavedlen;
4075 RX_MATCH_COPIED_on(PL_reg_re);
4077 PL_reg_magic->mg_len = PL_reg_oldpos;
4078 PL_reg_eval_set = 0;
4079 PL_curpm = PL_reg_oldcurpm;