5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
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.
24 * pregcomp and pregexec -- regsub and regerror are not used in perl
26 * Copyright (c) 1986 by University of Toronto.
27 * Written by Henry Spencer. Not derived from licensed software.
29 * Permission is granted to anyone to use this software for any
30 * purpose on any computer system, and to redistribute it freely,
31 * subject to the following restrictions:
33 * 1. The author is not responsible for the consequences of use of
34 * this software, no matter how awful, even if they arise
37 * 2. The origin of this software must not be misrepresented, either
38 * by explicit claim or by omission.
40 * 3. Altered versions must be plainly marked as such, and must not
41 * be misrepresented as being the original software.
44 **** Alterations to Henry's code are...
46 **** Copyright (c) 1991-1997, Larry Wall
48 **** You may distribute under the terms of either the GNU General Public
49 **** License or the Artistic License, as specified in the README file.
52 * Beware that some of this code is subtly aware of the way operator
53 * precedence is structured in regular expressions. Serious changes in
54 * regular-expression syntax might require a total rethink.
67 static regnode regdummy;
68 static char * regparse; /* Input-scan pointer. */
69 static char * regxend; /* End of input for compile */
70 static regnode * regcode; /* Code-emit pointer; ®dummy = don't. */
71 static I32 regnaughty; /* How bad is this pattern? */
72 static I32 regsawback; /* Did we see \1, ...? */
74 /* This guys appear both in regcomp.c and regexec.c, but there is no
75 other reason to have them global. */
76 static char * regprecomp; /* uncompiled string. */
77 static I32 regnpar; /* () count. */
78 static I32 regsize; /* Code size. */
79 static U16 regflags; /* are we folding, multilining? */
82 # if defined(BUGGY_MSC6)
83 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
84 # pragma optimize("a",off)
85 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
86 # pragma optimize("w",on )
87 # endif /* BUGGY_MSC6 */
94 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
95 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
96 ((*s) == '{' && regcurly(s)))
98 #define PERL_META "^$.[()|?+*\\"
100 #define META "^$.[()|?+*\\"
104 #undef SPSTART /* dratted cpp namespace... */
107 * Flags to be passed up and down.
109 #define WORST 0 /* Worst case. */
110 #define HASWIDTH 0x1 /* Known never to match null string. */
111 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
112 #define SPSTART 0x4 /* Starts with * or +. */
113 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
116 * Forward declarations for pregcomp()'s friends.
119 static regnode *reg _((I32, I32 *));
120 static regnode *reganode _((U8, U32));
121 static regnode *regatom _((I32 *));
122 static regnode *regbranch _((I32 *, I32));
123 static void regc _((U8, char *));
124 static regnode *regclass _((void));
125 STATIC I32 regcurly _((char *));
126 static regnode *reg_node _((U8));
127 static regnode *regpiece _((I32 *));
128 static void reginsert _((U8, regnode *));
129 static void regoptail _((regnode *, regnode *));
130 static void regset _((char *, I32));
131 static void regtail _((regnode *, regnode *));
132 static char* regwhite _((char *, char *));
133 static char* nextchar _((void));
136 static I32 seen_zerolen;
145 /* Length of a variant. */
153 I32 last_end; /* min value, <0 unless valid. */
156 SV **longest; /* Either &l_fixed, or &l_float. */
160 I32 offset_float_min;
161 I32 offset_float_max;
165 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
167 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
168 #define SF_BEFORE_SEOL 0x1
169 #define SF_BEFORE_MEOL 0x2
170 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
171 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
173 #define SF_FIX_SHIFT_EOL (+2)
174 #define SF_FL_SHIFT_EOL (+4)
176 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
177 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
179 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
180 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
181 #define SF_IS_INF 0x40
182 #define SF_HAS_PAR 0x80
183 #define SF_IN_PAR 0x100
184 #define SF_HAS_EVAL 0x200
187 scan_commit(scan_data_t *data)
189 STRLEN l = SvCUR(data->last_found);
190 STRLEN old_l = SvCUR(*data->longest);
192 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
193 sv_setsv(*data->longest, data->last_found);
194 if (*data->longest == data->longest_fixed) {
195 data->offset_fixed = l ? data->last_start_min : data->pos_min;
196 if (data->flags & SF_BEFORE_EOL)
198 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
200 data->flags &= ~SF_FIX_BEFORE_EOL;
202 data->offset_float_min = l ? data->last_start_min : data->pos_min;
203 data->offset_float_max = (l
204 ? data->last_start_max
205 : data->pos_min + data->pos_delta);
206 if (data->flags & SF_BEFORE_EOL)
208 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
210 data->flags &= ~SF_FL_BEFORE_EOL;
213 SvCUR_set(data->last_found, 0);
215 data->flags &= ~SF_BEFORE_EOL;
218 #define SCF_DO_SUBSTR 1
220 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
221 to the position after last scanned or to NULL. */
224 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
225 /* scanp: Start here (read-write). */
226 /* deltap: Write maxlen-minlen here. */
227 /* last: Stop before this one. */
229 I32 min = 0, pars = 0, code;
230 regnode *scan = *scanp, *next;
232 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
233 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
234 scan_data_t data_fake;
236 while (scan && OP(scan) != END && scan < last) {
237 /* Peephole optimizer: */
239 if (regkind[(U8)OP(scan)] == EXACT) {
240 regnode *n = regnext(scan);
243 regnode *stop = scan;
246 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
247 /* Skip NOTHING, merge EXACT*. */
249 ( regkind[(U8)OP(n)] == NOTHING ||
250 (stringok && (OP(n) == OP(scan))))
252 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
253 if (OP(n) == TAIL || n > next)
255 if (regkind[(U8)OP(n)] == NOTHING) {
256 NEXT_OFF(scan) += NEXT_OFF(n);
257 next = n + NODE_STEP_REGNODE;
264 int oldl = *OPERAND(scan);
265 regnode *nnext = regnext(n);
267 if (oldl + *OPERAND(n) > U8_MAX)
269 NEXT_OFF(scan) += NEXT_OFF(n);
270 *OPERAND(scan) += *OPERAND(n);
271 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
272 /* Now we can overwrite *n : */
273 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
274 *OPERAND(n) + 1, char);
284 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
286 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
295 if (OP(scan) != CURLYX) {
296 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
297 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
301 /* Skip NOTHING and LONGJMP. */
302 while ((n = regnext(n))
303 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
304 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
307 if (reg_off_by_arg[OP(scan)])
310 NEXT_OFF(scan) = off;
312 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
313 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
314 next = regnext(scan);
317 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
318 I32 max1 = 0, min1 = I32_MAX, num = 0;
320 if (flags & SCF_DO_SUBSTR)
322 while (OP(scan) == code) {
323 I32 deltanext, minnext;
327 next = regnext(scan);
328 scan = NEXTOPER(scan);
330 scan = NEXTOPER(scan);
331 /* We suppose the run is continuous, last=next...*/
332 minnext = study_chunk(&scan, &deltanext, next,
336 if (max1 < minnext + deltanext)
337 max1 = minnext + deltanext;
338 if (deltanext == I32_MAX)
341 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
343 if (data_fake.flags & SF_HAS_EVAL)
344 data->flags |= SF_HAS_EVAL;
348 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
350 if (flags & SCF_DO_SUBSTR) {
351 data->pos_min += min1;
352 data->pos_delta += max1 - min1;
353 if (max1 != min1 || is_inf)
354 data->longest = &(data->longest_float);
357 delta += max1 - min1;
358 } else if (code == BRANCHJ) /* single branch is optimized. */
359 scan = NEXTOPER(NEXTOPER(scan));
360 else /* single branch is optimized. */
361 scan = NEXTOPER(scan);
363 } else if (OP(scan) == EXACT) {
364 min += *OPERAND(scan);
365 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
366 I32 l = *OPERAND(scan);
368 /* The code below prefers earlier match for fixed
369 offset, later match for variable offset. */
370 if (data->last_end == -1) { /* Update the start info. */
371 data->last_start_min = data->pos_min;
372 data->last_start_max = is_inf
373 ? I32_MAX : data->pos_min + data->pos_delta;
375 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
376 data->last_end = data->pos_min + l;
377 data->pos_min += l; /* As in the first entry. */
378 data->flags &= ~SF_BEFORE_EOL;
380 } else if (regkind[(U8)OP(scan)] == EXACT) {
381 if (flags & SCF_DO_SUBSTR)
383 min += *OPERAND(scan);
384 if (data && (flags & SCF_DO_SUBSTR))
385 data->pos_min += *OPERAND(scan);
386 } else if (strchr(varies,OP(scan))) {
387 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
388 regnode *oscan = scan;
390 switch (regkind[(U8)OP(scan)]) {
392 scan = NEXTOPER(scan);
395 if (flags & SCF_DO_SUBSTR) {
396 next = NEXTOPER(scan);
397 if (OP(next) == EXACT) {
399 maxcount = REG_INFTY;
400 next = regnext(scan);
401 scan = NEXTOPER(scan);
405 if (flags & SCF_DO_SUBSTR)
411 scan = regnext(scan);
412 if (flags & SCF_DO_SUBSTR) {
414 data->longest = &(data->longest_float);
416 goto optimize_curly_tail;
418 mincount = ARG1(scan);
419 maxcount = ARG2(scan);
420 next = regnext(scan);
421 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
423 if (flags & SCF_DO_SUBSTR) {
424 if (mincount == 0) scan_commit(data);
425 pos_before = data->pos_min;
429 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
431 data->flags |= SF_IS_INF;
433 /* This will finish on WHILEM, setting scan, or on NULL: */
434 minnext = study_chunk(&scan, &deltanext, last, data,
436 ? (flags & ~SCF_DO_SUBSTR) : flags);
437 if (!scan) /* It was not CURLYX, but CURLY. */
439 if (dowarn && (minnext + deltanext == 0)
440 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
441 warn("Strange *+?{} on zero-length expression");
442 min += minnext * mincount;
443 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
444 || deltanext == I32_MAX);
445 delta += (minnext + deltanext) * maxcount - minnext * mincount;
447 /* Try powerful optimization CURLYX => CURLYN. */
448 #ifdef REGALIGN_STRUCT
449 if ( OP(oscan) == CURLYX && data
450 && data->flags & SF_IN_PAR
451 && !(data->flags & SF_HAS_EVAL)
452 && !deltanext && minnext == 1 ) {
453 /* Try to optimize to CURLYN. */
454 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
455 regnode *nxt1 = nxt, *nxt2;
459 if (!strchr(simple,OP(nxt))
460 && !(regkind[(U8)OP(nxt)] == EXACT
461 && *OPERAND(nxt) == 1))
465 if (OP(nxt) != CLOSE)
467 /* Now we know that nxt2 is the only contents: */
468 oscan->flags = ARG(nxt);
470 OP(nxt1) = NOTHING; /* was OPEN. */
472 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
473 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
474 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
475 OP(nxt) = OPTIMIZED; /* was CLOSE. */
476 OP(nxt + 1) = OPTIMIZED; /* was count. */
477 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
483 /* Try optimization CURLYX => CURLYM. */
484 if ( OP(oscan) == CURLYX && data
485 #ifdef REGALIGN_STRUCT
486 && !(data->flags & SF_HAS_PAR)
488 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
490 && !(data->flags & SF_HAS_EVAL)
492 /* XXXX How to optimize if data == 0? */
493 /* Optimize to a simpler form. */
494 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
498 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
499 && (OP(nxt2) != WHILEM))
501 OP(nxt2) = SUCCEED; /* Whas WHILEM */
502 #ifdef REGALIGN_STRUCT
503 /* Need to optimize away parenths. */
504 if (data->flags & SF_IN_PAR) {
505 /* Set the parenth number. */
506 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
508 if (OP(nxt) != CLOSE)
509 FAIL("panic opt close");
510 oscan->flags = ARG(nxt);
511 OP(nxt1) = OPTIMIZED; /* was OPEN. */
512 OP(nxt) = OPTIMIZED; /* was CLOSE. */
514 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
515 OP(nxt + 1) = OPTIMIZED; /* was count. */
516 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
517 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
520 while ( nxt1 && (OP(nxt1) != WHILEM)) {
521 regnode *nnxt = regnext(nxt1);
524 if (reg_off_by_arg[OP(nxt1)])
525 ARG_SET(nxt1, nxt2 - nxt1);
526 else if (nxt2 - nxt1 < U16_MAX)
527 NEXT_OFF(nxt1) = nxt2 - nxt1;
529 OP(nxt) = NOTHING; /* Cannot beautify */
534 /* Optimize again: */
535 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
540 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
542 if (flags & SCF_DO_SUBSTR) {
543 SV *last_str = Nullsv;
544 int counted = mincount != 0;
546 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
547 I32 b = pos_before >= data->last_start_min
548 ? pos_before : data->last_start_min;
550 char *s = SvPV(data->last_found, l);
552 l -= b - data->last_start_min;
553 /* Get the added string: */
554 last_str = newSVpv(s + b - data->last_start_min, l);
555 if (deltanext == 0 && pos_before == b) {
556 /* What was added is a constant string */
558 SvGROW(last_str, (mincount * l) + 1);
559 repeatcpy(SvPVX(last_str) + l,
560 SvPVX(last_str), l, mincount - 1);
561 SvCUR(last_str) *= mincount;
562 /* Add additional parts. */
563 SvCUR_set(data->last_found,
564 SvCUR(data->last_found) - l);
565 sv_catsv(data->last_found, last_str);
566 data->last_end += l * (mincount - 1);
570 /* It is counted once already... */
571 data->pos_min += minnext * (mincount - counted);
572 data->pos_delta += - counted * deltanext +
573 (minnext + deltanext) * maxcount - minnext * mincount;
574 if (mincount != maxcount) {
576 if (mincount && last_str) {
577 sv_setsv(data->last_found, last_str);
578 data->last_end = data->pos_min;
579 data->last_start_min =
580 data->pos_min - SvCUR(last_str);
581 data->last_start_max = is_inf
583 : data->pos_min + data->pos_delta
586 data->longest = &(data->longest_float);
589 if (fl & SF_HAS_EVAL)
590 data->flags |= SF_HAS_EVAL;
593 if (OP(oscan) != CURLYX) {
594 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
596 NEXT_OFF(oscan) += NEXT_OFF(next);
600 default: /* REF only? */
601 if (flags & SCF_DO_SUBSTR) {
603 data->longest = &(data->longest_float);
608 } else if (strchr(simple,OP(scan))) {
609 if (flags & SCF_DO_SUBSTR) {
614 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
615 data->flags |= (OP(scan) == MEOL
618 } else if (regkind[(U8)OP(scan)] == BRANCHJ
619 && (scan->flags || data)
620 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
621 I32 deltanext, minnext;
625 next = regnext(scan);
626 nscan = NEXTOPER(NEXTOPER(scan));
627 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
630 FAIL("variable length lookbehind not implemented");
631 } else if (minnext > U8_MAX) {
632 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
634 scan->flags = minnext;
636 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
638 if (data_fake.flags & SF_HAS_EVAL)
639 data->flags |= SF_HAS_EVAL;
640 } else if (OP(scan) == OPEN) {
642 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
643 #ifdef REGALIGN_STRUCT
644 next = regnext(scan);
646 if ( next && (OP(next) != WHILEM) && next < last)
648 is_par = 0; /* Disable optimization */
649 } else if (OP(scan) == EVAL) {
651 data->flags |= SF_HAS_EVAL;
653 /* Else: zero-length, ignore. */
654 scan = regnext(scan);
659 *deltap = is_inf ? I32_MAX : delta;
660 if (flags & SCF_DO_SUBSTR && is_inf)
661 data->pos_delta = I32_MAX - data->pos_min;
664 if (is_par && pars==1 && data) {
665 data->flags |= SF_IN_PAR;
666 data->flags &= ~SF_HAS_PAR;
667 } else if (pars && data) {
668 data->flags |= SF_HAS_PAR;
669 data->flags &= ~SF_IN_PAR;
675 add_data(I32 n, char *s)
679 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
680 char, struct reg_data);
681 Renew(rx->data->what, rx->data->count + n, U8);
682 rx->data->count += n;
684 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
685 char, struct reg_data);
686 New(1208, rx->data->what, n, U8);
689 Copy(s, rx->data->what + rx->data->count - n, n, U8);
690 return rx->data->count - n;
694 - pregcomp - compile a regular expression into internal code
696 * We can't allocate space until we know how big the compiled form will be,
697 * but we can't compile it (and thus know how big it is) until we've got a
698 * place to put the code. So we cheat: we compile it twice, once with code
699 * generation turned off and size counting turned on, and once "for real".
700 * This also means that we don't allocate space until we are sure that the
701 * thing really will compile successfully, and we never have to move the
702 * code and thus invalidate pointers into it. (Note that it has to be in
703 * one piece because free() must be able to free it all.) [NB: not true in perl]
705 * Beware that the optimization-preparation code in here knows about some
706 * of the structure of the compiled regexp. [I'll say.]
709 pregcomp(char *exp, char *xend, PMOP *pm)
723 FAIL("NULL regexp argument");
725 regprecomp = savepvn(exp, xend - exp);
726 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
727 xend - exp, regprecomp));
728 regflags = pm->op_pmflags;
732 seen_zerolen = *exp == '^' ? -1 : 0;
735 /* First pass: determine size, legality. */
742 regc((U8)MAGIC, (char*)regcode);
743 if (reg(0, &flags) == NULL) {
744 Safefree(regprecomp);
748 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
753 char *s = PerlEnv_getenv("TERMCAP_COLORS");
757 colors[0] = s = savepv(s);
761 FAIL("Not enough TABs in TERMCAP_COLORS");
770 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
771 colors[0],colors[1],colors[2],colors[3]);
775 /* Small enough for pointer-storage convention?
776 If extralen==0, this means that we will not need long jumps. */
777 #ifndef REGALIGN_STRUCT
778 if (regsize >= 0x10000L && extralen)
779 FAIL("regexp too big");
781 if (regsize >= 0x10000L && extralen)
787 /* Allocate space and initialize. */
788 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
791 FAIL("regexp out of space");
793 r->prelen = xend - exp;
794 r->precomp = regprecomp;
795 r->subbeg = r->subbase = NULL;
798 /* Second pass: emit code. */
803 regcode = r->program;
804 regc((U8)MAGIC, (char*) regcode++);
806 if (reg(0, &flags) == NULL)
809 /* Dig out information for optimizations. */
810 pm->op_pmflags = regflags;
812 r->regstclass = NULL;
813 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
814 scan = r->program + 1; /* First BRANCH. */
815 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
818 STRLEN longest_float_length, longest_fixed_length;
820 StructCopy(&zero_scan_data, &data, scan_data_t);
822 /* Skip introductions and multiplicators >= 1. */
823 while ((OP(first) == OPEN && (sawopen = 1)) ||
824 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
825 (OP(first) == PLUS) ||
826 (OP(first) == MINMOD) ||
827 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
828 if (OP(first) == PLUS)
831 first += regarglen[(U8)OP(first)];
832 first = NEXTOPER(first);
835 /* Starting-point info. */
837 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
838 else if (strchr(simple+2,OP(first)))
839 r->regstclass = first;
840 else if (regkind[(U8)OP(first)] == BOUND ||
841 regkind[(U8)OP(first)] == NBOUND)
842 r->regstclass = first;
843 else if (regkind[(U8)OP(first)] == BOL) {
844 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
845 first = NEXTOPER(first);
848 else if (OP(first) == GPOS) {
849 r->reganch |= ROPT_ANCH_GPOS;
850 first = NEXTOPER(first);
853 else if ((OP(first) == STAR &&
854 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
855 !(r->reganch & ROPT_ANCH) )
857 /* turn .* into ^.* with an implied $*=1 */
858 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
859 first = NEXTOPER(first);
862 if (sawplus && (!sawopen || !regsawback))
863 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
865 /* Scan is after the zeroth branch, first is atomic matcher. */
866 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
869 * If there's something expensive in the r.e., find the
870 * longest literal string that must appear and make it the
871 * regmust. Resolve ties in favor of later strings, since
872 * the regstart check works with the beginning of the r.e.
873 * and avoiding duplication strengthens checking. Not a
874 * strong reason, but sufficient in the absence of others.
875 * [Now we resolve ties in favor of the earlier string if
876 * it happens that c_offset_min has been invalidated, since the
877 * earlier string may buy us something the later one won't.]
881 data.longest_fixed = newSVpv("",0);
882 data.longest_float = newSVpv("",0);
883 data.last_found = newSVpv("",0);
884 data.longest = &(data.longest_fixed);
887 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
888 &data, SCF_DO_SUBSTR);
889 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
890 && data.last_start_min == 0 && data.last_end > 0
892 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
893 r->reganch |= ROPT_CHECK_ALL;
895 SvREFCNT_dec(data.last_found);
897 longest_float_length = SvCUR(data.longest_float);
898 if (longest_float_length
899 || (data.flags & SF_FL_BEFORE_EOL
900 && (!(data.flags & SF_FL_BEFORE_MEOL)
901 || (regflags & PMf_MULTILINE)))) {
902 if (SvCUR(data.longest_fixed)
903 && data.offset_fixed == data.offset_float_min)
904 goto remove; /* Like in (a)+. */
906 r->float_substr = data.longest_float;
907 r->float_min_offset = data.offset_float_min;
908 r->float_max_offset = data.offset_float_max;
909 fbm_compile(r->float_substr);
910 BmUSEFUL(r->float_substr) = 100;
911 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
912 && (!(data.flags & SF_FL_BEFORE_MEOL)
913 || (regflags & PMf_MULTILINE)))
914 SvTAIL_on(r->float_substr);
917 r->float_substr = Nullsv;
918 SvREFCNT_dec(data.longest_float);
919 longest_float_length = 0;
922 longest_fixed_length = SvCUR(data.longest_fixed);
923 if (longest_fixed_length
924 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
925 && (!(data.flags & SF_FIX_BEFORE_MEOL)
926 || (regflags & PMf_MULTILINE)))) {
927 r->anchored_substr = data.longest_fixed;
928 r->anchored_offset = data.offset_fixed;
929 fbm_compile(r->anchored_substr);
930 BmUSEFUL(r->anchored_substr) = 100;
931 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
932 && (!(data.flags & SF_FIX_BEFORE_MEOL)
933 || (regflags & PMf_MULTILINE)))
934 SvTAIL_on(r->anchored_substr);
936 r->anchored_substr = Nullsv;
937 SvREFCNT_dec(data.longest_fixed);
938 longest_fixed_length = 0;
941 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
942 if (longest_fixed_length > longest_float_length) {
943 r->check_substr = r->anchored_substr;
944 r->check_offset_min = r->check_offset_max = r->anchored_offset;
945 if (r->reganch & ROPT_ANCH_SINGLE)
946 r->reganch |= ROPT_NOSCAN;
948 r->check_substr = r->float_substr;
949 r->check_offset_min = data.offset_float_min;
950 r->check_offset_max = data.offset_float_max;
953 /* Several toplevels. Best we can is to set minlen. */
956 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
957 scan = r->program + 1;
958 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
959 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
962 r->nparens = regnpar - 1;
964 if (regseen & REG_SEEN_GPOS)
965 r->reganch |= ROPT_GPOS_SEEN;
966 if (regseen & REG_SEEN_LOOKBEHIND)
967 r->reganch |= ROPT_LOOKBEHIND_SEEN;
968 Newz(1002, r->startp, regnpar, char*);
969 Newz(1002, r->endp, regnpar, char*);
975 - reg - regular expression, i.e. main body or parenthesized thing
977 * Caller must absorb opening parenthesis.
979 * Combining parenthesis handling with the base level of regular expression
980 * is a trifle forced, but the need to tie the tails of the branches to what
981 * follows makes it hard to avoid.
984 reg(I32 paren, I32 *flagp)
985 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
987 register regnode *ret; /* Will be the head of the group. */
988 register regnode *br;
989 register regnode *lastbr;
990 register regnode *ender = 0;
991 register I32 parno = 0;
992 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
995 *flagp = HASWIDTH; /* Tentatively. */
997 /* Make an OPEN node, if parenthesized. */
999 if (*regparse == '?') {
1001 paren = *regparse++;
1002 ret = NULL; /* For look-ahead/behind. */
1005 #ifndef REGALIGN_STRUCT
1006 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
1008 regseen |= REG_SEEN_LOOKBEHIND;
1009 if (*regparse == '!')
1011 if (*regparse != '=' && *regparse != '!')
1022 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1025 while (*regparse && *regparse != ')')
1027 if (*regparse != ')')
1028 FAIL("Sequence (?#... not terminated");
1035 I32 count = 1, n = 0;
1039 OP_4tree *sop, *rop;
1042 while (count && (c = *regparse)) {
1043 if (c == '\\' && regparse[1])
1051 if (*regparse != ')')
1052 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1056 if (regparse - 1 - s)
1057 sv = newSVpv(s, regparse - 1 - s);
1059 sv = newSVpv("", 0);
1061 rop = sv_compile_2op(sv, &sop, "re", &av);
1063 n = add_data(3, "nso");
1064 rx->data->data[n] = (void*)rop;
1065 rx->data->data[n+1] = (void*)av;
1066 rx->data->data[n+2] = (void*)sop;
1068 } else { /* First pass */
1070 FAIL("Eval-group in insecure regular expression");
1074 return reganode(EVAL, n);
1078 if (regparse[0] == '?') {
1079 if (regparse[1] == '=' || regparse[1] == '!'
1080 || regparse[1] == '<'
1081 || regparse[1] == '{') { /* Lookahead or eval. */
1084 ret = reg_node(LOGICAL);
1085 regtail(ret, reg(1, &flag));
1088 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1089 parno = atoi(regparse++);
1091 while (isDIGIT(*regparse))
1093 ret = reganode(GROUPP, parno);
1094 if ((c = *nextchar()) != ')')
1095 FAIL2("Switch (?(number%c not recognized", c);
1097 regtail(ret, reganode(IFTHEN, 0));
1098 br = regbranch(&flags, 1);
1100 br = reganode(LONGJMP, 0);
1102 regtail(br, reganode(LONGJMP, 0));
1105 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1106 regbranch(&flags, 1);
1107 regtail(ret, lastbr);
1112 FAIL("Switch (?(condition)... contains too many branches");
1113 ender = reg_node(TAIL);
1116 regtail(lastbr, ender);
1117 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1119 regtail(ret, ender);
1122 FAIL2("Unknown condition for (?(%.2s", regparse);
1126 FAIL("Sequence (? incomplete");
1130 while (*regparse && strchr("iogcmsx", *regparse))
1131 pmflag(®flags, *regparse++);
1133 if (*regparse != ')')
1134 FAIL2("Sequence (?%c...) not recognized", *regparse);
1143 ret = reganode(OPEN, parno);
1149 /* Pick up the branches, linking them together. */
1150 br = regbranch(&flags, 1);
1153 if (*regparse == '|') {
1154 if (!SIZE_ONLY && extralen) {
1155 reginsert(BRANCHJ, br);
1157 reginsert(BRANCH, br);
1160 extralen += 1; /* For BRANCHJ-BRANCH. */
1161 } else if (paren == ':') {
1162 *flagp |= flags&SIMPLE;
1164 if (open) { /* Starts with OPEN. */
1165 regtail(ret, br); /* OPEN -> first. */
1166 } else if (paren != '?') /* Not Conditional */
1168 if (!(flags&HASWIDTH))
1169 *flagp &= ~HASWIDTH;
1170 *flagp |= flags&SPSTART;
1172 while (*regparse == '|') {
1173 if (!SIZE_ONLY && extralen) {
1174 ender = reganode(LONGJMP,0);
1175 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1178 extralen += 2; /* Account for LONGJMP. */
1180 br = regbranch(&flags, 0);
1183 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1185 if (!(flags&HASWIDTH))
1186 *flagp &= ~HASWIDTH;
1187 *flagp |= flags&SPSTART;
1190 if (have_branch || paren != ':') {
1191 /* Make a closing node, and hook it on the end. */
1194 ender = reg_node(TAIL);
1197 ender = reganode(CLOSE, parno);
1204 ender = reg_node(SUCCEED);
1205 *flagp &= ~HASWIDTH;
1208 ender = reg_node(END);
1211 regtail(lastbr, ender);
1214 /* Hook the tails of the branches to the closing node. */
1215 for (br = ret; br != NULL; br = regnext(br)) {
1216 regoptail(br, ender);
1223 static char parens[] = "=!<,>";
1225 if (paren && (p = strchr(parens, paren))) {
1226 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1227 int flag = (p - parens) > 1;
1230 node = SUSPEND, flag = 0;
1231 reginsert(node,ret);
1232 #ifdef REGALIGN_STRUCT
1235 regtail(ret, reg_node(TAIL));
1239 /* Check for proper termination. */
1240 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1241 FAIL("unmatched () in regexp");
1242 } else if (!paren && regparse < regxend) {
1243 if (*regparse == ')') {
1244 FAIL("unmatched () in regexp");
1246 FAIL("junk on end of regexp"); /* "Can't happen". */
1250 regflags = oregflags;
1257 - regbranch - one alternative of an | operator
1259 * Implements the concatenation operator.
1262 regbranch(I32 *flagp, I32 first)
1264 register regnode *ret;
1265 register regnode *chain = NULL;
1266 register regnode *latest;
1267 I32 flags = 0, c = 0;
1272 if (!SIZE_ONLY && extralen)
1273 ret = reganode(BRANCHJ,0);
1275 ret = reg_node(BRANCH);
1278 if (!first && SIZE_ONLY)
1279 extralen += 1; /* BRANCHJ */
1281 *flagp = WORST; /* Tentatively. */
1285 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1287 latest = regpiece(&flags);
1288 if (latest == NULL) {
1289 if (flags & TRYAGAIN)
1292 } else if (ret == NULL)
1294 *flagp |= flags&HASWIDTH;
1295 if (chain == NULL) /* First piece. */
1296 *flagp |= flags&SPSTART;
1299 regtail(chain, latest);
1304 if (chain == NULL) { /* Loop ran zero times. */
1305 chain = reg_node(NOTHING);
1310 *flagp |= flags&SIMPLE;
1317 - regpiece - something followed by possible [*+?]
1319 * Note that the branching code sequences used for ? and the general cases
1320 * of * and + are somewhat optimized: they use the same NOTHING node as
1321 * both the endmarker for their branch list and the body of the last branch.
1322 * It might seem that this node could be dispensed with entirely, but the
1323 * endmarker role is not redundant.
1326 regpiece(I32 *flagp)
1328 register regnode *ret;
1330 register char *next;
1332 char *origparse = regparse;
1335 I32 max = REG_INFTY;
1337 ret = regatom(&flags);
1339 if (flags & TRYAGAIN)
1346 if (op == '{' && regcurly(regparse)) {
1347 next = regparse + 1;
1349 while (isDIGIT(*next) || *next == ',') {
1358 if (*next == '}') { /* got one */
1362 min = atoi(regparse);
1368 if (!max && *maxpos != '0')
1369 max = REG_INFTY; /* meaning "infinity" */
1370 else if (max >= REG_INFTY)
1371 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1376 if ((flags&SIMPLE)) {
1377 regnaughty += 2 + regnaughty / 2;
1378 reginsert(CURLY, ret);
1381 regnaughty += 4 + regnaughty; /* compound interest */
1382 regtail(ret, reg_node(WHILEM));
1383 if (!SIZE_ONLY && extralen) {
1384 reginsert(LONGJMP,ret);
1385 reginsert(NOTHING,ret);
1386 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1388 reginsert(CURLYX,ret);
1389 if (!SIZE_ONLY && extralen)
1390 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1391 regtail(ret, reg_node(NOTHING));
1395 #ifdef REGALIGN_STRUCT
1400 *flagp = (WORST|HASWIDTH);
1401 if (max && max < min)
1402 FAIL("Can't do {n,m} with n > m");
1417 #if 0 /* Now runtime fix should be reliable. */
1418 if (!(flags&HASWIDTH) && op != '?')
1419 FAIL("regexp *+ operand could be empty");
1424 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1426 if (op == '*' && (flags&SIMPLE)) {
1427 reginsert(STAR, ret);
1428 #ifdef REGALIGN_STRUCT
1433 else if (op == '*') {
1436 } else if (op == '+' && (flags&SIMPLE)) {
1437 reginsert(PLUS, ret);
1438 #ifdef REGALIGN_STRUCT
1443 else if (op == '+') {
1446 } else if (op == '?') {
1451 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1452 warn("%.*s matches null string many times",
1453 regparse - origparse, origparse);
1456 if (*regparse == '?') {
1458 reginsert(MINMOD, ret);
1460 regtail(ret, ret + NODE_STEP_REGNODE);
1462 regtail(ret, ret + 3);
1465 if (ISMULT2(regparse))
1466 FAIL("nested *?+ in regexp");
1472 - regatom - the lowest level
1474 * Optimization: gobbles an entire sequence of ordinary characters so that
1475 * it can turn them into a single node, which is smaller to store and
1476 * faster to run. Backslashed characters are exceptions, each becoming a
1477 * separate node; the code is simpler that way and it's not worth fixing.
1479 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1484 register regnode *ret = 0;
1487 *flagp = WORST; /* Tentatively. */
1490 switch (*regparse) {
1494 if (regflags & PMf_MULTILINE)
1495 ret = reg_node(MBOL);
1496 else if (regflags & PMf_SINGLELINE)
1497 ret = reg_node(SBOL);
1499 ret = reg_node(BOL);
1505 if (regflags & PMf_MULTILINE)
1506 ret = reg_node(MEOL);
1507 else if (regflags & PMf_SINGLELINE)
1508 ret = reg_node(SEOL);
1510 ret = reg_node(EOL);
1514 if (regflags & PMf_SINGLELINE)
1515 ret = reg_node(SANY);
1517 ret = reg_node(ANY);
1519 *flagp |= HASWIDTH|SIMPLE;
1524 *flagp |= HASWIDTH|SIMPLE;
1528 ret = reg(1, &flags);
1530 if (flags & TRYAGAIN)
1534 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1538 if (flags & TRYAGAIN) {
1542 FAIL2("internal urp in regexp at /%s/", regparse);
1543 /* Supposed to be caught earlier. */
1546 if (!regcurly(regparse)) {
1554 FAIL("?+*{} follows nothing in regexp");
1557 switch (*++regparse) {
1560 ret = reg_node(SBOL);
1565 ret = reg_node(GPOS);
1566 regseen |= REG_SEEN_GPOS;
1571 ret = reg_node(SEOL);
1576 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1577 *flagp |= HASWIDTH|SIMPLE;
1581 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1582 *flagp |= HASWIDTH|SIMPLE;
1587 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1593 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1598 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1599 *flagp |= HASWIDTH|SIMPLE;
1603 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1604 *flagp |= HASWIDTH|SIMPLE;
1608 ret = reg_node(DIGIT);
1609 *flagp |= HASWIDTH|SIMPLE;
1613 ret = reg_node(NDIGIT);
1614 *flagp |= HASWIDTH|SIMPLE;
1627 case '1': case '2': case '3': case '4':
1628 case '5': case '6': case '7': case '8': case '9':
1630 I32 num = atoi(regparse);
1632 if (num > 9 && num >= regnpar)
1636 ret = reganode((regflags & PMf_FOLD)
1637 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1640 while (isDIGIT(*regparse))
1648 if (regparse >= regxend)
1649 FAIL("trailing \\ in regexp");
1657 if (regflags & PMf_EXTENDED) {
1658 while (regparse < regxend && *regparse != '\n') regparse++;
1659 if (regparse < regxend)
1674 ret = reg_node((regflags & PMf_FOLD)
1675 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1677 s = (char *) OPERAND(ret);
1678 regc(0, s++); /* save spot for len */
1679 for (len = 0, p = regparse - 1;
1680 len < 127 && p < regxend;
1685 if (regflags & PMf_EXTENDED)
1686 p = regwhite(p, regxend);
1736 ender = scan_hex(++p, 2, &numlen);
1741 ender = UCHARAT(p++);
1742 ender = toCTRL(ender);
1744 case '0': case '1': case '2': case '3':case '4':
1745 case '5': case '6': case '7': case '8':case '9':
1747 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1748 ender = scan_oct(p, 3, &numlen);
1758 FAIL("trailing \\ in regexp");
1769 if (regflags & PMf_EXTENDED)
1770 p = regwhite(p, regxend);
1771 if (ISMULT2(p)) { /* Back off on ?+*. */
1786 FAIL("internal disaster in regexp");
1792 *OPERAND(ret) = len;
1795 #ifdef REGALIGN_STRUCT
1796 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1799 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1809 regwhite(char *p, char *e)
1814 else if (*p == '#') {
1817 } while (p < e && *p != '\n');
1826 regset(char *opnd, register I32 c)
1831 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1837 register char *opnd, *s;
1839 register I32 lastclass = 1234;
1840 register I32 range = 0;
1841 register regnode *ret;
1845 s = opnd = (char *) OPERAND(regcode);
1846 ret = reg_node(ANYOF);
1847 for (Class = 0; Class < 33; Class++)
1849 if (*regparse == '^') { /* Complement of range. */
1853 *opnd |= ANYOF_INVERT;
1856 regcode += ANY_SKIP;
1857 if (regflags & PMf_FOLD)
1858 *opnd |= ANYOF_FOLD;
1859 if (regflags & PMf_LOCALE)
1860 *opnd |= ANYOF_LOCALE;
1862 regsize += ANY_SKIP;
1864 if (*regparse == ']' || *regparse == '-')
1865 goto skipcond; /* allow 1st char to be ] or - */
1866 while (regparse < regxend && *regparse != ']') {
1868 Class = UCHARAT(regparse++);
1869 if (Class == '[' && regparse + 1 < regxend &&
1870 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1871 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1872 char posixccc = *regparse;
1873 char* posixccs = regparse++;
1875 while (regparse < regxend && *regparse != posixccc)
1877 if (regparse == regxend)
1878 /* Grandfather lone [:, [=, [. */
1879 regparse = posixccs;
1881 regparse++; /* skip over the posixccc */
1882 if (*regparse == ']') {
1883 /* Not Implemented Yet.
1884 * (POSIX Extended Character Classes, that is)
1885 * The text between e.g. [: and :] would start
1886 * at posixccs + 1 and stop at regparse - 2. */
1887 if (dowarn && !SIZE_ONLY)
1888 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1889 regparse++; /* skip over the ending ] */
1893 if (Class == '\\') {
1894 Class = UCHARAT(regparse++);
1897 if (regflags & PMf_LOCALE) {
1899 *opnd |= ANYOF_ALNUML;
1902 for (Class = 0; Class < 256; Class++)
1904 regset(opnd, Class);
1909 if (regflags & PMf_LOCALE) {
1911 *opnd |= ANYOF_NALNUML;
1914 for (Class = 0; Class < 256; Class++)
1915 if (!isALNUM(Class))
1916 regset(opnd, Class);
1921 if (regflags & PMf_LOCALE) {
1923 *opnd |= ANYOF_SPACEL;
1926 for (Class = 0; Class < 256; Class++)
1928 regset(opnd, Class);
1933 if (regflags & PMf_LOCALE) {
1935 *opnd |= ANYOF_NSPACEL;
1938 for (Class = 0; Class < 256; Class++)
1939 if (!isSPACE(Class))
1940 regset(opnd, Class);
1945 for (Class = '0'; Class <= '9'; Class++)
1946 regset(opnd, Class);
1950 for (Class = 0; Class < '0'; Class++)
1951 regset(opnd, Class);
1952 for (Class = '9' + 1; Class < 256; Class++)
1953 regset(opnd, Class);
1978 Class = scan_hex(regparse, 2, &numlen);
1982 Class = UCHARAT(regparse++);
1983 Class = toCTRL(Class);
1985 case '0': case '1': case '2': case '3': case '4':
1986 case '5': case '6': case '7': case '8': case '9':
1987 Class = scan_oct(--regparse, 3, &numlen);
1993 if (lastclass > Class)
1994 FAIL("invalid [] range in regexp");
1999 if (*regparse == '-' && regparse+1 < regxend &&
2000 regparse[1] != ']') {
2003 continue; /* do it next time */
2006 for ( ; lastclass <= Class; lastclass++)
2007 regset(opnd, lastclass);
2010 if (*regparse != ']')
2011 FAIL("unmatched [] in regexp");
2019 char* retval = regparse++;
2022 if (*regparse == '(' && regparse[1] == '?' &&
2023 regparse[2] == '#') {
2024 while (*regparse && *regparse != ')')
2029 if (regflags & PMf_EXTENDED) {
2030 if (isSPACE(*regparse)) {
2034 else if (*regparse == '#') {
2035 while (*regparse && *regparse != '\n')
2046 - reg_node - emit a node
2048 static regnode * /* Location. */
2049 #ifdef CAN_PROTOTYPE
2056 register regnode *ret;
2057 register regnode *ptr;
2061 SIZE_ALIGN(regsize);
2062 #ifdef REGALIGN_STRUCT
2070 NODE_ALIGN_FILL(ret);
2072 FILL_ADVANCE_NODE(ptr, op);
2079 - reganode - emit a node with an argument
2081 static regnode * /* Location. */
2082 #ifdef CAN_PROTOTYPE
2083 reganode(U8 op, U32 arg)
2090 register regnode *ret;
2091 register regnode *ptr;
2095 SIZE_ALIGN(regsize);
2104 NODE_ALIGN_FILL(ret);
2106 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2113 - regc - emit (if appropriate) a byte of code
2115 #ifdef CAN_PROTOTYPE
2130 - reginsert - insert an operator in front of already-emitted operand
2132 * Means relocating the operand.
2134 #ifdef CAN_PROTOTYPE
2136 reginsert(U8 op, regnode *opnd)
2144 register regnode *src;
2145 register regnode *dst;
2146 register regnode *place;
2147 register int offset = regarglen[(U8)op];
2149 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2152 regsize += NODE_STEP_REGNODE + offset;
2157 regcode += NODE_STEP_REGNODE + offset;
2160 StructCopy(--src, --dst, regnode);
2162 place = opnd; /* Op node, where operand used to be. */
2163 src = NEXTOPER(place);
2164 FILL_ADVANCE_NODE(place, op);
2165 Zero(src, offset, regnode);
2166 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2167 src[offset + 1] = '\177';
2172 - regtail - set the next-pointer at the end of a node chain of p to val.
2175 regtail(regnode *p, regnode *val)
2177 register regnode *scan;
2178 register regnode *temp;
2179 register I32 offset;
2184 /* Find last node. */
2187 temp = regnext(scan);
2194 # ifdef REGALIGN_STRUCT
2195 if (reg_off_by_arg[OP(scan)]) {
2196 ARG_SET(scan, val - scan);
2198 NEXT_OFF(scan) = val - scan;
2201 offset = val - scan;
2203 *(short*)(scan+1) = offset;
2207 if (OP(scan) == BACK)
2208 offset = scan - val;
2210 offset = val - scan;
2211 *(scan+1) = (offset>>8)&0377;
2212 *(scan+2) = offset&0377;
2217 - regoptail - regtail on operand of first argument; nop if operandless
2220 regoptail(regnode *p, regnode *val)
2222 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2223 if (p == NULL || SIZE_ONLY)
2225 if (regkind[(U8)OP(p)] == BRANCH) {
2226 regtail(NEXTOPER(p), val);
2227 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2228 regtail(NEXTOPER(NEXTOPER(p)), val);
2234 - regcurly - a little FSA that accepts {\d+,?\d*}
2237 regcurly(register char *s)
2257 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2259 register char op = EXACT; /* Arbitrary non-END op. */
2260 register regnode *next, *onode;
2262 while (op != END && (!last || node < last)) {
2263 /* While that wasn't END last time... */
2269 next = regnext(node);
2271 if (OP(node) == OPTIMIZED)
2274 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2275 2*l + 1, "", SvPVX(sv));
2276 if (next == NULL) /* Next ptr. */
2277 PerlIO_printf(Perl_debug_log, "(0)");
2279 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2280 (void)PerlIO_putc(Perl_debug_log, '\n');
2282 if (regkind[(U8)op] == BRANCHJ) {
2283 register regnode *nnode = (OP(next) == LONGJMP
2286 if (last && nnode > last)
2288 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2289 } else if (regkind[(U8)op] == BRANCH) {
2290 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2291 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2292 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2293 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2294 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2295 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2297 } else if ( op == PLUS || op == STAR) {
2298 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2299 } else if (op == ANYOF) {
2300 node = NEXTOPER(node);
2302 } else if (regkind[(U8)op] == EXACT) {
2303 /* Literal string, where present. */
2304 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2305 node = NEXTOPER(node);
2307 node = NEXTOPER(node);
2308 node += regarglen[(U8)op];
2310 if (op == CURLYX || op == OPEN)
2312 else if (op == WHILEM)
2319 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2324 SV *sv = sv_newmortal();
2326 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2328 /* Header fields of interest. */
2329 if (r->anchored_substr)
2330 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2332 SvPVX(r->anchored_substr),
2334 SvTAIL(r->anchored_substr) ? "$" : "",
2335 r->anchored_offset);
2336 if (r->float_substr)
2337 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2339 SvPVX(r->float_substr),
2341 SvTAIL(r->float_substr) ? "$" : "",
2342 r->float_min_offset, r->float_max_offset);
2343 if (r->check_substr)
2344 PerlIO_printf(Perl_debug_log,
2345 r->check_substr == r->float_substr
2346 ? "(checking floating" : "(checking anchored");
2347 if (r->reganch & ROPT_NOSCAN)
2348 PerlIO_printf(Perl_debug_log, " noscan");
2349 if (r->reganch & ROPT_CHECK_ALL)
2350 PerlIO_printf(Perl_debug_log, " isall");
2351 if (r->check_substr)
2352 PerlIO_printf(Perl_debug_log, ") ");
2354 if (r->regstclass) {
2355 regprop(sv, r->regstclass);
2356 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2358 if (r->reganch & ROPT_ANCH) {
2359 PerlIO_printf(Perl_debug_log, "anchored");
2360 if (r->reganch & ROPT_ANCH_BOL)
2361 PerlIO_printf(Perl_debug_log, "(BOL)");
2362 if (r->reganch & ROPT_ANCH_MBOL)
2363 PerlIO_printf(Perl_debug_log, "(MBOL)");
2364 if (r->reganch & ROPT_ANCH_GPOS)
2365 PerlIO_printf(Perl_debug_log, "(GPOS)");
2366 PerlIO_putc(Perl_debug_log, ' ');
2368 if (r->reganch & ROPT_GPOS_SEEN)
2369 PerlIO_printf(Perl_debug_log, "GPOS ");
2370 if (r->reganch & ROPT_SKIP)
2371 PerlIO_printf(Perl_debug_log, "plus ");
2372 if (r->reganch & ROPT_IMPLICIT)
2373 PerlIO_printf(Perl_debug_log, "implicit ");
2374 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2375 PerlIO_printf(Perl_debug_log, "\n");
2379 - regprop - printable representation of opcode
2382 regprop(SV *sv, regnode *o)
2384 register char *p = 0;
2419 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2422 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2425 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2452 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2455 #ifdef REGALIGN_STRUCT
2456 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2458 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2462 #ifdef REGALIGN_STRUCT
2463 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2465 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2469 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2472 sv_catpvf(sv, "REF%d", ARG(o));
2475 sv_catpvf(sv, "REFF%d", ARG(o));
2478 sv_catpvf(sv, "REFFL%d", ARG(o));
2481 sv_catpvf(sv, "OPEN%d", ARG(o));
2484 sv_catpvf(sv, "CLOSE%d", ARG(o));
2500 #ifdef REGALIGN_STRUCT
2501 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2507 #ifdef REGALIGN_STRUCT
2508 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2562 sv_catpvf(sv, "GROUPP%d", ARG(o));
2577 FAIL("corrupted regexp opcode");
2582 #endif /* DEBUGGING */
2585 pregfree(struct regexp *r)
2587 if (!r || (--r->refcnt > 0))
2590 Safefree(r->precomp);
2592 Safefree(r->subbase);
2593 if (r->anchored_substr)
2594 SvREFCNT_dec(r->anchored_substr);
2595 if (r->float_substr)
2596 SvREFCNT_dec(r->float_substr);
2598 int n = r->data->count;
2600 switch (r->data->what[n]) {
2602 SvREFCNT_dec((SV*)r->data->data[n]);
2605 op_free((OP_4tree*)r->data->data[n]);
2610 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2613 Safefree(r->data->what);
2616 Safefree(r->startp);
2622 - regnext - dig the "next" pointer out of a node
2624 * [Note, when REGALIGN is defined there are two places in regmatch()
2625 * that bypass this code for speed.]
2628 regnext(register regnode *p)
2630 register I32 offset;
2635 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2651 re_croak2(const char* pat1,const char* pat2,...)
2655 re_croak2(const char* pat1,const char* pat2, va_alist)
2662 STRLEN l1 = strlen(pat1);
2663 STRLEN l2 = strlen(pat2);
2671 Copy(pat1, buf, l1 , char);
2672 Copy(pat2, buf + l1, l2 , char);
2673 buf[l1 + l2 + 1] = '\n';
2674 buf[l1 + l2 + 2] = '\0';
2676 va_start(args, pat2);
2680 message = mess(buf, &args);
2682 l1 = strlen(message);
2685 Copy(message, buf, l1 , char);
2686 buf[l1] = '\0'; /* Overwrite \n */